1#ifndef STAN_MATH_PRIM_PROB_GAMMA_LCDF_HPP
2#define STAN_MATH_PRIM_PROB_GAMMA_LCDF_HPP
24template <
typename T_y,
typename T_shape,
typename T_inv_scale>
27 const T_inv_scale&
beta) {
35 static constexpr const char* function =
"gamma_lcdf";
37 alpha,
"Inverse scale parameter",
beta);
39 T_alpha_ref alpha_ref = alpha;
40 T_beta_ref beta_ref =
beta;
49 T_partials_return P(0.0);
60 if (y_vec.val(i) == 0) {
65 for (
size_t n = 0; n < N; n++) {
68 if (y_vec.val(n) ==
INFTY) {
69 return ops_partials.build(0.0);
72 const T_partials_return y_dbl = y_vec.val(n);
73 const T_partials_return log_y_dbl =
log(y_dbl);
74 const T_partials_return alpha_dbl = alpha_vec.val(n);
75 const T_partials_return beta_dbl = beta_vec.val(n);
76 const T_partials_return log_beta_dbl =
log(beta_dbl);
77 const T_partials_return beta_y_dbl = beta_dbl * y_dbl;
79 const T_partials_return Pn =
gamma_p(alpha_dbl, beta_y_dbl);
80 const T_partials_return log_Pn =
log(Pn);
85 const T_partials_return d_num
86 = (-beta_y_dbl) + (alpha_dbl - 1) * (log_beta_dbl + log_y_dbl);
87 const T_partials_return d_den =
lgamma(alpha_dbl) + log_Pn;
88 const T_partials_return d =
exp(d_num - d_den);
91 partials<0>(ops_partials)[n] += beta_dbl * d;
94 partials<2>(ops_partials)[n] += y_dbl * d;
98 partials<1>(ops_partials)[n]
102 return ops_partials.build(P);
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
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 negative_infinity()
Return negative infinity.
void check_nonnegative(const char *function, const char *name, const T_y &y)
Check if y is non-negative.
return_type_t< T_y, T_shape, T_inv_scale > gamma_lcdf(const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
fvar< T > log(const fvar< T > &x)
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
fvar< T > lgamma(const fvar< T > &x)
Return the natural logarithm of the gamma function applied to the specified argument.
fvar< T > gamma_p(const fvar< T > &x1, const fvar< T > &x2)
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
fvar< T > beta(const fvar< T > &x1, const fvar< T > &x2)
Return fvar with the beta function applied to the specified arguments and its gradient.
return_type_t< T1, T2 > grad_reg_lower_inc_gamma(const T1 &a, const T2 &z, double precision=1e-10, int max_steps=1e5)
Computes the gradient of the lower regularized incomplete gamma function.
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.
static constexpr double INFTY
Positive infinity.
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...