Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms
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)
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