\returns the inverse rotation */

\returns the inverse rotation */

\brief Inverse of the Householder sequence (equals the adjoint). */

\returns the inverse transformation */

\returns the inverse permutation matrix. * * \note \blank \note_try_to_help_rvo */

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

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

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\copydoc SparseCompressedBase::isCompressed */

\returns true if the box is empty. * \sa setEmpty */

\returns an expression of the coefficient-wise isfinite of *this. * * Example: \include Cwise_isFinite.cpp * Output: \verbinclude Cwise_isFinite

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

\returns true if the matrix of which *this is the QR decomposition represents an injective * linear map, i.e. has trivial kernel; false

\returns true if the matrix of which *this is the QR decomposition represents an injective * linear map, i.e. has trivial kernel; false

\returns true if the matrix of which *this is the LU decomposition represents an injective * linear map, i.e. has trivial kernel; false

\returns true if the matrix of which *this is the QR decomposition is invertible. * * \note This method has to determine which pivots shou

\returns true if the matrix of which *this is the QR decomposition is invertible. * * \note This method has to determine which pivots shou

\returns true if the matrix of which *this is the LU decomposition is invertible. * * \note This method has to determine which pivots shou

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

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

\deprecated use isEmpty() */

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

\returns true if the matrix of which *this is the QR decomposition represents a surjective * linear map; false otherwise. *

\returns true if the matrix of which *this is the QR decomposition represents a surjective * linear map; false otherwise. *

\returns true if the matrix of which *this is the LU decomposition represents a surjective * linear map; false otherwise. *

Indicate that the pattern of the input matrix is symmetric */

This is just here to avoid compiler warnings with macro constants and boolean literals

This is just here to avoid compiler warnings with macro constants and boolean literals

\returns true if either the number of rows or the number of columns is equal to 1. * In other words, this function returns * \code rows()=

\returns the number of iterations performed during the last solve */

\brief Returns number of performed QR-like iterations. */

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

\returns the currently set level 1 cpu cache size (in bytes) used to estimate the ideal blocking size parameters. * \sa setCpuCacheSize */

\returns the currently set level 2 cpu cache size (in bytes) used to estimate the ideal blocking size parameters. * \sa setCpuCacheSize */

* \returns A string describing the type of error */

\returns A string describing the type of error. * This method is provided to ease debugging, not to handle errors. */

init in {'gauss', 'identity', 'random'}

\returns an expression of the coefficient-wise ln(|gamma(*this)|). * * Example: \include Cwise_lgamma.cpp * Output: \verbinclude Cwise_lgamma.out

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