Prev | Next | atomic_two_for_sparse_jac |
ok = afun.for_sparse_jac(q, r, s, x)
ok = afun.for_sparse_jac(q, r, s)
for_sparse_jac
computes a sparsity pattern for @(@
S(x)
@)@.
q
has prototype
size_t q
It specifies the number of columns in
@(@
R \in \B{R}^{n \times q}
@)@ and the Jacobian
@(@
S(x) \in \B{R}^{m \times q}
@)@.
const atomic_sparsity& r
and is a atomic_sparsity
pattern for
@(@
R \in \B{R}^{n \times q}
@)@.
atomic_sparsity& s
The input values of its elements
are not specified (must not matter).
Upon return,
s
is a
atomic_sparsity
pattern for
@(@
S(x) \in \B{R}^{m \times q}
@)@.
const CppAD::vector<Base>& x
and size is equal to the
n
.
This is the Value
value corresponding to the parameters in the
vector ax
(when the atomic function was called).
To be specific, if
if( Parameter(ax[i]) == true )
x[i] = Value( ax[i] );
else
x[i] = CppAD::numeric_limits<Base>::quiet_NaN();
The version of this function with out the
x
argument is deprecated;
i.e., you should include the argument even if you do not use it.
ok
has prototype
bool ok
If it is true
, the corresponding evaluation succeeded,
otherwise it failed.