Non-Iterative Parallel Schwarz Domain Decomposition Algorithms for a Two-Domain Parabolic Problem

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.

Publication Details

Journal
Communications in Computational Physics
Published
2025-09-18
DOI
https://doi.org/10.4208/cicp.oa-2024-0085
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Non-Iterative Parallel Schwarz Domain Decomposition Algorithms for a Two-Domain Parabolic Problem

Communications in Computational Physics
Geochemistry and Geologic Mapping
article

Non-Iterative Parallel Schwarz Domain Decomposition Algorithms for a Two-Domain Parabolic Problem

article en

Abstract

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.

Communications in Computational PhysicsVol. 38(5)
Openalex Percentile: Top 26%
Geochemistry and Geologic Mapping
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.