FASTF: Fast Fourier transform with arbitrary factors

Title of program: FASTF Catalogue Id: ACUH_v1_0 Nature of problem FASTF performs a discrete Fourier transform (direct/inverse) of a complex vector of length N. N should be factorisable as N = r1.r2...rp (ri integers). Versions of this program held in the CPC repository in Mendeley Data ACUH_v1_0; FASTF; 10.1016/0010-4655(83)90080-2 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)