Abstract
A parallel algorithm, which is derived directly from the Schwarz alternating algorithm with an overlapping domain decomposition, for solving boundary value problems of elliptic partial differential equations is analyzed. A new general analysis framework different from Lions' ones is established to describe the recursive relations of error functions between approximate solutions and the exact solution at the different iterative steps. Some abstract theories on convergence and convergent rate of the synchronously parallel algorithm are established under different conditions.
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.
