Efficient Parallel Algorithms for Parabolic Problems

Authors:
Q. Du;M. Mu;Z. N. Wu
Affiliations:
-;-;-
Venue:
SIAM Journal on Numerical Analysis
Year:
2001

Citing 0
Cited 9

Efficient parallel method for implicit upwind schemes approximating the Euler equations in gas dynamics

Journal of Computational Physics
Explicit/implicit domain decomposition method with modified upwind differences for convection-diffusion equations

Computers & Mathematics with Applications
New techniques for designing a finite difference domain decomposition algorithm for the two-and three-dimensional heat equations

International Journal of Computer Mathematics
Domain decomposition with characteristic finite difference method for two-phase displacement problems

Applied Numerical Mathematics
A modified upwind difference domain decomposition method for convection--diffusion equations

Applied Numerical Mathematics
Parallel domain decomposition procedures of improved D-D type for parabolic problems

Journal of Computational and Applied Mathematics
An efficient S-DDM iterative approach for compressible contamination fluid flows in porous media

Journal of Computational Physics
An efficient splitting domain decomposition approach for parabolic-type time-dependent problems in porous media

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
The fractional steps domain decomposition method for numerical solution of a class of viscous wave equations

Computational Mathematics and Mathematical Physics

Quantified Score

Hi-index	0.01

Visualization

Abstract

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_{\infty }$. They are optimized with respect to the parallel efficiency.