Related papers: On the Stieltjes Approximation Error to Logarithmi…
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…
We correct two errors in our paper [4]. First error concerns the definition of the SVI solution, where a boundary term which arises due to the Dirichlet boundary condition, was not included. The second error concerns the discrete estimate…
We study the Cowling approximation by analytical means as applied to a system of linear differential equations arising from models of non-radial stellar pulsation. We consider various asymptotic cases, including those of high harmonic…
Standard confidence intervals employed in applied statistical analysis are usually based on asymptotic approximations. Such approximations can be considerably inaccurate in small and moderate sized samples. We derive accurate confidence…
We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.
This paper aims to derive explicit and computable error bounds for the asymptotic expansion of the Jacobi polynomials as their degree approaches infinity, using an integral method. The analysis focuses on the outer or oscillatory region of…
We consider an $N$ by $N$ real symmetric random matrix $X=(x_{ij})$ where $\mathbb{E}x_{ij}x_{kl}=\xi_{ijkl}$. Under the assumption that $(\xi_{ijkl})$ is the discretization of a piecewise Lipschitz function and that the correlation is…
Polynomial Krylov subspace methods are among the most widely used methods for approximating $f(A)b$, the action of a matrix function on a vector, in particular when $A$ is large and sparse. When $A$ is Hermitian positive definite, the…
Recently, the present authors derived new asymptotic expansions for linear differential equations having a simple turning point. These involve Airy functions and slowly varying coefficient functions, and were simpler than previous…
Given a data set of size $n$ in $d'$-dimensional Euclidean space, the $k$-means problem asks for a set of $k$ points (called centers) so that the sum of the $\ell_2^2$-distances between points of a given data set of size $n$ and the set of…
Linear matrix inequalities (LMIs) are ubiquitous in modern control theory, as well as in a variety of other fields in science and engineering. Their analytic centers, i.e. the maximum determinant elements of the feasible set spanned by…
In this paper we address the convergence of stochastic approximation when the functions to be minimized are not convex and nonsmooth. We show that the "mean-limit" approach to the convergence which leads, for smooth problems, to the ODE…
Sharp $L^\infty$ estimates are obtained for general classes of fully non-linear PDE's on non-K\"ahler manifolds, complementing the theory developed earlier by the authors in joint work with F. Tong for the K\"ahler case. The key idea is…
In 1975 Walter Philipp proved the law of the iterated logarithm (LIL) for the discrepancy of lacunary sequences: for any sequence $(n_k)_{k \geq 1}$ satisfying the Hadamard gap condition $n_{k+1} / n_k \geq q > 1,~k \geq 1,$ we have $$…
In traditional work on numerical schemes for solving stochastic differential equations (SDEs), it is usually assumed that the coefficients are globally Lipschitz. This assumption has been used to establish a powerful analysis of the…
We give elementary proofs of several Stirling's precise bounds. We first improve all the precise bounds from the literature and give new precise bounds. In particular, we show that for all $n\ge 8$ $$\sqrt{2\pi n}\left(\frac{n}{e}\right)^n…
We establish why li(x) outperforms x/log x as an estimate for the prime counting function pi(x). The result follows from subdividing the natural numbers into the intervals s_k :={p_k^2,..., p_{k+1}^2-1}, k>=1, each being fully sieved by the…
The WKB approximation plays an essential role in the development of quantum mechanics and various important results have been obtained from it. In this paper, we introduce another method, {\it the so-called uniform asymptotic…
Andrade and Keating computed the mean value of quadratic Dirichlet $L$--functions at the critical point, in the hyperelliptic ensemble over a fixed finite field $\mathbb{F}_q$. Summing $L(1/2,\chi_D)$ over monic, square-free polynomials $D$…
We consider linear two-time-scale stochastic approximation algorithms driven by martingale noise. Recent applications in machine learning motivate the need to understand finite-time error rates, but conventional stochastic approximation…