An Improved Convergence Bound for Aggregation-Based Domain Decomposition Preconditioners

• Authors: Marzio Sala;John N. Shadid;Ray S. Tuminaro
• Venue: SIAM Journal on Matrix Analysis and Applications
• Year: 2005

In this paper we present a two-level overlapping domain decomposition preconditioner for the finite-element discretization of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction, based on aggregation techniques, is added. Our definition of the coarse space does not require the introduction of a coarse grid. We consider a set of assumptions on the coarse basis functions to bound the condition number of the resulting preconditioned system. These assumptions involve only geometrical quantities associated with the aggregates and the subdomains. We prove that the condition number using the two-level additive Schwarz preconditioner is $\mathcal{O}(H/\delta + H_0/\delta)$, where $H$ and $H_0$ are the diameters of the subdomains and the aggregates, respectively, and $\delta$ is the overlap among the subdomains and the aggregates. This extends the bounds presented in [C. Lasser and A. Toselli, Convergence of some two-level overlapping domain decomposition preconditioners with smoothed aggregation coarse spaces, in Recent Developments in Domain Decomposition Methods, Lecture Notes in Comput. Sci. Engrg. 23, L. Pavarino and A. Toselli, eds., Springer-Verlag, Berlin, 2002, pp. 95--117; M. Sala, Domain Decomposition Preconditioners: Theoretical Properties, Application to the Compressible Euler Equations, Parallel Aspects, Ph. D. thesis, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland, 2003; M. Sala, Math. Model. Numer. Anal., 38 (2004), pp. 765--780]. Numerical experiments on a model problem are reported to illustrate the performance of the proposed preconditioner.