template<class Base >

void CppAD::local::forward_erf_op_dir ( size_t  q, size_t  r, size_t  i_z, const addr_t *  arg, const Base *  parameter, size_t  cap_order, Base *  taylor  )

inline

Forward mode Taylor coefficient for result of op = ErfOp.

The C++ source code corresponding to this operation is

     z = erf(x)

Template Parameters

Base	base type for the operator; i.e., this operation was recorded using AD< Base > and computations by this routine are done using type Base.

Parameters

q	order of the Taylor coefficients that we are computing.
r	number of directions for the Taylor coefficients that we afre computing.
i_z	variable index corresponding to the last (primary) result for this operation; i.e. the row index in taylor corresponding to z. The auxillary results have index i_z - j for j = 0 , ... , 4 (and include z).
arg	arg[0]: is the variable index corresponding to x. arg[1]: is the parameter index corresponding to the value zero. [2]: is the parameter index correspodning to the value 2 / sqrt(pi).
parameter	parameter[ arg[1] ] is the value zero, and parameter[ arg[2] ] is the value 2 / sqrt(pi).
cap_order	maximum number of orders that will fit in the taylor array.

tpv

We use the notation tpv = (cap_order-1) * r + 1 which is the number of Taylor coefficients per variable

Parameters

taylor

Input: If x is a variable, taylor [ arg[0] * tpv + 0 ], is the zero order Taylor coefficient for all directions and taylor [ arg[0] * tpv + (k-1)*r + ell + 1 ], for k = 1 , ... , q, ell = 0, ..., r-1, is the k-th order Taylor coefficient corresponding to x and the ell-th direction. Input: taylor [ (i_z - j) * tpv + 0 ] is the zero order Taylor coefficient for all directions and the j-th result for z. for k = 1 , ... , q-1, ell = 0, ... , r-1, taylor[ (i_z - j) * tpv + (k-1)*r + ell + 1] is the Taylor coefficient for the k-th order, ell-th direction, and j-th auzillary result. Output: taylor [ (i_z-j) * tpv + (q-1)*r + ell + 1 ], for ell = 0 , ... , r-1, is the Taylor coefficient for the q-th order, ell-th direction, and j-th auzillary result.

Checked Assertions

• NumArg(op) == 3
• NumRes(op) == 5
• 0 < q < cap_order

Definition at line 332 of file erf_op.hpp.

Referenced by forward2sweep().