Related papers: Multiple precision evaluation of the Airy Ai funct…
We investigate the relations between the rings ${\bf E}$, ${\bf G}$ and ${\bf D}$ of values taken at algebraic points by arithmetic Gevrey series of order either $-1$ ($E$-functions), $0$ (analytic continuations of $G$-functions) or $1$…
The paper develops an optimal regulator for a general class of multi-input affine nonlinear systems minimizing a nonlinear cost functional with infinite horizon. The cost functional is general enough to enforce saturation limits on the…
The reciprocal function, 1/x, is important for many real-time algorithms. It is used in a large variety of algorithms from areas ranging from iterative estimation to machine learning. Many of these algorithms are iterative in nature and…
We present a systematic study of higher-order Airy-type differential equations providing the explicit form of the solutions, deriving their power series expansions and a probabilistic interpretation. Under suitable convergence hypotheses,…
Error performance is one of the main performance measures and derivation of its closed-form expression has proved to be quite involved for certain systems. In this letter, a unified closed-form expression, applicable to different binary…
Building upon previous works of Andr{\'e} and Chudnovsky, we prove a general result concerning the approximations of values at rational points a/b of any G-function F with rational Taylor coefficients by fractions of the form n/(B…
This paper presents a new approach in application of the Fourier transform to the complex error function resulting in an efficient rational approximation. Specifically, the computational test shows that with only $17$ summation terms the…
Mixed-dimensional elliptic equations exhibiting a hierarchical structure are commonly used to model problems with high aspect ratio inclusions, such as flow in fractured porous media. We derive general abstract estimates based on the theory…
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…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
We consider a variant expression to regularize the Euler product representation of the zeta functions, where we mainly apply to that of the Riemann zeta function in this paper. The regularization itself is identical to that of the zeta…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
Consider an arbitrary complex-valued, twice continuously differentiable, nonvanishing function $\phi$ defined on a finite segment $[a,b]\subset \mathbb{R}$. Let us introduce an infinite system of functions constructed in the following way.…
Fortran 77 programs for the computation of modified Bessel functions of purely imaginary order are presented. The codes compute the functions $K_{ia}(x)$, $L_{ia}(x)$ and their derivatives for real $a$ and positive $x$; these functions are…
When a large body of data from diverse experiments is analyzed using a theoretical model with many parameters, the standard error matrix method and the general tools for evaluating errors may become inadequate. We present an iterative…
We extend several celebrated methods in classical analysis for summing series of complex numbers to series of complex matrices. These include the summation methods of Abel, Borel, Ces\'aro, Euler, Lambert, N\"orlund, and Mittag-Leffler,…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
Many explainable AI (XAI) techniques strive for interpretability by providing concise salient information, such as sparse linear factors. However, users either only see inaccurate global explanations, or highly-varying local explanations.…
Computer algebra algorithms are developed for evaluating the coefficients in Airy-type asymptotic expansions that are obtained from integrals with a large parameter. The coefficients are defined from recursive schemes obtained from…