- Journal Home
- Volume 38 - 2025
- Volume 37 - 2025
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 38 (2025), pp. 1552-1584.
Published online: 2025-09
Cited by
- BibTex
- RIS
- TXT
Based on overlapping domain decomposition, two parallel Schwarz finite element algorithms are presented for solving a two-domain parabolic problem. Our algorithms are based on two ideas. One is the observation that the influence of the non-homogeneous boundary data diminishes exponentially towards the interior of the subdomains. Another is to apply proper partitions of unity to distribute the residuals of the discretized systems reasonably into many subdomains so as to avoid repeated correction in the overlapping parts. The resulting algorithms are fully parallel in each subdomain. At each time step, only one iteration step is required to reach the optimal order of accuracy. The convergence rate depending on the mesh parameters are analyzed. Finally, numerical results are reported, which verify the theoretical analysis.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2024-0085}, url = {http://global-sci.org/intro/article_detail/cicp/24466.html} }Based on overlapping domain decomposition, two parallel Schwarz finite element algorithms are presented for solving a two-domain parabolic problem. Our algorithms are based on two ideas. One is the observation that the influence of the non-homogeneous boundary data diminishes exponentially towards the interior of the subdomains. Another is to apply proper partitions of unity to distribute the residuals of the discretized systems reasonably into many subdomains so as to avoid repeated correction in the overlapping parts. The resulting algorithms are fully parallel in each subdomain. At each time step, only one iteration step is required to reach the optimal order of accuracy. The convergence rate depending on the mesh parameters are analyzed. Finally, numerical results are reported, which verify the theoretical analysis.