### Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal polynomials....

**Page 1**