Skip to main content

A method for numerical integration on an automatic computer


A new method for the numerical integration of a “well-behaved” function over a finite range of argument is described. It consists essentially of expanding the integrand in a series of Chebyshev polynomials, and integrating this series term by term. Illustrative examples are given, and the method is compared with the most commonly-used alternatives, namelySimpson's rule and the method ofGauss.

This is a preview of subscription content, access via your institution.


  1. [1]

    Hildebrand, F. B.: Introduction to numerical analysis. New York: McGraw-Hill 1956.

    Google Scholar 

  2. [2]

    Kopal, Z.: Numerical analysis. London: Chapman & Hall 1955.

    Google Scholar 

  3. [3]

    Goodwin, E. T.: Evaluation of integrals of the form\(\int\limits_{ - \infty }^{ + \infty } {f\left( \chi \right)e^{ - \chi ^2 } } d\chi \). Proc. Cambridge Phil. Soc.45, 241–245 (1949).

    Google Scholar 

  4. [4]

    Longman, I. M.: Note on a method for computing infinite integrals of oscillatory functions. Proc. Cambridge Phil. Soc.52, 764–768 (1956).

    Google Scholar 

  5. [5]

    National Bureau of Standards Appl. Math. Series No. 9. Tables of Chebyshev Polynomials. Washington: Government Printing Office 1952.

  6. [6]

    Clenshaw, C. W.: The numerical solution of linear differential equations in Chebyshev series. Proc. Cambridge Phil. Soc.53, 134–149 (1957).

    Google Scholar 

  7. [7]

    Clenshaw, C. W.: A note on the summation of Chebyshev series. Math. Tab., Wash.9, 118 (1955).

    Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Clenshaw, C.W., Curtis, A.R. A method for numerical integration on an automatic computer. Numer. Math. 2, 197–205 (1960).

Download citation


  • Mathematical Method
  • Chebyshev Polynomial
  • Automatic Computer
  • Finite Range
  • Series Term