A fast implementation for GMRES method
From MaRDI portal
For the popular generalized minimal residual (GMRES) iteration method a new and simple implementation is presented, which has the property of not using Givens rotations. By this modification the Arnoldi process is not modified and this new method has advantages in both computation cost and storage reqirements. The corresponding restarted version of the GMRES method is also considered.
Recommendations
Cites work
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Restarted GMRES Method Augmented with Eigenvectors
- A simpler GMRES
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Complex conjugate gradient methods
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Expanded systems and the ILU preconditioner for solving non-Hermitian linear systems
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- GMRES On (Nearly) Singular Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRESR: a family of nested GMRES methods
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Least Squares Computations by Givens Transformations Without Square Roots
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- New insights in GMRES-like methods with variable preconditioners
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Solution of sparse rectangular systems using LSQR and Craig
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(17)- Implementations of the GMRES method
- The GMRES method improved by securing fast wave propagation
- Fully coupled flow-induced vibration of structures under small deformation with GMRES method
- GMRES algorithms over 35 years
- scientific article; zbMATH DE number 1618000 (Why is no real title available?)
- Fast solution of periodic integral equations by GMRES
- A new implementation of GMRES using generalized Purcell method
- Wideband fast multipole boundary element method: Application to acoustic scattering from aerodynamic bodies
- GMRES Acceleration of Restricted Schwarz Iterations
- scientific article; zbMATH DE number 434530 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- How to Make Simpler GMRES and GCR More Stable
- GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
- A Newton basis GMRES implementation
- scientific article; zbMATH DE number 1174460 (Why is no real title available?)
- An Efficient Variant of the GMRES(m) Method Based on the Error Equations
- A new computational GMRES method
This page was built for publication: A fast implementation for GMRES method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414304)
