| alpha | AMGSolver | [private] |
| AMGSolver() | AMGSolver | |
| AMGSolver(const Matrix &, double tol=1.0e-12, u_int s=3, u_int nmpo=50, double nmpsd=0.382, double alp=0.25) | AMGSolver | |
| clear() | AMGSolver | |
| GaussSidel(const Matrix &M, Vector< double > &x, const Vector< double > &r, const int &s) const | AMGSolver | [private] |
| getPMPt(const Matrix &P, const Matrix &M, const Matrix &Pt) const | AMGSolver | [private] |
| is_initialized | AMGSolver | [private] |
| is_most_project_full | AMGSolver | [private] |
| is_solve_most_project_exactly | AMGSolver | [private] |
| isSolveMostProjectExactly() | AMGSolver | [inline] |
| isSolveMostProjectExactly() const | AMGSolver | [inline] |
| lazyInit(const Matrix &) | AMGSolver | [private] |
| lazyProject(const Matrix &M, Matrix *&P, Matrix *&PMPt, Matrix *&Pt) | AMGSolver | [private] |
| lazyReinit(const Matrix &) | AMGSolver | |
| M_n | AMGSolver | [private] |
| Matrix typedef | AMGSolver | |
| n_most_project_order | AMGSolver | [private] |
| n_most_project_sparse_degree | AMGSolver | [private] |
| n_project | AMGSolver | [private] |
| Project(const Matrix &M, Matrix *&P, Matrix *&PMPt) | AMGSolver | [private] |
| project_matrix | AMGSolver | [private] |
| project_matrix_r | AMGSolver | [private] |
| projected_matrix | AMGSolver | [private] |
| reinit(const Matrix &) | AMGSolver | |
| smooth_step | AMGSolver | [private] |
| smoothStep() const | AMGSolver | [inline] |
| smoothStep() | AMGSolver | [inline] |
| solve(Vector< double > &x, const Vector< double > &r, double tol=0.0, u_int step=20, int mode=0) const | AMGSolver | |
| toler | AMGSolver | [private] |
| tolerence() const | AMGSolver | [inline] |
| tolerence() | AMGSolver | [inline] |
| ~AMGSolver() | AMGSolver | [virtual] |
