// solves the positive definite sparse linear system Ax = b using sparse Cholesky factorization
public void solveBackPositiveDefiniteFree()
{
if (linearSolver != null)
{
linearSolver.FreeSolver();
}
}
// solves the positive definite sparse linear system Ax = b using sparse QR factorization
public DenseMatrixDouble solveLeastNormal(ref SparseMatrixDouble A, ref DenseMatrixDouble b)
{
LinearSystemGenericByLib linearSolver = new LinearSystemGenericByLib();
linearSolver.FactorizationQR(ref A);
DenseMatrixDouble x = null;
linearSolver.FreeSolver();
return x;
}
// solves the positive definite sparse linear system Ax = b using sparse Cholesky factorization
public DenseMatrixDouble solvePositiveDefinite(ref SparseMatrixDouble A, ref DenseMatrixDouble b)
{
LinearSystemGenericByLib linearSolver = new LinearSystemGenericByLib();
linearSolver.FactorizationCholesky(ref A);
DenseMatrixDouble x = null;
linearSolver.FreeSolver();
return x;
}
// solves the positive definite sparse linear system Ax = b using sparse QR factorization
public DenseMatrixDouble solveLeastNormal(ref SparseMatrixDouble A, ref DenseMatrixDouble b)
{
LinearSystemGenericByLib linearSolver = new LinearSystemGenericByLib();
linearSolver.FactorizationQR(ref A);
DenseMatrixDouble x = null;
linearSolver.FreeSolver();
return(x);
}
// solves the positive definite sparse linear system Ax = b using sparse Cholesky factorization
public DenseMatrixDouble solvePositiveDefinite(ref SparseMatrixDouble A, ref DenseMatrixDouble b)
{
LinearSystemGenericByLib linearSolver = new LinearSystemGenericByLib();
linearSolver.FactorizationCholesky(ref A);
DenseMatrixDouble x = null;
linearSolver.FreeSolver();
return(x);
}
