ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
A three-level BDDC algorithm for mortar discretizations
dc.contributor.author | Kim, Hyea Hyun | |
dc.contributor.author | Tu, Xuemin | |
dc.date.accessioned | 2015-03-30T20:37:33Z | |
dc.date.available | 2015-03-30T20:37:33Z | |
dc.date.issued | 2009-03-05 | |
dc.identifier.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 | en_US |
dc.identifier.uri | http://hdl.handle.net/1808/17241 | |
dc.description | This is the published version, also available here: http://dx.doi.org/10.1137/07069081X. | en_US |
dc.description.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. | en_US |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.subject | mortar discretization | en_US |
dc.subject | balancing domain decomposition by constraints | en_US |
dc.subject | three-level | en_US |
dc.subject | domain decomposition | en_US |
dc.subject | coarse problem | en_US |
dc.subject | condition number | en_US |
dc.title | A three-level BDDC algorithm for mortar discretizations | en_US |
dc.type | Article | |
kusw.kuauthor | Tu, Xuemin | |
kusw.kudepartment | Mathematics | en_US |
dc.identifier.doi | 10.1137/07069081X | |
kusw.oaversion | Scholarly/refereed, publisher version | |
kusw.oapolicy | This item meets KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess |