creates solver class using BTA-GPU for factorising, solving and selectively inverting linear system.
More...
|
|
| BTASolver (size_t ns_, size_t nt_, size_t nb_, size_t no_, int thread_ID_) |
| |
| void | symbolic_factorization (SpMat &Q, int &init) |
| | not used for BTASolver, only in PARDISO
|
| |
| void | factorize (SpMat &Q, double &log_det, double &t_priorLatChol) |
| | numerical factorisation using block-wise factorisation on GPU.
|
| |
| void | factorize_w_constr (SpMat &Q, const MatrixXd &D, double &log_det, MatrixXd &V) |
| |
| void | factorize_solve (SpMat &Q, Vect &rhs, Vect &sol, double &log_det, double &t_condLatChol, double &t_condLatSolve) |
| | factorises and solves matrix in one call
|
| |
| void | factorize_solve_w_constr (SpMat &Q, Vect &rhs, const MatrixXd &Dxy, double &log_det, Vect &sol, MatrixXd &V) |
| |
| void | selected_inversion (SpMat &Q, Vect &inv_diag) |
| | selected inversion of the diagonal elements of Q.
|
| |
| void | selected_inversion_w_constr (SpMat &Q, const MatrixXd &D, Vect &inv_diag, MatrixXd &V) |
| |
|
| ~BTASolver () |
| | class destructor. Frees memory allocated by BTA.
|
| |
creates solver class using BTA-GPU for factorising, solving and selectively inverting linear system.
divided into set up, symbolic factorisation, numerical factorisation, numerical factorisation & solve and selected inversion (of the diagonal elements)
- Note
- in each BTASolver function call factorise, selected_inversion etc. class BTA gets created. Is this the best way to handle things. Potentially merge them somehow? Maybe actually does not take any time.