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.
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
Authors who publish with this journal agree to the following terms
that this article contains no violation of any existing copyright or other third party right or any material of a libelous, confidential, or otherwise unlawful nature, and that I will indemnify and keep indemnified the Editor and THE PUBLISHER against all claims and expenses (including legal costs and expenses) arising from any breach of this warranty and the other warranties on my behalf in this agreement;
that I have obtained permission for and acknowledged the source of any illustrations, diagrams or other material included in the article of which I am not the copyright owner.
on behalf of any co-authors, I agree to this work being published in the above named journal, Open Access, and licenced under a Creative Commons Licence, 4.0 https://creativecommons.org/licenses/by/4.0/legalcode. This licence allows for the fullest distribution and re-use of the work for the benefit of scholarly information.
For authors that are not copyright owners in the work (for example government employees), please contact VILNIUS TECHto make alternative agreements.
