The Lanczos algorithm uses a three-term recurrence to construct an orthonormal basis for the Krylov space corresponding to a symmetric matrix A and a nonzero starting vector φ. The vectors and recurrence coefficients produced by this algorithm can be used for a number of purposes, including solving linear systems Au= φ and computing the matrix exponential e-tA φ. Although the vectors produced in finite precision arithmetic are not orthogonal, we show why they can still be used effectively for these purposes.
No takes yet. Share an insight, caveat, or question.
Druskin et al. (1998) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: