Error estimates for Gaussian quadrature

This paper is concerned with estimating the Gaussian quadrature error in the numerical integration of an analytic function$\text{?(x)}$ over the interval?1<x<1. An approximate expression for the quadrature error is given in terms of a contour integral in the complex plane. Known techniques can be applied directly to this contour integral to obtain quadrature error estimates. This approach has the advantage of avoiding the computation of high order derivatives as required in classical Gaussian quadrature error representations.     

About some quadrature formulas

In this paper, we studied a class of quadrature formulas obtained by using the connection between the monospline functions and the quadrature formulas. For this class we obtain the optimal quadrature formula with regard to the error and we give some inequalities for the remainder term of this optimal quadrature formula.      

Some observations on Gauss-Legendre quadrature error estimates for analytic functions

This paper is concerned with estimates for the error when a Gauss-Legendre quadrature rule is used to numerically integrate an analytic function. The error in a standard approximation to the kernel function, which appears in a contour integral representation for the quadrature error, is investigated for this purpose. Applications to meromorphic functions with simple poles are discussed.     

Quadrature rules for integrals of fuzzy-number-valued functions

In this paper, we introduce some quadrature rules for the Henstock integral of fuzzy-number-valued mappings by giving error bounds for mappings of bounded variation and of Lipschitz type. We also consider generalizations of classical quadrature rules, such as midpoint-type, trapezoidal and three-point-type quadrature. Finally, we study δ-fine quadrature rules and we present some numerical applications.     

Convergence of Runge-Kutta methods for neutral Volterra delay-integro-differential equations

In this paper, we focus on the error behavior of Runge-Kutta methods for nonlinear neutral Volterra delay-integro-differential equations (NVDIDEs) with constant delay. The convergence properties of the Runge-Kutta methods with two classes of quadrature technique, compound quadrature rule and Pouzet type quadrature technique, are investigated.      

Prolate spheroidal wave functions on a disc—Integration and approximation of two-dimensional bandlimited functions

We consider the problem of integrating and approximating 2D bandlimited functions restricted to a disc by using 2D prolate spheroidal wave functions (PSWFs). We derive a numerical scheme for the evaluation of the 2D PSWFs on a disc, which is the basis for the numerical implementation of the presented quadrature and approximation schemes. Next, we derive a quadrature formula for bandlimited functions restricted to a disc and give a bound on the integration error. We apply this quadrature to derive an approximation scheme for such functions. We prove a bound on the approximation error and present numerical results that demonstrate the effectiveness of the quadrature and approximation schemes.     

Schur‐convexity and quadrature formulae

This paper aims to contribute to the exploration of quadrature formulae by proving that the error of a quadrature formula has the Schur‐convexity property. The emphasis is on the quadrature formulae with the maximum degree of precision. The Schur‐convexity of the error has an interesting implication – the monotonicity of the error. Namely, it turns out that the absolute value of the error is always smaller on a smaller interval (of the two which share the same midpoint).     

Quadrature Formulas for Refinable Functions and Wavelets II: Error Analysis

This paper is concerned with the construction and the analysis of Gauss quadrature formulas for computing integrals of (smooth) functions against refinable functions and wavelets. The main goal of this paper is to develop rigorous error estimates for these formulas. For the univariate setting, we derive asymptotic error bounds for a huge class of weight functions including spline functions. We also discuss multivariate quadrature rules and present error estimates for specific nonseparable refinable functions, i.e., for some special box splines.     

Derivative corrections for quadrature formulas

In this paper, we develop corrected quadrature formulas by approximating the derivatives of the integrand that appear in the asymptotic error expansion of the quadrature, using only the function values in the original quadrature rule. A higher order convergence is achieved without computing additional function values of the integrand.This author is in part supported by National Science Foundation under grant DMS-9504780 and by NASA-OAI Summer Faculty Fellowship (1995).     

Estimates for the Gauss four-point formula for functions with low degree of smoothness

The aim of this work is to derive the Gauss four-point quadrature formula using Euler-type identities. The advantage of this approach is that it enables us to obtain estimates of the error for functions with low degree of smoothness and also to produce quadrature formulae which contain values of derivatives at the end points of the interval.     

The error norm of Gaussian quadrature formulae for weight functions of Bernstein-Szegö type

Summary We consider the Gaussian quadrature formulae for the Bernstein-Szegö weight functions consisting of any one of the four Chebyshev weights divided by an arbitrary quadratic polynomial that remains positive on [–1, 1]. Using the method in Akrivis (1985), we compute the norm of the error functional of these quadrature formulae. The quality of the bounds for the error functional, that can be obtained in this way, is demonstrated by two numerical examples.     

Bounds on the error of fejer and clenshaw-curtis type quadrature for analytic functions

We consider the problem of integrating a function f : [-1,1] → R which has an analytic extension to an open disk D^r of radius r and center the origin, such that for any . The goal of this paper is to study the minimal error among all algorithms which evaluate the integrand at the zeros of the n-degree Chebyshev polynomials of first or second kind (Fejer type quadrature formulas) or at the zeros of (n-2)-degree Chebyshev polynomials jointed with the endpoints -1,1 (Clenshaw-Curtis type quadrature formulas), and to compare this error to the minimal error among all algorithms which evaluate the integrands at n points. In the case r > 1, it is easy to prove that Fejer and Clenshaw-Curtis type quadrature are almost optimal. In the case r = 1, we show that Fejer type formulas are not optimal since the error of any algorithm of this type is at least about n^-2. These results hold for both the worst-case and the asymptotic settings.     

Bypassing the quadrature exactness assumption of hyperinterpolation on the sphere

This paper focuses on the approximation of continuous functions on the unit sphere by spherical polynomials of degree n via hyperinterpolation. Hyperinterpolation of degree n is a discrete approximation of the $L^2$-orthogonal projection of the same degree with its Fourier coefficients evaluated by a positive-weight quadrature rule that exactly integrates all spherical polynomials of degree at most 2n. This paper aims to bypass this quadrature exactness assumption by replacing it with the Marcinkiewicz–Zygmund property proposed in a previous paper. Consequently, hyperinterpolation can be constructed by a positive-weight quadrature rule (not necessarily with quadrature exactness). This scheme is referred to as unfettered hyperinterpolation. This paper provides a reasonable error estimate for unfettered hyperinterpolation. The error estimate generally consists of two terms: a term representing the error estimate of the original hyperinterpolation of full quadrature exactness and another introduced as compensation for the loss of exactness degrees. A guide to controlling the newly introduced term in practice is provided. In particular, if the quadrature points form a quasi-Monte Carlo (QMC) design, then there is a refined error estimate. Numerical experiments verify the error estimates and the practical guide.     

非线性积分方程迭代配置法的渐近展开及其外推

非线性积分方程迭代配置法的渐近展开及其外推韩国强（华南理工大学计算机工程与科学系）ＡＳＹＭＰＴＯＴＩＣＥＲＲＯＲＥＸＭＮＳＩＯＮＳＡＮＤＥＸＴＲＡＰＯＬＡＴＩＯＮＦＯＲＴＨＥＩＴＥＲＡＴＥＤＣＯＬＬＯＣＡＴＩＯＮＭＥＴＨＯＤＳＯＦＮＯＮＬＩＮＥＡＲＩ...     

On the quadrature error in operational quadrature methods for convolutions

Summary We analyze the quadrature error associated with operational quadrature methods for convolution equations. The assumptions are that the convolution kernel is inL ¹ and that its Laplace transform is analytic and bounded in an obtuse sector of the complex plane. Under these circumstances the Laplace transform has a slow variation property which admits a Fourier analysis of the quadrature error. We provide generalL ^p error estimates assuming suitable smoothness conditions on the function under convolution.     

Error bounds of a quadrature formula with multiple nodes for the Fourier-Chebyshev coefficients for analytic functions

Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well-known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by confocal ellipses, are given. A numerical example which illustrates the calculation of these error bounds is included.     

An asymptotic expansion for product integration applied to Cauchy principal value integrals

Product integration methods for Cauchy principal value integrals based on piecewise Lagrangian interpolation are studied. It is shown that for this class of quadrature methods the truncation error has an asymptotic expansion in integer powers of the step-size, and that a method with an asymptotic expansion in even powers of the step-size does not exist. The relative merits of a quadrature method which employs values of both the integrand and its first derivative and for which the truncation error has an asymptotic expansion in even powers of the step-size are discussed.     

半线性抛物型积分—微分方程的谱方法

本文在讨论带有半线性记忆项抛物型方程半离散格式的基础上,构造了空间方向谱离散,时间方向后欧拉方法的全离散格式,并给出了误差估计。对于记忆项的数值积分,采用了梯形公式与矩形公式结合的方法,并估计了数值积分的影响。     

Error estimates for some composite corrected quadrature rules

The asymptotic behaviour of the error for a general quadrature rule is established and it is applied to some composite corrected quadrature rules.     

Gaussian quadrature of Chebyshev polynomials

We investigate the behaviour of the maximum error in applying Gaussian quadrature to the Chebyshev polynomials T_m. This quantity has applications in determining error bounds for Gaussian quadrature of analytic functions.