Efficient rational creative telescoping
From MaRDI portal
Publication:820942
DOI10.1016/j.jsc.2021.07.005zbMath1484.33031arXiv1909.06898OpenAlexW3197719322MaRDI QIDQ820942
Hui Huang, Eugene Zima, George Labahn, Mark W. Giesbrecht
Publication date: 29 September 2021
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06898
Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for proving terminating hypergeometric identities
- A holonomic systems approach to special functions identities
- The method of creative telescoping
- A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
- Indefinite summation of rational functions with factorization of denominators
- A criterion for the applicability of Zeilberger's algorithm to rational functions
- Greatest factorial factorization and symbolic summation
- Synthetic division in the context of indefinite summation
- A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms
- Modern Computer Algebra
- Complexity of creative telescoping for bivariate rational functions
- Minimal decomposition of indefinite hypergeometric sums
- Creative telescoping for rational functions using the griffiths
- New Bounds for Hypergeometric Creative Telescoping
- The rational component of the solution of a first-order linear recurrence relation with a rational right side
- Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions
- A Reduction Approach to Creative Telescoping
- Efficient Integer-Linear Decomposition of Multivariate Polynomials
- Order-degree curves for hypergeometric creative telescoping
- Computing minimal nullspace bases
This page was built for publication: Efficient rational creative telescoping
