Residuals of refined projection methods for large matrix eigenproblems
From MaRDI portal
Publication:5948754
DOI10.1016/S0898-1221(00)00321-7zbMath0984.65036MaRDI QIDQ5948754
Publication date: 12 November 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Related Items (5)
Data Driven Modal Decompositions: Analysis and Enhancements ⋮ A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. ⋮ A refined Jacobi-Davidson method and its correction equation ⋮ Using cross-product matrices to compute the SVD ⋮ The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Generalized block Lanczos methods for large unsymmetric eigenproblems
- 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
- Composite orthogonal projection methods for large matrix eigenproblems
- A refined subspace iteration algorithm for large sparse eigenproblems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: Residuals of refined projection methods for large matrix eigenproblems
