Loading...
A three-level BDDC algorithm for mortar discretizations
Kim, Hyea Hyun Tu, Xuemin
Kim, Hyea Hyun
Tu, Xuemin
Citations
Altmetric:
Abstract
In this paper, a three-level balancing domain decomposition by constraints (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 nonconforming 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 algorithm 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.
Description
This is the published version, also available here: http://dx.doi.org/10.1137/07069081X.
Date
2009-03-05
Journal Title
Journal ISSN
Volume Title
Publisher
Society for Industrial and Applied Mathematics
Collections
Research Projects
Organizational Units
Journal Issue
Keywords
mortar discretization, balancing domain decomposition by constraints, three-level, domain decomposition, coarse problem, condition number
Citation
Tu, Xuemin & Kim, Hyea Hyun. "A Three-Level BDDC Algorithm for Mortar Discretizations." SIAM J. Numer. Anal., 47(2), 1576–1600. (25 pages). (2009) http://dx.doi.org/10.1137/07069081X