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