clufactor_rational.h
Go to the documentation of this file.
235 int solveUright2eps(Rational* work1, Rational* vec1, Rational* work2, Rational* vec2, int* nonz);
void remaxCol(int p_col, int len) Definition: clufactor_rational.cpp:526 int solveRight2update(Rational *vec1, Rational *vec2, Rational *rhs1, Rational *rhs2, int *nonz, Rational *forest, int *forestNum, int *forestIdx) Definition: clufactor_rational.cpp:3557 int * max maximum available nonzeros per colunn: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]... Definition: clufactor_rational.h:151 CLUFactorRational & operator=(const CLUFactorRational &) assignment operator. int solveRight4update(Rational *vec, int *nonz, Rational *rhs, Rational *forest, int *forestNum, int *forestIdx) Definition: clufactor_rational.cpp:3519 int * max maximum available nonzeros per row: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]... Definition: clufactor_rational.h:131 Dring list Double linked ringlist of vector indices in the order they appear in the column file. Definition: clufactor_rational.h:139 void solveLleft(Rational *vec) Definition: clufactor_rational.cpp:3923 void solveUleft(Rational *work, Rational *vec) Definition: clufactor_rational.cpp:3610 virtual Real time() const =0 void forestReMaxCol(int col, int len) Definition: clufactor_rational.cpp:595 int solveLleft2forest(Rational *vec1, int *, Rational *vec2) Definition: clufactor_rational.cpp:3728 void solveUpdateLeft(Rational *vec) Definition: clufactor_rational.cpp:4039 void update(int p_col, Rational *p_work, const int *p_idx, int num) Definition: clufactor_rational.cpp:1254 void eliminateRowSingletons() Definition: clufactor_rational.cpp:1854 void factor(const SVectorRational **vec, const Rational &threshold) pivoting threshold Definition: clufactor_rational.cpp:2752 Data structures for saving the working matrix and L factor. Definition: clufactor_rational.h:159 int vSolveUright2(Rational *vec, int *vidx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2) Definition: clufactor_rational.cpp:5235 void solveUpdateRight2(Rational *vec1, Rational *vec2) Definition: clufactor_rational.cpp:3459 Wrapper for GMP type mpq_class.We wrap mpq_class so that we can replace it by a double type if GMP is... Definition: rational.h:45 int solveUright2eps(Rational *work1, Rational *vec1, Rational *work2, Rational *vec2, int *nonz) Definition: clufactor_rational.cpp:3205 Sparse Linear Solver virtual base class with Rational precision. void initFactorMatrix(const SVectorRational **vec) Definition: clufactor_rational.cpp:1364 void eliminatePivot(int prow, int pos) Definition: clufactor_rational.cpp:2409 Data structures for saving the working matrix and U factor. Definition: clufactor_rational.h:117 int solveUrightEps(Rational *vec, int *nonz, Rational *rhs) Definition: clufactor_rational.cpp:3102 int vSolveLeft(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn) Definition: clufactor_rational.cpp:5923 DVectorRational val hold nonzero values: this is only initialized in the end of the factorization with DEFAULT updates... Definition: clufactor_rational.h:146 void solveLright(Rational *vec) Definition: clufactor_rational.cpp:3284 int solveLleftEps(Rational *vec, int *nonz) Definition: clufactor_rational.cpp:3975 void solveRight(Rational *vec, Rational *rhs) Definition: clufactor_rational.cpp:3548 int vSolveUright(Rational *vec, int *vidx, Rational *rhs, int *ridx, int rn) Definition: clufactor_rational.cpp:5028 void forestPackColumns() Definition: clufactor_rational.cpp:345 int vSolveRight4update(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *forest, int *forestNum, int *forestIdx) Definition: clufactor_rational.cpp:5563 int solveLeftEps(Rational *vec, Rational *rhs, int *nonz) Definition: clufactor_rational.cpp:4180 void solveLleftNoNZ(Rational *vec) Definition: clufactor_rational.cpp:4560 void solveLright2(Rational *vec1, Rational *vec2) Definition: clufactor_rational.cpp:3346 void solveUright2(Rational *work1, Rational *vec1, Rational *work2, Rational *vec2) Definition: clufactor_rational.cpp:3144 void solveUleft2(Rational *work1, Rational *vec1, Rational *work2, Rational *vec2) Definition: clufactor_rational.cpp:3660 int vSolveLeft2(Rational *vec, int *idx, Rational *rhs, int *ridx, int rn, Rational *vec2, Rational *rhs2, int *ridx2, int rn2) Definition: clufactor_rational.cpp:5947 int solveLeft2(Rational *vec1, int *nonz, Rational *vec2, Rational *rhs1, Rational *rhs2) Definition: clufactor_rational.cpp:4197 void solveUright(Rational *wrk, Rational *vec) Definition: clufactor_rational.cpp:3079 void setPivot(const int p_stage, const int p_col, const int p_row, const Rational &val) Definition: clufactor_rational.cpp:265 void solveLeft(Rational *vec, Rational *rhs) Definition: clufactor_rational.cpp:4163 void vSolveLeftNoNZ(Rational *vec, Rational *rhs, int *ridx, int rn) Definition: clufactor_rational.cpp:6010 int vSolveLright(Rational *vec, int *ridx, int rn) Definition: clufactor_rational.cpp:4625 Wrapper for GMP types. Sparse vectors. void vSolveUrightNoNZ(Rational *vec, Rational *rhs, int *ridx, int rn) Definition: clufactor_rational.cpp:5134 Dring list Double linked ringlist of vector indices in the order they appear in the row file. Definition: clufactor_rational.h:122 void initFactorRings() Definition: clufactor_rational.cpp:1780 void selectPivots(const Rational &threshold) Definition: clufactor_rational.cpp:2052 void vSolveRightNoNZ(Rational *vec2, Rational *rhs2, int *ridx2, int rn2) Definition: clufactor_rational.cpp:5879 Debugging, floating point type and parameter definitions. void solveRight2(Rational *vec1, Rational *vec2, Rational *rhs1, Rational *rhs2) Definition: clufactor_rational.cpp:3592 void vSolveLright3(Rational *vec, int *ridx, int *rnptr, Rational *vec2, int *ridx2, int *rn2ptr, Rational *vec3, int *ridx3, int *rn3ptr) Definition: clufactor_rational.cpp:4809 int makeLvec(int p_len, int p_row) Definition: clufactor_rational.cpp:2913 Collection of dense, sparse, and semi-sparse vectors. Implementation of sparse LU factorization with Rational precision.This class implements a sparse LU f... Definition: clufactor_rational.h:39 Everything should be within this namespace. void solveLleft2(Rational *vec1, int *, Rational *vec2) Definition: clufactor_rational.cpp:3791 Timer class. void remaxRow(int p_row, int len) Definition: clufactor_rational.cpp:400 void freeFactorRings() Definition: clufactor_rational.cpp:1833 int updateRow(int r, int lv, int prow, int pcol, const Rational &pval) Definition: clufactor_rational.cpp:2274 int vSolveUpdateRight(Rational *vec, int *ridx, int n) Definition: clufactor_rational.cpp:5480 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) Definition: clufactor_rational.cpp:5975 void vSolveUpdateRightNoNZ(Rational *vec) Definition: clufactor_rational.cpp:5525 void forestUpdate(int col, Rational *work, int num, int *nonz) Performs the Forrest-Tomlin update of the LU factorization. Definition: clufactor_rational.cpp:691 void eliminateNucleus(const Rational &threshold) Definition: clufactor_rational.cpp:2505 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) Definition: clufactor_rational.cpp:5629 bool timeLimitReached() Definition: clufactor_rational.h:354 int solveLleftForest(Rational *vec, int *) Definition: clufactor_rational.cpp:3890 bool isConsistent() const Definition: clufactor_rational.cpp:2941 void solveUpdateLeft2(Rational *vec1, Rational *vec2) Definition: clufactor_rational.cpp:4070 void vSolveLright2(Rational *vec, int *ridx, int *rnptr, Rational *vec2, int *ridx2, int *rn2ptr) Definition: clufactor_rational.cpp:4690 void updateNoClear(int p_col, const Rational *p_work, const int *p_idx, int num) Definition: clufactor_rational.cpp:1296 void solveUpdateRight(Rational *vec) Definition: clufactor_rational.cpp:3427 int * idx array of length val.dim() to hold column indices of nonzeros in val Definition: clufactor_rational.h:128 void solveLleftForestNoNZ(Rational *vec) Definition: clufactor_rational.cpp:4428 void eliminateColSingletons() Definition: clufactor_rational.cpp:1975 Data structures for saving the row and column permutations. Definition: clufactor_rational.h:110 void forestMinColMem(int size) Definition: clufactor_rational.cpp:2890 void solveUleftNoNZ(Rational *vec, Rational *rhs, int *rhsidx, int rhsn) Definition: clufactor_rational.cpp:4301 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) Definition: clufactor_rational.cpp:5740 |