boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-02-13 12:32:15 +00:00
Code Issues Projects Releases Wiki Activity

You would think a double precision complex division would be the same on every compiler. You would be wrong.

Browse Source
This commit is contained in:
Nick Thompson
2018-12-04 14:28:04 -07:00
parent 6e25e27d01
commit cb71b06c10
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
test/test_roots.cpp
View File

@@ -381,15 +381,14 @@ void test_complex_newton()
// Polynomials which didn't factorize using Newton's method at first:
void test_daubechies_fails()
{
std::cout << "Testing failures from Daubechies filter computation.\n";
using std::abs;
using std::sqrt;
using boost::math::tools::complex_newton;
using boost::math::tools::polynomial;
using boost::math::constants::half;
std::cout.precision(std::numeric_limits<double>::digits10+3);
//std::cout << std::hexfloat;
double tol = std::numeric_limits<double>::epsilon();
double tol = 500*std::numeric_limits<double>::epsilon();
polynomial<std::complex<double>> p{{-185961388.136908293,141732493.98435241}, {601080390,0}};
std::complex<double> guess{1,1};
polynomial<std::complex<double>> p_prime = p.prime();