Non-Overlapping Domain Decomposition via BURA Preconditioning of the Schur Complement

A new class of high-performance preconditioned iterative solution methods for large-scale finite element method (FEM) elliptic systems is proposed and analyzed. The non-overlapping domain decomposition (DD) naturally introduces coupling operator at the interface <inline-formula><math xmlns=...

Full description

Bibliographic Details
Main Authors: Nikola Kosturski, Svetozar Margenov, Yavor Vutov
Format: Article
Language:English
Published: MDPI AG 2022-07-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/10/13/2327
Description
Summary:A new class of high-performance preconditioned iterative solution methods for large-scale finite element method (FEM) elliptic systems is proposed and analyzed. The non-overlapping domain decomposition (DD) naturally introduces coupling operator at the interface <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>γ</mi></semantics></math></inline-formula>. In general, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>γ</mi></semantics></math></inline-formula> is a manifold of lower dimensions. At the operator level, a key property is that the energy norm associated with the Steklov-Poincaré operator is spectrally equivalent to the Sobolev norm of index 1/2. We define the new multiplicative non-overlapping DD preconditioner by approximating the Schur complement using the best uniform rational approximation (BURA) of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msubsup><mi mathvariant="double-struck">L</mi><mi>γ</mi><mrow><mn>1</mn><mo>/</mo><mn>2</mn></mrow></msubsup></semantics></math></inline-formula>. Here, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msubsup><mi mathvariant="double-struck">L</mi><mi>γ</mi><mrow><mn>1</mn><mo>/</mo><mn>2</mn></mrow></msubsup></semantics></math></inline-formula> denotes the discrete Laplacian over the interface <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>γ</mi></semantics></math></inline-formula>. The goal of the paper is to develop a unified framework for analysis of the new class of preconditioned iterative methods. As a final result, we prove that the BURA-based non-overlapping DD preconditioner has optimal computational complexity <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></semantics></math></inline-formula>, where <i>n</i> is the number of unknowns (degrees of freedom) of the FEM linear system. All theoretical estimates are robust, with respect to the geometry of the interface <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>γ</mi></semantics></math></inline-formula>. Results of systematic numerical experiments are given at the end to illustrate the convergence properties of the new method, as well as the choice of the involved parameters.
ISSN:2227-7390