Improvement of the degree setting in Gosper's algorithm

DOI10.1006/JSCO.1993.1043zbMATH Open0872.33001OpenAlexW2131914309MaRDI QIDQ1314432FDOQ1314432

Petr Lisoněk, Peter Paule, Volker Strehl

Publication date: 20 February 1996

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

Full work available at URL: https://semanticscholar.org/paper/7f9b11c60cc0e12ed6e7ae597c3c4115d63db11a

zbMATH Keywords

computational complexityhypergeometric seriesGosper's algorithmsummation algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to special functions (33-01)

Cited In (3)

• On the structure of solutions to the key Gosper equation in problems of symbolic summation
• Accelerating indefinite summation: simple classes of summands
• Converging to Gosper's algorithm

This page was built for publication: Improvement of the degree setting in Gosper's algorithm

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