An Interface Strip Preconditioner for Domain Decomposition Methods
نویسنده
چکیده
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner 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 its variants, and handles correctly the flux splitting among subdomains that share the interface. Performance of this preconditioner is assessed with an analytical study of Schur complement matrix eigenvalues and several numerical experiments conducted in a sequential computational environment. Even if the crucial practical test will be the implementation in a production parallel code, the results shown here are promising.
منابع مشابه
An Interface Strip Preconditioner for Domain Decomposition Methods: Application to the Coupled Surface and Groundwater Flow
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 the discretization of the conservation laws in hydrology (e.g., the coupled surface and sub-surface flow over a freatic acuifer) is investigated. The Interface Strip Preconditioner (IS) proposed is based on solving a prob...
متن کاملA preconditioner for the Schur complement matrix
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner 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 its variants, and handles correctly the flux splitting among subdomains that shar...
متن کاملOn the e ciency and quality of numerical solutions in CFD problems using the interface strip preconditioner for domain decomposition methods
In this paper, some pathologies found for simple tests solved by means of preconditioned full iterative schemes are presented. According to these results (Sections 4 and 5), the accuracy deterioration observed should be considered as a warning for the nal application given to these solutions. Even though it is well known that full iterative solvers are not the best selection for comparison, the...
متن کاملIncorporation of Multipoint Constraints into Balancing Domain Decomposition Method
The domain decomposition method (DDM) is a major solution algorithm in order to parallelize the finite element method. In case of the implicit structural analysis using the DDM, the substructuring based iterative linear solver is a powerful tool when an effective preconditioner such as the balancing domain decomposition method (BDD) is utilized. In this study, a method to incorporate the linear...
متن کاملA Two-Grid Alternate Strip-Based Domain Decomposition Strategy in Two-Dimensions
The alternate strip-based iterative substructuring algorithms are preconditioning techniques for the discrete systems which arise from the finite element approximation of symmetric elliptic boundary value problems. The algorithms presented in this paper may be viewed as simple, direct extensions of the two disjoint subdomains case to the multiple domains decomposition with interior cross-points...
متن کامل