\returns the size of the inner dimension according to the storage order, * i.e., the number of rows for a columns major matrix, and the number o

\returns the size of the inner dimension according to the storage order, * i.e., the number of rows for a columns major matrix, and the number o

\returns the inverse of the matrix of which *this is the LU decomposition. * * \note If this matrix is not invertible, the returned matrix

\returns the inverse of the matrix of which *this is the LU decomposition. * * \note If this matrix is not invertible, the returned matrix

\internal \returns b if a<=0, and returns a otherwise. */

\internal \returns b if a<=0, and returns a otherwise. */

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

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

\returns an expression of the matrix U, * The only operation available with this expression is the triangular solve * \code * y = b;

\returns an expression of the matrix U, * The only operation available with this expression is the triangular solve * \code * y = b;

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

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

\returns the number of non zero coefficients */

\returns the number of non zero coefficients */

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

\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 number of nonzero pivots in the QR decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

\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

\sa MapBase::outerStride() */

\sa MapBase::outerStride() */

\internal * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */

\internal * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */

Preallocates \a reserveSize non zeros. * * Precondition: the matrix must be in compressed mode. */

Preallocates \a reserveSize non zeros. * * Precondition: the matrix must be in compressed mode. */

EIGEN_PARSED_BY_DOXYGEN

EIGEN_PARSED_BY_DOXYGEN

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

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

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

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

\returns the number of rows. \sa cols() */

\returns the number of rows. \sa cols() */

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

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

Swaps the content of two sparse matrices of the same type. * This is a fast operation that simply swaps the underlying pointers and parameters.

Swaps the content of two sparse matrices of the same type. * This is a fast operation that simply swaps the underlying pointers and parameters.

\returns an expression of the coefficient-wise tan of *this. * * Example: \include Cwise_tan.cpp * Output: \verbinclude Cwise_tan.out * * \s

\returns an expression of the coefficient-wise tan of *this. * * Example: \include Cwise_tan.cpp * Output: \verbinclude Cwise_tan.out * * \s

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

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