\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 */

\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()=

* @brief * * @param projection1 * @param projection2 * @return true * @return false */

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

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

\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. */

\returns a block consisting of the left columns of *this. * * \param n the number of columns in the block * * Example: \include MatrixBase_lef

nothing special here

\returns the natural log of the absolute value of the determinant of the matrix * of which **this is the QR decomposition * * \no

\returns an expression of the factor L */

Get an expression of the matrix Q

\brief Reconstructs the orthogonal matrix Q in the decomposition * * \returns object representing the matrix Q * * \pre Either

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

\returns a row (or column) vector expression of the largest coefficient * of each column (or row) of the referenced expression. * *

\returns the max number of iterations */

\returns the absolute value of the biggest pivot, i.e. the biggest * diagonal coefficient of U. */

\returns the absolute value of the biggest pivot, i.e. the biggest * diagonal coefficient of R. */

\returns a row (or column) vector expression of the mean * of each column (or row) of the referenced expression. * * \sa DenseBase::mean()

Returns an AlignedBox that is the union of \a b and \c *this. * \note Merging with an empty box may result in a box bigger than \c *this. * \sa

\returns a block consisting of a range of columns of *this. * * \param startCol the index of the first column in the block * \param numCols the

\returns a block consisting of a range of rows of *this. * * \param startRow the index of the first row in the block * \param n the number of ro

\returns a row (or column) vector expression of the smallest coefficient * of each column (or row) of the referenced expression. *

Convert metre per second to kilometers per hour

\returns the number of nonzero coefficients which is in practice the number * of stored coefficients. */

\returns the number of nonzero coefficients which is in practice the number * of stored coefficients. */

\returns the number of non zero coefficients */

\returns the number of nonzero pivots in the QR decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

\returns the number of singular values that are not exactly 0 */

* @brief Normalize a vector to get a unit vector * * @param vec Vector to be normalized * @return geometry_msgs::Vector3 */

Normalizes the quaternion \c *this * \sa normalized(), MatrixBase::normalize() */

normalizes \c *this */

Normalize in-place each row or columns of the referenced matrix. * \sa MatrixBase::normalize(), normalized() */