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

* \brief Reports whether the minimization was successful * \returns \c Success if the minimization was succesful, * \c NumericalIssu

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

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

Must be call first when calling Eigen from multiple threads */

\returns the pointer increment between two consecutive elements within a slice in the inner direction. * * \sa outerStride(), rowStride(),

\sa MapBase::innerStride() */

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

\deprecated use isEmpty() */

Regression test for bug 286: JacobiSVD loops indefinitely with some matrices containing denormal numbers.

Regression test for bug 286: JacobiSVD loops indefinitely with some matrices containing denormal numbers.

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

Turns the matrix into the \em compressed format. */

Regression test for bug reported at http://forum.kde.org/viewtopic.php?f=74&t=96947

\returns an expression of the matrix L, internally stored as supernodes * The only operation available with this expression is the triangular so

\returns an expression of the factor L */

\returns a view of the lower triangular matrix L */

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

\returns a view of the upper triangular matrix U */

\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

minval is 'safe' meaning 1 / minval does not overflow

\returns the max number of threads reserved for Eigen * \sa setNbThreads */

get/set the "noisyness" (verbosity) of the solvers */

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

\returns the number of non zero coefficients * * \note According to the underlying map/hash_map implementation, * this function migh

\returns a row (or column) vector expression of the norm * of each column (or row) of the referenced expression. * * Example: \inclu

\returns an expression where each column of row of the referenced matrix are normalized. * The referenced matrix is \b not modified. * \sa

* Return the number of supernodes */

\returns the pointer increment between two consecutive inner slices (for example, between two consecutive columns * in a column-major m