Abstract
We prove the convergence of an overlapping domain decomposition method for the polar factorization of vector-valued mappings. We introduce a consistent discretization of this problem under the form of an assignment problem. The domain decomposition method applied to the discrete problem does not necessarily produce the wanted discrete solution. However, we prove that the sequence of outputs it produces when we refine the discretization tends to the solution of the continuous problem.
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.
