The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
From MaRDI portal
Publication:4671846
DOI10.1090/S0025-5718-04-01684-9zbMath1072.65051MaRDI QIDQ4671846
Publication date: 27 April 2005
Published in: Mathematics of Computation (Search for Journal in Brave)
convergenceperturbation techniqueserror boundsapproximate eigenvaluesharmonic Ritz valueharmonic Ritz vectorharmonic projectionRaleigh quotient matrix
Related Items
The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems, A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems, An invert-free Arnoldi method for computing interior eigenpairs of large matrices, Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems, A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems, Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems, The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited, Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair, Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems, Hybrid iterative refined restarted Lanczos bidiagonalization methods, A new shift strategy for the implicitly restarted refined harmonic Lanczos method, A refined Arnoldi type method for large scale eigenvalue problems, The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems, Computing the smallest singular triplets of a large matrix, The least squares and line search in extracting eigenpairs in Jacobi-Davidson method, Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils, Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method, Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning, Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems, A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces, Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems, A note on harmonic Ritz values and their reciprocals, On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, A generalization of Saad's bound on harmonic Ritz vectors of Hermitian matrices, A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
Uses Software
Cites Work
- Unnamed Item
- 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
- Generalized block Lanczos methods for large unsymmetric eigenproblems
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- A new family of block methods
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- A refined subspace iteration algorithm for large sparse eigenproblems
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Matrix Algorithms
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- 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
