summaryrefslogtreecommitdiff
path: root/TODO
diff options
context:
space:
mode:
authorvlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4>2016-05-25 11:42:32 +0000
committervlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4>2016-05-25 11:42:32 +0000
commitbaabf6d08c37a1d0dd61ded9befa8ca1c33aa3eb (patch)
tree6912f4d6240693450949225bf404a3cf6180c4cc /TODO
parent673d8d5fbbcce80363c0abd7bd912b47bfd80fbf (diff)
downloadmpfr-baabf6d08c37a1d0dd61ded9befa8ca1c33aa3eb.tar.gz
[TODO] mpfr_ai efficiency: mention tests/tai.c (the REDUCE_EMAX was
added in r6734). git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/trunk@10371 280ebfd0-de03-0410-8827-d642c229c3f4
Diffstat (limited to 'TODO')
-rw-r--r--TODO3
1 files changed, 2 insertions, 1 deletions
diff --git a/TODO b/TODO
index 275a50b2e..acb4c6571 100644
--- a/TODO
+++ b/TODO
@@ -270,7 +270,8 @@ Table of contents:
##############################################################################
- Fredrik Johansson reports that mpfr_ai is slow for large arguments: an
- asymptotic expansion should be used
+ asymptotic expansion should be used (once done, remove REDUCE_EMAX from
+ tests/tai.c).
- for exp(x), Fredrik Johansson reports a 20% speed improvement starting from
4000 bits, and up to a 75% memory improvement in his Arb implementation, by
using recursive instead of iterative binary splitting: