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

\brief Number of rows of transformation viewed as a matrix. * \returns Number of rows * \details This equals the dimension of the space t

* \brief Set the initial shift parameter */

\returns an equivalent rotation matrix */

\sa MatrixBase::coeff() * \warning the coordinates must fit into the referenced triangular part */

\brief Number of columns of transformation viewed as a matrix. * \returns Number of columns * \details This equals the dimension of the sp

* Compute the symbolic and numeric factorization of the input sparse matrix. * The input matrix should be in column-major storage. */

\returns the size of the main diagonal, which is min(rows(),cols()). * \sa rows(), cols(), SizeAtCompileTime. */

Given an \a index of a node, on exit, \a outVBegin and \a outVEnd range over the indices of the volume children of the node * and \a outOBegin and

\returns the index of the root of the hierarchy */

\returns true if the matrix is negative (semidefinite) */

\returns true if the matrix is positive (semidefinite) */

\internal */

\brief Computes the positive-definite square root of the matrix. * * \returns the positive-definite square root of the matrix *

\returns the projection of a point \a p onto the plane \c *this. */

\returns an expression of the \a i-th row of *this. Note that the numbering starts at 0. * * Example: \include MatrixBase_row.cpp * Output: \ver