A fast algorithm for numerical calculation of arbitrary real order of
fractional Fourier transforms is presented. Its computation complexity
is comparable to that of fast convolution Fourier transform. Furtherm
ore, it allows one to freely choose the sampling resolutions in both x
- and u-space under the restriction of the Nyquist sampling theorem.