The Software Scene in the Extraction of Eigenvalues from Sparse Matrices

DOI10.1137/0905042zbMath0573.65025OpenAlexW1973391382MaRDI QIDQ3690957

Beresford N. Parlett

Publication date: 1984

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0905042

zbMATH Keywords

softwarereliabilityefficiencysparse matricesdense matricesLanczosEISPACKuserseigenvalue programssurvey on available software

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Software, source code, etc. for problems pertaining to linear algebra (15-04) Theory of software (68N99)

Related Items

Super-matrix methods ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Some basic information on information-based complexity theory ⋮ A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix ⋮ Numerical solution of the Lyapunov equation by approximate power iteration ⋮ Robust preconditioning of large, sparse, symmetric eigenvalue problems ⋮ An explicit formula for Lanczos polynomials ⋮ A solution procedure for constrained eigenvalue problems and its application within the structural finite-element code NOSA-ITACA ⋮ Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices

Uses Software

• EISPACK