The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures

DOI10.1016/0168-9274(93)90099-DzbMath0782.65053OpenAlexW2122400834MaRDI QIDQ685964

Merrell L. Patrick, Mark T. Jones

Publication date: 6 October 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(93)90099-d

zbMATH Keywords

generalized eigenvalue problemLanczos algorithmPerformance resultsmultivector processorshared-memory architectures

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS ⋮ RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES

Cites Work

• 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
• A class of Lanczos-like algorithms implemented on parallel computers
• The Lanczos Algorithm With Partial Reorthogonalization
• Lanczos versus subspace iteration for solution of eigenvalue problems
• How to Implement the Spectral Transformation
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• Solution of Sparse Indefinite Systems of Linear Equations
• Unrolling loops in fortran