On the use of harmonic Ritz pairs in approximating internal eigenpairs
From MaRDI portal
Publication:1855434
DOI10.1016/S0024-3795(01)00480-3zbMath1028.65030MaRDI QIDQ1855434
Gerard L. G. Sleijpen, Jasper van den Eshof
Publication date: 5 February 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithms; error analysis; eigenvectors; real symmetric matrices; harmonic Ritz vector; block Arnoldi process; internal eigenpair; refined Rayleigh-Ritz
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
On the subspace projected approximate matrix method., On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing interior eigenvalues of large matrices
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Harmonic Ritz and Lehmann bounds
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Zur Verwendung optimaler Eigenwerteingrenzungen bei der Lösung symmetrischer Matrizenaufgaben
- Optimale Eigenwerteinschließungen
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
- Optimal a priori error bounds for the Rayleigh-Ritz method
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Estimates for Some Computational Techniques in Linear Algebra