boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-01-19 04:22:09 +00:00
Code Issues Projects Releases Wiki Activity

Address review comments [CI SKIP]

Browse Source
This commit is contained in:
Matt Borland
2023-12-22 07:13:10 -05:00
parent c4e15ddda0
commit 8332808ebc
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/internals/polynomial.qbk
View File

@@ -22,7 +22,7 @@
template <class U>
polynomial(const U* data, unsigned order);
template <class Iterator>
polynomial(I first, I last);
polynomial(Iterator first, Iterator last);
template <class U>
explicit polynomial(const U& point,
typename std::enable_if<std::is_convertible<U, T> >::type* = nullptr);

6
include/boost/math/special_functions/detail/bessel_ik.hpp
View File

@@ -77,7 +77,7 @@ inline T bessel_i_small_z_series(T v, T x, const Policy& pol)
return prefix * result;
}
// Calculate result_K(v, x) and result_K(v+1, x) by method analogous to
// Calculate K(v, x) and K(v+1, x) by method analogous to
// Temme, Journal of Computational Physics, vol 21, 343 (1976)
template <typename T, typename Policy>
int temme_ik(T v, T x, T* result_K, T* K1, const Policy& pol)
@@ -200,7 +200,7 @@ int CF1_ik(T v, T x, T* fv, const Policy& pol)
return 0;
}
// Calculate result_K(v, x) and result_K(v+1, x) by evaluating continued fraction
// Calculate K(v, x) and K(v+1, x) by evaluating continued fraction
// z1 / z0 = U(v+1.5, 2v+1, 2x) / U(v+0.5, 2v+1, 2x), see
// Thompson and Barnett, Computer Physics Communications, vol 47, 245 (1987)
template <typename T, typename Policy>
@@ -374,7 +374,7 @@ int bessel_ik(T v, T x, T* result_I, T* result_K, int kind, const Policy& pol)
current = Ku1;
T scale = 1;
T scale_sign = 1;
for (k = 1; k <= n; k++) // forward recurrence for result_K
for (k = 1; k <= n; k++) // forward recurrence for K
{
T fact = 2 * (u + k) / x;
// Check for overflow: if (max - |prev|) / fact > max, then overflow