Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form

11/05/2019

∙

by   F. Nataf, et al.

∙

0

∙

share

We introduce an adaptive domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space. We assume that all sub matrices are sparse and that the diagonal blocks are the sum of positive semi definite matrices. The latter assumption enables the design of adaptive coarse space for DD methods.