A nonoverlapping domain decomposition method for nonconforming finite element problems (Q1424064): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:17, 5 March 2024

scientific article
Language Label Description Also known as
English
A nonoverlapping domain decomposition method for nonconforming finite element problems
scientific article

    Statements

    A nonoverlapping domain decomposition method for nonconforming finite element problems (English)
    0 references
    0 references
    8 March 2004
    0 references
    A non-overlapping domain decomposition method for solving second-order elliptic boundary value problems is presented. The considered problems are discretized by means of non-conforming Crouzeix-Raviart elements. In each iteration step of the domain decomposition algorithm a subproblem with Robin-type boundary conditions has to be solved in each subdomain and a derivative-free data updating on the interface has to be performed. The convergence of the proposed method is proved and estimates of the convergence rate are given. Two numerical examples demonstrate the convergence behaviour of the presented domain decomposition algorithm. The algorithm is well-suited for parallel computers with MIMD architecture.
    0 references
    iterative method
    0 references
    non-overlapping domain decomposition method
    0 references
    non-conforming finite element method
    0 references
    convergence
    0 references
    parallel algorithms
    0 references
    second-order elliptic boundary value problems
    0 references
    Crouzeix-Raviart elements
    0 references
    Robin-type boundary conditions
    0 references
    numerical examples
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references