Base class for linear solvers that are used in a Schur-complement implementation in qpOASES.
More...
#include <SparseSolver.hpp>
- Author
- Andreas Waechter, Dennis Janka
- Version
- 3.2
- Date
- 2012-2017
◆ SparseSolver() [1/2]
◆ SparseSolver() [2/2]
◆ ~SparseSolver()
SparseSolver::~SparseSolver |
( |
| ) |
|
|
virtual |
◆ clear()
◆ copy()
◆ factorize()
Compute factorization of current matrix. This method must be called before solve.
◆ getNegativeEigenvalues()
int_t SparseSolver::getNegativeEigenvalues |
( |
| ) |
|
|
virtual |
◆ getRank()
int_t SparseSolver::getRank |
( |
| ) |
|
|
virtual |
Return the rank after a factorization
◆ getZeroPivots()
Returns the zero pivots in case the matrix is rank deficient
References SUCCESSFUL_RETURN.
◆ operator=()
◆ reset()
◆ setMatrixData()
Set new matrix data. The matrix is to be provided in the Harwell-Boeing format. Only the lower triangular part should be set.
- Parameters
-
dim | Dimension of the linear system. |
numNonzeros | Number of nonzeros in the matrix. |
airn | Row indices for each matrix entry. |
acjn | Column indices for each matrix entry. |
avals | Values for each matrix entry. |
References real_t.
◆ solve()
Solve linear system with most recently set matrix data.
- Parameters
-
dim | Dimension of the linear system. |
rhs | Values for the right hand side. |
sol | Solution of the linear system. |
References real_t, and SparseSolver().
The documentation for this class was generated from the following files: