Fast Clenshaw-Curtis Quadrature
バージョン 1.0.0.0 (1.44 KB) 作成者:
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.
引用
Greg von Winckel (2024). Fast Clenshaw-Curtis Quadrature (https://www.mathworks.com/matlabcentral/fileexchange/6911-fast-clenshaw-curtis-quadrature), MATLAB Central File Exchange. に取得済み.
MATLAB リリースの互換性
作成:
R14
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linuxカテゴリ
Help Center および MATLAB Answers で Fourier Analysis and Filtering についてさらに検索
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.0.0.0 |