A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.

DOI10.1016/S0196-8858(02)00529-8zbMath1048.65026MaRDI QIDQ1398291

D. Massart

Publication date: 29 July 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithms; rational functions; Maple implementation; \(Z\)-pairs; timing comparisons

Mathematics Subject Classification ID

41A20: Approximation by rational functions

65D20: Computation of special functions and constants, construction of tables

Related Items

Ore polynomial rings in one variable in computer algebra., Telescoping in the context of symbolic summation in Maple

Uses Software

• Maple
• HypergeometricSum

Cites Work

• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• The method of creative telescoping
• On Zeilberger's algorithm and its \(q\)-analogue
• A criterion for the applicability of Zeilberger's algorithm to rational functions
• Greatest factorial factorization and symbolic summation
• Rational summation and Gosper-Petkovšek representation
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Minimal decomposition of indefinite hypergeometric sums
• On the \(q\)-analogue of Zeilberger's algorithm to rational functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item