Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary Classes and Interfaces - 11 results found.
NameDescriptionTypePackageFramework
BiconjugateGradientSolverThe Biconjugate Gradient method (BiCG) is useful for solving non-symmetric n-by-n linear systems.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
BiconjugateGradientStabilizedSolverThe Biconjugate Gradient Stabilized (BiCGSTAB) method is useful for solving non-symmetric n-by-n linear systems.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
ConjugateGradientNormalErrorSolverFor an under-determined system of linear equations, Ax = b, or when the coefficient matrix A is non-symmetric and nonsingular,Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
ConjugateGradientNormalResidualSolverFor an under-determined system of linear equations, Ax = b, or when the coefficient matrix A is non-symmetric and nonsingular,Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
ConjugateGradientSolverThe Conjugate Gradient method (CG) is useful for solving a symmetric n-by-n linear system.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
ConjugateGradientSquaredSolverThe Conjugate Gradient Squared method (CGS) is useful for solving a non-symmetric n-by-n linear system.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
GeneralizedConjugateResidualSolverThe Generalized Conjugate Residual method (GCR) is useful for solving a non-symmetric n-by-n linear system.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
GeneralizedMinimalResidualSolverThe Generalized Minimal Residual method (GMRES) is useful for solving a non-symmetric n-by-n linear system.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
MinimalResidualSolverThe Minimal Residual method (MINRES) is useful for solving a symmetric n-by-n linear system (possibly indefinite or singular).Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
QuasiMinimalResidualSolverThe Quasi-Minimal Residual method (QMR) is useful for solving a non-symmetric n-by-n linear system.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu
SteepestDescentSolverThe Steepest Descent method (SDM) solves a symmetric n-by-n linear system.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationarySuanShu