4. 4.1. 4.1.1. 4.1.2. 4.1.3. 4.2. 4.3. Gaussian quadrature with preassigned nodes Christoffel's work and related developments Kronrod's extension of quadrature rules Gaussian quadrature with multiple nodes The quadrature formula of Turan Arbitrary multiplicities and preassigned nodes Power-orthogonal polynomials Constructive aspects and applications Further miscellaneous extensions Product-type...

The Gauss-Kronrod quadrature formula Qi//+X is used for a practical estimate of the error R^j of an approximate integration using the Gaussian quadrature formula Q% . Studying an often-used theoretical quality measure, for ߣ* , we prove best presently known bounds for the error constants cs(RTMx)= sup \RlK+x[f]\ ll/(l»lloo<l in the case s = "Sn + 2 + tc , k = L^J LfJ • A comparison with the Ga...

A positive quadrature formula with n nodes which is exact for polynomials of degree In — r — 1, 0 < r < « , is based on the zeros of certain quasi-orthogonal polynomials of degree n . We show that the quasi-orthogonal polynomials that lead to the positive quadrature formulae can all be expressed as characteristic polynomials of a symmetric tridiagonal matrix with positive subdiagonal entries. A...

Several deenitions of universality of an n-point quadrature formula Q n are discussed. Universality means that Q n is able to compete with the respective optimal formula in many classes of functions. It is proved in a certain sense that the Gaus-sian quadrature formula satisses such a universality criterion. The underlying classes of functions are In each of these classes, we loose at most the ...

1. Introduction. The estimation of quadrature errors for analytic functions has been considered by Davis and Rabinowitz [1]. An estimate for the error of the Gaussian quadrature formula for analytic functions was obtained by Davis [2]. McNamee [3] has also discussed the estimation of error of the Gauss-Legendre quadrature for analytic functions. Convergence of the Gaussian quadratures was discu...

this paper proposes a hybrid method to find cumulative distribution function (cdf) of completion time of gert-type networks (gtn) which have no loop and have only exclusive-or nodes. proposed method is cre-ated by combining an analytical transformation with gaussian quadrature formula. also the combined crude monte carlo simulation and combined conditional monte carlo simulation are developed a...

The Gaussian quadrature formula had been popularized by Butler and Mo$tt (1982 Econometrika 50, 761}764) for the estimation of the error component probit panel model. Borjas and Sueyoshi (1994, Journal of Econometrics 64, 164}182) pointed out some numerical and statistical di$culties of applying it to models with group e!ects. With a moderate or large number of individuals in a group, the likel...

We consider errors of positive quadrature formulas applied to Chebyshev polynomials. These errors play an important role in the error analysis for many function classes. Hunter conjectured that the supremum of all errors in Gaussian quadrature of Chebyshev polynomials equals the norm of the quadrature formula. We give examples, for which Hunter's conjecture does not hold. However, we prove that...

We construct a quadrature formula with n+ 1 angles and positive weights, exact in the (2n+1)-dimensional space of trigonometric polynomials of degree ≤ n on intervals with length smaller than 2π. We apply the formula to the construction of product Gaussian quadrature rules on circular sectors, zones, segments and lenses. 2000 AMS subject classification: 65D32.