Preconditioned iterative methods for the large sparse symmetric eigenvalue problem

DOI10.1016/0045-7825(82)90007-XzbMath0478.65021OpenAlexW2055855726MaRDI QIDQ1161242

J. Shanehchi, David J. Evans

Publication date: 1982

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(82)90007-x

zbMATH Keywords

Rayleigh quotientextreme eigenvaluespreconditioned iterative methodslarge sparse symmetric eigenvalue problem

Mathematics Subject Classification ID

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

Related Items (3)

An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices ⋮ Convergence analysis of preconditioned AOR iterative method for linear systems ⋮ Relaxation techniques in the iterative '2\(\times 2'\) algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the preconditioned Jacobi method for solving large linear systems
• Iterative eigenvalue algorithms based on convergent splittings
• 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices

This page was built for publication: Preconditioned iterative methods for the large sparse symmetric eigenvalue problem