\returns the pointer increment between two consecutive elements within a slice in the inner direction. * * \sa outerStride(), rowStride(),

\sa MapBase::innerStride() */

\returns the inverse of the matrix of which *this is the LU decomposition. * * \warning The matrix being decomposed here is assumed to be

\returns the kernel of the matrix, also called its null-space. The columns of the returned matrix * will form a basis of the kernel. *

\internal * \returns the Dim x Dim linear part if the transformation is affine, * and the HDim x Dim part for projective transformati

Turns the matrix into the \em compressed format. */

\returns an expression of the matrix L, internally stored as supernodes * The only operation available with this expression is the triangular so

\returns an expression of the factor L */

\returns a view of the lower triangular matrix L */

\returns an expression of the factor U (= L^*) */

\returns a view of the upper triangular matrix U */

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

\returns a row (or column) vector expression of the norm * of each column (or row) of the referenced expression. * * Example: \inclu

\returns an expression where each column of row of the referenced matrix are normalized. * The referenced matrix is \b not modified. * \sa

* Return the number of supernodes */

\returns the pointer increment between two consecutive inner slices (for example, between two consecutive columns * in a column-major m

\internal * \returns the size in Bytes of the L1 data cache */

\internal * \returns the size in Bytes of the L2 or L3 cache if this later is present */

* 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() */

\returns the rank of the matrix of which \c *this is the SVD. * * \note This method has to determine which singular values should be consi

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

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

* Number of rows */

Specifies a sub-vector to work on */

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

\returns the number of sub diagonals */

\returns the number of super diagonals */

To use for operations with the transpose of Q

Returns the transposed transformation */