Loading...
Searching...
No Matches
clufactor_rational.h
Go to the documentation of this file.
244 int solveUright2eps(Rational* work1, Rational* vec1, Rational* work2, Rational* vec2, int* nonz);
Collection of dense, sparse, and semi-sparse vectors. Definition rational.h:237 Pring & operator=(const Pring &) blocked assignment operator Implementation of sparse LU factorization with Rational precision. Definition clufactor_rational.h:49 int vSolveLright(Rational *vec, int *ridx, int rn) void solveUright(Rational *wrk, Rational *vec) void solveLright2(Rational *vec1, Rational *vec2) int vSolveLeft2(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2) void eliminateRowSingletons() int solveLleftEps(Rational *vec, int *nonz) void solveUright2(Rational *work1, Rational *vec1, Rational *work2, Rational *vec2) void solveRight(Rational *vec, Rational *rhs) void forestPackColumns() void solveLleft(Rational *vec) void minRowMem(int size) int solveLleft2forest(Rational *vec1, int *, Rational *vec2) void eliminatePivot(int prow, int pos) int solveUpdateLeft(Rational *vec, int *nonz, int n) void minLMem(int size) void remaxCol(int p_col, int len) void update(int p_col, Rational *p_work, const int *p_idx, int num) void solveUleft(Rational *work, Rational *vec) int updateRow(int r, int lv, int prow, int pcol, const Rational &pval) bool isConsistent() const void solveLleftNoNZ(Rational *vec) void forestUpdate(int col, Rational *work, int num, int *nonz) void rowSingletons() bool timeLimitReached() Definition clufactor_rational.h:363 int solveUright2eps(Rational *work1, Rational *vec1, Rational *work2, Rational *vec2, int *nonz) int solveRight4update(Rational *vec, int *nonz, Rational *rhs, Rational *forest, int *forestNum, int *forestIdx) void updateNoClear(int p_col, const Rational *p_work, const int *p_idx, int num) int solveUleft(Rational *vec, int *vecidx, Rational *rhs, int *rhsidx, int rhsn) void packColumns() void eliminateNucleus(const Rational &threshold) void solveLright(Rational *vec) int solveLeftEps(Rational *vec, Rational *rhs, int *nonz) void factor(const SVectorRational **vec, const Rational &threshold) void solveUpdateRight2(Rational *vec1, Rational *vec2) void packRows() void vSolveUpdateRightNoNZ(Rational *vec) void vSolveRightNoNZ(Rational *vec2, Rational *rhs2, int *ridx2, int rn2) int makeLvec(int p_len, int p_row) void solveUpdateLeft2(Rational *vec1, Rational *vec2) void freeFactorRings() int solveLleftForest(Rational *vec, int *nonz, int n) int vSolveRight4update3(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2, Rational *vec3, Rational *rhs3, int *ridx3, int rn3, Rational *forest, int *forestNum, int *forestIdx) void solveUpdateLeft(Rational *vec) void selectPivots(const Rational &threshold) void initFactorRings() void solveRight2(Rational *vec1, Rational *vec2, Rational *rhs1, Rational *rhs2) void vSolveLeftNoNZ(Rational *vec, Rational *rhs, int *ridx, int rn) void vSolveUrightNoNZ(Rational *vec, Rational *rhs, int *ridx, int rn) int vSolveRight4update2(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2, Rational *forest, int *forestNum, int *forestIdx) void forestReMaxCol(int col, int len) void colSingletons() int solveUrightEps(Rational *vec, int *nonz, Rational *rhs) int solveLeft2(Rational *vec1, int *nonz, Rational *vec2, Rational *rhs1, Rational *rhs2) void solveLleft2(Rational *vec1, int *, Rational *vec2) void solveLeft(Rational *vec, Rational *rhs) void vSolveLright3(Rational *vec, int *ridx, int *rnptr, Rational *vec2, int *ridx2, int *rn2ptr, Rational *vec3, int *ridx3, int *rn3ptr) void solveUleft2(Rational *work1, Rational *vec1, Rational *work2, Rational *vec2) int vSolveRight4update(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *forest, int *forestNum, int *forestIdx) int solveLleftForest(Rational *vec, int *) void minColMem(int size) int solveRight2update(Rational *vec1, Rational *vec2, Rational *rhs1, Rational *rhs2, int *nonz, Rational *forest, int *forestNum, int *forestIdx) int solveLleft(Rational *vec, int *nonz, int rn) int vSolveUright(Rational *vec, int *vidx, Rational *rhs, int *ridx, int rn) void setupRowVals() void setPivot(const int p_stage, const int p_col, const int p_row, const Rational &val) int vSolveLeft3(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2, Rational *vec3, Rational *rhs3, int *ridx3, int rn3) void solveLleftForestNoNZ(Rational *vec) int vSolveUright2(Rational *vec, int *vidx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2) void eliminateColSingletons() void initFactorMatrix(const SVectorRational **vec) void vSolveLright2(Rational *vec, int *ridx, int *rnptr, Rational *vec2, int *ridx2, int *rn2ptr) void initPerm() int setupColVals() void forestMinColMem(int size) void remaxRow(int p_row, int len) int vSolveLeft(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn) int vSolveUpdateRight(Rational *vec, int *ridx, int n) void solveUleftNoNZ(Rational *vec, Rational *rhs, int *rhsidx, int rhsn) void dump() const void solveUpdateRight(Rational *vec) virtual Real time() const =0 Everything should be within this namespace. Sparse Linear Solver virtual base class with Rational precision. Debugging, floating point type and parameter definitions. Data structures for saving the working matrix and L factor. Definition clufactor_rational.h:169 Data structures for saving the row and column permutations. Definition clufactor_rational.h:120 int * max maximum available nonzeros per colunn: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]... Definition clufactor_rational.h:160 Dring list Double linked ringlist of vector indices in the order they appear in the column file Definition clufactor_rational.h:148 VectorRational val hold nonzero values: this is only initialized in the end of the factorization with DEFAULT updates. Definition clufactor_rational.h:155 int * max maximum available nonzeros per row: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]. Definition clufactor_rational.h:140 Dring list Double linked ringlist of vector indices in the order they appear in the row file Definition clufactor_rational.h:131 int * idx array of length val.dim() to hold column indices of nonzeros in val Definition clufactor_rational.h:137 Data structures for saving the working matrix and U factor. Definition clufactor_rational.h:127 struct soplex::CLUFactorRational::U::Col col struct soplex::CLUFactorRational::U::Row row Sparse vectors. Timer class.
|