Efficient Algorithms for Mixed Creative Telescoping

05/17/2016
by   Alin Bostan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2018

Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions

Hermite reduction is a classical algorithmic tool in symbolic integratio...
research
10/24/2017

Definite Sums of Hypergeometric Terms and Limits of P-Recursive Sequences

The ubiquity of the class of D-finite functions and P-recursive sequence...
research
05/09/2018

Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case

One of the biggest open problems in computational algebra is the design ...
research
04/27/2016

New Bounds for Hypergeometric Creative Telescoping

Based on a modified version of Abramov-Petkovšek reduction, a new algori...
research
07/14/2023

Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions

Creative telescoping is an algorithmic method initiated by Zeilberger to...
research
09/15/2019

Efficient Rational Creative Telescoping

We present a new algorithm to compute minimal telescopers for rational f...
research
02/12/2018

BagMinHash - Minwise Hashing Algorithm for Weighted Sets

Minwise hashing has become a standard tool to calculate signatures which...

Please sign up or login with your details

Forgot password? Click here to reset