Efficient algorithms for mixed creative telscoping

DOI10.1145/2930889.2930907MaRDI QIDQ2985817zbMATH OpenOpenAlexWikidataFDO

Authors Alin Bostan, Louis Dumont, Bruno Salvy

Publication date 10 May 2017

Published in Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.05082

zbMATH Keywords

symbolic integrationcreative telescopingHermite reductionhypergeometric-hyperexponential term

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Abstract: Creative telescoping is a powerful computer algebra paradigm -initiated by Doron Zeilberger in the 90's- for dealing with definite integrals and sums with parameters. We address the mixed continuous-discrete case, and focus on the integration of bivariate hypergeometric-hyperexponential terms. We design a new creative telescoping algorithm operating on this class of inputs, based on a Hermite-like reduction procedure. The new algorithm has two nice features: it is efficient and it delivers, for a suitable representation of the input, a minimal-order telescoper. Its analysis reveals tight bounds on the sizes of the telescoper it produces.

Recommendations

• Efficient rational creative telescoping
• Hermite reduction and creative telescoping for hyperexponential functions
• On the order of the recurrence produced by the method of creative telescoping
• A reduction approach to creative telescoping
• Reduction-based creative telescoping for algebraic functions

Cited in

(13)

• Trading order for degree in creative telescoping
• The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals
• A fast approach to creative telescoping
• Martin boundary of killed random walks on isoradial graphs
• On the existence of telescopers for mixed hypergeometric terms
• Stieltjes moment sequences for pattern-avoiding permutations
• Linear differential equations as a data structure
• Constructing reductions for creative telescoping. The general differentially finite case
• Complexity of creative telescoping for bivariate rational functions
• Order-degree curves for hypergeometric creative telescoping
• Reduction-based creative telescoping for definite summation of D-finite functions
• Some open problems related to creative telescoping
• On the order of the recurrence produced by the method of creative telescoping

This page was built for publication: Efficient algorithms for mixed creative telscoping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985817)