linear solver using dense cholesky decomposition 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 () |
Public Member Functions inherited from g2o::LinearSolver< MatrixType > | |
| LinearSolver () | |
| virtual void | setWriteDebug (bool) |
| virtual bool | solveBlocks (double **&blocks, const SparseBlockMatrix< MatrixType > &A) |
| virtual bool | solvePattern (SparseBlockMatrix< MatrixXd > &spinv, const std::vector< std::pair< int, int > > &blockIndices, const SparseBlockMatrix< MatrixType > &A) |
| virtual bool | writeDebug () const |
| write a debug dump of the system matrix if it is not PSD in solve More... | |
| virtual | ~LinearSolver () |
Protected Attributes | |
| Eigen::LDLT< Eigen::MatrixXd > | _cholesky |
| Eigen::MatrixXd | _H |
| bool | _reset |
linear solver using dense cholesky decomposition
Definition at line 46 of file linear_solver_dense.h.
|
inline |
Definition at line 49 of file linear_solver_dense.h.
|
inlinevirtual |
Definition at line 55 of file linear_solver_dense.h.
|
inlinevirtual |
init for operating on matrices with a different non-zero pattern like before
Implements g2o::LinearSolver< MatrixType >.
Definition at line 59 of file linear_solver_dense.h.
|
inlinevirtual |
Assumes that A is the same matrix for several calls. Among other assumptions, the non-zero pattern does not change! If the matrix changes call init() before. solve system Ax = b, x and b have to allocated beforehand!!
Implements g2o::LinearSolver< MatrixType >.
Definition at line 65 of file linear_solver_dense.h.
|
protected |
Definition at line 118 of file linear_solver_dense.h.
|
protected |
Definition at line 117 of file linear_solver_dense.h.
|
protected |
Definition at line 116 of file linear_solver_dense.h.