相关论文: The real part of the complementary error function

In this work we show a rational approximation of the Dawson's integral that can be implemented for high-accuracy computation of the complex error function in a rapid algorithm. Specifically, this approach provides accuracy exceeding $\sim…

For many common height functions, it is notoriously hard to compute the essential minimum. Nevertheless there are two classical methods, one giving lower bounds and the other giving upper bounds. In this paper, we show that the two methods…

In this paper, we present a proof of the Riemann hypothesis. We show that zeros of the Riemann zeta function should be on the line with the real value 1/2, in the region where the real part of complex variable is between 0 and 1.

The choice of a point set, to be used in numerical integration, determines, to a large extent, the error estimate of the integral. Point sets can be characterized by their discrepancy, which is a measure of its non-uniformity. Point sets…

A real-valued set function is (additively) approximately submodular if it satisfies the submodularity conditions with an additive error. Approximate submodularity arises in many settings, especially in machine learning, where the function…

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

This paper is concerned with the derivation of conforming and non-conforming functional a posteriori error estimates for elliptic boundary value problems in exterior domains. These estimates provide computable and guaranteed upper and lower…

This paper presents a new approach towards the Riemann Hypothesis. On iterative expansion of integration term in functional equation of the Riemann zeta function we get sum of two series functions. At the `non-trivial' zeros of zeta…

Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between…

Cyclic boundaries are used in many branches of physics and mathematics, typically to assist the approximation of a large space. We show that when determining the performance of planar, fault-tolerant, topological quantum error correction,…

The error autocorrection effect means that in a calculation all the intermediate errors compensate each other, so the final result is much more accurate than the intermediate results. In this case standard interval estimates are too…

This paper is concerned with the two--phase obstacle problem, a type of a variational free boundary problem. We recall the basic estimates of Repin and Valdman (2015) and verify them numerically on two examples in two space dimensions. A…

The paper is concerned with functional type a posteriori estimates for the initial boundary value problem for a parabolic partial differential equation with an obstacle. We deduce a guaranteed and computable bound of the distance between…

Numerical data suggest that the zeros $\rho$ of the auxiliary Riemann function in the upper half-plane satisfy $\mathop{\mathrm{Re}}(\rho)<1$. We show that this is true for those zeros with $\mathop{\mathrm{Im}}(\rho)> 3.9211\dots10^{65}$.…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…

Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ability to reason about rounding is especially important if one wants to explore a range of potential representations, for instance for FPGAs…

The reciprocal function, 1/x, is important for many real-time algorithms. It is used in a large variety of algorithms from areas ranging from iterative estimation to machine learning. Many of these algorithms are iterative in nature and…