A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
Global FOM and GMRES algorithms for matrix equations
Applied Numerical Mathematics
Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
SIAM Journal on Scientific Computing
FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning
SIAM Journal on Scientific Computing
Flexible Inner-Outer Krylov Subspace Methods
SIAM Journal on Numerical Analysis
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
| Hi-index | 7.29 |
A variant of the global generalized Hessenberg method is presented which allows varying preconditioning at each restart. Theoretical results that relate the residual norm of this new method with its original version are developed. As two special variants, the flexible global GMRES method and the flexible global CMRH method are investigated both theoretically and experimentally. Numerical examples are conducted to illustrate the performance of these two flexible global methods in comparison with both the original global methods and weighted global methods.