Efficient parallel algorithm for the two-dimensional diffusion equation subject to specification of mass

Abba Gumel, W. T. Ang, E. H. Twizell

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

An efficient L0-stable parallel algorithm is developed for the two-dimensional diffusion equation with non-local time-dependent boundary conditions. The algorithm is based on subdiagonal Fade.́ approximation to the matrix exponentials arising from the use of the method of lines and may be implemented on a parallel architecture using two processors running concurrently with each processor employing the use of tridiagonal solvers at every time-step. The algorithm is tested on two model problems from the literature for which discontinuities between initial and boundary conditions exist. The CPU times together with the associated error estimates are compared.

Original languageEnglish (US)
Pages (from-to)153-163
Number of pages11
JournalInternational Journal of Computer Mathematics
Volume64
Issue number1-2
StatePublished - 1997
Externally publishedYes

Fingerprint

Parallel algorithms
Diffusion equation
Parallel Algorithms
Efficient Algorithms
Boundary conditions
Specification
Specifications
Matrix Exponential
Method of Lines
Parallel architectures
Parallel Architectures
Tridiagonal matrix
CPU Time
Program processors
Error Estimates
Discontinuity
Initial conditions
Approximation
Model

Keywords

  • Fadé approximant
  • L-stability
  • Parallel algorithm

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Efficient parallel algorithm for the two-dimensional diffusion equation subject to specification of mass. / Gumel, Abba; Ang, W. T.; Twizell, E. H.

In: International Journal of Computer Mathematics, Vol. 64, No. 1-2, 1997, p. 153-163.

Research output: Contribution to journalArticle

@article{f57ea8b94fdc428ca2f36758324faf1d,
title = "Efficient parallel algorithm for the two-dimensional diffusion equation subject to specification of mass",
abstract = "An efficient L0-stable parallel algorithm is developed for the two-dimensional diffusion equation with non-local time-dependent boundary conditions. The algorithm is based on subdiagonal Fade.́ approximation to the matrix exponentials arising from the use of the method of lines and may be implemented on a parallel architecture using two processors running concurrently with each processor employing the use of tridiagonal solvers at every time-step. The algorithm is tested on two model problems from the literature for which discontinuities between initial and boundary conditions exist. The CPU times together with the associated error estimates are compared.",
keywords = "Fad{\'e} approximant, L-stability, Parallel algorithm",
author = "Abba Gumel and Ang, {W. T.} and Twizell, {E. H.}",
year = "1997",
language = "English (US)",
volume = "64",
pages = "153--163",
journal = "International Journal of Computer Mathematics",
issn = "0020-7160",
publisher = "Taylor and Francis Ltd.",
number = "1-2",

}

TY - JOUR

T1 - Efficient parallel algorithm for the two-dimensional diffusion equation subject to specification of mass

AU - Gumel, Abba

AU - Ang, W. T.

AU - Twizell, E. H.

PY - 1997

Y1 - 1997

N2 - An efficient L0-stable parallel algorithm is developed for the two-dimensional diffusion equation with non-local time-dependent boundary conditions. The algorithm is based on subdiagonal Fade.́ approximation to the matrix exponentials arising from the use of the method of lines and may be implemented on a parallel architecture using two processors running concurrently with each processor employing the use of tridiagonal solvers at every time-step. The algorithm is tested on two model problems from the literature for which discontinuities between initial and boundary conditions exist. The CPU times together with the associated error estimates are compared.

AB - An efficient L0-stable parallel algorithm is developed for the two-dimensional diffusion equation with non-local time-dependent boundary conditions. The algorithm is based on subdiagonal Fade.́ approximation to the matrix exponentials arising from the use of the method of lines and may be implemented on a parallel architecture using two processors running concurrently with each processor employing the use of tridiagonal solvers at every time-step. The algorithm is tested on two model problems from the literature for which discontinuities between initial and boundary conditions exist. The CPU times together with the associated error estimates are compared.

KW - Fadé approximant

KW - L-stability

KW - Parallel algorithm

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

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

M3 - Article

AN - SCOPUS:0030721325

VL - 64

SP - 153

EP - 163

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 1-2

ER -