| Stan Math Library 2.6.3 probability, sampling & optimization

- Main Page
- Namespaces
- Classes
- Files

- File List
- File Members

All Classes Namespaces Files Functions Variables Typedefs Enumerator Friends Macros
simplex_constrain.hpp
Go to the documentation of this file.
1 #ifndef STAN_MATH_PRIM_MAT_FUN_SIMPLEX_CONSTRAIN_HPP
2 #define STAN_MATH_PRIM_MAT_FUN_SIMPLEX_CONSTRAIN_HPP
3
4 #include <stan/math/prim/mat/fun/Eigen.hpp>
5 #include <stan/math/prim/mat/meta/index_type.hpp>
6 #include <stan/math/prim/scal/fun/inv_logit.hpp>
7 #include <stan/math/prim/scal/fun/log1m.hpp>
8 #include <stan/math/prim/scal/fun/log1p_exp.hpp>
9 #include <stan/math/prim/scal/fun/logit.hpp>
10 #include <cmath>
11
12 namespace stan {
13
14 namespace math {
15
28 template <typename T>
29 Eigen::Matrix<T, Eigen::Dynamic, 1>
30 simplex_constrain(const Eigen::Matrix<T, Eigen::Dynamic, 1>& y) {
31 // cut & paste simplex_constrain(Eigen::Matrix, T) w/o Jacobian
32 using Eigen::Matrix;
33 using Eigen::Dynamic;
34 using stan::math::index_type;
35 using stan::math::inv_logit;
36 using stan::math::logit;
37 using stan::math::log1m;
38 using std::log;
39 typedef typename index_type<Matrix<T, Dynamic, 1> >::type size_type;
40
41
42 int Km1 = y.size();
43 Matrix<T, Dynamic, 1> x(Km1 + 1);
44 T stick_len(1.0);
45 for (size_type k = 0; k < Km1; ++k) {
46 T z_k(inv_logit(y(k) - log(Km1 - k)));
47 x(k) = stick_len * z_k;
48 stick_len -= x(k);
49 }
50 x(Km1) = stick_len;
51 return x;
52 }
53
67 template <typename T>
68 Eigen::Matrix<T, Eigen::Dynamic, 1>
69 simplex_constrain(const Eigen::Matrix<T, Eigen::Dynamic, 1>& y,
70 T& lp) {
71 using Eigen::Dynamic;
72 using Eigen::Matrix;
73 using stan::math::index_type;
74 using stan::math::inv_logit;
75 using stan::math::logit;
76 using stan::math::log1m;
77 using stan::math::log1p_exp;
78 using std::log;
79
80 typedef typename index_type<Matrix<T, Dynamic, 1> >::type size_type;
81
82 int Km1 = y.size(); // K = Km1 + 1
83 Matrix<T, Dynamic, 1> x(Km1 + 1);
84 T stick_len(1.0);
85 for (size_type k = 0; k < Km1; ++k) {
86 double eq_share = -log(Km1 - k); // = logit(1.0/(Km1 + 1 - k));
87 T adj_y_k(y(k) + eq_share);
88 T z_k(inv_logit(adj_y_k));
89 x(k) = stick_len * z_k;
90 lp += log(stick_len);
91 lp -= log1p_exp(-adj_y_k);
92 lp -= log1p_exp(adj_y_k);
93 stick_len -= x(k); // equivalently *= (1 - z_k);
94 }
95 x(Km1) = stick_len; // no Jacobian contrib for last dim
96 return x;
97 }
98
99 }
100
101 }
102
103 #endif
stan::math::log
fvar< T > log(const fvar< T > &x)
Definition: log.hpp:15
stan::math::inv_logit
fvar< T > inv_logit(const fvar< T > &x)
Definition: inv_logit.hpp:15
stan::math::size_type
Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic >::Index size_type
Type for sizes and indexes in an Eigen matrix with double e.
Definition: typedefs.hpp:13
stan::math::index_type
Primary template class for the metaprogram to compute the index type of a container.
Definition: index_type.hpp:19
index_type.hpp
log1m.hpp
Eigen.hpp
stan::math::logit
fvar< T > logit(const fvar< T > &x)
Definition: logit.hpp:17
log1p_exp.hpp
stan::math::log1p_exp
fvar< T > log1p_exp(const fvar< T > &x)
Definition: log1p_exp.hpp:13
stan::math::simplex_constrain
Eigen::Matrix< T, Eigen::Dynamic, 1 > simplex_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
Return the simplex corresponding to the specified free vector.
Definition: simplex_constrain.hpp:30
logit.hpp
inv_logit.hpp
stan::math::log1m
fvar< T > log1m(const fvar< T > &x)
Definition: log1m.hpp:16

[ Stan Home Page ] © 2011–2015, Stan Development Team.