Fast evaluation of holonomic functions
From MaRDI portal
Publication:1274814
DOI10.1016/S0304-3975(98)00102-9zbMath0912.68081OpenAlexW2064359103MaRDI QIDQ1274814
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00102-9
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)
Related Items (19)
On the complexity of integer matrix multiplication ⋮ D-finite numbers ⋮ A quasi-linear time algorithm for computing modular polynomials in dimension 2 ⋮ Blendstrings: an environment for computing with smooth functions ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Guessing singular dependencies ⋮ Relaxed algorithms for \(p\)-adic numbers ⋮ Good reduction of Puiseux series and applications ⋮ Effective analytic functions ⋮ Around the numeric-symbolic computation of differential Galois groups ⋮ Efficient accelero-summation of holonomic functions ⋮ Polynomial cost for solving IVP for high-index DAE ⋮ Fast evaluation of holonomic functions near and in regular singularities ⋮ Effective bounds for P-recursive sequences ⋮ Conformal mapping in linear time ⋮ Computing Hypergeometric Functions Rigorously ⋮ Fast evaluation of holonomic functions ⋮ Truncation bounds for differentially finite series ⋮ Linear differential equations as a data structure
Cites Work
- D-finite power series
- Differentiably finite power series
- A holonomic systems approach to special functions identities
- Fast evaluation of holonomic functions
- How to recognize zero?
- Formal and numerical processes of summation of series solutions of differential equations
- Fast multiplication of large numbers
- Fast Multiple-Precision Evaluation of Elementary Functions
- Computation of π Using Arithmetic-Geometric Mean
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast evaluation of holonomic functions
