\returns number of rows of the factored matrix */

\returns the size of a side of the respective square matrix, i.e., the number of indices */

\returns the rotation angle in [0,2pi] */

\internal * \sa insertBack, insertBackByOuterInner */

\returns a const pointer to the array of values. * This function is aimed at interoperability with other libraries. * \sa innerIndexPtr(),

* Get the number of columns of the input matrix. */

\returns the number of columns of the matrix */

\returns true if \a U (full or thin) is asked for in this SVD decomposition */

\internal */

\returns the number of rows of the matrix */

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

template<typename _Scalar>

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

\returns the distance of a point \a p to its projection onto the line \c *this. * \sa squaredDistance() */

\return the equivalent permutation matrix */

The following is needed for std::complex<Real>:

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 the image of the matrix, also called its column-space. The columns of the returned matrix * will form a basis of the image (column-spac

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

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