• Corpus ID: 235352773

When does the Lanczos algorithm compute exactly?

  title={When does the Lanczos algorithm compute exactly?},
  author={Dorota Simonov{\'a} and Petr Tich'y},
In theory, the Lanczos algorithm generates an orthogonal basis of the corresponding Krylov subspace. However, in finite precision arithmetic, the orthogonality and linear independence of the computed Lanczos vectors is usually lost quickly. In this paper we study a class of matrices and starting vectors having a special nonzero structure that guarantees exact computations of the Lanczos algorithm whenever floating point arithmetic satisfying the IEEE 754 standard is used. Analogous results are… 
1 Citations
Low-memory Krylov subspace methods for optimal rational matrix function approximation
The Lanczos method for optimal rational matrix function approximation (Lanczos-OR) returns the optimal approximation from a Krylov subspace in a norm induced by the rational function’s denominator, and can be computed using the information from a slightly larger KrylovSubspace.


The Lanczos and conjugate gradient algorithms in finite precision arithmetic
A tribute is paid to those who have made an understanding of the Lanczos and conjugate gradient algorithms possible through their pioneering work, and to review recent solutions of several open problems that have also contributed to knowledge of the subject.
Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
It is demonstrated that finite precision Lanczos and conjugate gradient computations for solving a symmetric positive definite linear system $Ax = b$ or computing the eigenvalues of A behave very
The Stabilization of Weights in the Lanczos and Conjugate Gradient Method
It is proved that for a tight well separated cluster of Ritz values (nodes) an upper bound for the change in the sum of the corresponding weights can be developed that depends mainly on the ratio of the cluster diameter and the gap in the spectrum.
Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
  • W. Wülling
  • Computer Science, Mathematics
    SIAM J. Matrix Anal. Appl.
  • 2005
This paper solves a conjecture posed by Zdenek Strakos and Anne Greenbaum on the clustering of Ritz values, which occurs in finite precision computations, and proves that the conjecture is valid in most cases.
Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
How to make the Lanczos algorithm converge slowly
Abstract : The Paige style Lanczos algorithm is an iterative method for finding a few eigenvalues of large sparse symmetric matrices. Some beautiful relationships among the elements of the
On prescribing the convergence behavior of the conjugate gradient algorithm
  • G. Meurant
  • Mathematics, Computer Science
    Numerical Algorithms
  • 2019
This paper completely characterize the tridiagonal matrices constructed by the Lanczos algorithm and their inverses in terms of the CG residual norms and A -norms of the error.
The block Lanczos method for computing eigenvalues