Recent content by cris

The 2^n restriction is for a specific algorithm. The fftw and the accelerated libraries like cufft they different algorithms now which allow a wide combination of prime integers. In general I try use only numbers which combinations of powers of only 2,3 and 5.

Thanks for your reply. The generalized Simpson rule gives great improvement over the trapezoidal. Though it appears I need something more ...

Hello, I have to compute the numerical integral of a function which is expressed at unequal (but almost) intervals. I tried the trapezoidal method, but the error is too large for my application. Is it possible to generalize the Boole's rule to or something on the same order of precision?