|
CppAD: A C++ Algorithmic Differentiation Package
20171217
|
| void CppAD::ADFun< Base >::for_jac_sparsity | ( | const sparse_rc< SizeVector > & | pattern_in, |
| bool | transpose, | ||
| bool | dependency, | ||
| bool | internal_bool, | ||
| sparse_rc< SizeVector > & | pattern_out | ||
| ) |
Forward Jacobian sparsity patterns.
| Base | is the base type for this recording. |
| SizeVector | is the simple vector with elements of type size_t that is used for row, column index sparsity patterns. |
| pattern_in | is the sparsity pattern for for R or R^T depending on transpose. |
| transpose | Is the input and returned sparsity pattern transposed. |
| 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)
|
| internal_bool | If this is true, calculations are done with sets represented by a vector of boolean values. Othewise, a vector of standard sets is used. |
| pattern_out | The value of transpose is false (true), the return value is a sparsity pattern for J(x) ( J(x)^T ) where
|
Definition at line 208 of file for_jac_sparsity.hpp.