A fast implementation for GMRES method
From MaRDI portal
Publication:1414304
DOI10.1016/S0377-0427(03)00534-XzbMath1032.65026OpenAlexW2148804877MaRDI QIDQ1414304
Publication date: 20 November 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(03)00534-x
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (5)
Wideband fast multipole boundary element method: Application to acoustic scattering from aerodynamic bodies ⋮ GMRES implementations and residual smoothing techniques for solving ill-posed linear systems ⋮ GMRES algorithms over 35 years ⋮ A new computational GMRES method ⋮ Fully coupled flow-induced vibration of structures under small deformation with GMRES method
Cites Work
- Unnamed Item
- Unnamed Item
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Complex conjugate gradient methods
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- New insights in GMRES-like methods with variable preconditioners
- Solution of sparse rectangular systems using LSQR and Craig
- Expanded systems and the ILU preconditioner for solving non-Hermitian linear systems
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- GMRES On (Nearly) Singular Systems
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Least Squares Computations by Givens Transformations Without Square Roots
- A Restarted GMRES Method Augmented with Eigenvectors
- GMRESR: a family of nested GMRES methods
- A simpler GMRES
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: A fast implementation for GMRES method