# Package com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary

• Class Summary
Class Description
The Biconjugate Gradient method (BiCG) is useful for solving non-symmetric n-by-n linear systems.
The Biconjugate Gradient Stabilized (BiCGSTAB) method is useful for solving non-symmetric n-by-n linear systems.
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.
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.
The Conjugate Gradient method (CG) is useful for solving a symmetric n-by-n linear system.
The Conjugate Gradient Squared method (CGS) is useful for solving a non-symmetric n-by-n linear system.
GeneralizedConjugateResidualSolver
The Generalized Conjugate Residual method (GCR) is useful for solving a non-symmetric n-by-n linear system.
GeneralizedMinimalResidualSolver
The Generalized Minimal Residual method (GMRES) is useful for solving a non-symmetric n-by-n linear system.
MinimalResidualSolver
The Minimal Residual method (MINRES) is useful for solving a symmetric n-by-n linear system (possibly indefinite or singular).
QuasiMinimalResidualSolver
The Quasi-Minimal Residual method (QMR) is useful for solving a non-symmetric n-by-n linear system.
SteepestDescentSolver
The Steepest Descent method (SDM) solves a symmetric n-by-n linear system.