\copydoc SparseMatrix::prune(const Scalar&,const RealScalar&) */

\returns the pseudo-inverse of the matrix of which *this is the complete * orthogonal decomposition. * \warning: Do not compute \c this->pseudoI

workaround MSVC std::list implementation

* Gets the rank of the matrix. * It should be equal to matrixQR().cols if the matrix is full-rank */

\returns the number of non linearly dependent columns as determined by the pivoting threshold. * * \sa setPivotThreshold() */

Resizes to given size. */

* Return the array of compressed row indices of all supernodes */

* Number of rows */

\returns a random point inside the bounding box sampled with * a uniform distribution */

\returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */

Specifies a sub-vector to work on */

Sets the step bound for the diagonal shift */

* Set appropriate pointers for the lower triangular supernodal matrix * These infos are available at the end of the numerical factorization

Sets the max number of threads reserved for Eigen * \sa nbThreads */