How to Make the Lanczos Algorithm Converge Slowly
From MaRDI portal
Publication:4191506
DOI10.2307/2006038zbMath0405.65016OpenAlexW4230134691MaRDI QIDQ4191506
Publication date: 1979
Full work available at URL: https://doi.org/10.2307/2006038
Related Items (11)
Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix ⋮ Some basic information on information-based complexity theory ⋮ When does the Lanczos algorithm compute exactly? ⋮ Refined interlacing properties for zeros of paraorthogonal polynomials on the unit circle ⋮ Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences ⋮ The behavior of the Gauss-Radau upper bound of the error norm in CG ⋮ Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem ⋮ Sparse matrices ⋮ Sharpness in rates of convergence for the symmetric Lanczos method ⋮ On a formula of Thompson and McEnteggert for the adjugate matrix ⋮ Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
Cites Work
This page was built for publication: How to Make the Lanczos Algorithm Converge Slowly