Fast Clenshaw-Curtis Quadrature
Computes Clenshaw Curtis weights and nodes using the FFT.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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 (2026). Fast Clenshaw-Curtis Quadrature (https://uk.mathworks.com/matlabcentral/fileexchange/6911-fast-clenshaw-curtis-quadrature), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (1.44 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
