Get a view of the r.h.s. vector b, not weighted by noise */

/ ! This function returns true if \forall i, a*x[i]+y[i] <= z[i]. */ /

/

@deprecated The following function has been deprecated, use K above */

Get the underlying matrix.

\returns the sparse triangular factor R. It is a sparse matrix */

\returns the matrix \b Z. */

Get the namespaces which this class is nested under as a list.

Private: Normalize a two-vector.

Return the normal

current number of students

Sets *this to the identity matrix. * This function also turns the matrix into compressed mode, and drop any reserved memory. */

Create new factor by summing all values with the same separator values

vectorized form (column-wise)

/

/ ! Given a vertex and two weights, this function returns 1, if the second partition will be more balanced than the first after the weighted

* Compute D = differentiation matrix. * Given coefficients c of a Fourier series c, D*c are the values of c'. */

PopFront removes and returns the first element in the queue. If the queue was empty returns default-constructed Work.

constructors using endpoints */

* Constructor with a subset of coefficients specified. * * @param[in] C the coefficients <i>C</i>_<i>nm</i>. * @param[in] S t

PGI++ does not define the following intrinsics in C++ mode.

Compute* full augmented information matrix

get the dimension of the factor (number of rows on linearization) */

Iterator pointing past the last frontal key. */

test function for CalculateWeights and DerivativeWeights

Return the dimension of the variable pointed to by the given key iterator * todo: Remove this in favor of keeping track of dimensions with variab

/ ! This function frees the memory that has been allocated since the last call to gk_malloc_init(). */ /

/ ! This function initializes tracking of heap allocations. */ /

/

\returns a const pointer to the array of the number of non zeros of the inner vectors. * This function is aimed at interoperability with other l