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

DOI10.1145/1073884.1073888zbMATH Open1360.33018OpenAlexW2036893080MaRDI QIDQ5262736FDOQ5262736

S. A. Abramov, M. Petkovšsek

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)

Cited In (6)

• Title not available (Why is that?)
• 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)