Related papers: The Crucial Constants in the Exponential-type Erro…
Numerical simulations with rigid particles, drops or vesicles constitute some examples that involve 3D objects with spherical topology. When the numerical method is based on boundary integral equations, the error in using a regular…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
In this article, we focus on the error that is committed when computing the matrix logarithm using the Gauss--Legendre quadrature rules. These formulas can be interpreted as Pad\'e approximants of a suitable Gauss hypergeometric function.…
We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a…
In [Kopteva, Math. Comp., 2014] a counterexample of an anisotropic triangulation was given on which the exact solution has a second-order error of linear interpolation, while the computed solution obtained using linear finite elements is…
We determine the pointwise error in Hermite interpolation by numerically solving an appropriate differential equation, derived from the error term itself. We use this knowledge to approximate the error term by means of a polynomial, which…
We use Monte Carlo simulations to obtain an improved lattice measurement of the critical coupling constant [lambda / mu^2]_crit for the continuum (1 + 1)-dimensional (lambda / 4) phi^4 theory. We find that the critical coupling constant…
Current reporting of results based on Markov chain Monte Carlo computations could be improved. In particular, a measure of the accuracy of the resulting estimates is rarely reported. Thus we have little ability to objectively assess the…
We make two contributions to the problem of estimating the $L_1$ calibration error of a binary classifier from a finite dataset. First, we provide an upper bound for any classifier where the calibration function has bounded variation.…
Layer potentials represent solutions to partial differential equations in an integral equation formulation. When numerically evaluating layer potentials at evaluation points close to the domain boundary, specialized quadrature techniques…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
For all $s \geq 1$ and $N \geq 1$ there exist sequences $(z_1,\ldots,z_N)$ in $[0,1]^s$ such that the star-discrepancy of these points can be bounded by $$D_N^*(z_1,\ldots,z_N) \leq c \frac{\sqrt{s}}{\sqrt{N}}.$$ The best known value for…
We study fidelity susceptibility in one-dimensional asymmetric Hubbard model, and show that the fidelity susceptibility can be used to identify the universality class of the quantum phase transitions in this model. The critical exponents…
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…
In this paper, we study a modified residual-based a posteriori error estimator for the nonconforming linear finite element approximation to the interface problem. The reliability of the estimator is analyzed by a new and direct approach…
Based on a new Taylor-like formula, we derived an improved interpolation error estimate in $W^{1,p}$. We compare it with the classical error estimates based on the standard Taylor formula, and also with the corresponding interpolation error…
Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…
Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a…
A critical value of a function is the value of this function at one of its critical points. Each critical point of a differentiable multivariate function is described by the equations which consist in equating to zero all of its partial…