A fast algorithm to solve the Poisson equation in the complex plane

الملخص EN

Fast algorithm for the accurate evaluation of some integral operator that arise in the context of solving certain partial differential equations within the unit circle in the complex plane are presented.

It is based on some recursive relations in the Fourier space and the FFT (Fast Fourier Transform), and have theoretical computational complexity of the order O(log N) per point, where N 2 is the total number of grid points.