|
CppAD: A C++ Algorithmic Differentiation Package
20130102
|
| void RevSparseJacBool | ( | size_t | p, |
| const VectorSet & | s, | ||
| VectorSet & | r, | ||
| size_t | total_num_var, | ||
| CppAD::vector< size_t > & | dep_taddr, | ||
| CppAD::vector< size_t > & | ind_taddr, | ||
| CppAD::player< Base > & | play | ||
| ) |
Calculate Jacobian vector of bools sparsity patterns using reverse mode.
The C++ source code corresponding to this operation is
s = f.RevSparseJac(q, r)
| Base | is the base type for this recording. |
| VectorSet | is a simple vector class with elements of type bool. |
| p | is the number of rows in the matrix . |
| s | is a sparsity pattern for the matrix . |
| r | the input value of r must be a vector with size p*n where n is the number of independent variables corresponding to the operation sequence stored in play. The input value of the components of r does not matter. On output, r is the sparsity pattern for the matrix
is the function corresponding to the operation sequence and x is any argument value. |
| total_num_var | is the total number of variable in this recording. |
| dep_taddr | maps dependendent variable index to the corresponding variable in the tape. |
| ind_taddr | maps independent variable index to the corresponding variable in the tape. |
| play | is the recording that defines the function we are computing the sparsity pattern for. |
Definition at line 190 of file rev_sparse_jac.hpp.
Referenced by ADFun< Base >::RevSparseJacCase().