Related papers: Error Bounds for Numerical Integration of Oscillat…
This is a tutorial paper that gives the complete proof of a result of Frolov [2] that shows the optimal order of convergence for numerical integration of functions with bounded mixed derivatives. The presentation follows Temlyakov [8], see…
Splitting methods constitute a widely used class of numerical integrators for ordinary and partial differential equations, particularly well suited to problems that can be decomposed into simpler subproblems. High-order splitting schemes…
Fortran 77 programs for the computation of modified Bessel functions of purely imaginary order are presented. The codes compute the functions $K_{ia}(x)$, $L_{ia}(x)$ and their derivatives for real $a$ and positive $x$; these functions are…
New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that new bounds are better respectively than…
We propose a new stable Levin method to compute oscillatory integrals with logarithmic singularities and without stationary points. To avoid the singularity, we apply the technique of singularity separation and transform the singular ODE…
We establish good numerical estimates for a certain class of integrals involving sixfold products of Bessel functions. We use relatively elementary methods. The estimates will be used in the study of a sharp Fourier restriction inequality…
We propose new weak error bounds and expansion in dimension one for optimal quantization-based cubature formula for different classes of functions, such that piecewise affine functions, Lipschitz convex functions or differentiable function…
We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…
In this work, we study linear error-correcting codes against adversarial insertion-deletion (indel) errors. While most constructions for the indel model are nonlinear, linear codes offer compact representations, efficient encoding, and…
Finite precision computations using digital computers involve the following inherent errors: (1) Round-off error of finite precision computations (2) Binary computer arithmetic precludes exact number representation of traditional decimal…
This paper deals with a general form of variational problems in Banach spaces which encompasses variational inequalities as well as minimization problems. We prove a characterization of local error bounds for the distance to the…
We present an error bound for a least squares version of the kernel based meshless finite difference method for elliptic differential equations on smooth compact manifolds of arbitrary dimension without boundary. In particular, we obtain…
New bounds on classification error rates for the error-correcting output code (ECOC) approach in machine learning are presented. These bounds have exponential decay complexity with respect to codeword length and theoretically validate the…
A method is presented for the evaluation of integrals on tetrahedra where the integrand has an integrable singularity at one vertex. The approach uses a transformation to spherical polar coordinates which explicitly eliminates the…
We present techniques for successfully performing numerical relativity simulations of binary black holes with fourth-order accuracy. Our simulations are based on a new coding framework which currently supports higher order finite…
We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw-Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n^{-s-1}) for some s > 0,…
We study subleading corrections to the corner free energy in classical two-dimensional critical systems, focusing on a generic boundary perturbation by the stress-tensor of the underlying conformal field theory (CFT). In the particular case…
Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of critical software. This problem of computing…
We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz…
The numerical evaluation of integrals of the form \begin{align*} \int_a^b f(x) e^{ikg(x)}\,dx \end{align*} is an important problem in scientific computing with significant applications in many branches of applied mathematics, science and…