Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements

Similar documents
Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research

8.B. The result of Regiomontanus on tetrahedra

Outline of the presentation

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]

On a nested refinement of anisotropic tetrahedral grids under Hessian metrics

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud

13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY

Chapter 15 Introduction to Linear Programming

Investigation of a Robust Method for Connecting Dissimilar 3D Finite Element Models. David M. Trujillo 1. December 2005

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Some Open Problems in Graph Theory and Computational Geometry

1 Exercise: Heat equation in 2-D with FE

Geometric Modeling Assignment 3: Discrete Differential Quantities

Geometric Properties of the Adaptive Delaunay Tessellation

LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING

Numerical representation of the quality measures of triangles and. triangular meshes

Parameterization of triangular meshes

Convex Hulls in Three Dimensions. Polyhedra

Geometric Computations for Simulation

Mathematical Analysis of Tetrahedron (solid angle subtended by any tetrahedron at its vertex)

Triangle in a brick. Department of Geometry, Budapest University of Technology and Economics, H-1521 Budapest, Hungary. September 15, 2010

Course Number: Course Title: Geometry

CFD MODELING FOR PNEUMATIC CONVEYING

Definitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger

PROPERTIES OF NATURAL ELEMENT COORDINATES ON ANY POLYHEDRON

Volume Illumination and Segmentation

Lecture 2 September 3

coding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Technische Universität München Zentrum Mathematik

OBJECT-ORIENTED ALGORITHM AND MODEL MANAGEMENT

Technische Universität München Zentrum Mathematik

N. Hitschfeld. Blanco Encalada 2120, Santiago, CHILE.

Glossary of dictionary terms in the AP geometry units

Practical Linear Algebra: A Geometry Toolbox

Surface Mesh Generation

Pebble Sets in Convex Polygons

THE METHODS OF TRIANGULATION

An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems

Efficient Storage and Processing of Adaptive Triangular Grids using Sierpinski Curves

Free-Form Shape Optimization using CAD Models

The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a

Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

Chapter 6. Petrov-Galerkin Formulations for Advection Diffusion Equation

4. Simplicial Complexes and Simplicial Homology

CHAPTER 1. Introduction

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron

MARCHING CUBES AND VARIANTS

Lifting Transform, Voronoi, Delaunay, Convex Hulls

Space Filling Curves and Hierarchical Basis. Klaus Speer

1 2 (3 + x 3) x 2 = 1 3 (3 + x 1 2x 3 ) 1. 3 ( 1 x 2) (3 + x(0) 3 ) = 1 2 (3 + 0) = 3. 2 (3 + x(0) 1 2x (0) ( ) = 1 ( 1 x(0) 2 ) = 1 3 ) = 1 3

Lectures in Discrete Differential Geometry 3 Discrete Surfaces

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation

Microprocessor Thermal Analysis using the Finite Element Method

The 3D DSC in Fluid Simulation

SPECIAL TECHNIQUES-II

JOB SHOP SCHEDULING WITH UNIT LENGTH TASKS

6.2 Classification of Closed Surfaces

Spectral Surface Reconstruction from Noisy Point Clouds

Bi-directional seismic vibration control of spatial structures using passive mass damper consisting of compliant mechanism

Mathematics High School Geometry

Challenge Problem 5 - The Solution Dynamic Characteristics of a Truss Structure

Application of Finite Volume Method for Structural Analysis

Finite Element Method. Chapter 7. Practical considerations in FEM modeling

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:

PS Computational Geometry Homework Assignment Sheet I (Due 16-March-2018)

CHAPTER 5 NUMERICAL INTEGRATION METHODS OVER N- DIMENSIONAL REGIONS USING GENERALIZED GAUSSIAN QUADRATURE

Mesh Generation through Delaunay Refinement

COMPUTING CONSTRAINED DELAUNAY

EXTREME POINTS AND AFFINE EQUIVALENCE

Computational Geometry: Lecture 5

Some Advanced Topics in Linear Programming

Non-extendible finite polycycles

Computational Geometry

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

arxiv:cs/ v1 [cs.cg] 26 Feb 2002

arxiv: v1 [math.na] 20 Sep 2016

1.2 Numerical Solutions of Flow Problems

Pacific Journal of Mathematics

THE preceding chapters were all devoted to the analysis of images and signals which

UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours

Hyperbolic structures and triangulations

Method of taking into account constructional and technological casting modifications in solidification simulations

5 The Theory of the Simplex Method

Lecture 2.2 Cubic Splines

2 Solution of Homework

Problem-Adapted Mesh Generation With FEM-Features

Jassim Katwan, Osama (2010) Discrete modelling of heat transfer. MSc(R) thesis, University of Glasgow.

A METHOD TO MODELIZE THE OVERALL STIFFNESS OF A BUILDING IN A STICK MODEL FITTED TO A 3D MODEL

Simulation of In-Cylinder Flow Phenomena with ANSYS Piston Grid An Improved Meshing and Simulation Approach

Discrete Mathematics I So Practice Sheet Solutions 1

Segmentation algorithm for monochrome images generally are based on one of two basic properties of gray level values: discontinuity and similarity.

Carnegie Learning Math Series Course 2, A Florida Standards Program

SELECTIVE ALGEBRAIC MULTIGRID IN FOAM-EXTEND

Simplicial Complexes: Second Lecture

Collars and Intestines: Practical Conforming Delaunay Refinement

Geometry Curriculum Map

Lecture Notes on Delaunay Mesh Generation

pα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD

Transcription:

Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements Peter Fleischmann, Robert Kosik, Bernhard Haindl, and Siegfried Selberherr Institute for Microelectronics, TU Vienna, Gu6hausstrafie 27-29, A-1040 Vienna, Austria Phone: +43/1/58801-36022, FAX: +43/1/58801-36099 E-mail: fieischmann@iue.tuwien.ac.at, WWW: http://www.iue.tuwien.ac.at Abstract. Three simple mesh examples are presented to show that neither Delaunay nor strictly non-obtuse mesh elements are required for a finite element computation. Mesh requirements based on a recent condition given in literature are investigated to guarantee certain properties of the resulting stiffness matrix. The experiments are conducted using a general finite element and finite volume solver. Keywords. Delaunay, finite element mesh, finite volume mesh, non-obtuse mesh elements, M-matrix. 1 Introduction Two important discretization methods are the finite volume and the finite element method. Each method imposes certain requirements on the mesh. For the finite volume method Delaunay meshes are usually employed to utilize the Voronoi boxes as control volumes [1]. For the finite element method geometrical quality criteria suffice for most applications. However, strictly speaking further principles need to be investigated. This is especially important for transient simulations as for example diffusion problems. 2 Requirements for Element Meshes Finite Well pronounced requirements can be formulated for a specific application of the finite element method. The basis is the maximum principle which is the most important property of solutions to convectiondiffusion equations. In its simplest form it states that both the maximum and the minimum concentrations occur on the boundary or at the initial time. This implies that if the boundary and initial values are positive, the solution must be positive everywhere and concentrations may never reach negative values. It is desirable that the employed discretization also satisfies a maximum principle. As is well known, this is guaranteed, if the system matrix resulting from the discretization is an M-matrix 1 [2][4]. The system matrix K for a simple diffusion with a standard Galerkin weighted residual approach, linear elements, and backward Euler time discretization has the following form 1 K= ~tm+ds (1) where M denotes the mass matrix, S is the stiffness matrix, and D is the diffusion constant. K becomes an M-matrix if the mass matrix is lumped and S is an M-matrix. Since S only depends on the mesh this condition translates to a constraint on the mesh. The 1 A real, nonsingular n x n matrix A where a;,j ::; 0 '<I i -::f. j and A- 1 > O. 241

off-diagonal entries Sij, i =f j of S must not be positive. These coefficients can be generally expressed as Sij = L 1 Y'Ni Y'Nj da elements e where Ni, Nj denote the basis functions and A is the area (volume) of element e. The in-product (V' Ni V' Nj) has a simple geometrical meaning and leads to an angle criterion for each edge in the mesh, which was recently introduced by (6]. It is an important consideration in three-dimensional finite element mesh generation for diffusion applications with a high concentration gradient. Criterion 1 (sum of dihedral angles) Let ei,j be an edge with n adjacent tetrahedra tk. For each tk two planes exist which do not contain ei,j and which span a dihedral angle fh. The two planes share an edge with length lk. The sum over k = 1... n of the cotangens of fh weighted by lk must be greater or equal than zero. n L lk cot Ok ~ 0 k=l Fig. 2 depicts an example where this criterion is violated for the interior edge ei,j. Four adjacent tetrahedra exist of which two span a 90 angle. Hence, cot 03 = 0 and cot 04 = 0. As one can see from the figure cot 01 = cot 02 = - ~ ( 01, 02 are obtuse, "' 125.3 ) and hence the total sum is negative. In two dimensions (3) can be written as where 01 and 02 are the angles of two triangles sharing a common edge ei,j as shown in Fig. 1. It can be assumed that and therefore 0 < 01,2 < 180 sin 01 sin 02 > 0 Hence, multiplying ( 4) with sin 0 1 sin 0 2 results in which is equivalent to (2) Due to (5) and (8) the finite element mesh criterion (Crit. 1) can be expressed in two dimensions as... Ri...... '......... -. --- - -- - (3) Figure 1: Finite element mesh criterion for two dimensions. In two dimensions (10) describes the relation between the circumcircle radius, the edge length, and the opposite angle in a triangle... (8) (9). 0 li sm i = 2 R (10) In three dimensions a relation for the circumsphere ( 4 ) radius, the edge length, and the opposite dihedral angle Ok (which is important for Crit. 1) in a tetrahedron does not exist as illustrated in Fig. 3. This leads to a very interesting conclusion. It can be shown due to the existing relation (10) that the finite element ( 5 ) mesh requirement (Crit. 1) is in two dimensions identical to the finite volume mesh requirement which is based on the empty circumcircles Delaunay criterion. (6) To see this equivalence of the angle condition (9) and the Delaunay criterion dependent on (10) consider the extreme case where (9) becomes (7) (11) 242

1 =const. e-.o Figure 3: With constant edge length and circumsphere radius the opposite dihedral angle in a tetrahedron can have arbitrary values. It follows that Figure 2: T 6 tessellation and Crit. 1. sin 81 = sin 82 and furthermore with Equation 10 (12) (13) The two triangles with the common edge ei,j (Fig. 1) must possess circumcircles with equally sized radii. Because of (11) the circumcircles must be in fact iden- 3 tical. Each circumcircle passes therefore through all four vertices of the two triangles and the Delaunay criterion is "just" fulfilled. With a decreasing sum (81 + 82) the distance between the two circumcenters (centers of the circumcircles) increases and the Delaunay criterion is definitely satisfied. As expected, in two dimensions the finite volume and the finite element method lead to the same discretization with identical requirements. They both rely on Delaunay meshes to fulfill the maximum principle. For other finite element applications than diffusion, like stationary problems or problems with less high gradients, the use of Delaunay meshes can often be omitted. In three dimensions Crit. 1 and the Delaunay criterion are of quite different nature as will be shown with simple examples in the next section. In practice finite element mesh generators may generally try to avoid extremely obtuse (dihedral) angles and badly shaped elements without too much concern on the Delaunay property and without a technique to directly enforce Crit. 1. Such a technique remains open to further research. Simple, Examples Distinctive Mesh The pure diffusion equation is solved with the finite element and the finite volume method using AMIGOS [5]. This allows the comparison of the solutions on identical meshes with the same linear solver. A Gaussian profile is used as the initial distribution. In two dimensions correct and identical results are obtained with both methods on Delaunay meshes. In three dimensions the finite volume 243

method still achieves qualitatively correct results on a Delaunay mesh as expected. However, the finite element method fails on the same three-dimensional Delaunay mesh. Even for such a simple test problem the finite element solution strongly violates the maximum principle. The resulting concentration reaches negative values in some areas. These areas spread out in time and the absolute value of the emerging negative concentrations is much larger than the minimal initial concentration. The relative error between the solutions of the two methods oscillates strongly and is large in regions where the concentration is negative. These negative concentrations are particularly annoying for diffusion applications in semiconductor process simulation where the concentration varies many orders of a magnitude within a small area. For a more complicated transient problem like the pair diffusion model the negative concentrations lead to severe instabilities. The aim of this section is to investigate the observed effects in terms of mesh requirements and to construct simple mesh examples where the finite element method can be applied successfully to the diffusion problem. Mesh Example 1: A Delaunay mesh which is not suitable as a finite element mesh for diffusion applications. Mesh Example 2: A Delaunay mesh which is suitable for finite element diffusion simulation. Mesh Example 3: A non-delaunay mesh with obtuse dihedral angles which is still suitable as a finite element mesh. The three presented meshes illustrate the different scope of the Delaunay criterion and Crit. 1. They prove that in three dimensions the Delaunay criterion is neither sufficient nor necessary to obtain a correct finite element mesh for diffusion so that the maximum principle is fulfilled. The examples also show that a strict adherence to a sole non-obtuse angle criterion is not necessary. This important insight complements previous research [3] where one example, a Delaunay mesh insufficient for such applications, was given. The examples were constructed by exploiting an ortho-product point distribution. A cube defined by eight points can be tetrahedralized in two qualitatively different ways. T 6 Tessellation: A cube is composed of six tetrahedra (Fig. 2). T 5 Tessellation: A cube is composed of five tetrahedra (Fig. 4). For comparison purposes a specific tessellation T6 is used which contains sliver elements with obtuse dihedral angles. The tessellation T 5 on the other hand does not contain such elements. Note that also T 6 tessellations exist which do not contain obtuse angles. The Delaunay Triangulation is known to maximize the minimum angle in two dimensions only. However, in three dimensions Delaunay slivers may exist. The key idea is that all elements of both tessellations fulfill the empty circumsphere Delaunay criterion, because all points lie on the perimeter of a single sphere. On the other hand Fig. 2 clearly shows that the finite element mesh requirement (Crit. 1) is not met by the chosen T 6 tessellation. It is only met by the T 5 tessellation, because of the total absence of obtuse dihedral angles. Suitable meshes for simulation are then built by stacking a large number of such tessellated cubes. The typical characteristics of each tessellation type are thereby conserved. Hence, both meshes are global Delaunay meshes and yet only one satisfies Crit. 1. The two fundamentally different meshes based on an identical ortho-product point cloud are depicted in Fig. 5 and Fig. 6. The finite element simulation on the T 6 type Delaunay mesh results in negative concentrations as was previously pointed out. The T 5 type Delaunay mesh which fulfills Crit. 1 indeed succeeds to yield the required entries in the stiffness matrix and the concentrations remain positive at all times during the transient simulation. The most important fact however is shown by the third example. Further exploiting the ortho-product point set and its T 5 type tessellation with slightly shifted points in certain locations results in a non Delaunay mesh which still satisfies Crit. 1. Fig. 7 shows an instance of the mesh consisting of eight cubes. The point in the middle has been shifted. The Delaunay criterion must be violated, because the cir- 244

mesh with obtuse angles could be constructed for a successful finite element computation. Existing meshing techniques often try to avoid any obtuse dihedral angles. This is not necessary if techniques can be developed to generate finite element meshes which satisfy Crit. 1. 5 Acknowledgment We acknowledge support from the "Christian Doppler Forschungsgesellschaft", Vienna, Austria and invaluable suggestions from Prof. Paula Pietra, University of Vienna. References [1] P. Conti. Grid Generation for Three-Dimensional Semiconductor Device Simulation. Hartung- Gorre, 1991. Figure 4: T 5 tessellation, no obtuse dihedral angles. [2] T. Ikeda. Maximum Principle in Finite Element Models for Convection-Diffusion Phenomena. North Holland, Amsterdam, 1983. cumspheres of several unmodified tetrahedra contain the shifted point in its interior. The simulation using AMIGOS for the entire mesh (Fig. 8) shows, that the requirements for the stiffness matrix are fulfilled. Again, the concentrations do not [4] reach negative values at any time. The shifting of a point introduces obtuse dihedral angles and positive contributions to off-diagonal elements of the stiffness matrix. However, in total due to the sum of the entries of the adjacent elements, Crit. 1 is satisfied and the stiffness matrix remains an M-matrix. 4 Conclusion The investigated mesh requirements, which depend on the employed discretization scheme, lead to the conclusion that in two dimensions Delaunay meshes are in all cases preferable. In three dimensions Delaunay meshes are neither sufficient nor necessary for a finite element simulation. In fact a non-delaunay [3] F.W. Letniowski. Three-dimensional Delaunay triangulations for finite element approximations to a second-order diffusion operator. SIAM J.Sci.Stat.Comput., 13(3):765-770, 1992. M. Putti and Ch. Cordes. Finite element approximation of the diffusion operator on tetrahedra. SIAM J.Sci.Comput., 19(4):1154-1168, 1998. [5] M. Radi, E. Leitner, E. Hollensteiner, and S. Selberherr. Amigos: Analytical model interface & general object-oriented solver. In International Conference on Simulation of Semiconductor Processes and Devices, pages 331-334, Cambridge, Massachusetts, 1997. [6] J. Xu and L. Zikatanov. A monotone finite element scheme for convection-diffusion equations. to be published in Mathematics of Computation. 245

Figure 5: Delaunay mesh (T 6 ), 3072 tetrahedra. Figure 7: n type tessellation with a shifted point. Figure 6: Delaunay mesh (T 5 ), 2560 tetrahedra. Figure 8: Non-Delaunay mesh, 2560 tetrahedra. 246