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

DOI10.1002/ZAMM.200310126zbMATH Open1055.65051OpenAlexW2099169296MaRDI QIDQ4812403FDOQ4812403

Authors: 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

Recommendations

• Subspace iteration methods with preconditioning for eigenvalues of very large matrices
• Numerical solution of linear eigenvalue problems
• Computational methods for large eigenvalue problems
• An overview on the eigenvalue computation for matrices
• The two-phase method for finding a great number of eigenpairs of the symmetric or weakly non-symmetric large eigenvalue problems

zbMATH Keywords

algorithmsnumerical exampleseigenvalue problemiterative methodsKrylov subspace methodArnoldi methodJacobi-Davidson methodNewton type methodsquadratic 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)

Cited In (8)

• A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
• Numerical solution of linear eigenvalue problems
• Title not available (Why is that?)
• A new characterization of Elfving's method for high dimensional computation
• Algebraic eigenvalue problem modelling via high dimensional model representation
• An overview on the eigenvalue computation for matrices
• The Jacobi-Davidson method
• Approximating matrix eigenvalues by subspace iteration with repeated random sparsification

Uses Software

• JDQR
• JDQZ

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

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