CE 257 Discrete Methods of Structural Analysis
This lecture material is not for sharing/distribution outside of CE257 and CE297 class.
Last meeting
• Time-dependent Problems
• 2D Triangular Elements
CE 257 2
For this meeting
• Single-variable problems in two dimensions Reference for this lecture:
J. N. Reddy, An Introduction to the Finite Element Method (Chapter 8)
CE28 Analytical and Computational
Methods in CEIII 4
Introduction
Introduction
• FE analysis of two dimensional (2D) problems involve the same basic steps as those described for one-dimensional problems.
• The analysis is somewhat complicated by the fact that 2D problems are described by PDEs over geometrically complex regions. The boundary Γ of a two-dimensional domain Ω is, in general, a curve. Therefore, finite elements are simple two dimensional geometric shapes that allow
Introduction
• Thus, in 2D problems we not only seek an approximate solution to a given problem on a domain, but we also approximate the domain by a suitable finite element mesh.
• Consequently, we will have approximation errors due to the approximation solution as well as discretization errors due to the approximation of the domain in the FE analysis of 2D problems.
CE 257 6
Introduction
• FE mesh: triangles, rectangles/quadrilaterals
CE28 Analytical and Computational
Methods in CEIII 8
Boundary Value Problems
Boundary Value Problems
The model equation:
• Consider finding the solution 𝑢(𝑥, 𝑦) of the 2𝑛𝑑 order PDE
• for given data 𝑎𝑖𝑗 , 𝑎00, and 𝑓, and specified BCs.
Boundary Value Problems
• As a special case, we can obtain the Poisson equation from the model DE by setting 𝑎11 = 𝑎22 = 𝑘(𝑥, 𝑦) and 𝑎12 = 𝑎21 = 0
• where ∇ is the gradient operator.
CE 257 10
Boundary Value Problems
In Cartesian coordinate system:
Boundary Value Problems
Major steps in developing the FE model of model DE:
CE 257 12
F. E. Discretization
FE Discretization
• The representation of a given region by a set of elements (i.e. discretization or mesh generation) is an important step in FE analysis.
• The choice of element type, number of elements, and density of elements, depends on the geometry of the domain, the problem to be analyzed, and the degree of accuracy desired.
• In general, the analyst is guided by his or her technical background, insight into the physics of the problem being modeled (e.g. qualitative understanding of the solution) and experience with the FE modeling.
CE 257 14
FE Discretization
• The general rules of mesh generation for FE formulation include:
CE28 Analytical and Computational
Methods in CEIII 16
Weak Form
Weak Form
• First step is to multiply the DE with a weight function 𝑤, which is assumed to be differentiable once with respect to 𝑥 and 𝑦 and then integrate the equation over the element domain Ω𝑒 .
• where
Weak Form
• Second step: IBP to distribute the differentiation among 𝑢 and 𝑤 equally.
• We will use the following identities:
CE 257 18
Weak Form
• Next we use the component form of the gradient (or divergence) theorem
• where 𝑛𝑥 and 𝑛𝑦 are the components (i.e. the direction cosines) of the unit normal vector
Weak Form
• We obtain
Let 𝑞𝑛 be boundary expression:
CE 257 20
Weak Form
• By definition, 𝑞𝑛 is taken positive outward from the surface as we move counterclockwise along the boundary Γ𝑒.
Weak Form
CE 257 22
Weak Form
• Rewriting the weak form:
CE28 Analytical and Computational
Methods in CEIII 24
Finite Element Model
Finite Element Model
• The weak form requires that the approximation chosen for 𝑢 should be atleast linear in both 𝑥 and 𝑦 so that there are no terms that are identically zero.
• Since the primary variable is simply the function itself, the Lagrange family of interpolation functions is admissible.
• Approximation of 𝑢 over the typical finite element Ω𝑒:
Finite Element Model
• where
Lagrange interpolation property
CE 257 26
Finite Element Model
• Substituting the FE approximation for 𝑢 into the weak form, we obtain
Finite Element Model
CE 257 28
or where
Finite Element Model
• In matrix notation
• where
CE28 Analytical and Computational
Methods in CEIII 30
Interpolation Functions
Derivation of Interpolation functions
• The FE approximation 𝑢ℎ𝑒(𝑥, 𝑦) over an element Ω𝑒 must satisfy the following conditions in order for the approximate solution to converge to the true solution:
1. 𝑢ℎ𝑒 must be continuous as required in the weak form of the problem (i.e. all terms in the weak form are represented as nonzero values)
2. The polynomial used to represent 𝑢ℎ𝑒 must be complete (i.e. all terms, beginning with a constant
Derivation of Interpolation functions
• The FE approximation 𝑢ℎ𝑒(𝑥, 𝑦) over an element Ω𝑒 must satisfy the following conditions in order for the approximate solution to converge to the true solution:
3. All terms in the polynomial should be linearly independent
CE 257 32
Triangular element
• Complete linear polynomial in 𝑥 and 𝑦 in Ω𝑒
• We can denote:
Triangular element
• Approximation:
CE 257 34
Triangular element
Triangular element
• Shapes to avoid:
CE 257 36
Triangular element
• inverting coefficient matrix
Triangular element
• Substituting 𝑐𝑖 back to the approximation for 𝑢 ∶
• where:
CE 257 38
Triangular element
• Interpolation functions:
Triangular element
• Properties of interpolation functions:
CE 257 40
Triangular element
• Representation of continuous function
Linear Rectangular Element
• Consider the complete polynomial
• which contains four linearly independent terms and is linear in 𝑥 and 𝑦, with a bilinear term in 𝑥 and 𝑦. This polynomial requires an element with four nodes.
CE 257 42
Linear Rectangular Element
• Incompatible four node triangular elements
Linear Rectangular Element
• Using a rectangular element with sides 𝑎 and 𝑏, we choose a local coordinate system, (𝑥,ҧ 𝑦) toത derive the interpolation functions.
CE 257 44
Linear Rectangular Element
Linear Rectangular Element
CE 257 46
Solving for 𝑐
𝑖:
Linear Rectangular Element
• Simplifying..
• where
Linear Rectangular Element
• Interpolation functions:
CE 257 48
Linear Rectangular Element
• Properties of interpolation functions:
Linear Rectangular Element
• Quadratic Elements (personal reading)
CE 257 50
Evaluation of Matrices and Vectors
Evaluation of Element Matrices and Vectors
• We rewrite [𝐾𝑒] as the sum of the five basic matrices
CE 257 52
Evaluation of Element Matrices and Vectors
• Element Matrices of a Linear Triangular Element (for a Poisson problem)
Evaluation of Element Matrices and Vectors
• Element Matrices of a Linear Rectangular Element
CE 257 54
Evaluation of Element Matrices and Vectors
• Element Matrices of a Linear Rectangular Element
Evaluation of Element Matrices and Vectors
CE 257 56
Evaluation of Boundary Integrals
• Boundary Integral
CE28 Analytical and Computational
Methods in CEIII 58
Assembly of Element Equations
Assembly of Element Equations
Assembly of Element Equations
• In matrix form:
CE 257 60
Postcomputations
Postcomputations
• The finite element solution at any point (𝑥, 𝑦) in an element delta is given by
• and it derivatives are computed as
CE 257 62
Postcomputations
• The derivatives will not be continuous at interelement boundaries because continuity of derivatives is not imposed during the assembly procedure.
• The weak form of the equations suggests that the primary variable is 𝑢, which is to be carried as the nodal variable.
CE28 Analytical and Computational
Methods in CEIII 64
Finite Element Method
References:
1. J. Fish, T. Belytschko, A First Course in Finite Elements 2. J. N. Reddy, An Introduction to the Finite Element
Method
3. O.C. Zienkiewicz, R.L. Taylor, J.Z. Zhu, The Finite Element Method, Its Basis & Fundamentals
4. K-J. Bathe, Finite Element Procedures
5. K. Leet, C-M., Uang, A.M. Gilbert, Fundamentals of Structural Analysis
This lecture
• Single-variable problems in two dimensions
Reference for this lecture:
J. N. Reddy, An Introduction to the Finite Element Method (Chapter 8)
CE 257 66
This lecture material is not for sharing/distribution outside of CE257 and CE297 class.