8 #ifndef ClpCholeskyDense_H 
    9 #define ClpCholeskyDense_H 
   41   int space(
int numberRows) 
const;
 
   93   double doubleParameters_[1]; 
 
   94   int integerParameters_[2]; 
 
  112   int nLeft, 
int iBlock, 
int jBlock,
 
  128   int iBlock, 
int jBlock,
 
ClpCholeskyDense & operator=(const ClpCholeskyDense &)
Assignment. 
Abstract base class for Clp Matrices. 
This solves LPs using interior point methods. 
ClpCholeskyDense()
Default constructor. 
char * rowsDropped() const 
rowsDropped - which rows are gone 
longDouble * sparseFactor_
sparseFactor. 
virtual int factorize(const CoinWorkDouble *diagonal, int *rowsDropped)
Factorize - filling in rowsDropped and returning number dropped. 
void solveF2(longDouble *a, int n, CoinWorkDouble *region, CoinWorkDouble *region2)
void ClpCholeskyCfactorLeaf(ClpCholeskyDenseC *thisStruct, longDouble *a, int n, longDouble *diagonal, longDouble *work, int *rowsDropped)
Leaf recursive factor. 
void solveB2(longDouble *a, int n, CoinWorkDouble *region, CoinWorkDouble *region2)
void ClpCholeskyCrecTriLeaf(longDouble *aUnder, longDouble *aTri, longDouble *work, int nUnder)
Leaf recursive rectangle triangle update. 
int space(int numberRows) const 
Returns space needed. 
int reserveSpace(const ClpCholeskyBase *factor, int numberRows)
Reserves space. 
longDouble * diagonal() const 
Diagonal. 
Base class for Clp Cholesky factorization Will do better factorization. 
void solveF1(longDouble *a, int n, CoinWorkDouble *region)
Forward part of solve. 
void ClpCholeskyCrecRecLeaf(const longDouble *COIN_RESTRICT above, const longDouble *COIN_RESTRICT aUnder, longDouble *COIN_RESTRICT aOther, const longDouble *COIN_RESTRICT work, int nUnder)
Leaf recursive rectangle rectangle update, nUnder is number of rows in iBlock, nUnderK is number of r...
void ClpCholeskyCrecRec(ClpCholeskyDenseC *thisStruct, longDouble *above, int nUnder, int nUnderK, int nDo, longDouble *aUnder, longDouble *aOther, longDouble *work, int iBlock, int jBlock, int numberBlocks)
Non leaf recursive rectangle rectangle update, nUnder is number of rows in iBlock, nUnderK is number of rows in kBlock. 
int bNumber(const longDouble *array, int &, int &)
int numberRows() const 
Return number of rows. 
void ClpCholeskyCrecTri(ClpCholeskyDenseC *thisStruct, longDouble *aUnder, int nTri, int nDo, int iBlock, int jBlock, longDouble *aTri, longDouble *diagonal, longDouble *work, int numberBlocks)
Non leaf recursive rectangle triangle update. 
longDouble * diagonal_
Diagonal. 
void factorizePart3(int *rowsDropped)
part 2 of Factorize - filling in rowsDropped - blocked 
void ClpCholeskyCtriRecLeaf(longDouble *aTri, longDouble *aUnder, longDouble *diagonal, longDouble *work, int nUnder)
Leaf recursive triangle rectangle update. 
virtual ~ClpCholeskyDense()
Destructor. 
virtual int symbolic()
Does Symbolic factorization given permutation. 
void factorizePart2(int *rowsDropped)
part 2 of Factorize - filling in rowsDropped 
virtual void solve(CoinWorkDouble *region)
Uses factorization to solve. 
longDouble * aMatrix() const 
A. 
virtual ClpCholeskyBase * clone() const 
Clone. 
void ClpCholeskySpawn(void *)
virtual int order(ClpInterior *model)
Orders rows and saves pointer to matrix.and model. 
void solveB1(longDouble *a, int n, CoinWorkDouble *region)
Backward part of solve. 
void ClpCholeskyCfactor(ClpCholeskyDenseC *thisStruct, longDouble *a, int n, int numberBlocks, longDouble *diagonal, longDouble *work, int *rowsDropped)
Non leaf recursive factor. 
bool borrowSpace_
Just borrowing space. 
void ClpCholeskyCtriRec(ClpCholeskyDenseC *thisStruct, longDouble *aTri, int nThis, longDouble *aUnder, longDouble *diagonal, longDouble *work, int nLeft, int iBlock, int jBlock, int numberBlocks)
Non leaf recursive triangle rectangle update.