Parallel implementation of a monotone domain decomposition algorithm for nonlinear reaction-diffusion problems

M. P. Hardy; I. Boglaev

Parallel implementation of a monotone domain decomposition algorithm for nonlinear reaction-diffusion problems

M. P. Hardy^*, I. Boglaev

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

Recently, a monotone iterative domain decomposition algorithm has been proposed for the numerical solution of nonlinear singularly perturbed reaction-diffusion problems. This paper describes a parallel implementation of the algorithm on a distributed memory cluster. Interprocess communication is affected by means of the MPI message passing library. For various domain decompositions, we give the convergence iteration count and execution time on up to 16 processors. The parallel scale-up of the algorithm improves as the number of mesh points is increased.

Original language	English
Pages (from-to)	C290-C303
Journal	ANZIAM Journal
Volume	46
Issue number	5 ELECTRONIC SUPPL.
Publication status	Published - 2004

Cite this

@article{d8d9dd3ffdec4b0da740a196c9b9fbdb,

title = "Parallel implementation of a monotone domain decomposition algorithm for nonlinear reaction-diffusion problems",

abstract = "Recently, a monotone iterative domain decomposition algorithm has been proposed for the numerical solution of nonlinear singularly perturbed reaction-diffusion problems. This paper describes a parallel implementation of the algorithm on a distributed memory cluster. Interprocess communication is affected by means of the MPI message passing library. For various domain decompositions, we give the convergence iteration count and execution time on up to 16 processors. The parallel scale-up of the algorithm improves as the number of mesh points is increased.",

author = "Hardy, {M. P.} and I. Boglaev",

year = "2004",

language = "English",

volume = "46",

pages = "C290--C303",

journal = "ANZIAM Journal",

issn = "1446-1811",

publisher = "Cambridge University Press",

number = "5 ELECTRONIC SUPPL.",

}

TY - JOUR

T1 - Parallel implementation of a monotone domain decomposition algorithm for nonlinear reaction-diffusion problems

AU - Hardy, M. P.

AU - Boglaev, I.

PY - 2004

Y1 - 2004

N2 - Recently, a monotone iterative domain decomposition algorithm has been proposed for the numerical solution of nonlinear singularly perturbed reaction-diffusion problems. This paper describes a parallel implementation of the algorithm on a distributed memory cluster. Interprocess communication is affected by means of the MPI message passing library. For various domain decompositions, we give the convergence iteration count and execution time on up to 16 processors. The parallel scale-up of the algorithm improves as the number of mesh points is increased.

AB - Recently, a monotone iterative domain decomposition algorithm has been proposed for the numerical solution of nonlinear singularly perturbed reaction-diffusion problems. This paper describes a parallel implementation of the algorithm on a distributed memory cluster. Interprocess communication is affected by means of the MPI message passing library. For various domain decompositions, we give the convergence iteration count and execution time on up to 16 processors. The parallel scale-up of the algorithm improves as the number of mesh points is increased.

UR - http://www.scopus.com/inward/record.url?scp=70549102170&partnerID=8YFLogxK

M3 - Article

SN - 1446-1811

VL - 46

SP - C290-C303

JO - ANZIAM Journal

JF - ANZIAM Journal

IS - 5 ELECTRONIC SUPPL.

ER -

Parallel implementation of a monotone domain decomposition algorithm for nonlinear reaction-diffusion problems

Abstract

Other files and links

Fingerprint

Cite this