Fast Clenshaw-Curtis Quadrature

Computes Clenshaw Curtis weights and nodes using the FFT.
4,4K download
Aggiornato 16 feb 2005

Visualizza la licenza

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.

Cita come

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

Compatibilità della release di MATLAB
Creato con R14
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Scopri di più su Fourier Analysis and Filtering in Help Center e MATLAB Answers

Community Treasure Hunt

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

Start Hunting!
Versione Pubblicato Note della release