Direct fast Fourier transform of bivariate functions

A mathematical development is presented for a direct computation of a two-dimensional fast Fourier transform (FFT). A generalized mathematical theory of holor algebra is used to manipulate coefficient arrays needed to generate computational equations. The result is a set of equations which involve elements from throughout the two-dimensional array rather than operating on individual rows and columns. Preliminary digital computer calculations verify the accuracy of the technique and demonstrate a modest saving of computation time as well.