CppAD: A C++ Algorithmic Differentiation Package
20171217
|
void CppAD::ADFun< Base >::RevSparseJacCheckpoint | ( | size_t | q, |
const local::sparse_list & | r, | ||
bool | transpose, | ||
bool | dependency, | ||
local::sparse_list & | s | ||
) |
Reverse mode Jacobian sparsity calculation used by checkpoint functions.
Base | is the base type for this recording. |
transpose | is true (false) s is equal to ![]() ![]()
![]() ![]() |
q | is the number of rows in the matrix ![]() |
r | is a sparsity pattern for the matrix ![]() |
transpose | are the sparsity patterns for ![]() ![]() |
dependency | Are the derivatives with respect to left and right of the expression below considered to be non-zero: CondExpRel(left, right, if_true, if_false)
|
s | The input size and elements of s do not matter. On output, s is the sparsity pattern for the matrix ![]() ![]() |
Definition at line 543 of file rev_sparse_jac.hpp.