DeepAI AI Chat
Log In Sign Up

On a Sharp Estimate of Overlapping Schwarz Methods in H(curl;Ω) and H(div;Ω)

by   Qigang Liang, et al.
Tongji University
University of Delaware

The previous proved-bound is C(1+H^2/δ^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.


page 1

page 2

page 3

page 4


Overlapping Domain Decomposition Preconditioner for Integral Equations

The discretization of certain integral equations, e.g., the first-kind F...

A Lower Bound on Determinantal Complexity

The determinantal complexity of a polynomial P ∈𝔽[x_1, …, x_n] over a fi...

Sharp bounds on Helmholtz impedance-to-impedance maps and application to overlapping domain decomposition

We prove sharp bounds on certain impedance-to-impedance maps (and their ...

Five Proofs of Chernoff's Bound with Applications

We discuss five ways of proving Chernoff's bound and show how they lead ...

Balancing domain decomposition by constraints associated with subobjects

A simple variant of the BDDC preconditioner in which constraints are imp...

Alternative Technique to Asymmetry Analysis-Based Overlapping for Foot Ulcer Examination: Scalable Scanning

Asymmetry analysis based on the overlapping of thermal images proved abl...

A complete characterization of the APN property of a class of quadrinomials

In this paper, by the Hasse-Weil bound, we determine the necessary and s...