Related papers: The Error in Rayleigh's Approximative Period
The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the…
We show how to compute the edit distance between two strings of length n up to a factor of 2^{\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time,…
Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…
In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…
We derive optimal order a posteriori error estimates in the $L^\infty(L^2)$ and $L^1(L^2)$-norms for the fully discrete approximations of time fractional parabolic differential equations. For the discretization in time, we use the $L1$…
Tracers in a turbulent flow separate according to the celebrated $t^{3/2}$ Richardson--Obukhov law, which is usually explained by a scale-dependent effective diffusivity. Here, supported by state-of-the-art numerics, we revisit this…
This paper considers the robust phase retrieval problem, which can be cast as a nonsmooth and nonconvex optimization problem. We propose a new inexact proximal linear algorithm with the subproblem being solved inexactly. Our contributions…
The edit distance (a.k.a. the Levenshtein distance) between two strings is defined as the minimum number of insertions, deletions or substitutions of symbols needed to transform one string into another. The problem of computing the edit…
The edit distance is a way of quantifying how similar two strings are to one another by counting the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. A simple dynamic…
In the 1990's exponential-type error bounds appeared in the theory of radial basis functions. This kind of error bounds is very powerful. However it only measures the difference between the approximant and approximand. Mathematicians and…
A new bound for the remainder term in the Taylor expansion of the complex exponent $e^{ix}$, $x\in\R$, is proved yielding precise moment-type estimates of the accuracy of the approximation of the characteristic function (the…
We here calculate the series expansion of the T-matrix for a spheroidal particle in the small-size/long-wavelength limit, up to third lowest order with respect to the size parameter, X, which we will define rigorously for a non-spherical…
This paper is concerned with the derivation of computable and guaranteed upper and lower bounds of the difference between the exact and the approximate solution of a boundary value problem for static Maxwell equations. Our analysis is based…
We establish a link between the phenomenon of Taylor dispersion and the theory of empirical distributions. Using this connection, we derive, upon applying the theory of large deviations, an alternative and much more precise description of…
Variational inference has become an increasingly attractive fast alternative to Markov chain Monte Carlo methods for approximate Bayesian inference. However, a major obstacle to the widespread use of variational methods is the lack of…
Rayleigh-Taylor instability in a compressible fluid is reconsidered. The density is allowed to vary with pressure under the barotropy assumption. For the case with equal speeds of sound in the two superposed fluids, in order to give a…
In this paper, we provide explicit upper and lower bounds for the argument of the Riemann zeta-function and its antiderivatives in the critical strip under the assumption of the Riemann hypothesis. This extends the previously known bounds…
Approximating nonlinear dynamics with a truncated perturbative expan- sion may be accurate for a while, but it in general breaks down at a long time scale that is one over the small expansion parameter. There are interesting occasions in…
We describe an extension of the Taylor method for the numerical solution of ODEs that uses Pad\'e approximants to obtain extremely precise numerical results. The accuracy of the results is essentially limited only by the computer time and…
Probability estimation is an elementary building block of every statistical data compression algorithm. In practice probability estimation is often based on relative letter frequencies which get scaled down, when their sum is too large.…