Towards a black box Lanczos program

DOI10.1016/0010-4655(89)90158-6zbMath0798.65054OpenAlexW1971190336MaRDI QIDQ1330638

Beresford N. Parlett, Bahram Nour-Omid

Publication date: 21 July 1994

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(89)90158-6

zbMATH Keywords

eigenvalueseigenvectorsLanczos algorithmblack box programlarge matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Implementing Lanczos-like algorithms on hypercube architectures ⋮ Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation ⋮ Analytical Lanczos method: Quantum eigenstates of anharmonic oscillators in one or more dimensions ⋮ Nonadiabatic processes in condensed matter: Semi-classical theory and implementation ⋮ Iterative methods for the computation of a few eigenvalues of a large symmetric matrix ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem

Cites Work

• Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
• The use of a refined error bound when updating eigenvalues of tridiagonals
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• The Lanczos Algorithm With Partial Reorthogonalization
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
• The Lanczos Algorithm with Selective Orthogonalization
• Estimates for Some Computational Techniques in Linear Algebra

This page was built for publication: Towards a black box Lanczos program