An analysis of the Rayleigh-Ritz method for approximating eigenspaces
From MaRDI portal
This paper concerns the computation of approximations to an eigenspace \({\mathcal X}\) of a general matrix \(A\) without the assumptions that the eigenvalues of \(A\) are distinct or that \(A\) is diagonalizable. Using a subspace \({\mathcal W}\) containing an approximation to \({\mathcal X}\), the method produces Ritz pairs \((N,\widetilde X)\) approximating \((L,X)\), \(X\) a basis of \({\mathcal X}\). Under a ``uniform separation condition and with uniform adjustment it converges linearly as the sine and the angle between \({\mathcal X}\) and \({\mathcal W}\) approaches zero (and without that condition when \(\dim{\mathcal X}=1\)). Alternatively, convergence without that condition is obtained for ``refined Ritz vectors.
Recommendations
- On the stability of the Rayleigh-Ritz method for eigenvalues
- Convergence of the Rayleigh-Ritz method for eigenvalue problems.
- An a posteriori error estimation of the Rayleigh-Ritz eigenvalues
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- scientific article; zbMATH DE number 3861905
- Eigen-analysis using optimization with Rayleigh's quotient
- Asymptotic error estimates for Rayleigh-Ritz-approximations of selfadjoint eigenvalue problems
- scientific article; zbMATH DE number 4066239
- scientific article; zbMATH DE number 4070450
Cites work
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Absolute and relative perturbation bounds for invariant subspaces of matrices
- An optimal bound for the spectral variation of two matrices
- Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 805080 (Why is no real title available?)
- Numerical methods for large eigenvalue problems
- 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
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- The modified quadrature method for classical pseudodifferential equations of negative order on smooth closed curves
Cited in
(69)- Deflation in Krylov subspace methods and distance to uncontrollability
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- On the use of harmonic Ritz pairs in approximating internal eigenpairs
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- An Elsner-like perturbation theorem for generalized eigenvalues
- A refined Arnoldi type method for large scale eigenvalue problems
- A new inequality for the Hausdorff distance between spectra of two matrices
- Multiscale modal analysis of fully-loaded spent nuclear fuel canisters
- The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
- On a new variant of Arnoldi method for approximation of eigenpairs
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Arnoldi method for large quaternion right eigenvalue problem
- On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems
- On expansion of search subspaces for large non-Hermitian eigenproblems
- Optimal expansion of subspaces for eigenvector approximations
- On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices
- A refined Jacobi-Davidson method and its correction equation
- Using cross-product matrices to compute the SVD
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
- Orthogonal projection method for eigenpair derivatives of large symmetric matrices
- Rayleigh-Ritz approximation for the linear response eigenvalue problem
- Data Driven Modal Decompositions: Analysis and Enhancements
- A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- Sharpness in rates of convergence for the symmetric Lanczos method
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- scientific article; zbMATH DE number 69499 (Why is no real title available?)
- Computation of eigenpair partial derivatives by Rayleigh-Ritz procedure
- Dynamic Condition Estimation and Rayleigh–Ritz Approximation
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- What is the Wigner function closest to a given square integrable function?
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Optimal a priori error bounds for the Rayleigh-Ritz method
- Convergence of the block Lanczos method for eigenvalue clusters
- On the subspace projected approximate matrix method.
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- The convergence of harmonic Ritz vectors and harmonic Ritz values, revisited
- Krylov-Schur-type restarts for the two-sided Arnoldi method
- A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems
- A generalization of Saad's theorem on Rayleigh-Ritz approximations
- Residuals of refined projection methods for large matrix eigenproblems
- Hybrid eigensolvers for nuclear configuration interaction calculations
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- An efficient reduced‐order method for stochastic eigenvalue analysis
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs
- A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix
- Sharp error bounds for approximate eigenvalues and singular values from subspace methods
- Localized subspace iteration methods for multiscale problems
- A power-like method for computing the dominant eigenpairs of large scale real skew-symmetric matrices
- A convergence analysis on the iterative trace ratio algorithm and its refinements
- A subspace method for large-scale trace ratio problems
- Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- An analysis of the Rayleigh-Ritz and refined Rayleigh-Ritz methods for regular nonlinear eigenvalue problems
- The Refined Joint Bidiagonalization Method and an Implicitly Restarted Algorithm for Large GSVD Computations
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
- An Arnoldi-type algorithm for computing Page Rank
- FOM accelerated by an extrapolation method for solving PageRank problems
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods
This page was built for publication: An analysis of the Rayleigh-Ritz method for approximating eigenspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701555)
