boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-02-11 11:52:21 +00:00
Code Issues Projects Releases Wiki Activity

1F1: Fixes for expression template enabled types.

Browse Source
This commit is contained in:
jzmaddock
2019-02-04 18:21:48 +00:00
parent 9c238c07e4
commit 978d10cacf
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
include/boost/math/special_functions/detail/hypergeometric_1F1_large_abz.hpp
View File

@@ -51,7 +51,7 @@
gamma_cache[cache_size - 1] = boost::math::gamma_p(alpha_poch + (int)cache_size - 1, x, pol);
for (int i = cache_size - 1; i > 0; --i)
{
gamma_cache[i - 1] = gamma_cache[i] >= 1 ? 1 : gamma_cache[i] + regularised_gamma_prefix(alpha_poch + i - 1, x, pol, lanczos_type()) / (alpha_poch + i - 1);
gamma_cache[i - 1] = gamma_cache[i] >= 1 ? T(1) : T(gamma_cache[i] + regularised_gamma_prefix(T(alpha_poch + i - 1), x, pol, lanczos_type()) / (alpha_poch + i - 1));
}
}
T delta_poch, alpha_poch, x, term;

4
include/boost/math/tools/recurrence.hpp
View File

@@ -226,7 +226,7 @@ namespace boost {
: f_n(f_n), coef(r), k(0)
{
boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<boost::math::policies::policy<> >();
f_n_minus_1 = f_n * boost::math::tools::function_ratio_from_forwards_recurrence(detail::recurrence_offsetter<Recurrence>(r, -1), boost::math::tools::epsilon<value_type>() * 2, max_iter);
f_n_minus_1 = f_n * boost::math::tools::function_ratio_from_forwards_recurrence(detail::recurrence_offsetter<Recurrence>(r, -1), value_type(boost::math::tools::epsilon<value_type>() * 2), max_iter);
boost::math::policies::check_series_iterations<value_type>("forward_recurrence_iterator<>::forward_recurrence_iterator", max_iter, boost::math::policies::policy<>());
}
@@ -268,7 +268,7 @@ namespace boost {
: f_n(f_n), coef(r), k(0)
{
boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<boost::math::policies::policy<> >();
f_n_plus_1 = f_n * boost::math::tools::function_ratio_from_backwards_recurrence(detail::recurrence_offsetter<Recurrence>(r, 1), boost::math::tools::epsilon<value_type>() * 2, max_iter);
f_n_plus_1 = f_n * boost::math::tools::function_ratio_from_backwards_recurrence(detail::recurrence_offsetter<Recurrence>(r, 1), value_type(boost::math::tools::epsilon<value_type>() * 2), max_iter);
boost::math::policies::check_series_iterations<value_type>("backward_recurrence_iterator<>::backward_recurrence_iterator", max_iter, boost::math::policies::policy<>());
}