Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula
From MaRDI portal
Publication:5262736
DOI10.1145/1073884.1073888zbMath1360.33018OpenAlexW2036893080MaRDI QIDQ5262736
M. Petkovšsek, Sergey A. Abramov
Publication date: 16 July 2015
Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073884.1073888
Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items (5)
Multiple binomial sums ⋮ Some open problems related to creative telescoping ⋮ Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences ⋮ Integral Representation and Algorithms for Closed Form Summation ⋮ A definite summation of hypergeometric terms of special kind
This page was built for publication: Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula