Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



On Chebyshev-type quadratures

Authors: Walter Gautschi and Hiroki Yanagiwara
Journal: Math. Comp. 28 (1974), 125-134
MSC: Primary 65D30
MathSciNet review: 0331731
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: According to a result of S. N. Bernstein, n-point Chebyshev quadrature formulas, with all nodes real, do not exist when $ n = 8$ or $ n \geqq 10$. Modifications of such quadrature formulas have recently been suggested by R. E. Barnhill, J. E. Dennis, Jr. and G. M. Nielson, and by D. Kahaner. We establish here certain empirical observations made by these authors, notably the presence of multiple nodes. We also show how some of the quadrature rules proposed can be constructed by solving single algebraic equations, and we compute the respective nodes to 25 decimal digits. The same formulas also arise in recent work of P. Rabinowitz and N. Richter as limiting cases of optimal Chebyshev-type quadrature rules in a Hilbert space setting.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D30

Retrieve articles in all journals with MSC: 65D30

Additional Information

Keywords: Optimal quadrature formulas of Chebyshev type
Article copyright: © Copyright 1974 American Mathematical Society

American Mathematical Society