Global and local refinement techniques yielding nonobtuse tetrahedral partitions (Q815240): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Sergey Korotov / rank
 
Normal rank
Property / author
 
Property / author: Michal Křížek / rank
 
Normal rank

Revision as of 12:22, 11 February 2024

scientific article
Language Label Description Also known as
English
Global and local refinement techniques yielding nonobtuse tetrahedral partitions
scientific article

    Statements

    Global and local refinement techniques yielding nonobtuse tetrahedral partitions (English)
    0 references
    16 February 2006
    0 references
    A tetrahedron is said to be a path tetrahedron if its three edges, which do not meet at the same vertex are mutually orthogonal. The authors state a set of conditions on a tetrahedron \( T \) which ensures the existence of a family of partitions of \( T \) consisting of path tetrahedrons only [see \textit{M. Krizek} and \textit{J. Pradlova}, Numer. Methods Partial Differ. Equations 16, 327--334 (2000; Zbl 0957.65012)]. Considering a path tetrahedron \( ABCD \) such that the edges \( AB, BC \) and \( CD \) are mutually orthogonal, the authors prove that there exists an infinite family of nonobtuse partitions of it into path tetrahedra that locally refine \( ABCD \) in a neighbourhood of the vertex \( A \).
    0 references
    0 references
    nonobtuse tetrahedra
    0 references
    global and local refinements
    0 references
    elliptic equations
    0 references
    parabolic equations
    0 references
    discrete maximum principle
    0 references
    finite-element method
    0 references
    linear tetrahedral finite elements
    0 references
    0 references
    0 references

    Identifiers

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