A New Domain Decomposition Parallel Algorithm for Convection–Diffusion Problem

    Jiansong Zhang Info
    Danping Yang Info

Abstract

Basing on overlapping domain decomposition, we construct a new parallel algorithm combined the method of subspace correction with least-squares procedure for solving time-dependent convection–diffusion problem. This algorithm is fully parallel. We analyze the convergence of approximate solution, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration number and sub-domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to given accuracy at each time step.

Keywords:

parallel algorithm, finite element method, convection-diffusion problem, convergence analysis

How to Cite

Zhang, J., & Yang, D. (2014). A New Domain Decomposition Parallel Algorithm for Convection–Diffusion Problem. Mathematical Modelling and Analysis, 19(4), 589-605. https://doi.org/10.3846/13926292.2014.963719

Share

Published in Issue
September 10, 2014
Abstract Views
563

View article in other formats

CrossMark check

CrossMark logo

Published

2014-09-10

Issue

Section

Articles

How to Cite

Zhang, J., & Yang, D. (2014). A New Domain Decomposition Parallel Algorithm for Convection–Diffusion Problem. Mathematical Modelling and Analysis, 19(4), 589-605. https://doi.org/10.3846/13926292.2014.963719

Share