1 #ifndef STAN_MATH_PRIM_SCAL_PROB_PARETO_LPDF_HPP 2 #define STAN_MATH_PRIM_SCAL_PROB_PARETO_LPDF_HPP 17 template <
bool propto,
typename T_y,
typename T_scale,
typename T_shape>
19 const T_y& y,
const T_scale& y_min,
const T_shape& alpha) {
20 static const char*
function =
"pareto_lpdf";
28 y_min,
"Shape parameter", alpha);
35 T_partials_return logp(0);
40 size_t N =
max_size(y, y_min, alpha);
42 for (
size_t n = 0; n < N; n++) {
43 if (y_vec[n] < y_min_vec[n])
53 for (
size_t n = 0; n <
length(y); n++)
60 for (
size_t n = 0; n <
length(y); n++)
65 T_partials_return, T_scale>
68 for (
size_t n = 0; n <
length(y_min); n++)
76 for (
size_t n = 0; n <
length(alpha); n++)
80 for (
size_t n = 0; n < N; n++) {
81 const T_partials_return alpha_dbl =
value_of(alpha_vec[n]);
85 logp += alpha_dbl * log_y_min[n];
87 logp -= alpha_dbl * log_y[n] + log_y[n];
90 ops_partials.
edge1_.partials_[n] -= alpha_dbl * inv_y[n] + inv_y[n];
92 ops_partials.
edge2_.partials_[n] += alpha_dbl /
value_of(y_min_vec[n]);
94 ops_partials.
edge3_.partials_[n]
95 += 1 / alpha_dbl + log_y_min[n] - log_y[n];
97 return ops_partials.
build(logp);
100 template <
typename T_y,
typename T_scale,
typename T_shape>
102 const T_y& y,
const T_scale& y_min,
const T_shape& alpha) {
103 return pareto_lpdf<false>(y, y_min, alpha);
boost::math::tools::promote_args< double, typename partials_type< typename scalar_type< T >::type >::type, typename partials_return_type< T_pack... >::type >::type type
T value_of(const fvar< T > &v)
Return the value of the specified variable.
Extends std::true_type when instantiated with zero or more template parameters, all of which extend t...
fvar< T > log(const fvar< T > &x)
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
This template builds partial derivatives with respect to a set of operands.
size_t length(const std::vector< T > &x)
Returns the length of the provided std::vector.
bool size_zero(T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
Template metaprogram to calculate whether a summand needs to be included in a proportional (log) prob...
void check_positive_finite(const char *function, const char *name, const T_y &y)
Check if y is positive and finite.
boost::math::tools::promote_args< double, typename scalar_type< T >::type, typename return_type< Types_pack... >::type >::type type
void check_not_nan(const char *function, const char *name, const T_y &y)
Check if y is not NaN.
size_t max_size(const T1 &x1, const T2 &x2)
T_return_type build(double value)
Build the node to be stored on the autodiff graph.
VectorBuilder allocates type T1 values to be used as intermediate values.
internal::ops_partials_edge< double, Op2 > edge2_
void check_consistent_sizes(const char *function, const char *name1, const T1 &x1, const char *name2, const T2 &x2)
Check if the dimension of x1 is consistent with x2.
return_type< T_y, T_scale, T_shape >::type pareto_lpdf(const T_y &y, const T_scale &y_min, const T_shape &alpha)
internal::ops_partials_edge< double, Op3 > edge3_
internal::ops_partials_edge< double, Op1 > edge1_