A three-level BDDC algorithm for a saddle point problem (Q639365)

Balancing domain decomposition by constraints (BDDC), originally developed for standard finite difference discretization of elliptic problems, are extended to saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. The presented analysis is focused on the former problems, but numerical results are presented for both. The proposed three-level BDDC algorithm maintains all iterates in a benign space and thus the conjugated gradient method can be applied for accelerating the convergence. After a review of the mixed finite element discretizations and two-level BDDC the three-level version is introduced together with the corresponding preconditioner. The condition number of the preconditioned system is estimated depending on the diameters of the subregions, subdomains and elements. Finally computational results are shown to be consistent with the theoretical estimates.