Preconditioners for domain decomposition methods (Q5948889)

For solving nonsymmetric linear system, the Schur domain decomposition method proposes a dual approach of the Schur formulation. One constraint of this method is that its condition number increases with the amount of subdomains. In this paper, a family of parallel global preconditioners, which can alleviate the above constraint, are presented. These preconditioners are purely algebraic, to be used as black box preconditioners, and can be applied to most problems with a saddle-point formulation. The results are illustrated by numerical examples.