DeepAI AI Chat
Log In Sign Up

Analysis of the SORAS domain decomposition preconditioner for non-self-adjoint or indefinite problems

by   Marcella Bonazzoli, et al.
Sorbonne Université

We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a general linear system whose matrix is not necessarily symmetric/self-adjoint nor positive definite. By generalizing the theory for the Helmholtz equation developed in [I.G. Graham, E.A. Spence, and J. Zou, preprint arXiv:1806.03731, 2019], we identify a list of assumptions and estimates that are sufficient to obtain an upper bound on the norm of the preconditioned matrix, and a lower bound on the distance of its field of values from the origin. As an illustration of this framework, we prove new estimates for overlapping domain decomposition methods with Robin-type transmission conditions for the heterogeneous reaction-convection-diffusion equation.


page 1

page 2

page 3

page 4


Overlapping Domain Decomposition Preconditioner for Integral Equations

The discretization of certain integral equations, e.g., the first-kind F...

How does the partition of unity influence SORAS preconditioner?

We investigate numerically the influence of the choice of the partition ...

On condition numbers of symmetric and nonsymmetric domain decomposition methods

Using oblique projections and angles between subspaces we write conditio...

Overlapping Schwarz methods with GenEO coarse spaces for indefinite and non-self-adjoint problems

GenEO ('Generalised Eigenvalue problems on the Overlap') is a method for...

Domain decomposition preconditioners for high-order discretisations of the heterogeneous Helmholtz equation

We consider one-level additive Schwarz domain decomposition precondition...

Convergence of parallel overlapping domain decomposition methods for the Helmholtz equation

We analyse parallel overlapping Schwarz domain decomposition methods for...