𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fast Parallel Algorithm for the Poisson Equation on a Disk

✍ Scribed by Leonardo Borges; Prabir Daripa


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
411 KB
Volume
169
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis


A parallel algorithm for solving the Poisson equation with either Dirichlet or Neumann conditions is presented. The solver follows some of the principles introduced in a previous fast algorithm for evaluating singular integral transforms by Daripa et al. Here we present recursive relations in Fourier space together with fast Fourier transforms which lead to a fast and accurate algorithm for solving Poisson problems within a unit disk. The algorithm is highly parallelizable and our implementation is virtually architecture-independent. Theoretical estimates show good parallel scalability of the algorithm, and numerical results show the accuracy of the method for problems with sharp variations on inhomogeneous term. Finally, performance results for sequential and parallel implementations are presented.


πŸ“œ SIMILAR VOLUMES


A fast, one-equation integration algorit
✍ de Souza Neto, E. A. πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 178 KB

## Abstract This paper introduces an elastic predictor/return mapping integration algorithm for a simplified version of the Lemaitre ductile damage model, whose return mapping stage requires the solution of only one scalar non‐linear equation. The simplified damage model differs from its original c

A High-Order Fast Direct Solver for Sing
✍ Yu Zhuang; Xian-He Sun πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 88 KB

We present a fourth order numerical solution method for the singular Neumann boundary problem of Poisson equations. Such problems arise in the solution process of incompressible Navier-Stokes equations and in the time-harmonic wave propagation in the frequence space with the zero wavenumber. The equ

A fast algorithm for parallel model comb
✍ Tai-Hwei Hwang; Hsiao-Chuan Wang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 223 KB

Based on the log-normal assumption, parallel model combination (PMC) provides an effective method to adapt the cepstral means and variances of speech models for noisy speech recognition. In addition, the log-add method has been derived to adapt the mean by ignoring the cepstral variance during the p

A Parallel Adaptive Coupling Algorithm f
✍ M. Garbey; D. Tromeur-Dervout πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 224 KB

In this paper we address the challenge of metacomputing with two distant parallel computers linked by a slow network and running the numerical approximation of two sets of coupled PDEs. Several software tools are available for coupling codes, and large-scale computing on a network of parallel comput