On expansion of search subspaces for large non-Hermitian eigenproblems
DOI10.1016/J.LAA.2014.04.021zbMATH Open1288.65054OpenAlexW1997927271MaRDI QIDQ2451702FDOQ2451702
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
Recommendations
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
- Optimal expansion of subspaces for eigenvector approximations
- A generalisation of the Rayleigh-Ritz approximation
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A refined subspace iteration algorithm for large sparse eigenproblems
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)
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Templates for the Solution of Algebraic Eigenvalue Problems
- Title not available (Why is that?)
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Computational methods for large eigenvalue problems
- 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
- Inexact Krylov Subspace Methods for Linear Systems
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Title not available (Why is that?)
- Sparse matrix test problems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Optimal expansion of subspaces for eigenvector approximations
- Absolute and relative perturbation bounds for invariant subspaces of matrices
- Title not available (Why is that?)
- Numerical Analysis and Its Applications
Cited In (6)
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
- Title not available (Why is that?)
- Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices
- Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems
- Feast eigensolver for non-Hermitian problems
- On the correction equation of the Jacobi-Davidson method
Uses Software
This page was built for publication: On expansion of search subspaces for large non-Hermitian eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451702)
