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

\returns the dimension of the kernel of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pi

In case some methods are only defined for specific tangent bundles

\brief Constructs the Hessenberg matrix H in the decomposition * * \returns expression object representing the matrix H * * \p

* \brief Mathematical modulo operator that maps value to [0, modValue) in the integer realm. Allows * for negative values. Given value, finds x s

Reading an OBJ file into a surface TriMesh class.

* \brief Set the number of rows and columns blocks */

PushBack adds w at the end of the queue. If queue is full returns w, otherwise returns default-constructed Work.

Functions that interface comfortably into the DCEL

PGI++ does not define the following intrinsics in C++ mode.

template<typename Scalar_>

complex-to-complex forward FFT

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

Preallocates \a reserveSize non zeros */

Resizes \c *this to a \a rows x \a cols matrix. * * This method is intended for dynamic-size matrices, although it is legal to call it on

Only plain matrices/arrays, not expressions, may be resized; therefore the only useful resize methods are * Matrix::resize() and Array::resize()