diff options
| -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 |