Summary
We consider cases where the Stieltjes polynomial associated with a Gaussian quadrature formula has complex zeros. In such cases a Kronrod extension of the Gaussian rule does not exist. A method is described for modifying the Stieltjes polynomial so that the resulting polynomial has no complex zeros. The modification is performed in such a way that the Kronrod-type extension rule resulting from the addition of then+1 zeros of the modified Stieltjes polynomial to the original knots of the Gaussian rule has only slightly lower degree of precision than normally achieved when the Kronrod extension rule exists. As examples of the use of the method, we present some new formulae extending the classical Gauss-Hermite quadrature rules. We comment on the limited success of the method in extending Gauss-Laguerre rules and show that several modified extensions of the Gauss Gegenbauer formulae exist in cases where the standard Kronrod extension does not.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aberth, O.: Iteration methods for finding all zeroes of a polynomial simultaneously. Math. Comput.27, 339–344 (1973)
Begumisa, A.: Modified generalized Kronrod extensions of classical Gaussian quadrature rules. Ph.D. Thesis La Trobe University, Australia 1989
Calió, F., Gautschi, W., Machetti, E.: On computing Gauss-Kronrod quadrature formulae. Math. Comput.47, 639–650 (1986)
Davis, P., Rabinowitz, P.: Methods of numerical integration. New York: Academic Press 1984
Gautschi, W.: Gauss-Kronrod quadrature — A survey. Department of Computer Sciences, Purdue University, West Lafayette, Indiana, USA 1988
Elhay, S., Kautsky, J.: A method for computing quadratures of Kronrod-Patterson type. Aust. Comput. Sci. Comm.6, 147–163 (1984)
Kahaner, D.K., Monegato, G.: Non existence of extended Gauss-Laguerre and Gauss-Hermite quadrature rules with positive weights. ZAMP,29, 893–986 (1978)
Kronrod, A.S.: Nodes and weights for quadrature formulae. Sixteen-place Tables., Nauka, Moscow, 1964; English transl. Consultants Bureau, New York 1965
Mathon, R.: Roots of complex polynormials. Technical report. University of Toronto, Toronto, Canada 1988
Monegato, G.: A note on extended Gaussian quadrature rules. Math. Comput.30, 812–817 (1976)
Monegato, G.: On polynomials orthogonal with respect to particular variable signed weight functions. ZAMP31, 549–555 (1980)
Monegato, G.: Stieltjes polynomials and related quadrature rules. SIAM Review24, 137–158 (1982)
Patterson, T.N.L.: The optimum addition of points to quadrature formulae. Math. Comput.22, 847–856 (1968)
Patterson, T.N.L.: Algorithm 468 — Algorithm for automatic numerical integration over a finite interval. Comm. ACM16, 694–699 (1973)
Piessens, R., Branders, M.: A note on the optimal addition of abscissas to the quadrature formula of Gauss and Lobatto type. Math. Comput.28, 135–139 (1974)
Piessens, R., De Doncker, E., Uberhuber, C., Kahaner, D.K.: QUADPAC: A subroutine package for automatic integration. Springer Series of Computational Mathematics 1. Berlin Heidelberg New York: Springer 1983
Uspensky, J.V.: Theory of equations. New York: McGraw-Hill 1948
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Begumisa, A., Robinson, I. Suboptimal Kronrod extension formulae for numerical quadrature. Numer. Math. 58, 807–818 (1990). https://doi.org/10.1007/BF01385655
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01385655