Year-end Sale % OFF 
Abstract
The scalar Poisson equation is considered in a domain having a cut with unilateral constraints specified on its edges. An iterative method is proposed for solving the problem. The method is based on domain decomposition and the Uzawa algorithm for finding a saddle point of the Lagrangian. According to the method, the original domain is divided into two subdomains and a linear problem for Poisson’s equation is solved in each of them at every iteration step. The solution in one domain is related to that in the other by two Lagrange multipliers: one is used to match the solutions, and the other, to satisfy the unilateral constraint. Examples of the numerical solution of the problem are given.
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 callMore From: Computational Mathematics and Mathematical Physics
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.
