* c h e c k C u r v a t u r e O n S e t S */

Cleans the list of strings given as `pieces`. It replaces multiple newlines by a maximum of 2 and returns a new list. It also wraps the p

Cleans the list of strings given as `pieces`. It replaces multiple newlines by a maximum of 2 and returns a new list. It also wraps t

\brief Get column offsets (see public class) \identifier{ei} */

@{ Copy sign

p = amd(A+A') if symmetric is true, or amd(A'A) otherwise */

breadth-first search for coarse decomposition (C0,C1,R1 or R0,R3,C3) */

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

allocate a cs_dmperm or cs_scc result */

compute the etree of A (using triu(A), or A'A without forming A'A */

[L,U,pinv]=lu(A, [q lnz unz]). lnz and unz can be guess */

C = A*B */

C = A(p,q) where p and q are permutations of 0..m-1 and 0..n-1. */

pinv = p', or p = pinv' */

post order a forest */

sparse QR factorization [V,beta,pinv,R] = qr (A) */

ordering and symbolic analysis for a Cholesky factorization */

C = A(p,p) where A and C are symmetric the upper part stored; pinv not p */

depth-first search and postorder of a tree rooted at node j */

collect unmatched rows into the permutation vector p */

solve U'x=b where x and b are dense. x=b on input, solution on output. */

A : n-by-l B: l-by-m C = A*B

\brief Deserialize with type disambiguation */

* d e t e r m i n e S t e p D i r e c t i o n */

\brief Print more \identifier{e5} */

Enables de-allocation of internal memory. */

Subroutine */

\brief Expand the expression as a weighted sum (with constant weights) \identifier{192} */