A fast parallel algorithm for the Poisson equation on a disk (Q5935510): Difference between revisions

A parallel algorithm for solving the Poisson equation with Dirichlet or Neumann boundary conditions is considered. The solver follows some of the principles introduced in a previous fast algorithm for evaluating singular integral transform by \textit{P. Daripa} and \textit{D. Mashat} [Numer. Algorithms 18, No. 2, 133-157 (1998; Zbl 0916.65127)]. In this paper, recursive relations in Fourier space together with fast Fourier transforms are presented which lead to a fast and accurate algorithm for solving Poisson problems within a unit disk. Theoretical estimates show good parallel scalability of the algorithm and numerical results show the accuracy of the method for problems with sharp variations of inhomogeneous term. Finally, performance results for sequential and parallel implementations are presented.