cov_matrix_constrain.hpp
Go to the documentation of this file.
#ifndef STAN_MATH_PRIM_MAT_FUN_COV_MATRIX_CONSTRAIN_HPP
#define STAN_MATH_PRIM_MAT_FUN_COV_MATRIX_CONSTRAIN_HPP
#include <stan/math/prim/mat/fun/Eigen.hpp>
#include <stan/math/prim/mat/fun/multiply_lower_tri_self_transpose.hpp>
#include <stan/math/prim/mat/meta/index_type.hpp>
#include <stan/math/prim/scal/err/check_size_match.hpp>
#include <stan/math/prim/scal/fun/constants.hpp>
#include <cmath>
namespace stan {
namespace math {
template <typename T>
Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>
cov_matrix_constrain(const Eigen::Matrix<T, Eigen::Dynamic, 1>& x,
typename math::index_type
<Eigen::Matrix<T, Eigen::Dynamic, 1> >::type K) {
using Eigen::Dynamic;
using Eigen::Matrix;
using std::exp;
typedef typename index_type<Matrix<T, Dynamic, Dynamic> >::type index_t;
Matrix<T, Dynamic, Dynamic> L(K, K);
check_size_match("cov_matrix_constrain",
"x.size()", x.size(),
"K + (K choose 2)", (K * (K + 1)) / 2);
int i = 0;
for (index_t m = 0; m < K; ++m) {
for (int n = 0; n < m; ++n)
L(m, n) = x(i++);
L(m, m) = exp(x(i++));
for (index_t n = m + 1; n < K; ++n)
L(m, n) = 0.0;
}
return multiply_lower_tri_self_transpose(L);
}
template <typename T>
Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>
cov_matrix_constrain(const Eigen::Matrix<T, Eigen::Dynamic, 1>& x,
typename math::index_type<Eigen::Matrix<T,
Eigen::Dynamic,
Eigen::Dynamic> >::type K,
T& lp) {
using Eigen::Dynamic;
using Eigen::Matrix;
using std::exp;
using std::log;
typedef typename index_type<Matrix<T, Dynamic, Dynamic> >::type index_t;
check_size_match("cov_matrix_constrain",
"x.size()", x.size(),
"K + (K choose 2)", (K * (K + 1)) / 2);
Matrix<T, Dynamic, Dynamic> L(K, K);
int i = 0;
for (index_t m = 0; m < K; ++m) {
for (index_t n = 0; n < m; ++n)
L(m, n) = x(i++);
L(m, m) = exp(x(i++));
for (index_t n = m + 1; n < K; ++n)
L(m, n) = 0.0;
}
// Jacobian for complete transform, including exp() above
lp += (K * LOG_2); // needless constant; want propto
for (index_t k = 0; k < K; ++k)
lp += (K - k + 1) * log(L(k, k)); // only +1 because index from 0
return multiply_lower_tri_self_transpose(L);
}
}
}
#endif
stan::math::LOG_2
const double LOG_2
The natural logarithm of 2, .
Definition: constants.hpp:32
multiply_lower_tri_self_transpose.hpp
stan::math::cov_matrix_constrain
Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > cov_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename math::index_type< Eigen::Matrix< T, Eigen::Dynamic, 1 > >::type K)
Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the s...
Definition: cov_matrix_constrain.hpp:29
check_size_match.hpp
stan
Definition: log_sum_exp.hpp:8
stan::math::log
fvar< T > log(const fvar< T > &x)
Definition: log.hpp:14
stan::math::check_size_match
void check_size_match(const char *function, const char *name_i, T_size1 i, const char *name_j, T_size2 j)
Check if the provided sizes match.
Definition: check_size_match.hpp:29
stan::math::multiply_lower_tri_self_transpose
Eigen::Matrix< fvar< T >, R, R > multiply_lower_tri_self_transpose(const Eigen::Matrix< fvar< T >, R, C > &m)
Definition: multiply_lower_tri_self_transpose.hpp:17
stan::math::index_type
Primary template class for the metaprogram to compute the index type of a container.
Definition: index_type.hpp:18
index_type.hpp
stan::math::exp
fvar< T > exp(const fvar< T > &x)
Definition: exp.hpp:10
Eigen.hpp
constants.hpp

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