* a d d N u m b e r */

* Allocate differential equation, called in mexFunction() */

* a l l o c a t e G l o b a l Q P r o b l e m B I n s t a n c e */

* a l l o c a t e G l o b a l Q P r o b l e m I n s t a n c e */

* a l l o c a t e G l o b a l S Q P r o b l e m I n s t a n c e */

* a l l o c a t e Q P r o b l e m I n s t a n c e */

* a l l o c a t e Q P r o b l e m I n s t a n c e */

* a l l o c a t e Q P r o b l e m I n s t a n c e */

Performs a symbolic decomposition on the sparcity of \a matrix. * * This function is particularly useful when solving for several problems

\returns the stored value at index \a key * If the value does not exist, then the value \a defaultValue is returned without any insertion. */

Like at(), but the search is performed in the range [start,end) */

\returns the center of the box */

\returns a pointer to the SPQR workspace */

* Return the array of column-to-supernode mapping */

* Number of columns */

\returns the number of rows */

* Compute the left and right diagonal matrices to scale the input matrix @p mat * * FIXME This algorithm will be modified such that the dia

\brief Complex conjugate of the Householder sequence. */

* c o n t a i n s I n f */

* c o n t a i n s I n f */

* c o n t a i n s I n f */

* c o n t a i n s N a N */

* c o n t a i n s N a N */

* c o n t a i n s N a N */

* c o n v e r t F o r t r a n T o C */

* c o n v e r t P r i n t L e v e l T o S t r i n g */

* c o n v e r t S u b j e c t T o S t a t u s T o S t r i n g */

* c o p y */

C = alpha*A + beta*B */

find an augmenting path starting at column k and extend the match if found */

L = chol (A, [pinv parent cp]), pinv is optional */

C = compressed-column form of a triplet matrix T */

find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k)) */

create a Householder reflection [v,beta,s]=house(x), overwrite x with v, * where (I-beta*v*v')*x = s*e1. See Algo 5.1.1, Golub & Van Loan, 3rd ed. *

consider A(i,j), node j in ith row subtree and return lca(jprev,j) */

find a maximum transveral */

1-norm of a sparse matrix = max (sum (abs (A))), largest column sum */

return a random permutation vector, the identity perm, or p = n-1:-1:0. * seed = -1 means p = n-1:-1:0. seed = 0 means p = identity. otherwise * p

xi [top...n-1] = nodes reachable from graph of G*P' via nodes in B(:,k). * xi [n...2n-1] used as workspace */

find the strongly connected components of a square matrix */

ordering and symbolic analysis for a Cholesky factorization */

solve Gx=b(:,k), where G is either upper (lo=0) or lower (lo=1) triangular */

compute nnz(V) = S->lnz, S->pinv, S->leftmost, S->m2 from A and S->parent */

\returns an expression of the coefficient-wise == operator of \c *this and a scalar \a s * * \warning this performs an exact comparison, which is

\returns a const pointer to the column major internal matrix */

* d e l e t e Q P r o b l e m I n s t a n c e */

* d e l e t e Q P r o b l e m I n s t a n c e */