Fast Clenshaw-Curtis Quadrature

Computes Clenshaw Curtis weights and nodes using the FFT.


Updated Wed, 16 Feb 2005 09:15:23 +0000

View License

This extremely fast and efficient algorithm uses MATLAB's ifft routine to compute the Clenshaw-Curtis nodes and weights in linear time. The routine appears optimal for 2^N+1 points. Running on an average laptop, this routine computed N=2^20+1 (1048577 points) in about 4.5 seconds. Great for integrating highly oscillatory functions.

Cite As

Greg von Winckel (2023). Fast Clenshaw-Curtis Quadrature (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes