A fast domain decomposition high order Poisson solver
type: Item
instance of: scholarly article
title: A fast domain decomposition high order Poisson solver
zbMATH Open document ID: 0961.65105
DOI: 10.1023/A:1023265301820
author: Bertil Gustafsson
author: Lina Hemmingsson-Frändén
published in: Journal of Scientific Computing
publication date: 2001-05-16T00:00:00Z
review text: The authors present a fast high-order Poisson solver and give a theoretical foundation for the use of higher order approximations instead of lower order ones for elliptic boundary value problems. Estimates of computational complexity and memory requirements as well as error estimates are derived for one and two dimensional model problems. The high-order accuracy is obtained by solving a sequence of systems with a narrow stencil on the left-hand side. These systems are solved by using a non-overlapping domain decomposition technique which give a possibility to use parallel computers both with shared and distributed memory in the solution. Finally, the authors present and discuss results from numerical experiments using a parallel computer with shared memory based on eight Alpha 21164 processors.
reviewed by: Krassimir Georgiev
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 65N15
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 35J25
zbMATH DE Number: 1455174
zbMATH Keywords: finite differences
zbMATH Keywords: high order approximations
zbMATH Keywords: domain decomposition
zbMATH Keywords: Poisson solver
zbMATH Keywords: parallel computing
zbMATH Keywords: elliptic boundary value problems
zbMATH Keywords: computational complexity
zbMATH Keywords: error estimates
zbMATH Keywords: numerical experiments
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1455174