A linear complementarity problem (LCP) data structure.The LCP class represent a linear complementarity problem of the form
.
More...
#include <LCP.h>
A linear complementarity problem (LCP) data structure.
The LCP class represent a linear complementarity problem of the form
.
Returns the lower bound of the unknown at the given index.
- Parameters
-
index | Access index. The index has to be in the range . |
- Returns
- void
void blaze::LCP::project |
( |
size_t |
index | ) |
|
|
inline |
Projects the unknown at the given index on the solution range.
- Parameters
-
index | Access index. The index has to be in the range . |
- Returns
- void
Calculates the residual of the unknown at the given index.
- Parameters
-
index | Access index. The index has to be in the range . |
- Returns
- The residual at index index.
real blaze::LCP::residual |
( |
| ) |
const |
|
inline |
Calculates the maximum norm of the residual of the linear complementarity problem.
- Returns
- The maximum norm of the global residual of the LCP.
size_t blaze::LCP::size |
( |
| ) |
const |
|
inline |
Returns the size of the linear complementarity problem.
- Returns
- The actual size of the LCP.
Returns the upper bound of the unknown at the given index.
- Parameters
-
index | Access index. The index has to be in the range . |
- Returns
- void
The documentation for this struct was generated from the following file:
- blaze/math/problems/LCP.h