New insights in GMRES-like methods with variable preconditioners
From MaRDI portal
Publication:1903660
DOI10.1016/0377-0427(94)00067-BzbMath0844.65021MaRDI QIDQ1903660
Publication date: 29 August 1996
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
comparisonsparse linear systemsgeneralized minimal residual methodGMRESRFGMRESGMRES-like methodsminimal residual approximationvariable preconditioners
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (15)
A Krylov subspace type method for Electrical Impedance Tomography ⋮ Multistep matrix splitting iteration preconditioning for singular linear systems ⋮ Numerical solution of the incompressible Navier-Stokes equations by Krylov subspace and multigrid methods ⋮ Heavy Ball Flexible GMRES Method for Nonsymmetric Linear Systems ⋮ A fast implementation for GMRES method ⋮ GMRES algorithms over 35 years ⋮ Preconditioned iteration for saddle-point systems with bound constraints arising in contact problems ⋮ Domain decomposition for the incompressible Navier-Stokes equations: solving subdomain problems accurately and inaccurately ⋮ Efficient preconditioning techniques for finite-element quadratic discretization arising from linearized incompressible Navier-Stokes equations ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ The Krylov accelerated SIMPLE(R) method for flow problems in industrial furnaces ⋮ Solution of the Dirac equation in lattice QCD using a domain decomposition method ⋮ Accelerating scientific computations with mixed precision algorithms ⋮ Relaxation strategies for nested Krylov methods ⋮ A Rational Function Preconditioner For Indefinite Sparse Linear Systems
Uses Software
Cites Work
- Unnamed Item
- The superlinear convergence behaviour of GMRES
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Changing the Norm in Conjugate Gradient Type Algorithms
- GMRESR: a family of nested GMRES methods
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
This page was built for publication: New insights in GMRES-like methods with variable preconditioners