Computing the Inverse Mellin Transform of Holonomic Sequences using Kovacic's Algorithm
Jakob Ablinger
TL;DR
This paper presents an improved method for computing the inverse Mellin transform of holonomic sequences by extending Kovacic's algorithm, implemented in the HarmonicSums package.
Contribution
It introduces an extension of Kovacic's algorithm to enhance the computation of inverse Mellin transforms within a computer algebra system.
Findings
Enhanced computational efficiency for inverse Mellin transforms
Successful implementation in HarmonicSums package
Applicable to a broad class of holonomic sequences
Abstract
We describe how the extension of a solver for linear differential equations by Kovacic's algorithm helps to improve a method to compute the inverse Mellin transform of holonomic sequences. The method is implemented in the computer algebra package HarmonicSums.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.