1#ifndef STAN_MATH_PRIM_PROB_NORMAL_CDF_HPP
2#define STAN_MATH_PRIM_PROB_NORMAL_CDF_HPP
35template <
typename T_y,
typename T_loc,
typename T_scale,
37 T_y, T_loc, T_scale>* =
nullptr>
40 const T_scale& sigma) {
46 static constexpr const char* function =
"normal_cdf";
48 mu,
"Scale parameter", sigma);
51 T_sigma_ref sigma_ref = sigma;
60 T_partials_return cdf(1.0);
68 for (
size_t n = 0; n < N; n++) {
69 const T_partials_return y_dbl = y_vec.val(n);
70 const T_partials_return mu_dbl = mu_vec.val(n);
71 const T_partials_return sigma_dbl = sigma_vec.val(n);
72 const T_partials_return scaled_diff
73 = (y_dbl - mu_dbl) / (sigma_dbl *
SQRT_TWO);
74 T_partials_return cdf_n;
78 cdf_n = 0.5 *
erfc(-scaled_diff);
82 cdf_n = 0.5 * (1.0 +
erf(scaled_diff));
88 const T_partials_return rep_deriv
92 / (cdf_n * sigma_dbl);
94 partials<0>(ops_partials)[n] += rep_deriv;
97 partials<1>(ops_partials)[n] -= rep_deriv;
100 partials<2>(ops_partials)[n] -= rep_deriv * scaled_diff *
SQRT_TWO;
107 partials<0>(ops_partials)[n] *= cdf;
112 partials<1>(ops_partials)[n] *= cdf;
117 partials<2>(ops_partials)[n] *= cdf;
120 return ops_partials.build(cdf);
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
require_all_not_t< is_nonscalar_prim_or_rev_kernel_expression< std::decay_t< Types > >... > require_all_not_nonscalar_prim_or_rev_kernel_expression_t
Require none of the types satisfy is_nonscalar_prim_or_rev_kernel_expression.
return_type_t< T_y_cl, T_loc_cl, T_scale_cl > normal_cdf(const T_y_cl &y, const T_loc_cl &mu, const T_scale_cl &sigma)
Returns the normal cumulative distribution function for the given location, and scale.
typename return_type< Ts... >::type return_type_t
Convenience type for the return type of the specified template parameters.
int64_t size(const T &m)
Returns the size (number of the elements) of a matrix_cl or var_value<matrix_cl<T>>.
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
fvar< T > erf(const fvar< T > &x)
static constexpr double INV_SQRT_TWO
The value of 1 over the square root of 2, .
static constexpr double INV_SQRT_TWO_PI
The value of 1 over the square root of , .
static constexpr double SQRT_TWO
The value of the square root of 2, .
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
fvar< T > erfc(const fvar< T > &x)
void check_finite(const char *function, const char *name, const T_y &y)
Return true if all values in y are finite.
void check_not_nan(const char *function, const char *name, const T_y &y)
Check if y is not NaN.
void check_positive(const char *function, const char *name, const T_y &y)
Check if y is positive.
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
auto make_partials_propagator(Ops &&... ops)
Construct an partials_propagator.
fvar< T > exp(const fvar< T > &x)
typename ref_type_if< true, T >::type ref_type_t
typename partials_return_type< Args... >::type partials_return_t
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Extends std::true_type when instantiated with zero or more template parameters, all of which extend t...