Related papers: Multiple precision evaluation of the Airy Ai funct…

We propose algorithms for addressing the bias of the posterior mean when used as an estimator of parameters. These algorithms build upon the recently proposed Bayesian infinitesimal jackknife approximation (Giordano and Broderick (2023))…

Glasser's Master Theorem arXiv:1308.6361v2 is essentially a restatement of Cauchy's integral Theorem reduced to a specialized form. Here we extend that theorem by introducing two new parameters, but still retain a simple form. Because of…

This paper proposes a parametric error analysis method for Goldschmidt floating point division, which reveals how the errors of the intermediate results accumulate and propagate during the Goldschmidt iterations. The analysis is developed…

We derive new constraints on the zeros of Airy functions by using the so-called quantum bouncer system to evaluate quantum-mechanical sum rules and perform perturbation theory calculations for the Stark effect. Using commutation and…

In the current landscape of explanation methodologies, most predominant approaches, such as SHAP and LIME, employ removal-based techniques to evaluate the impact of individual features by simulating various scenarios with specific features…

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…

Integrals occurring in Thomas-Fermi theory which contains the logarithm of the Airy function Ai'(x) have been obtained in terms of analytical expressions.

Regularization method and Bayesian inverse method are two dominating ways for solving inverse problems generated from various fields, e.g., seismic exploration and medical imaging. The two methods are related with each other by the MAP…

Functions satisfying the functional equation \begin{align*} \sum_{r=0}^{n-1} (-1)^r f(x+ry, ny) = f(x,y), \quad \text{for any positive odd integer $n$}, \end{align*} are named the alternating invariant functions. Examples of such functions…

We consider the problem of computing the minimal nonnegative solution $G$ of the nonlinear matrix equation $X=\sum_{i=-1}^\infty A_iX^{i+1}$ where $A_i$, for $i\ge -1$, are nonnegative square matrices such that $\sum_{i=-1}^\infty A_i$ is…

Expressions are not functions. Confusing the two concepts or failing to define the function that is computed by an expression weakens the rigour of interval arithmetic. We give such a definition and continue with the required re-statements…

We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…

Modern AI systems have been successfully deployed to win medals at international math competitions, assist with research workflows, and prove novel technical lemmas. However, despite their progress at advanced levels of mathematics, they…

Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…

We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternating fixed point iteration, it has been recently proposed to…

We study inequalities between general integral moduli of continuity of a function and the tail integral of its Fourier transform. We obtain, in particular, a refinement of a result due to D. B. H. Cline [2] (Theorem 1.1 below). We note that…

This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…

Krylov subspace methods for approximating a matrix function $f(A)$ times a vector $v$ are analyzed in this paper. For the Arnoldi approximation to $e^{-\tau A}v$, two reliable a posteriori error estimates are derived from the new bounds and…

Classical a posteriori error analysis for differential equations quantifies the error in a Quantity of Interest (QoI) which is represented as a bounded linear functional of the solution. In this work we consider a posteriori error estimates…

Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…