Related papers: Numerical methods and arbitrary-precision computat…
This paper is concerned with Mahler's method. We study in detail the structure of linear relations between values of Mahler functions at algebraic points. In particular, given a field ${\bf k}$, a Mahler function $f(z)\in{\bf k}\{z\}$, and…
An asymptotic expansion formula of Riemann sums over lattice polytopes is given. The formula is an asymptotic form of the local Euler-Maclaurin formula due to Berline-Vergne. The proof given here for Delzant lattice polytopes is independent…
Numerical methods for the computation of the parabolic cylinder $U(a,z)$ for real $a$ and complex $z$ are presented. The main tools are recent asymptotic expansions involving exponential and Airy functions, with slowly varying analytic…
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
We give a combinatorial proof of the transcendence of $L(1,\chi_s)/\Pi$, where $L(1,\chi_s)$ (resp. $\Pi$) is the analogue in characteristic $p$ of the function $L$ of Dirichlet (resp. $\pi$). This result has been proven by G. Damamme using…
For a complex variable $s$ and real parameters $a$ and $\lambda$ with $a>0$, let $\phi(s,a,\lambda)$ denote the Lerch zeta-function with a complex variable, $\phi^{\ast}(s,a,\lambda)$ a slight modification of $\phi(s,a,\lambda)$ defined by…
An existing solvability result for relaxed one-sided Lipschitz algebraic inclusions is substantially improved. This enhanced solvability result allows the design of a very robust numerical method for the approximation of a solution of the…
We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…
In this paper, we show the existence of a transcendental function $f\in\mathbb{Z}\{z\}$ with coefficients that are almost all bounded such that $f$ and all its derivatives assume algebraic values at algebraic points. Furthermore, we…
The numerical simulation of the 3D incompressible Euler equation is analyzed with respect to different integration methods. The numerical schemes we considered include spectral methods with different strategies for dealiasing and two…
In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of the corresponding transformation that…
A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order $0$ as well as evaluating Schl\"{o}milch and Fourier--Bessel expansions in $\mathcal{O}(N(\log N)^2/\log\!\log N)$ operations. The…
Consider the Riemann sum of a smooth compactly supported function h(x) on a polyhedron in R^d, sampled at the points of the lattice Z^d/t. We give an asymptotic expansion when t goes to infinity, writing each coefficient of this expansion…
This work is an extension of previous work by Alazah et al. [M. Alazah, S. N. Chandler-Wilde, and S. La Porte, Numerische Mathematik, 128(4):635-661, 2014]. We split the computation of the Fresnel Integrals into 3 cases: a truncated Taylor…
Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…
We can find in the literature several convergent and/or asymptotic expansions of the Pearcey integral $P(x,y)$ in different regions of the complex variables $x$ and $y$, but they do not cover the whole complex $x$ and $y$ planes. The…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula $\Phi$ when the…
In this paper, we reconsider the large-argument asymptotic expansions of the Hankel, Bessel and modified Bessel functions and their derivatives. New integral representations for the remainder terms of these asymptotic expansions are found…