Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions
Document Type
Article
Publication Date
1-1-2000
Abstract
Lower bounds for the condition numbers of the preconditioned systems are obtained for the Bramble-Pasciak-Schatz substructuring preconditioner and the Neumann-Neumann preconditioner in two dimensions. They show that the known upper bounds are sharp.
Publication Source (Journal or Book title)
Mathematics of Computation
First Page
1319
Last Page
1339
Recommended Citation
Brenner, S., & Sung, L. (2000). Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions. Mathematics of Computation, 69 (232), 1319-1339. https://doi.org/10.1090/s0025-5718-00-01236-9
COinS