Related papers: New error bounds for Boole's rule

In this paper we present a new family of rules for numerical integration. This family has up to half the error of the widely used Newton-Cotes rules when a sufficient number of points is evaluated and also much better numerical stability…

In this work, we present some new integration formulas for any order of accuracy as an application of the B-spline relations obtained in [1]. The resulting rules are defined as a perturbation of the trapezoidal integration method. We prove…

For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change. The proof of two basic results in numerical analysis, the error term for Lagrange…

An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.

The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…

Approximating integrals is a fundamental task in probability theory and statistical inference, and their applied fields of signal processing, and Bayesian learning, as soon as expectations over probability distributions must be computed…

In order to approximate the integral $I(f)=\int_a^b f(x) dx$, where $f$ is a sufficiently smooth function, models for quadrature rules are developed using a given {\it panel} of $n (n\geq 2)$ equally spaced points. These models arise from…

In this article we give some refinements of Simpson's Rule in cases when it is not applicable in it's classical form i.e., when the target function is not four times differentiable on a given interval. Some sharp two-sided inequalities for…

Simple proofs of the midpoint, trapezoidal and Simpson's rules are proved for numerical integration on a compact interval. The integrand is assumed to be twice continuously differentiable for the midpoint and trapezoidal rules, and to be…

Let M(f) denote the Midpoint Rule and T(f) the Trapezoidal Rule for estimating integral_a^b f(x) dx. Then Simpson's Rule = tM(f) + (1-t)T(f), where t = 2/3. We generalize Simpson's Rule to multiple integrals as follows. Let D be some…

We adapt Stein's method of diffusion approximations, developed by Barbour, to the study of chaotic dynamical systems. We establish an error bound in the functional central limit theorem with respect to an integral probability metric of…

Quadrature rules estimate the value of an integral when the function is given by a table of values. Every binary string defines a quadrature rule by choosing which endpoint of each interval represents the interval. The standard rules, such…

Filon-Simpson quadrature rules are derived for integrals of the type \int_a^b dx f(x) sin(xy)/(xy) and \int_a^b dx f(x) 4 sin^2(xy/2)/(xy)^2 which are needed in applications of the worldline variational approach to Quantum Field Theory.…

The paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and develops its application to decoding interleaved Reed--Solomon codes beyond half the minimum distance. While closely related both to standard key…

Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Bounds on their performance, derived in the…

Based on two point spline approximations of arbitrary order, a series of functions that define lower bounds for sin(x) and sin(x)/x, over the interval [0,Pi/2], with increasingly low relative errors and smaller relative errors than…

We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…

In this article we revisit the problem of numerical integration for monotone bounded functions, with a focus on the class of nonsequential Monte Carlo methods. We first provide new a lower bound on the maximal $L^p$ error of nonsequential…

Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed-Solomon…

Split sample methods have recently been put forward as a way to reduce the coverage oscillations that haunt confidence intervals for parameters of lattice distributions, such as the binomial and Poisson distributions. We study split sample…