Related papers: Evaluation of complex-valued error-like functions …
Value iteration is a fundamental algorithm for solving Markov Decision Processes (MDPs). It computes the maximal $n$-step payoff by iterating $n$ times a recurrence equation which is naturally associated to the MDP. At the same time, value…
Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one…
The bilinear form of a matrix function, namely $\mathbf{u}^\top f(A) \mathbf{v}$, appears in many scientific computing problems, where $\mathbf{u}, \mathbf{v} \in \mathbb{R}^n$, $A \in \mathbb{R}^{n \times n}$, and $f(z)$ is a given…
In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis.…
We present new results on the classical algorithm of variable elimination, which underlies many algorithms including for probabilistic inference. The results relate to exploiting functional dependencies, allowing one to perform inference…
The (extended) Binary Value Principle (eBVP: $\sum_{i=1}^n x_i2^{i-1} = -k$ for $k>0$ and $x^2_i=x_i$) has received a lot of attention recently, several lower bounds have been proved for it (Alekseev et al 2020, Alekseev 2021, Part and…
The rejection threshold used for e-values and e-processes is by default set to $1/\alpha$ for a guaranteed type-I error control at $\alpha$, based on Markov's and Ville's inequalities. This threshold can be wasteful in practical…
In a previous paper it was shown that the Forward Euler method applied to differential inclusions where the right-hand side is a Lipschitz continuous set-valued function with uniformly bounded, compact values, converges with rate one. The…
In this paper, we develop efficient and accurate algorithms for evaluating $\varphi(A)$ and $\varphi(A)b$, where $A$ is an $N\times N$ matrix, $b$ is an $N$ dimensional vector and $\varphi$ is the function defined by…
Although persistent excitation is often acknowledged as a sufficient condition to exponentially converge in the field of adaptive parameter estimation, it must be noted that in practical applications this may be unguaranteed. Recently, more…
In this paper we extend the Zeta function regularization technique, which gives a meaningful solution to divergent power series, in order to assign finite values to divergent integral of certain transcendental functions $f(x)$. The…
We describe a method to evaluate integrals that arise in the asymptotic analysis when two saddle points may be close together. These integrals, which appear in problems from optics, acoustics or quantum mechanics as well as in a wide class…
This paper introduces the Trimmed Functional Empirical Process (TFEP) as a robust framework for statistical inference when dealing with heavy-tailed or skewed distributions, where classical moments such as the mean or variance may be…
The article proposes a Caputo fractional conjugate gradient (CFCG) method for unconstrained optimization problems which is applicable to smooth as well as non-smooth problmes. The proposed method uses a non-adaptive version of the Caputo…
We present an efficient algorithm for the evaluation of the Caputo fractional derivative $_0^C\!D_t^\alpha f(t)$ of order $\alpha\in (0,1)$, which can be expressed as a convolution of $f'(t)$ with the kernel $t^{-\alpha}$. The algorithm is…
Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of critical software. This problem of computing…
There is renewed interest in formulating integration as an inference problem, motivated by obtaining a full distribution over numerical error that can be propagated through subsequent computation. Current methods, such as Bayesian…
This thesis studies high-dimensional, continuous-valued pairwise Markov Random Fields. We are particularly interested in approximating pairwise densities whose logarithm belongs to a Sobolev space. For this problem we propose the method of…
We develop a simple two-step algorithm for enclosing Chebyshev expansions whose cost is linear in terms of the polynomial degree. The algorithm first transforms the expansion from Chebyshev to the Laurent basis and then applies the interval…
We show that Hermite's approximations to values of the exponential function at given algebraic numbers are nearly optimal when considered from an adelic perspective. We achieve this by taking into account the ratio of these values whenever…