Abstract : This article describes the implementation in the software package NumGfun of classical algorithms that operate on solutions of linear differential equations or recurrence relations with polynomial coefficients, including what seems to be the first general implementation of the fast high-precision numerical evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our descriptions contain improvements over existing algorithms. We also provide references to relevant ideas not currently used in NumGfun.
Stephen M. Watt. ISSAC - International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany. ACM, pp.139-146, 2010, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. 〈10.1145/1837934.1837965〉
https://hal.inria.fr/inria-00456983
Contributeur : Marc Mezzarobba
<>
Soumis le : samedi 8 mai 2010 - 12:24:13
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : jeudi 23 septembre 2010 - 12:47:09
Marc Mezzarobba. NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions. Stephen M. Watt. ISSAC - International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany. ACM, pp.139-146, 2010, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. 〈10.1145/1837934.1837965〉. 〈inria-00456983v2〉
