.png){kind=icon}
.png){kind=icon}
Return
A preconditioner for the Schur complement matrix
.png){kind=icon}
OA
AI
DOI：10.1016/j.advengsoft.2006.02.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner is based on solving a global 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 aim of this work is to present a theoretical basis (regarding the behavior of Schur complement matrix spectra) and some simple numerical experiments conducted in a sequential environment as a motivation for adopting the proposed preconditioner. Efficiency, scalability, and implementation details on a production parallel finite element code [Sonzogni V, Yommi A, Nigro N, Storti M. A parallel finite element program on a Beowulf cluster. Adv Eng Software 2002;33(7-10):427-43; Storti M, Nigro N, Paz R, Dalcin L. PETSc-FEM: a general purpose, parallel, multi-physics FEM program, 1999-2006] can be found in works [Paz R, Storti M. An interface strip preconditioner for domain decomposition methods: application to hydrology. Int J Numer Methods Eng 2005;62(13):1873-94; Paz R, Nigro N, Storti M. On the efficiency and quality of numerical solutions in cfd problems using the interface strip preconditioner for domain decomposition methods. Int J Numer Methods Fluids, in press]. (C) 2006 Elsevier Ltd. All rights reserved.
Keywords:
domain decomposition methods
Schur complement preconditioning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W
Organization
No organization information available