petsc-3.4.5 2014-06-29


A variant of QMR (quasi minimal residual) developed by Tony Chan

Options Database Keys

see KSPSolve() -

Notes: Supports either left or right preconditioning, but not symmetric

The "residual norm" computed in this algorithm is actually just an upper bound on the actual residual norm. That is for left preconditioning it is a bound on the preconditioned residual and for right preconditioning it is a bound on the true residual.


Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems, Tony F. Chan, Lisette de Pillis, and Henk van der Vorst, Numerical Algorithms, Volume 17, Numbers 1-2 / May, 1998 pp. 51-66.

See Also

KSPCreate(), KSPSetType(), KSPType (for list of available types), KSP, KSPTFQMR

Index of all KSP routines
Table of Contents for all manual pages
Index of all manual pages