Preconditioned iterative methods for the large sparse symmetric eigenvalue problem

DOI10.1016/0045-7825(82)90007-XMaRDI QIDQ1161242zbMATH OpenOpenAlexFDO

Authors J. Shanehchi, D. 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

extreme eigenvalueslarge sparse symmetric eigenvalue problempreconditioned iterative methodsRayleigh quotient

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 176177 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• Iterative eigenvalue algorithms based on convergent splittings
• On the preconditioned Jacobi method for solving large linear systems
• 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1161242)