Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Balancing domain decomposition for mixed finite elements


Authors: Lawrence C. Cowsar, Jan Mandel and Mary F. Wheeler
Journal: Math. Comp. 64 (1995), 989-1015
MSC: Primary 65N55
DOI: https://doi.org/10.1090/S0025-5718-1995-1297465-9
MathSciNet review: 1297465
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The rate of convergence of the Balancing Domain Decomposition method applied to the mixed finite element discretization of second-order elliptic equations is analyzed. The Balancing Domain Decomposition method, introduced recently by Mandel, is a substructuring method that involves at each iteration the solution of a local problem with Dirichlet data, a local problem with Neumann data, and a "coarse grid" problem to propagate information globally and to insure the consistency of the Neumann problems. It is shown that the condition number grows at worst like the logarithm squared of the ratio of the subdomain size to the element size, in both two and three dimensions and for elements of arbitrary order. The bounds are uniform with respect to coefficient jumps of arbitrary size between subdomains. The key component of our analysis is the demonstration of an equivalence between the norm induced by the bilinear form on the interface and the $ {H^{1/2}}$-norm of an interpolant of the boundary data. Computational results from a message-passing parallel implementation on an INTEL-Delta machine demonstrate the scalability properties of the method and show almost optimal linear observed speed-up for up to 64 processors.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65N55

Retrieve articles in all journals with MSC: 65N55


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1995-1297465-9
Keywords: Mixed finite elements, domain decomposition, parallel computing, second-order elliptic boundary value problems
Article copyright: © Copyright 1995 American Mathematical Society