model::SparseNullSpace< SparseMatrixType > Class Template Reference

#include <SparseNullSpace.h>

Collaboration diagram for model::SparseNullSpace< SparseMatrixType >:

Public Member Functions
	SparseNullSpace (const SparseMatrixType &C, const Scalar &tol=Eigen::NumTraits< Scalar >::dummy_precision())
const SparseMatrixType &	matrixZ () const
const SparseMatrixType &	matrixY () const

Detailed Description

template<typename SparseMatrixType>
class model::SparseNullSpace< SparseMatrixType >

Class template for the calculation of the null space of a sparse matrix based on the sparse QR decomposition. The input matrix C is decomposed as C=[Y Z], where Y is a full-rank matrix and Z is a ba

The solution strategy for this

Definition at line 34 of file SparseNullSpace.h.

Constructor & Destructor Documentation

SparseNullSpace()

template<typename SparseMatrixType>

model::SparseNullSpace< SparseMatrixType >::SparseNullSpace ( const SparseMatrixType & C, const Scalar & tol = Eigen::NumTraits<Scalar>::dummy_precision() )

inline

Example usage for solving the constrained minimization problem x=argmin{1/2*x^T*A*x-b*x} subject to C*x=d

Definition at line 44 of file SparseNullSpace.h.

Member Function Documentation

matrixY()

template<typename SparseMatrixType>

const SparseMatrixType & model::SparseNullSpace< SparseMatrixType >::matrixY ( ) const

inline

Definition at line 109 of file SparseNullSpace.h.

matrixZ()

template<typename SparseMatrixType>

const SparseMatrixType & model::SparseNullSpace< SparseMatrixType >::matrixZ ( ) const

inline

Definition at line 104 of file SparseNullSpace.h.

---

The documentation for this class was generated from the following file:

• SparseNullSpace.h