Abstract
In this paper, a one-parameter generalization of Lions' nonoverlapping domain decomposition method for linear elliptic PDEs is proposed and studied. The generalized methods are shown to be descent-direction methods for minimizing an interface bias functional. Iteration convergence of both the continuous and finite element versions of the proposed methods is established. It is theoretically and numerically demonstrated that for generic choices of the parameter the generalized methods converge faster than Lions' original method. Algorithms are given and numerical results are presented.
Sign-in/Register to access full text options 
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.
