An efficient algorithm for deriving summation identities from mutual recurrences

DOI10.1142/S1793830912500164MaRDI QIDQ3166727zbMATH OpenFDO

Authors Berkeley R. Churchill, Edmund A. Lamagna

Publication date 15 October 2012

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830912500164

zbMATH Keywords

computer algebramutual recurrencesummation

Mathematics Subject Classification ID

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

Recommendations

• Summing symbols in mutual recurrences
• Solving linear recurrence equations with polynomial coefficients
• Linear recurrence relations for sums of products of two terms
• Low complexity algorithms for linear recurrences
• An Efficient Formula for Linear Recurrences

Cites work

• A fast algorithm for proving terminating hypergeometric identities
• A new Sigma approach to multi-summation
• An extension of Zeilberger's fast algorithm to general holonomic functions
• Closed form summation of 𝐶-finite sequences
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Decision procedure for indefinite hypergeometric summation
• Matrix multiplication via arithmetic progressions
• Summation in Finite Terms

Cited in

(5)

• New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula
• An algorithm for finding recurrence relations of binomial sums and its complexity
• An algorithm for proving arbitrary identities involving linear recurrence sequences
• Summing symbols in mutual recurrences
• scientific article; zbMATH DE number 3886993 (Why is no real title available?)

This page was built for publication: An efficient algorithm for deriving summation identities from mutual recurrences

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