On the convergence of an optimal Additive Schwarz method for parallel adaptive finite elements

Sébastien Loisel, Hieu Nguyen

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
93 Downloads (Pure)


In this paper, we formulate and analyze a one-level Additive Schwarz preconditioner with full-domain overlap for a class of parallel adaptive finite elements, including the Bank–Holst paradigm and the local and parallel algorithms based on two-grid discretizations. We show that the generous overlap is more than enough to compensate for the single-level nature of the preconditioner, and the effective condition number of the associated preconditioned operator can be bounded from above independently of the number of the subdomains, the fine and coarse mesh sizes. The main results of this paper substantially extend those in Loisel and Nguyen (2017), in the sense that we are able to remove from the bound of the effective condition number the explicit term, 1∕(1−γ 2 ), where γ is the maximum of the constants in the strengthened Cauchy–Buniakowskii–Schwarz inequalities applied to the hierarchical decompositions of full-domain local adaptive finite element spaces into the coarse space and fine spaces. In other words, our new results confirm that the proposed preconditioner is even more robust as the constant γ can be close to 1 for adaptive meshes with bad shape regularity. Numerical results are provided to confirm our theoretical finding.

Original languageEnglish
Pages (from-to)193-200
Number of pages8
JournalJournal of Computational and Applied Mathematics
Early online date7 Feb 2019
Publication statusPublished - 1 Aug 2019


  • Bank–Holst paradigm
  • Domain decomposition
  • Parallel adaptivity
  • Preconditioner
  • Two-grid discretizations

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'On the convergence of an optimal Additive Schwarz method for parallel adaptive finite elements'. Together they form a unique fingerprint.

Cite this