Use of the Lanczos Method for Finding Complete Sets of Eigenvalues of Large Sparse Symmetric Matrices

DOI10.1093/imamat/23.3.277zbMath0398.65018OpenAlexW1984772310MaRDI QIDQ4181887

John T. Edwards, D. C. Licciardello, David J. Thouless

Publication date: 1979

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/23.3.277

zbMATH Keywords

EigenvaluesEmpirical ObservationsLanczos MethodLarge Sparse Symmetric Matrices

Mathematics Subject Classification ID

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

Related Items (6)

Inversion of the fermion matrix and the equivalence of the conjugate gradient and Lanczos algorithms ⋮ The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization ⋮ Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem ⋮ Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization ⋮ Sparse matrices ⋮ A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems

This page was built for publication: Use of the Lanczos Method for Finding Complete Sets of Eigenvalues of Large Sparse Symmetric Matrices