On entry: if
${\mathbf{jceval}}=\text{'S'}$,
$\text{'F'}$ or
$\text{'D'}$,
ja must contain details of the sparsity pattern to be used for the Jacobian.
ja contains the row indices where nonzero elements occur, reading in column-wise order, and
ia contains the starting locations in
ja of the descriptions of columns
$1,2,\dots ,{\mathbf{neq}}$ in that order, with
${\mathbf{ia}}\left(1\right)=1$. Thus for each column index
$j=1,2,\dots ,{\mathbf{neq}}$, the values of the row index
$i$ in column
$j$ where a nonzero element may occur are given by
where
${\mathbf{ia}}\left(j\right)\le k<{\mathbf{ia}}\left(j+1\right)$.
Thus the total number of nonzeros,
$\mathit{nelement}$, must be
${\mathbf{ia}}\left({\mathbf{neq}}+1\right)-1$. For example, for the following matrix
where
$x$ represents nonzero elements (13 in all) the arrays
ia and
ja should be
ja is not used if
${\mathbf{jceval}}=\text{'N'}$ or
$\text{'A'}$.