Abstract

SummaryBalancing domain decomposition by constraints algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least‐squares discretization of Helmholtz equations with high and various wave numbers. The unknowns to be solved in this preconditioned system are defined on elements rather than vertices or edges, which are different from the well‐known discretizations such as the classical finite element method. Through choosing suitable “interface” and appropriate primal constraints with complex coefficients and introducing some local techniques, we developed a two‐level adaptive balancing domain decomposition by constraints algorithm for the plane wave least‐squares discretization, and the condition number of the preconditioned system is proved to be bounded above by a user‐defined tolerance and a constant that is only dependent on the maximum number of interfaces per subdomain. A multilevel algorithm is also attempted to resolve the bottleneck in large‐scale coarse problem. Numerical results are carried out to confirm the theoretical results and illustrate the efficiency of the proposed algorithms.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.