The binomial transform of p-recursive sequences and the dilogarithm function
From MaRDI portal
The binomial transform of \(p\)-recursive sequences and the dilogarithm function
Abstract: Using a generalized binomial transform and a novel binomial coefficient identity, we will show that the set of p-recursive sequences is closed under the binomial transform. Using these results, we will derive a new series representation for the dilogarithm function that converges on . Finally, we will show that this series representation results in a scheme for numerical evaluation of the dilogarithm function that is accurate, efficient, and stable.
Recommendations
Cites work
- Accuracy and Stability of Numerical Algorithms
- Analytic continuation of the \(_{3}F_{2}\) hypergeometric series
- Binomial transform and the backward difference
- Binomial transform of products.
- Computer algebra in quantum field theory. Integration, summation and special functions
- Generalized Binomial Transform Applied to the Divergent Series
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 722340 (Why is no real title available?)
- Notes on the binomial transform. Theory and table with appendix on Stirling transform
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- Zeta series generating function transformations related to polylogarithm functions and the k-order harmonic numbers
Cited in
(3)
This page was built for publication: The binomial transform of \(p\)-recursive sequences and the dilogarithm function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141671)