On computing closed forms for indefinite summations

DOI10.1006/jsco.1993.1053zbMath0807.68061OpenAlexW2052534049MaRDI QIDQ1318851

Yiu-Kwong Man

Publication date: 27 March 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1993.1053

zbMATH Keywords

quasipolynomialsGosper's algorithmindefinite summation of polynomialsquasi rational functions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Related Items (3)

Accelerating indefinite summation: simple classes of summands ⋮ Integral Representation and Algorithms for Closed Form Summation ⋮ On solutions of linear ordinary difference equations in their coefficient field

This page was built for publication: On computing closed forms for indefinite summations