\internal Frees memory allocated with handmade_aligned_malloc */

Compare deviations when multiplying dense sub-matrices via index lists. */

\brief Reports whether previous computation was successful. * * \returns \c Success if computation was succesful, * \c Nume

* i n i t */

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

\internal \returns b if a<=0, and returns a otherwise. */

\returns the sparse triangular factor R. It is a sparse matrix */

\returns an expression of the matrix U, * The only operation available with this expression is the triangular solve * \code * y = b;

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

* m o v e F i x e d T o F r e e */

* m o v e F i x e d T o F r e e */

* m o v e F i x e d T o F r e e */

\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 size of the storage major dimension, * i.e., the number of columns for a columns major matrix, and the number of rows otherwise */

\sa MapBase::outerStride() */

@brief Cancel remainder term and return polynomial part

* p r i n t C o p y r i g h t N o t i c e */

* p r i n t C o p y r i g h t N o t i c e */

* p r i n t C o p y r i g h t N o t i c e */

* p r i n t */

\internal * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */

* r e m o v e N u m b e r */

Preallocates \a reserveSize non zeros. * * Precondition: the matrix must be in compressed mode. */

EIGEN_PARSED_BY_DOXYGEN

* r e s e t */

* r e s e t */

Forwards the resizing request to the nested expression * \sa DenseBase::resize(Index) */

Converts returnValueType enum type to a const char

* Return the location in \em rowvaluePtr() which starts each column */

* r u n O Q P b e n c h m a r k */

* r u n O Q P b e n c h m a r k */

* Q P r o b l e m B _ c l e a n u p */

* Q P r o b l e m _ c l e a n u p */

* S Q P r o b l e m _ c l e a n u p */

* s e t C o n s t r a i n t P r o d u c t */