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.

Requirements:

· MATLAB Release: R14