Related papers: Twofold exp and log
We present the main improvements and new features in version $\texttt{2.0}$ of the open-source $\texttt{C++}$ library $\texttt{FireFly}$ for the interpolation of rational functions. This includes algorithmic improvements, e.g. a hybrid…
We study in this paper the function approximation error of multivariate linear extrapolation. The sharp error bound of linear interpolation already exists in the literature. However, linear extrapolation is used far more often in…
When scattering amplitudes are calculated in the double-logarithmic approximation, it is possible to relate the double-logarithmic on-shell and off-shell amplitudes. Explicit relations are obtained for scattering amplitudes in QED, QCD, and…
We provide a small C++ library with Mathematica and Python interfaces for computing thermal functions, defined $$ J_\text{B/F}(y^2) \equiv \Re \int_0^\infty x^2 \log\left[1 \mp e^{-\sqrt{x^2 + y^2}} \right] \,\text{d}x, $$ which appear in…
From the integration of non-symmetrical hyperboles, a one-parameter generalization of the logarithmic function is obtained. Inverting this function, one obtains the generalized exponential function. We show that functions characterizing…
By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…
This work establishes the existence of addition theorems and double-angle formulas for Ck real scalar functions. Moreover, we determine necessary and sufficient conditions for a bivariate function to be an addition formula for a Ck real…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…
We present a streamlined, slightly modified version, in the two-variable situation, of a beautiful, but not so well known, theory by B\"{o}gel, already from the 1930s, on an alternative higher dimensional calculus of real functions, a…
We present faster high-accuracy algorithms for computing $\ell_p$-norm minimizing flows. On a graph with $m$ edges, our algorithm can compute a $(1+1/\text{poly}(m))$-approximate unweighted $\ell_p$-norm minimizing flow with…
Elementary function calls are a common feature in numerical programs. While their implementions in library functions are highly optimized, their computation is nonetheless very expensive compared to plain arithmetic. Full accuracy is,…
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…
Slow-fast dynamical systems have two time scales and an explicit parameter representing the ratio of these time scales. Locally invariant slow manifolds along which motion occurs on the slow time scale are a prominent feature of slow-fast…
The exponential and Gaussian functions are among the most fundamental and important operations, appearing ubiquitously throughout all areas of science, engineering, and mathematics. Whereas formally, it is well-known that any function may…
We present the first polynomial-time algorithm for computing a near-optimal \emph{flow}-expander decomposition. Given a graph $G$ and a parameter $\phi$, our algorithm removes at most a $\phi\log^{1+o(1)}n$ fraction of edges so that every…
We intend to derive the moment and exponential tail estimates for the so-called bivariate or more generally multivariate functional operations, not necessary to be linear or even multilinear. We will show also the strong or at last weak…
For a slice--regular quaternionic function $f,$ the classical exponential function $\exp f$ is not slice--regular in general. An alternative definition of exponential function, the $*$-exponential $\exp_*$, was given: if $f$ is a…