Chebyshev type quadrature formulas
HTML articles powered by AMS MathViewer
- by David K. Kahaner PDF
- Math. Comp. 24 (1970), 571-574 Request permission
Abstract:
Quadrature formulas of the form \[ \int _{ - 1}^1 {f(x)dx \approx \frac {2} {n}\sum \limits _{i = 1}^n {f({x_i}^{(n)})} } \] are associated with the name of Chebyshev. Various constraints may be posed on the formula to determine the nodes ${x_i}^{(n)}$. Classically the formula is required to integrate $n$th degree polynomials exactly. For $n = 8$ and $n \geqq 10$ this leads to some complex nodes. In this note we point out a simple way of determining the nodes so that the formula is exact for polynomials of degree less than $n$. For $n = 8$, $10$ and $11$ we compare our results with others obtained by minimizing the ${l^2}$-norm of the deviations of the first $n + 1$ monomials from their moments and point out an error in one of these latter calculations.References
- R. E. Barnhill, J. E. Dennis Jr., and G. M. Nielson, A new type of Chebyshev quadrature, Math. Comp. 23 (1969), 437–441. MR 242367, DOI 10.1090/S0025-5718-1969-0242367-4
- A. Meir and A. Sharma, A variation of the Tchebicheff quadrature problem, Illinois J. Math. 11 (1967), 535–546. MR 216223
- David K. Kahaner, On equal and almost equal weight quadrature formulas, SIAM J. Numer. Anal. 6 (1969), 551–556. MR 286279, DOI 10.1137/0706049
- F. B. Hildebrand, Introduction to numerical analysis, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1956. MR 0075670
Additional Information
- © Copyright 1970 American Mathematical Society
- Journal: Math. Comp. 24 (1970), 571-574
- MSC: Primary 65.55
- DOI: https://doi.org/10.1090/S0025-5718-1970-0273818-5
- MathSciNet review: 0273818