townforge/math
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
5,028 Commits 1 Branch 0 Tags 151 MiB
cc
Commit Graph

5028 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Nick Thompson
9e21a89675 fix move constructor use [CI SKIP] 2019-05-30 11:12:38 -04:00
Nick
2f725f0299 Tests for vector-valued barycentric rational. [CI SKIP] 2019-05-29 15:52:23 -04:00
Nick Thompson
1f9e18e63b First pass at vector-valued interpolation in barycentric rational 2019-05-29 11:35:54 -04:00
pabristow
5e42b1d736 Merge branch 'develop' of https://github.com/boostorg/math into develop 2019-05-28 15:35:48 +01:00
pabristow
2579514f00 Comment out to remove unnecessary run of fft_sines_table.cppthat only creates a table of sines for a documentation example. [CI SKIP] 2019-05-28 15:35:09 +01:00
jzmaddock
e415650f86 prime: Correct value of max_prime and add test. 
Fixes https://github.com/boostorg/math/issues/214.
 2019-05-26 11:45:35 +01:00
jzmaddock
0531fd715c catmull_rom: further split up test case to avoid over large obj files. 2019-05-26 10:03:53 +01:00
jzmaddock
15bfc148c7 roots.hpp: correct flaw in previous commit. 
If the next step jumps out of bounds, we need to fix up the sign of
the result, otherwise the bounds get incorrectly updated.
 2019-05-26 09:56:22 +01:00
jzmaddock
aa44b78885 Split catmull_rom_test into 2 and fix clang conversion issue. 2019-05-25 18:27:08 +01:00
jzmaddock
70162dbcb8 Update second order root finding code to bracket root when required. 
When min and max differ by many orders of magnitude (as happens when one is
zero for example), then bisection can take a very long time to iterate down to
the root.  Instead use a bracketing strategy which doubles the step size with
each iteration until a bracket is found, then repeat recursively as required
until we have a reasonably small interval.  Note that this only kicks in when
a Halley step goes out of bounds and we're therefore forced to thrash around
looking for the root.  Fixes: https://github.com/boostorg/math/issues/204.
 2019-05-25 18:18:20 +01:00
jzmaddock
bbcd180273 catmull_rom - second try at back porting to C++11. 2019-05-23 08:54:11 +01:00
jzmaddock
1b10acf47f Backport catmull_rom.hpp to C++11. 
See https://github.com/boostorg/math/issues/208.
 2019-05-22 19:38:34 +01:00
jzmaddock
9803ed1fa0
Merge pull request #207 from boostorg/ellint-range 
Update the range of the elliptic integrals to support the k > 1 case.
 2019-05-20 13:34:50 +01:00
jzmaddock
d11eb67c67 ellint_d: extend range to k > 1 same ellint_1/2/3. 2019-05-19 08:54:17 +01:00
jzmaddock
a033166f7f Elliptic Integrals: extend range of ellint_1/2/3. 
See https://github.com/boostorg/math/issues/183.
 2019-05-18 19:36:22 +01:00
Nick
4b2a33d522
Merge pull request #206 from boostorg/catmull_rom_container 
Allow generic random access containers other than std::vector for Cat…
 2019-05-17 09:53:51 -04:00
Nick Thompson
c8062fbc90 Allow generic random access containers other than std::vector for Catmull-Rom. 2019-05-16 18:03:57 -04:00
Nick
b98f4e95f1
Update gauss_kronrod.qbk 
Clarify Real->Complex quadrature documentation for Gauss-Kronrod.
 2019-05-14 15:28:41 -04:00
jzmaddock
03cb3f04b5 Ellint_1: remove redundant check. 
Fixes https://github.com/boostorg/math/issues/196.
 2019-05-13 19:40:36 +01:00
jzmaddock
63f09b4c30 ellint_3: rearrange special cases for better performance and to avoid redundant check. 
Fixes https://github.com/boostorg/math/issues/197.
 2019-05-13 19:16:00 +01:00
jzmaddock
143e20ed02 Merge branch 'develop' of https://github.com/boostorg/math into develop 2019-05-13 18:35:53 +01:00
jzmaddock
b8dbd0ea6e Update binomial docs: fixes https://github.com/boostorg/math/issues/203. 2019-05-13 18:35:29 +01:00
jzmaddock
dc7ecc0581 1F1: Exclude values very close to 1 from logarithmic testing for now. 
Add tests for log and regularized cases.
Log cases still have many failures and are not yet tested.
 2019-05-13 18:07:47 +01:00
jzmaddock
d81eb7ea31 1F1: Update expected errors now we're using the large abz case more often. 2019-05-13 18:05:59 +01:00
jzmaddock
1e4703becb 1F1: remove some cases from direct series evaluation with negative z: better to go via the large abz code instead. 2019-05-13 18:05:19 +01:00
jzmaddock
d690ab88e9 1F1: regular series: when the maxima of the series is a long way from the origin, jump straight to it and work outwards from there. 2019-05-13 18:03:53 +01:00
jzmaddock
1e7a3e1e38 pFq: Figure out where the maxima of the series are and work outwards from there. 2019-05-13 18:02:53 +01:00
jzmaddock
a75d67b523 1F1: Update costs and preconditions in large abz case. 2019-05-13 18:01:42 +01:00
pabristow
fc0c104434 Add FAQ to Boost.Math about using Boost.Multiprecision cpp_dec or cpp_bin, hopefully satisfying respective authors. [CI SKIP] 2019-05-08 14:40:13 +01:00
pabristow
200e1b9149 improvement to multiprecision sines_table example [CI SKIP] 2019-05-08 12:04:47 +01:00
pabristow
129daa914f improvement to multiprecision sines_table example 2019-05-08 11:47:50 +01:00
jzmaddock
c759981a2a Improve performance of sin_pi and cos_pi: 
Use a static_cast to int when available for parity checking as it's much faster than itrunc.
Don't check for overflows in the result, since we know the result is in [-1,1].
 2019-05-03 19:11:03 +01:00
jzmaddock
24b410d0b0 unchecked_factorial: correct numeric_limits usage to not instantiate numeric_limits<__float128>. 2019-04-30 18:22:16 +01:00
jzmaddock
9b1e5561af LambertW: break dependency to cstdfloat.hpp - it causes all sorts of failures based on include order. 2019-04-29 18:29:38 +01:00
jzmaddock
f265221bf6 Merge branch 'develop' of https://github.com/boostorg/math into develop 2019-04-28 20:36:53 +01:00
jzmaddock
e125ac18ab unchecked_factorial: when using a non-builtin type, default to the builtin versions if the precision is small enough. Requires updating beta.hpp as well. 2019-04-28 20:36:05 +01:00
jzmaddock
e414e316ab
Merge pull request #191 from boostorg/float128_patches_2 
Next set of float128 patches for better std lib support.
 2019-04-27 19:03:48 +01:00
jzmaddock
df9bb98a12 float128 tests: disable NaN check on Mingw. 2019-04-26 20:03:47 +01:00
jzmaddock
2bdb511b5b
Merge pull request #198 from boostorg/autodiff 
Autodiff integration test
 2019-04-25 20:07:55 +01:00
John Maddock
067e778d75 Merge branch 'autodiff' of https://github.com/pulver/math into autodiff 2019-04-23 18:04:27 +01:00
jzmaddock
2bc18d3d44 On hypergeometric_soc_2014: working 2019-04-23 17:58:20 +01:00
jzmaddock
1d82258911 index on hypergeometric_soc_2014: 350d9a3cd 1F1: Correct use of precision changing in pFq. Correct test values which were effected by the above issue. 2019-04-23 17:58:14 +01:00
jzmaddock
350d9a3cd1 1F1: Correct use of precision changing in pFq. 
Correct test values which were effected by the above issue.
 2019-04-21 19:03:54 +01:00
jzmaddock
70809e3c06 1F1: Add heuristic for large a in negative b regions. 2019-04-21 19:02:31 +01:00
jzmaddock
eddde433ec 1F1: Correct negative b regions for large a case. 2019-04-17 18:39:27 +01:00
jzmaddock
61322ac8ec 1F1: Add regularized versions to tests. 2019-04-17 18:37:02 +01:00
jzmaddock
648ebfdc25 1F1: Add regularized version. 2019-04-17 18:27:42 +01:00
Nick
5e219748bc
Merge pull request #195 from boostorg/performance_improvements 
Vectorize mean calculation.
 2019-04-14 10:32:11 -04:00
jzmaddock
2e1e8a0038 Supress macro expansion of isless etc 2019-04-14 12:09:44 +01:00
jzmaddock
f23f1458cb 1F1: Update docs for ab < 0 region. 2019-04-14 09:53:07 +01:00