On expansion of algebraic functions in power and Puiseux series, II
Journal of Complexity
An algorithm for multiplying 3 x 3 matrics
USSR Computational Mathematics and Mathematical Physics
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable
ACM Transactions on Mathematical Software (TOMS)
Fast evaluation of holonomic functions
Theoretical Computer Science - Special issue on real numbers and computers
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
Fast evaluation of holonomic functions near and in regular singularities
Journal of Symbolic Computation
ESF: an automatically generated encyclopedia of special functions
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
HAKMEM
Fast algorithms for polynomial solutions of linear differential equations
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Efficient accelero-summation of holonomic functions
Journal of Symbolic Computation
MPFR: A multiple-precision binary floating-point library with correct rounding
ACM Transactions on Mathematical Software (TOMS)
Time-and space-efficient evaluation of some hypergeometric constants
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On Winograd's Algorithm for Inner Products
IEEE Transactions on Computers
Analytic Combinatorics
Effective bounds for P-recursive sequences
Journal of Symbolic Computation
Modern Computer Arithmetic
The dynamic dictionary of mathematical functions (DDMF)
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Stokes phenomenon: graphical visualization and certified computation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
A note on the space complexity of fast D-finite function evaluation
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Finding hyperexponential solutions of linear ODEs by numerical evaluation
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |
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.