Displaying similar documents to “Generalization of the Zlámal condition for simplicial finite elements in ℝ d ”

Nonobtuse tetrahedral partitions that refine locally towards Fichera-like corners

Larisa Beilina, Sergey Korotov, Michal Křížek (2005)

Applications of Mathematics

Similarity:

Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the validity of the discrete maximum principle for a wide class of second order elliptic and parabolic problems. In this paper we present an algorithm which generates nonobtuse face-to-face tetrahedral partitions that refine locally towards a given Fichera-like corner of a particular polyhedral domain.

Colouring polytopic partitions in ℝ d

Michal Křížek (2002)

Mathematica Bohemica

Similarity:

We consider face-to-face partitions of bounded polytopes into convex polytopes in ℝ d for arbitrary d ≥ 1 and examine their colourability. In particular, we prove that the chromatic number of any simplicial partition does not exceed d + 1 . Partitions of polyhedra in ℝ 3 into pentahedra and hexahedra are 5 - and 6 -colourable, respectively. We show that the above numbers are attainable, i.e., in general, they cannot be reduced.