diff options
| author | Paul Zimmermann <paul.zimmermann@inria.fr> | 2012-09-05 14:45:35 +0000 |
|---|---|---|
| committer | Paul Zimmermann <paul.zimmermann@inria.fr> | 2012-09-05 14:45:35 +0000 |
| commit | 7c4f3d30bdf96e2a2d2cb3962dbd3a973294625e (patch) | |
| tree | 3a48af57d83654d6ac3c391ee7f37f419fc6674c /TODO | |
| parent | f43dd55e46e702c59b0707aa0cf9b7f7cdc6af0a (diff) | |
| download | mpc-git-7c4f3d30bdf96e2a2d2cb3962dbd3a973294625e.tar.gz | |
[TODO] added pointers for AGM
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/mpc/trunk@1258 211d60ee-9f03-0410-a15a-8952a2c7a4e4
Diffstat (limited to 'TODO')
| -rw-r--r-- | TODO | 5 |
1 files changed, 4 insertions, 1 deletions
@@ -29,7 +29,10 @@ New functions to implement: mpc_erfc, mpc_exp2, mpc_expm1, mpc_log1p, mpc_log2, mpc_lgamma, mpc_tgamma http://lists.gforge.inria.fr/pipermail/mpc-discuss/2012-March/001090.html - from Andreas Enge and Philippe Théveny 17 July 2008 - agm (and complex logarithm with agm ?) + agm (and complex logarithm with agm ?). For the error analysis, one can + start from Theorem 1 of http://www.lix.polytechnique.fr/Labo/Regis.Dupont/preprints/Dupont_FastEvalMod.ps.gz, and probably the best is to compute AGM(a,b) + as a*AGM(1,b/a) with |b/a| <= 1. In such a way, after one step all values + are in the same quadrant, and no cancellation occurs any more. - from Andreas Enge 25 June 2009: correctly rounded roots of unity zeta_n^i - implement a root-finding algorithm using the Durand-Kerner method |