Abstract

The optimized Schwarz method and the closely related 2-Lagrange multiplier method are domain decomposition methods which can be used to parallelize the solution of partial differential equations. Although these methods are known to work well in special cases (e.g., when the domain is a square and the two subdomains are rectangles), the problem has never been systematically stated nor analyzed for general domains with general subdomains. The problem of cross points (when three or more subdomains meet at a single vertex) has been particularly vexing. We introduce a 2-Lagrange multiplier method for domain decompositions with cross points. We estimate the condition number of the iteration and provide an optimized Robin parameter for general domains. We hope that this new systematic theory will allow broader utilization of optimized Schwarz and 2-Lagrange multiplier preconditioners.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call