linear solver using PCG, pre-conditioner is block Jacobi More...
#include <linear_solver_dense.h>
Public Member Functions | |
virtual bool | init () |
LinearSolverDense () | |
bool | solve (const SparseBlockMatrix< MatrixType > &A, double *x, double *b) |
virtual | ~LinearSolverDense () |
linear solver using PCG, pre-conditioner is block Jacobi
Definition at line 35 of file linear_solver_dense.h.
g2o::LinearSolverDense< MatrixType >::LinearSolverDense | ( | ) | [inline] |
Definition at line 38 of file linear_solver_dense.h.
virtual g2o::LinearSolverDense< MatrixType >::~LinearSolverDense | ( | ) | [inline, virtual] |
Definition at line 41 of file linear_solver_dense.h.
virtual bool g2o::LinearSolverDense< MatrixType >::init | ( | ) | [inline, virtual] |
init for operating on matrices with a different non-zero pattern like before
Implements g2o::LinearSolver< MatrixType >.
Definition at line 43 of file linear_solver_dense.h.
bool g2o::LinearSolverDense< MatrixType >::solve | ( | const SparseBlockMatrix< MatrixType > & | A, |
double * | x, | ||
double * | b | ||
) | [inline, virtual] |
Assumes that A has the same non-zero pattern over several calls. If the pattern changes call init() before. solve system Ax = b, x and b have to allocated beforehand!!
Implements g2o::LinearSolver< MatrixType >.
Definition at line 45 of file linear_solver_dense.h.