Please use this identifier to cite or link to this item:

Efficient parallel algorithms for parabolic problems

Authors Du, Q. HKUST affiliated (currently or previously)
Mu, M. View this author's profile
Wu, ZN
Issue Date 2002
Source SIAM journal on numerical analysis , v. 39, (5), 2002, JAN 14, p. 1469-1487
Summary Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied for steady state or slow unsteady computation. Implicit schemes are used in order to march with large time steps. Parallelization is realized by approximating interface values using explicit computation. Various techniques are examined, including a multistep second order explicit scheme and a one-step high-order scheme. We show that the resulting schemes are of second order global accuracy in space, and stable in the sense of Osher or in L-infinity. They are optimized with respect to the parallel efficiency.
ISSN 0036-1429
Rights Copyright © SIAM. This paper is made available with permission of the Society for Industrial and Applied Mathematics for limited noncommerical distribution only.
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
38171.pdf 193885 B Adobe PDF