Fast Clenshaw-Curtis Quadrature
Versione 1.0.0.0 (1,44 KB) da
Greg von Winckel
Computes Clenshaw Curtis weights and nodes using the FFT.
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 (https://www.mathworks.com/matlabcentral/fileexchange/6911-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 LinuxCategorie
Scopri di più su Fourier Analysis and Filtering in Help Center e MATLAB Answers
Tag
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Scopri Live Editor
Crea script con codice, output e testo formattato in un unico documento eseguibile.
Versione | Pubblicato | Note della release | |
---|---|---|---|
1.0.0.0 |