A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
From MaRDI portal
Publication:898927
DOI10.1016/j.cam.2015.09.014zbMath1342.65113MaRDI QIDQ898927
R. Astudillo, Martin B. van Gijzen
Publication date: 21 December 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.09.014
polynomial filter; eigenpairs approximation; implicitly restarting; induced dimension reduction method
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Induced Dimension Reduction Method to Solve the Quadratic Eigenvalue Problem, Accelerating the induced dimension reduction method using spectral information, A Hessenberg-type algorithm for computing PageRank problems, Iterative processes in the Krylov-Sonneveld subspaces
Uses Software
Cites Work
- Unnamed Item
- On the generation of Krylov subspace bases
- Bi-CGSTAB as an induced dimension reduction method
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- Implicitly Restarted Arnoldi Methods and Subspace Iteration
- A Krylov--Schur Algorithm for Large Eigenproblems
- Eigenvalue Computations Based on IDR
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
- Algorithm 913
- Numerical Methods for Large Eigenvalue Problems
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- A Newton basis GMRES implementation
- ARPACK Users' Guide
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- On the Convergence Behavior of IDR($s$) and Related Methods
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
