A new algorithm for solving large-scale generalized eigenvalue problem based on projection methods
From MaRDI portal
Publication:826429
DOI10.1155/2020/8895856zbMath1459.65050OpenAlexW3111027536MaRDI QIDQ826429
Publication date: 4 January 2021
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/8895856
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Convergence analysis of modified iterative methods to solve linear systems
- An analytical method as a preconditioning modeling for systems of linear equations
- A new restarting method in the Lanczos algorithm for generalized eigenvalue problem
- Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
- Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)
- A projection method for generalized eigenvalue problems using numerical integration.
- Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
- On locating clusters of zeros of analytic functions
- A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems
- FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B)
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item