Module name: fftw_aux
Author: Ian Stewart (University of Leicester, ims@star.le.ac.uk)
This module is meant to be used in conjunction with the Fast Fourier Transform package fftw which comes with the sas. The module contains a header in which some useful variables are declared, as well as the following routine:
function findNextHighest2357multiple(i) result(result)
integer, intent(in) :: i
end function findNextHighest2357multiple
This function is designed to look for the smallest integer that satisfies the following conditions: (i) it is greater than or equal to the argument i; (ii) it is a product only of the numbers 2, 3, 5 and 7. The fftw transform works most efficiently on arrays which have dimensions which are products of small primes.