Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A three-level BDDC algorithm for Mortar discretizations

Journal Article · · SIAM Journal on Numerical Analysis
OSTI ID:946735
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 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.
Research Organization:
Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
Sponsoring Organization:
Computational Research Division
DOE Contract Number:
AC02-05CH11231
OSTI ID:
946735
Report Number(s):
LBNL-1434E
Journal Information:
SIAM Journal on Numerical Analysis, Journal Name: SIAM Journal on Numerical Analysis
Country of Publication:
United States
Language:
English

Similar Records

A Three-level BDDC algorithm for saddle point problems
Journal Article · Tue Dec 09 23:00:00 EST 2008 · Numerical Mathmatics · OSTI ID:945050

BDDC for nonsymmetric positive definite and symmetric indefinite problems
Conference · Tue Dec 09 23:00:00 EST 2008 · OSTI ID:945051

BDDC algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
Journal Article · Wed Jun 21 00:00:00 EDT 2017 · Mathematics of Computation · OSTI ID:1246885