Discretization of div-curl systems by weak Galerkin finite element methods on polyhedral partitions (Q333219): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:59, 4 March 2024

scientific article
Language Label Description Also known as
English
Discretization of div-curl systems by weak Galerkin finite element methods on polyhedral partitions
scientific article

    Statements

    Discretization of div-curl systems by weak Galerkin finite element methods on polyhedral partitions (English)
    0 references
    0 references
    0 references
    28 October 2016
    0 references
    The authors present a new numerical scheme for div-curl systems defined in connected domains with heterogeneous media by using the weak Galerkin finite element method. Two types of boundary value problems are considered. The first type is the normal boundary condition whereas the second one is the tangential boundary condition. A new variational formulation is developed for the normal boundary value problem by using the Helmholtz decomposition which avoids the computation of functions in the harmonic fields. Both boundary value problems are reduced to a general saddle-point problem involving the curl and divergence operators, for which the weak Galerkin finite element method is employed and analyzed. One of the main results is that the numerical technique lies in the discretization of the divergence operator applied to vector fields in heterogeneous media. Some error estimates with optimal order are proved for the corresponding finite element approximations in several discrete Sobolev norms.
    0 references
    div-curl systems
    0 references
    weak Galerkin finite element
    0 references
    polyhedral partitions
    0 references
    boundary value problem
    0 references
    Helmholtz decomposition
    0 references
    saddle-point problem
    0 references
    error estimate
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references