| delete_factors() | strumpack::SparseSolverBase< scalar_t, int > | |
| draw(const std::string &name) const | strumpack::SparseSolverBase< scalar_t, int > | |
| factor() | strumpack::SparseSolverBase< scalar_t, int > | |
| factor_memory() const | strumpack::SparseSolverBase< scalar_t, int > | |
| factor_nonzeros() const | strumpack::SparseSolverBase< scalar_t, int > | |
| inertia(int &neg, int &zero, int &pos) | strumpack::SparseSolverBase< scalar_t, int > | |
| Krylov_iterations() const | strumpack::SparseSolverBase< scalar_t, int > | |
| maximum_rank() const | strumpack::SparseSolverBase< scalar_t, int > | |
| move_to_gpu() | strumpack::SparseSolverBase< scalar_t, int > | |
| options() | strumpack::SparseSolverBase< scalar_t, int > | |
| options() const | strumpack::SparseSolverBase< scalar_t, int > | |
| remove_from_gpu() | strumpack::SparseSolverBase< scalar_t, int > | |
| reorder(int nx=1, int ny=1, int nz=1, int components=1, int width=1) | strumpack::SparseSolverBase< scalar_t, int > | |
| reorder(const int *p, int base=0) | strumpack::SparseSolverBase< scalar_t, int > | |
| set_csr_matrix(integer_t N, const integer_t *row_ptr, const integer_t *col_ind, const scalar_t *values, bool symmetric_pattern=false) | strumpack::SparseSolver< scalar_t, integer_t > | |
| set_from_options() | strumpack::SparseSolverBase< scalar_t, int > | |
| set_from_options(int argc, char *argv[]) | strumpack::SparseSolverBase< scalar_t, int > | |
| set_matrix(const CSRMatrix< scalar_t, integer_t > &A) | strumpack::SparseSolver< scalar_t, integer_t > | |
| solve(const scalar_t *b, scalar_t *x, bool use_initial_guess=false) | strumpack::SparseSolverBase< scalar_t, int > | |
| solve(const DenseM_t &b, DenseM_t &x, bool use_initial_guess=false) | strumpack::SparseSolverBase< scalar_t, int > | |
| solve(int nrhs, const scalar_t *b, int ldb, scalar_t *x, int ldx, bool use_initial_guess=false) | strumpack::SparseSolverBase< scalar_t, int > | |
| SparseSolver(int argc, char *argv[], bool verbose=true, bool root=true) | strumpack::SparseSolver< scalar_t, integer_t > | |
| SparseSolver(bool verbose=true, bool root=true) | strumpack::SparseSolver< scalar_t, integer_t > | |
| SparseSolverBase(int argc, char *argv[], bool verbose=true, bool root=true) | strumpack::SparseSolverBase< scalar_t, int > | |
| SparseSolverBase(bool verbose=true, bool root=true) | strumpack::SparseSolverBase< scalar_t, int > | |
| update_matrix_values(integer_t N, const integer_t *row_ptr, const integer_t *col_ind, const scalar_t *values, bool symmetric_pattern=false) | strumpack::SparseSolver< scalar_t, integer_t > | |
| update_matrix_values(const CSRMatrix< scalar_t, integer_t > &A) | strumpack::SparseSolver< scalar_t, integer_t > | |
| ~SparseSolver() | strumpack::SparseSolver< scalar_t, integer_t > | |
| ~SparseSolverBase() | strumpack::SparseSolverBase< scalar_t, int > | virtual |
1.9.1