Fast Clenshaw-Curtis Quadrature

Version 1.0.0.0 (1,44 KB) von Greg von Winckel
Computes Clenshaw Curtis weights and nodes using the FFT.
0.0
(0)
4,4K Downloads
Aktualisiert 16. Feb 2005

Lizenz anzeigen

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.

Zitieren als

Greg von Winckel (2024). Fast Clenshaw-Curtis Quadrature (https://www.mathworks.com/matlabcentral/fileexchange/6911-fast-clenshaw-curtis-quadrature), MATLAB Central File Exchange. Abgerufen .

Kompatibilität der MATLAB-Version
Erstellt mit R14
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Kategorien
Mehr zu Fourier Analysis and Filtering finden Sie in Help Center und MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Veröffentlicht Versionshinweise
1.0.0.0