A simple iterative algorithm for generating selected eigenspaces of large matrices

DOI10.1088/0305-4470/35/5/101MaRDI QIDQ4533470zbMATH OpenOpenAlexFDO

Authors F. Andreozzi, A. Porrino, N. Lo Iudice

Publication date 11 June 2002

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/physics/0102066

zbMATH Keywords

convergenceeigenspaceseigenvalueseigenvectorsiterative algorithmlarge matricesnumerical examples

Mathematics Subject Classification ID

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

Abstract: We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its efficiency by evaluating computer storage and time requirements and by a few numerical tests.

Recommendations

• A refined subspace iteration algorithm for large sparse eigenproblems
• Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
• scientific article; zbMATH DE number 176177
• An iterative method to solve the algebraic eigenvalue problem
• A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices

Cited in

(5)

• A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices
• A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices
• scientific article; zbMATH DE number 3864382 (Why is no real title available?)
• A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems
• The Niblack-Nigam iterative method revisited

This page was built for publication: A simple iterative algorithm for generating selected eigenspaces of large matrices

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