Trading order for degree in creative telescoping

DOI10.1016/j.jsc.2012.02.002zbMath1241.33021arXiv1108.4508OpenAlexW2115861986WikidataQ43216577 ScholiaQ43216577MaRDI QIDQ414630

Shaoshi Chen, Manuel Kauers

Publication date: 11 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

Zeilberger's algorithmdefinite integrationhyperexponential terms

Mathematics Subject Classification ID

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

Related Items

Some open problems related to creative telescoping, Desingularization of Ore operators, Minimization of differential equations and algebraic values of 𝐸-functions, No-neighbours recurrence schemes for space-time Green’s functions on a 3D simple cubic lattice, On the length of integers in telescopers for proper hypergeometric terms, Creative Telescoping for Holonomic Functions, Linear differential equations as a data structure, Extensions of the AZ-Algorithm and the Package MultiIntegrate

Uses Software

• NewZeil.m
• SIGMA
• MultiZeilberger
• ZEILBERGER
• qZEILBERGER
• Telescopers
• DEtools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast approach to creative telescoping
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• The method of differentiating under the integral sign
• Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
• A fast algorithm for proving terminating hypergeometric identities
• The method of creative telescoping
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Solving systems of strict polynomial inequalities
• An extension of Zeilberger's fast algorithm to general holonomic functions
• Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
• Cylindrical algebraic decomposition using validated numerics
• Telescoping in the context of symbolic summation in Maple
• A non-holonomic systems approach to special function identities
• Complexity of creative telescoping for bivariate rational functions
• Decision procedure for indefinite hypergeometric summation
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Advanced applications of the holonomic systems approach
• Picard--Vessiot extensions for linear functional systems
• Computing the rank and a small nullspace basis of a polynomial matrix
• Solving parameterized linear difference equations in terms of indefinite nested sums and products