Returns the results for external use

\internal Frees memory allocated with handmade_aligned_malloc */

\returns the column or row index of the current coefficient.

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

\returns the currently set level 3 cpu cache size (in bytes) used to estimate the ideal blocking size paramete\ rs.

find the last name, i.e. the last word. for "van den Schbling" types of last names, that's not a problem, that's actually what we want.

Log base 2 for 32 bits positive integers. * Conveniently returns 0 for x==0. */

\brief Get suitable degree for Pade approximation. (specialized for RealScalar = float) */

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

maxval is 'safe' meaning 1 / maxval does not underflow

mul_2si

mul_2ui

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

\returns the number of non zero coefficients */

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

\returns the outer stride */

\returns the block index where outer belongs to */

the permutation used in the QR factorization */

this helper function takes a plain C array and prints it in one line

\internal * \returns the size in Bytes of the L1 data cache */

\internal * \returns the size in Bytes of the L2 or L3 cache if this later is present */

Visual studio doesn't implement a rand_r() function since its implementation of rand() is already thread safe

Visual studio doesn't implement a rand_r() function since its implementation of rand() is already thread safe

\returns the rank of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pivots should be cons