Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula

DOI10.1145/1073884.1073888MaRDI QIDQ5262736zbMATH OpenOpenAlexFDO

Authors M. Petkovšsek, S. 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

zbMATH Keywords

Gosper's algorithmsymbolic summationNewton-Leibniz formulaaccurate summation algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Recommendations

• On the summation of \(P\)-recursive sequences
• The summation of rational functions by an extended Gosper algorithm
• A generalization of Gosper's algorithm to bibasic hypergeometric summation
• Improvement of the degree setting in Gosper's algorithm
• A generalization of Gosper's algorithm

Cited in

(7)

• On the summation of \(P\)-recursive sequences
• scientific article; zbMATH DE number 5781392 (Why is no real title available?)
• Integral Representation and Algorithms for Closed Form Summation
• A definite summation of hypergeometric terms of special kind
• Multiple binomial sums
• Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences
• Some open problems related to creative telescoping

This page was built for publication: Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula

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