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

Abstract 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.

[1]  Olof B. Widlund,et al.  Domain Decomposition Algorithms with Small Overlap , 1992, SIAM J. Sci. Comput..

[2]  Martin J. Gander,et al.  Schwarz Methods over the Course of Time , 2008 .

[3]  Sébastien Loisel,et al.  An optimal Schwarz preconditioner for a class of parallel adaptive finite elements , 2017, J. Comput. Appl. Math..

[4]  Feng Shi,et al.  Local and Parallel Finite Element Algorithms Based on the Partition of Unity for the Stokes Problem , 2014, SIAM J. Sci. Comput..

[5]  Victor Eijkhout,et al.  The Role of the Strengthened Cauchy-Buniakowskii-Schwarz Inequality in Multilevel Methods , 1991, SIAM Rev..

[6]  Jinchao Xu,et al.  Local and parallel finite element algorithms based on two-grid discretizations , 2000, Math. Comput..

[7]  Randolph E. Bank,et al.  Mesh Regularization in Bank-Holst Parallel hp-Adaptive Meshing , 2013, Domain Decomposition Methods in Science and Engineering XX.

[8]  Haibiao Zheng,et al.  Local and Parallel Finite Element Algorithm Based on the Partition of Unity for Incompressible Flows , 2014, Journal of Scientific Computing.

[9]  Jinchao Xu,et al.  Local and Parallel Finite Element Algorithms Based on Two-Grid Discretizations for Nonlinear Problems , 2001, Adv. Comput. Math..

[10]  Yueqiang Shang,et al.  A parallel finite element variational multiscale method based on fully overlapping domain decomposition for incompressible flows , 2015 .

[11]  Michael J. Holst,et al.  A New Paradigm for Parallel Adaptive Meshing Algorithms , 2000, SIAM J. Sci. Comput..

[12]  Randolph E. Bank,et al.  Domain Decomposition and hp-Adaptive Finite Elements , 2011 .

[13]  Michael J. Holst,et al.  The adaptive multilevel finite element solution of the Poisson-Boltzmann equation on massively parallel computers , 2001, IBM J. Res. Dev..

[14]  Randolph E. Bank,et al.  A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations , 2001, Concurr. Comput. Pract. Exp..

[15]  Randolph E. Bank,et al.  Hierarchical bases and the finite element method , 1996, Acta Numerica.

[17]  Yueqiang Shang A parallel two-level finite element variational multiscale method for the Navier–Stokes equations ☆ , 2013 .

[18]  Yinnian He,et al.  Parallel finite element algorithm based on full domain partition for stationary Stokes equations , 2010 .