Loading...
Searching...
No Matches
clufactor.h
Go to the documentation of this file.
229 int hugeValues; ///< number of times huge values occurred during solve (only used in debug mode)
void solveUpdateRight(R *vec) void selectPivots(R threshold) void solveLright(R *vec) int solveUpdateLeft(R eps, R *vec, int *nonz, int n) int solveLeft2(R *vec1, int *nonz, R *vec2, R eps, R *rhs1, R *rhs2) void eliminateRowSingletons() void vSolveRight4update3sparse(R eps, R *vec, int *idx, R *rhs, int *ridx, int &rn, R eps2, R *vec2, int *idx2, R *rhs2, int *ridx2, int &rn2, R eps3, R *vec3, int *idx3, R *rhs3, int *ridx3, int &rn3, R *forest, int *forestNum, int *forestIdx) sparse version of above method void solveUright2(R *work1, R *vec1, R *work2, R *vec2) void setPivot(const int p_stage, const int p_col, const int p_row, const R val) void forestPackColumns() void minRowMem(int size) void solveUpdateLeft2(R *vec1, R *vec2) int solveUrightEps(R *vec, int *nonz, R eps, R *rhs) void minLMem(int size) void remaxCol(int p_col, int len) int vSolveUpdateRight(R *vec, int *ridx, int n, R eps) void solveLleftNoNZ(R *vec) int solveRight4update(R *vec, int *nonz, R eps, R *rhs, R *forest, int *forestNum, int *forestIdx) int vSolveUright(R *vec, int *vidx, R *rhs, int *ridx, int rn, R eps) void solveUleft(R *work, R *vec) bool isConsistent() const void vSolveUpdateRightNoNZ(R *vec, R) int vSolveRight4update2(R eps, R *vec, int *idx, R *rhs, int *ridx, int rn, R *vec2, R eps2, R *rhs2, int *ridx2, int rn2, R *forest, int *forestNum, int *forestIdx) void updateNoClear(int p_col, const R *p_work, const int *p_idx, int num) void updateSolutionVectorLright(R change, int j, R &vec, int *idx, int &nnz) void rowSingletons() int vSolveRight4update3(R eps, R *vec, int *idx, R *rhs, int *ridx, int rn, R *vec2, R eps2, R *rhs2, int *ridx2, int rn2, R *vec3, R eps3, R *rhs3, int *ridx3, int rn3, R *forest, int *forestNum, int *forestIdx) void solveLright2(R *vec1, R *vec2) void vSolveRightNoNZ(R *vec, R eps, R *rhs, int *ridx, int rn) void solveRight2(R *vec1, R *vec2, R *rhs1, R *rhs2) void vSolveUrightNoNZ(R *vec, R *rhs, int *ridx, int rn, R eps) void vSolveLright2(R *vec, int *ridx, int &rn, R eps, R *vec2, int *ridx2, int &rn2, R eps2) int solveLleft2forest(R *vec1, int *, R *vec2, R) void vSolveLeft3sparse(R eps, R *vec, int *idx, R *rhs, int *ridx, int &rn, R *vec2, int *idx2, R *rhs2, int *ridx2, int &rn2, R *vec3, int *idx3, R *rhs3, int *ridx3, int &rn3) sparse version of solving 3 systems of equations void packColumns() int solveLeftEps(R *vec, R *rhs, int *nonz, R eps) void solveRight(R *vec, R *rhs) int solveRight2update(R *vec1, R *vec2, R *rhs1, R *rhs2, int *nonz, R eps, R *forest, int *forestNum, int *forestIdx) int solveUright2eps(R *work1, R *vec1, R *work2, R *vec2, int *nonz, R eps) std::shared_ptr< Tolerances > _tolerances Tolerances for the factorization. Definition clufactor.h:230 void solveUright(R *wrk, R *vec) const void packRows() void solveUpdateLeft(R *vec) int makeLvec(int p_len, int p_row) void freeFactorRings() void eliminatePivot(int prow, int pos, R eps) int vSolveLeft(R eps, R *vec, int *idx, R *rhs, int *ridx, int rn) int solveLleftForest(R eps, R *vec, int *nonz, int n) int vSolveLeft3(R eps, R *vec, int *idx, R *rhs, int *ridx, int rn, R *vec2, R *rhs2, int *ridx2, int rn2, R *vec3, R *rhs3, int *ridx3, int rn3) void vSolveLright(R *vec, int *ridx, int &rn, R eps) void initFactorRings() void solveLleft(R *vec) const void solveLleftForestNoNZ(R *vec) void solveUleft2(R *work1, R *vec1, R *work2, R *vec2) int vSolveUright2(R *vec, int *vidx, R *rhs, int *ridx, int rn, R eps, R *vec2, R *rhs2, int *ridx2, int rn2, R eps2) void forestReMaxCol(int col, int len) int hugeValues number of times huge values occurred during solve (only used in debug mode) Definition clufactor.h:229 void colSingletons() void initFactorMatrix(const SVectorBase< R > **vec, const R eps) int solveUleft(R eps, R *vec, int *vecidx, R *rhs, int *rhsidx, int rhsn) void minColMem(int size) int solveLleftForest(R *vec, int *, R) void vSolveLright3(R *vec, int *ridx, int &rn, R eps, R *vec2, int *ridx2, int &rn2, R eps2, R *vec3, int *ridx3, int &rn3, R eps3) void forestUpdate(int col, R *work, int num, int *nonz) void solveLleft2(R *vec1, int *, R *vec2, R) void setupRowVals() int solveLleft(R eps, R *vec, int *nonz, int rn) void vSolveLeftNoNZ(R eps, R *vec, R *rhs, int *ridx, int rn) int vSolveRight4update(R eps, R *vec, int *idx, R *rhs, int *ridx, int rn, R *forest, int *forestNum, int *forestIdx) void eliminateColSingletons() int solveLleftEps(R *vec, int *nonz, R eps) void vSolveRight4update2sparse(R eps, R *vec, int *idx, R *rhs, int *ridx, int &rn, R eps2, R *vec2, int *idx2, R *rhs2, int *ridx2, int &rn2, R *forest, int *forestNum, int *forestIdx) sparse version of above method void eliminateNucleus(const R eps, const R threshold) void initPerm() int setupColVals() void forestMinColMem(int size) void update(int p_col, R *p_work, const int *p_idx, int num) void solveUleftNoNZ(R eps, R *vec, R *rhs, int *rhsidx, int rhsn) void remaxRow(int p_row, int len) void vSolveLeft2sparse(R eps, R *vec, int *idx, R *rhs, int *ridx, int &rn, R *vec2, int *idx2, R *rhs2, int *ridx2, int &rn2) sparse version of solving 2 systems of equations int vSolveLeft2(R eps, R *vec, int *idx, R *rhs, int *ridx, int rn, R *vec2, R *rhs2, int *ridx2, int rn2) void dump() const int updateRow(int r, int lv, int prow, int pcol, R pval, R eps) void solveUpdateRight2(R *vec1, R *vec2) void solveLeft(R *vec, R *rhs) void factor(const SVectorBase< R > **vec, R threshold, R eps) Everything should be within this namespace. Sparse Linear Solver virtual base class. Debugging, floating point type and parameter definitions. Definition clufactor.h:71 Data structures for saving the working matrix and L factor. Definition clufactor.h:181 Data structures for saving the row and column permutations. Definition clufactor.h:131 Definition clufactor.h:159 int * max maximum available nonzeros per colunn: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]... Definition clufactor.h:172 std::vector< R > val hold nonzero values: this is only initialized in the end of the factorization with DEFAULT updates. Definition clufactor.h:167 Dring list Double linked ringlist of VectorBase<R> indices in the order they appear in the column file Definition clufactor.h:160 Definition clufactor.h:141 int * max maximum available nonzeros per row: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]. Definition clufactor.h:152 Dring list Double linked ringlist of VectorBase<R> indices in the order they appear in the row file Definition clufactor.h:142 Data structures for saving the working matrix and U factor. Definition clufactor.h:138 struct soplex::CLUFactor::U::Col col struct soplex::CLUFactor::U::Row row Sparse vectors. Timer class.
|