TY - JOUR
T1 - An overlapping domain decomposition preconditioner for a class of discontinuous Galerkin approximations of advection-diffusion problems
AU - Lasser, Caroline
AU - Toselli, Andrea
PY - 2003/7
Y1 - 2003/7
N2 - We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.
AB - We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.
KW - Advection-diffusion problem
KW - Discontinuous Galerkin approximation
KW - Domain decomposition
KW - Preconditioning
UR - http://www.scopus.com/inward/record.url?scp=0038129714&partnerID=8YFLogxK
U2 - 10.1090/S0025-5718-03-01484-4
DO - 10.1090/S0025-5718-03-01484-4
M3 - Article
AN - SCOPUS:0038129714
SN - 0025-5718
VL - 72
SP - 1215
EP - 1238
JO - Mathematics of Computation
JF - Mathematics of Computation
IS - 243
ER -