Abstract
Efficient preconditioners can be defined from domain decompositions with overlapping when solving linear systems arising from a PDE discretization. Partitioning of the domain entails a corresponding block partitioning of the matrix. It is known that Schwarz's methods (additive and multiplicative) correspond to given splittings of the matrix. An explicit formulation of the splitting was only known for the additive situation. An explicit splitting associated with the multiplicative Schwarz iteration is provided. The advantage of considering the explicit formulation, when the iteration is used as a preconditioner for a Krylov method, is shown.
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.
