Residuals of refined projection methods for large matrix eigenproblems
From MaRDI portal
To compute some eigenpairs of large matrices, refined projection methods have been proposed by the author. In practice, the residual norm of an approximate eigenpair is generally used to test a convergence of the computed eigenpair obtained by a refined projection method. In this paper, an a priori error bound for the residual norm of an approximate eigenpair computed by the residual projection method in terms of the deviations is established. It is interesting and meaningful in better understanding the method.
Recommendations
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- scientific article; zbMATH DE number 3954165
- scientific article; zbMATH DE number 2155134
- A refined Arnoldi type method for large scale eigenvalue problems
- A refined block conjugate gradient method for symmetric eigenvalue problems
Cites work
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A refined subspace iteration algorithm for large sparse eigenproblems
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Composite orthogonal projection methods for large matrix eigenproblems
- Generalized block Lanczos methods for large unsymmetric eigenproblems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- scientific article; zbMATH DE number 805080 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- 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 principle of minimized iterations in the solution of the matrix eigenvalue problem
Cited in
(11)- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- Composite orthogonal projection methods for large matrix eigenproblems
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- A refined Jacobi-Davidson method and its correction equation
- Using cross-product matrices to compute the SVD
- Data Driven Modal Decompositions: Analysis and Enhancements
- scientific article; zbMATH DE number 3954165 (Why is no real title available?)
- scientific article; zbMATH DE number 2155134 (Why is no real title available?)
- A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
This page was built for publication: Residuals of refined projection methods for large matrix eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948754)
