Computing the Inverse Mellin Transform of Holonomic Sequences using Kovacic's Algorithm

01/02/2018
by   Jakob Ablinger, et al.
0

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.

READ FULL TEXT
research
06/09/2016

Inverse Mellin Transform of Holonomic Sequences

We describe a method to compute the inverse Mellin transform of holonomi...
research
11/02/2022

Analysis and object oriented implementation of the Kovacic algorithm

This paper gives a detailed overview and a number of worked out examples...
research
07/03/2022

Guessing With Quadratic Differential Equations

By holonomic guessing, we denote the process of finding a linear differe...
research
10/22/2017

Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

We propose a way of characterizing the algorithms computing a Walsh-Hada...
research
09/30/2022

A ⋆-product solver with spectral accuracy for non-autonomous ordinary differential equations

A new method for solving non-autonomous ordinary differential equations ...
research
08/07/2020

Rounded Hartley Transform: A Quasi-involution

A new multiplication-free transform derived from DHT is introduced: the ...
research
10/17/2020

A Systematic Approach to Computing the Manipulator Jacobian and Hessian using the Elementary Transform Sequence

The elementary transform sequence (ETS) provides a universal method of d...

Please sign up or login with your details

Forgot password? Click here to reset