public class CSJSqaureMatrixEqnDoubleSolver extends BaseCSJEqnDoubleSolver
aMatrix, eqnCSJ_Order, CSJ_Tolfactored| Constructor and Description |
|---|
CSJSqaureMatrixEqnDoubleSolver(ISparseEqnDouble eqn) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
factorization(double tolerance)
LU decomposition of the [A] matrix.
|
void |
solveEqn()
Solve the [A]X = B problem, assume that [A] is LUed
|
double[] |
solveEqn(double[] b)
Solve the [A]X = B problem, assume that [A] is LUed
|
buildAMatrixsolveEqnfactorization, setMatrixDirtyclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitfactorization, setMatrixDirtypublic CSJSqaureMatrixEqnDoubleSolver(ISparseEqnDouble eqn)
public void solveEqn()
throws IpssNumericException
IpssNumericExceptionpublic double[] solveEqn(double[] b)
throws IpssNumericException
solveEqn in interface ISparseEqnSolversolveEqn in class BaseSparseEqnSolverb - the b vectorIpssNumericExceptionpublic boolean factorization(double tolerance)
throws IpssNumericException
factorization in interface ISparseEqnSolverfactorization in class BaseSparseEqnSolvertolerance - the tolerance for matrix singular detection, not used for this
implementationIpssNumericException