Complexity of Creative Telescoping for Bivariate Rational Functions
Year: 2013
Type: article
Abstract: The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger's framework of (differential) creative telescoping. Our complexity-driven approach is to obtain tight degree bounds on the various expressions involved in the method. To make the problem more tractable, we restrict to bivariate rational functions. By considering this constrained class of inputs, we are able to blend the general method of creative telescoping with the well-known Hermite reduction. We then use our new method to compute diagonals of rational power series arising from combinatorics.
Authors: Bostan, Alin, Chen, Shaoshi, Chyzak, Frédéric, Li, Ziming
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G5932878250
OpenAlex ID: W2952199487
