1#ifndef STAN_MATH_PRIM_PROB_CAUCHY_LCCDF_HPP
2#define STAN_MATH_PRIM_PROB_CAUCHY_LCCDF_HPP
33template <
typename T_y,
typename T_loc,
typename T_scale,
35 T_y, T_loc, T_scale>* =
nullptr>
37 const T_scale& sigma) {
44 static constexpr const char* function =
"cauchy_lccdf";
46 mu,
"Scale Parameter", sigma);
49 T_sigma_ref sigma_ref = sigma;
58 T_partials_return ccdf_log(0.0);
66 for (
size_t n = 0; n < N; n++) {
67 const T_partials_return y_dbl = y_vec.val(n);
68 const T_partials_return mu_dbl = mu_vec.val(n);
69 const T_partials_return sigma_inv_dbl = 1.0 / sigma_vec.val(n);
70 const T_partials_return sigma_dbl = sigma_vec.val(n);
71 const T_partials_return z = (y_dbl - mu_dbl) * sigma_inv_dbl;
73 const T_partials_return Pn = 0.5 -
atan(z) /
pi();
76 const T_partials_return rep_deriv
77 = 1.0 / (Pn *
pi() * (z * z * sigma_dbl + sigma_dbl));
79 partials<0>(ops_partials)[n] -= rep_deriv;
82 partials<1>(ops_partials)[n] += rep_deriv;
85 partials<2>(ops_partials)[n] += rep_deriv * z;
88 return ops_partials.build(ccdf_log);
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 > cauchy_lccdf(const T_y_cl &y, const T_loc_cl &mu, const T_scale_cl &sigma)
Returns the cauchy log complementary cumulative distribution function for the given location,...
typename return_type< Ts... >::type return_type_t
Convenience type for the return type of the specified template parameters.
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 > atan(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.
static constexpr double pi()
Return the value of pi.
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.
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...