Algorithmadvanced
Clenshaw-Curtis quadrature
Also called Clenshaw-Curtis rule.
Interpolatory rule on Chebyshev extreme points, computable in O(n log n) with the FFT.
Interpolatory rule on Chebyshev extreme points, computable in O(n log n) with the FFT.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag AP29J0 Edit this page History Report an error