Related papers: Error Bounds for Numerical Integration of Oscillat…
In this paper, new Levin methods are presented for calculating oscillatory integrals with algebraic and/or logarithmic singularities. To avoid singularity, the technique of singularity separation is applied and then the singular ODE…
We present new higher-order quadratures for a family of boundary integral operators re-derived using the approach introduced in [Kublik, Tanushev, and Tsai - J. Comp. Phys. 247: 279-311, 2013]. In this formulation, a boundary integral over…
The value of a highly oscillatory integral is typically determined asymptotically by the behaviour of the integrand near a small number of critical points. These include the endpoints of the integration domain and the so-called stationary…
The manuscript describes a quadrature rule that is designed for the high order discretization of boundary integral equations (BIEs) using the Nystr\"{o}m method. The technique is designed for surfaces that can naturally be parameterized…
Over the last several decades, improvements in the fields of analytic combinatorics and computer algebra have made determining the asymptotic behaviour of sequences satisfying linear recurrence relations with polynomial coefficients largely…
The Sinc quadrature and the Sinc indefinite integration are approximation formulas for definite integration and indefinite integration, respectively, which can be applied on any interval by using an appropriate variable transformation.…
Bosonic error correcting codes utilize the infinite dimensional Hilbert space of a harmonic oscillator to encode a qubit. Bosonic rotation codes are characterized by a discrete rotation symmetry in their Wigner functions and include codes…
Gauss--Christoffel quadrature is a fundamental method for numerical integration, and its convergence analysis is closely related to the decay of Chebyshev expansion coefficients. Classical estimates, including those due to Trefethen, are…
Let $f:[0,1]^d\to\mathbb{R}$ be a completely monotone integrand as defined by Aistleitner and Dick (2015) and let points $\boldsymbol{x}_0,\dots,\boldsymbol{x}_{n-1}\in[0,1]^d$ have a non-negative local discrepancy (NNLD) everywhere in…
The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame…
We prove that a variety of oscillatory and polynomial Carleson operators are uniformly bounded on the family of parameters under considerations. As a particular application of our techniques, we prove uniform bounds for oscillatory Carleson…
We consider the one-dimensional squared Bessel process given by the stochastic differential equation (SDE) \begin{align*} dX_t = 1\,dt + 2\sqrt{X_t}\,dW_t, \quad X_0=x_0, \quad t\in[0,1], \end{align*} and study strong (pathwise)…
In this paper we present a new perspective on error analysis of Legendre approximations for differentiable functions. We start by introducing a sequence of Legendre-Gauss-Lobatto polynomials and prove their theoretical properties, such as…
A new highly accurate numerical approximation scheme based on a Gauss type Clenshaw-Curtis Quadrature for Fredholm integral equations of the second kind, whose kernel is either discontinuous or not smooth along the main diagonal, is…
We provide a new information-theoretic generalization error bound that is exactly tight (i.e., matching even the constant) for the canonical quadratic Gaussian (location) problem. Most existing bounds are order-wise loose in this setting,…
Understanding how the optimal value of an optimisation problem changes when its input data is modified is an old question in mathematical optimisation. This paper investigates the computation of the optimal values of a family of (possibly…
Logarithmic Number Systems (LNS) hold considerable promise in helping reduce the number of bits needed to represent a high dynamic range of real-numbers with finite precision, and also efficiently support multiplication and division.…
This paper establishes error bounds for the convergence of a piecewise linear approximation of the constrained optimal smoothing problem posed in a reproducing kernel Hilbert space (RKHS). This problem can be reformulated as a Bayesian…
This paper deals with the estimation of the quadrature error of a Gaussian formula for weight functions involving fractional powers, exponentials and Bessel functions of the first kind. For this purpose, in this work the averaged and…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…