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

Class Summary

BiconjugateGradientSolver	The Biconjugate Gradient method (BiCG) is useful for solving non-symmetric n-by-n linear systems.
BiconjugateGradientStabilizedSolver	The Biconjugate Gradient Stabilized (BiCGSTAB) method is useful for solving non-symmetric n-by-n linear systems.
ConjugateGradientNormalErrorSolver	The Conjugate Gradient method (CG) can be applied on the normal equations.
ConjugateGradientNormalResidualSolver	The Conjugate Gradient method (CG) can be applied on the normal equations.
ConjugateGradientSolver	The Conjugate Gradient method (CG) is useful for solving symmetric n-by-n linear systems.
ConjugateGradientSquaredSolver	The Conjugate Gradient Squared method (CGS) is useful for solving non-symmetric n-by-n linear systems.
GeneralizedConjugateResidualSolver	The Generalized Conjugate Residual method (GCR) is useful for solving non-symmetric n-by-n linear systems, like GMRES.
GeneralizedMinimalResidualSolver	The Generalized Minimal Residual method (GMRES) is useful for solving non-symmetric n-by-n linear systems.
MinimalResidualSolver	The Minimal Residual method (MINRES) is useful for solving symmetric n-by-n linear systems (possibly indefinite or singular).
QuasiMinimalResidualSolver	The Quasi-Minimal Residual method (QMR) is useful for solving non-symmetric n-by-n linear systems.
SteepestDescentSolver	The Steepest Descent method (SDM) can solve symmetric n-by-n linear systems.