Sciweavers

JC
2007

BDDC methods for discontinuous Galerkin discretization of elliptic problems

13 years 3 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization, Balancing Domain Decomposition with Constraints (BDDC) algorithms are designed and analyzed as an additive Schwarz method (ASM). The coarse and local problems are defined using special partitions of unity and edge constraints. Under certain assumptions on the coefficients and the mesh sizes across ∂Ωi, where the Ωi are disjoint subregions of the original region Ω, a condition number estimate C(1 + maxi log(Hi/hi))2 is established with C independent of hi, Hi and the jumps of the coefficients. The algorithms are well suited for parallel computations and can be straightforwardly extended to the 3-D problems. Results of numerical tests are included which confirm the theoretical results and the necessity of the imposed assumptions. Key words: interior penalty discretization, discontinuous Galerkin met...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JC
Authors Maksymilian Dryja, Juan Galvis, Marcus Sarkis
Comments (0)