On expansion of search subspaces for large non-Hermitian eigenproblems
From MaRDI portal
Publication:2451702
DOI10.1016/j.laa.2014.04.021zbMath1288.65054OpenAlexW1997927271MaRDI QIDQ2451702
Publication date: 4 June 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.04.021
Arnoldisubspace expansionrefined Ritz vectorinexact matrix-vector productprimitive approximate eigenvector
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items (4)
Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems ⋮ Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices ⋮ On the correction equation of the Jacobi-Davidson method ⋮ Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Absolute and relative perturbation bounds for invariant subspaces of matrices
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
- Optimal expansion of subspaces for eigenvector approximations
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Matrix Algorithms
- Numerical Methods for Large Eigenvalue Problems
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- Numerical methods for large eigenvalue problems
- Sparse matrix test problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- Inexact Krylov Subspace Methods for Linear Systems
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation
- Numerical Analysis and Its Applications
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: On expansion of search subspaces for large non-Hermitian eigenproblems
