From ae3c1baa7a01a99a98a6115466cbced522127c83 Mon Sep 17 00:00:00 2001 From: zimmerma Date: Fri, 14 Jan 2011 13:41:20 +0000 Subject: added mpc_fma (request from Mickael Gastineau) git-svn-id: svn://scm.gforge.inria.fr/svn/mpc/trunk@869 211d60ee-9f03-0410-a15a-8952a2c7a4e4 --- TODO | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'TODO') diff --git a/TODO b/TODO index d7cb290..171b29d 100644 --- a/TODO +++ b/TODO @@ -4,14 +4,14 @@ Bench: as done for mpfr at http://www.mpfr.org/mpfr-2.4.0/timings.html New functions to implement: -- from Mickael Gastineau 14 Apr 2008: - mpc_fma: d=a*b+c - from Andreas Enge and Philippe Théveny 17 July 2008 agm (and complex logarithm with agm ?) - from Andreas Enge 25 June 2009: correctly rounded roots of unity zeta_n^i - implement a root-finding algorithm using the Durand-Kerner method (cf http://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method) + See also the CEVAL algorithm from Yap and Sagraloff: + http://www.mpi-inf.mpg.de/~msagralo/ceval.pdf New tests to add: - from Andreas Enge and Philippe Théveny 9 April 2008 -- cgit v1.2.1