Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix

DOI10.1007/BF02165413zbMath0185.40203MaRDI QIDQ2536326

G. W. Stewart

Publication date: 1969

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131929

zbMATH Keywords

numerical analysis

Related Items (14)

Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification ⋮ Computational methods of linear algebra ⋮ On the intermediate eigenvalues of symmetric sparse matrices ⋮ A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices ⋮ On the modification of an eigenvalue problem that preserves an eigenspace ⋮ Simultaneous iteration for the matrix eigenvalue problem ⋮ On the efficient and accurate solution of the skew-symmetric eigenvalue problem ⋮ Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm ⋮ Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices ⋮ Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval ⋮ Low-Rank Solution Methods for Stochastic Eigenvalue Problems ⋮ Simultaneous iteration method for symmetric matrices ⋮ The trace minimization method for the symmetric generalized eigenvalue problem

Cites Work

• Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
• An inequality for linear transformations with eigenvalues
• The calculation of Lame polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix