A fast parallel algorithm for the Poisson equation on a disk (Q5935510)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1610380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast parallel algorithm for the Poisson equation on a disk |
scientific article; zbMATH DE number 1610380 |
Statements
A fast parallel algorithm for the Poisson equation on a disk (English)
0 references
26 June 2001
0 references
Dirichlet or Neumann boundary conditions
0 references
parallel algorithm
0 references
Poisson equation
0 references
fast Fourier transforms
0 references
numerical results
0 references
performance
0 references
0 references
0 references
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.NEWLINENEWLINENEWLINETheoretical 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.
0 references
0.8457969427108765
0 references
0.8097266554832458
0 references
0.8061066269874573
0 references
