From a451cc07e3fc8f5981b52864b33f746f699dca2d Mon Sep 17 00:00:00 2001 From: Andreas Enge Date: Fri, 22 Jul 2016 19:51:11 +0200 Subject: rootofunity: Use a better approximation of the lost bits. * src/rootofunity.c [mpc_rootofunity]: Drop the absolute bound for the number of lost bits in favour of a bound depending on the exponents of the result. * tests/rootofunity.dat: Add examples with large n, that is, a result close to the axes. --- tests/rootofunity.dat | 5 +++++ 1 file changed, 5 insertions(+) (limited to 'tests') diff --git a/tests/rootofunity.dat b/tests/rootofunity.dat index 3ee9e86..a80b7da 100644 --- a/tests/rootofunity.dat +++ b/tests/rootofunity.dat @@ -58,3 +58,8 @@ - + 53 -0b1.0110101000001001111001100110011111110011101111001101e-1 53 -0b1.0110101000001001111001100110011111110011101111001100e-1 8 5 D U + - 53 0b1.0110101000001001111001100110011111110011101111001101e-1 53 -0b1.0110101000001001111001100110011111110011101111001101e-1 8 7 U D - + 53 0b1.0110101000001001111001100110011111110011101111001100e-1 53 -0b1.0110101000001001111001100110011111110011101111001100e-1 8 7 D U + +# example with large n=2^32-1 and small real or imaginary part ++ + 53 1 53 0b1.1001001000011111101101010100010111010100111100010100e-30 4294967295 1 N N +- + 53 -0b1.1001001000011111101101010100010111010100111100010100e-32 53 1 4294967295 1073741824 N N + -- cgit v1.2.1