A direct algorithm to construct the minimal Z-pairs for rational functions

Authors:
H. Q. Le
Affiliations:
Symbolic Computation Group, Department of Computer Science, University of Waterloo, Waterloo, N2L 3G1, Canada
Venue:
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Year:
2003

Citing 11
Cited 2

The method of creative telescoping

Journal of Symbolic Computation
On the greatest common divisor of polynomials which depend on a parameter

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
On Zeilberger's algorithm and its q-analogue

VII SPOA Proceedings of the seventh Spanish symposium on Orthogonal polynomials and applications
Indefinite sums of rational functions

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Greatest factorial factorization and symbolic summation

Journal of Symbolic Computation
Rational summation and Gosper-Petkovsˇek

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Minimal decomposition of indefinite hypergeometric sums

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Concrete Math

Concrete Math
On the q-Analogue of Zeilberger's Algorithm to Rational Functions

Programming and Computing Software
A criterion for the applicability of Zeilberger's algorithm to rational functions

Discrete Mathematics

Fast computation of common left multiples of linear ordinary differential operators

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Order-degree curves for hypergeometric creative telescoping

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a direct algorithm to construct the minimal Z-pairs for rational functions. We describe a Maple implementation of the algorithm and show timing comparisons between this algorithm and other related algorithms. We also summarize an analogous algorithm for the q-difference case.