PIPS-NLP
|
#include <PardisoSchurSolver.h>
Public Member Functions | |
PardisoSchur32Solver (SparseSymMatrix *sgm) | |
PardisoSchur32Solver (SparseSymMatrix *sgm, const int numOfNegEigVal_in) | |
virtual void | firstCall () |
virtual void | solve (OoqpVector &rhs) |
![]() | |
void | firstSolveCall (SparseGenMatrix &R, SparseGenMatrix &A, SparseGenMatrix &C) |
PardisoSchurSolver (SparseSymMatrix *sgm) | |
PardisoSchurSolver (SparseSymMatrix *sgm, const int numOfNegEigVal_in) | |
virtual void | diagonalChanged (int idiag, int extent) |
virtual int | matrixChanged () |
virtual void | solve (GenMatrix &rhs) |
virtual void | schur_solve (SparseGenMatrix &R, SparseGenMatrix &A, SparseGenMatrix &C, DenseSymMatrix &SC) |
![]() | |
DoubleLinearSolver () | |
virtual void | solveTrans (OoqpVector &x) |
virtual void | Lsolve (OoqpVector &x) |
virtual void | Dsolve (OoqpVector &x) |
virtual void | Ltsolve (OoqpVector &x) |
virtual | ~DoubleLinearSolver () |
Private Member Functions | |
PardisoSchur32Solver () | |
Additional Inherited Members | |
![]() | |
int | negEigVal |
int | KryIter |
![]() | |
PardisoSchurSolver () | |
void | SetUpPardisoSchurSolver (SparseSymMatrix *sgm) |
virtual | ~PardisoSchurSolver () |
![]() | |
SparseSymMatrix * | Msys |
bool | first |
bool | firstSolve |
void * | pt [64] |
int | iparm [64] |
double | dparm [64] |
int | num_threads |
int | n |
int | nSC |
int | nnz |
int * | rowptrAug |
int * | colidxAug |
double * | eltsAug |
int * | index_LowTri |
map< int, int > | diagMap |
int * | elementMap_R |
int * | elementMap_A |
int * | elementMap_C |
int | numOfNegEigVal |
double * | nvec |
PardisoSchur32Solver::PardisoSchur32Solver | ( | SparseSymMatrix * | sgm | ) |
PardisoSchur32Solver::PardisoSchur32Solver | ( | SparseSymMatrix * | sgm, |
const int | numOfNegEigVal_in | ||
) |
|
inlineprivate |
|
virtual |
Reimplemented from PardisoSchurSolver.
|
virtual |
solves a linear system.
x | on entry the right hand side of the system to be solved. On exit, the solution. |
Reimplemented from PardisoSchurSolver.