On expansion of search subspaces for large non-Hermitian eigenproblems
From MaRDI portal
Publication:2451702
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
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1138094 (Why is no real title available?)
- scientific article; zbMATH DE number 1855873 (Why is no real title available?)
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Absolute and relative perturbation bounds for invariant subspaces of matrices
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Computational methods for large eigenvalue problems
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Inexact Krylov Subspace Methods for Linear Systems
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical Analysis and Its Applications
- Numerical methods for large eigenvalue problems
- Numerical methods for large eigenvalue problems
- On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
- Optimal expansion of subspaces for eigenvector approximations
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Sparse matrix test problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation
Cited in
(6)- Feast eigensolver for non-Hermitian problems
- scientific article; zbMATH DE number 2152273 (Why is no real title available?)
- Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems
- Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices
- On the correction equation of the Jacobi-Davidson method
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
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)