Related papers: Expansion around half-integer values, binomial sum…
Some finite series of harmonic numbers involving certain reciprocals are evaluated. Products of such reciprocals are expanded in a sum of the individual reciprocals, leading to a computer program. A list of examples is provided.
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
Gosper developed an algorithm for performing arithmetic operations on continued fractions (CFs), getting a CF as the result. Straightforward implementation of the algorithm leads to infinite loops on some inputs. Here we present a modified…
We examine exponential sums of the form $\sum_{n \le X} w(n) e^{2\pi i\alpha n^k}$, for $k=1,2$, where $\alpha$ satisfies a generalized Diophantine approximation and where $w$ are different arithmetic functions that might be multiplicative,…
Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
In this work we present the computer algebra package HarmonicSums and its theoretical background for the manipulation of harmonic sums and some related quantities as for example Euler-Zagier sums and harmonic polylogarithms. Harmonic sums…
Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…
This is a discussion of miscellaneous summation, integration and transformation formulas obtained using Fourier analysis. The topics covered are: Series of the form $\sum_{n\in\mathbb{Z}} c_ne^{\pi i \gamma n^2}$; Fusion of integrals, and…
This paper is part of a series of papers in which the asymptotic theory and appropriate symbolic computer code are developed to compute the asymptotic expansion of the solution of an n-th order ordinary differential equation. The paper…
This work introduces a new functional series for expanding an analytic function in terms of an arbitrary analytic function. It is generally applicable and straightforward to use. It is also suitable for approximating the behavior of a…
Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a…
A method for the evaluation of the epsilon expansion of multi-loop massless Feynman integrals is introduced. This method is based on the Gegenbauer polynomial technique and the expansion of the Gamma function in terms of harmonic sums.…
In this paper, we revisit the diffusive representations of fractional integrals established in \cite{diethelm2023diffusive} to explore novel variants of such representations which provide highly efficient numerical algorithms for the…
In this paper we examine the existence of bicomplexified inverse Fourier transform as an extension of its complexified inverse version within the region of convergence of bicomplex Fourier transform. In this paper we use the idempotent…
With the exception of q-hypergeometric summation, the use of computer algebra packages implementing Zeilberger's "holonomic systems approach" in a broader mathematical sense is less common in the field of q-series and basic hypergeometric…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…