interpolating field from nodes in palces specified by barycentric coordinates. The interpolator needs to interpret them.

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

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

\returns the stored value of the symbol */

Default constructor Start a series of r trials:

Constructs a uniform scaling from scale factor \a s */

\returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */

\returns the number of rows of the represented matrix. */

\returns an expression of the transposed of the factored matrix. * * A typical usage is to solve for the transposed problem A^T x = b:

\returns the outer size. * * \note For a vector, this returns just 1. For a matrix (non-vector), this is the major dimension * with

Takes a field in raw form and computes both the principal effort and the consequent principal matching on every edge. Important: if the Raw field in

\internal * Resize the nonzero vector to \a size */

Sets all coefficients to zero. */

fuctionally equivalent to _mm_shuffle_pd in SSE (i.e. shuffle(m, n, mask) equals _mm_shuffle_pd(m,n,mask)) Currently used in LU/arch/InverseSize4.h to

\returns true if the matrix of which *this is the LU decomposition is invertible. * * \note This method has to determine which pivots shou

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