Abstract
The method of balanced domain decomposition by constraints is an iterative algorithm for numerical solution of partial differential equations which exploits a non-overlapping partition of a domain. As an essential part of each step, restricted problems are solved on every subdomain and a certain coarse grid solution is found. In this paper we present a new strategy of preconditioning of the coarse problem. This is based on the algebraic multilevel preconditioning technique. We present numerical estimates of constants defining the condition numbers of the preconditioned coarse problems for several two- and three-dimensional elliptic equations.
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 callDisclaimer: 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.
