1#ifndef STAN_MATH_PRIM_PROB_DOUBLE_EXPONENTIAL_LCCDF_HPP
2#define STAN_MATH_PRIM_PROB_DOUBLE_EXPONENTIAL_LCCDF_HPP
35template <
typename T_y,
typename T_loc,
typename T_scale,
37 T_y, T_loc, T_scale>* =
nullptr>
39 const T_y& y,
const T_loc& mu,
const T_scale& sigma) {
43 static constexpr const char* function =
"double_exponential_lccdf";
48 mu,
"Scale Parameter", sigma);
51 T_sigma_ref sigma_ref = sigma;
60 T_partials_return ccdf_log(0.0);
70 for (
size_t i = 0; i < size_sigma; i++) {
71 inv_sigma[i] =
inv(sigma_vec.val(i));
74 for (
size_t n = 0; n < N; n++) {
75 const T_partials_return y_dbl = y_vec.val(n);
76 const T_partials_return mu_dbl = mu_vec.val(n);
77 const T_partials_return scaled_diff = (y_dbl - mu_dbl) * inv_sigma[n];
79 const T_partials_return rep_deriv
80 = y_dbl < mu_dbl ? inv_sigma[n] *
inv(2 *
exp(-scaled_diff) - 1)
84 ccdf_log +=
log1m(0.5 *
exp(scaled_diff));
90 partials<0>(ops_partials)[n] -= rep_deriv;
93 partials<1>(ops_partials)[n] += rep_deriv;
96 partials<2>(ops_partials)[n] += rep_deriv * scaled_diff;
99 return ops_partials.build(ccdf_log);
VectorBuilder allocates type T1 values to be used as intermediate values.
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 > double_exponential_lccdf(const T_y_cl &y, const T_loc_cl &mu, const T_scale_cl &sigma)
Returns the double exponential log complementary cumulative density function.
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>>.
static constexpr double LOG_HALF
The natural logarithm of 0.5, .
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
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.
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
fvar< T > log1m(const fvar< T > &x)
fvar< T > inv(const fvar< T > &x)
auto make_partials_propagator(Ops &&... ops)
Construct an partials_propagator.
void check_positive_finite(const char *function, const char *name, const T_y &y)
Check if y is positive and finite.
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...