clufactor.h
Go to the documentation of this file.
void vSolveRightNoNZ(Real *vec2, Real eps2, Real *rhs2, int *ridx2, int rn2) Definition: clufactor.cpp:6151 void solveUpdateRight2(Real *vec1, Real *vec2) Definition: clufactor.cpp:3491 void updateNoClear(int p_col, const Real *p_work, const int *p_idx, int num) Definition: clufactor.cpp:1320 int solveUright2eps(Real *work1, Real *vec1, Real *work2, Real *vec2, int *nonz, Real eps) Definition: clufactor.cpp:3237 int solveRight2update(Real *vec1, Real *vec2, Real *rhs1, Real *rhs2, int *nonz, Real eps, Real *forest, int *forestNum, int *forestIdx) Definition: clufactor.cpp:3590 Dring list Double linked ringlist of vector indices in the order they appear in the column file. Definition: clufactor.h:137 int * max maximum available nonzeros per row: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]... Definition: clufactor.h:129 int vSolveRight4update(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int rn, Real *forest, int *forestNum, int *forestIdx) Definition: clufactor.cpp:5637 void vSolveRight4update3sparse(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int &rn, Real eps2, Real *vec2, int *idx2, Real *rhs2, int *ridx2, int &rn2, Real eps3, Real *vec3, int *idx3, Real *rhs3, int *ridx3, int &rn3, Real *forest, int *forestNum, int *forestIdx) sparse version of above method Definition: clufactor.cpp:6055 int solveLleftForest(Real *vec, int *, Real) Definition: clufactor.cpp:3985 void solveUleftNoNZ(Real eps, Real *vec, Real *rhs, int *rhsidx, int rhsn) Definition: clufactor.cpp:4388 int vSolveLright(Real *vec, int *ridx, int rn, Real eps) Definition: clufactor.cpp:4711 Definition: clufactor.h:47 int vSolveRight4update3(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int rn, Real *vec2, Real eps2, Real *rhs2, int *ridx2, int rn2, Real *vec3, Real eps3, Real *rhs3, int *ridx3, int rn3, Real *forest, int *forestNum, int *forestIdx) Definition: clufactor.cpp:5905 Data structures for saving the row and column permutations. Definition: clufactor.h:107 void vSolveLright2(Real *vec, int *ridx, int *rnptr, Real eps, Real *vec2, int *ridx2, int *rn2ptr, Real eps2) Definition: clufactor.cpp:4776 void vSolveLeft3sparse(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int &rn, Real *vec2, int *idx2, Real *rhs2, int *ridx2, int &rn2, Real *vec3, int *idx3, Real *rhs3, int *ridx3, int &rn3) sparse version of solving 3 systems of equations Definition: clufactor.cpp:6324 void update(int p_col, Real *p_work, const int *p_idx, int num) Definition: clufactor.cpp:1276 Sparse Linear Solver virtual base class. int vSolveLeft2(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int rn, Real *vec2, Real *rhs2, int *ridx2, int rn2) Definition: clufactor.cpp:6232 Data structures for saving the working matrix and L factor. Definition: clufactor.h:157 int solveRight4update(Real *vec, int *nonz, Real eps, Real *rhs, Real *forest, int *forestNum, int *forestIdx) Definition: clufactor.cpp:3552 void eliminateRowSingletons() Definition: clufactor.cpp:1880 void forestUpdate(int col, Real *work, int num, int *nonz) Performs the Forrest-Tomlin update of the LU factorization. Definition: clufactor.cpp:710 void solveLleftForestNoNZ(Real *vec) Definition: clufactor.cpp:4515 void solveUpdateLeft2(Real *vec1, Real *vec2) Definition: clufactor.cpp:4156 int solveLleftEps(Real *vec, int *nonz, Real eps) Definition: clufactor.cpp:4061 void solveUright2(Real *work1, Real *vec1, Real *work2, Real *vec2) Definition: clufactor.cpp:3174 void vSolveUpdateRightNoNZ(Real *vec, Real) Definition: clufactor.cpp:5599 Sparse vectors. Real * val hold nonzero values: this is only initialized in the end of the factorization with DEFAULT updates... Definition: clufactor.h:144 void setPivot(const int p_stage, const int p_col, const int p_row, const Real val) Definition: clufactor.cpp:266 void eliminateNucleus(const Real eps, const Real threshold) Definition: clufactor.cpp:2530 void vSolveLright3(Real *vec, int *ridx, int *rnptr, Real eps, Real *vec2, int *ridx2, int *rn2ptr, Real eps2, Real *vec3, int *ridx3, int *rn3ptr, Real eps3) Definition: clufactor.cpp:4892 void vSolveRight4update2sparse(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int &rn, Real eps2, Real *vec2, int *idx2, Real *rhs2, int *ridx2, int &rn2, Real *forest, int *forestNum, int *forestIdx) sparse version of above method Definition: clufactor.cpp:5827 Debugging, floating point type and parameter definitions. void factor(const SVector **vec, Real threshold, Real eps) epsilon for zero detection Definition: clufactor.cpp:2772 void eliminateColSingletons() Definition: clufactor.cpp:2001 Implementation of sparse LU factorization.This class implements a sparse LU factorization with either... Definition: clufactor.h:37 void solveUleft2(Real *work1, Real *vec1, Real *work2, Real *vec2) Definition: clufactor.cpp:3746 Everything should be within this namespace. Timer class. int vSolveLeft(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int rn) Definition: clufactor.cpp:6204 int solveLleft2forest(Real *vec1, int *, Real *vec2, Real) Definition: clufactor.cpp:3815 void vSolveLeftNoNZ(Real eps, Real *vec, Real *rhs, int *ridx, int rn) Definition: clufactor.cpp:6357 Definition: clufactor.h:117 void solveUright(Real *wrk, Real *vec) const Definition: clufactor.cpp:3111 int vSolveLeft3(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int rn, Real *vec2, Real *rhs2, int *ridx2, int rn2, Real *vec3, Real *rhs3, int *ridx3, int rn3) Definition: clufactor.cpp:6288 void solveLright2(Real *vec1, Real *vec2) Definition: clufactor.cpp:3378 Dring list Double linked ringlist of vector indices in the order they appear in the row file. Definition: clufactor.h:119 int vSolveRight4update2(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int rn, Real *vec2, Real eps2, Real *rhs2, int *ridx2, int rn2, Real *forest, int *forestNum, int *forestIdx) Definition: clufactor.cpp:5704 int solveLeft2(Real *vec1, int *nonz, Real *vec2, Real eps, Real *rhs1, Real *rhs2) Definition: clufactor.cpp:4283 int solveLeftEps(Real *vec, Real *rhs, int *nonz, Real eps) Definition: clufactor.cpp:4266 void vSolveUrightNoNZ(Real *vec, Real *rhs, int *ridx, int rn, Real eps) Definition: clufactor.cpp:5207 void eliminatePivot(int prow, int pos, Real eps) Definition: clufactor.cpp:2434 int vSolveUright2(Real *vec, int *vidx, Real *rhs, int *ridx, int rn, Real eps, Real *vec2, Real *rhs2, int *ridx2, int rn2, Real eps2) Definition: clufactor.cpp:5310 int updateRow(int r, int lv, int prow, int pcol, Real pval, Real eps) Definition: clufactor.cpp:2298 int vSolveUpdateRight(Real *vec, int *ridx, int n, Real eps) Definition: clufactor.cpp:5555 int * max maximum available nonzeros per colunn: start[i] + max[i] == start[elem[i].next->idx] len[i] <= max[i]... Definition: clufactor.h:149 void vSolveLeft2sparse(Real eps, Real *vec, int *idx, Real *rhs, int *ridx, int &rn, Real *vec2, int *idx2, Real *rhs2, int *ridx2, int &rn2) sparse version of solving 2 systems of equations Definition: clufactor.cpp:6261 void initFactorMatrix(const SVector **vec, const Real eps) Definition: clufactor.cpp:1390 void solveLleft2(Real *vec1, int *, Real *vec2, Real) Definition: clufactor.cpp:3882 Definition: clufactor.h:135 void solveRight2(Real *vec1, Real *vec2, Real *rhs1, Real *rhs2) Definition: clufactor.cpp:3626 int vSolveUright(Real *vec, int *vidx, Real *rhs, int *ridx, int rn, Real eps) Definition: clufactor.cpp:5100 Data structures for saving the working matrix and U factor. Definition: clufactor.h:114 int solveUrightEps(Real *vec, int *nonz, Real eps, Real *rhs) Definition: clufactor.cpp:3131 |