KSPTCQMR#
A variant of a tranpose-free QMR (quasi minimal residual) [CDPVDV98] algorithm
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. For left preconditioning it is a bound on the preconditioned residual norm and for right preconditioning it is a bound on the true residual norm.
This algorithm is related to the standard transpose-free QMR implemented by KSPTFQMR
.
References#
Tony F Chan, Lisette De Pillis, and Henk Van Der Vorst. Transpose-free formulations of lanczos-type methods for nonsymmetric linear systems. Numerical Algorithms, 17:51–66, 1998.
See Also#
KSP: Linear System Solvers, KSPCreate()
, KSPSetType()
, KSPType
, KSP
, KSPTFQMR
Level#
beginner
Location#
src/ksp/ksp/impls/tcqmr/tcqmr.c
Index of all KSP routines
Table of Contents for all manual pages
Index of all manual pages