Uniform convergence of the Schwarz alternating method for solving singularly perturbed advection-diffusion equations

被引:33
作者
Mathew, TP [1 ]
机构
[1] Univ Wyoming, Dept Math, Laramie, WY 82071 USA
关键词
domain decomposition; Schwarz alternating method; singularly perturbed elliptic equations; advection-diffusion equation; maximum principle; barrier functions;
D O I
10.1137/S0036142995296485
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Our purpose in this paper is to study the convergence rate of some variants of the Schwarz alternating method for solving two types of singularly perturbed advection-diffusion equations, one in which the advection term (first-order term) dominates, and the other in which the lowest-order term (zeroth-order term) dominates. For such problems, boundary or other layer regions may be present. For singular perturbation problems in which the advection dominates, we choose two overlapping subregions, one corresponding to an outer or elliptic region and the other corresponding to an inner or hyperbolic region. Our main result for this problem shows that if the subdomains can be chosen to "follow the flow," i.e., if the boundary interface of one of the subdomains corresponds to an outflow boundary for the streamlines of the flow, then the Schwarz iterates converge in the maximum norm with an error reduction factor per iteration that exponentially decays with increasing overlap or decreasing diffusion. For the singular perturbation problem in which the lowest-order term dominates, we consider many overlapping subregions, with no special requirement on outflow or inflow boundaries. Our main result here, which is valid for two variants of the classical Schwarz algorithm, shows that the error reduction factor per iteration decays exponentially in the maximum norm with increasing overlap and increasing dominance of the zeroth-order term. For both problems, our proofs rely on the maximum principle and the construction of barrier functions.
引用
收藏
页码:1663 / 1683
页数:21
相关论文
共 39 条
[1]  
ASHBY SF, 1994, CONT MATH, V180, P139
[2]   Adaptive refinement for convection-diffusion problems based on a defect-correction technique and finite difference method [J].
Axelsson, O ;
Nikolova, M .
COMPUTING, 1997, 58 (01) :1-30
[3]  
BABUSKA I, 1958, CZECH MATH J, V83, P328
[4]   A DOMAIN SPLITTING ALGORITHM FOR PARABOLIC PROBLEMS [J].
BLUM, H ;
LISKY, S ;
RANNACHER, R .
COMPUTING, 1992, 49 (01) :11-23
[5]  
BRAMBLE JH, 1991, MATH COMPUT, V57, P1, DOI 10.1090/S0025-5718-1991-1090464-8
[6]   MULTIPLICATIVE SCHWARZ ALGORITHMS FOR SOME NONSYMMETRIC AND INDEFINITE PROBLEMS [J].
CAI, XC ;
WIDLUND, OB .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1993, 30 (04) :936-952
[7]  
CAI XC, 1993, SIAM J NUMER ANAL, V30, pR30
[8]   GEOMETRY RELATED CONVERGENCE RESULTS FOR DOMAIN DECOMPOSITION ALGORITHMS [J].
CHAN, TF ;
HOU, TY ;
LIONS, PL .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1991, 28 (02) :378-391
[9]  
CHAN TF, 1993, CONT MATH, V157
[10]  
CHEN H, 1996, E W J NUMER MATH, V4, P121