Subspace iteration methods with preconditioning for eigenvalues of very large matrices

zbMATH Open0980.65040MaRDI QIDQ2751211

Henk A. van der Vorst

Publication date: 21 October 2001

zbMATH Keywords

eigenvaluespreconditioningiterative methodslarge sparse matriceseigenpairJacobi-Davidson methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (3)

A refined subspace iteration algorithm for large sparse eigenproblems ⋮ Software for computing eigenvalue bounds for iterative subspace matrix methods ⋮ An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation

This page was built for publication: Subspace iteration methods with preconditioning for eigenvalues of very large matrices

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