Abstract
In this paper, the efficiency of a parallelizable preconditioner for domain decomposition methods in the context of the solution of non-symmetric linear equations arising from discretization of the Saint-Venant equations, is investigated. The proposed interface strip preconditioner (IS) is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann–Neumann preconditioner, and handles correctly the flux splitting among sub-domains that share the interface. The performance of this preconditioner is assessed with an analytical study of Schur complement matrix eigenvalues and numerical experiments conducted in a parallel computational environment (consisting of a Beowulf cluster of 20 nodes). Copyright © 2005 John Wiley & Sons, Ltd.
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 callMore From: International Journal for Numerical Methods in Engineering
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.
