Accelerating indefinite hypergeometric summation algorithms

DOI10.1145/3313880.3313893MaRDI QIDQ4630318zbMATH OpenOpenAlexWikidataFDO

Authors Eugene Zima

Publication date 29 March 2019

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3313880.3313893

zbMATH Keywords

hypergeometric summationlinear difference equation

Mathematics Subject Classification ID

Classical hypergeometric functions, ({}_2F_1) (33C05) Linear difference equations (39A06)

Recommendations

• Synthetic division in the context of indefinite summation (extended abstract)
• Rational summation and Gosper-Petkovšek representation
• Representation of hypergeometric products in difference rings
• Algorithms for m-fold hypergeometric summation
• Solving parameterized linear difference equations in terms of indefinite nested sums and products

Cited in

(7)

• Synthetic division in the context of indefinite summation (extended abstract)
• scientific article; zbMATH DE number 5781392 (Why is no real title available?)
• scientific article; zbMATH DE number 1263411 (Why is no real title available?)
• A Novel Approach for the Efficient Computation of 1-D and 2-D Summations
• Вычисление гипергеометрических рядов с квазилинейной временной и линейной eмкостной сложностью
• On the structure of solutions to the key Gosper equation in problems of symbolic summation
• Hypergeometric summation algorithms for high-order finite elements

This page was built for publication: Accelerating indefinite hypergeometric summation algorithms

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