Introduction to the Finite Element Method (FEM)

Similar documents
The Basics of FEA Procedure

Stress Recovery 28 1

Finite Elements for 2 D Problems

To add fractions we rewrite the fractions with a common denominator then add the numerators. = +

the points are called control points approximating curve

Back to Elements - Tetrahedra vs. Hexahedra

CAE -Finite Element Method

Partial Fractions. (x 1)(x 2 + 1)

Solving Quadratic Equations by Factoring

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver

The elements used in commercial codes can be classified in two basic categories:

Finite Element Formulation for Plates - Handout 3 -

November 16, Interpolation, Extrapolation & Polynomial Approximation

Finite Element Method

Sample Problems. Practice Problems

CAE -Finite Element Method

19.6. Finding a Particular Integral. Introduction. Prerequisites. Learning Outcomes. Learning Style

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

1.7. Partial Fractions Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).

1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

INTRODUCTION TO THE FINITE ELEMENT METHOD

Factoring Quadratic Expressions

Equations, Inequalities & Partial Fractions

Factoring and Applications

Applications to Data Smoothing and Image Processing I

3.6. Partial Fractions. Introduction. Prerequisites. Learning Outcomes

Factoring Trinomials: The ac Method

Question 2: How do you solve a matrix equation using the matrix inverse?

Integration of a fin experiment into the undergraduate heat transfer laboratory

is identically equal to x 2 +3x +2

1 Lecture: Integration of rational functions by decomposition

The Method of Partial Fractions Math 121 Calculus II Spring 2015

Integrals of Rational Functions

Figure 2.1: Center of mass of four points.

3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

An Overview of the Finite Element Analysis

SOLVING POLYNOMIAL EQUATIONS

3. INNER PRODUCT SPACES

(Refer Slide Time: 1:42)

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10

LS.6 Solution Matrices

Module 1 : Conduction. Lecture 5 : 1D conduction example problems. 2D conduction

Systems of Linear Equations

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

LINEAR EQUATIONS IN TWO VARIABLES

Finite cloud method: a true meshless technique based on a xed reproducing kernel approximation

INTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).

FINITE ELEMENT : MATRIX FORMULATION. Georges Cailletaud Ecole des Mines de Paris, Centre des Matériaux UMR CNRS 7633

Section 6.1 Factoring Expressions

Finite Element Formulation for Beams - Handout 2 -

Determinants can be used to solve a linear system of equations using Cramer s Rule.

Solving Systems of Linear Equations

College Algebra - MAT 161 Page: 1 Copyright 2009 Killoran

Modelling unilateral frictionless contact using. the null-space method and cubic B-Spline. interpolation

2.3. Finding polynomial functions. An Introduction:

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

Trend and Seasonal Components

expression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.

Partial Fractions Examples

Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder).

Solving Quadratic Equations

Wentzville School District Algebra 1: Unit 8 Stage 1 Desired Results

2013 MBA Jump Start Program

Piecewise Cubic Splines

NSM100 Introduction to Algebra Chapter 5 Notes Factoring

DRAFT. Algebra 1 EOC Item Specifications

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Polynomial Operations and Factoring

Factoring Polynomials and Solving Quadratic Equations

Math 0980 Chapter Objectives. Chapter 1: Introduction to Algebra: The Integers.

FUNDAMENTAL FINITE ELEMENT ANALYSIS AND APPLICATIONS

Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization

8. Linear least-squares

1 Shapes of Cubic Functions

Graphic Designing with Transformed Functions

FACTORING QUADRATIC EQUATIONS

Linear Equations ! $ & " % & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Finite Element Method (ENGC 6321) Syllabus. Second Semester

BEGINNING ALGEBRA ACKNOWLEDMENTS

Polynomials. Key Terms. quadratic equation parabola conjugates trinomial. polynomial coefficient degree monomial binomial GCF

ACMSM - Computer Applications in Solids Mechanics

0.4 FACTORING POLYNOMIALS

6.1 Add & Subtract Polynomial Expression & Functions

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

Sample Problems. Practice Problems

5 Numerical Differentiation

UNCORRECTED PAGE PROOFS

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Solution of Linear Systems

is identically equal to x 2 +3x +2

Polynomials and Quadratics

Sect Solving Equations Using the Zero Product Rule

Transcription:

Introduction to the Finite Element Method (FEM) ecture First and Second Order One Dimensional Shape Functions Dr. J. Dean

Discretisation Consider the temperature distribution along the one-dimensional fin in Fig.1. Figure 1: Depiction of a piecewise approximation to a continuous function A one-dimensional continuous temperature distribution with an infinite number of unknowns is shown in (a). The fin is discretised in (b) i.e. divided into 4 subdomains (or elements). The nodes are numbered consecutively from left to right, as are the elements. The elements are first order elements; the interpolation scheme between the nodes is therefore linear. Note that there are only 5 nodes for this system, since the internal nodes are shared between the elements. Since we are only solving for temperature, there are only 5 degrees of freedom in this model of the continuous system. It should be clear that a better approximation for T(x) would be obtained if the number of elements was increased (i.e. if the element lengths were reduced). It is also apparent that the nodes should be placed closer together in regions where the temperature (or any other unknown solution) changes rapidly. It is useful also to place a node wherever a step change in temperature is expected and where a numerical value of the temperature is needed. It is good practice to continue to increase the number of nodes until a converged solution is reached. In (c), the fin has been divided into two subdomains elements 1 and. However, in this instance we have chosen to use a second order (quadratic) element. These elements contain midside nodes as shown, and the interpolation between the nodes is quadratic which permits a much closer approximation to the real system. For this model system there are still just 5 degrees of freedom. However, the analysis takes longer for (c) than it does for (b) because the quadratic interpolation (which calculates the temperature at locations between the nodes) is more demanding than the corresponding linear case. 1 (There is often a trade-off between a high number of first order elements requiring little computation and a smaller number of second order elements requiring more heavy computation to be made, which affects both the analysis time and the solution accuracy. The choice depends to a large extent on the problem being solved.) 1 For a system with only 5 degrees of freedom the difference would be imperceptible using modern desktop machines. This would not be the case for large systems containing hundreds of thousands of degrees of freedom. 1

Shape Functions We can use (for instance) the direct stiffness method to compute degrees of freedom at the element nodes. However, we are also interested in the value of the solution at positions inside the element. To calculate values at positions other than the nodes we interpolate between the nodes using shape functions. A one-dimensional element with length is shown in Fig.. It has two nodes, one at each end, denoted i and j, and known nodal temperatures T i and T j. We can deduce automatically that the element is first order (linear) since it contains no midside nodes. Figure : One dimensional linear element with temperature degrees of freedom We need to derive a function to compute values of the temperature at locations between the nodes. This interpolation function is called the shape function. We demonstrate its derivation for a 1-dimensional linear element here. Note that, for linear elements, the polynomial inerpolation function is first order. If the element was second order, the polynomial function would be second order (quadratic), and so on. Since the element is first order, the temperature varies linearly between the nodes and the equation for T is: T(x) = a + bx (1)

We can therefore write: T i = a + bx i () T j = a + bx j (3) which are simultaneous. To determine the coefficients a and b: T i a X i = b (4) T j a X j = b (5) T i a X i = T j a X j (6) (T i a)x j = T j a X i (7) T i X j ax j = T j X i ax i (8) T i X j T j X i = a X j X i (9) T i X j T j X i X j X i = a (10) T i X j T j X i = a (11) and T i bx i = a (1) T j bx j = a (13) T i bx i = T j bx j (14) bx j bx i = T j T i (15) b X j X i = T j T i (16) b = T j T i X j X i b = T j T i (17) (18) Substitution of Eqns.11 and 18 into Eqn.1 yields: T(x) = T ix j T j X i + T j T i x (19) T(x) = T ix j T j X i + T jx T i x (0) 3

T(x) = T ix j T jx i + T jx T ix (1) T(x) = T ix j T ix + T jx T jx i () T(x) = T i X j x + T j x X i (3) It should be clear from Eqn.3 that the nodal temperature values are multiplied by linear functions of x the shape functions. The functions are denoted by S with a subscript to indicate the node with which a specific shape function is associated. In the case presented: S i = X j x (4) Draw linear shape functions S j = x X i (5) And Eqn.3 becomes T(x) = S i T i + S j T j (6) In matrix form T x e = [S i S j ] T i T j (7) For the case shown in Fig.3, calculate Tat x = 3.3 T(x = 3.3) = T i X j x + T j x X i T(x = 3.3) = 50 5 3.3 + 54 3.3 3 T(x = 3.3) = 50.6 Figure 3: 1-dimensional linear element with known nodal temperatures and positions 4

From inspection of Eqn.6 we can deduce that each shape function has a value of 1 at its own node and a value of zero at the other nodes. The sum of the shape functions sums to one. The shape functions are also first order, just as the original polynomial was. The shape functions would have been quadratic if the original polynomial has been quadratic. A continuous, piecewise smooth equation for the one dimensional fin first shown in Fig.1 can be constructed by connecting the linear element equations. We know that the temperature at any point in any element can be found from the nodal temperatures T i and the shape functions, S i. For the following system: T x e = S i T i + S j T j X i x X j (8) Node Element # i j 1 1 3 3 3 4 4 4 5 T 1 x = S 1 1 T 1 + S 1 T T x = S T + S 3 T 3 T 3 x = S 3 3 T 3 + S 3 4 T 4 T 4 x = S 4 4 T 4 + S 4 5 T 5 S 1 1 = X x X X 1 S 1 = x X 1 X X 1 X 1 x X (9) S = X 3 x X 3 X S 3 = x X X 3 X X x X 3 (30) S 3 3 = X 4 x X 4 X 3 S 4 3 = x X 3 X 4 X 3 X 3 x X 4 (31) S 4 4 = X 5 x X 5 X 4 S 4 3 = x X 4 X 5 X 4 X 4 x X 5 (3) S 1 S, S 3 S 3 3 and S 4 3 S 4 4 The temperature gradient through the an individual element dte dx derivative of Eqn.33 can be found from the T e x = T i X j x + T j x X i (33) T x e = X jt i T x e = xt j xt i xt i + xt j + X jt i + X it j X it j (34) (35) T x e = x T j T i + 1 X jt i X i T j (36) 5

such that dt x e = T j T i dx (37) We can check that our shape functions are correct by knowing that the shape function derivatives sum to zero. 1-Dimensional Quadratic Elements A one-dimensional quadratic element is shown in Fig.4. We can deduce immediately that the element order is greater than one because the interpolation between the nodes in nonlinear. We can determine from inspection that the element is quadratic (second order) because there s a midside node. We know therefore that the function approximating the solution is a second order polynomial: T x e = a + bx + cx (38) x The shape functions S i can be determined by solving Eqn.38 using known T i at known X i to give: T x e = S i T i + S j T j + S k T k j (39) S i = (x X k) x X j (40) S j = 4 (x X i)(x X k ) (41) S k = (x X i) x X j (4) 6

Using the quadratic shape functions for a single element (Eqns.40-4), we can assemble a corresponding set of equations for a larger system: Nodes Element # i j k 1 i j k Nodes Element # i j k k m n T x 1 = S i 1 S k 1 T i S 1 j T k Tj T k T x = [S k S m S n ] T m Tn T x 1 = S i 1 T i + S j 1 T j + S k 1 T k (43) S i 1 = (x X k) x X j S j 1 = 4 (x X i)(x X k ) S k 1 = (x X i) x X j T x = S k T k + S m T m + S n T n (44) S k = (x X n)(x X m ) S m = 4 (x X k)(x X n ) S n = (x X k)(x X m ) 7

The element shape functions are stored within the element in commercial FE codes. The positions X i are generated (and stored) when the mesh is created. Once the nodal degrees of freedom are known, the solution at any point between the nodes can be calculated using the (stored) element shape functions and the (known) nodal positions. The nodal degrees of freedom are calculated using a method such as that shown previously in lecture 1. For the cases presented above, simple 1-dimensional elements were most appropriate, but for many practical applications we may encounter more complex - and 3-dimensional geometry. A suitable set of element types are shown in Fig.4 encompassing a range of geometry and element order. A meshed geometry is shown in Fig.5. Figure 4: Example element types Figure 5: An exhaust manifold discretised (meshed) using 3-dimensional, quadratic brick elements, enabling the geometrical curvature to be captured 8

Coordinate Systems Solution fields (such as displacement fields in solid mechanics) often require integrals of the following kind to be evaluated: X j X j S i (x)s j (x)dx or S X i i (x)dx X i (45) Note that the superscript in Eqn.45 denotes a power now (and not an element label). These integrals can be simplified to make the integration procedures more efficient by deriving new shape functions defined relative to a local (element level) coordinate system. For instance, we have so far derived our one-dimensional linear shape functions using a global coordinate system with its origin at O Fig.6. These shape functions were: S i (x) = X j x (46) S j (x) = x X i (47) x s Figure 6: Representation of a single linear element in global, local and natural frames of reference We wish now to derive the shape functions in the local coordinate reference frame with the origin at X i - shown also in Fig.6. In the new reference frame the position along the element given previously by x is now given by X i + s. We can rewrite the shape functions in Eqns.46 and 47 using the new reference frame by substitution such that: 9

S i (s) = X j (X i +s) S j (s) = (X i+s) X i = 1 s = s (48) (49) and X j X j S i (x)s j (x)dx or S X i i (x)dx X i (50) becomes S i (s)s j (s)ds 0 or S i (s)ds 0 (51) where the limits of integration are easier to deal with. However, they can be simplified further by using a non-dimensional natural coordinate system. A natural coordinate system is shown in Fig.6. A coordinate at the centre of the element is specified. From this reference frame, the shape functions are: S i (ξ) = 1 (1 ξ) (5) S j (ξ) = 1 (1 + ξ) (53) To find these, we substitute x in Eqns.46 and 47 with x = X i + + ξ and note that = S i (ξ) = X j x S j (ξ) = x X i = X j X i + +ξ = X i+ +ξ X i = X j X i ξ = 1 ξ = 1 (1 ξ) (54) = X i + + ξ X i = 1 + ξ = 1 (1 + ξ) (55) Recall that the shape functions are equal to one at their respective nodes and 0 at the other nodes i.e: S i ( 1) = 1 (1 ξ) = 1 S i (1) = 1 (1 ξ) = 0 S j ( 1) = 1 (1 ξ) = 1 S j (1) = 1 (1 ξ) = 0 The integrals become: 1 1 S i (ξ)s j (ξ)dξ or 1 1 S i (ξ)dξ (56) 10

where the limits of integration are -1 and +1. Integrals of this type can be solved very efficiently using, for instance, the Gauss-egendre method. 11