A Three-Level BDDC Algorithm for Mortar Discretizations

Hyea Hyun Kim, Xuemin Tu
2009 SIAM Journal on Numerical Analysis  
In this paper, a three-level BDDC algorithm is developed for the solutions of large sparse algebraic linear systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In two-level BDDC algorithms, the coarse problem needs to be solved exactly. However, its size will increase with the increase of the number of the subdomains. To overcome this limitation, the three-level
more » ... solves the coarse problem inexactly while a good rate of convergence is maintained. This is an extension of previous work, the three-level BDDC algorithms for standard finite element discretization. Estimates of the condition numbers are provided for the three-level BDDC method and numerical experiments are also discussed.
doi:10.1137/07069081x fatcat:jsksfa6wxrgnnnwvy3unwhvfzi