On a Sharp Estimate of Overlapping Schwarz Methods in and
arXiv:2304.10026
Abstract
The previous proved-bound is for the condition number of the overlapping domain decomposition and methods, where and are the sizes of subdomains and overlaps respectively. But all numerical results indicate that the best bound is . In this work, we solve this long-standing open problem by proving that is indeed the best bound.