INTRODUCTION TO FINITE ELEMENT METHODS
|
|
- Alberta Carroll
- 6 years ago
- Views:
Transcription
1 INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function. Although unknowns are still associated to nodes, the function composed by piece-wise polynomials on each element and thus the gradient can be computed element-wise. Finite element spaces can thus be constructed on general triangulations and this method is able to handle complex geometries and boundaries. Boundary condition is naturally build into the weak formulation or the function space. The variational approach also give solid mathematical foundation and make the error analysis more systematic. Generally speaking, finite element methods is the method of choice in all types of analysis for elliptic equations in complex domains.. GALERKIN METHODS The finite element methods have been introduced as methods for approximate solution of variational problems. Let us consider the model problem: Poisson equation with homogenous Dirichlet boundary conditions () u = f in Ω, u = 0 on Ω. Multiply a test function v, integrate over Ω, and use integration by parts to obtain the corresponding variational formulation: Find u V = H 0 (Ω), such that (2) a(u, v) = f, v, for all v V. where (3) a(u, v) = Ω u v dx, f, v = Ω fv dx, for f L 2 (Ω) Clearly, in such case a(u, u) = u 2,Ω and the Poincaré inequality u 0,Ω C u,ω for H0 (Ω) implies that a(, ) is an inner product on V, and thus the problem (2) has a unique solution by the Riesz representation theorem. We now consider a class of methods, known as Galerkin methods which are used to approximate the solution to (2). Consider a finite dimensional subspace V h V, and let V h = span{φ,..., φ N }. For any function v V h, there is a unique representation: v = N v iφ i. We thus can define an isomorphism V h = R N by N (4) v = v i φ i v = (v,, v N ), and call v the coordinate vector of v relative to the basis {φ i } N. Following the terminology in elasticity, we introduce the stiffness matrix A = (a ij ) N N, with a ij = a(φ j, φ i ), Date: Created on Oct Latest update October 23, 207.
2 2 LONG CHEN and the load vector f = { f, φ k } N k= RN. Then the coefficient vector can be obtained by solving the following linear algebraic system Au = f. It is straightforward to verify A is an SPD matrix and thus the solution u exists and unique. The finite element methods is a special and most popular example of Galerkin methods by constructing a finite dimensional subspace V h based on triangulations of the domain. The name comes from the fact that the domain is decomposed into finite number of elements. 2. TRIANGULATIONS AND BARYCENTRIC COORDINATES In this section, we discuss triangulations used in finite element methods. We would like to distinguish two structures related to a triangulation: one is the topology of a mesh determined by the combinatorial connectivity of vertices; another is the geometric shape which depends on both the connectivity and the location of vertices. Correspondingly there are two basic data structures used to represent a triangulation. 2.. Geometric simplex and triangulation. Let x i = (x,i,, x n,i ), i =,, n+ be n + points in R n. We say x,, x n+ do not all lie in one hyper-plane if the n- vectors x x 2,, x x n+ are independent. This is equivalent to the matrix: A = x, x,2... x,n+ x 2, x 2,2... x 2,n+... x n, x n,2... x n,n+... is non-singular. Given any point x = (x,, x n ) R n, by solving the following linear system (5) A λ. λ n λ n+ = x. x n, we obtain unique n + real numbers λ i (x), i n +, such that for any x R n n+ (6) x = λ i (x)x i, with n+ λ i (x) =. The convex hull of the d + points x,, x d+ in R n d+ d+ (7) := {x = λ i x i 0 λ i, i = : d +, λ i = } is defined as a geometric d-simplex generated (or spanned) by the vertices x,, x d+. For example, a triangle is a 2-simplex and a tetrahedron is a 3-simplex. For an integer 0 m d, an m-dimensional face of is any m-simplex generated by m + vertices of. Zero dimensional faces are vertices and one-dimensional faces are called edges of. The (d )-face opposite to the vertex x i will be denoted by F i. The numbers λ (x),, λ d+ (x) are called barycentric coordinates of x with respect to the d + points x,, x d+. There is a simple geometric meaning of the barycentric
3 INTRODUCTION TO FINITE ELEMENT METHODS 3 coordinates. Given a x, let i (x) be the simplex with vertices x i replaced by x. Then, by the Cramer s rule for solving (5), (8) λ i (x) = i(x), where is the Lebesgue measure in R d, namely area in two dimensions and volume in three dimensions. Note that λ i (x) is an affine function of x and vanished on the face F i. x i x x i x x x i i (a) d simplex (b) 2d simplex (c) 3d simplex FIGURE. Geometric explanation FIGUREof. barycentric Patches are coordinates. similar It is convenient to have a standard simplex s n R n spanned by the vertices 0, e,, e n where e i = (0,,,, 0). Then any n-simplex R n can be thought as an image of s n through an affine map B : s n with B(e i ) = x i. See Figure 2. The simplex s n is also often called reference simplex z B 0 s s 2 s 3 0 x (a) A standard simplex in R (b) A standard simplex in R 2 (c) A standard simplex in R 3 FIGURE 2. Reference simplexes in R, R 2 and R 3 y Let Ω be a polyhedral domain in R d, d. A geometric triangulation (also called mesh or grid) T of Ω is a set of d-simplices such that T = Ω, and i j =, i j. Remark 2.. In this course, we restrict ourself to simplicial triangulations. There are other type of meshes by partition the domain into quadrilateral (in 2-D), cubes, prisms (in 3-D), or polytopes in general.
4 4 LONG CHEN There are two conditions that we shall impose on triangulations that are important in the finite element computation. The first requirement is a topological property. A triangulation T is called conforming or compatible if the intersection of any two simplexes and in T is either empty or a common lower dimensional simplex (nodes in two dimensions, nodes and edges in three dimensions). (a) A triangulation (a) Bisect (a) Bisect with a triangle a hanging triangle node (b) A(b) conforming (b) Completion triangulation FIGURE 3. Two triangulations. FIGURE FIGURE. Newest. The Newest leftvertex is non-conforming bisection and the right is conforming. The second important condition depends on the geometric structure. A set of triangulations T is called shape regular if there exists a constant c 0 such that (9) max T diam() d c 0, for all T T, where diam() is the diameter of and is the measure of in R d. In two dimensions, it is equivalent to the minimal angle of each triangulation is bounded below uniformly in the shape regular class. We shall define h = /n for any T T. By (9), h diam() represents the size of an element T for a shape regular triangulation T T. In addition to (9), if max T (0) ρ, for all T T, min T T is called quasi-uniform. For quasi-uniform grids, define the mesh size of T as h T := max T h. It is used to measure the approximation rate. In FEM literature, we often write a triangulation as T h Abstract simplex and simplicial complex. To distinguish the topological structure with the geometric one, we now understand the points as abstract entities and introduce abstract simplex or combinatorial simplex. The set = {v,, v d+ } of d + abstract points is called an abstract d-simplex. A face σ of a simplex is a simplex determined by a non-empty subset of. A k-face has k + points. A proper face is any face different from. Let N = {v, v 2,, v N } be a set of N abstract points. An abstract simplicial complex T is a set of simplices formed by finite subsets of N such that if T is a simplex, then any face of is also a simplex in T. By the definition, a two dimensional combinatorial complex T contains not only triangles but also edges and vertices of these triangles. A geometric triangulation defined before is only a set of d-simplex not its faces. By including all its face, we shall get a simplicial complex. A subset M T is a subcomplex of T if M is a simplicial complex itself. Important classes of subcomplex includes the star or ring of a simplex. That is for a simplex σ T star(σ) = { T, σ }.
5 INTRODUCTION TO FINITE ELEMENT METHODS 5 If two, or more, simplices of T share a common face, they are called adjacent or neighbors. The boundary of T is formed by any proper face that belongs to only one simplex, and its faces. By associating the set of abstract points with geometric points in R n, n d, we obtain a geometric shape consisting of piecewise flat simplices. This is called a geometric realization of an abstract simplicial complex or, using the terminology of geometry, the embedding of T into R n. The embedding is uniquely determined by the identification of abstract and geometric vertices. We would like to emphasis that they are two different structures of a triangulation T : one is the topology of a mesh which is determined by the combinatorial connectivity of vertices; another is the geometric shape which depends on the location of the vertices. For example, a planar triangulation is a two dimensional abstract simplicial complex which can be embedded into R 2 and thus called 2-D triangulation. A 2-D simplicial complex could also be embedding into R 3 and result a triangulation of a surface. For these two different embedding, they have the same combinatory structure as an abstract simplicial complex but different geometric structure by representing a flat domain in R 2 or a surface in R LINEAR FINITE ELEMENT SPACES In this section we introduce the simplest linear finite element space of H (Ω) and use scaling argument to estimate the interpolation error. 3.. Linear finite element space and the nodal interpolation. Given a shape regular triangulation T h of Ω, we set V h := {v v C(Ω), and v P, T h }, where P () denotes the space of polynomials of degree (linear) on T h. Whenever we need to deal with boundary conditions, we further define V h,0 = V h H 0 (Ω). We note here that the global continuity is also necessary in the definition of V h in the sense that if u H (Ω), and u is piecewise smooth, then u should be continuous. We use N to denote the dimension of finite element spaces. For V h, N is the number of vertices of the triangulation T h and for V h,0, N is the number of interior vertices. For linear finite element spaces, we have the so called a nodal basis functions {φ i, i =, N} such that φ i is piecewise linear (with respect to the triangulation) and φ i (x j ) = δ i,j for all vertices x j of T h. Therefore for any v h V h, we have the representation v h (x) = N v h (x i )φ i (x). Due to the shape of the nodal basis function, it is also called hat function. See Figure 4 for an illustration in -D and 2-D. Note that φ i is the corresponding barycentrical coordinates. The nodal interpolation operator I h : C(Ω) V h is defined as (I h u)(x) = and denoted by the short notation u I := I h u. N u(x i )φ i (x),
6 6 LONG CHEN (a) d basis function (b) 2d basis function FIGURE 4. Nodal basis functions in d and 2d Scaling argument and inverse inequality. Let ˆ = s n be the standard n-simplex which is also called reference simplex. Define an affine map F : ˆ, and the function ˆv h (ˆx) = v h (F (ˆx)), ˆx ˆ. The affine map F consists of translation, rotation and scaling. Essentially it is like a scaling of variables x = hˆx. The following important relation between the norms on the reference simplex and physical simplex can be easily proved by changing of variable. The shape regularity of a simplex will be needed to bound the 2-norm of Jacobi matrix and its determinant in terms of h. Lemma 3.. When is shape regular, we have () ˆD αˆv 0,p,ˆ h sobn(k,p) D α v 0,p,, for all α = k, where the Sobolev number is sob n (k, p) = k n p. Proof. Let J = ( x ˆx) be the Jacobi matrix of the map F. Then ˆ ˆv = J v and consequently ˆD αˆv h k D α v, cf. Exercise 3. Use the change of variable dx = J dˆx h n dˆx, we have ˆD αˆv p dˆx h kp D α v h n dx. Then the results follows. ˆ For two Banach spaces B 0, B, the continuous embedding B B 0 implies that u B0 u B, for all u B. The inequality in the reserve way u B u B0 may not true. Now considering finite element spaces V h B i, i = 0, endowed with two norms. For a fixed h, the dimension of V h is finite. Since all the norms of finite dimensional spaces are equivalent, there exists constant C h such that (2) u h B C h u h B0, for all u h V h. The constant C h in (2) depends on the size and shape of the domain. If we consider the restriction on one element and transfer to the reference element ˆ, the constant for the norm equivalence will not depend on h, i.e., û h B,ˆ û h B0,ˆ.
7 INTRODUCTION TO FINITE ELEMENT METHODS 7 Using the map F, we can then determine the constant in terms of the mesh size h. This is called scaling argument. As an example, we obtain the following typical inverse inequalities (3) (4) u h, h u h, and u h 0,p, h n(/p /q) u h 0,q,, q p. Recall that we have the following refined embedding theorem (5) v 0,p,Ω C(n, Ω) p /n v,n,ω, for all p <. Using the inverse inequality and the above embedding result, for u h V h, we have v h h n/p v h 0,p h n/p p /n v h,n. n/ log h Now choosing p = log h and noting h embedding result: (6) v h log h /n v h,n, for all v h V h. C, we get the following discrete In particular, when n = 2, we can almost control the maximum norm of a finite element function by its H norm. Although the term log h is unbounded as h 0, it increases very slowly and appears as a constant for practical h Error estimate of nodal interpolation. We use the scaling argument to estimate the interpolation error u u I,Ω and refer to Exercise 4 for a proof using multipoint Taylor series. Theorem 3.2. For u H 2 (Ω), Ω R n, n =, 2, 3, and V h the linear finite element space based on quasi-uniform triangulations T h, we have u u I,Ω h u 2,Ω. Proof. First of all, by the Sobolev embedding theorem, H 2 C( Ω) for n 3. Thus the nodal interpolation u I is well defined. Since û,ˆ û 2,ˆ, and û I,ˆ û I 0,,ˆ û 0,,ˆ û 2,ˆ, we get the estimate in the reference simplex: for û H 2 (ˆ) (7) û û I,ˆ û,ˆ + û I,ˆ û 2,ˆ. The nodal interpolation will preserve linear polynomials i.e. ˆp I = ˆp for ˆp P (ˆ), then û û I,ˆ = (û + ˆp) (û + ˆp) I,ˆ û + ˆp 2,ˆ, ˆp P (ˆ), and thus by the Bramble-Hilbert lemma (8) û û I,ˆ inf ˆp P (ˆ) û + ˆp 2, û 2,ˆ. We now use the scaling argument to transfer the inequality back to the simplex. First û 2,ˆ h 2 n 2 u 2,. To scale the left hand side, we need a property of the interpolation operator (9) û u I = û û I,
8 8 LONG CHEN namely the interpolation is affine invariant, which can be verified easily by definition. Then by the scaling argument h n 2 u u I, û u I,ˆ = û û I,ˆ. Combing all the arguments above leads to the interpolation error estimate on a quasiuniform mesh. For u H 2 (Ω), u u I 2,Ω = u u I 2, h 2 u 2 2, h 2 u 2 2,Ω. T h T h 4. FINITE ELEMENT METHODS AND ERROR ESTIMATE Finite element methods for solving Poisson equation is a special case of Galerkin method by choosing the subspace V h V based on a triangulation T h of the underlying domain. As an example, let us consider the linear finite element space V h. The finite element approximation will be: find u h V h such that (20) a(u h, v h ) = f, v h, for all v h V h. Again the existence and uniqueness follows from the Riesz representation theorem since f V V h is also a continuous linear functional on V h and by Poincaré inequality a(, ) defines an inner production on H 0 (Ω). 4.. H error estimate. We first derive an important orthogonality result for projections. Let u and u h be the solution of continuous and discrete equations respectively i.e. a(u, v) = f, v v H 0 (Ω), a(u h, v) = f, v v V h. By subtracting these two equations, we then get an important orthogonality (2) a(u u h, v h ) = 0 v h V h, which implies the following optimality of the finite element approximation (22) (u u h ) = inf v h V h (u v h ). Theorem 4.. Let u and u h be the solution of continuous and discrete equations respectively. When u H 2 (Ω) H 0 (Ω), we have the following optimal order estimate: (23) (u u h ) h u 2. Furthermore when H 2 -regularity result holds, we have (24) (u u h ) h f. Proof. When u H 2 (Ω) H 0 (Ω), the nodal interpolation operator is well defined by the embedding theorem. By (22), we then have (u u h ) (u u I ) h u 2 h f. Here in the second, we have used the error estimate of interpolation operator, and in the third one, we have useed the regularity result.
9 INTRODUCTION TO FINITE ELEMENT METHODS L 2 error estimate. Now we estimate u u h. The main technical is the combination of the duality argument and the regularity result. It is known as Aubin-Nitsche duality argument or simply Nitsche s trick. Theorem 4.2. Let u and u h be the solution of continuous and discrete equations respectively. Suppose the H 2 regularity result holds, we then have the following optimal order approximation in L 2 norm (25) u u h h 2 u 2. Proof. By the H 2 regularity result, there exists w H 2 (Ω) H 0 (Ω) such that (26) a(w, v) = (u u h, v), for all v H 0 (Ω), and w 2 C u u h. Choosing v = u u h in (26), we get u u h 2 = a(w, u u h ) Canceling one u u h, we get = a(w w I, u u h ) (w w I ) (u u h ) h w 2 (u u h ) h u u h (u u h ) u u h Ch (u u h ) h 2 u 2. (orthogonality) (regularity). For the estimate in H norm, when u is smooth enough, we can obtain the optimal first order estimate. But for L 2 norm, the duality argument requires H 2 elliptic regularity, which in turn requires that the polygonal domain be convex. In fact, for a non-convex polygonal domain, it will usually not be true that u u h = O(h 2 ) even if the solution u is smooth.
10 0 LONG CHEN EXERCISE. A multi-index α is an k-tuple of non-negative integers α = (α, α 2,, α k ). The length of α is defined by α = k α i, and α! = α!... α n!. For a given vector x = (x, x 2,, x k ), we define x α = x α xα2 2 xα k k. Finally let λ = (λ, λ 2,, λ n+ ) denote the vector of barycentric coordinates. For an n + multi-index α and an n-simplex, one has (27) λ α (x)dx = α!n! ( α + n)!. We shall prove the identity (27) through the following sub-problems: () n = and = [0, ]. Prove that 0 x α ( x) α2 dx = α!α 2! (α + α 2 + )! (2) n = 2 and = s 2. Prove that α x α y α2 ( x y) α3!α 2!α 3! dx = (α + α 2 + α 3 + 2)! (3) Prove the identity (27) for = s n using induction on n. (4) Prove the identity (27) for general simplex by using the transformation from the standard simplex s n. 2. In this exercise, we give explicit formula of the stiffness matrix. Let be a triangle with vertices x, x 2, x 3 and let λ, λ 2, λ 3 be corresponding barycentric coordinates. () Let n i be the outward normal vector of the edge e i and d i be the distance from x i to e i. Prove that λ i = d i n i. (2) Let θ i be the angle associated to the vertex x i. Prove that λ i λ j dx = 2 cot θ k, where (i, j, k) is any permutation of (, 2, 3). (3) Let c i = cot θ i, i = to 3. If we define the local stiffness matrix A as 3 3 matrix formed by λ i λ j dx, i, j =, 2, 3. Show that A = c 2 + c 3 c 3 c 2 c 3 c 3 + c c. 2 c 2 c c + c 2 (4) Let e be an interior edge in the triangulation T with nodes x i and x j, and shared by two triangles and 2. Denoted the angle in oppositing to e by θ e. Then prove that the entry a ij = Ω φ i φ j dx is a ij = (cot θ e + cot θe 2 ). 2 Consequently a ij 0 if and only if θ e π. By the way, if a 2-D triangulation satisfying θ e + θ 2 e + θe 2 π, it is called a Delaunay triangulation.
11 INTRODUCTION TO FINITE ELEMENT METHODS 3. In this exercise, we compute the singular values of the affine map from the reference triangle ˆ spanned by â = (, 0), â 2 = (0, ) and â 3 = (0, 0) to a triangle with three vertices a i, i =, 2, 3. One of such affine map is to match the local indices of three vertices, i.e., F (â i ) = a i, i =, 2, 3: F (ˆx) = B (ˆx) + c, where [ ] x x B = 3 y y 3, and c = (x x 2 x 3 y 2 y 3, y 3 ). 3 () Estimate the σ max (B) and σ min (B) in terms of edge lengthes and angles of the triangle. (2) Establish inequalities between v 0, and ˆ ˆv 0,ˆ where ˆv(ˆx) := v(f (ˆx)). 4. In this exercise, we give an elementary proof of the interpolation error estimate. Let be a simplex with vertices x i, i =,..., n + and {λ i, i =,..., n + } be the corresponding barycentric coordinates. () Show that n+ u I (x) = u(x i )λ i (x), n+ λ i (x) =, (2) Let us introduce the auxiliary functions and g i (t, x) = u(x i + t(x x i )). For u C 2 ( ), prove the following error equations n+ (u I u)(x) = λ i (x) n+ (u I u)(x) = λ i 0 0 n+ (x x i )λ i (x) = 0. tg i (t, x)dt, tg i (t, x)dt. Hint: Multiply the following Taylor series by λ i and sum over i g i (0, x) = g i (, x) g i(, x) + 0 tg i (t, x)dt. (3) Let u W 2,p with p > n/2. Using the error formulate in (2) to prove u u I 0,p C h 2 u 2,p, u u I,p C 2 h u 2,p. Try to obtain a sharp constants in the above inequalities. 5. We can define the quadratic element by using piecewise quadratic polynomials. () Inside one triangle, write out a basis of the quadratic element using barycentric coordinates. (2) Derive the error estimate on u u h, u u h, and u u h.
Finite Element Methods
Chapter 5 Finite Element Methods 5.1 Finite Element Spaces Remark 5.1 Mesh cells, faces, edges, vertices. A mesh cell is a compact polyhedron in R d, d {2,3}, whose interior is not empty. The boundary
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationarxiv: v1 [math.na] 20 Sep 2016
arxiv:1609.06236v1 [math.na] 20 Sep 2016 A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization P. Gangl 1,2 and U. Langer 3 1 Doctoral Program Comp.
More informationFully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon
Fully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon Tamal Pramanick 1,a) 1 Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati
More informationBasics of Combinatorial Topology
Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More informationContents. I The Basic Framework for Stationary Problems 1
page v Preface xiii I The Basic Framework for Stationary Problems 1 1 Some model PDEs 3 1.1 Laplace s equation; elliptic BVPs... 3 1.1.1 Physical experiments modeled by Laplace s equation... 5 1.2 Other
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationLecture 5: Simplicial Complex
Lecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex Scribed by: Lei Wang First part of this lecture finishes 2-Manifolds. Rest part of this lecture talks about simplicial complex.
More informationAn Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems
An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems Long Chen University of California, Irvine chenlong@math.uci.edu Joint work with: Huayi Wei (Xiangtan University),
More informationLinear Finite Element Methods
Chapter 3 Linear Finite Element Methods The finite element methods provide spaces V n of functions that are piecewise smooth and simple, and locally supported basis function of these spaces to achieve
More informationGalerkin Projections Between Finite Element Spaces
Galerkin Projections Between Finite Element Spaces Ross A. Thompson Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More informationSTANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M. MASUDA
Communications in Algebra, 34: 1049 1053, 2006 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870500442005 STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M.
More informationLecture 0: Reivew of some basic material
Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationGeneralized barycentric coordinates
Generalized barycentric coordinates Michael S. Floater August 20, 2012 In this lecture, we review the definitions and properties of barycentric coordinates on triangles, and study generalizations to convex,
More informationAs a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.
II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,
More informationChapter 13. Boundary Value Problems for Partial Differential Equations* Linz 2002/ page
Chapter 13 Boundary Value Problems for Partial Differential Equations* E lliptic equations constitute the third category of partial differential equations. As a prototype, we take the Poisson equation
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationCLASSIFICATION OF SURFACES
CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More information66 III Complexes. R p (r) }.
66 III Complexes III.4 Alpha Complexes In this section, we use a radius constraint to introduce a family of subcomplexes of the Delaunay complex. These complexes are similar to the Čech complexes but differ
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationLecture 1 Discrete Geometric Structures
Lecture 1 Discrete Geometric Structures Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology
More informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationLecture 2 - Introduction to Polytopes
Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.
More informationSIMPLICIAL ENERGY AND SIMPLICIAL HARMONIC MAPS
SIMPLICIAL ENERGY AND SIMPLICIAL HARMONIC MAPS JOEL HASS AND PETER SCOTT Abstract. We introduce a combinatorial energy for maps of triangulated surfaces with simplicial metrics and analyze the existence
More informationConforming Vector Interpolation Functions for Polyhedral Meshes
Conforming Vector Interpolation Functions for Polyhedral Meshes Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and
More informationarxiv: v2 [math.na] 2 Oct 2015
INTERPOLATION ERROR ESTIMATES FOR HARMONIC COORDINATES ON POLYTOPES ANDREW GILLETTE AND ALEXANDER RAND arxiv:1504.00599v2 [math.na] 2 Oct 2015 Abstract. Interpolation error estimates in terms of geometric
More information4.2 Simplicial Homology Groups
4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point
More informationarxiv: v1 [math.co] 27 Feb 2015
Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,
More informationThe Borsuk-Ulam theorem- A Combinatorial Proof
The Borsuk-Ulam theorem- A Combinatorial Proof Shreejit Bandyopadhyay April 14, 2015 1 Introduction The Borsuk-Ulam theorem is perhaps among the results in algebraic topology having the greatest number
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationThe orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.
Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationGAUSS-BONNET FOR DISCRETE SURFACES
GAUSS-BONNET FOR DISCRETE SURFACES SOHINI UPADHYAY Abstract. Gauss-Bonnet is a deep result in differential geometry that illustrates a fundamental relationship between the curvature of a surface and its
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationBraid groups and Curvature Talk 2: The Pieces
Braid groups and Curvature Talk 2: The Pieces Jon McCammond UC Santa Barbara Regensburg, Germany Sept 2017 Rotations in Regensburg Subsets, Subdisks and Rotations Recall: for each A [n] of size k > 1 with
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationOn a nested refinement of anisotropic tetrahedral grids under Hessian metrics
On a nested refinement of anisotropic tetrahedral grids under Hessian metrics Shangyou Zhang Abstract Anisotropic grids, having drastically different grid sizes in different directions, are efficient and
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More information2018 AMS short course Discrete Differential Geometry. Discrete Mappings. Yaron Lipman Weizmann Institute of Science
2018 AMS short course Discrete Differential Geometry 1 Discrete Mappings Yaron Lipman Weizmann Institute of Science 2 Surfaces as triangulations Triangles stitched to build a surface. 3 Surfaces as triangulations
More informationEdexcel Linear GCSE Higher Checklist
Number Add, subtract, multiply and divide whole numbers integers and decimals Multiply and divide fractions Order integers and decimals Order rational numbers Use the concepts and vocabulary of factor
More informationEfficient Mesh Optimization Schemes based on Optimal Delaunay Triangulations
Efficient Mesh Optimization Schemes based on Optimal Delaunay Triangulations Long Chen a,, Michael Holst b,1 a Department of Mathematics, University of California at Irvine, Irvine, CA 92697 Email: chenlong@math.uci.edu
More informationINTERIOR PENALTY DISCONTINUOUS GALERKIN METHOD ON VERY GENERAL POLYGONAL AND POLYHEDRAL MESHES
INTERIOR PENALTY DISCONTINUOUS GALERKIN METHOD ON VERY GENERAL POLYGONAL AND POLYHEDRAL MESHES LIN MU, JUNPING WANG, YANQIU WANG, AND XIU YE Abstract. This paper provides a theoretical foundation for interior
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationToric Varieties and Lattice Polytopes
Toric Varieties and Lattice Polytopes Ursula Whitcher April 1, 006 1 Introduction We will show how to construct spaces called toric varieties from lattice polytopes. Toric fibrations correspond to slices
More information60 2 Convex sets. {x a T x b} {x ã T x b}
60 2 Convex sets Exercises Definition of convexity 21 Let C R n be a convex set, with x 1,, x k C, and let θ 1,, θ k R satisfy θ i 0, θ 1 + + θ k = 1 Show that θ 1x 1 + + θ k x k C (The definition of convexity
More informationEuler Characteristic
Euler Characteristic Beifang Chen September 2, 2015 1 Euler Number There are two rules to follow when one counts the number of objects of finite sets. Given two finite sets A, B, we have (1) Addition Principle
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationCS 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:
CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,
More informationQuadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Yuanxin Liu and Jack Snoeyink Joshua Levine April 18, 2007 Computer Science and Engineering, The Ohio State University 1 / 24
More informationCOMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS
COMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS WIES LAW KUBIŚ Abstract. We characterize complete metric absolute (neighborhood) retracts in terms of existence of certain maps of CW-polytopes. Using our
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationGEOMETRIC TOOLS FOR COMPUTER GRAPHICS
GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W
More informationTopological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College
Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI
More informationA Hash Data Structure for Adaptive PDE Solvers Based on Discontinuous Galerkin Discretizations
A Hash Data Structure for Adaptive PDE Solvers Based on Discontinuous Galerkin Discretizations Kolja Brix, Ralf Massjung, and Alexander Voß Bericht Nr. 302 Juli 2009 Key words: Discontinuous Galerkin method,
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationTHE MORTAR FINITE ELEMENT METHOD IN 2D: IMPLEMENTATION IN MATLAB
THE MORTAR FINITE ELEMENT METHOD IN D: IMPLEMENTATION IN MATLAB J. Daněk, H. Kutáková Department of Mathematics, University of West Bohemia, Pilsen MECAS ESI s.r.o., Pilsen Abstract The paper is focused
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationSimplicial Hyperbolic Surfaces
Simplicial Hyperbolic Surfaces Talk by Ken Bromberg August 21, 2007 1-Lipschitz Surfaces- In this lecture we will discuss geometrically meaningful ways of mapping a surface S into a hyperbolic manifold
More informationSimplicial Objects and Homotopy Groups. J. Wu
Simplicial Objects and Homotopy Groups J. Wu Department of Mathematics, National University of Singapore, Singapore E-mail address: matwuj@nus.edu.sg URL: www.math.nus.edu.sg/~matwujie Partially supported
More information6th Grade Report Card Mathematics Skills: Students Will Know/ Students Will Be Able To...
6th Grade Report Card Mathematics Skills: Students Will Know/ Students Will Be Able To... Report Card Skill: Use ratio reasoning to solve problems a ratio compares two related quantities ratios can be
More informationElementary Combinatorial Topology
Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallée Cedex E-mail address: frederic.meunier@cermics.enpc.fr
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationPROPERTIES OF NATURAL ELEMENT COORDINATES ON ANY POLYHEDRON
PROPRTIS OF NATURAL LMNT COORDINATS ON ANY POLYHDRON P. Milbradt and T. Fröbel Institute of Computer Science in Civil ngineering, Univercity of Hanover, 3067, Hanover, Germany; PH (+49) 5-76-5757; FAX
More informationA new 8-node quadrilateral spline finite element
Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,
More informationOrientation of manifolds - definition*
Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold
More informationarxiv: v1 [cs.cg] 7 Oct 2017
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations Anna Lubiw 1, Zuzana Masárová 2, and Uli Wagner 2 arxiv:1710.02741v1 [cs.cg] 7 Oct 2017 1 School of Computer Science, University
More informationA PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES
PACIFIC JOURNAL OF MATHEMATICS Vol. 46, No. 2, 1973 A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES DAVID BARNETTE A d polytope is defined to be a cz-dimensional set that is the convex hull
More informationSurface Parameterization
Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping
More informationDon t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?
Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical special case?
More informationSpline Functions on Triangulations
Spline Functions on Triangulations MING-JUN LAI AND LARRY L. SCHUMAKER CAMBRIDGE UNIVERSITY PRESS Contents Preface xi Chapter 1. Bivariate Polynomials 1.1. Introduction 1 1.2. Norms of Polynomials on Triangles
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationScientific Computing: Interpolation
Scientific Computing: Interpolation Aleksandar Donev Courant Institute, NYU donev@courant.nyu.edu Course MATH-GA.243 or CSCI-GA.22, Fall 25 October 22nd, 25 A. Donev (Courant Institute) Lecture VIII /22/25
More informationAnalysis of high dimensional data via Topology. Louis Xiang. Oak Ridge National Laboratory. Oak Ridge, Tennessee
Analysis of high dimensional data via Topology Louis Xiang Oak Ridge National Laboratory Oak Ridge, Tennessee Contents Abstract iii 1 Overview 1 2 Data Set 1 3 Simplicial Complex 5 4 Computation of homology
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationSurface Mesh Generation
Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented
More informationApproximating Polygonal Objects by Deformable Smooth Surfaces
Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method
More informationMAT 3271: Selected Solutions to the Assignment 6
Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationManifolds. Chapter X. 44. Locally Euclidean Spaces
Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if
More informationCAT(0)-spaces. Münster, June 22, 2004
CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan
More informationThe goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a
The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a coordinate system and then the measuring of the point with
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationScientific Computing WS 2018/2019. Lecture 12. Jürgen Fuhrmann Lecture 12 Slide 1
Scientific Computing WS 2018/2019 Lecture 12 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 12 Slide 1 Recap For more discussion of mesh generation, see J.R. Shewchuk: Lecture Notes on Delaunay
More informationOn the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane Rom Pinchasi August 2, 214 Abstract We prove the following isoperimetric inequality in R 2, conjectured by Glazyrin
More information1 Affine and Projective Coordinate Notation
CS348a: Computer Graphics Handout #9 Geometric Modeling Original Handout #9 Stanford University Tuesday, 3 November 992 Original Lecture #2: 6 October 992 Topics: Coordinates and Transformations Scribe:
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More information