1#ifndef STAN_MATH_PRIM_PROB_PARETO_CDF_HPP
2#define STAN_MATH_PRIM_PROB_PARETO_CDF_HPP
20template <
typename T_y,
typename T_scale,
typename T_shape,
22 T_y, T_scale, T_shape>* =
nullptr>
25 const T_shape& alpha) {
32 static constexpr const char* function =
"pareto_cdf";
34 y_min,
"Shape parameter", alpha);
40 T_y_min_ref y_min_ref = y_min;
41 T_alpha_ref alpha_ref = alpha;
47 T_partials_return P(1.0);
53 size_t N =
max_size(y, y_min, alpha);
58 if (y_vec.val(i) < y_min_vec.val(i)) {
59 return ops_partials.build(0.0);
63 for (
size_t n = 0; n < N; n++) {
66 if (y_vec.val(n) ==
INFTY) {
70 const T_partials_return log_dbl =
log(y_min_vec.val(n) / y_vec.val(n));
71 const T_partials_return y_min_inv_dbl = 1.0 / y_min_vec.val(n);
72 const T_partials_return alpha_dbl = alpha_vec.val(n);
74 const T_partials_return Pn = 1.0 -
exp(alpha_dbl * log_dbl);
79 partials<0>(ops_partials)[n]
80 += alpha_dbl * y_min_inv_dbl *
exp((alpha_dbl + 1) * log_dbl) / Pn;
83 partials<1>(ops_partials)[n]
84 += -alpha_dbl * y_min_inv_dbl *
exp(alpha_dbl * log_dbl) / Pn;
87 partials<2>(ops_partials)[n] += -
exp(alpha_dbl * log_dbl) * log_dbl / Pn;
93 partials<0>(ops_partials)[n] *= P;
98 partials<1>(ops_partials)[n] *= P;
103 partials<2>(ops_partials)[n] *= P;
106 return ops_partials.build(P);
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_scale_cl, T_shape_cl > pareto_cdf(const T_y_cl &y, const T_scale_cl &y_min, const T_shape_cl &alpha)
Returns the Pareto 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>>.
void check_nonnegative(const char *function, const char *name, const T_y &y)
Check if y is non-negative.
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.
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.
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...