Abstract
In this paper we consider a nonsymmetric elliptic problem and we use the techniques related to the Steklov–Poincaré operators to propose new substructuring iterative procedures. In particular, we propose two methods that generalize the well-known Neumann–Neumann and Dirichlet–Neumann iterative procedures. We prove that our methods, that use symmetric and positive-definite preconditioners, lead to the construction of iterative schemes with optimal convergence properties. Numerical results for the finite element discretization 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 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.
