Publication:414630

DOI10.1016/J.JSC.2012.02.002zbMATH Open1241.33021DBLPjournals/jsc/ChenK12arXiv1108.4508OpenAlexW2115861986WikidataQ43216577 ScholiaQ43216577MaRDI QIDQ414630FDOQ414630

Shaoshi Chen, M. Kauers

Publication date: 11 May 2012

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

Abstract: We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower degree. More precisely, we derive degree bounding formulas which allow to estimate the degree of the output equations from creative telescoping as a function of the order. As an application, we show how the knowledge of these formulas can be used to improve, at least in principle, the performance of creative telescoping implementations, and we deduce bounds on the asymptotic complexity of creative telescoping for hyperexponential terms.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• Solving systems of strict polynomial inequalities
• Decision procedure for indefinite hypergeometric summation
• Advanced applications of the holonomic systems approach
• A fast approach to creative telescoping
• An extension of Zeilberger's fast algorithm to general holonomic functions
• The method of differentiating under the integral sign
• The method of creative telescoping
• A fast algorithm for proving terminating hypergeometric identities
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Cylindrical algebraic decomposition using validated numerics
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• 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
• 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

Cited In (8)

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

Uses Software

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

This page was built for publication: Trading order for degree in creative telescoping

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