@article{VANDERHOEVEN1999199,
    Abstract = {A holonomic function is an analytic function, which satisfies a linear differential equation with polynomial coefficients. In particular, the elementary functions exp, log, sin, etc. and many special functions like erf, Si, Bessel functions, etc. are holonomic functions. Given a holonomic function f (determined by the linear differential equation it satisfies and initial conditions in a non singular point z), we show how to perform arbitrary precision evaluations of f at a non singular point z′ on the Riemann surface of f, while estimating the error. Moreover, if the coefficients of the polynomials in the equation forf are algebraic numbers, then our algorithm is asymptotically very fast: if M(n) is the time needed to multiply two n digit numbers, then we need a time O(M(n log2 n log log n)) to compute n digits of f(z′).},
    Author = {{van der Hoeven}, Joris},
    File = {Fast evaluation of holonomic functions - 1-s2.0-S0304397598001029-main - a.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Note = {Real Numbers and Computers},
    Number = {1},
    Pages = {199-215},
    Title = {Fast evaluation of holonomic functions},
    URL = {https://www.sciencedirect.com/science/article/pii/S0304397598001029},
    Volume = {210},
    Year = {1999},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397598001029},
    bdsk-url-2 = {https://doi.org/10.1016/S0304-3975(98)00102-9},
    date-added = {2023-02-02 21:36:56 +0100},
    date-modified = {2023-02-02 21:36:56 +0100},
    doi = {10.1016/S0304-3975(98)00102-9}
}

@article{VANDERHOEVEN1999199, Abstract = {A holonomic function is an analytic function, which satisfies a linear differential equation with polynomial coefficients. In particular, the elementary functions exp, log, sin, etc. and many special functions like erf, Si, Bessel functions, etc. are holonomic functions. Given a holonomic function f (determined by the linear differential equation it satisfies and initial conditions in a non singular point z), we show how to perform arbitrary precision evaluations of f at a non singular point z′ on the Riemann surface of f, while estimating the error. Moreover, if the coefficients of the polynomials in the equation forf are algebraic numbers, then our algorithm is asymptotically very fast: if M(n) is the time needed to multiply two n digit numbers, then we need a time O(M(n log2 n log log n)) to compute n digits of f(z′).}, Author = {{van der Hoeven}, Joris}, File = {Fast evaluation of holonomic functions - 1-s2.0-S0304397598001029-main - a.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Note = {Real Numbers and Computers}, Number = {1}, Pages = {199-215}, Title = {Fast evaluation of holonomic functions}, URL = {https://www.sciencedirect.com/science/article/pii/S0304397598001029}, Volume = {210}, Year = {1999}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397598001029}, bdsk-url-2 = {https://doi.org/10.1016/S0304-3975(98)00102-9}, date-added = {2023-02-02 21:36:56 +0100}, date-modified = {2023-02-02 21:36:56 +0100}, doi = {10.1016/S0304-3975(98)00102-9} }