Numerical Analysis, Eighth Edition

by Richard L. Burden and J. Douglas Faires

Java Programs

Back to Home

Fast Fourier Transform

To compute the Coefficients in the discrete approximation for the data (x(J), y(J)), 0<= J <= 2m-1 where m=2**p and x(J)=-pi+J*pi/m for 0<= J <= 2m-1 .