Related papers: Error term improvements for van der Corput transfo…
We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…
Using a method mixing Mellin-Barnes representation and Borel resummation we show how to obtain hyperasymptotic expansions from the (divergent) formal power series which follow from the perturbative evaluation of arbitrary "$N$-point"…
In this paper we improve the estimate for the remainder term in the asymptotic formula concerning the circle problem in an arithmetic progression.
With regard to a three-step estimation procedure, proposed without theoretical discussion by Li and You in Journal of Applied Statistics and Management, for a nonparametric regression model with time-varying regression function, local…
We study the third moment of quadratic Dirichlet L-functions, obtaining an error term of size $O(X^{3/4 + \varepsilon})$.
In this paper we discuss a closed-form approximation of the likelihood functions of an arbitrary diffusion process. The approximation is based on an exponential ansatz of the transition probability for a finite time step $\Delta t$, and a…
In this paper, we use the Bessel $\delta$-method, along with new variants of the van der Corput method in two dimensions, to prove non-trivial bounds for $\mathrm{GL}(2)$ exponential sums beyond the Weyl barrier. More explicitly, for sums…
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…
A rapidly convergent series, based on Taylor expansion of the imaginary part of the complex error function, is presented for highly accurate approximation of the Voigt/complex error function with small imaginary argument (Y less than 0.1).…
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…
In this paper, we improve the error term in a previous paper on an asymptotic formula for the number of squarefull numbers in an arithmetic progression.
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
Classical Edgeworth expansions provide asymptotic correction terms to the Central Limit Theorem (CLT) up to an order that depends on the number of moments available. In this paper, we provide subsequent correction terms beyond those given…
For two arithmetical functions $f$ and $g$, we study the convolution sum of the form $\sum_{n \le N} f(n) g(n+h)$ in the context of its asymptotic formula with explicit error terms. Here we introduce the concept of finite Ramanujan…
The Alekseev-Gr{\"o}bner lemma is combined with the theory of modified equations to obtain an \emph{a priori} estimate for the global error of numerical integrators. This estimate is correct up to a remainder term of order $h^{2p}$, where…
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…
Let $f(z) = \sum A(n) n^{(k-1)/2} e(nz)$ be a cusp form of weight $k \geq 3$ on $\Gamma_0(N)$ with character $\chi$. By studying a certain shifted convolution sum, we prove that $\sum_{n \leq X} A(n^2+h) = c_{f,h} X +…
This paper, first, we consider the Volterra integral equation for the remainder term in the asymptotic formula for the associated Euler totient function. Secondly, we solve the Volterra integral equation and we split the error term in the…
We provide a new hybrid estimation of single exponential sums, combining Van der Corput, Huxley and Bourgain's result. We also focus on primes in short intervals $(x-x^{\alpha},x]$ under the assumption of the existence of exceptional…
In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…