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

Resizes the matrix to \a rows x \a cols while leaving old values untouched. * * The method is intended for matrices of dynamic size. If yo

* return the number of evaluation of functor */

\returns an expression for the bounding box diagonal vector * if the length of the diagonal is needed: diagonal().norm() * will provide it.

\brief Returns the maximum number of iterations. */

\internal Like malloc, but the returned pointer is guaranteed to be 16-byte aligned. * Fast, but wastes 16 additional bytes of memory. Does not thro

Sets the last row to [0 ... 0 1] */

\returns an expression of the matrix Q as products of sparse Householder reflectors. * The common usage of this function is to apply it to a dense

\returns the norm of the quaternion's coefficients * \sa Quaternion::squaredNorm(), MatrixBase::norm() */

\returns a normalized copy of \c *this * \sa normalize(), MatrixBase::normalized() */

\returns the size of the storage major dimension, * i.e., the number of columns for a columns major matrix, and the number of rows otherwise */

Uniformly distributed random number generation a = random(seed); <- initialization & first random number generation a = random(); <- next random n

Resizes the matrix to a \a rows x \a cols matrix and initializes it to zero. * \sa resizeNonZeros(Index), reserve(), setZero() */

\internal */

\sa MatrixBase::setIdentity() */

Sets the maximum number of function evaluation */

\returns an expression of the coefficient-wise square of *this. * * Example: \include Cwise_square.cpp * Output: \verbinclude Cwise_square.out

\returns the squared norm of the quaternion's coefficients * \sa QuaternionBase::norm(), MatrixBase::squaredNorm() */

\returns true if the factorization succeeded */

* Return the array of supernode-to-column mapping */