Name | Description | Type | Package | Framework |
BiconjugateGradientSolver | The Biconjugate Gradient method (BiCG) is useful for solving non-symmetric n-by-n linear systems. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
BiconjugateGradientStabilizedSolver | The Biconjugate Gradient Stabilized (BiCGSTAB) method is useful for solving non-symmetric n-by-n linear systems. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
ConjugateGradientNormalErrorSolver | For an under-determined system of linear equations, Ax = b, or when the coefficient matrix A is non-symmetric and nonsingular, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
ConjugateGradientNormalResidualSolver | For an under-determined system of linear equations, Ax = b, or when the coefficient matrix A is non-symmetric and nonsingular, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
ConjugateGradientSolver | The Conjugate Gradient method (CG) is useful for solving a symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
ConjugateGradientSquaredSolver | The Conjugate Gradient Squared method (CGS) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
GeneralizedConjugateResidualSolver | The Generalized Conjugate Residual method (GCR) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
GeneralizedMinimalResidualSolver | The Generalized Minimal Residual method (GMRES) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
MinimalResidualSolver | The Minimal Residual method (MINRES) is useful for solving a symmetric n-by-n linear system (possibly indefinite or singular). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
QuasiMinimalResidualSolver | The Quasi-Minimal Residual method (QMR) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
SteepestDescentSolver | The Steepest Descent method (SDM) solves a symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |