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

DOI10.1016/S0196-8858(02)00529-8MaRDI QIDQ1398291zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 29 July 2003

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

Full work available at URL https://doi.org/10.1016/s0196-8858(02)00529-8

zbMATH Keywords

\(Z\)-pairsalgorithmsMaple implementationrational functionstiming comparisons

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Computation of special functions and constants, construction of tables (65D20)

Review text

The author presents a direct algorithm to construct the minimal \(Z\)-pairs for rational functions. A Maple implementation of the algorithm is described and timing comparisons between this algorithm and other related algorithms are shown.

Recommendations

• On the \(q\)-analogue of Zeilberger's algorithm to rational functions
• A criterion for the applicability of Zeilberger's algorithm to rational functions
• scientific article; zbMATH DE number 1504574
• scientific article; zbMATH DE number 1860747
• Constructing minimal periods of quadratic irrationalities in Zagier's reduction theory
• Minimal polynomials of algebraic numbers with rational parameters
• On the differential-integral analogue of Zeilberger's algorithm to rational functions
• On the minimal algorithm in rings of imaginary quadratic integers
• Sets of minimality of \((1 - 1)\)-rational functions
• An algorithm for a result on minimal polynomials

Cites work

• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• A criterion for the applicability of Zeilberger's algorithm to rational functions
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Greatest factorial factorization and symbolic summation
• scientific article; zbMATH DE number 3511549 (Why is no real title available?)
• scientific article; zbMATH DE number 1254266 (Why is no real title available?)
• scientific article; zbMATH DE number 1263314 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1504574 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• Minimal decomposition of indefinite hypergeometric sums
• On the \(q\)-analogue of Zeilberger's algorithm to rational functions
• On Zeilberger's algorithm and its \(q\)-analogue
• Rational summation and Gosper-Petkovšek representation
• The method of creative telescoping

Cited in

(8)

• A criterion for the applicability of Zeilberger's algorithm to rational functions
• Constructing minimal telescopers for rational functions in three discrete variables
• Algorithm for constructing an analogue of the Binet formula
• Ore polynomial rings in one variable in computer algebra.
• Telescoping in the context of symbolic summation in Maple
• scientific article; zbMATH DE number 1253997 (Why is no real title available?)
• Non-minimality of minimal telescopers explained by residues
• Efficient rational creative telescoping

Describes a project that uses

Uses Software

• HypergeometricSum
• Maple

This page was built for publication: A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.

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