@Article{CiCP-35-1,
author = {Xuyang, Na and Xuejun, Xu},
title = {Domain Decomposition Methods for Diffusion Problems with Discontinuous Coefficients Revisited},
journal = {Communications in Computational Physics},
year = {2024},
volume = {35},
number = {1},
pages = {212--238},
abstract = {<p style="text-align: justify;">In this paper, we revisit some nonoverlapping domain decomposition methods for solving diffusion problems with discontinuous coefficients. We discover some
interesting phenomena, that is, the Dirichlet-Neumann algorithm and Robin-Robin algorithms may make full use of the ratio of coefficients in some special cases. Detailedly,
in the case of two subdomains, we find that their convergence rates are $\mathcal{O}(ν_1/ν_2)$ if $ν_1 &lt; ν_2,$ where $ν_1, \ ν_2$ are coefficients of two subdomains. Moreover, in the case of
many subdomains with red-black partition, the condition number bounds of Dirichlet-Neumann algorithm and Robin-Robin algorithm are $1+\epsilon(1+{\rm log}(H/h))^2$ and $C+\epsilon(1+ {\rm log}(H/h))^2,$ respectively, where $\epsilon$ equals ${\rm min}\{ν_R/ν_B,ν_B/ν_R\}$ and $ν_R,ν_B$ are the coefficients of red and black domains. By contrast, Neumann-Neumann algorithm and
Dirichlet-Dirichlet algorithm could not obtain such good convergence results in these
cases. Finally, numerical experiments are preformed to confirm our findings.</p>},
issn = {1991-7120},
doi = {https://doi.org/10.4208/cicp.OA-2023-0184},
url = {https://global-sci.com/article/90923/domain-decomposition-methods-for-diffusion-problems-with-discontinuous-coefficients-revisited}
}