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

Disables de-allocation of internal memory. */

General unit test for checking casadi evaluation against a reference solution. Checks if yr is the same as Function(name,x,yt) , evaluated f

@{ \brief Largest of two values: (x,y) -> max(x,y) \identifier{pu} */

Given a node and a sequence of strings in `names`, return a dictionary containing the names as keys and child `ELEMENT_NODEs`, that ha

* i n i t */

Is the variable real?

* m o v e A c t i v e T o I n a c t i v e */

Returns whether internal memory needs to be de-allocated. * \return BT_TRUE iff internal memory needs to be de-allocated, \n

Queery plugin name

Symbolic factorization

* CVDlsSetBandJacFn specifies the band Jacobian function. */

* CVDlsSetDenseJacFn specifies the dense Jacobian function. */

* CVSlsSetSparseJacFn specifies the sparse Jacobian function. */

! \fn int DSDPBlockDataRowSparsity(DSDPBlockData *ADATA,int row, int ai[], int rnnz[],int n); \brief Determine sparsity pattern of data. \param ADATA

! \fn int DSDPDualMatInverseMultiply(DSDPDualMat S, DSDPIndex IS, SDPConeVec B, SDPConeVec X); \brief Multiply the inverse by a vector or solve the sy

! \fn int DSDPSchurMatAddRow(DSDPSchurMat M, int row, double alpha, DSDPVec R); \brief Add elements to a row of the Schur matrix. \param M matrix \par

! \fn int DSDPSchurMatDiagonalScaling(DSDPSchurMat M, DSDPVec D); \brief Get the scaling and nonzero pattern of each diagonal element of the matrix.

! \fn int DSDPSchurMatSolve(DSDPSchurMat M, DSDPVec b, DSDPVec x); \brief Solve the linear system \param M matrix \param b the right-hand side \param