1993
DOI: 10.1137/0914028
|View full text |Cite
|
Sign up to set email alerts
|

A Flexible Inner-Outer Preconditioned GMRES Algorithm

Abstract: We present a variant of the GMRES algorithm which allows changes in the preconditioning at every step. There are many possible applications of the new algorithm some of which are brie y discussed. In particular, a result of the exibility of the new variant is that any iterative method can be used as a preconditioner. For example, the standard GMRES algorithm itself can be used as a preconditioner, as can CGNR (or CGNE) the conjugate gradient method applied to the normal equations. However, the more appealing u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
817
0
10

Year Published

1996
1996
2011
2011

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 1,199 publications
(830 citation statements)
references
References 4 publications
3
817
0
10
Order By: Relevance
“…The most efficient iterative solvers available today include Krylov subspace methods, such as GMRES and BICGSTAB [30], and multigrid methods. In our work, we employ a Flexible GMRES (FGMRES) solver [31] to solve the Poisson equation. Typically a GMRES solver is used together with a pre-conditioner, such as Jacobi, SOR, incomplete LU (ILU) decomposition [32], etc., in order to improve its robustness and efficiency.…”
Section: Solution Of the Pressure-correction Equationmentioning
confidence: 99%
“…The most efficient iterative solvers available today include Krylov subspace methods, such as GMRES and BICGSTAB [30], and multigrid methods. In our work, we employ a Flexible GMRES (FGMRES) solver [31] to solve the Poisson equation. Typically a GMRES solver is used together with a pre-conditioner, such as Jacobi, SOR, incomplete LU (ILU) decomposition [32], etc., in order to improve its robustness and efficiency.…”
Section: Solution Of the Pressure-correction Equationmentioning
confidence: 99%
“…[29] for a general introduction on Krylov subspace methods and to [29,Section 10] and [25,Section 9.4] for a review on flexible methods. The minimum residual norm GMRES method [26] has been extended by Saad [23] to allow variable preconditioning. The resulting algorithm known as FGMRES(m) relies on the Arnoldi relation…”
Section: General Settingmentioning
confidence: 99%
“…See also [1,Section 12.3] for additional references. Since then, numerous methods have been proposed to address the symmetric, non-symmetric or non-Hermitian cases; these include Flexible Conjugate Gradient [19], Flexible GMRES (FGMRES) [23], Flexible QMR [31] and GMRESR [34] among others. This class of methods is required when preconditioning with a different (possibly nonlinear) operator at each iteration of a subspace method is considered.…”
Section: Introductionmentioning
confidence: 99%
“…The approximate solution to Ac = r i then becomes the next direction for the outer approximate space. Note that flexible GMRES (FGMRES) method [18] can also be view as a method that approximates solutions to similar residual equations at each step. Different from GMRESR method, the inner and outer iterative methods in FGMRES are both GMRES.…”
Section: Acceleration Techniques For Gmresmentioning
confidence: 99%