Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Chebyshev type quadrature formulas
HTML articles powered by AMS MathViewer

by David K. Kahaner PDF
Math. Comp. 24 (1970), 571-574 Request permission


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.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.55
  • Retrieve articles in all journals with MSC: 65.55
Additional Information
  • © Copyright 1970 American Mathematical Society
  • Journal: Math. Comp. 24 (1970), 571-574
  • MSC: Primary 65.55
  • DOI:
  • MathSciNet review: 0273818