class |
BiconjugateGradientSolver |
The Biconjugate Gradient method (BiCG) is useful for solving non-symmetric
n-by-n linear systems.
|
class |
BiconjugateGradientStabilizedSolver |
The Biconjugate Gradient Stabilized (BiCGSTAB) method is useful for solving
non-symmetric n-by-n linear systems.
|
class |
ConjugateGradientNormalErrorSolver |
For an under-determined system of linear equations, Ax = b, or
when the coefficient matrix A is non-symmetric and nonsingular,
the normal equation matrix AAt is symmetric and
positive definite, and hence CG is applicable.
|
class |
ConjugateGradientNormalResidualSolver |
For an under-determined system of linear equations, Ax = b, or
when the coefficient matrix A is non-symmetric and nonsingular,
the normal equation matrix AAt is symmetric and
positive definite, and hence CG is applicable.
|
class |
ConjugateGradientSolver |
The Conjugate Gradient method (CG) is useful for solving a symmetric n-by-n
linear system.
|
class |
ConjugateGradientSquaredSolver |
The Conjugate Gradient Squared method (CGS) is useful for solving
a non-symmetric n-by-n linear system.
|
class |
GeneralizedConjugateResidualSolver |
The Generalized Conjugate Residual method (GCR) is useful for solving
a non-symmetric n-by-n linear system.
|
class |
GeneralizedMinimalResidualSolver |
The Generalized Minimal Residual method (GMRES) is useful for solving a non-symmetric n-by-n
linear system.
|
class |
MinimalResidualSolver |
The Minimal Residual method (MINRES) is useful for solving a symmetric n-by-n linear system
(possibly indefinite or singular).
|
class |
QuasiMinimalResidualSolver |
The Quasi-Minimal Residual method (QMR) is useful for solving a non-symmetric n-by-n linear
system.
|
class |
SteepestDescentSolver |
The Steepest Descent method (SDM) solves a symmetric n-by-n linear system.
|