Lower Bounds for Two-Level Additive Schwarz Preconditioners with Small Overlap
Author:
- Susanne C. BrennerSBSusanne C. Brenner
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 21 (5) , 1657-1669
Abstract
Lower bounds for the condition numbers of the preconditioned systems are obtained for two-level additive Schwarz preconditioners. They show that the known upper bounds for both second order and fourth order problems are sharp in the case of a small overlap.Keywords
This publication has 18 references indexed in Scilit:
- The condition number of the Schur complement in domain decompositionNumerische Mathematik, 1999
- Balancing domain decomposition for nonconforming plate elementsNumerische Mathematik, 1999
- A Neumann--Neumann Domain Decomposition Algorithm for Solving Plate and Shell ProblemsSIAM Journal on Numerical Analysis, 1998
- A two-level additive Schwarz preconditioner for nonconforming plate elementsNumerische Mathematik, 1996
- On the abstract theory of additive and multiplicative Schwarz algorithmsNumerische Mathematik, 1995
- Domain Decomposition Algorithms with Small OverlapSIAM Journal on Scientific Computing, 1994
- The Mathematical Theory of Finite Element Methods1994
- On the spectra of sums of orthogonal projections with applications to parallel computingBIT Numerical Mathematics, 1991
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into SubstructuresSIAM Journal on Numerical Analysis, 1986
- The construction of preconditioners for elliptic problems by substructuring. IMathematics of Computation, 1986