Inversely Symmetric Interpolatory Quadrature Rules

We consider interpolatory quadrature rules with nodes and weights satisfying symmetric properties in terms of the division operator. Information concerning these quadrature rules is obtained using a transformation that exists between these rules and classical symmetric interpolatory quadrature rules. In particular, we study those interpolatory quadrature rules with two fixed nodes. We obtain specific examples of such quadrature rules.     

Gaussian quadrature and acceleration of convergence

The aim of this paper is to take up again the study done in previous papers, to the case where the integrand possesses an algebraic singularity within the interval of integration. The singularities or poles close to the interval of integration considered in this paper are only real or purely imaginary. This revised version was published online in August 2006 with corrections to the Cover Date.     

Product Gaussian Quadrature on Circular Lunes

Resorting to recent results on subperiodic trigonometric quadrature, we provide three product Gaussian quadrature formulas exact on algebraic polynomials of degree $n$ on circular lunes. The first works on any lune, and has $n^2 +\mathcal{O}(n)$ cardinality. The other two have restrictions on the lune angular intervals, but their cardinality is $n^2/2 +\mathcal{O}(n)$.     

On Gauss-Type Quadrature Rules

Some Gauss-type Quadrature rules over [0, 1], which involve values and/or the derivative of the integrand at 0 and/or 1, are investigated. Our work is based on the orthogonal polynomials with respect to linear weight function ω(t): = 1 ? t over [0, 1]. These polynomials are also linked with a class of recently developed “identity-type functions”. Along the lines of Golub's work, the nodes and weights of the quadrature rules are computed from Jacobi-type matrices with simple rational entries. Computational procedures for the derived rules are tested on different integrands. The proposed methods have some advantage over the respective Gauss-type rules with respect to the Gauss weight function ω(t): = 1 over [0, 1].     

一类广义Gauss型求积公式

基于被积函数在n次第一类和第二类Chebyshev多项式的零点处的差商,该本构造了两种Gauss型求积公式. 这些求积公式包含了某些已知结果作为特例.更重要的是这些新结果与Gauss-Turan求积公式有密切的联系.     

Convergence of Gaussian Quadrature Formulas for Power Orthogonal Polynomials

In classical theorems on the convergence of Gaussian quadrature formulas for power orthogonal polynomials with respect to a weight w on I =（a,b）,a function G ∈ S（w）:= { f:∫_I | f（x）| w（x）d x < ∞} satisfying the conditions G ^2j（x） ≥ 0,x ∈（a,b）,j = 0,1,...,and growing as fast as possible as x → a + and x → b,plays an important role.But to find such a function G is often difficult and complicated.This implies that to prove convergence of Gaussian quadrature formulas,it is enough to find a function G ∈ S（w） with G ≥ 0 satisfying sup n ∑λ0knG（xkn） k=1 n<∞ instead,where the xkn ’s are the zeros of the n th power orthogonal polynomial with respect to the weight w and λ0kn ’s are the corresponding Cotes numbers.Furthermore,some results of the convergence for Gaussian quadrature formulas involving the above condition are given.     

Convergence of Gaussian quadrature formulas on infinite intervals

More general and stronger estimations of bounds for the fundamental functions of Hermite interpolation of high order on an arbitrary system of nodes on infinite intervals are given. Based on this result, convergence of Gaussian quadrature formulas for Riemann–Stieltjes integrable functions on an arbitrary system of nodes on infinite intervals is discussed.     

Orthogonal polynomials for refinable linear functionals

A refinable linear functional is one that can be expressed as a convex combination and defined by a finite number of mask coefficients of certain stretched and shifted replicas of itself. The notion generalizes an integral weighted by a refinable function. The key to calculating a Gaussian quadrature formula for such a functional is to find the three-term recursion coefficients for the polynomials orthogonal with respect to that functional. We show how to obtain the recursion coefficients by using only the mask coefficients, and without the aid of modified moments. Our result implies the existence of the corresponding refinable functional whenever the mask coefficients are nonnegative, even when the same mask does not define a refinable function. The algorithm requires rational operations and, thus, can in principle deliver exact results. Numerical evidence suggests that it is also effective in floating-point arithmetic.

     

Approximation of the Hilbert Transform on the real line using Hermite zeros

The authors study the Hilbert Transform on the real line. They introduce some polynomial approximations and some algorithms for its numerical evaluation. Error estimates in uniform norm are given.

     

Approximation of the Hilbert Transform on the real semiaxis using Laguerre zeros

The authors propose two new algorithms for the computation of Cauchy principal value integrals on the real semiaxis. The proposed quadrature rules use zeros of Laguerre polynomials. Theoretical error estimates are proved and some numerical examples are showed.     

Computation of Bessel and Airy Functions and of Related Gaussian Quadrature Formulae

Procedures are described for the high-precision calculation of the modified Bessel function K (x), 0 < < 1, and the Airy function Ai(x), for positive arguments x, as pre-requisites for generating Gaussian quadrature rules having these functions as weight function.     

Uniqueness of Gaussian quadrature formula for computed tomography

This note answers positively a question raised by B. Bojanov and G. Petrova. Namely, the Gaussian quadrature formula for computed tomography among the given type is unique.     

Doubly Adaptive Quadrature Routines Based on Newton–Cotes Rules

In this paper we test two recently published Matlab codes, adaptsim and adaptlob, using both a Lyness–Kaganove test and a battery type of test. Furthermore we modify these two codes using sequences of null rules in the error estimator with the intention to increase the reliability for both codes. In addition two new Matlab codes applying a locally and a globally adaptive strategy respectively are developed. These two new codes turn out to have very good properties both with respect to reliability and efficiency. Both algorithms are using sequences of null rules in their local error estimators. These error estimators allow us both to test if we are in the region of asymptotic behavior and thus increase reliability and to take advantage of the degree of precision of the basic quadrature rule. The new codes compare favorably to the two recently published adaptive codes both when we use a Lyness–Kaganove testing technique and by using a battery test.     

Generalized Christoffel functions and error of positive quadrature

The author gives some upper and lower bounds for the generalized Christoffel functions related to a Ditzian-Totik generalized weight. As an application, an error estimate of Gauss quadrature formula inL ₁-weighted norm is derived.Dedicated to Prof. Luigi Gatteschi on the occasion of his 70th birthdayWork sponsored by MURST 40%.     

Fast Construction of the Fejér and Clenshaw–Curtis Quadrature Rules

We present an elegant algorithm for stably and quickly generating the weights of Fejér’s quadrature rules and of the Clenshaw–Curtis rule. The weights for an arbitrary number of nodes are obtained as the discrete Fourier transform of an explicitly defined vector of rational or algebraic numbers. Since these rules have the capability of forming nested families, some of them have gained renewed interest in connection with quadrature over multi-dimensional regions. AMS subject classification (2000) 65D32, 65T20, 65Y20     

数值积分的可选择误差界(英文)

Similar to having done for the mid-point and trapezoid quadrature rules,we obtain alternative estimations of error bounds for the Simpson＇s quadrature rule involving n-time（1 ≤ n ≤ 4） differentiable mappings and then to the estimations of error bounds for the adaptive Simpson＇s quadrature rule.     

一类单位圆上的Chebyshev权的Cauchy型求积公式

在本文中,我们首先给出一些基本的结果和一些概念,然后给出单位圆上带Cheby shev权的一些Cauchy主值积分的求积公式,最后给出了它们的误差估计.     

Orthogonal polynomials and Gaussian quadrature for refinable weight functions

We show how to compute the modified moments of a refinable weight function directly from its mask in O(N²n) rational operations, where N is the desired number of moments and n the length of the mask. Three immediate applications of such moments are:

• the expansion of a refinable weight function as a Legendre series;

• the generation of the polynomials orthogonal with respect to a refinable weight function;

• the calculation of Gaussian quadrature formulas for refinable weight functions.

In the first two cases, all operations are rational and can in principle be performed exactly.

关于一般Guass-Birlhoff求积公式的注(英文)

本文证明了对于关联矩阵E＝（E1，E2），其中E1满足Polya条件，在其内行不含奇序列，E2是正则的，一般Guass-Birkhoff求积公式的存在性。