Modifier and Type | Class and Description |
---|---|
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.
|
Modifier and Type | Class and Description |
---|---|
class |
GaussSeidelSolver
Similar to the Jacobi method, the Gauss-Seidel method (GS)
solves each equation in sequential order.
|
class |
JacobiSolver
The Jacobi method solves sequentially n equations in a linear
system Ax = b in isolation in each iteration.
|
class |
SuccessiveOverrelaxationSolver
The Successive Overrelaxation method (SOR), is devised by applying
extrapolation to the Gauss-Seidel method.
|
class |
SymmetricSuccessiveOverrelaxationSolver
The Symmetric Successive Overrelaxation method (SSOR) is like
SOR, but it performs in each
iteration one forward sweep followed by one backward sweep.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.