check_cholesky_factor.hpp

Go to the documentation of this file.

#ifndef STAN_MATH_PRIM_ERR_CHECK_CHOLESKY_FACTOR_HPP
#define STAN_MATH_PRIM_ERR_CHECK_CHOLESKY_FACTOR_HPP
 
#include <stan/math/prim/fun/Eigen.hpp>
#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/fun/to_ref.hpp>
#include <stan/math/prim/fun/value_of_rec.hpp>
#include <stan/math/prim/err/check_positive.hpp>
#include <stan/math/prim/err/check_less_or_equal.hpp>
#include <stan/math/prim/err/check_lower_triangular.hpp>
#include <stan/math/prim/err/make_iter_name.hpp>
 
namespace stan {
namespace math {
 
template <typename Mat, require_matrix_t<Mat>* = nullptr>
inline void check_cholesky_factor(const char* function, const char* name,
                                  const Mat& y) {
  check_less_or_equal(function, "columns and rows of Cholesky factor", y.cols(),
                      y.rows());
  check_positive(function, "columns of Cholesky factor", y.cols());
  auto&& y_ref = to_ref(value_of_rec(y));
  check_lower_triangular(function, name, y_ref);
  check_positive(function, name, y_ref.diagonal());
}
 
template <typename StdVec, require_std_vector_t<StdVec>* = nullptr>
void check_cholesky_factor(const char* function, const char* name,
                           const StdVec& y) {
  for (size_t i = 0; i < y.size(); ++i) {
    check_cholesky_factor(function, internal::make_iter_name(name, i).c_str(),
                          y[i]);
  }
}
 
}  // namespace math
}  // namespace stan
#endif