An analysis of the Rayleigh--Ritz method for approximating eigenspaces
From MaRDI portal
Publication:2701555
DOI10.1090/S0025-5718-00-01208-4zbMath0968.65020MaRDI QIDQ2701555
Publication date: 19 February 2001
Published in: Mathematics of Computation (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
Optimal a priori error bounds for the Rayleigh-Ritz method, An Elsner-like perturbation theorem for generalized eigenvalues, Data Driven Modal Decompositions: Analysis and Enhancements, An invert-free Arnoldi method for computing interior eigenpairs of large matrices, An Arnoldi-type algorithm for computing Page Rank, 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, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited, Krylov--Schur-Type Restarts for the Two-Sided Arnoldi Method, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, Multiscale modal analysis of fully-loaded spent nuclear fuel canisters, Hybrid eigensolvers for nuclear configuration interaction calculations, On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems, 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, An efficient reduced‐order method for stochastic eigenvalue analysis, Computation of eigenpair partial derivatives by Rayleigh-Ritz procedure, FOM accelerated by an extrapolation method for solving PageRank problems, 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, On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems, A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems., 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 expansion of search subspaces for large non-Hermitian eigenproblems, Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method, On a new variant of Arnoldi method for approximation of eigenpairs, A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems, Convergence of the block Lanczos method for eigenvalue clusters, On the subspace projected approximate matrix method., Optimal expansion of subspaces for eigenvector approximations, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices, Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems, Deflated block Krylov subspace methods for large scale eigenvalue problems, A refined Jacobi-Davidson method and its correction equation, A generalization of Saad's theorem on Rayleigh-Ritz approximations, Sharpness in rates of convergence for the symmetric Lanczos method, The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors, Residuals of refined projection methods for large matrix eigenproblems, A new inequality for the Hausdorff distance between spectra of two matrices, Using cross-product matrices to compute the SVD, What is the Wigner Function Closest to a Given Square Integrable Function?, Arnoldi method for large quaternion right eigenvalue problem, On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations, An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems, Deflation in Krylov subspace methods and distance to uncontrollability, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, 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, Orthogonal projection method for eigenpair derivatives of large symmetric matrices, A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
Uses Software
Cites Work
- Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix
- An optimal bound for the spectral variation of two matrices
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- The modified quadrature method for classical pseudodifferential equations of negative order on smooth closed curves
- 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
- Absolute and relative perturbation bounds for invariant subspaces of matrices
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
