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 pre...
| Authors: | , , , , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2006 |
| Country: | Argentina |
| Institution: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repository: | CONICET Digital (CONICET) |
| Language: | English |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/26358 |
| Online Access: | http://hdl.handle.net/11336/26358 |
| Access Level: | Open access |
| Keyword: | Domain Decomposition Methods Finite Element Method Parallel Computing |
| Summary: | 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. The performance of this preconditioner is assessed with an analytical study of Schur complement matrix eigenvalues. Results in a production parallel finite element code are given in a companion paper [1]. |
|---|