\returns a const pointer to the column major internal matrix */

\sa MatrixBase::fill() */

\returns the first element \f$ a_0 \f$ in the sequence */

* Use LQR feedback policy to roll out trajectory */

\internal * \brief Reallocates aligned memory. * Since we know that our handmade version is based on std::malloc * we can use std::realloc to im

\brief Reports whether previous computation was successful. * * \returns \c Success if computation was successful, \c NoConvergence otherw

\returns NumericalIssue if the input contains INF or NaN values or overflow occurred. Returns Success otherwise. */

\returns the inverse of the matrix of which *this is the LU decomposition. * * \warning The matrix being decomposed here is assumed to be

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

\internal return the index of the coeff at (row,col) or just before if it does not exist. * This is an analogue of std::lower_bound. */

FIXME is it still needed ? \internal */

\returns an expression of the factor L */

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

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