In this paper we consider domain decomposition preconditioners based on a vertex-oriented (VO) decomposition of the computational domain. In element-oriented (EO) decompositions, each element of the grid belongs to a different domain, while in VO decompositions each vertex belongs to a different subdomain. Based on VO decompositions, we present some preconditioners for the solution of the original system, as well as for that of the Schur complement system. Theoretical properties are investigated for a finite element approximation of an elliptic problem. Numerical results and comparison with state-of-the-art preconditioners are also reported. The numerical results presented here show the effectiveness of the proposed preconditioners and their good scalability properties.
An interface-strip domain decomposition preconditioner
QUARTERONI, ALFIO MARIA;
2006-01-01
Abstract
In this paper we consider domain decomposition preconditioners based on a vertex-oriented (VO) decomposition of the computational domain. In element-oriented (EO) decompositions, each element of the grid belongs to a different domain, while in VO decompositions each vertex belongs to a different subdomain. Based on VO decompositions, we present some preconditioners for the solution of the original system, as well as for that of the Schur complement system. Theoretical properties are investigated for a finite element approximation of an elliptic problem. Numerical results and comparison with state-of-the-art preconditioners are also reported. The numerical results presented here show the effectiveness of the proposed preconditioners and their good scalability properties.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.