EPANET
3.0
EPANET Development Project
|
Solves Ax = b using the SPARSPAK routines. More...
#include <sparspaksolver.h>
Public Member Functions | |
SparspakSolver (std::ostream &logger) | |
int | init (int nrows, int nnz, int *xrow, int *xcol) |
void | reset () |
double | getDiag (int i) |
double | getOffDiag (int i) |
double | getRhs (int i) |
void | setDiag (int i, double a) |
void | setRhs (int i, double b) |
void | addToDiag (int i, double a) |
void | addToOffDiag (int j, double a) |
void | addToRhs (int i, double b) |
int | solve (int n, double x[]) |
![]() | |
virtual int | init (int nRows, int nOffDiags, int offDiagRow[], int offDiagCol[])=0 |
virtual void | debug (std::ostream &out) |
Additional Inherited Members | |
![]() | |
static MatrixSolver * | factory (const std::string solver, std::ostream &logger) |
Solves Ax = b using the SPARSPAK routines.
This class is derived from the MatrixSolver class and provides an interface to the SPARSPAK routines, originally developed by George and Liu, for re-ordering, factorizing, and solving via Cholesky decomposition a sparse, symmetric, positive definite set of linear equations Ax = b.