\returns The determinant of the matrix. * * \sa absDeterminant(), logAbsDeterminant() */

\return the equivalent permutation matrix */

Append new vectors to the search space and orthogonalize the resulting matrix \param new_vect Matrix of new correction vectors

\returns the distance between the boxes \a b and \c *this, * and zero if the boxes intersect. * \sa squaredExteriorDistance(const AlignedBox&)

Does nothing: provided for compatibility with SparseMatrix */

Formats the duration in seconds to 3 decimal places. This is done because some genius defined Maven Surefire schema in a way that only accepts 3 decim

Generate random sparse matrix

Because formatting using c++ streams is stateful, drop down to C is required Alternatively we could use stringstream, but its performance is... not go

IContext

* Returns an iterator to the node that stores the information * of the given virtual pointer from the given pointer map structure. * If pointer

Returns the results for external use

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

TODO: attempt to speed this up. The integer divisions and modulo are slow

Returns the status of the computation. The full list of enumeration values can be found in \ref Enumerations.

Indicate that the pattern of the input matrix is symmetric */

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.