Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms

Authors

Susanne C. Brenner, University of South Carolina
Qingmi He, University of South Carolina

Document Type

Article

Publication Date

1-1-2003

Abstract

Lower bounds for the condition numbers of the preconditioned systems are obtained for the wire basket preconditioner and the Neumann-Neumann preconditioner in three dimensions. They show that the known upper bounds are sharp.

Publication Source (Journal or Book title)

Numerische Mathematik

First Page

445

Last Page

470

Recommended Citation

Brenner, S., & He, Q. (2003). Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms. Numerische Mathematik, 93 (3), 445-470. https://doi.org/10.1007/s002110100376