On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
From MaRDI portal
The incomplete generalized minimal residual method (IGMRES) is studied, which is based on an incomplete orthogonalization of the Krylov vectors, and gives an approximate or quasi-minimal residual solution over the Kyrlov space. Convergence analysis is given and a numerical experiment is reported.
Recommendations
Cites work
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 1829268 (Why is no real title available?)
- scientific article; zbMATH DE number 1226273 (Why is no real title available?)
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
- Reduced storage matrix methods in stiff ODE systems
Cited in
(7)- A block incomplete orthogonalization method for large nonsymmetric eigenproblems
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- IMinpert: An incomplete minimum perturbation algorithm for large unsymmetric linear systems
- On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
- The convergence of Krylov subspace methods for large unsymmetric linear systems
- scientific article; zbMATH DE number 1735425 (Why is no real title available?)
- Incompletely orthogonal variable restart parameter H-IGMRES (m) algorithm
This page was built for publication: On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286717)
