Algorithm 424: Clenshaw-Curtis quadrature [D1]
Author:
Open Access
- 1 May 1972
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (5) , 353-355
Abstract
Clenshaw-Curtis quadrature is one of the most effective automatic quadrature schemes available, particularly for integrands with some continuous derivatives. It can also be used for any piecewise continuous integrand, although it is not recommended for integrands with discontinuities.Keywords
This publication has 3 references indexed in Scilit:
- Implementing Clenshaw-Curtis quadrature, I methodology and experienceCommunications of the ACM, 1972
- Implementing Clenshaw-Curtis quadrature, II computing the cosine transformationCommunications of the ACM, 1972
- Algorithm 279: Chebyshev quadratureCommunications of the ACM, 1966