#include <DantzigLCPSolver.hpp>
|
| bool | isSymmetric (std::size_t _n, double *_A) |
| | Return true if the matrix is symmetric.
|
| |
| bool | isSymmetric (std::size_t _n, double *_A, std::size_t _begin, std::size_t _end) |
| | Return true if the diagonla block of matrix is symmetric.
|
| |
| void | print (std::size_t _n, double *_A, double *_x, double *_lo, double *_hi, double *_b, double *w, int *_findex) |
| | Print debug information.
|
| |
- Deprecated:
- This header has been deprecated in DART 6.7. Please include DantzigBoxedLcpSolver.hpp intead.
DantzigLCPSolver is a LCP solver that uses ODE's implementation of Dantzig algorithm
◆ DantzigLCPSolver()
| dart::constraint::DantzigLCPSolver::DantzigLCPSolver |
( |
double |
_timestep | ) |
|
|
explicit |
◆ ~DantzigLCPSolver()
| dart::constraint::DantzigLCPSolver::~DantzigLCPSolver |
( |
| ) |
|
|
virtual |
◆ getTimeStep()
| double dart::constraint::LCPSolver::getTimeStep |
( |
| ) |
const |
|
inherited |
◆ isSymmetric() [1/2]
| bool dart::constraint::DantzigLCPSolver::isSymmetric |
( |
std::size_t |
_n, |
|
|
double * |
_A |
|
) |
| |
|
private |
Return true if the matrix is symmetric.
◆ isSymmetric() [2/2]
| bool dart::constraint::DantzigLCPSolver::isSymmetric |
( |
std::size_t |
_n, |
|
|
double * |
_A, |
|
|
std::size_t |
_begin, |
|
|
std::size_t |
_end |
|
) |
| |
|
private |
Return true if the diagonla block of matrix is symmetric.
◆ print()
| void dart::constraint::DantzigLCPSolver::print |
( |
std::size_t |
_n, |
|
|
double * |
_A, |
|
|
double * |
_x, |
|
|
double * |
_lo, |
|
|
double * |
_hi, |
|
|
double * |
_b, |
|
|
double * |
w, |
|
|
int * |
_findex |
|
) |
| |
|
private |
◆ setTimeStep()
| void dart::constraint::LCPSolver::setTimeStep |
( |
double |
_timeStep | ) |
|
|
inherited |
◆ solve()
◆ mTimeStep
| double dart::constraint::LCPSolver::mTimeStep |
|
protectedinherited |