com.interpss.core.sparse.solver.csj

Class CSJLeastSquareDoubleSolver

java.lang.Object

com.interpss.core.sparse.solver.BaseSparseEqnSolver

com.interpss.core.sparse.solver.csj.BaseCSJSparseEqnSolver

com.interpss.core.sparse.solver.csj.BaseCSJEqnDoubleSolver

com.interpss.core.sparse.solver.csj.CSJLeastSquareDoubleSolver

All Implemented Interfaces:

ICSJSparseEqnSolver, ISparseEqnSolver

Direct Known Subclasses:

CSJWeightedLeastSquareDoubleSolver

public class CSJLeastSquareDoubleSolver
extends BaseCSJEqnDoubleSolver

Sparse Equation solver implementation of data type double for solving the LeastSquare problem.

Field Summary

Fields

Modifier and Type	Field and Description
protected edu.emory.mathcs.csparsej.tdouble.Dcs_common.Dcsn	numericTable
protected int	order
protected edu.emory.mathcs.csparsej.tdouble.Dcs_common.Dcss	symbolTable
protected boolean	weightedLS

Fields inherited from class com.interpss.core.sparse.solver.csj.BaseCSJEqnDoubleSolver

aMatrix, eqn

Fields inherited from class com.interpss.core.sparse.solver.csj.BaseCSJSparseEqnSolver

CSJ_Order, CSJ_Tol

Fields inherited from class com.interpss.core.sparse.solver.BaseSparseEqnSolver

factored

Constructor Summary

Constructors

Constructor and Description
CSJLeastSquareDoubleSolver(ISparseEqnDouble eqn, int order)

Method Summary

Modifier and Type	Method and Description
boolean	factorization() QR factorization of the [A] matrix.
void	solveEqn() Solve the [A]X = B problem
double[]	solveEqn(double[] b) Solve the [A]X = B problem, assume that [A] is factorized

Methods inherited from class com.interpss.core.sparse.solver.csj.BaseCSJEqnDoubleSolver

buildAMatrix

Methods inherited from class com.interpss.core.sparse.solver.csj.BaseCSJSparseEqnSolver

solveEqn

Methods inherited from class com.interpss.core.sparse.solver.BaseSparseEqnSolver

factorization, setMatrixDirty

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.interpss.core.sparse.solver.ISparseEqnSolver

factorization, setMatrixDirty

Field Detail

weightedLS

protected boolean weightedLS

order

protected int order

symbolTable

protected edu.emory.mathcs.csparsej.tdouble.Dcs_common.Dcss symbolTable

numericTable

protected edu.emory.mathcs.csparsej.tdouble.Dcs_common.Dcsn numericTable

Constructor Detail

CSJLeastSquareDoubleSolver

public CSJLeastSquareDoubleSolver(ISparseEqnDouble eqn,
                                  int order)

Method Detail

solveEqn

public void solveEqn()
              throws IpssNumericException

Solve the [A]X = B problem

Throws:

IpssNumericException

solveEqn

public double[] solveEqn(double[] b)
                  throws IpssNumericException

Solve the [A]X = B problem, assume that [A] is factorized

Specified by:

solveEqn in interface ISparseEqnSolver

Overrides:

solveEqn in class BaseSparseEqnSolver

Parameters:

b - the b vector

Throws:

IpssNumericException

factorization

public boolean factorization()
                      throws IpssNumericException

QR factorization of the [A] matrix.

Specified by:

factorization in interface ISparseEqnSolver

Overrides:

factorization in class BaseSparseEqnSolver

Parameters:

tolerance - the tolerance for matrix singular detection, not used for this implementation

Returns:

if succeed return true.

Throws:

IpssNumericException