Abstract

We consider a non-overlapping domain decomposition approach to approximate the solution of elliptic boundary value problems with high contrast in their coefficients. We propose a method such that initially local solutions subject to Robin boundary conditions in each primal subdomain are constructed with (locally conservative) finite element or finite volume methods. Then, a novel approach is introduced to obtain a (discontinuous) global solution in terms of linear combination of the local subdomain solutions. In the proposed algorithm the computation of local solutions for unions of subdomains are localized at nearest-neighbor subdomain boundaries, thus avoiding the solution of global interface problems. We remove discontinuities in a smoothing step that is defined on a staggered grid or dual subdomains. The resulting algorithm is naturally parallelizable and can be employed as a parallel direct solver, offering great potential for the numerical solution of large problems. In fact, subdomains can be considered small enough to fit well in GPUs and the proposed procedure can handle adaptive (in space) simulations effectively. Numerical simulations are presented and discussed. We demonstrate the effectiveness of the proposed approach with two and three dimensional high contrast and channelized coefficients, that lead to challenging approximation problems. The new procedure, although designed for parallel processing, is also of value for serial calculations.

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.