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

\internal */

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

\returns the number of rows of the matrix */

Set the real shift \f$\sigma\f$.

\internal * \sa insertBack, insertBackByOuterInner */

* Compute the symbolic and numeric factorization of the input sparse matrix. * The input matrix should be in column-major storage. */

template<typename _Scalar>

\returns the size of the main diagonal, which is min(rows(),cols()). * \sa rows(), cols(), SizeAtCompileTime. */

\return the equivalent permutation matrix */

complex-to-complex forward FFT

Given an \a index of a node, on exit, \a outVBegin and \a outVEnd range over the indices of the volume children of the node * and \a outOBegin and

\returns the index of the root of the hierarchy */

Generate data from an Ising model. Parameters ---------- n : int Number of samples to generate. p : int Number o

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

\returns the number of transpositions */

\returns an expression of P H P^-1 where H is the matrix represented by \c *this */

PopBack removes and returns the last elements in the queue. Can fail spuriously.

\sa MatrixBase::coeff() * \warning the coordinates must fit into the referenced triangular part */

* Return the pointers to the beginning of each column in \ref valuePtr() */