MANE 4240 & CIVL 4240 Introduction to Finite Elements

Slides:



Advertisements
Similar presentations
Chapter 2 Functions and Graphs.
Advertisements

Solving polynomial Equations in Factored Form MM1A2f: Goal: solve polynomial equations Factor trinomials of the form x2 +bx +c.
Finite Element Method CHAPTER 4: FEM FOR TRUSSES
Finite Element Method CHAPTER 7: FEM FOR 2D SOLIDS
Finite Element Method CHAPTER 9: FEM FOR 3D SOLIDS
Analysis of Algorithms
Visualization Techniques -
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Factoring Polynomials to Find Roots. Factoring a Polynomial to Find Roots Factor 3x x x x – 24 and find all of the roots. Roots: Factors:
Applications of Inclusion-Exclusion: Selected Exercises.
4.1 Introduction to Matrices
Rational Inequalities
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
16.410: Eric Feron / MIT, Spring 2001 Introduction to the Simplex Method to solve Linear Programs Eric Feron Spring 2001.
5 x4. 10 x2 9 x3 10 x9 10 x4 10 x8 9 x2 9 x4.
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Isoparametric Elements Element Stiffness Matrices
Introduction to Finite Elements
MANE 4240 & CIVL 4240 Introduction to Finite Elements Practical considerations in FEM modeling Prof. Suvranu De.
MANE 4240 & CIVL 4240 Introduction to Finite Elements
The Finite Element Method A Practical Course
Some Ideas Behind Finite Element Analysis
Physics Based Modeling II Deformable Bodies Lecture 2 Kwang Hee Ko Gwangju Institute of Science and Technology.
MECH593 Introduction to Finite Element Methods
CST ELEMENT Constant Strain Triangular Element
By S Ziaei-Rad Mechanical Engineering Department, IUT.
EMA 405 Quadrilateral Elements. Introduction Quadrilateral elements are 4-sided, planar elements They can address plane stress, plane strain, or axisymmetric.
Finite element method – basis functions 1 Finite Elements: Basis functions 1-D elements  coordinate transformation  1-D elements  linear basis functions.
Section 4: Implementation of Finite Element Analysis – Other Elements
MANE 4240 & CIVL 4240 Introduction to Finite Elements
ECIV 720 A Advanced Structural Mechanics and Analysis
ECIV 720 A Advanced Structural Mechanics and Analysis
MANE 4240 & CIVL 4240 Introduction to Finite Elements
MANE 4240 & CIVL 4240 Introduction to Finite Elements Introduction to 3D Elasticity Prof. Suvranu De.
FEA Simulations Usually based on energy minimum or virtual work Component of interest is divided into small parts – 1D elements for beam or truss structures.
MANE 4240 & CIVL 4240 Introduction to Finite Elements Introduction to differential equations Prof. Suvranu De.
MANE 4240 & CIVL 4240 Introduction to Finite Elements Numerical Integration in 1D Prof. Suvranu De.
MANE 4240 & CIVL 4240 Introduction to Finite Elements
MANE 4240 & CIVL 4240 Introduction to Finite Elements
MECH300H Introduction to Finite Element Methods
MANE 4240 & CIVL 4240 Introduction to Finite Elements
ECIV 720 A Advanced Structural Mechanics and Analysis Lecture 12: Isoparametric CST Area Coordinates Shape Functions Strain-Displacement Matrix Rayleigh-Ritz.
CHAP 6 FINITE ELEMENTS FOR PLANE SOLIDS
MANE 4240 & CIVL 4240 Introduction to Finite Elements
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Scientific Computing Partial Differential Equations Poisson Equation Calculus of Variations.
CIS V/EE894R/ME894V A Case Study in Computational Science & Engineering HW 5 Repeat the HW associated with the FD LBI except that you will now use.
1 Dr. Scott Schaefer Coons Patches and Gregory Patches.
Chapter 6. Plane Stress / Plane Strain Problems
Polynomial Preserving Gradient Recovery in Finite Element Methods Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202
Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
HEAT TRANSFER FINITE ELEMENT FORMULATION
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 25.
1 Copyright by PZ Bar-Yoseph © Finite Element Methods in Engineering Winter Semester Lecture 7.
The Finite Element Approach to Thermal Analysis Appendix A.
1 CHAP 3 WEIGHTED RESIDUAL AND ENERGY METHOD FOR 1D PROBLEMS FINITE ELEMENT ANALYSIS AND DESIGN Nam-Ho Kim.
AN ILL-BEHAVED ELEMENT
1D OF FINITE ELEMENT METHOD Session 4 – 6
ISOPARAMETRIC ELEMENT
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Introduction to Finite Elements
FEA Simulations Boundary conditions are applied
ECIV 720 A Advanced Structural Mechanics and Analysis
Coons Patches and Gregory Patches
Finite element method.
8-1 Introduction a) Plane Stress y
Factor Using Algebra Tiles
Interpolating Shape Functions
Numerical Analysis Lecture 24.
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

MANE 4240 & CIVL 4240 Introduction to Finite Elements Prof. Suvranu De Higher order elements

Reading assignment: Lecture notes Summary: Properties of shape functions Higher order elements in 1D Higher order triangular elements (using area coordinates) Higher order rectangular elements Lagrange family Serendipity family

Recall that the finite element shape functions need to satisfy the following properties 1. Kronecker delta property Inside an element At node 1, N1=1, N2=N3=…=0, hence Facilitates the imposition of boundary conditions

2. Polynomial completeness Then

Higher order elements in 1D 2-noded (linear) element: x1 x2 x 2 1 In “local” coordinate system (shifted to center of element) x 2 1 a a

3-noded (quadratic) element: x1 x3 x2 x 2 1 3 In “local” coordinate system (shifted to center of element) x 3 2 1 a a

4-noded (cubic) element: x1 x3 x4 x2 x 1 3 4 2 In “local” coordinate system (shifted to center of element) 2a/3 2a/3 2a/3 x 1 3 4 2 a a

Polynomial completeness Convergence rate (displacement) 2 node; k=1; p=2 3 node; k=2; p=3 4 node; k=3; p=4 Recall that the convergence in displacements k=order of complete polynomial

Area coordinates (L1, L2, L3) 1 A=A1+A2+A3 Triangular elements Area coordinates (L1, L2, L3) 1 A=A1+A2+A3 x y 2 3 P A1 A2 A3 Total area of the triangle At any point P(x,y) inside the triangle, we define Note: Only 2 of the three area coordinates are independent, since L1+L2+L3=1

Check that

1 L1= constant P’ y P A1 3 2 x Lines parallel to the base of the triangle are lines of constant ‘L’

x y 2 3 P A1 1 L1= 0 L1= 1 L2= 0 L2= 1 L3= 0 L3= 1 We will develop the shape functions of triangular elements in terms of the area coordinates

For a 3-noded triangle

For a 6-noded triangle L2= 0 L1= 1 1 L2= 1/2 L1= 1/2 6 4 y L1= 0 L2= 1 3 5 2 x L3= 1 L3= 0 L3= 1/2

How to write down the expression for N1? Realize the N1 must be zero along edge 2-3 (i.e., L1=0) and at nodes 4&6 (which lie on L1=1/2) Determine the constant ‘c’ from the condition that N1=1 at node 1 (i.e., L1=1)

For a 10-noded triangle L2= 0 L1= 1 1 L2= 1/3 L1= 2/3 9 4 L1= 1/3 L2= 2/3 8 10 y L1= 0 5 L2= 1 3 7 6 2 x L3= 0 L3= 1/3 L3= 2/3 L3= 1

NOTES: 1. Polynomial completeness Convergence rate (displacement) 3 node; k=1; p=2 6 node; k=2; p=3 10 node; k=3; p=4

2. Integration on triangular domain 1 l1-2 y 3 2 x

3. Computation of derivatives of shape functions: use chain rule e.g., But e.g., for the 6-noded triangle

Rectangular elements Lagrange family Serendipity family Lagrange family 4-noded rectangle In local coordinate system y 2 1 a a b x b 3 4

9-noded quadratic Corner nodes y 5 2 1 a a b 9 8 6 x Midside nodes b 7 3 4 Center node

NOTES: 1. Polynomial completeness Convergence rate (displacement) 4 node; p=2 9 node; p=3 Lagrange shape functions contain higher order terms but miss out lower order terms

4-noded same as Lagrange Serendipity family 4-noded same as Lagrange 8-noded rectangle: how to generate the shape functions? First generate the shape functions of the midside nodes as appropriate products of 1D shape functions, e.g., y 5 2 1 a a b 8 6 x b 7 3 4 Then go to the corner nodes. At each corner node, first assume a bilinear shape function as in a 4-noded element and then modify: “bilinear” shape fn at node 1: actual shape fn at node 1:

8-noded rectangle Midside nodes x y a 1 2 3 4 b 5 6 7 8 Corner nodes

NOTES: 1. Polynomial completeness Convergence rate (displacement) 4 node; p=2 8 node; p=3 12 node; p=4 16 node; p=4 More even distribution of polynomial terms than Lagrange shape functions but ‘p’ cannot exceed 4!