Flexible GPBi-CG for Nonsymmetric Linear Systems
Abstract:We present a flexible version of GPBi-CG algorithm which allows for the use of a different preconditioner at each step of the algorithm.In particular,a result of the flexibility of the variable preconditioner is to use any iterative method.For example,the standard GPBi-CG algorithm itself can be used as a preconditioner,as can other Krylov subspace methods or splitting methods.Numerical experiments are conducted for flexible GPBi-CG for a few matrices including some nonsymmetric matrices.These experiments illustrate the convergence and robustness of the flexible iterative method.
Keywords:Krylov subspace methodflexible preconditioninginner-outer iterationGPBi-CG
Publication Date:2012-01-01
Online Publishing Date:2026-08-28(First online date of this platform, not the publication date of the document)
Pages:5( 25-29 )