Neue Methode der Lösung der Grundaufgaben zweiter Ordnung über Kegelschnitte
We discuss some properties of an orthogonal projection onto a subset of a Euclidean space. The special stress is laid on projection's regularity and characterization of the interior of its domain.
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.