CppAD: A C++ Algorithmic Differentiation Package
20130918
|
bool link_sparse_jacobian | ( | size_t | size, |
size_t | repeat, | ||
size_t | m, | ||
const CppAD::vector< size_t > & | row, | ||
const CppAD::vector< size_t > & | col, | ||
CppAD::vector< double > & | x, | ||
CppAD::vector< double > & | jacobian, | ||
size_t & | n_sweep | ||
) |
Package specific implementation of a sparse Jacobian claculation.
size | [in] is the size of the domain space; i.e. specifies n . |
repeat | [in] number of times tha the test is repeated. |
m | [in] is the dimension of the range space for f(x). |
row | [in] is the row indices correpsonding to non-zero Jacobian entries. |
col | [in] is the column indices corresponding to non-zero Jacobian entries. |
x | [out] is a vector of size n containing the argument at which the Jacobian was evaluated during the last repetition. |
jacobian | [out] is a vector with size m * n containing the value of the Jacobian of f(x) corresponding to the last repetition. |
n_sweep | [out] The input value of this parameter does not matter. Upon return, it is the number of sweeps (colors) corresponding to the sparse jacobian claculation. |
Referenced by available_sparse_jacobian(), correct_sparse_jacobian(), info_sparse_jacobian(), and speed_sparse_jacobian().