On a Sharp Estimate of Overlapping Schwarz Methods in H(curl;) and H(div;)
Abstract
The previous proved-bound is C(1+H2δ2) for the condition number of the overlapping domain decomposition H(curl;) and H(div;) methods, where H and δ are the sizes of subdomains and overlaps respectively. But all numerical results indicate that the best bound is C(1+Hδ). In this work, we solve this long-standing open problem by proving that C(1+Hδ) is indeed the best bound.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.