On an iterative method for finding lovver eigenvalues

DOI10.1515/RNAM.1992.7.6.473MaRDI QIDQ4697664zbMATH OpenOpenAlexWikidataFDO

Authors Evgeniĭ Dyakonov, Andrew Knyazev

Publication date 8 May 1995

Published in Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rnam.1992.7.6.473

zbMATH Keywords

cluster of eigenvalueseigenvectorslarge sparse symmetric eigenvalue problemorthogonalizationpreconditioned iterations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Recommendations

• scientific article; zbMATH DE number 48355
• scientific article; zbMATH DE number 176177
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• Accelerated simultaneous iterations for large finite element eigenproblems

Cited in

(7)

• Kron's method for symmetric eigenvalue problems
• Domain decomposition methods for eigenvalue problems
• A geometric theory for preconditioned inverse iteration applied to a subspace
• scientific article; zbMATH DE number 4013867 (Why is no real title available?)
• Overlapping Schwarz preconditioned eigensolvers for spectral element discretizations
• scientific article; zbMATH DE number 749497 (Why is no real title available?)
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation

This page was built for publication: On an iterative method for finding lovver eigenvalues

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