\returns the sparse triangular factor R. It is a sparse matrix */

\returns the absolute value of the biggest pivot, i.e. the biggest * diagonal coefficient of U. */

\returns the max number of threads reserved for Eigen * \sa setNbThreads */

\returns the number of nonzero coefficients which is in practice the number * of stored coefficients. */

\returns the number of nonzero pivots in the LU decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

\returns the rank of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pivots should be cons

IMutableRegistryHub

IMutableRegistryHub

Forwards the resizing request to the nested expression * \sa DenseBase::resize(Index) */

* Return the location in \em rowvaluePtr() which starts each column */

\returns the number of rows */

Sets this matrix to be the identity matrix of the current size. */

IMutableContext

IMutableContext

Removes all non zeros but keep allocated memory * * This function does not free the currently allocated memory. To release as much as memo

\returns an expression of the coefficient-wise hyperbolic sin of *this. * * Example: \include Cwise_sinh.cpp * Output: \verbinclude Cwise_sinh.o

Result was a success

Result was a success

\returns an expression of the coefficient-wise hyperbolic tan of *this. * * Example: \include Cwise_tanh.cpp * Output: \verbinclude Cwise_tanh.o

Returns the threshold that will be used by certain methods such as rank(). * * See the documentation of setThreshold(const RealScalar&).

\brief %Transpose of the Householder sequence. */