diff options
author | zimmerma <zimmerma@211d60ee-9f03-0410-a15a-8952a2c7a4e4> | 2012-07-31 14:16:39 +0000 |
---|---|---|
committer | zimmerma <zimmerma@211d60ee-9f03-0410-a15a-8952a2c7a4e4> | 2012-07-31 14:16:39 +0000 |
commit | 9508861479980398de132ea861d96eab79a05e47 (patch) | |
tree | dc430a15c5570abdab02d3b77af3cc800973af89 /TODO | |
parent | 101ca54d3f8d7b67b37c7c1be6e88532217c58e9 (diff) | |
download | mpc-9508861479980398de132ea861d96eab79a05e47.tar.gz |
[TODO] added reference
git-svn-id: svn://scm.gforge.inria.fr/svn/mpc/trunk@1251 211d60ee-9f03-0410-a15a-8952a2c7a4e4
Diffstat (limited to 'TODO')
-rw-r--r-- | TODO | 5 |
1 files changed, 4 insertions, 1 deletions
@@ -28,9 +28,12 @@ New functions to implement: - 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) + (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 + A good starting point for the Durand-Kerner and Aberth methods is the + paper by Dario Bini "Numerical computation of polynomial zeros by means of + Aberth's method", Numerical Algorithms 13 (1996), 179-200. New tests to add: - from Andreas Enge and Philippe Théveny 9 April 2008 |