- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
An overlapping Schwarz domain decomposition is applied to a semilinear reaction-diffusion two-point boundary value problem with multiple solutions. Its diffusion parameter $\varepsilon^2$ is arbitrarily small, which induces boundary layers. The Schwarz method invokes two boundary-layer subdomains and an interior subdomain, the narrow overlapping regions being of width $O(\varepsilon| \ln \varepsilon|)$. Constructing sub- and super-solutions, we prove existence and investigate the accuracy of discrete solutions in particular subdomains. It is shown that when $\varepsilon \leq CN^{-1}$ and layer-adapted meshes of Bakhvalov and Shishkin types are used, one iteration is sufficient to get second-order convergence (with, in the case of the Shishkin mesh, a logarithmic factor) in the maximum norm uniformly in $\varepsilon$, where $N$ is the number of mesh intervals in each subdomain. Numerical results are presented to support our theoretical conclusions.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/791.html} }An overlapping Schwarz domain decomposition is applied to a semilinear reaction-diffusion two-point boundary value problem with multiple solutions. Its diffusion parameter $\varepsilon^2$ is arbitrarily small, which induces boundary layers. The Schwarz method invokes two boundary-layer subdomains and an interior subdomain, the narrow overlapping regions being of width $O(\varepsilon| \ln \varepsilon|)$. Constructing sub- and super-solutions, we prove existence and investigate the accuracy of discrete solutions in particular subdomains. It is shown that when $\varepsilon \leq CN^{-1}$ and layer-adapted meshes of Bakhvalov and Shishkin types are used, one iteration is sufficient to get second-order convergence (with, in the case of the Shishkin mesh, a logarithmic factor) in the maximum norm uniformly in $\varepsilon$, where $N$ is the number of mesh intervals in each subdomain. Numerical results are presented to support our theoretical conclusions.