A fast conformal mapping algorithm with no FFT (Q1201045)

The algorithm presented in this paper was made possible by the construction of a calculation method for convolution integrals which, despite not using a fast Fourier transform (FFT), maintains a computation time of the same order as that of the FFT. The new technique is successfully applied to the problem of conformally mapping a closely spaced cascade of airfoils onto a circle, which requires an exceedingly large number of points if it is solved with uniform spacing. The paper consists, among other things, of the following parts: calculation of a convolution integral over a non-uniformly spaced point set; the convolution-integral algorithm; conformal mapping and test results; conclusions and appendices.