Modern methods for the iterative computation of eigenpairs of matrices of high dimension

DOI10.1002/ZAMM.200310126zbMath1055.65051OpenAlexW2099169296MaRDI QIDQ4812403

Henk A. van der Vorst

Publication date: 20 August 2004

Published in: ZAMM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.200310126

zbMATH Keywords

algorithmsnumerical exampleseigenvalue problemiterative methodsKrylov subspace methodJacobi-Davidson methodNewton type methodsArnoldi methodquadratic eigenproblems

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)

Related Items (2)

The Jacobi-Davidson method ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc

Uses Software

• JDQR
• JDQZ

This page was built for publication: Modern methods for the iterative computation of eigenpairs of matrices of high dimension