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

Chebyshev expected error rates are too strict - relax them a little.

Browse Source 
[CI SKIP]
This commit is contained in:
jzmaddock
2018-02-21 19:33:01 +00:00
parent 3fa8aadde2
commit f33bcd5488
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
test/chebyshev_test.cpp
View File

@@ -29,7 +29,7 @@ void test_polynomials()
std::cout << "Testing explicit polynomial representations of the Chebyshev polynomials on type " << boost::typeindex::type_id<Real>().pretty_name() << "\n";
Real x = -2;
Real tol = 100*std::numeric_limits<Real>::epsilon();
Real tol = 400*std::numeric_limits<Real>::epsilon();
if (tol > std::numeric_limits<float>::epsilon())
tol *= 10; // float results have much larger error rates.
while (x < 2)

2
test/chebyshev_transform_test.cpp
View File

@@ -165,7 +165,7 @@ void test_atap_examples()
{
BOOST_CHECK_CLOSE_FRACTION(f1(x), cheb1(x), 1.3e-5);
}
BOOST_CHECK_CLOSE_FRACTION(f2(x), cheb2(x), 4e-3);
BOOST_CHECK_CLOSE_FRACTION(f2(x), cheb2(x), 5e-3);
//BOOST_CHECK_CLOSE_FRACTION(f3(x), cheb3(x), 100*tol);
x += static_cast<Real>(1)/static_cast<Real>(1 << 7);
}