Class grouping different Cholesky solvers. More...
#include <SparseCholeskyFactorisation.hxx>
Public Types | |
enum | { SELDON_SOLVER, CHOLMOD, PASTIX } |
Public Member Functions | |
SparseCholeskySolver () | |
Default constructor. | |
void | HideMessages () |
Displays no messages. | |
void | ShowMessages () |
Displays only brief messages. | |
void | ShowFullHistory () |
Displays a lot of messages. | |
void | Clear () |
Clears Cholesky factors. | |
int | GetM () const |
Returns the number of rows. | |
int | GetN () const |
Returns the number of rows. | |
size_t | GetMemorySize () const |
returns memory size used by the object in bytes | |
int | GetTypeOrdering () const |
Returns the type of ordering used. | |
void | SetPermutation (const IVect &) |
Modifies the ordering used. | |
void | SelectOrdering (int) |
Modifies the type of ordering used. | |
void | SelectDirectSolver (int) |
Modifies the direct solver used. | |
int | GetDirectSolver () |
returns the type of direct solver used | |
void | InitSolver () |
template<class Prop , class Storage , class Allocator > | |
void | Factorize (Matrix< T, Prop, Storage, Allocator > &A, bool keep_matrix=false) |
Performs Cholesky factorization. | |
template<class T1 > | |
void | Solve (const SeldonTranspose &TransA, Vector< T1 > &x, bool assemble=true) |
Solves L x = b or L^T x = b. | |
template<class T1 > | |
void | Mlt (const SeldonTranspose &TransA, Vector< T1 > &x, bool assemble=true) |
Computes L x or L^T. | |
Protected Attributes | |
int | print_level |
Verbosity level. | |
int | type_ordering |
Ordering to use. | |
IVect | permutation |
Permutation array. | |
int | type_solver |
Solver to use. | |
int | n |
Size of factorized linear system. | |
Matrix< T, Symmetric, ArrayRowSymSparse > | mat_sym |
Cholesky factors. | |
Vector< T > | xtmp |
Temporary vector. | |
VirtualSparseDirectSolver< T > * | solver |
extern Cholesky solver | |
Class grouping different Cholesky solvers.
Definition at line 28 of file SparseCholeskyFactorisation.hxx.