Automatic Differentiation
 
Loading...
Searching...
No Matches
logistic_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_LOGISTIC_RNG_HPP
2#define STAN_MATH_PRIM_PROB_LOGISTIC_RNG_HPP
3
8#include <boost/random/exponential_distribution.hpp>
9#include <boost/random/variate_generator.hpp>
10#include <cmath>
11
12namespace stan {
13namespace math {
14
33template <typename T_loc, typename T_scale, class RNG>
35 const T_loc& mu, const T_scale& sigma, RNG& rng) {
36 using boost::variate_generator;
37 using boost::random::exponential_distribution;
38 using T_mu_ref = ref_type_t<T_loc>;
39 using T_sigma_ref = ref_type_t<T_scale>;
40 static constexpr const char* function = "logistic_rng";
41 check_consistent_sizes(function, "Location parameter", mu, "Scale Parameter",
42 sigma);
43 T_mu_ref mu_ref = mu;
44 T_sigma_ref sigma_ref = sigma;
45 check_finite(function, "Location parameter", mu_ref);
46 check_positive_finite(function, "Scale parameter", sigma_ref);
47
48 scalar_seq_view<T_mu_ref> mu_vec(mu_ref);
49 scalar_seq_view<T_sigma_ref> sigma_vec(sigma_ref);
50 size_t N = max_size(mu, sigma);
52
53 variate_generator<RNG&, exponential_distribution<> > exp_rng(
54 rng, exponential_distribution<>(1));
55 for (size_t n = 0; n < N; ++n) {
56 output[n] = mu_vec[n] - sigma_vec[n] * std::log(exp_rng() / exp_rng());
57 }
58
59 return output.data();
60}
61
62} // namespace math
63} // namespace stan
64#endif
typename helper::type type
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...
VectorBuilder< true, double, T_loc, T_scale >::type logistic_rng(const T_loc &mu, const T_scale &sigma, RNG &rng)
Return a Logistic random variate for the given location and scale using the specified random number g...
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.
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
Definition max_size.hpp:20
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
Definition ref_type.hpp:55
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...