An Introduction to Nonlinear Finite Element Analysis
This page intentionally left blank
J. N. REDDY Distinguished P...
531 downloads
3355 Views
7MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
An Introduction to Nonlinear Finite Element Analysis
This page intentionally left blank
J. N. REDDY Distinguished Professor Department of Mechanical Engineering Texas A&M University, College Station TX 77843–3123, USA
An Introduction to Nonlinear Finite Element Analysis
1
3
Great Clarendon Street, Oxford OX2 6DP It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Cape Town Dar es Salaam Hong Kong Karachi Kuala Lumpur Madrid Melbourne Mexico City Nairobi New Delhi Shanghai Taipei Toronto With offices in Argentina Austria Brazil Chile Czech Republic France Greece Guatemala Hungary Italy Japan Poland Portugal Singapore South Korea Switzerland Thailand Turkey Ukraine Vietnam Oxford is a registered trade mark of Oxford University Press in the UK and in certain other countries Published in the United States by Oxford University Press Inc., New York Oxford University Press, 2004 The moral rights of the author have been asserted Database right Oxford University Press (maker) First published 2004 Reprinted 2005 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organization. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above You must not circulate this book in any other binding or cover and you must impose this same condition on any acquirer A catalogue record for this title is available from the British Library Library of Congress Cataloging in Publication Data (Data available) Typeset by the author using TEX Printed in Great Britain on acid-free paper by T.J. International Ltd., Padstow, Cornwall ISBN 0-19-852529-X 10 9 8 7 6 5 4 3 2
978-0-19-852529-5
To To my beloved teacher Professor John Tinsley Oden
This page intentionally left blank
About the Author
J. N. Reddy is Distinguished Professor and the Holder of Oscar S. Wyatt Endowed Chair in the Department of Mechanical Engineering at Texas A&M University, College Station, Texas. Prior to the current position, he was the Clifton C. Garvin Professor in the Department of Engineering Science and Mechanics at Virginia Polytechnic Institute and State University (VPI&SU), Blacksburg, Virginia. Dr. Reddy is internationally known for his contributions to theoretical and applied mechanics and computational mechanics. He is the author of over 300 journal papers and dozen other books, including Introduction to the Finite Element Method (Second Edition), McGraw-Hill, l993; Theory and Analysis of Elastic Plates, Taylor & Francis, 1999; Energy Principles and Variational Methods in Applied Mechanics (Second Edition), John Wiley, 2002; Mechanics of Laminated Plates and Shells: Theory and Analysis, (second Edition) CRC Press, 2004; An Introduction to the Mathematical Theory of Finite Elements (coauthored with J. T. Oden), John Wiley, l976; Variational Methods in Theoretical Mechanics (coauthored with J. T. Oden), Springer—Verlag, 1976; The Finite Element Method in Heat Transfer and Fluid Dynamics (Second Edition; coauthored with D. K. Gartling), CRC Press, 2001; and Professor Reddy is the recipient of the Walter L. Huber Civil Engineering Research Prize of the American Society of Civil Engineers (ASCE), the Worcester Reed Warner Medal and the Charles Russ Richards Memorial Award of the American Society of Mechanical Engineers (ASME), the 1997 Archie Higdon Distinguished Educator Award from the American Society of Engineering Education (ASEE), the 1998 Nathan M. Newmark Medal from the American Society of Civil Engineers, the 2000 Excellence in the Field of Composites from the American Society of Composites, the 2000 Faculty Distinguished Achievement Award for Research and the 2003 Bush Excellence Award for Faculty in International Research from Texas A&M University, and the 2003 Computational Solid Mechanics Award from the U.S. Association of Computational Mechanics (USACM). Dr. Reddy is a Fellow of ASCE, ASME, the American Academy of Mechanics (AAM), the American Society of Composites, the U.S. Association of Computational Mechanics, the International Association of Computational Mechanics (IACM), and the Aeronautical Society of India (ASI). Professor Reddy is the Editor-inChief of Mechanics of Advanced Materials and Structures, International Journal of Computational Engineering Science and International Journal of Structural Stability and Dynamics, and he serves on the editorial boards of over two dozen other journals, including International Journal for Numerical Methods in Engineering, Computer Methods in Applied Mechanics and Engineering, and International Journal of NonLinear Mechanics.
This page intentionally left blank
ix
Contents Preface
xvii
1 Introduction 1.1 Mathematical Models 1.2 Numerical Simulations 1.3 The Finite Element Method 1.4 Nonlinear Analysis 1.4.1 Introduction 1.4.2 ClassiÞcation of Nonlinearities 1.5 The Big Picture References
1 1 3 5 7 7 7 11 12
2 The Finite Element Method: A Review 2.1 Introduction 2.2 One-Dimensional Problems 2.2.1 Governing Differential Equation 2.2.2 Finite Element Approximation 2.2.3 Derivation of the Weak Form 2.2.4 Interpolation Functions 2.2.5 Finite Element Model 2.3 Two-Dimensional Problems 2.3.1 Governing Differential Equation 2.3.2 Finite Element Approximation 2.3.3 Weak Formulation 2.3.4 Finite Element Model 2.3.5 Interpolation Functions 2.3.6 Assembly of Elements 2.4 Library of Two-Dimensional Finite Elements 2.4.1 Introduction 2.4.2 Triangular Elements 2.4.3 Rectangular Elements 2.5 Numerical Integration 2.5.1 Preliminary Comments 2.5.2 Coordinate Transformations 2.5.3 Integration Over a Master Rectangular Element 2.5.4 Integration Over a Master Triangular Element
13 13 13 13 14 16 18 22 24 24 24 26 27 28 33 36 36 37 38 40 40 41 44 45
x
2.6 Computer Implementation 2.6.1 General Comments 2.6.2 One-Dimensional Problems 2.6.3 Two-Dimensional Problems 2.7 Closure Problems References 3 Heat Transfer and Other Field Problems in One Dimension 3.1 Model Differential Equation 3.2 Weak Formulation 3.3 Finite Element Model 3.4 Solution Procedures 3.4.1 General Comments 3.4.2 Direct Iteration Procedure 3.4.3 Newton’s Iteration Procedure 3.5 Computer Implementation 3.5.1 Introduction 3.5.2 Preprocessor Unit 3.5.3 Processor Unit 3.6 Closing Remarks Problems References 4 Nonlinear Bending of Straight Beams 4.1 Introduction 4.2 Euler—Bernoulli Beams 4.2.1 Basic Assumptions 4.2.2 Displacement Field and Strains 4.2.3 Weak Forms 4.2.4 Finite Element Model 4.2.5 Iterative Solutions of Nonlinear Equations 4.2.6 Load Increments 4.2.7 Membrane Locking 4.2.8 Computer Implementation 4.3 Timoshenko Beams 4.3.1 Displacement Field and Strains 4.3.2 Weak Forms 4.3.3 General Finite Element Model 4.3.4 Shear and Membrane Locking 4.3.5 Tangent Stiffness Matrix
46 46 48 52 53 57 59 61 61 62 62 64 64 65 68 73 73 73 76 82 82 85 87 87 88 88 88 89 95 97 100 101 102 110 110 111 113 115 117
xi
Problems References
124 126
5 Heat Transfer and Other Fields Problems in Two Dimensions 127 5.1 Model Equation 127 5.2 Weak Form 128 5.3 Finite Element Model 129 5.4 Solution Procedures 131 5.4.1 Direct Iteration 131 5.4.2 Newton—Raphson Iteration 131 5.5 Computer Implementation 132 5.5.1 Introduction 132 5.5.2 Numerical Integration 133 5.5.3 Element Calculations 135 Problems 139 References 140 6 Nonlinear Bending of Elastic Plates 6.1 Introduction 6.2 Classical Plate Theory 6.2.1 Assumptions of the Kinematics 6.2.2 Displacement Field and Strains 6.3 Variational Formulation of CPT 6.3.1 Virtual Work 6.3.2 Weak Forms 6.3.3 Equilibrium Equations 6.3.4 Boundary Conditions 6.3.5 Stress Resultant—Deßection Relations 6.4 Finite Element Models of CPT 6.4.1 General Formulation 6.4.2 Tangent Stiffness Coefficients 6.4.3 Some Plate Finite Elements 6.5 Computer Implementation Aspects and Numerical Results of CPT Elements 6.5.1 Computer Implementation 6.5.2 Results of Linear Analysis 6.5.3 Results of Nonlinear Analysis 6.6 First—Order Shear Deformation Plate Theory 6.6.1 Introduction 6.6.2 Displacement Field 6.6.3 Weak Formulation
141 141 141 141 142 144 144 147 148 149 152 153 153 157 161 164 164 166 168 173 173 173 174
xii
6.7 Finite Element Models of FSDT 6.7.1 Virtual Work Statements 6.7.2 Finite Element Model 6.7.3 Tangent Stiffness Coefficients 6.7.4 Shear and Membrane Locking 6.8 Computer Implementation and Numerical Results of FSDT Elements 6.8.1 Computer Implementation 6.8.2 Results of Linear Analysis 6.8.3 Results of Nonlinear Analysis 6.9 Theory of Doubly-Curved Shells 6.9.1 Introduction 6.9.2 Geometric Description 6.9.3 Strain—Displacement Relations 6.9.4 Stress Resultants 6.9.5 Equations of Motion 6.10 Finite Element Analysis of Shells 6.10.1 Weak Forms 6.10.2 Finite Element Model 6.10.3 Linear Results 6.10.4 Nonlinear Results Problems References 7 Flows of Viscous Incompressible Fluids 7.1 Introduction 7.2 Governing Equations 7.2.1 Introduction 7.2.2 Conservation of Mass 7.2.3 Conservation of Momenta 7.2.4 Conservation of Energy 7.2.5 Constitutive Equations 7.2.6 Boundary Conditions 7.3 Governing Equations in Terms of Primitive Variables 7.3.1 Vector Form 7.3.2 Cartesian Component Form 7.4 Velocity—Pressure Finite Element Model 7.4.1 Weak Form 7.4.2 Finite Element Model 7.5 Penalty Finite Element Models 7.5.1 Introduction 7.5.2 Penalty Function Method
177 177 178 182 184 184 184 185 189 196 196 197 201 202 205 206 206 207 209 217 222 225 229 229 230 230 231 232 232 233 234 235 235 236 237 237 239 241 241 242
xiii
7.5.3 Reduced Integration Penalty Model 7.5.4 Consistent Penalty Model 7.6 Computational Aspects 7.6.1 Properties of the Matrix Equations 7.6.2 Choice of Elements 7.6.3 Evaluation of Element Matrices in Penalty Models 7.6.4 Post-Computation of Stresses 7.7 Computer Implementation 7.7.1 Mixed Model 7.7.2 Penalty Model 7.8 Numerical Examples 7.8.1 Preliminary Comments 7.8.2 Fluid Squeezed Between Parallel Plates 7.8.3 Flow of a Viscous Lubricant in a Slider Bearing 7.8.4 Wall-Driven Cavity Flow 7.8.5 Backward-Facing Step 7.9 Least-Squares Finite Element Models 7.9.1 Introduction 7.9.2 Finite Element Model 7.9.3 Computational Aspects 7.9.4 Numerical Examples Problems References
244 245 246 246 247 249 250 251 251 254 254 254 255 258 261 267 269 269 272 274 275 283 283
8 Nonlinear Analysis of Time—Dependent Problems 8.1 Introduction
287 287
8.2 Time Approximations 8.2.1 Introduction 8.2.2 Parabolic Equations 8.2.3 Hyperbolic Equations 8.3 Stability and Accuracy 8.3.1 Preliminary Comments 8.3.2 Stability Criteria 8.4 Transient Analysis of Nonlinear Problems 8.4.1 Introduction 8.4.2 Heat Transfer 8.4.3 Flows of Viscous Incompressible Fluids 8.4.4 Plate Bending (FSDT) 8.5 Computer Implementation
288 288 289 292 295 295 296 297 297 297 298 300 304
xiv
8.6 Numerical Examples 8.6.1 Linear Problems 8.6.2 Nonlinear Problems Problems References 9 Finite Element Formulations of Solid Continua 9.1 Introduction 9.1.1 Background 9.1.2 Descriptions of Motion 9.2 Strain and Stress Measures 9.2.1 Deformation Gradient Tensor 9.2.2 Green and Almansi Strain Tensors 9.2.3 Polar Decomposition 9.2.4 Stress Tensors 9.2.5 Energetically—Conjugate Stresses and Strains 9.3 Strain and Stress Measures Between ConÞgurations 9.3.1 Notation 9.3.2 Conservation of Mass 9.3.3 Green Strain Tensors for Various ConÞgurations 9.3.4 Euler Strain Tensor 9.3.5 Relationships Between Various Stress Tensors 9.4 Constitutive Equations 9.5 Total Lagrangian and Updated Lagrangian Formulations of Continua 9.5.1 Principle of Virtual Displacements 9.5.2 Total Lagrangian Formulation 9.5.3 Updated Lagrangian Formulation 9.6 Finite Element Models of Two-Dimensional Continua 9.6.1 Introduction 9.6.2 Total Lagrangian Formulation 9.6.3 Updated Lagrangian Formulation 9.6.4 Computer Implementation 9.6.5 Numerical Results 9.7 Shell Finite Elements 9.7.1 Introduction 9.7.2 Incremental Equations of Motion 9.7.3 Finite Element Models of a Continuum 9.7.4 Shell Finite Element 9.7.5 Numerical Examples Problems References
307 307 314 323 325 327 327 327 328 329 329 331 334 334 335 337 337 339 340 342 343 346 347 347 348 350 353 353 353 360 361 361 369 369 369 370 372 378 381 387
xv
10 Material Nonlinearities and Coupled Problems 10.1 Introduction 10.2 Nonlinear Elastic Problems 10.3 Small Deformation Theory of Plasticity 10.3.1 Introduction 10.3.2 Ideal Plasticity 10.3.3 Strain Hardening Plasticity 10.3.4 Elastic—Plastic Analysis of a Bar 10.4 Non-Newtonian Fluids 10.4.1 Introduction 10.4.2 Governing Equations in Cylindrical Coordinates 10.4.3 Power-Law Fluids 10.4.4 White—Metzner Fluids 10.4.5 Numerical Examples 10.5 Coupled Fluid Flow and Heat Transfer 10.5.1 Finite Element Models 10.5.2 Numerical Examples References
389 389 390 391 391 392 393 395 404 404 405 407 409 412 417 417 419 423
Appendix A1: Solution Procedures for Linear Algebraic Equations A1.1 Introduction A1.2 Direct Methods A1.2.1 Preliminary Comments A1.2.2 Symmetric Solver A1.2.3 Unsymmetric Solver A1.3 Iterative Methods A1.3.1 General Comments A1.3.2 Solution Algorithms References
425 425 427 427 428 430 430 430 432 433
Appendix A2: Solution Procedures for Nonlinear Algebraic Equations A2.1 Introduction A2.2 Picard Iteration Method A2.3 Newton—Raphson Iteration Method A2.4 Riks and ModiÞed Riks Schemes References
439 439 440 444 448 457
Subject Index
459
This page intentionally left blank
Preface
The objective of this book is to present the theory and computer implementation of the Þnite element method as applied to simple nonlinear problems of heat transfer and similar Þeld problems, ßuid mechanics, and solid mechanics. Both geometric as well as material nonlinearities are considered, and static and transient (i.e. time-dependent) responses are studied. The guiding principle in writing the book was to make the presentation suitable for (a) adoption as a text book for a Þrst course on nonlinear Þnite element analysis (or for a second course following an introductory course on the Þnite element method), and (b) for use by engineers and scientists from various disciplines for self study and practice. There exist a number of books on nonlinear Þnite elements. Most of these books contain a good coverage of the topics of structural mechanics, and few address topics of ßuid dynamics and heat transfer. While these books serve as good references to engineers or scientists who are already familiar with the subject but wish to learn advanced topics or latest developments, they are not suitable as textbooks for a Þrst course or for self study on nonlinear Þnite element analysis. The motivation and encouragement that led to the writing of the present book have come from the users of the author’s book, An Introduction to the Finite Element Method (McGraw—Hill, 1984; Second Edition, 1993; third edition scheduled for 2004), who have found the approach presented there to be most suitable for any one — irrespective of their scientiÞc background — interested in learning the method, and also from the fact that there does not exist a book that is suitable as a textbook for a Þrst course on nonlinear Þnite element analysis. The author has taught a course on nonlinear Þnite element analysis many times during the last twenty years, and the present book is an outcome of the lecture notes developed during this period. The same approach as that used in the aforementioned book, namely, the differential equation approach, is adopted in the present book to introduce the theory, formulation, and computer implementation of the Þnite element method as applied to nonlinear problems of science and engineering.
Beginning with a model (i.e. typical) second-order, nonlinear differential equation in one dimension, the book takes the reader through increasingly complex problems of nonlinear beam bending, nonlinear Þeld problems in two dimensions, nonlinear plate bending, nonlinear formulations of solid continua, ßows of viscous incompressible ßuids in two dimensions (i.e. Navier—Stokes equations), time-approximation schemes, continuum formulations of shells, and material nonlinear problems of solid mechanics. As stated earlier, the book is suitable as a textbook for a Þrst course on nonlinear Þnite elements in civil, aerospace, mechanical, and mechanics departments as well as in applied sciences. It can be used as a reference by engineers and scientists working in industry, government laboratories and academia. Introductory courses on the Þnite element method, continuum mechanics, and numerical analysis should prove to be helpful. The author has beneÞted in writing the book by the encouragement and support of many colleagues around the world who have used his book, An Introduction to the Finite Element Method, and students who have challenged him to explain and implement complicated concepts and formulations in simple ways. While it is not possible to name all of them, the author expresses his sincere appreciation. In particular, it is a pleasure to acknowledge the help of the author’s students Juan P. Pontaza with the least-squares Þnite element analysis of ßuid ßow problems in Chapters 7 and 8, and Goy Teck Lim with the plasticity example in Chapter 10. The author expresses his deep sense of gratitude to his teacher, Professor J. T. Oden (University of Texas at Austin), to whom this book is dedicated and without whose advice, mentorship and support it would not have been possible for the author to modestly contribute to the Þeld of applied mechanics in general and theory and application of the Þnite element method in particular, through author’s teaching, research, and technical writings.
J. N. Reddy College Station, Texas
1 Introduction
1.1 Mathematical Models One of the most important thing engineers and scientists do is to model natural phenomena. They develop conceptual and mathematical models to simulate physical events, whether they are aerospace, biological, chemical, geological, or mechanical. The mathematical models are developed using laws of physics and they are often described in terms of algebraic, differential, and/or integral equations relating various quantities of interest. A mathematical model can be broadly deÞned as a set of relationships among variables that express the essential features of a physical system or process in analytical terms. The relationships that govern the system take the form of algebraic, differential, and integral equations. Mathematical models of physical phenomena are often based on fundamental scientiÞc laws of physics such as the principle of conservation of mass, the principle of conservation of linear momentum, and the principle of conservation of energy. Mathematical models of biological and other phenomena may be based on observations and accepted theories. Keeping the scope of the present study in mind, we limit our discussions to engineering systems that are governed by laws of continuum mechanics. Mathematical models of engineering systems are often characterized by very complex equations posed on geometrically complicated regions. Consequently, many of the mathematical models, until the advent of electronic computation, were drastically simpliÞed in the interest of analytically solving them. Over the last three decades, however, the computer has made it possible, with the help of mathematical models and numerical methods, to solve many practical problems of science and engineering. There now exists a new and growing body of knowledge connected with the use of numerical methods and computers to analyze mathematical models of physical systems, and this body is known as computational mechanics. Major established industries such as the automobile, aerospace, chemical, pharmaceutical, petroleum, electronics and communications, as well as emerging industries such as biotechnology, rely on computational mechanics—based capabilities to simulate complex systems
2
NONLINEAR FINITE ELEMENT ANALYSIS
Here, we consider the familiar example of a simple pendulum to illustrate how a mathematical model of the motion of the pendulum can be constructed using the principle of conservation of linear momentum, that is, Newton’s second law of motion. Numerical analysis of the problem will be considered in the sequel. Example 1.1.1 As an example of the mathematical model development, consider the problem of a simple pendulum. The system consists of a bob of mass m attached to one end of a rod of length l and the other end is pivoted to a Þxed point O, as shown in Figure 1.1.1. The primary goal of the mathematical model to be derived here is to have a means to determine the motion (i.e. angular displacement as a function of time) of the bob. Keeping the goal of the analysis in mind, we make several assumptions. (1) The bob as well as the rod connecting the bob to the Þxed point O are rigid; (2) the mass of the rod is negligible relative to the mass of the bob; and (3) there is no friction at the pivot. These assumptions may be removed to obtain a mathematical model that describes the system more accurately. The equation governing the motion can be derived using the principle of conservation of linear momentum, also known as Newton’s second law of motion, which states that the vector sum of externally applied forces is equal to the time rate of change of the linear momentum of the body: F = ma (1.1.1) where F is the vector sum of all forces acting on a system, m is the mass of the system, and a is the acceleration of the system. Applying Newton’s second law in the x direction (see Figure 1.1.1), we have Fx = −mg sin θ,
v=l
dθ dt
(1.1.2)
where θ is the angular displacement, v is the velocity along x, and t denotes time. Then, the equation for motion about the pivot becomes −mg sin θ = ml
O l
d2 θ dt2
or
d2 θ g + sin θ = 0 l dt2
R
(1.1.3)
x ma=mθ¨ l
θ mg
y
m
Figure 1.1.1 Simple pendulum.
INTRODUCTION
3
Thus, the problem at hand involves solving the nonlinear differential equation d2 θ g + sin θ = 0, l dt2
0
(1.1.4)
subjected to the initial (i.e. at time t = 0) conditions θ(0) = θ0 ,
dθ (0) = v0 dt
(1.1.5)
where θ0 and v0 are the initial values of angular displacement and velocity, respectively. Mathematically, the problem is called an initial-value problem. If the amplitude θ is not small, the restoring moment is proportional to sin θ, and Eq. (1.1.3) represents a nonlinear equation. For small θ, sin θ is approximately equal to the angle θ, and the motion is described by the linear equation d2 θ g + λ2 θ = 0, λ2 = (1.1.6) l dt2 which represents a simple harmonic motion. The general analytical solution to the linear equation (1.1.6) is given by θ(t) = A sin λt + B cos λt,
λ=
q
g l
(1.1.7)
where A and B are constants to be determined using the initial conditions in (1.1.5). We obtain v A = 0 , B = θ0 (1.1.8) λ and the solution to the linear problem is θ(t) =
v0 sin λt + θ0 cos λt λ
(1.1.9)
For zero initial velocity and non-zero initial position θ0 , we have θ(t) = θ0 cos λt
(1.1.10)
1.2 Numerical Simulations By a numerical simulation of a process, we mean the solution of the governing equations (or mathematical model) of the process using a numerical method and a computer. While the derivation of the governing equations for most problems is not unduly difficult, their solution by exact methods of analysis is a formidable task. In such cases, numerical methods of analysis provide an alternative means of Þnding solutions. Numerical methods typically transform differential equations to algebraic equations that are to be solved using computers. For example, the mathematical formulation of the simple pendulum resulted in the nonlinear differential equation (1.1.4), whose analytical solution cannot be obtained. Therefore, one must consider using a numerical method to solve it. Even linear problems may not admit exact solutions due to geometric and material complexities, but it is relatively easy
4
NONLINEAR FINITE ELEMENT ANALYSIS
to obtain approximate solutions using numerical methods. These ideas are illustrated below using the simple pendulum problem of Example 1.1.1. The Þnite difference method is used as the numerical method. Example 1.2.1 Here we consider the numerical solution of Eq. (1.1.4) governing a simple pendulum using the Þnite difference method. In the Þnite difference method, the derivatives are approximated by difference quotients (or the function is expanded in a Taylor series) that involve the unknown value of the solution at time ti+1 and the known value of the solution at ti . For example, consider the Þrst-order equation du = f (t, u) dt
(1.2.1)
u(ti+1 ) − u(ti ) = f (ui , ti ) ti+1 − ti
(1.2.2)
We approximate the derivative at ti by
³ or
¯ ´¯
du ¯ ¯ dt ¯
≈ t=ti
ui+1 = ui + ∆t f (ui , ti )
(1.2.3a)
where ui = u(ti ),
∆t = ti+1 − ti
(1.2.3b)
Equation (1.2.3a) can be solved, starting from the known value u0 of u(t) at t = 0, for u1 = u(t1 ) = u(∆t). This process can be repeated to determine the values of u at times t = ∆t, 2∆t, . . . , n∆t. This is known as Euler’s explicit method, also known as the forward difference scheme. Note that we are able to convert the ordinary differential equation (1.2.1) to an algebraic equation (1.2.3a) that needs to be evaluated at different times to construct the time history of u(t). Euler’s explicit method can be applied to the nonlinear second-order equation (1.1.4). First we rewrite Eq. (1.1.4) as a pair of Þrst-order equations dθ = v, dt
dv = −λ2 sin θ dt
(1.2.4)
which are coupled (i.e. one cannot be solved without the other). Applying the scheme of Eq. (1.2.4) to the equations at hand, we obtain θi+1 = θi + ∆t vi ;
vi+1 = vi − ∆t λ2 sin θi
(1.2.5)
The expressions for θi+1 and vi+1 in Eq. (1.2.5) are repeatedly computed using the known solution (θi , vi ) from the previous time step. At time t = 0, we use the known initial values (θ0 , v0 ). Thus, one needs a computer and a computer language like Fortran (77 or 90) to write a computer program to compute numbers. The numerical solutions of equation (1.2.5) for two different time steps, ∆t = 0.05 and ∆t = 0.025, along with the exact linear solution (1.1.10) (with θ0 = π/4) are presented in Figure 1.2.1. The numerical solutions of the nonlinear problem are dependent on the time step, and smaller the time step more accurate the solution is. This is because the approximation of the derivative in Eq. (1.2.2) tends to the exact derivative with ∆t → 0.
INTRODUCTION
5
2.0
1.0
Nonlinear (0.05)
Nonlinear (0.025) (∆t = 0.025)
Angular displacement
(∆t = 0.05)
0.0 Linear (exact)
-1.0
-2.0
-3.0 0.0
0.5
1.0
1.5 2.0 Time, t
2.5
3.0
3.5
Figure 1.2.1 Analytical and numerical solutions of the simple pendulum.
1.3 The Finite Element Method As illustrated in the previous section, numerical methods are extremely powerful tools for engineering analysis. With the advent of computers, there has been a tremendous explosion in the development and use of numerical methods. Of these, the Þnite difference methods and the Þnite element method and their variants are the most commonly used methods in the analysis of practical engineering problems. In Þnite difference methods, derivatives of various order are approximated using Taylor’s series. The traditional Þnite difference methods suffer from two major drawbacks: (1) applying boundary conditions of the gradient type requires additional approximation; (2) Þnite difference formulas are traditionally developed for rectangular grids, making it difficult to use them for irregular domains. Advances have been made in recent years to overcome these drawbacks but the remedies are problem dependent. The Þnite element method is based on the idea that every system is physically composed of different parts and hence its solution may be represented in parts. In addition, the solution over each part is represented as a linear combination of undetermined parameters and known functions of position and possibly time. The parts can differ from each other in shape, material properties, and physical behavior. Even when the system is of one geometric shape and made of one material, it is simpler to represent its solution in a piecewise manner.
6
NONLINEAR FINITE ELEMENT ANALYSIS
In recent years, generalizations of the Þnite element method have emerged (e.g. the generalized Þnite element method and element-free methods or meshless methods); however, in this study we limit our discussion to the traditional Þnite element method [9]. The traditional Þnite element method is endowed with three basic features. First, a domain of the system is represented as a collection of geometrically simple subdomains, called Þnite elements. Second, over each Þnite element, the unknown variables are approximated by a linear combination of algebraic polynomials and undetermined parameters, and algebraic relations among the parameters are obtained by satisfying the governing equations, often in a weighted-integral sense, over each element. The undetermined parameters represent the values of the unknown variables at a Þnite number of preselected points, called nodes, in the element. Third, the algebraic relations from all elements are assembled using continuity and “equilibrium” considerations. There are several reasons why an engineer or scientist should study the Þnite element method; these are listed below. 1. The Þnite element method is the most powerful numerical method ever devised for the analysis of engineering problems. It is capable of handling geometrically complicated domains, a variety of boundary conditions, nonlinearities, and coupled phenomena that are common in practical problems. The knowledge of how the method works greatly enhances the analysis skill and provides a greater understanding of the problem being solved. 2. Commercial software packages or “canned” computer programs based on the Þnite element method are often used in industrial, research, and academic institutions for the solution of a variety of engineering and scientiÞc problems. The intelligent use of these programs and a correct interpretation of the output is often predicated on knowledge of the basic theory underlying the method. 3. It is not uncommon to Þnd mathematical models derived in personal research and development that cannot be evaluated using canned programs. In such cases, an understanding of the Þnite element method and knowledge of computer programming can help design programs to evaluate the mathematical models. The basic ideas underlying the Þnite element method are reviewed in Chapter 2 using linear differential equations involving a single variable in one and two dimensions. The main objective there is to introduce the terminology and steps involved, e.g. weak formulation of differential equations over a element, derivation of the interpolation functions, and numerical evaluation of coefficients and so on. Readers who are familiar with the Þnite element method as applied to linear differential equations may skip Chapter 2 and go straight to Chapter 3.
INTRODUCTION
7
1.4 Nonlinear Analysis 1.4.1 Introduction Recall from the simple pendulum problem of Examples 1.1.1 and 1.2.1, that nonlinearity naturally arises in a true, rigorous mathematical formulation of physical problems. Based on assumptions of smallness of certain quantities of the formulation, the problem may be reduced to a linear problem. Linear solutions may be obtained with considerable ease and less computational cost when compared to nonlinear solutions. Further, linear solutions due to various boundary conditions and “load” cases may be scaled and superimposed. In many instances, assumptions of linearity lead to reasonable idealization of the behavior of the system. However, in some cases assumption of linearity may result in an unrealistic approximation of the response. The type of analysis, linear or nonlinear, depends on the goal of the analysis and errors in the system’s response that may be tolerated. In some cases, nonlinear analysis is the only option left for the analyst as well as the designer (e.g. high-speed ßows of inviscid ßuids around solid bodies). Nonlinear analysis is a necessity, for example, in (a) designing high performance and efficient components of certain industries (e.g. aerospace, defense and nuclear), (b) assessing functionality (e.g., residual strength and stiffness of structural elements) of existing systems that exhibit some types of damage and failure, (c) establishing causes of system failure, (d) simulating true material behavior of processes, and (e) research to gain a realistic understanding of physical phenomena. The following features of nonlinear analysis should be noted (see [1—7]): • The principle of superposition does not hold. • Analysis can be carried out for one “load” case at a time. • The history (or sequence) of “loading” inßuences the response. • The initial state of the system (e.g. prestress) may be important.
1.4.2 ClassiÞcation of Nonlinearities There are two common sources of nonlinearity: (1) geometric and (2) material. The geometric nonlinearity arises purely from geometric consideration (e.g. nonlinear strain—displacement relations), and the material nonlinearity is due to nonlinear constitutive behavior of the material of the system. A third type of nonlinearity may arise due to changing initial or boundary conditions. We will discuss various types of nonlinearities through simple examples [5]. The simple pendulum problem of Example 1.1.1 is an example of geometric nonlinearity. A common example of geometric nonlinearity is provided by (see Hinton [5]) a rigid link supported by a linear elastic torsional spring at one end and subjected to a vertical point load at the other end, as shown in Figure 1.4.1. Moment equilibrium (i.e. summing the moments about the hinge) and
8
NONLINEAR FINITE ELEMENT ANALYSIS
the linear moment—rotation relationship give kT θ (1.4.1) l cos θ where kT is the torsional spring constant, l length of the link, and M is the moment experienced by the torsional spring due to the angular displacement θ. If θ is small, cos θ → 1 and the governing equation is reduced to a linear equation kT θ π F = , θ< (1.4.2) l 2 The nonlinear and linear responses are shown in Figure 1.4.2. Clearly, the nonlinearity in the present case is due to the change of geometry, and the nonlinear deßection is less than the linear deßection as the load is increased. Such a nonlinearity is known as the hardening type. M = kT θ
M − F l cos θ = 0,
or
F =
F
F l
l kT
θ
°
θ
• M = kT θ F
Figure 1.4.1 Rigid link—linear torsional spring cantilever.
Load parameter, F l/KT
20
16
12
8
Nonlinear
4 Linear
0 0.0
0.5
1.0
1.5
Rotation, θ
Figure 1.4.2 Geometric nonlinear response of a rigid link—linear torsional spring cantilever.
INTRODUCTION
9
The material nonlinearity may be introduced into the problem if the moment—rotation relationship is nonlinear M = kT (θ)θ,
say
kT = k0 − k1 θ
(1.4.3)
where k0 and k1 are material parameters that are determined through tests. If we use the relationship (1.4.3) in (1.4.1), we obtain a nonlinear equation that contains both geometric and material nonlinearities; if Eq. (1.4.3) is used in (1.4.2), the resulting nonlinearity is only due to the material behavior. Figure 1.4.3 contains plots of load F versus rotation θ for the materially nonlinear case. Note that the material nonlinearity in the present case is due to the change (reduction) in the torsional spring stiffness, and the nonlinear deßection is greater than the linear deßection as the load is increased. Such a nonlinearity is known as the softening type. In the present case, the geometric nonlinearity dominates if both nonlinearities are included. An example of another type of nonlinearity is provided by (see Hinton [5]) the axial deformation of an isotropic, homogeneous, linear elastic rod with constrained end displacement, as shown in Figure 1.4.4. The rod is of length 2L, uniform cross-sectional area of A, and loaded with an axial force P at its midpoint. The lower end of the rod is constrained so that it can at most have an axial displacement of u0 (which is assumed to be very small compared to the length L).
Load parameter, Fl /KT
1.6 1.4
Linear
1.2 1.0 0.8 0.6
Nonlinear
0.4 0.2 0.0 0.0
0.5
1.0
1.5
Rotation, θ
Figure 1.4.3 Material nonlinear response of a rigid link—linear torsional spring cantilever.
10
NONLINEAR FINITE ELEMENT ANALYSIS
P
A L • B
L
P C
•
u0
uB
u0
Figure 1.4.4 Axial deformation of a rod with constrained end displacement. The governing equation and boundary condition at A are given by EA
d2 u = 0, dx2
u(0) = 0
(1.4.4)
The displacement at point B can be determined using the boundary condition at point C, which is dependent on whether the displacement of point C equals u0 . Thus, we have µ
EA
du dx
¶
B
− P = 0,
uC = 0,
if
if
uB = uC < u0
uB ≥ u0
(1.4.5) (1.4.6)
In the former case, the displacement is given by u(x) =
Px , EA
uB =
PL , EA
if
uC < u0
(1.4.7)
In the latter case (by solving the governing equation in the two intervals and using the continuity and boundary condition with L+u0 ≈ L) the displacement is given by ⎧ Px 0 ≤ x ≤ L, ⎨ 2EA , u(x) = (1.4.8a) ⎩ P (2L−x) , L ≤ x ≤ 2L 2EA and
PL (1.4.8b) 2EA Thus the force—displacement relationship of the rod is bilinear. Such problems are called “contact” or “nonlinear boundary” problems [5]. uB =
INTRODUCTION
11
1.5 The Big Picture Engineers design and manufacture various types of systems. Engineering design is the process of altering dimensions, shapes, and materials to Þnd the best (optimum) conÞguration of the system to carry out certain speciÞc function. Analysis is an aid to design and it involves (1) mathematical model development, (2) data acquisition by measurements, (3) numerical simulation, and (4) evaluation of the results in light of known information and corrections to the mathematical model. The mathematical model is developed using laws of physics and assumptions concerning the process behavior. The data includes the actual system parameters (geometry, loading, and boundary conditions) and constitutive properties. The constitutive properties such as the modulus, conductivity, and so on are determined in laboratory experiments. The mathematical model, in most practical cases, does not admit analytical (or exact) solution due to the geometric complexity and/or nonlinearities. Nonlinearities in a mathematical model arise from changing geometry or material behavior. It is necessary to employ numerical methods to compute an approximate solution to the mathematical model. The Þnite element method is a powerful numerical method that can be used to analyze engineering problems [1—15]. A typical Þnite element analysis exercise begins with the actual physical system or part thereof to be analyzed [5]. Then we form a set of objectives for the analysis. If the analysis objective is to help develop a preliminary design of the system, the analysis can be very simple. On the other hand, if the analysis objective is to verify and certify the Þnal design of a system, the analysis must be the most sophisticated that can be carried out. Thus, the objectives will dictate the type of idealization of the system to be adopted; for example, should we model as a two-dimensional or three-dimensional problem?, analyze as a linear or nonlinear problem and what type of nonlinearities to be considered?, what type constitutive model to be used?, how are the loads and boundary conditions of the actual system are idealized?, what coupling effects, if any, to be considered?, and so on. Once the system idealization is complete (i.e. mathematical model is in place), one must decide on type of numerical approximation (and software to be used). This involves (1) choice of unknowns, which in turn dictates the type of Þnite element model, (2) type of elements, (3) type of mesh, and if nonlinear analysis is to be carried out, select (4) magnitude of “load” increments, (5) type of iterative method of solution, (6) error criterion, (7) error tolerance, and (8) maximum allowable number of iterations for termination of the program. The Þnal step in creating a computational model is veriÞcation of the code and validation of the mathematical model. VeriÞcation is the process of determining if the computational model is an accurate discrete analog of the mathematical model [15]. Thus, if the round-off errors introduced due to Þnite arithmetic in a computer are negligible, the computational model should
12
NONLINEAR FINITE ELEMENT ANALYSIS
give the exact solution of the mathematical model. Thus veriÞcation involves comparing the numerical results with known exact and/or experimental results of benchmark problems. On the other hand, validation is the process of determining the degree to which the mathematical model (hence the computer code that is veriÞed) represents the physical reality of the system from the perspective of the intended uses of the model. Obviously, the validation exercise can be deÞned only in relation to the intended uses of the model. For example, a mathematical model based on linear elasticity is adequate for determining linear elastic solutions of a solid but inadequate for determining its nonlinear response. The validation exercise allows one to modify the mathematical model to include the missing elements that make the computed response come closer to the physical response. In fact, a mathematical model can never be validated; it can only be invalidated. It is always a good idea, when developing new software, to undertake the veriÞcation exercise. Validation is a must when studying new and mulit-physics problems.
References 1. Bathe, K. J., Finite Element Procedures, Prentice—Hall, Englewood Cliffs, NJ (1996). 2. Belytschko, T., Liu, W. K., and Moran, B., Nonlinear Finite Elements for Continua and Structures, John Wiley, Chichester, UK (2000). 3. CrisÞeld, M. A., Non-Linear Finite Element Analysis of Solids and Structures, Vol. 1: Essentials, John Wiley, Chichester, UK (1991). 4. CrisÞeld, M. A., Non-Linear Finite Element Analysis of Solids and Structures, Vol. 2: Advanced Topics, John Wiley, Chichester, UK (1997). 5. Hinton, E. (ed.) NAFEMS Introduction to Nonlinear Finite Element Analysis, NAFEMS, Glasgow, UK (1992). 6. Oden, J. T., Finite Elements of Nonlinear Continua, McGraw—Hill, New York (1972). 7. Owen, D. R. J. and Hinton, E., Finite Elements in Plasticity: Theory and Practice, Pineridge Press, Swansea, UK (1991). 8. Reddy, J. N., Energy and Variational Methods in Applied Mechanics, John Wiley, New York (1984). 9. Reddy, J. N., An Introduction to the Finite Element Method, 2nd edn, McGraw—Hill, New York (1993). 10. Reddy, J. N., Energy Principles and Variational Methods in Applied Mechanics, 2nd edn, John Wiley, New York (2002). 11. Reddy, J. N. and Gartling, D. K., The Finite Element Method in Heat Transfer and Fluid Dynamics, 2nd edn, CRC Press, Boca Raton, FL (1999). 12. Yang, Y.-B. and Kuo, S.-R., Theory & Analysis of Nonlinear Framed Structures, Prentice—Hall, Singapore (1994). 13. Zienkiewicz, O. C. and Taylor, R. L., The Finite Element Method, Fourth Edition, Vol. 1: Basic Formulation and Linear Problems, McGraw—Hill, London, UK (1989). 14. Zienkiewicz, O. C. and Taylor, R. L., The Finite Element Method, 4th edn, Vol. 2: Solid and Fluid Mechanics, Dynamics and Non-linearity, McGraw—Hill, London, UK (1989). 15. Sargent, R. G., “An overview of veriÞcation and validation of simulation models,” Proceedings of the 1987 Winter Simulation Conference, Society of Computer Simulation (1987).
2 The Finite Element Method: A Review 2.1 Introduction The main ideas of the Þnite element method were presented in Chapter 1. To summarize, the Þnite element method has the following three basic features: 1. Divide the whole (i.e. domain) into parts, called Þnite elements. 2. Over each representative element, develop the relations among the secondary and primary variables (e.g. “forces” and “displacements”, “heats” and “temperatures”, and so on). 3. Assemble the elements (i.e. combine the relations of all elements) to obtain the relations between the secondary and primary variables of the whole system. In the present chapter, we review the basic steps of the Þnite element model development as applied to one- and two-dimensional problems described by typical second-order differential equations. The main objective is to familiarize the reader with the speciÞc steps involved in the Þnite element formulation and its applications. Readers who are already familiar with the author’s approach to Þnite element modeling may skip this chapter.
2.2 One-Dimensional Problems 2.2.1 Governing Differential Equation Consider the differential equation µ
¶
d du − a + cu = f dx dx
for
0<x
(2.2.1)
where a = a(x), c = c(x), and f = f (x) are the data (i.e. known quantities) of the problem, and u(x) is the solution to be determined. The data depends on the material properties, geometry, and “loads” or source. The equation arises in a number of Þelds, and it must be solved subject to appropriate boundary conditions. Table 2.2.1 contains a list of Þelds, by no means exhaustive, in which Eq. (2.2.1) arises.
14
NONLINEAR FINITE ELEMENT ANALYSIS
2.2.2 Finite Element Approximation The domain (0, L) of the problem consists of all points between x = 0 and x = L. The points x = 0 and x = L are the boundary points of the total domain. In the Þnite element method, the domain (0, L) is divided into a set of intervals. A typical interval, called a Þnite element, is of length he and located between points x = xa and x = xb , where xa and xb denote the coordinates of the end points of the Þnite element with respect to the coordinate x. Table 2.2.1 List of Þelds in which the model equation (2.2.1) arises, with meaning of various parameters and variables (see the bottom of the table for the meaning of some parameters*). Field of study Heat transfer
Primary variable u
Problem data a
Temperature T − T∞
Thermal conductance kA
Flow through porous medium
Fluidhead
Permeability
Flow through pipes
Pressure
Flow of viscous ßuids
Velocity
Elastic cables
Displacement u
Tension
Displacement u
Axial stiffness EA
Torsion of bars
Angle of twist θ
Shear stiffness GJ
Electrostatics
Electrical potential φ
Dielectric constant ε
Elastic bars
φ
P
vz
µ Pipe resistance 1/R
c
f
Surface convection Apβ
0
0
Viscosity µ
T
Secondary variable Q
Heat generation f
Heat
InÞltration
Point source
f
0
Q
Q Point source Q
Pressure gradient −dP/dx
Shear stress σxz
0
Transverse force f
Point force P
0
Axial force f
Point force P
0
Torque 0
0
0 Charge density ρ
T Electric ßux E
*k = thermal conductance; β = convective Þlm conductance; p = perimeter; P = pressure or force; T∞ = ambient temperature of the surrounding ßuid medium; R = 128µh/(πd4 ) with µ being the viscosity; h, the length and d the diameter of the pipe; E = Young’s modulus; A = area of cross-section; J = polar moment of inertia.
THE FINITE ELEMENT METHOD: A REVIEW
15
In the Þnite element method, we seek an approximate solution to Eq. (2.2.1) over each Þnite element; a typical Þnite element is shown in Figure 2.2.1. The Þnite element approximation ueh (x) is sought in the form u(x) ≈ ueh (x) = ce1 ϕe1 (x) + ce2 ϕe2 (x) + . . . + cen ϕen (x) =
n X
cej ϕej (x)
(2.2.2)
j=1
where ϕej (x) are functions to be selected and cej are constants to be determined such that Eq. (2.2.2) satisÞes the differential equation (2.2.1) and appropriate end conditions over the element. Since there are n unknown parameters, we need n relations to determine them. Substituting the approximate solution (2.2.2) into the left-hand side of Eq. (2.2.1), we obtain an expression that, in general, will not be equal to the right-hand side of the equation, f(x). The difference between the two sides of the equation is called the residual µ
d due − a h dx dx
¶
+ cueh (x) − f (x) ≡ Re (x, ce1 , ce2 , . . . , cen ) 6= 0
(2.2.3)
We wish to determine cej (j = 1, 2, · · · , n) such that the residual is zero, in some sense, over the element. One way of making the residual zero is in weighted-integral sense Z
xb
xa
wie (x)Re (x, c1 , c2 , . . .) dx = 0,
i = 1, 2, . . . , n
(2.2.4)
where wie (i = 1, 2, . . . , n) are weight functions. Equation (2.2.4) provides a set of n algebraic relations among the parameters cej (j = 1, 2, . . . , n). The set {w1e (x), w2e (x), . . . , wne (x)} must be linearly independent so that the algebraic equations (2.2.4) are also linearly independent and invertible. There are other choices of wie that may be used. In the present study we take wie (x) to be the same as the approximation functions ϕei (x). This particular choice is known as the Galerkin method. Different choice of the weight functions will result in a different set of algebraic equations or different Þnite element models of the same differential equation.
f(x) du ⎞ ⎛ = Qa ⎜− a ⎟ dx ⎠ x = x ⎝ a
1 u(xa) = u1
2 u(xb) = u2
⎛ du ⎞ = Qb ⎜a ⎟ ⎝ dx ⎠ x = xb
Figure 2.2.1 A typical Þnite element in one dimension.
16
NONLINEAR FINITE ELEMENT ANALYSIS
2.2.3 Derivation of the Weak Form To weaken the continuity required of ueh (x), we must trade some of the differentiation in (2.2.4) from ueh to wie such that both ueh and wie are differentiated equally, once each in the present case. The resulting integral form is termed the weak form of Eq. (2.2.1) because it allows approximation functions with less (or weaker) continuity (or differentiability). A three-step procedure of constructing the weak form of Eq. (2.2.1) is presented next. Step 1. The Þrst step is to write the weighted-residual statement as in Eq. (2.2.4) ∙ µ ¶ ¸ Z xb d due 0= wie − a h + cueh − f dx (2.2.5) dx dx xa Step 2. The second step is to trade differentiation from ueh to wie , using integration by parts. We obtain 0=
Z xb µ dwie dueh
a
xa
dx dx
¶
∙
+ cwie ueh − wie f dx − wie · a
dueh dx
¸xb
(2.2.6)
xa
Step 3. Examining the boundary term appearing in the weak form (2.2.6), namely, the expression ∙ ¸ du xb wie · a dx xa The coefficient of the weight function wie in the boundary expression, a(du/dx), is called the secondary variable, and its speciÞcation constitutes the natural or Neumann boundary condition. The primary variable is the dependent unknown of the differential equation, u, in the same form as the weight function in the boundary expression (i.e. replace wie with u). The speciÞcation of a primary variable on the boundary constitutes the essential or Dirichlet boundary condition. For the model equation at hand, the primary and secondary variables are Primary variable: u
du ≡Q dx
Secondary variable: a
(2.2.7)
In writing the Þnal weak form, we denote the secondary variables at the ends of the element as µ
Qea = − a
du dx
¶
xa
,
µ
Qeb = a
du dx
¶
(2.2.8)
xb
The primary and secondary variables at the nodes are shown on the typical element in Figure 2.2.1. Students of engineering who have taken a course in
THE FINITE ELEMENT METHOD: A REVIEW
17
mechanics of deformable bodies (or strength of materials) recognize that this Þgure shows the free-body diagram of a typical but arbitrary portion of a bar, with Qea and Qeb denoting the axial forces; Qea is a compressive force while Qeb is a tensile force (algebraically, both are in the positive x direction, as shown in Figure 2.2.1). For heat conduction problems, Qea denotes the heat input at the left end and Qeb the heat output from the right end of the element. With the notation in (2.2.8), the Þnal expression for the weak form is given by 0=
Z xb µ dwie dueh
a
xa
dx dx
¶
+ cwie ueh − wie f dx − wie (xa )Qea − wie (xb )Qeb
(2.2.9)
This completes the three-step procedure of constructing the weak form. Remarks 1. The weak form in (2.2.9) contains two types of expressions: those containing both wie and ueh , and those containing only wie . The expression containing both wie and ueh is called the bilinear form (i.e. linear in wie and linear in ueh ): B(wie , ueh ) ≡
Z xb µ dwie dueh
a
xa
dx dx
¶
+ cwie ueh dx
(2.2.10)
Similarly, the expression containing only wie (but not ueh ) is called the linear form: Z `(wie ) =
xb
xa
wie f dx + wie (xa )Qea + wie (xb )Qeb
(2.2.11)
More formally, we say that B(u, v) is linear in both u and v, and `(v) is linear in v, if and only if the following conditions hold: B(c1 u1 + c2 u2 , v) = c1 B(u1 , v) + c2 B(u2 , v) B(u, c1 v1 + c2 v2 ) = c1 B(u, v1 ) + c2 B(u, v2 )
(2.2.12a)
`(c1 v1 + c2 v2 ) = c1 `(v1 ) + c2 `(v2 )
(2.2.12b)
where c1 and c2 are constants and u, v, u1 , u2 , v1 , and v2 are dependent variables. 2. In view of the above deÞnitions, the weak form (2.2.9) of Eq. (2.2.1) can now be expressed as B(wie , ueh ) = `(wie ) (2.2.13) which is called the variational problem associated with Eq. (2.2.1). As will be seen later, the bilinear form B(wie , ueh ) results directly in the element coefficient matrix, and the linear form `(wie ) leads to the right-hand side column vector of the Þnite element equations.
18
NONLINEAR FINITE ELEMENT ANALYSIS
3. Those who have a background in applied mathematics or solid and structural mechanics will appreciate the fact that the weak form (2.2.9) or the variational problem (2.2.13) is nothing but the statement of the principle of the minimum total potential energy Π(ueh ) (applied to the bar element): 0 = δΠ = B(δueh , ueh ) − `(δueh ) where δ is the variational symbol and Π(ueh ) is the quadratic functional deÞned by
1 (2.2.14) Π(ueh ) = B(ueh , ueh ) − `(ueh ) 2 " # µ ¶ Z xb a duei 2 c e 2 + (uh ) − ueh f dx − ueh (xa )Qea − ueh (xb )Qeb = 2 dx 2 xa (2.2.15) Equation (2.2.14) holds only when the bilinear form B(w, u) is symmetric in u and w, B(w, u) = B(u, w) (2.2.16) and `(u) is linear in u. The expression 12 B(ueh , ueh ) represents the elastic strain energy stored in the bar Þnite element and `(ueh ) represents the work done by applied distributed force f (x) and point loads Qea and Qeb .
2.2.4 Interpolation Functions Recall that the weak form over an element is equivalent to the differential equation, and it contains the end conditions on the “forces” Qei (see Figure 2.2.1). Therefore, the approximate solution ueh (x) should be selected such that the differentiability (or continuity) conditions implied by the weak form are met and the end conditions on the primary variables u(xi ) = uei are satisÞed. Since the weak form contains the Þrst-order derivative of ueh , any function with a non-zero Þrst derivative would be a candidate for ueh . Thus, the Þnite element approximation ueh of u(x) can be an interpolant, that is, must be equal to uea at xa and ueb at xb . Thus, a linear polynomial (see Figure 2.2.2) ueh (x) = ce1 + ce2 x
(2.2.17)
is admissible if we can select ce1 and ce2 such that ueh (xa ) = ce1 + ce2 xa = uea ,
ueh (xb ) = ce1 + ce2 xb = ueb
or ∙
1 xa 1 xb
¸½ e ¾ c 1 ce2
=
½ e¾ u a ueb
→ ce1 =
ueb xb − uea xa , xb − xa
ce2 =
ueb − uea xb − xa
(2.2.18)
THE FINITE ELEMENT METHOD: A REVIEW
19
Substitution of (2.2.18) for cei into (2.2.17) yields ueh (x) = Le1 (x)ue1 + Le2 (x)ue2 =
2 X
Lej (x)uej
(2.2.19)
j=1
where Le1 (x) =
xb − x , xb − xa
Le2 (x) =
ue1 = uea ,
ue2 = ueb
x − xa xb − xa
(2.2.20)
are the linear Lagrange interpolation functions, and
(2.2.21)
are the nodal values of ueh (x) at x = xa and x = xb , respectively. Note that Lei (x) satisfy the interpolation property Lei (xej ) =
½
1, 0,
if i = j if i = j
(2.2.22)
where xe1 = xa and xe2 = xb (see Figure 2.2.2). In addition, the Lagrange interpolation functions satisfy the property, known as the “partition of unity”: n X
Lej (x) = 1
(2.2.23)
j=1
u ( x) ≈ c1 + c 2 x
True solution
u(x)
= u1e L1e ( x) + u 2e Le2 ( x )
u1e L1e ( x) u 2e Le2 ( x )
x = xa = x
e 1
x = xb = x
e 2
u 2e u1e 1
2
x
he
x
Figure 2.2.2 Linear Þnite element approximation over an element.
20
NONLINEAR FINITE ELEMENT ANALYSIS
If we wish to approximate u(x) with a quadratic polynomial, we write ueh (x) = ce1 + ce2 x + ce3 x2
(2.2.24)
Since there are three parameters ce1 , ce2 , and ce3 , we must identify one more nodal point in the element to express all three c, s in terms of the values of ueh at three nodes. Of course, we can also carry the nodal values uea and ueb (so that they can be used to join adjacent elements) and the parameter ce3 as the unknowns of the approximation. Identifying the third node at the center of the element [see Figure 2.2.3(a)], we can write ueh (xe1 ) ≡ ue1 = ce1 + ce2 xe1 + ce3 (xe1 )2 ueh (xe2 ) ≡ ue2 = ce1 + ce2 xe2 + ce3 (xe2 )2 ueh (xe3 ) ≡ ue3 = ce1 + ce2 xe3 + ce3 (xe3 )2
(2.2.25)
where xe1 = xa ,
xe2 = xa +
he , 2
xe3 = xa + he = xb
(2.2.26)
Solving Eqs. (2.2.33) for cei in terms of uei , we obtain ueh (x) = Le1 (x)ue1 + Le2 (x)ue2 + Le3 (x)ue3 =
3 X
Lej (x)uej
(2.2.27)
j=1
where Lei (x) are the quadratic Lagrange interpolation functions [see Figure 2.2.3(b)] µ
¶µ
¶
x − xe2 x − xe3 = xe − xe2 xe − xe3 µ 1 ¶µ 1 ¶ e x − x1 x − xe3 Le2 (x) = xe − xe1 xe2 − xe3 µ 2 ¶ µ ¶ x − xe1 x − xe2 e L3 (x) = xe3 − xe1 xe3 − xe2 Le1 (x)
(2.2.28)
Higher-order Lagrange interpolation of u(x) can be developed along the similar lines. Thus, an (n − 1)st degree Lagrange interpolation of u(x) can be written as ueh (x) = Le1 (x)ue1 + Le2 (x)ue2 + . . . + Len (x)uen =
n X
Lej (x)uej
(2.2.29)
j=1
where the Lagrange interpolation functions of degree n − 1 are given by Lej (x) =
n Y
i=1,i6=j
Ã
x − xei xej − xei
!
(2.2.30)
THE FINITE ELEMENT METHOD: A REVIEW
x
21
x3e
e 2
e 1
x
x 1
x
3
he 2 (a)
Lei (x )
L1e ( x )
Le2 ( x )
Le3 ( x ) 1.0
1.0
1
2
1.0
3
x
(b)
Figure 2.2.3 (a) Quadratic Þnite element. interpolation functions.
(b) Quadratic Lagrange
The Þnite element solution ueh (x) must fulÞll certain requirements in order that it be convergent to the actual solution u(x) as the number of elements (h reÞnement) or the degree of the polynomials (p reÞnement) is increased. These are: 1. The approximate solution should be continuous and differentiable as required by the weak form. 2. It should be a complete polynomial, that is, include all lower-order terms up to the highest order term used. 3. It should be an interpolant of the primary variables at the nodes of the Þnite element (at least interpolate the solution at the end points). The reason for the Þrst requirement is obvious; it ensures that every term of the governing equation has a non-zero contribution to the coefficient matrix. The second requirement is necessary in order to capture all possible states, that is, constant, linear and so on, of the actual solution. For example, if a linear polynomial without the constant term is used to represent the temperature distribution in a one-dimensional system, the approximate solution can never be able to represent a uniform state of temperature Þeld in the element. The third requirement is necessary in order to enforce continuity of the primary variables at the end points where the element is connected to other elements.
22
NONLINEAR FINITE ELEMENT ANALYSIS
2.2.5 Finite Element Model Substitution of (2.2.29) into (2.2.9) will give the necessary algebraic equations among the nodal values uei and Qei of the element. In order to formulate the Þnite element model based on the weak form (2.2.9), it is not necessary to decide a priori the degree of approximation of ueh (x). The model can be developed using an arbitrary degree of interpolation. For n > 2, the weak form in Eq. (2.2.9) must be modiÞed to include non-zero secondary variables, if any, at interior nodes: 0=
Z xb µ dw dueh
a
xa
dx dx
+ cwueh
¶
dx −
Z xb xa
wf dx −
n X
w(xei ) Qei
(2.2.31)
i=1
where xei is the global coordinate of the ith node of element Ωe . If nodes 1 and n denote the end points of the element, then Qe1 and Qen represent the unknown point sources, and all other Qei are the point sources at nodes 2, 3, . . . , n, which are always known. Substituting Eq. (2.2.29) for ueh and w1e = Le1 , w2e = Le2 , . . . , wie = Lei , . . . , wne = Len into the weak form (2.2.31), we obtain n algebraic equations. The ith algebraic equation can be written as 0=
Z xb xa
− = 0=
⎡
⎛
n X
j=1
⎛
⎞
⎤
Z xb
Lei f dx − Qei
Lei (xej )Qej
j=1 " n X Z xb
j=1 n X
⎞
n n X dLej dLe X ⎣a i ⎝ ⎠ + cLe ⎝ uej uej Lej ⎠ − Lei f ⎦ dx i dx j=1 dx j=1
xa
Ã
!
#
dLe dLej + cLei Lej dx uej − a i dx dx
xa
e e Kij uj − fie − Qei
(2.2.32)
for i = 1, 2, . . . , n, where e Kij
=
Z xb à dLei dLej
a
xa
dx dx
+ cLei Lej
!
dx =
B(Lei , Lej ),
fie
=
Z xb xa
f Lei dx (2.2.33)
Note that the interpolation property (2.2.22) is used to write n X
Lej (xei )Qej = Qei
(2.2.34)
j=1
In matrix notation, these algebraic equations can be written as [K e ]{ue } = {f e } + {Qe }
(2.2.35)
THE FINITE ELEMENT METHOD: A REVIEW
23
The matrix [K e ] is called the coefficient matrix, or stiffness matrix in structural mechanics applications. The column vector {f e } is the source vector, or force vector in structural mechanics problems. Equation (2.2.35) has 2n unknowns (ue1 , ue2 , . . . , uen ) and (Qe1 , Qe2 , . . . , Qen ), called primary and secondary element nodal degrees of freedom; hence, it cannot be solved without having an additional n conditions. Some of these equations are provided by the boundary conditions of the problem and the remaining by the balance of the secondary variables Qei at nodes common to elements. The balance of equations can be implemented by putting the elements together (i.e. assembling the element equations) to form the total system. Upon assembly and imposition of boundary conditions, we shall obtain exactly the same number of algebraic equations as the total number of unknown primary (uei ) and secondary (Qei ) degrees of freedom. The coefficient matrix [K e ], which is symmetric, and source vector {f e } can be evaluated for a given interpolation and data (a, c, and f ). When a, c, and f are functions of x, it may be necessary to evaluate [K e ] and {f e } using numerical integration. We will discuss the numerical integration concepts in the sequel. Here we give the exact values of [K e ] and {f e } for linear as well as quadratic interpolations for element-wise constant values of a, c, and f . Suppose that ae , ce , and fe denote the element-wise constant values of a(x), c(x), and f (x). Then the following matrices can be derived by evaluating the integrals exactly. Linear element
µ
∙
L1 (¯ x) = 1 −
¸
∙
ae ce he 2 1 1 −1 + 1 1 2 he −1 6
x ¯ , he
L2 (¯ x) =
¸¶ ½ e ¾ u 1 ue2
fe he = 2
x ¯ he
½ ¾
1 1
+
½
Qe1 Qe2
¾
(2.2.36)
Quadratic element µ
L1 (¯ x) = 1 − Ã
2¯ x he
¶µ
1−
⎡
¶
µ
¶
µ
x ¯ 4¯ x x ¯ x ¯ 2¯ x , L2 (¯ x) = 1− , L3 (¯ x) = − 1− he he he he he ⎤
⎡
⎤ ⎧
⎫
−8 1 4 2 −1 ! ⎨ ue1 ⎬ h c e e ⎣ 2 16 16 −8 ⎦ + 2⎦ ue ⎩ 2e ⎭ 30 −8 7 −1 2 4 u3 ⎧ ⎫ ⎧ e⎫ 1 Q fe he ⎨ ⎬ ⎨ 1e ⎬ 4 + Q = 6 ⎩ ⎭ ⎩ 2e ⎭ 1 Q3
7 ae ⎣ −8 3he 1
¶
(2.2.37)
Note that the contribution of uniform source to the nodes in a quadratic element is non-uniform, that is, fie 6= fe he /3.
24
NONLINEAR FINITE ELEMENT ANALYSIS
2.3 Two-Dimensional Problems 2.3.1 Governing Differential Equation Consider the problem of Þnding u(x, y) such that the following partial differential equation is satisÞed −
∙
µ
¶
µ
∂ ∂u ∂u ∂ axx + ayy ∂x ∂x ∂y ∂y
¶¸
= f (x, y)
in Ω
(2.3.1)
where Ω is a two-dimensional domain with boundary Γ. Here axx and ayy are material coefficients in the x and y directions, respectively, and f (x, y) is the known source. For example, in a heat transfer problem, u denotes temperature T , axx and ayy denote the conductivities, kxx and kyy , and f is the internal heat generation. For an isotropic medium, we set kxx = kyy = k. Similarly, for a ground water ßow problem u denotes the water head (i.e. velocity potential), axx and ayy are the permeabilities in the x and y directions, respectively, and f(x, y) is distributed water source. Equation (2.3.1) also arises in other Þelds of science and engineering, and some of them are listed in Table 2.3.1. Equation (2.3.1) must be solved in conjunction with speciÞed boundary conditions of the problem. The following two types of boundary conditions are assumed: u=u ˆ(s) on Γu (2.3.2) µ
qn = axx
¶
∂u ∂u nx + ayy ny + qc = qˆ(s) on Γq ∂x ∂y
(2.3.3)
where Γu and Γq are disjoint portions of the boundary Γ such that Γ = Γu ∪Γq , qc refers to the convective component of ßux (e.g. in heat transfer problems) qc = hc (u − uc )
(2.3.4)
and (nx , ny ) denote the direction cosines of the unit normal vector on the boundary. In Eq. (2.3.4), hc denotes the convective heat transfer coefficient. The radiative heat transfer boundary condition (which is a nonlinear function of u) is not considered here. However, radiation boundary condition will be considered in the nonlinear analysis.
2.3.2 Finite Element Approximation ¯ = Ω ∪ Γ is divided into a set In the Þnite element method, the domain Ω e e e ¯ = Ω ∪ Γ , called Þnite elements (see Figure 2.3.1). Any of subdomains Ω geometric shape for which the approximation functions can be derived uniquely qualiÞes as an element. We shall discuss simple geometric shapes and orders of approximation shortly. To keep the formulative steps very general (i.e. not conÞne the formulation to a speciÞc geometric shape or order of the element), we have denoted the domain of a typical element by Ωe and its boundary by Γe .
THE FINITE ELEMENT METHOD: A REVIEW
25
¯ e can be a triangle or quadrilateral in shape, and the degree of The element Ω interpolation over it can be linear, quadratic, and so on. The non-overlapping ¯ e is denoted by Ωh , and it is called the Þnite element sum of all elements Ω ¯ when the boundary Γ mesh of the domain Ω. In general, Ωh may not equal Ω is curved. Of course, for polygonal domains, the Þnite element mesh exactly represents the actual domain. Table 2.3.1 List of Þelds in which the model equation (2.3.1) arises, with meaning of various parameters and variables (see the bottom of the table for the meaning of some parameters*). Field
Variable u
Data axx
Heat transfer
Temperature T
Thermal conductance kxx
Flow through porous medium
Fluidhead
Permeability
φ
Torsion of cylindrical members Torsion of cylindrical members
Data ayy
Variable qn
Heat generation f
Heat ßux qn
Permeability
InÞltration
Flux
µxx
µyy
f
qn
Warping function φ
1
1
0
∂φ ∂n
Stress function ψ
1
1
2Gθ
∂φ ∂n
Deßection Displaof cement membranes u
Tension
Thermal conductance kyy
Data f
Tension
T
T 1
Flows of inviscid ßows
Velocity potential φ
1
Flows of inviscid ßows
Stream function ψ
1
Electrostatics
Electrical potential φ
Transverse force f 0
qn ∂u ∂n
qn ∂φ ∂n
1
0
qn ∂ψ ∂n
Dielectric constant ε
Dielectric constant ε
Charge density ρ
Electric ßux ∂ψ ∂n
* k = thermal conductance; β = convective Þlm conductance; T∞ = ambient temperature of the surrounding ßuid medium; G = shear modulus; θ = angle of twist.
26
NONLINEAR FINITE ELEMENT ANALYSIS
Γ Γe
Ω
y
e
x
Figure 2.3.1 Finite element discretization of a domain. Suppose that the dependent unknown u is approximated over a typical ¯ e by the expression Þnite element Ω u(x, y) ≈ ueh (x, y) =
n X
uej Lej (x, y)
(2.3.5)
j=1
¯ e, where ueh (x, y) represents an approximation of u(x, y) over the element Ω e e parameters uj denote the values of the function uh (x, y) at a selected number ¯ e , and Le are the Lagrange of points, called element nodes, in the element Ω j interpolation functions associated with the element. As we shall see shortly, the interpolation functions depend not only on the number of nodes in the element, but also on the shape of the element. The shape of the element must be such that its geometry is uniquely deÞned by a set of nodes. A triangle (n = 3) is the simplest two-dimensional geometric shape in two dimensions.
2.3.3 Weak Formulation The n parameters (or nodal values) uej in Eq. (2.3.5) must be determined such that the approximate solution ue (x, y) satisÞes the governing Eq. (2.3.1) and boundary conditions of the problem. As in the case of a variational and weighted-residual method, we seek to satisfy the governing differential equation in a weighted-integral sense, as described in Section 2.2. The type of Þnite element model depends on the weighted-integral form used to generate the algebraic equations. Thus, if one uses the weak form, the resulting model will be different from those obtained with a weighted-residual statement in which the weight function can be any one of several choices. In the remainder of this chapter, we shall be primarily concerned with the weak form Þnite element models.
THE FINITE ELEMENT METHOD: A REVIEW
27
The weak form of a differential equation is a weighted-integral statement that is equivalent to both the governing differential equation as well as the associated natural boundary conditions. We shall develop the weak form of Eqs. (2.3.1) and (2.3.3) over the typical element Ωe using the three-step procedure. The Þrst step is to take all non-zero expressions in Eq. (2.3.1) to one side of the equality, multiply the resulting equation with a weight function w, and integrate the equation over the element domain Ωe : Z
∙
µ
∂ue ∂ 0= w − axx h ∂x ∂x Ωe
¶
µ
∂ue ∂ − ayy h ∂y ∂y
¶
¸
− f (x, y) dx dy
(2.3.6)
The expression in the square brackets of the above equation represents a residual of the approximation of the differential equation (2.3.1), because ueh (x, y) is only an approximation of u(x, y). For n independent choices of w, we obtain a set of n linearly independent algebraic equations. In the second step, we distribute the differentiation among u and w equally, so that both u and w are required to be differentiable only once with respect to x and y. To achieve this we use the component form of the gradient (or divergence) theorem, Z
Ωe
Z
Ωe
∂ (wF1 ) dx dy = ∂x ∂ (wF2 ) dx dy = ∂y
I I
Γe
Γe
(wF1 )nx ds
(2.3.7a)
(wF2 )ny ds
(2.3.7b)
where nx and ny are the components (i.e. the direction cosines) of the unit normal vector n ˆ = nxˆ ex + ny ˆ ey = cos α ˆ ex + sin α ˆ ey (2.3.8) on the boundary Γe , and ds is the arc length of an inÞnitesimal line element along the boundary. We obtain Z
∙
¸
axx
∂w ∂u ∂w ∂u + ayy − wf dx dy− ∂x ∂x ∂y ∂y
I
∙
¸
∂u ∂u nx + ayy ny ds e e ∂x ∂y Ω Γ (2.3.9) From an inspection of the boundary term in Eq. (2.3.9), we note that u is the primary variable, and speciÞcation of u constitutes the essential boundary condition. The coefficient of the weight function in the boundary expression, namely ∂u ∂u qn = axx (2.3.10) nx + ayy ny ∂x ∂y 0=
w axx
is the secondary variable. Its speciÞcation constitutes the natural boundary condition. By deÞnition qn is positive outward from the surface as we move counterclockwise along the boundary Γe . The secondary variable qn denotes the ßux normal to the boundary of the element.
28
NONLINEAR FINITE ELEMENT ANALYSIS
The third and last step of the formulation is to use the deÞnition (2.3.10) in Eq. (2.3.9) and write it as 0=
Z
Ωe
µ
axx
¶
∂w ∂u ∂w ∂u + ayy − wf dx dy − ∂x ∂x ∂y ∂y
I
Γe
w qn ds
(2.3.11)
or 0 = B(w, u) − `(w)
(2.3.12)
where the bilinear form B(·, ·) and linear form `(·) are deÞned by B(w, u) = `(w) =
Z Z
µ
axx
Ωe
w f dx dy +
Ωe
¶
∂w ∂u ∂w ∂u + ayy dx dy ∂x ∂x ∂y ∂y I
Γe
(2.3.13a)
wqn ds
(2.3.13b)
Note that the bilinear form is symmetric in its arguments (w, u) B(w, u) = B(u, w) and `(w) is linear in w. Therefore, it is possible to construct the associated quadratic functional from the formula I(u) =
1 2
B(u, u) − `(u)
(2.3.14)
2.3.4 Finite Element Model The weak form in Eq. (2.3.11) requires that the approximation chosen for u should be at least linear in both x and y so that there are no terms in (2.3.11) that become identically zero. Suppose that u is approximated over a typical Þnite element Ωe by the expression of the form (2.3.5). Substituting the Þnite element approximation (2.3.5) for u into the weak form (2.3.11), we obtain 0=
(Z n X
j=1
Ωe
"
∂w ∂x
Ã
axx
∂Lej ∂x
!
∂w + ∂y
Ã
ayy
∂Lej ∂y
!
#
)
I
− w f dx dy uej −
Γe
w qn ds
(2.3.15) This equation must hold for any weight function w. Since we need n independent algebraic equations to solve for the n unknowns, ue1 , ue2 , ..., uen , we choose n independent functions for w: w = Le1 , Le2 , ..., Len . This particular choice of weight functions is a natural one when the weight function is viewed P as a virtual variation of the dependent unknown (i.e. w = δue = ni=1 δuei Lei ).
THE FINITE ELEMENT METHOD: A REVIEW
29
For each choice of w we obtain an algebraic relation among (ue1 , ue2 , ..., uen ). The ith algebraic equation is obtained by substituting w = Lei into Eq. (2.3.15): n X
e e Kij uj = Qei + qie
(2.3.16)
j=1 e , Qe , and q e are deÞned by where the coefficients Kij i i
e Kij
Qei
= =
Z
Ωe
Z
Ωe
Ã
∂Le ∂Lej ∂Le ∂Lej axx i + ayy i ∂x ∂x ∂y ∂y
f
Lei
dx dy,
qie
=
I
Γe
!
dx dy
qn Lei ds
(2.3.17a) (2.3.17b)
e = K e (i.e. [K e ] is symmetric). The symmetry of the We note that Kij ji coefficient matrix is due to the symmetry of the bilinear form, which in turn is due to the weak form development. In matrix notation, Eq. (2.3.16) takes the form [K e ]{ue } = {Qe } + {q e } ≡ {F e } (2.3.18)
This completes the Þnite element model development. Before we discuss assembly of elements, it is informative to determine the interpolation functions Lei for certain basic two-dimensional Þnite elements.
2.3.5 Interpolation Functions The Þnite element approximation ue (x, y) of u(x, y) over an element Ωe must satisfy the following conditions in order for the approximate solution to converge to the true solution: 1. ue (x, y) must be continuous as required in the weak form of the problem (i.e. all terms in the weak form are represented as non-zero values). 2. The polynomials used to represent ue (x, y) must be complete (i.e. all terms, beginning with a constant term up to the highest order used in the polynomial should be included in the expression of ue (x, y)). 3. All terms in the polynomial should be linearly independent. The number of linearly independent terms in the representation of ue dictates the shape and number of degrees of freedom of the element. Here we review the interpolation functions of linear triangular and rectangular elements. An examination of the variational form (2.3.11) and the Þnite element matrices in Eq. (2.3.17a) shows that the Lei should be at least linear functions of x and y. The polynomial ue (x, y) = ce1 + ce2 x + ce3 y
(2.3.19)
30
NONLINEAR FINITE ELEMENT ANALYSIS
is the lowest-order polynomial that meets the requirements. It contains three linearly independent terms, and it is linear in both x and y. The polynomial is complete because the lower-order term, namely, the constant term, is included. To write the three constants (ce1 , ce2 , ce3 ) in terms of the nodal values of ue , we must identify three points or nodes in the element Ωe . The three nodes must be such that they uniquely deÞne the geometry of the element and allow the imposition of inter-element continuity of the variable ue (x, y). Obviously, the geometric shape deÞned by three points in a two-dimensional domain is a triangle. Thus the polynomial in Eq. (2.3.19) is associated with a triangular element and the three nodes are identiÞed as the vertices of the triangle. On the other hand, the polynomial ue (x, y) = ce1 + ce2 x + ce3 y + ce4 xy
(2.3.20)
contains four linearly independent terms, and is linear in x and y, with a bilinear term in x and y. This polynomial requires an element with four nodes. It is a rectangle with nodes at the four corners of the rectangle. The interpolation functions for linear triangular and rectangular elements are given below. Higher-order two-dimensional elements (i.e. element with higher-order interpolation polynomials) will be discussed in Section 2.4. Linear triangular element The linear interpolation functions for the three-node triangle [see Figure 2.3.2(a)] are (see Reddy [1, pp. 304—307]) Lei (x, y) =
1 (αe + βie x + γie y), 2Ae i
(i = 1, 2, 3)
(2.3.21)
where Ae is the area of the triangle, and αie , βie , and γie are geometric constants known in terms of the nodal coordinates (xi , yi ): αie = xj yk − xk yj ;
βie = yj − yk ;
γie = −(xj − xk )
(2.3.22)
for i 6= j 6= k, and i, j, and k permute in a natural order. Note that (x, y) are the global coordinates used in the governing equation (2.3.1) over the domain Ω. The interpolation functions Lei (i = 1, 2, . . . , n) satisfy the following interpolation properties: (i) Lei (xj , yj ) = δij ,
(i, j = 1, 2, 3);
(ii)
3 X
Lei (x, y) = 1 (2.3.23)
i=1
and they are called the Lagrange interpolation functions. Note that use of the linear interpolation functions Lei of a triangle will result in thePapproximation of the curved surface u(x, y) by a planar function ueh (x, y) = 3i=1 uei Lei (x, y).
THE FINITE ELEMENT METHOD: A REVIEW
y
y
_
y
3
4
Γe
Ωe
3
Γe
Ωe
b
1
31
_
1
2
2
a x
x
x
Figure 2.3.2 The linear (a) triangular and (b) rectangular Þnite elements. e and Qei can be evaluated for given The integrals in the deÞnition of Kij data: axx , ayy , and f . For example, for element-wise constant values of the data, that is, axx = aexx , ayy = aeyy , and f = f e , we have (see Reddy [1, pp. 311—313]) the following results: e Kij =
1 (ae β e β e + aeyy γie γje ); 4Ae xx i j
Qei =
fe Ae 3
(2.3.24)
where Ae is the area of the triangular element, and βie and γie are known in terms of the global nodal coordinates of the element nodes, as given in Eq. (2.3.22). For a right-angled triangular element with base a and height b, and node 1 at the right angle (nodes are numbered counterclockwise), [K e ] takes the form (see Reddy [1, p. 387]) ⎡
⎤
⎡
⎤
α −α 0 β 0 −β aeyy ae ⎣ 0 0 α 0⎦ + 0⎦ [K e ] = xx ⎣ −α 2 2 0 0 0 −β 0 β
(2.3.25)
where α = b/a and β = a/b. Of course, for cases in which the conductivities are functions of (x, y), numerical integration can be used to evaluate the coefficients (see Section 2.5.3). The evaluation of boundary integrals of the type qie
=
I
Γe
qne Lei (s) ds
(2.3.26)
where qne is a known function of the distance s along the boundary Γe , involves evaluation of line integrals. It is necessary to compute such integrals only when
32
NONLINEAR FINITE ELEMENT ANALYSIS
Γe , or a portion of it, coincides with the boundary Γq of the total domain Ω on which the ßux is speciÞed. On portions of Γe that are in the interior of the domain Ω, qne on side (i, j) of element Ωe cancels with qnf on side (p, q) of element Ωf when sides (i, j) of element Ωe and (p, q) of element Ωf are the same (i.e. at the interface of elements Ωe and Ωf ). This can be viewed as the balance of the internal ßux. When Γe falls on the boundary Γu of the domain Ω, qne is not known there and can be determined in the post-computation. Note that the primary variable u is speciÞed on Γu . For additional details, see Reddy [1, pp. 313—318]. Linear rectangular element For a linear rectangular element, we have u(¯ x, y¯) =
4 X
uei Lei (¯ x, y¯)
(2.3.27)
i=1
where Li are the Lagrange interpolation functions expressed in terms of the element coordinates (¯ x, y¯) (see Reddy [1, pp. 308—311]) y¯ x ¯ Le1 = (1 − )(1 − ), a b x ¯ y¯ e L3 = , ab
y¯ x ¯ (1 − ) a b x ¯ y¯ e L4 = (1 − ) a b
Le2 =
(2.3.28)
and (¯ x, y¯) denote the local coordinates with origin located at node 1 of the element, and (a, b) denote the horizontal and vertical dimensions of the rectangle [see Figure 2.3.2(b)]. e and Qe can be easily evaluated over a The integrals in the deÞnition of Kij i rectangular element of sides a and b. For example, for element-wise constant values of the data, that is, axx = aexx , ayy = aeyy , and f = f e , we have (see Reddy [1, p. 313; p. 387]) the following results: [K e ] = aexx [S 11 ] + aeyy [S 22 ],
Qei =
fe ab 4
(2.3.29)
where ⎡
⎤
(2.3.30a)
⎤
(2.3.30b)
2α −2α −α α ⎥ 1⎢ −2α 2α α −α 11 ⎥ [S ] = ⎢ ⎣ −α α 2α −2α ⎦ 6 α −α −2α 2α ⎡
2β ⎢ 1 β [S 22 ] = ⎢ ⎣ −β 6 −2β
β 2β −2β −β
−β −2β 2β β
−2β −β ⎥ ⎥ β⎦ 2β
THE FINITE ELEMENT METHOD: A REVIEW
33
and α = b/a and β = a/b. Again, for cases in which the conductivities are functions of (x, y), numerical integration is used to evaluate the coefficients, as discussed in Section 2.5.4. When the element is non-rectangular, that is, a quadrilateral, we use coordinate transformations to represent the integrals over a square geometry and then use numerical integration to evaluate them.
2.3.6 Assembly of Elements The assembly of Þnite elements to obtain the equations of the entire domain is based on the following two rules: 1. Continuity of the primary variable (i.e. temperature) 2. Balance of secondary variables (i.e. heat ßux) We illustrate the assembly procedure by considering a Þnite element mesh consisting of a triangular element and a quadrilateral element (see Figure 2.3.3). 1 Let Kij (i, j = 1, 2, 3) denote the coefficient matrix corresponding to the 2 (i, j = 1, 2, 3, 4) denote the coefficient matrix triangular element, and let Kij corresponding to the quadrilateral element. The nodes of the Þnite element mesh are called global nodes. From the mesh shown in Figure 2.3.3, it is clear that the following correspondence between global and element nodes exists: nodes 1, 2, and 3 of element 1 correspond to global nodes 1, 2, and 3, respectively. Nodes 1, 2, 3, and 4 of element 2 correspond to global nodes 2, 4, 5, and 3, respectively. Hence, the correspondence between the local and global nodal values of temperature is u11 = u1 , u12 = u21 = u2 , u13 = u24 = u3 , u22 = u4 , u23 = u5
(2.3.31)
which amounts to imposing the continuity of the primary variables at the nodes common to elements 1 and 2. Note that the continuity of the primary variables at the inter-element nodes guarantees the continuity of the primary variable along the entire inter-element boundary.
Global node numbers 3 3
1
1
5 3
4
2
1
Element (local) node numbers 2
4
2 1
2
Figure 2.3.3 Global—local correspondence of nodes for assembly of elements.
34
NONLINEAR FINITE ELEMENT ANALYSIS
Next, we consider the balance of secondary variables at the interelement boundaries. At the interface between the two elements, the ßux from the two elements should be equal in magnitude and opposite in sign. For the two elements shown in Figure 2.3.3, the interface is along the side connecting global nodes 2 and 3. Hence, the internal ßux qn1 on side 2—3 of element 1 should balance the ßux qn2 on side 4—1 of element 2 (recall the sign convention on qne ): (qn1 )2−3 = (qn2 )4−1 or (qn1 )2−3 = (−qn2 )1−4 (2.3.32) In the Þnite element method, the above relation is imposed in a weightedintegral sense: Z
h123
qn1 L12 ds = −
Z
h214
qn2 L21 ds,
Z
h123
qn1 L13 ds = −
Z
h214
qn2 L24 ds
(2.3.33)
where hepq denotes length of the side connecting node p to node q of element Ωe . Now we are ready to assemble the element equations for the two-element mesh. The element equations of the two elements are written separately Þrst. For the triangular element, the element equations are of the form 1 1 1 1 1 1 K11 u1 + K12 u2 + K13 u3 = Q11 + q11 1 1 1 1 1 1 K21 u1 + K22 u2 + K23 u3 = Q12 + q21 1 1 1 1 1 1 K31 u1 + K32 u2 + K33 u3 = Q13 + q31
(2.3.34a)
For the rectangular element the element equations are given by 2 2 2 2 2 2 2 2 K11 u1 + K12 u2 + K13 u3 + K14 u4 2 2 2 2 2 2 2 2 K21 u1 + K22 u2 + K23 u3 + K24 u4 2 2 2 2 2 2 2 2 K31 u1 + K32 u2 + K33 u3 + K34 u4 2 2 2 2 2 2 2 2 K41 u1 + K42 u2 + K43 u3 + K44 u4
= Q21 + q12 = Q22 + q22 = Q23 + q32 = Q24 + q42
(2.3.34b)
In order to impose the balance condition in (2.3.32), it is necessary to add the second equation of element 1 to the Þrst equation of element 2, and also add the third equation of element 1 to the fourth equation of element 2: 1 1 1 1 1 1 2 2 2 2 2 2 2 2 (K21 u1 + K22 u2 + K23 u3 ) + (K11 u1 + K12 u2 + K13 u3 + K14 u4 ) 1 1 2 2 = (Q2 + q2 ) + (Q1 + q1 ) 1 1 1 1 1 1 2 2 2 2 2 2 2 2 (K31 u1 + K32 u2 + K33 u3 ) + (K41 u1 + K42 u2 + K43 u3 + K44 u4 ) = (Q13 + q31 ) + (Q24 + q42 )
THE FINITE ELEMENT METHOD: A REVIEW
35
Using the local-global nodal variable correspondence in Eq. (2.3.1), we can rewrite the above equations as 1 1 2 1 2 2 2 K21 u1 + (K22 + K11 )u2 + (K23 + K14 )u3 + K12 u4 + K13 u5 1 2 1 2 = Q2 + Q1 + (q2 + q1 ) 1 1 2 1 2 2 2 K31 u1 + (K32 + K41 )u2 + (K33 + K44 )u3 + K42 u4 + K43 u5 1 2 1 2 = Q3 + Q4 + (q3 + q4 )
Now we can impose the conditions in Eq. (2.3.33) by setting appropriate portions of the expressions in parenthesis on the right-hand side of the above equations to zero (or a speciÞed non-zero value). In general, when several elements are connected, the assembly of the elements is carried out by e , Qe , and q e into proper locations of the global putting element coefficients Kij i i coefficient matrix and right-hand column vectors. This is done by means of the connectivity relations, that is, correspondence of the local node number to the global node number. The assembly procedure described above can be used to assemble elements of any shape and type. The procedure can be implemented in a computer with the help of the local-global nodal correspondence. For heat conduction problems that involve convection heat transfer at the boundary, that is, when heat is transferred from one medium to the surrounding medium (often, a ßuid) by convection, the Þnite element model developed earlier requires some modiÞcation. For a convection boundary, the natural boundary condition is a balance of energy transfer across the boundary due to conduction and/or convection (i.e. Newton’s law of cooling): (axx
∂u ∂u nx + ayy ny ) + hc (u − uc ) = qn ∂x ∂y
(2.3.35)
where hc is the convective conductance (or the convective heat transfer coefficient), uc is the (ambient) temperature of the surrounding ßuid medium, and qn is the speciÞed heat ßux. The Þrst term accounts for heat transfer by conduction, the second by convection, and the third accounts for the speciÞed heat ßux, if any. It is the presence of the term hc (u − uc ) that requires some modiÞcation of the weak form in Eq. (2.3.11). To include the convective boundary condition (2.3.35), the boundary integral in Eq. (2.3.9) should be modiÞed. Instead of replacing the coefficient of w in the boundary integral with qn , we use Eq. (2.3.35): 0= =
Z
Ωe
Z
Ωe
∙
axx
µ
¸
∂w ∂u ∂w ∂u + ayy − wf dx dy − ∂x ∂x ∂y ∂y
axx
¶
I
∂w ∂u ∂w ∂u + ayy − wf dx dy − ∂x ∂x ∂y ∂y
Γe
I
∙
w axx
Γe
¸
∂u ∂u nx + ayy ny ds ∂x ∂y
w[qn − hc (u − uc )] ds (2.3.36)
36
NONLINEAR FINITE ELEMENT ANALYSIS
or 0 = B(w, u) − `(w)
(2.3.37)
where w is the weight function, and B(·, ·) and `(·) are the bilinear and linear forms B(w, u) = `(w) =
Z Z
Ωe
Ωe
µ
axx
¶
I
∂w ∂u ∂w ∂u + ayy dx dy + ∂x ∂x ∂y ∂y
f w dx dy +
I
Γe
hc uc w ds +
I
Γe
Γe
hc wu ds
qn w ds
(2.3.38a) (2.3.38b)
Note that the unknown surface temperature in the convective boundary condition has been made part of the bilinear form B(·, ·) while all the known quantities remain part of the linear form `(·). The Þnite element model of Eq. (2.3.36) is (see Reddy [1], pp. 341—346) given by [K e ]{ue } = {F e }
(2.3.39)
where e Kij =
Fi =
Z
Ωe
Z
Ωe
µ
axx
∂Li ∂Lj ∂Li ∂Lj + ayy ∂x ∂x ∂y ∂y
f Li dx dy +
I
Γe
¶
hc uc Li ds +
dx dy +
I
Γe
I
Γe
qn Li ds
hc Li Lj ds
(2.3.40a) (2.3.40b)
The Þnite element model (2.3.39) is valid for both conductive and convective heat transfer boundary conditions. For problems with no convective boundary conditions, the convective contributions to the element coefficients are omitted. Indeed, these contributions have to be included only for those elements whose sides fall on the boundary with speciÞed convection heat transfer. The contribution due to convective boundaries to the element coefficient matrix and source vector can be computed by evaluating line integrals, as discussed in Reddy [1], pp. 342—345.
2.4 Library of Two-Dimensional Finite Elements 2.4.1 Introduction The objective of this section is to present a library of two-dimensional triangular and rectangular elements of the Lagrange family, that is, elements over which only the function — not its derivatives — are interpolated. Once we have elements of different shapes and order at our disposal, we can choose appropriate elements and associated interpolation functions for a given problem. The interpolation functions are developed here for regularly shaped elements, called master elements. These elements can be used for numerical
THE FINITE ELEMENT METHOD: A REVIEW
37
evaluation of integrals deÞned on irregularly shaped elements. This requires a transformation of the geometry from the actual element shape to its associated master element. We will discuss the numerical evaluation of integrals in Section 2.6.
2.4.2 Triangular Elements The three-node triangular element was developed in Section 2.3.5. Higherorder triangular elements (i.e. triangular elements with interpolation functions of higher degree) can be systematically developed with the help of the so-called area coordinates. For triangular elements, it is possible to construct three nonˆ i (i = 1, 2, 3), which vary in a direction normal to dimensional coordinates L the sides directly opposite each node (see Figure 2.4.1). The coordinates are deÞned such that 3 X ˆ i = Ai , A = L Ai (2.4.1) A i=1
where Ai is the area of the triangle formed by nodes j and k and an arbitrary point P in the element, and A is the total area of the element. For example, A1 is the area of the shaded triangle which is formed by nodes 2 and 3 and point P . The point P is at a perpendicular distance of s from the side connecting nodes 2 and 3. We have A1 = bs/2 and A = bh/2. Hence ˆ 1 = A1 = s L A h
(2.4.2)
ˆ 1 is zero on side 2—3 (hence, zero at nodes 2 and 3) and has a value Clearly, L ˆ 1 is the interpolation function associated with node of unity at node 1. Thus, L ˆ 2 and L ˆ 3 are the interpolation functions associated with nodes 1. Similarly, L 2 and 3, respectively. In summary, we have ˆi Li = L
3
L1= 0
b A1
h
A2
P A3
(2.4.3)
5 4
2
L 1 = 0.5
s
L1
6
P 2
L1= 1
1
3
1
ˆ i for triangular elements. Figure 2.4.1 DeÞnition of area coordinates L
38
NONLINEAR FINITE ELEMENT ANALYSIS
ˆ i can be used to construct interpolation functions The area coordinates L for higher-order triangular elements. For example, a higher-order element with k nodes per side (equally spaced on each side) has a total of n nodes n=
k−1 X i=0
(k − i) = k + (k − 1) + · · · + 1 =
k (k + 1) 2
(2.4.4)
and its degree is equal to k−1. The explicit forms of the interpolation functions for the linear and quadratic elements are recorded below:
{Le } =
⎧ ⎫ ˆ1 ⎬ ⎨L
{Le } =
ˆ ; L ⎩ ˆ2 ⎭ L3
⎧ ˆ 1 (2L ˆ 1 − 1) ⎫ L ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪L ⎪ ˆ ˆ ⎪ ⎪ (2 L − 1) 2 2 ⎪ ⎪ ⎪ ⎪ ⎨ˆ ⎬ ˆ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩
L3 (2L3 − 1) ˆ2 ⎪ ˆ 1L 4L ⎪ ⎪ ⎪ ˆ3 ⎪ ˆ ⎪ 4L2 L ⎪ ⎭ ˆ ˆ 4L3 L1
(2.4.5)
Note that the order of the interpolation functions in the above arrays corresponds to the node numbers shown in Figure 2.4.2(a). Thus, the Þrst three rows of the vectors in Eq. (2.4.5) correspond to the Þrst three nodes of the linear and quadratic elements, which correspond to the three vertices of the triangular element. The last three rows of the second vector in Eq. (2.4.5) associated with the quadratic element correspond to the mid-side nodes of the triangular element. A similar node-numbering scheme is used for rectangular elements, which are discussed next.
2.4.3 Rectangular Elements The Lagrange interpolation functions associated with rectangular elements can be obtained from the tensor product of corresponding one-dimensional Lagrange interpolation functions. We take a local coordinate system (ξ, η) such that −1 ≤ (ξ, η) ≤ 1. This choice of local coordinate system is dictated by the Gauss quadrature rule used in the numerical evaluation of integrals over the element (see Section 2.5). The linear and quadratic interpolation functions are given in Eqs. (2.4.6) and (2.4.7), respectively (see Figure 2.4.2(b) for the node numbers).
{Le } =
⎧ ⎫ (1 − ξ)(1 − η) ⎪ ⎪ ⎪ ⎪ ⎬ 1⎨
(1 + ξ)(1 − η) (1 + ξ)(1 + η) ⎪ 4⎪ ⎪ ⎪ ⎩ ⎭ (1 − ξ)(1 + η)
(2.4.6)
THE FINITE ELEMENT METHOD: A REVIEW
3
39
3 6 5
1
1 4
2
2
(a) 4
η
3
4
ξ 1
2
8
(b)
7
η
6
9
1
3
5
ξ
2
Figure 2.4.2 Linear and quadratic (a) triangular and (b) rectangular elements.
{Le } =
⎧ ⎫ (1 − ξ)(1 − η)(−ξ − η − 1) + (1 − ξ 2 )(1 − η 2 ) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ (1 + ξ)(1 − η)(ξ − η − 1) + (1 − ξ 2 )(1 − η2 ) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ (1 + ξ)(1 + η)(ξ + η − 1) + (1 − ξ 2 )(1 − η 2 ) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 2 2 ⎪ ⎨ (1 − ξ)(1 + η)(−ξ + η − 1) + (1 − ξ )(1 − η ) ⎪ ⎬
1 4⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩
2(1 − ξ 2 )(1 − η) − (1 − ξ 2 )(1 − η 2 ) 2(1 + ξ)(1 − η 2 ) − (1 − ξ 2 )(1 − η 2 ) 2(1 − ξ 2 )(1 + η) − (1 − ξ 2 )(1 − η 2 ) 2(1 − ξ)(1 − η 2 ) − (1 − ξ 2 )(1 − η 2 ) 4(1 − ξ 2 )(1 − η 2 )
⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎭
(2.4.7)
The serendipity elements are those rectangular elements that have no interior nodes. These elements have fewer nodes compared with the higherorder Lagrange elements. The interpolation functions of the serendipity elements are not complete, and they cannot be obtained using tensor products of one-dimensional Lagrange interpolation functions. Instead, an alternative procedure must be employed, as discussed in Reddy [1]. The interpolation functions for the two-dimensional quadratic serendipity element are given by
40
NONLINEAR FINITE ELEMENT ANALYSIS
(see Figure 2.4.3)
{Le } =
⎧ ⎫ (1 − ξ)(1 − η)(−ξ − η − 1) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ (1 + ξ)(1 − η)(ξ − η − 1) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ (1 + ξ)(1 + η)(ξ + η − 1) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎬ 1⎨
4⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩
(1 − ξ)(1 + η)(−ξ + η − 1) ⎪ 2(1 − ξ 2 )(1 − η) ⎪ ⎪ ⎪ 2 ⎪ 2(1 + ξ)(1 − η ) ⎪ ⎪ ⎪ 2 ⎪ 2(1 − ξ )(1 + η) ⎪ ⎪ ⎭ 2 2(1 − ξ)(1 − η )
(2.4.8)
η 4
7
6
8 1
3
5
ξ
2
Figure 2.4.3 Quadratic rectangular serendipity element.
2.5 Numerical Integration 2.5.1 Preliminary Comments An accurate representation of irregular domains (i.e. domains with curved boundaries) can be accomplished by the use of reÞned meshes and/or irregularly shaped curvilinear elements. For example, a non-rectangular region cannot be represented using rectangular elements; however, it can be represented by quadrilateral elements. Since the interpolation functions are easily derivable for a rectangular element and it is easier to evaluate integrals over rectangular geometries, we transform the Þnite element integral statements deÞned over quadrilaterals to a rectangle. The transformation results in complicated expressions for the integrands in terms of the coordinates used for the rectangular element. Therefore, numerical integration is used to evaluate such complicated integrals. The numerical integration schemes, such as the Gauss—Legendre numerical integration scheme, require the integral to be evaluated on a speciÞc domain or with respect to a speciÞc coordinate system.
THE FINITE ELEMENT METHOD: A REVIEW
41
2.5.2 Coordinate Transformations Gauss quadrature requires the integral to be expressed over a square region ˆ of dimension 2 × 2 with respect to the coordinate system, (ξ, η) to be such Ω that −1 ≤ (ξ, η) ≤ 1. The transformation of the geometry and the variable coefficients of the differential equation from the problem coordinates (x, y) to the local coordinates (ξ, η) results in algebraically complex expressions, and they preclude analytical (i.e. exact) evaluation of the integrals. Thus, the transformation of a given integral expression, deÞned over element Ωe , to one ˆ facilitates the numerical integration. Each element of the on the domain Ω ˆ only for the purpose of numerically Þnite element mesh is transformed to Ω, ˆ is called a master evaluating the integrals (see Figure 2.5.1). The element Ω element. For example, every quadrilateral element can be transformed to a square element with a side of length 2 and −1 ≤ (ξ, η) ≤ 1 that facilitates the use of Gauss—Legendre quadrature to evaluate integrals deÞned over the quadrilateral element. The transformation between a typical element Ωe in the mesh and the ˆ [or equivalently, between (x, y) and (ξ, η)] is accomplished master element Ω by a coordinate transformation of the form x=
m X
xej φej (ξ, η) ,
y=
j=1
m X
yje φej (ξ, η)
(2.5.1)
j=1
where φj denote the Þnite element interpolation functions of the master ˆ The coordinates in the master element are chosen to be the element Ω. natural coordinates (ξ, η) such that −1 ≤ (ξ, η) ≤ 1. This choice is dictated by the limits of integration in the Gauss quadrature rule used to evaluate the integrals. For this case, the φej denote the interpolation functions of the four-node rectangular element shown in Figure 2.4.2(b) (i.e. m = 4).
Ωe
η=1
η
ξ=1 ˆ Ω
ξ
y Ω2
1
Ω
Ω3
x
Figure 2.5.1 Transformation of quadrilateral elements to the master rectangular element for numerical evaluation of integrals.
42
NONLINEAR FINITE ELEMENT ANALYSIS
ˆ to the line The transformation (2.5.1) maps, for example, the line ξ = 1 in Ω deÞned parametrically by x = x(1, η) and y = y(1, η) in the xy-plane. In other ˆ is transformed, under the linear transformation, words, the master element Ω into a quadrilateral element (i.e. a four-sided element whose sides are not parallel) in the xy-plane. Conversely, every quadrilateral element of a mesh ˆ in the can be transformed to the same four-noded square (master) element Ω (ξ, η)-plane. In general, the dependent variable(s) of the problem are approximated by expressions of the form u(x, y) =
n X
uej Lej (x, y)
(2.5.2)
j=1
The interpolation functions Lej used for the approximation of the dependent variable, in general, are different from φej used in the approximation of the geometry. Depending on the relative degree of approximations used for the geometry [see Eq. (2.5.1)] and the dependent variable(s) [see Eq. (2.5.2)], the Þnite element formulations are classiÞed into three categories: 1. Superparametric (m > n). The approximation used for the geometry is higher order than that used for the dependent variable. 2. Isoparametric (m = n). Equal degree of approximation is used for both geometry and dependent variables. 3. Subparametric (m < n). Higher-order approximation of the dependent variable is used. It should be noted that the transformation of a quadrilateral element of ˆ is solely for the purpose of numerically a mesh to the master element Ω evaluating the integrals (see Figure 2.5.1). No transformation of the physical domain or elements is involved in the Þnite element analysis. The resulting algebraic equations of the Þnite element formulation are always in terms of the nodal values of the physical domain. Different elements of the Þnite element mesh can be generated from the same master element by assigning appropriate global coordinates to each of the elements. Master elements of a different order deÞne different transformations and hence different collections of Þnite elements within the mesh. For example, a quadratic rectangular master element can be used to generate a mesh of quadratic curvilinear quadrilateral elements. The transformations of a master element should be such that no spurious gaps exist between elements, and no element overlaps occur. For example, consider the element coefficients e Kij
=
Z
Ωe
"
#
∂Le ∂Lej ∂Le ∂Lej axx (x, y) i dx dy + ayy (x, y) i ∂x ∂x ∂y ∂y
(2.5.3)
THE FINITE ELEMENT METHOD: A REVIEW
43
The integrand (i.e. the expression in the square brackets under the integral) is a function of the global coordinates x and y. We must rewrite it in terms of ξ and η using the transformation (2.5.1). Note that the integrand contains not only functions but also derivatives with respect to the global coordinates (x, y). ∂Le ∂Le ∂Le ∂Le Therefore, we must relate ( ∂xi , ∂yi ) to ( ∂ξi , ∂ηi ) using the transformation (2.5.1). The functions Lei (x, y) can be expressed in terms of the local coordinates (ξ, η) by means of the transformation (2.5.1). Hence, by the chain rule of partial differentiation, we have ∂Lei ∂Lei ∂x ∂Lei ∂y = + ; ∂ξ ∂x ∂ξ ∂y ∂ξ
∂Lei ∂Lei ∂x ∂Lei ∂y = + ∂η ∂x ∂η ∂y ∂η
or, in matrix notation, ( ∂Le ) i
∂ξ ∂Lei ∂η
=
" ∂x ∂ξ ∂x ∂η
∂y ∂ξ ∂y ∂η
# ( ∂Le ) i
∂x ∂Lei ∂y
(2.5.4)
which gives the relation between the derivatives of Lei with respect to the global and local coordinates. The matrix in Eq. (2.5.4) is called the Jacobian matrix of the transformation (2.5.1): e
[J ] =
" ∂x
∂y ∂ξ ∂y ∂η
∂ξ ∂x ∂η
#
(2.5.5)
e in Eq. (2.5.3) that we must relate Note from the expression given for Kij
∂Le
∂Le
∂Le
∂Le
( ∂xi , ∂yi ) to ( ∂ξi , ∂ηi ), whereas Eq. (2.5.4) provides the inverse relations. Therefore, Eq. (2.5.4) must be inverted. We have ( ∂Le ) i
∂x ∂Lei ∂y
( ∂Le ) i
= [J e ]−1
∂ξ ∂Lei ∂η
(2.5.6)
This requires that the Jacobian matrix [J e ] be non-singular. Using the transformation (2.5.1), we can write m ∂φej ∂x X xj = , ∂ξ ∂ξ j=1
m ∂φej ∂y X yj = ∂ξ ∂ξ j=1
(2.5.7a)
m ∂φej ∂x X xj = , ∂η j=1 ∂η
m ∂φej ∂y X yj = ∂η j=1 ∂η
(2.5.7b)
and by means of Eq. (2.5.5) one can compute the Jacobian matrix and then its inverse. Thus, given the global coordinates (xj , yj ) of element nodes and
44
NONLINEAR FINITE ELEMENT ANALYSIS
the interpolation functions φej used for geometry, the Jacobian matrix can be evaluated using Eq. (2.5.5). A necessary and sufficient condition for [J]−1 to exist is that the determinant J, called the Jacobian, be non-zero at every ˆ: point (ξ, η) in Ω Je ≡ det[J e ] =
∂x ∂y ∂x ∂y − 6= 0. ∂ξ ∂η ∂η ∂ξ
(2.5.8)
From Eq. (2.5.8) it is clear that the functions ξ(x, y) and η(x, y) must be continuous, differentiable, and invertible. Moreover, the transformation should be algebraically simple so that the Jacobian matrix can be easily evaluated. Transformations of the form in Eq. (2.5.1) satisfy these requirements and the requirement that no spurious gaps between elements or overlapping of elements occur. Returning to numerical evaluation of integrals, we have from Eq. (2.5.6), ( ∂Le ) i
∂x ∂Lei ∂y
( ∂Le ) i
= [J]−1
∂ξ ∂Lei ∂η
( ∂Le ) i
≡ [J ∗ ]
∂ξ ∂Lei ∂η
(2.5.9)
where Jij∗ is the element in position (i, j) of the inverse of the Jacobian matrix [J e ]. The element area dA = dx dy in element Ωe is transformed to dA = |[J e ]| dξ dη
(2.5.10)
ˆ in the master element Ω. Equations (2.5.7)-(2.5.10) provide the necessary relations to transform ˆ integral expressions on any element Ωe to an associated master element Ω. For instance, consider the integral expression in Eq. (2.5.3), where axx and ayy are functions of x and y. Suppose that the Þnite element Ωe can be ˆ e . Under the transformation (2.5.1) we can generated by the master element Ω write e Kij
= =
Z
Ωe
Z
ˆe Ω
"
#
∂Le ∂Lej ∂Le ∂Lej axx (x, y) i dx dy + ayy (x, y) i ∂x ∂x ∂y ∂y
Fij (ξ, η) dξ dη
(2.5.11)
The discussion presented above is valid for master elements of both rectangular and triangular geometry.
2.5.3 Integration Over a Master Rectangular Element ˆ R can be numerically Integrals deÞned over a rectangular master element Ω evaluated using the Gauss—Legendre quadrature formulas Z
ˆR Ω
F (ξ, η) dξ dη =
Z 1Z 1
−1 −1
F (ξ, η) dξ dη ≈
N M X X
F (ξI , ηJ ) WI WJ (2.5.12)
I=1J=1
THE FINITE ELEMENT METHOD: A REVIEW
45
where M and N denote the number of Gauss quadrature points, (ξI , ηJ ) denote the Gauss point coordinates, and WI and WJ denote the corresponding Gauss weights as shown in Table 2.5.1 (from Table 7.2 in Reddy [1]). Table 2.5.1 Gauss quadrature points and weights for rectangular elements. R1
−1
N
F (ξ) dξ =
PN
I =1
F (ξI ) WI
Points, ξI
Weights, WI
1
0.0000000000
2.0000000000
2
± 0.5773502692
1.0000000000
0.0000000000
0.8888888889 0.5555555555
3
± 0.7745966692
4 5
± 0.3399810435 ± 0.8611363116
0.6521451548 0.3478548451
0.0000000000
0.5688888889 0.4786286705 0.2369268850
± 0.5384693101 ± 0.9061798459
6
± 0.2386191861 ± 0.6612093865 ± 0.9324695142
0.4679139346 0.3607615730 0.1713244924
The selection of the number of Gauss points is based on the formula N = int[(p+1)/2]+1, where p is the polynomial degree to which the integrand is approximated. In most cases, the interpolation functions are of the same degree in both ξ and η, and therefore one has M = N . When the integrand is of a different degree in ξ and η, we use max(M, N ). The minimum allowable quadrature rule is one that yields the area or volume of the element exactly. The maximum degree of the polynomial refers to the degree of the highest polynomial in ξ or η that is present in the integrands of the element matrices of the type in Eq. (2.5.3). Note that the polynomial degree of coefficients as well as Jije should be accounted for in determining the total polynomial degree of the integrand. Of course, the coefficients axx , ayy , and Jije , in general, may not be polynomials. In those cases, their functional variations must be approximated by a suitable polynomial (e.g. by a binomial series) in order to determine the polynomial degree of the integrand.
2.5.4 Integration Over a Master Triangular Element In the preceding section, we discussed numerical integration on quadrilateral elements which can be used to represent very general geometries as well as Þeld variables in a variety of problems. Here we discuss numerical integration
46
NONLINEAR FINITE ELEMENT ANALYSIS
on triangular elements. Since quadrilateral elements can be geometrically distorted, it is possible to distort a quadrilateral element to obtain a required triangular element by moving the position of the corner nodes, and the fourth corner in the quadrilateral is merged with one of the neighboring nodes. In actual computation, this is achieved by assigning the same global node number to two corner nodes of the quadrilateral element. Thus, master triangular elements can be obtained in a natural way from associated master rectangular elements. Here we discuss the transformations from a master triangular element to an arbitrary triangular element. We choose the unit right isosceles triangle (see Table 2.5.2) as the master element. An arbitrary triangular element Ωe can be generated from the master ˆ T by transformation of the form (2.6.1). The derivatives triangular element Ω e of Li with respect to the global coordinates can be computed from Eq. (2.5.6), which take the form ⎧ e⎫ ∂L ⎪ ⎨ ∂xi ⎪ ⎬ ⎪ ⎩
∂Lei ∂y
⎪ ⎭
= [J e ]−1
⎧ ∂Le ⎫ ⎪ ⎨ ∂ Lˆ i ⎪ ⎬ 1
e ⎪ ⎩ ∂Li ⎪ ⎭
⎡ ⎢
[J e ] = ⎣
,
ˆ2 ∂L
∂x ˆ1 ∂L
∂y ˆ1 ∂L
∂x ˆ2 ∂L
∂y ˆ2 ∂L
⎤ ⎥ ⎦
(2.5.13)
ˆ 1 and L ˆ 2 are treated as linearly independent coordinates Note that only L ˆ ˆ ˆ because L3 = 1 − L1 − L2 . ˆ T have the form After transformation, integrals on Ω Z
Ωe
G(ξ, η) dξ dη =
Z
Ωe
ˆ 1, L ˆ 2, L ˆ 3 ) dL ˆ 1 dL ˆ2 G(L
(2.5.14)
which can be approximated by the quadrature formula Z
Ωe
ˆ 1, L ˆ 2, L ˆ 3 ) dL ˆ 1 dL ˆ2 ≈ G(L
N X
G(SI )WI
(2.5.15)
I=1
where WI and SI denote the weights and integration points of the quadrature rule. Table 2.5.2 contains the location of integration points and weights for one-, three-, and four-point quadrature rules over triangular elements.
2.6 Computer Implementation 2.6.1 General Comments In this section, computer implementation of Þnite element calculations is presented to illustrate the ease with which theoretical ideas can be transformed into practice. The material presented here is based on a more detailed account presented by Reddy [1] and Reddy and Gartling [4]. We begin with some general comments on a typical Þnite element program.
THE FINITE ELEMENT METHOD: A REVIEW
47
Table 2.5.2 Quadrature weights and points for triangular elements. Number of integration points 1
Degree of polynomial Order of the residual
ˆ1 L
1 O(h2 )
1/3 1/3 1/3
Location of integration points ˆ2 L
ˆ3 L
W 1
Geometric locations a a
3
2 O(h3 )
1/2 0 1/2 1/2 1/2 0 0 1/2 1/2
1/3
a b c
a
b c
3 4
O(h4 )
1/3 0.6 0.2 0.2
1/3 0.2 0.6 0.2
1/3 0.2 0.2 0.6
−27/48
25/48 25/48 25/48
a b c d
b c
a d
A typical computer program consists of three basic parts: 1. Preprocessor 2. Processor 3. Postprocessor In the preprocessor part of a program, the input data of the problem are read in and/or generated. This includes the geometry of the domain, analysis option (e.g. static, eigenvalue, or transient analysis), the data of the problem (e.g. deÞnition of the coefficients appearing in the differential equation), boundary conditions, Þnite element analysis information (e.g. element type, number of elements, geometric information required to generate the Þnite element mesh and element connectivity), and indicators for various postprocessing options (e.g. print, no print, types of quantities to be calculated, and so on). In the postprocessor part of the program, the solution is computed by interpolation at points other than the nodes, secondary variables that are derivable from the solution are also computed, and the output data are
48
NONLINEAR FINITE ELEMENT ANALYSIS
processed in a desired format for printout and/or plotting. The preprocessor and postprocessor computer modules may contain a few Fortran statements to read and print pertinent information, simple subroutines (e.g. subroutines to generate mesh and compute the gradient of the solution), or complex programs linked to other units via disk and tape Þles. The processor module, where typically large amounts of computing time are spent, may consist of several subroutines, each having a special purpose. The main modules include: 1. Generation of the element matrices using numerical integration. 2. Assembly of element equations. 3. Imposition of the boundary conditions. 4. Solution of the algebraic equations for the nodal values of the primary variables (see Appendix 1). The degree of sophistication and the complexity of a Þnite element program depend on the general class of problems being programmed, the generality of the data in the equation, and the intended user of the program. Figure 2.6.1 contains the ßow chart of a typical Þnite element computer program. A typical but simple Þnite element programs are included in the book by Reddy [1] and interested reader may wish to study Chapters 7 and 13 of [1], where details of the implementation of one- and two-dimensional problems of heat transfer, ßuid mechanics, and solid mechanics are discussed.
2.6.2 One-Dimensional Problems Here we discuss the main ideas behind the calculation of element coefficient matrices, [K e ], [M e ], and {f e } for the model problem discussed in Sections 2.2 and 2.3 (see Chapter 8 for transient problems). Recall that the coefficient matrices are of the form e Kij
Mije
=
Z xb " xa
=
Z xb xa
#
dLe dLej a(x) i + c(x)Lei Lej dx dx dx
ct (x)Lei Lej
dx,
fie
=
Z xb xa
f (x)Lei (x) dx
(2.6.1)
We use the coordinate transformation of the form [see Eq. (2.5.1)] x=
M X
xej φej (ξ)
(2.6.2)
j=1
to express the integrals posed over a typical element Ωe = (xa , xb ) as those over the interval, −1 ≤ ξ ≤ 1, so that we can use the Gauss quadrature to
THE FINITE ELEMENT METHOD: A REVIEW
49
Processor Initialize global [K], [M], {F}
Preprocessor
DO e = 1 to n
Transfer global information (material properties, geometry and solution) to element CALL ELKMF to calculate Kij(e) Mij(e), and fi(e), and assemble to form global [K], [M], and {F} Impose boundary conditions
Postprocessor
Solve the equations
Figure 2.6.1 The ßow chart of a typical Þnite element program. evaluate them numerically. In Eq. (2.6.2), xej denote the global coordinates of node j of element ω e = (xa , xb ), and φej are the approximation functions used to approximate the geometry. For example, if we use linear interpolation functions φej (ξ) = Lej (ξ) to represent the geometry of the element, we have xe1 = xa , xe2 = xb and Eq. (2.6.2) becomes xa + xb xb − xa he + ξ = xa + ξ 2 2 2 The Jacobian of transformation is given by x = xa Le1 (ξ) + xb Le2 (ξ) =
Je ≡
dx he = dξ 2
(2.6.3)
(2.6.4)
The above transformation is exact for all (straight) line elements. The derivatives of Lei (x) with respect to the global coordinate x is given by dLei dLei dξ dLei −1 = = J dx dξ dx dξ e
50
NONLINEAR FINITE ELEMENT ANALYSIS
Then the integrals in Eq. (2.6.1) become e Kij
=
Z xb " xa
=
Z 1 " −1
Mije = fie =
Z xb xa
Z xb xa
#
dLe dLej a(x) i + c(x)Lei Lej dx dx dx µ
dLei −1 Je a ˆ(ξ) dξ
¶Ã
ct (x)Lei Lej dx =
Z 1 ³
f (x)Lei (x) dx =
#
−1
´
cˆt (ξ)Lei Lej Je dξ
−1
Z 1
!
dLej −1 J + cˆ(ξ)Lei Lej Je dξ dξ e
fˆ(ξ)Lei Lej Je dξ
(2.6.5)
where a ˆ(ξ) = a(x(ξ)) and so on. Each of the integral expressions above can be evaluated using the Gauss quadrature Z 1
−1
F (ξ)Je dξ =
NX GP
F (ξNI ) Je WN I
(2.6.6)
NI=1
where N GP is the number of Gauss points, ξNI is the N Ith Gauss point, and WNI is the N Ith Gauss weight. To implement the above development into a computer subroutine for arbitrary degree of Lei , we must Þrst create a subroutine of all interpolations functions and their derivatives with respect to ξ that we intend to use in our analysis. For the present discussion, we limit them to the linear and quadratic Lagrange family of functions. These functions and their derivatives are given below. Linear L1 (ξ) =
1 (1 − ξ) , 2
dL1 = −0.5; dξ
L2 (ξ) =
1 (1 + ξ) , 2
dL2 = 0.5 (2.6.7) dξ
Quadratic 1 L1 (ξ) = − ξ (1 − ξ) , 2 ³
´
L2 (ξ) = 1 − ξ 2 , 1 L3 (ξ) = ξ (1 + ξ) , 2
dL1 = 0.5 (2ξ − 1) dξ dL2 = −2ξ dξ dL3 = 0.5 (1 + 2ξ) dξ
(2.6.8)
The following variables names are used in the subroutine (see INTRPL1D in Box 2.6.1): SFL(i) = Li ,
DSFL(i) =
dLi , dξ
GDSFL(i) =
dLi dx
THE FINITE ELEMENT METHOD: A REVIEW
51
Box 2.6.1 Listing of subroutine INTRPL1D.
C C C C C C C C C C C C C C
SUBROUTINE INTRPL1D(ELX,GJ,IEL,NPE,XI) __________________________________________________________________ The subroutine computes shape functions and their derivatives for Hermite cubic and Lagrange linear, quadratic, and cubic elements X......……... Global (i.e. problem) coordinate XI ....…….. Local (i.e. element) coordinate H......…….. Element length {SFL}...…. Interpolation (or shape) functions {DSFL}..... First derivative of SF with respect to XI {GDSFL}.. First derivative of SF with respect to X GJ.....……. Jacobian of the transformation __________________________________________________________________ IMPLICIT REAL*8(A-H,O-Z) COMMON /SHP/SFL(4),GDSFL(4) DIMENSION DSFL(4),ELX(3)
C C SHAPE FUNCTIONS AND THEIR DERIVATIVES C C Linear functions C IF(IEL.EQ.1)THEN SFL(1)=0.5*(1.0-XI) SFL(2)=0.5*(1+XI) DSFL(1)=-0.5 DSFL(2)=0.5 ENDIF C C Quadratic functions C IF(IEL.EQ.2)THEN SFL(1)=0.5*(XI-1.0)*XI SFL(2)=1.0-XI*XI SFL(3)=0.5*(XI+1.0)*XI DSFL(1)=XI-0.5 DSFL(2)=-2.0*XI DSFL(3)=XI+0.5 ENDIF GJ=0.0 DO 10 I=1,NPE 10 GJ=GJ+DSFL(I)*ELX(I) DO 30 I=1,NPE GDSFL(I)=DSFL(I)/GJ 30 CONTINUE C RETURN END
The notation should be transparent to the reader: SFL = Shape Functions of the Lagrange family; DSF L = Derivative of SF L with respect to ξ; and GDSF L = Global Derivative (i.e. derivative with respect to x) of SF L. All of them are n × 1 arrays, where n is the Nodes Per Element, NPE (i.e. n = NPE). In addition, GJ is used for the Jacobian J and XI for ξ.
52
NONLINEAR FINITE ELEMENT ANALYSIS
Next, we implement the steps to evaluate the matrix coefficients Kij , Mij , and fi (i = 1 to NPE) into a subroutine called ELEKMF1D. To this end, we must assume some form of the data, a(x), c(x), ct (x) and f (x). Although we can use any integrable functions, we restrict in the present discussion our choice of these coefficients to linear polynomials for the entire domain of the problem: a(x) = a0 + a1 x,
f (x) = f0 + f1 x (2.6.9) Obviously, the coefficients of the polynomials must be read in the preprocessor and transferred to the subroutine ELEKMF1D through a common block (or the argument list). Since the evaluation of the matrix coefficients involves summation on the number of Gauss points, the arrays used for [K], [M ], and {f } must be initialized outside the do-loop on NGP, the Number of Gauss Points. The following notation is used: e ELK(i,j) = Kij ,
c(x) = c0 + c1 x,
ct (x) = ct0 + ct1 x,
ELM(i,j) = Mije ,
ELF(i) = fie , i = 1, 2, . . . , N P E (2.6.11) The Gauss points are arranged in a matrix form so that the Jth column corresponds to the Jth order Guass rule. The same notation is used for the Gauss weights: GAU SP T (N I, N J) = ξNI , N Ith Gauss point of the N Jpoint Gauss rule; GAU SW T (N I, N J) = WNI , N Ith Gauss weight of the N J weight Gauss rule. Inside the do-loop on N I = 1 to N GP , we must call Subroutine INTRPL1D to compute SF L(i) and GDSF L(i) at the N Ith Gauss point and then compute all necessary quantities. Box 2.6.2 contains a listing of Subroutine ELEKMF1D.
2.6.3 Two-Dimensional Problems The ideas presented in Section 2.6.2 for one-dimensional problems extend in a straightforward way to two-dimensional problems. The main differences are: (a) numerical integration over two-dimensional elements; (b) the Jacobian Je is the determinant of the Jacobian matrix [J e ] deÞned in Eq. (2.5.5); and (c) global derivatives of the interpolation functions are determined using Eq. (2.5.9). The Fortran statements of generating element coefficient matrices [K e ], [M e ], and {Qe } are provided in the form of subroutine ELEKMF2D in Box 2.6.3, along with the subroutine INTRPL2D for interpolation functions of rectangular elements and subroutine TEMPORAL for generating the ˆ e ] and {Fˆ e } deÞned in Eq. (8.2.10) for transient coefficient matrices [K problems.
THE FINITE ELEMENT METHOD: A REVIEW
53
Box 2.6.2 Listing of subroutine ELEKMF1D. C C C C C C C C C C C C C
C
C
SUBROUTINE ELEKMF1D(MODEL,NDF,NGP,NPE) __________________________________________________________________ IEL....…….. Element TYPE (1, Linear; 2, Quadratic) H......……… Element length X......……… Global (i.e. problem) coordinate XI ....……… Local (i.e. element) coordinate [GAUSPT].. 4×4 matrix of Gauss points: Nth column corresponds to the N-point Guass rule [GAUSWT]. 4×4 matrix of Gauss weights (see the comment above) [ELK]..…… Element coefficient matrix [K] {ELF}..….. Element source vector {f} {ELX}..….. Vector of the global coordinates of element nodes IMPLICIT REAL*8(A-H,O-Z) COMMON/STF1/ELK(9,9),ELF(9),ELX(4) COMMON/STF2/AX0,AX1,CX0,CX1,FX0,FX1 COMMON/SHP/SF(4),GDSF(4) DIMENSION GAUSPT(5,5),GAUSWT(5,5) DATA GAUSPT/5*0.0D0,−0.57735027D0,0.57735027D0,3*0.0D0,−0.77459667D0, * 0.0D0,0.77459667D0,2*0.0D0,−0.86113631D0,−0.33998104D0,0.33998104D0, * 0.86113631D0,0.0D0,−0.906180D0,−0.538469D0,0.0D0,0.538469D0,0.906180D0/ DATA GAUSWT/2.0D0,4*0.0D0,2*1.0D0,3*0.0D0,0.55555555D0,0.88888888D0, * 0.55555555D0,2*0.0D0,0.34785485D0,2*0.65214515D0,0.34785485D0,0.0D0, * 0.236927D0,0.478629D0,0.568889D0,0.478629D0,0.236927D0/
H = ELX(NPE) - ELX(1) IEL = NPE-1 C Initialize the arrays DO 10 J=1,NPE ELF(J) = 0.0 DO 10 I=1,NPE 10 ELK(I,J)=0.0 C DO-LOOP on number of Gauss points begins here DO 40 NI=1,NGP XI=GAUSS(NI,NGP) CALL INTRPL1D(ELX,GJ,IEL,NPE,XI) CNST=GJ*WT(NI,NGP) X=ELX(1)+0.5*(1.0+XI)*H AX=AX0+AX1*X CX=CX0+CX1*X FX=FX0+FX1*X C Calculate element coefficients DO 20 I=1,NPE ELF(I)=ELF(I)+FX*SFL(I)*CNST DO 20 J=1,NPE S00=SFL(I)*SFL(J)*CNST S11=GDSFL(I)*GDSFL(J)*CNST ELK(I,J)=ELK(I,J)+AX*S11+CX*S00 20 CONTINUE 40 CONTINUE RETURN END
2.7 Closure The present chapter was devoted to a study of (1) the Þnite element models of one- and two-dimensional problems involving Poisson’s equation, (2) a derivation of interpolation functions for basic one- and twodimensional elements, (3) numerical evaluation of integrals, and (4) computer implementation ideas. An understanding of the topics presented in this chapter is a prerequisite for the subsequent chapters of this book.
54
NONLINEAR FINITE ELEMENT ANALYSIS
Box 2.6.3 Listings of subroutines ELEKMF2D, INTRPL2D, and TEMPORAL. C C C C C C C
C
C
C C C C
SUBROUTINE ELEKMF2D(NPE,NN,ITEM) ________________________________________________________________ Element calculations based on linear and quadratic rectangular elements and isoparametric formulation are carried out for the heat transfer and penalty model of viscous incompressible fluid flow. ________________________________________________________________ IMPLICIT REAL*8(A-H,O-Z) COMMON/STF/ELF(18),ELK(18,18),ELM(18,18),ELXY(9,2),ELU(18),A1,A2 COMMON/PST/A10,A1X,A1Y,A20,A2X,A2Y,C0,CX,CY,F0,FX,FY COMMON/SHP/SF(9),GDSF(2,9),SFH(16) COMMON/PNT/IPDF,IPDR,NIPF,NIPR DIMENSION GAUSPT(5,5),GAUSWT(5,5) COMMON/IO/IN,ITT DATA GAUSPT/5*0.0D0, −0.57735027D0, 0.57735027D0, 3*0.0D0, 2 −0.77459667D0, 0.0D0, 0.77459667D0, 2*0.0D0, −0.86113631D0, 3 −0.33998104D0, 0.33998104D0, 0.86113631D0, 0.0D0, −0.90617984D0, 4 −0.53846931D0,0.0D0,0.53846931D0,0.90617984D0/ DATA GAUSWT/2.0D0, 4*0.0D0, 2*1.0D0, 3*0.0D0, 0.55555555D0, 2 0.88888888D0, 0.55555555D0, 2*0.0D0, 0.34785485D0, 3 2*0.65214515D0, 0.34785485D0, 0.0D0, 0.23692688D0, 4 0.47862867D0, 0.56888888D0, 0.47862867D0, 0.23692688D0/ NDF = NN/NPE NET=NPE Initialize the arrays
DO 120 I = 1,NN ELF(I) = 0.0 DO 120 J = 1,NN IF(ITEM.NE.0) THEN ELM(I,J)= 0.0 ENDIF 120 ELK(I,J)= 0.0 C C Do-loops on numerical (Gauss) integration begin here. Subroutine C INTRPL2D is called here C DO 200 NI = 1,IPDF DO 200 NJ = 1,IPDF XI = GAUSPT(NI,IPDF) ETA = GAUSPT(NJ,IPDF) CALL INTRPL2D (NPE,XI,ETA,DET,ELXY,NDF) CNST = DET*GAUSWT(NI,IPDF)*GAUSWT(NJ,IPDF) X=0.0 Y=0.0 DO 140 I=1,NPE X=X+ELXY(I,1)*SF(I) 140 Y=Y+ELXY(I,2)*SF(I) C SOURCE=F0+FX*X+FY*Y IF(ITEM.NE.0) THEN CT=C0+CX*X+CY*Y ENDIF A11=A10+A1X*X+A1Y*Y A22=A20+A2X*X+A2Y*Y C II=1 DO 180 I=1,NET JJ=1 DO 160 J=1,NET S00=SF(I)*SF(J)*CNST S11=GDSF(1,I)*GDSF(1,J)*CNST S22=GDSF(2,I)*GDSF(2,J)*CNST C C Heat transfer and like problems (i.e. single DOF problems):_______ C ELK(I,J) = ELK(I,J) + A11*S11 + A22*S22 + A00*S00 IF(ITEM.NE.0) THEN ELM(I,J) = ELM(I,J) + CT*S00 ENDIF 160 JJ = NDF*J+1 C Source of the form fx = F0 + FX*X + FY*Y is assumed L=(I-1)*NDF+1 ELF(L) = ELF(L)+CNST*SF(I)*SOURCE 180 II = NDF*I+1 200 CONTINUE
THE FINITE ELEMENT METHOD: A REVIEW
C C C C
C C C C C C C C C C C C C C C C C C C C
C
IF(ITEM.NE.0) THEN Compute the coefficient matrices of the final algebraic equations (i.e. after time approximation) in the transient analysis:_______ CALL TEMPORAL(NN) ENDIF RETURN END SUBROUTINE INTRPL2D(NPE,XI,ETA,DET,ELXY,NDF) ________________________________________________________________ The subroutine evaluates the interpolation functions (SF(I)) and their derivatives with respect to global coordinates (GDSF(I,J)) for Lagrange linear & quadratic rectangular elements, using the isoparametric formulation. The subroutine also evaluates Hermite interpolation functions and their global derivatives using the subparametric formulation. SF(I).....……..Interpolation function for node I of the element DSF(J,I)..……Derivative of SF(I) with respect to XI if J=1 and and ETA if J=2 GDSF(J,I)…...Derivative of SF(I) with respect to X if J=1 and and Y if J=2 XNODE(I,J)...J-TH (J=1,2) Coordinate of node I of the element NP(I).....…….Array of element nodes (used to define SF and DSF) GJ(I,J)...…….Jacobian matrix GJINV(I,J)….Inverse of the jacobian matrix ________________________________________________________________ IMPLICIT REAL*8 (A-H,O-Z) DIMENSION ELXY(9,2),XNODE(9,2),NP(9),DSF(2,9),GJ(2,2),GJINV(2,2) COMMON/SHP/SF(9),GDSF(2,9) COMMON/IO/IN,ITT DATA XNODE/-1.0D0, 2*1.0D0, -1.0D0, 0.0D0, 1.0D0, 0.0D0, -1.0D0, * 0.0D0, 2*-1.0D0, 2*1.0D0, -1.0D0, 0.0D0, 1.0D0, 2*0.0D0/ DATA NP/1,2,3,4,5,7,6,8,9/ FNC(A,B) = A*B IF(NPE.EQ.4) THEN
C C LINEAR Lagrange interpolation functions for FOUR-NODE element C DO 10 I = 1, NPE XP = XNODE(I,1) YP = XNODE(I,2) XI0 = 1.0+XI*XP ETA0=1.0+ETA*YP SF(I) = 0.25*FNC(XI0,ETA0) DSF(1,I)= 0.25*FNC(XP,ETA0) 10 DSF(2,I)= 0.25*FNC(YP,XI0) ELSE IF(NPE.EQ.8) THEN C C QUADRATIC Lagrange interpolation functions for EIGHT-NODE element C DO 20 I = 1, NPE NI = NP(I) XP = XNODE(NI,1) YP = XNODE(NI,2) XI0 = 1.0+XI*XP ETA0 = 1.0+ETA*YP XI1 = 1.0-XI*XI ETA1 = 1.0-ETA*ETA IF(I.LE.4) THEN SF(NI) = 0.25*FNC(XI0,ETA0)*(XI*XP+ETA*YP-1.0) DSF(1,NI) = 0.25*FNC(ETA0,XP)*(2.0*XI*XP+ETA*YP) DSF(2,NI) = 0.25*FNC(XI0,YP)*(2.0*ETA*YP+XI*XP) ELSE IF(I.LE.6) THEN SF(NI) = 0.5*FNC(XI1,ETA0) DSF(1,NI) = -FNC(XI,ETA0) DSF(2,NI) = 0.5*FNC(YP,XI1) ELSE SF(NI) = 0.5*FNC(ETA1,XI0) DSF(1,NI) = 0.5*FNC(XP,ETA1) DSF(2,NI) = -FNC(ETA,XI0) ENDIF ENDIF 20 CONTINUE ELSE
55
56
NONLINEAR FINITE ELEMENT ANALYSIS
C C C
QUADRATIC Lagrange interpolation functions for NINE-NODE element
DO 30 I=1,NPE NI = NP(I) XP = XNODE(NI,1) YP = XNODE(NI,2) XI0 = 1.0+XI*XP ETA0 = 1.0+ETA*YP XI1 = 1.0-XI*XI ETA1 = 1.0-ETA*ETA XI2 = XP*XI ETA2 = YP*ETA IF(I .LE. 4) THEN SF(NI) = 0.25*FNC(XI0,ETA0)*XI2*ETA2 DSF(1,NI)= 0.25*XP*FNC(ETA2,ETA0)*(1.0+2.0*XI2) DSF(2,NI)= 0.25*YP*FNC(XI2,XI0)*(1.0+2.0*ETA2) ELSE IF(I .LE. 6) THEN SF(NI) = 0.5*FNC(XI1,ETA0)*ETA2 DSF(1,NI) = -XI*FNC(ETA2,ETA0) DSF(2,NI) = 0.5*FNC(XI1,YP)*(1.0+2.0*ETA2) ELSE IF(I .LE. 8) THEN SF(NI) = 0.5*FNC(ETA1,XI0)*XI2 DSF(2,NI) = -ETA*FNC(XI2,XI0) DSF(1,NI) = 0.5*FNC(ETA1,XP)*(1.0+2.0*XI2) ELSE SF(NI) = FNC(XI1,ETA1) DSF(1,NI) = -2.0*XI*ETA1 DSF(2,NI) = -2.0*ETA*XI1 ENDIF ENDIF ENDIF 30 CONTINUE ENDIF ENDIF C C Compute the Jacobian matrix [GJ] and its inverse [GJINV], and [GDSF] C DO 40 I = 1,2 DO 40 J = 1,2 GJ(I,J) = 0.0 DO 40 K = 1,NPE 40 GJ(I,J) = GJ(I,J) + DSF(I,K)*ELXY(K,J) C DET = GJ(1,1)*GJ(2,2)-GJ(1,2)*GJ(2,1) GJINV(1,1) = GJ(2,2)/DET GJINV(2,2) = GJ(1,1)/DET GJINV(1,2) = -GJ(1,2)/DET GJINV(2,1) = -GJ(2,1)/DET DO 50 I = 1,2 DO 50 J = 1,NPE GDSF(I,J) = 0.0 DO 50 K = 1, 2 50 GDSF(I,J) = GDSF(I,J) + GJINV(I,K)*DSF(K,J) RETURN END SUBROUTINE TEMPORAL(NN) C ____________________________________________________________________________________ C C The subroutine computes the algebraic equations associated with the parabolic differential equations C by using the α-family of approximations. A constant source is assumed. C ____________________________________________________________________________________ C IMPLICIT REAL*8(A-H,O-Z) COMMON/STF/ELF(18),ELK(18,18),ELM(18,18),ELXY(9,2),ELU(18),A1,A2 C C The α-family of time approximation for parabolic equations C DO 20 I=1,NN SUM=0.0 DO 10 J=1,NN SUM=SUM+(ELM(I,J)-A2*ELK(I,J))*ELU(J) 10 ELK(I,J)=ELM(I,J)+A1*ELK(I,J) 20 ELF(I)=(A1+A2)*ELF(I)+SUM RETURN END
THE FINITE ELEMENT METHOD: A REVIEW
57
Problems 2.1 (Least-Squares Method). In the least-squares method, the residual Re [see Eq. (2.2.3)] is minimized in the following sense: δ
Z
xb
∂ ∂ci
[Re ]2 dx = 0 or
xa
Z
xb
xa
[Re (x, c1 , c2 , · · · , cn )]2 dx = 0, i = 1, 2, · · · , n
(a) Identify the weight function wie if the least-squares method is to be deduced from Eq. (2.2.4), (b) develop the least-squares Þnite element model, and (c) discuss the type of Þnite element approximation of u that may be used. 2.2 Consider the differential equation −
³
´
d du d2 a + 2 dx dx dx
µ
b
d2 u dx2
¶
+ cu = f
where a, b, c, and f are known functions of position x. (a) Develop the weak form over a typical element Ωe = (xa , xb ) such that the bilinear form is symmetric, (b) identify the bilinear and linear forms and construct the quadratic functional, (c) develop the Þnite element model of the equation, and (d) discuss the type of Þnite element approximation of u that may be used. 2.3 Derive the Lagrange cubic interpolation functions for a four-node (one-dimensional) element (with equally spaced nodes) using the alternative procedure based on interpolation properties (2.2.22). Use the local coordinate x ¯ for simplicity. 2.4 Derive the Þnite element model of the differential equation −
³
d du a(x) dx dx
for the boundary conditions
´
= f (x)
h³
u(0) = u0 ,
a(x)
for
´
0<x
i
du + ku dx
=P x=L
2.5 The following differential equation arises in connection with heat transfer in an insulated rod: ³ dT ´ d − k = q for 0 < x < L dx dx T (0) = T0 ,
h
k
¯
i¯ dT =0 + β(T − T∞ ) + qˆ ¯¯ dx x=L
where T is the temperature, k the thermal conductivity, and q the heat generation. Take the following values for the data: q = 0, qˆ = 0, L = 0.1 m, k = 0.01 W m−1 ◦ C−1 , β = 25 W m−2◦ C−1 . T0 = 50◦ C, and T∞ = 5◦ C. Solve the problem using two linear Þnite elements for temperature values at x = 12 L and L. Answer: U2 = 27.59◦ C,
−2 = −Q(2) . U3 = 5.179◦ C, Q(1) 1 = 4.482 W m 2 2.6 An insulating wall is constructed of three homogeneous layers with conductivities k1 , k2 , and k3 in intimate contact (see Figure P2.6). Under steady-state conditions, the temperatures at the boundaries of the layers are characterized by the external surface temperatures T1 and T4 and the interface temperatures T2 and T3 . Formulate the problem to determine the temperatures Ti (i = 1, . . . , 4) when the ambient temperatures T0 and T5 and the (surface) Þlm coefficients β0 and β5 are known.
58
NONLINEAR FINITE ELEMENT ANALYSIS
Assume that there is no internal heat generation and that the heat ßow is onedimensional (∂T /∂y = 0). Answer: U1 = 84.489◦ C, U2 = 68.977◦ C, U3 = 50.881◦ C, U4 = 45.341◦ C, (Q11 )def = 217.16 W-m−2 , (Q32 )def = −155.11 W-m−2 .
h1 k1 = 90 W/(m ºC) k2 = 75 W/(m ºC) k3 = 50 W/(m ºC) h1 = 0.03 m h2 = 0.04 m h3 = 0.05 m β = 500 W/(m2 ºC) T∞ = 20ºC
h2
h3
L 1
2
3
1
2
4 3
x Figure P2.6
2.7 Consider the steady laminar ßow of a viscous ßuid through a long circular cylindrical tube. The governing equation is −
³
1 d dw rµ r dr dr
´
=
P0 − PL ≡ f0 , L
0 < r < R0
where w is the axial (i.e. z) component of velocity, µ is the viscosity, and f0 is the gradient of pressure (which includes the combined effect of static pressure and gravitational force). The boundary conditions are
³ dw ´ ¯¯ ¯ r dr ¯
= 0,
w(R0 ) = 0
r=0
Using the symmetry and (a) two linear elements, (b) one quadratic element, determine the velocity Þeld and compare with the exact solution at the nodes: we (r) =
∙
³ r ´2 f0 R02 1− 4µ R0
¸
2.8. In the problem of the ßow of a viscous ßuid through a circular cylinder (see Problem 2.7), assume that the ßuid slips at the cylinder wall; that is, instead of assuming that w = 0 at r = R0 , use the boundary condition that kw = −µ
dw dr
at
r = R0
in which k is the “coefficient of sliding friction.” Solve the problem with two linear elements.
THE FINITE ELEMENT METHOD: A REVIEW
59
2.9 The two members in Figure P2.9 are fastened together and to rigid walls. If the members are stress free before they are loaded, what will be the stresses and deformations in each after the two 50,000 lbs. loads are applied? Use Es = 30 × 106 psi and Ea = 107 psi; the aluminum rod is 2 in. in diameter and the steel rod is 1.5 in. in diameter. Answer: U2 = 0.0134 in., P2(1) = −21, 052.6 lb, and σ (1) = 6701.25 psi.
Aluminum
Steel
P = 50 k
A
C
B
P = 50 k 20 in.
16 in.
Figure P2.9 e Kij
2.10 Evaluate the coefficients and Fie of Eqs. (2.3.40a,b) for a linear triangular element. 2.11 Repeat Problem 2.10 for a linear rectangular element. 2.12 Consider the partial differential equation governing heat transfer in an axisymmetric geometry ³ ´ ∂ ³ ∂T ´ 1 ∂ ∂T − rkrr − kzz = f (r, z) (1) r ∂r ∂r ∂z ∂z
where (krr , kzz ) and f are the conductivities and internal heat generation per unit volume, respectively. In developing the weak form, we integrate over the elemental volume of the axisymmetric geometry: r dr dθ dz. Develop the weak form and associated Þnite element model over an element.
References 1. Reddy, J. N., An Introduction to the Finite Element Method, 2nd edn, McGraw—Hill, New York (1993). 2. Reddy, J. N. and Gartling, D. K., The Finite Element Method in Heat Transfer and Fluid Dynamics, 2nd edn, CRC Press, Boca Raton, FL (2001).
This page intentionally left blank
3 Heat Transfer and Other Field Problems in One Dimension
3.1 Model Differential Equation We shall consider a model nonlinear differential equation governing onedimensional problems involving a single unknown to illustrate the Þnite element model development and discuss solution methods to solve the resulting nonlinear algebraic equations. As we shall see, the weak form and Þnite element model developed in Section 2.2 for a linear model equation are also valid for the nonlinear case. The main difference is that the Þnite element equations are nonlinear, and therefore iterative methods must be used to solve the nonlinear Þnite element equations. Consider the differential equation (see Table 2.2.1 for Þelds of study) ∙
¸
d du du − + c(x, u)u = f (x), a(x, u) + b(x, u) dx dx dx
0<x
(3.1.1)
u=u ˆ
(3.1.2)
subjected to boundary conditions of the form nx a
du + β(x, u) (u − u∞ ) = Q, dx
or
at a boundary point. Here u(x) denotes the dependent variable to be determined, a, b, and c are known functions of x and u (and possibly derivatives of u), f is a known function of x, u∞ and u ˆ are known parameters, Q the secondary variable, and nx is the cosine of the angle between the positive xaxis and the outward normal to the edge at the node (note that nx = −1 at x = xa and nx = 1 at x = xb ). The second boundary condition is a special case of the Þrst (with u ˆ = u∞ ) in the limit β → ∞. We wish to solve this nonlinear differential equation using the Þnite element method. Clearly, the source of nonlinearity is in a, b and/or c, which in most engineering systems include geometric and material parameters that may be functions of the dependent variable u. For example, for heat conduction in a rod with convective heat transfer through the surface, one has a = kA, b = 0,
62
NONLINEAR FINITE ELEMENT ANALYSIS
and c = P β, where k denotes conductivity, β the convective heat transfer coefficient, A the cross-sectional area, and P the perimeter of the rod. Then the nonlinearity arises from the conductivity and heat transfer coefficients being functions of temperature u.
3.2 Weak Formulation Suppose that the domain Ω = (0, L) is divided into N elements. A typical element is denoted as Ωe = (xa , xb ), where xa and xb denote the global coordinates of the end nodes of the element. The weak form of Eq. (3.1.1) over the element is given by Z xb ∙ dw du
¸
∙ µ
h
³
¶¸
du xb du + cwu − wf dx − w a dx dx dx dx xa xa ¸ Z xb ∙ dw du du = a(x, u) + b(x, u)w + c(x, u)wu − wf (x) dx dx dx dx xa
0=
a
+ bw
− [Qe1 − βa (u(xa ) − ua∞ )] w(xa ) − Qe2 − βb u(xb ) − ub∞
where w(x) is a weight function, and [see Eq. (3.1.2)] ∙
¸
du = Qe1 − βa [u(xa ) − ua∞ ] − a dx x=xa ∙ ¸ h i du a = Qe2 − βb u(xb ) − ub∞ dx x=xb
´i
w(xb ) (3.2.1)
(3.2.2)
Here (ua∞ , ub∞ ) denote the reference values and (βa , βb ) denote the Þlm coefficients at the left and right ends of the element, respectively. The weak form (3.2.1) suggests that u is the primary variable and Q is the secondary variable of the formulation. Recall that specifying a primary variable is called the essential (or geometric) boundary condition and specifying a secondary variable is termed the natural (or force) boundary condition. The Þrst boundary condition in Eq. (3.1.2) is of the natural type and it is nonlinear; the second boundary condition in Eq. (3.1.2) one is of the essential type.
3.3 Finite Element Model Suppose that the dependent unknown u(x) is approximated over element Ωe by the Þnite element approximation of the form u(x) ≈ ueh (x) =
n X
uej Lej (x)
(3.3.1)
j=1
Substituting the approximation (3.3.1) for u and w = Lei into the weak form (3.2.1), we obtain the Þnite element model [K e ]{ue } = {f e } + {Qe }
(3.3.2)
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
63
where e Kij
=
fie =
Z xb "
#
dLej dLe dLej + b(x, uh )Lei + c(x, uh )Li Lj dx a(x, uh ) i dx dx dx
xa
+ βa Lei (xa )Lej (xa ) + βb Lei (xb )Lej (xb )
(3.3.3a)
f (x)Lei dx + βa ua∞ Lei (xa ) + βb ub∞ Lei (xb )
(3.3.3b)
Z xb xa
Note that the coefficient matrix is a nonlinear function of the unknown nodal e is a values uej , and it is an unsymmetric matrix when b 6= 0; when b = 0, Kij symmetric matrix. Also, the coefficients involving β are only present at the boundary nodes where convection type boundary condition is speciÞed. Example 3.3.1 To gain more insight into the make up of the coefficient matrix, suppose that a(x) = a0 u(x), b = c = 0 and β = 0, where a0 may be a function of x only. Then we have e Kij
=
Z
xb e
a0
xa
X n
=
uek
à n X
Z
uek Lek
k=1
xb
a0 Lek
xa
k=1
!
dLei dLej dx dx dx
dLei dLej dx dx dx
(i)
Now consider, as an example, linear approximation (n = 2) of u(x), and a0 is a constant within an element, say ae0 . Then we have e = Kij
n X
ae0 uek
X k=1
Lek
ae0 uek (−1)i+j
ae = (−1)i+j 0 2he or
xb
xa
k=1 n
=
Z
dLei dLej dx dx dx 1 h2e
à n X k=1
Z
uek
xb
Lek dx
xa
!
= (−1)i+j
ae (ue + ue2 ) [K ] = 0 1 2he e
∙
1 −1
ae0 (ue + ue2 ) 2he 1
−1
1
¸
(ii)
(iii)
The assembly of element equations follows the same procedure as in linear Þnite element analysis. If we denote the global nodal vector by {U }, the assembled system of equations can be written as [K({U })]{U } = {F }
(3.3.4)
where [K] and {F } denote the global coefficient matrix and the right-hand side vector, respectively. In the example above, [K] is a linear function of
64
NONLINEAR FINITE ELEMENT ANALYSIS
the nodal values Ui and it is a symmetric matrix. Consequently, the resulting Þnite element equations are nonlinear; in the present case, they are quadratic in Ui . Example 3.3.2 illustrates these ideas. Example 3.3.2 The assembled equations (3.3.4) associated with a mesh of two linear elements of equal length, and with the data used in Example 3.3.1, are 1 2h
"
(U1 + U2 ) −(U1 + U2 ) 0
=
⎧ ⎨ ⎩
f1(1)
−(U1 + U2 )
(U1 + 2U2 + U3 ) −(U2 + U3 )
f2(1) + f1(2) f2(2)
⎫ ⎬ ⎭
+
⎧ ⎨ ⎩
Q(1) 1
0 −(U2 + U3 ) (U2 + U3 )
(2) Q(1) 2 + Q1
Q(2) 2
⎫ ⎬
#(
U1 U2 U3
) (i)
⎭
Now suppose that the assembled system of equations is subjected to the boundary conditions h du i ˆ + β (u − u∞ ) a =Q (ii) u(0) = u0 , dx x=L
with
β = β0 + β1 u
(iii)
These conditions for the present mesh of two linear elements imply U1 = u0 ,
ˆ Q(2) 2 = Q − (β0 + β1 U3 ) (U3 − u∞ )
(iv)
Hence, after imposing the boundary conditions and balance of the secondary variables (2) Q(1) 2 + Q1 = 0, the assembled equations in (i) become 1 2h
"
(U1 + U2 ) −(U1 + U2 ) 0
=
⎧ ⎨ ⎩
f1(1)
(U1 + 2U2 + U3 ) −(U2 + U3 )
f2(1) + f1(2) f2(2)
−(U1 + U2 )
⎫ ⎬ ⎭
+
⎧ ⎨ ⎩
0 −(U2 + U3 ) (U2 + U3 ) + 2h(β0 + β1 U3 )
Q(1) 1
⎫ ⎬
(2) Q(1) 2 + Q1 ⎭ ˆ + (β0 + β1 U3 )u∞ Q
#(
u0 U2 U3
) (v)
3.4 Solution Procedures 3.4.1 General Comments The numerical procedures used to solve nonlinear algebraic equations (3.3.4) are iterative in nature. Two iterative procedures are outlined here for the problem at hand. Some general features of iterative methods used for nonlinear equations are discussed before getting into the details of each method (see Appendix 2 for additional discussion). Suppose that we wish to solve the nonlinear matrix equation [A({U })]{U } = {F }
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
65
We begin by assuming that the solution {U }(r−1) at the (r − 1)st iteration is known, and we wish to seek the solution {U }(r) at the rth iteration. At the beginning of the iteration, that is, when r = 1, the solution {U }(0) is assumed or “guessed” consistent with the problem data. Using the solution from the (r−1)st iteration, we compute the coefficient matrix [A({U }(r−1) )]. Since [A] is evaluated using estimated vector {U }, in general, [A({U }(r−1) )]{U }(r) 6= {F }. Hence, we are left with a residual {R} ≡ [A({U }(r−1) )]{U }(r) − {F }
(3.4.1)
The objective of the iteration process is to reduce this residual to a very small, negligible value, ²: v uN uX t RI2 ≤ ²
(3.4.2)
v u PN (r) (r−1) 2 u | t I=1 |UI − UI ≤² PN (r) 2
(3.4.3)
I=1
Alternatively, the iteration may proceed until the difference between solutions from two consecutive iterations, measured with the Euclidean norm, is less than the tolerance ²:
I=1 |UI
|
3.4.2 Direct Iteration Procedure The direct iteration technique, also known as the Picard iteration method of successive substitution, is the simplest of the two methods discussed here. In the direct iteration procedure, the solution at the rth iteration is determined from the equation [K({U}(r−1) )]{U }(r) = {F } (3.4.4) where the coefficient matrix [K] is evaluated using the known solution from the (r−1)st iteration. It is assumed that the coefficient matrix [K] is invertible after the imposition of boundary conditions. Thus, the initial “guess” vector {U }0 should be such that (a) it satisÞes the speciÞed essential boundary conditions and (b) [K] is invertible. This means, in the present case, that UI 6= 0 for at least one value of I. Figure 3.4.1 depicts the general idea of the direct iteration procedure for a single degree-of-freedom system. Here K denotes the slope of the line joining the origin to the point K(U ) on the curve F = K(U )U ≡ f(U ). Note that K(U ) is not the slope of the tangent to the curve at U . The direct iteration converges if the nonlinearity is mild and it diverges if the nonlinearity is severe. Divergence is more likely for hardening type nonlinearity. Acceleration of convergence for some types of nonlinearities may be achieved by using a
66
NONLINEAR FINITE ELEMENT ANALYSIS
F
K(U)U ≡ f(U) K(U1)
K(U0) FC
°
•
•
K(U2)
• UC − Converged solution U0 − Initial guess solution
•
U0
U1
U
U2 U3 UC
Figure 3.4.1 Convergence of the direct iteration procedure (calculation of U for a speciÞed source value F ). weighted-average of solutions from the last two iterations rather than the solution from the last iteration: ¯ } ≡ ρ{U }(r−2) + (1 − ρ){U}(r−1) , {U
0≤ρ≤1
(3.4.5)
where ρ is called the acceleration parameter and r is the current iteration number (i.e. when we seek solution {U }(r) ). The value of ρ depends on the nature of nonlinearity. Example 3.4.1 We wish to solve the nonlinear differential equation −
³
d du u dx dx
´
= f0 , 0 < x < 1
(i)
subjected to the boundary conditions
h du i u
dx
ˆ = Q,
u(1) = u ˆ
(ii)
x=0
For a mesh of two linear elements with h1 = h2 = h, the assembled equations are given by (1) ˆ Q(1) +Q(2) = 0 Eq. (i) of Example 3.3.2. After imposing the boundary conditions Q1 = Q, 2 1
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
67
and U3 = u ˆ, Eq. (i) of Example 3.3.2 becomes 1 2h
"
¯1 + U ¯2 ) (U ¯ ¯2 ) −(U1 + U 0 =
⎧ ⎨ ⎩
¯1 + U ¯2 ) −(U
f1(1)
¯1 + 2U ¯2 + U ¯3 ) (U ¯2 + U ¯3 ) −(U
⎫ ⎬
f2(1) + f1(2)
⎭
f2(2)
+
#(
0 ¯2 + U ¯3 ) −(U ¯2 + U ¯3 ) (U
U1 U2 u ˆ
)(r)
( ˆ ) Q
(iii)
0 Q(2) 2
or, omitting the last equation, we obtain the following condensed set of equations: 1 2h
∙
¯1 + U ¯2 ) (U ¯1 + U ¯2 ) −(U =
½
¯1 + U ¯2 ) −(U
¯1 + 2U ¯2 + U ¯3 ) (U
¾
f1(1)
f2(1) + f1(2)
+
½
ˆ Q
¸½
¯2 +U ¯3 ) (U u ˆ 2h
U1 U2
¾
¾(r) (iv)
¯I = U (r−1) (I = 1, 2, 3) denote the nodal values from the previous iteration. where U I As a speciÞc problem, we use the following data ˆ = 0, Q
u ˆ=
√
2 = 1.4142,
f0 = −1,
h = L/2 = 0.5
(v)
and select the initial guess√vector, which must be consistent with speciÞed essential boundary conditions (i.e. U3 = u ˆ = 2), to be U1(0) = 1.0,
U2(0) = 1.0,
U3(0) =
√
2 = 1.4142
(vi)
Then Eq. (iii) becomes (fie = −h/2)
"
2 −2 0
−2
4.4142 −2.4142
0 −2.4142 2.4142
#(
U1 U2 √ 2
)(1)
=−
(
0.25 0.5 0.25
)
+
(
0 0 Q(2) 2
)
(vii)
and eliminating the third equation, we obtain the following global set of equations at the beginning of the Þrst iteration [see Eq. (iv)]:
∙
2 −2
−2
4.4142
¸½
U1 U2
¾(1)
=−
½
0.25 0.5
¾
½
+
0 √ 2.4142 2
¾
=
½
−0.25
2.9142
¾
(viii)
The solution at the end of Þrst iteration is U1(1) = 0.9785,
U2(1) = 1.1035,
U3(1) = 1.4142
(ix)
For the second iteration, the equations solved are (ρ = 0)
∙
2.0821 −2.0821
−2.0821
4.5998
¸½
U1 U2
¾(2)
=−
½
0.25 0.5
¾
+
½
0 3.5607
¾
(x)
and the solution becomes U1(2) = 0.9962,
U2(2) = 1.1163,
U3(2) = 1.4142
(xi)
68
NONLINEAR FINITE ELEMENT ANALYSIS
The root-mean-square error in the solution (with respect to solution obtained in the Þrst iteration) [see Eq. (3.4.1)] is 0.0106. The exact solution to this problem, with the data given in Eq. (ii), is (one can verify by direct substitution) u(x) =
p
1 + x2
(xii)
The convergence tolerance is taken to be ² = 10−3 , and the maximum number of iterations is prescribed to be 10. The Þnite element solutions obtained with the linear (L) and quadratic (Q) elements are compared with the exact solution in Table 3.4.1. The Þnite element solution converges to the exact solution in four iterations.
Table 3.4.1 Comparison of Þnite element solutions with the exact solution of the problem in Example 3.4.1 (direct iteration). x 0.00
0.25
0.50
0.75
1.00
Iteration
2L
4L
1Q
2Q
Exact
1 2 3 4
0.9785 0.9962 0.9995 0.9999
0.9517 0.9903 0.9988 0.9999
0.9699 0.9954 0.9995 0.9999
0.9415 0.9881 0.9986 0.9999
1.0000
1 2 3 4
− − − −
0.9830 1.0226 1.0299 1.0307
− − − −
0.9727 1.0208 1.0298 1.0308
1.0308
1 2 3 4
1.1036 1.1163 1.1178 1.1180
1.0767 1.1136 1.1176 1.1180
1.1013 1.1168 1.1118 1.1187
1.0665 1.1127 1.1176 1.1180
1.1180
1 2 3 4
− − − −
1.2330 1.2489 1.2499 1.2500
− − − −
1.2285 1.2488 1.2500 1.2500
1.2500
1.4142
1.4142
1.4142
1.4142
1.4142
3.4.3 Newton’s Iteration Procedure In Newton’s method, also referred to as the Newton—Raphson method, Eq. (3.4.4) is written as {R} ≡ [K]{U } − {F } = {0}
(3.4.6)
where {R} is the residual vector. We expand {R} in Taylor’s series about the (known) solution at the ith iteration: (r−1)
{R({U })} = {R({U }
µ
∂{R} )} + ∂{U }
¶(r−1)
· {δU } + . . .
(3.4.7)
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
69
Omitting the terms of order 2 and higher, we obtain µ
∂{R} ∂{U}
¶(r−1)
· {δU } = −{R({U }(r−1) )}
[T ({U }(r−1) )]{δU } = −{R({U }(r−1) )}
(3.4.8a) (3.4.8b)
where [T ] is called the tangent matrix (r−1)
[T ({U }
)] ≡
µ
∂{R} ∂{U }
¶(r−1)
(3.4.9)
The component deÞnition of the tangent matrix at the element level is Tije
∂Rie ∂ ≡ = e ∂uj ∂uej =
n X
m=1
Ã
à n X
e Kim uem
− Fie
m=1 ! e e ∂Kim e e ∂um u + Kim e ∂uej m ∂uj
!
n e X ∂Kim e e = e um + Kij m=1
∂uj
(3.4.10)
The residual vector after the (r − 1)st iteration is given by −{R({U }(r−1) )} = {F } − [K({U }(r−1) )]{U }(r−1)
(3.4.11)
The solution at the rth iteration is then given by {U }r = {U }(r−1) + {δU }
(3.4.12)
The symmetry or unsymmetry of the direct matrix or the tangent matrix depends on the original differential equation as well as the weak form used to develop the Þnite element equations; the symmetry or unsymmetry of the tangent matrix depends on the direct matrix as well as on the nature of nonlinearity included in a(x, u) and c(x, u). Figure 3.4.2 shows the convergence of the Newton—Raphson iteration procedure for a single degree-of-freedom system. Here T (U ) denotes the slope of the tangent to the curve F = K(U )U at U . The Newton—Raphson iteration converges for hardening as well as softening type nonlinearities. For hardening type, convergence may be accelerated using the underrelaxation in Eq. (3.4.5). The method may diverge for a saddle point behavior. Several comments regarding the Newton—Raphson procedure are in order. • At the end of each iteration, the procedure gives an increment of the solution as opposed to the total solution in the direct iteration procedure.
70
NONLINEAR FINITE ELEMENT ANALYSIS
F K(U)U − F ≡ R(U) T(U2)
T(U0) FC
• ° T(U1)
• UC − Converged solution
•
δU1
U0
δU2
U1 = δU1 + U0
U0 − Initial guess solution
UC = U3 U2 = δU2 + U0
U
Figure 3.4.2 Convergence of the Newton iteration procedure (calculation of δU for a speciÞed residual value R). • Since the actual speciÞed essential boundary conditions are included in the initial guess vector, the incremental vector {δU } is subjected to only the homogeneous form of the speciÞed essential boundary conditions. • The tangent matrix does not have to be exact; an approximate [T ] can also provide the solution but it may take more iterations. In any case, the residual vector will be computed using the deÞnition {R} = {F } − [K]{U }. • When the tangent matrix is updated only once in a certain number of iterations (to save computational time), the procedure is known as the modiÞed Newton—Raphson method. Generally, the modiÞed Newton— Raphson iteration method takes more iterations to converge than the full Newton’s iteration, and it may even diverge if the nonlinearity is severe. Example 3.4.2 Consider the element coefficient matrix in Eq. (3.3.3a). Assume that a(x, u) = ae (x), b = 0, c(x, u) = c0 (x) + c1 (x)u + c2 (x)u2 , βa = 0, βb = β0 + β1 uen . Then we have e Kij
=
Z
xb
xa
½
¤ dLe dLej £ + c0 (x) + c1 (x)uh (x) + c2 (x)u2h (x) Lei Lej a (x) i dx dx e
+ [β0 + β1 uh (xb )] Lei (xb )Lej (xb )
¾
dx (i)
Note that in this case [K e ] is symmetric. We wish to compute the element tangent coefficient
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
71
matrix. We have Tije =
n X e ∂Kim
m=1
=
n X ∂
m=1
e uem + Kij
∂uej
∂uej
(Z
xb
xa
£
¤
c0 (x) + c1 (x)uh + c2 (x)u2h Lei Lem dx
)
e + [β0 + β1 uh (xb )] Lei (xb )Lem (xb ) uem + Kij
=
n X
uem
=
xb
xa
¡
xb
c1 Lej
xa
m=1
Z
"Z
¡
+
2c2 uh Lej
¢
¢
Lei Lem dx
+
#
β1 Lej (xb )Lei (xb )Lem (xb )
e c1 uh + 2c2 u2h Lei Lej dx + β1 uh (xb )Lei (xb )Lej (xb ) + Kij
where the identities
n X
∂uh = Lej , ∂uej
e + Kij
(ii)
uem Lem = uh (x)
m=1
are used in arriving at the last line. Note that the tangent matrix [T e ] is also symmetric.
Example 3.4.3 Here we wish to solve the nonlinear Þnite element equations of Example 3.4.1 using the Newton—Raphson iterative technique. First, we compute the tangent matrix at the element level and then assemble the equations. For an element, we have n X e ∂Kim
Tije =
m=1 n
∂uej
e uem + Kij
X ∂ µZ
=
m=1
Z
=
xb
xa
Z
=
xb
xa
∂uej
xb
uh xa
∂uh dLei ∂uej dx duh dLei dx dx
Ã
¶
dLei dLem e dx uem + Kij dx dx
n X
m=1
dLe uem m dx
!
e dx + Kij
e e e ˆ ij Lej dx + Kij ≡K + Kij
where the identity n X
m=1
uem
dLem du = h dx dx
is used in arriving at the last line. We have, e ˆ ij = K
Z
xb
xa
ue − ue1 duh dLei e Lj dx = 2 dx dx 2
Z
xb xa
dLei e L dx dx j
(i)
72
NONLINEAR FINITE ELEMENT ANALYSIS
or
ue2 − ue1 2he
ˆ e] = [K
∙
−1
−1
1
1
¸
Thus, the tangent matrix becomes
∙
¯e2 ) (¯ ue1 + u 2he
ˆ e] = [T e ] = [K e ] + [K
1 −1
−1
1
¸
+
¯e1 ) (¯ ue2 − u 2he
∙
−1
−1
1
1
¸
where u ¯ei denote the nodal values known from the previous iteration. Alternatively,
⎡ ∂K e
11
[T e ] = [K e ] + ⎣ =
=
∂ue 1
ue1 +
e ∂K21 ue1 ∂ue 1
¯e2 ) (¯ ue1 + u 2he (¯ ue1 + u ¯e2 ) 2he
∙ ∙
+
e ∂K12 ue2 ∂ue 1
e ∂K11 ue1 ∂ue 2
+
e ∂K12 ue2 ∂ue 2
e ∂K22 ue2 ∂ue 1
e ∂K21 ue1 ∂ue 2
+
e ∂K22 ue2 ∂ue 2
1 −1
−1
1 −1
−1
1
1
¸ ¸
∙
u ¯e1 − u ¯e2 e −u ¯1 + u ¯e2
+
1 2he
+
(¯ ue2 − u ¯e1 ) 2he
∙
−1
1
⎤ ⎦
ue =¯ ue i i
u ¯e1 − u ¯e2 e −u ¯1 + u ¯e2 −1
1
¸
¸
(ii)
Note that the tangent coefficient matrix is not symmetric. With the data in Eqs. (ii) and (iii) of Example 3.4.1, at the beginning of the Þrst iteration we have (after assembly and imposition of the boundary conditions)
∙
2 −2
−2
4
¸½
δU1 δU2
¾
=−
½
=
−0.25
½
0.25 0.50
0.50
¾
¾
−
½
2−2 −2 + 4.4142 − 3.4142
¾ (iii)
The solution to these equations is δU1 = 0.0,
δU2 = 0.125,
δU3 = 0.0
(iv)
and the complete solution becomes U1(1) = 1.0000,
U2(1) = 1.1250,
U3(1) = 1.4142
(v)
The solution at the second iteration is obtained using
∙
2 −2
¾
(vi)
δU2 = −0.0007,
δU3 = 0.0
(vii)
U2(2) = 1.1180,
U3(2) = 1.4142
(viii)
−2.25
4.50
¸½
δU1 δU2
¾
=
½
0.0156 −0.0312
The solution to these equations is δU1 = 0.0, and the complete solution becomes U1(2) = 1.0000,
The root-mean-square error in the solution (with respect to the solution obtained in the Þrst iteration) [see Eq. (3.4.2)] is 0.0034.
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
73
Table 3.4.2 contains the numerical results obtained with the Newton—Raphson iteration method. The Newton—Raphson method gives converged solution in only three iterations as opposed to four iterations taken by the direct iteration method. For the mesh of 1 quadratic element, the error criterion is met while the solution did not actually coincide with the exact solution.
Table 3.4.2 Comparison of Þnite element solutions with the exact solution of the problem in Example 3.4.3 (Newton—Raphson iteration). x 0.00
0.25
0.50
0.75
Iteration
2L
4L
1Q
2Q
Exact
1 2 3
1.0000 1.0000 1.0000
1.0000 1.0000 1.0000
1.0000 1.0000 1.0000
1.0000 1.0000 1.0000
1.0000
1 2 3
— — —
1.0312 1.0308 1.0308
— — —
1.0312 1.0308 1.0308
1.0308
1 2 3
1.1250 1.1180 1.1180
1.1250 1.1180 1.1180
1.1241 1.1187 1.1187
1.1250 1.1180 1.1180
1.1180
1 2 3
— — —
1.2812 1.2504 1.2500
— — —
1.2766 1.2502 1.2500
1.2500
3.5 Computer Implementation 3.5.1 Introduction The nonlinear formulations and solution procedures described above can be implemented on a computer using Fortran language. Fortran is chosen here mainly because of its transparent nature (i.e. one can see how the statements correspond to the theory) compared to C ++ language. Of course, once the logic of implementation is understood, it is easier to carry out the actual computations in any suitable computational languages. The logical statements for each of the iterative methods are described here. It is necessary for the reader to familiarize with programs FEM1DV2 and FEM2DV2 described in Appendix 1 of the Þnite element book by Reddy [1] to fully understand the logic and variable names used here. The listing of FEM1DV2 contains Fortran statements for assembly, imposition of boundary conditions, and solution of equations (banded symmetric and unsymmetric equation solvers are listed in Appendix 1 of this book). A general ßow chart of the nonlinear analysis program is given in Figure 3.5.1.
3.5.2 Preprocessor Unit The following information is read in the preprocessor.
74
NONLINEAR FINITE ELEMENT ANALYSIS
1. Read or deÞne the model equation data (a) DeÞne the coefficients a(x, u), b(x, u), and c(x, u) and source f (x) in the model differential equation (3.1.1) (they are assumed to be polynomials of certain degree); for example, assume µ
¶
du du 2 a(x, u) = ax0 + ax1 x + au1 u + au2 u + aux1 + aux2 dx dx µ ¶2 du du + bux2 b(x, u) = bx0 + bx1 x + bu1 u + bu2 u2 + bux1 dx dx 2
Iter = 0
Iter = Iter + 1
Initialize global Kij, fi
DO 1 to n
Transfer global information (material properties, geometry, and solution) to element CALL ELKF to calculate Kij(n) and fi(n), and assemble to form global Kij and Fi
Impose boundary conditions and solve the equations
Error < ε no
yes
Print solution
yes
Iter < Itmax
no
Write a message
STOP
STOP
Figure 3.5.1 A ßow chart of the nonlinear analysis program for the solution of the model equation (3.1.1).
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
µ
du du c(x, u) = cx0 + cx1 x + cu1 u + cu2 u + cux1 + cux2 dx dx 2 f(x) = fx0 + fx1 x + fx2 x 2
¶2
75
(3.5.1)
so that a large class of nonlinear one-dimensional problems may be solved with the program. The choice in Eq. (3.5.1) requires us to read the following parameters (assuming continuous data for the whole domain) AX0, AX1, AU 1, AU 2, AU X1, AU X2; BX0, BX1, BU 1, etc. (b) Read geometric and analysis data X0 = global coordinate of the Þrst node of the domain (assumed to be a straight line), AL = domain size (length), IEL = element type (= 1, linear; = 2, quadratic), N EM = number of elements in the mesh, N ON LIN = ßag for type of analysis (= 0,linear; > 0, nonlinear) EP S = allowable error tolerance ² for the convergence test, IT M AX = maximum allowable number of iterations for convergence. (c) Read speciÞed boundary and initial data: N SP V , N SSV , N SM B, ISP V (I, J), V SP V (I), ISSV (I, J), V SSV (I), ISM B(I, J), BET A0(I), BET AU (I), UREF (I), and GU 0(I), where N SP V = number of speciÞed primary degrees of freedom (U), N SSV = number of speciÞed secondary degrees of freedom (Q ≡ nx a du dx ), N SM B = number of speciÞed mixed boundary conditions [Q + (β0 + βu U )(U − Uref )], ISP V (I, J) = array of speciÞed primary degrees of freedom (I = 1, 2, . . . , N SP V and J = 1, 2); ISP V (I, 1)= global node number at which the primary variable is speciÞed, and ISP V (I, 2) is the degree of freedom number at that node which is speciÞed (in the class of problems discussed in this chapter, N DF = 1 and therefore ISP V (I, 2) = 1 for all cases). V SP V (I) = array of speciÞed values of primary variable DOF in ISP V (I, J) [V SP V (I) should be in the same sequence as the speciÞed degrees of freedom in ISP V (I)], ISSV (I, J) = similar to ISP V (I, J), except for secondary variables, V SSV (I) = similar to V SP V (I), except for secondary variables, ISM B(I, J) = array of speciÞed mixed boundary conditions (I = 1, 2, . . . , N SSV ) and has meaning similar to arrays ISP V (I, J) and ISSV (I, J), BET A0(I) = array of speciÞed values of β0 ,
76
NONLINEAR FINITE ELEMENT ANALYSIS
BET A1(I) = array of speciÞed values of βu , U REF (I) = array of speciÞed values of Uref , GU 0(I) = initial (guess) solution vector (I = 1, 2, . . ., N EQ); N EQ=number of total primary degrees of freedom in the mesh. 2. Write out the input data and necessary warning messages.
3.5.3 Processor Unit Here we discuss mainly the calculation of element coefficients, imposition of various types of boundary conditions, and iterative algorithm. The number of Gauss points needed to evaluate the coefficients is determined by the highest polynomial degree, p [N GP = (p + 1)/2]. In the present case, the expression that dictates the degree of the polynomial is the integral involving c(x, u). If we assume c to be a linear function of u, and if u is approximated using linear polynomials, the integrand of the above integral expression is cubic (p = 3). Hence, a two-point integration is needed to evaluate it; for quadratic interpolation of u, the integrand is a Þfth degree polynomial (p = 5), and hence it requires three-point Gauss quadrature. Of course, the polynomial degrees goes up if a is a higher degree polynomial of x. The element coefficients are evaluated using the Gauss rule. Based on the discussion presented in Section 2.7, the element coefficients in (3.3.3a), for β = 0, can be expressed as ELK(I, J) = ELK(I, J) + (AX ∗ GDSF L(I) ∗ GDSF L(J) + BX ∗ SF L(I) ∗ GDSF L(J) + CX ∗ SF L(I) ∗ SF L(J))∗ GJ ∗ GAU SW T (N I, NGP ) which is evaluated inside a loop on N I = 1, 2, . . . , NGP and inner loops on I, J = 1, 2, . . . , N P E. Boxes 3.5.1 and 3.5.2 show the Fortran subroutines for the calculation of [K e ] and {f e }. The imposition of boundary conditions on a banded system of nonsymmetric equations is discussed next. The assembled coefficient matrix [GLK] is stored a full band width (N BW ) form, and it is of the order N EQ × N BW , the last column GLK(I, N BW ) being reserved for the source vector. Note that GLK(I, N HBW ) is the main diagonal of the assembled matrix. Essential boundary conditions ˆI . Then the Ith equation of the Now suppose that UI is speciÞed to be U ˆI . This is done as follows: system is replaced with the equation UI = U GLK(I, J) = 0.0 for all J = 1, 2, . . . , N BW ˆI GLK(I, N HBW ) = 1.0, GLK(I, N BW ) = U This is repeated for all N SP V conditions.
and J 6= I
(3.5.2)
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
77
Box 3.5.1 Subroutine for the generation of the coefficient matrices in the direct iteration method. SUBROUTINE COEFF (IEL,NPE,F0) IMPLICIT REAL*8(A-H,O-Z) DIMENSION GAUSS(5,5),WT(5,5) COMMON /SHP/ SFL(4),GDSFL(4) COMMON /STF/ STIF(3,3),ELF(3),ELX(3),ELU(3),AX0,AX1,AU C 1 2 3
DATA GAUSS/5*0.0D0,-0.57735027D0,0.57735027D0,3*0.0D0, -0.77459667D0,0.0D0,0.77459667D0,2*0.0D0,-0.86113631D0, -0.33998104D0,0.33998104D0,0.86113631D0,0.0D0, -0.906180D0,-0.538469D0,0.0D0,0.538469D0,0.906180D0/
1 2 3
DATA WT /2.0D0,4*0.0D0,2*1.0D0,3*0.0D0,0.55555555D0, 0.88888888D0,0.55555555D0,2*0.0D0,0.34785485D0, 2*0.65214515D0,0.34785485D0,0.0D0,0.2369227D0, 0.478629D0,0.568889D0,0.478629D0,0.236927D0/
C NGP=IEL+1 EL=ELX(IEL+1)-ELX(1) DO 10 I=1,NPE ELF(I)=0.0 DO 10 J=1,NPE 10 ELK(I,J)=0.0 C DO 80 NI=1,NGP XI=GAUSS(NI,NGP) CALL SHAPE (EL,ELX,GJ,IEL,NPE,XI) CNST=GJ*WT(NI,NGP) X=0.0 U=0.0 DO 20 I=1,NPE X=X+SFL(I)*ELX(I) U=U+SFL(I)*ELU(I) 20 CONTINUE C AX=AX0+AX1*X+AU*U DO 40 I=1,NPE ELF(I)=ELF(I)+F0*SFL(I)*CNST DO 40 J=1,NPE S00=GDSFL(I)*GDSFL(J)*CNST ELK(I,J)=ELK(I,J)+AX*S00 40 CONTINUE 80 CONTINUE RETURN END
78
NONLINEAR FINITE ELEMENT ANALYSIS
Box 3.5.2 Subroutine for the generation of the coefficient matrices in the Newton—Raphson iteration method. SUBROUTINE COEFF (IEL,NPE,F0) IMPLICIT REAL*8(A-H,O-Z) DIMENSION GAUSS(5,5),WT(5,5),TANG(3,3) COMMON /SHP/ SFL(4),GDSFL(4) COMMON /STF/ STIF(3,3),ELF(3),ELX(3),ELU(3),AX0,AX1,AU
C
C
1 2 3
DATA GAUSS/5*0.0D0,−0.57735027D0,0.57735027D0,3*0.0D0, −0.77459667D0,0.0D0,0.77459667D0,2*0.0D0,−0.86113631D0, −0.33998104D0,0.33998104D0,0.86113631D0,0.0D0, −0.906180D0,−0.538469D0,0.0D0,0.538469D0,0.906180D0/
1 2 3
DATA WT /2.0D0,4*0.0D0,2*1.0D0,3*0.0D0,0.55555555D0, 0.88888888D0,0.55555555D0,2*0.0D0,0.34785485D0, 2*0.65214515D0,0.34785485D0,0.0D0,0.2369227D0, 0.478629D0,0.568889D0,0.478629D0,0.236927D0/
10
20
NGP=IEL+1 EL=ELX(IEL+1)-ELX(1) DO 10 I=1,NPE ELF(I)=0.0 DO 10 J=1,NPE TANG(I,J)= 0.0 ELK(I,J) = 0.0 DO 80 NI=1,NGP XI=GAUSS(NI,NGP) CALL SHAPE (EL,ELX,GJ,IEL,NPE,XI) CNST=GJ*WT(NI,NGP) X=0.0 U=0.0 DU=0.0 DO 20 I=1,NPE X=X+SFL(I)*ELX(I) U=U+SFL(I)*ELU(I) DU=DU+GDSFL(I)*ELU(I) CONTINUE AX=AX0+AX1*X+AU*U DO 40 I=1,NPE ELF(I)=ELF(I)+F0*SFL(I)*CNST DO 40 J=1,NPE S00=GDSFL(I)*GDSFL(J)*CNST S10=GDSFL(I)*SFL(J)*CNST ELK(I,J)=ELK(I,J)+AX*S00 TANG(I,J)=TANG(I,J)+AU*DU*S10 CONTINUE CONTINUE
40 80 C C Compute the residual vector and tangent matrix C DO 100 I=1,NPE DO 100 J=1,NPE 100 ELF(I)=ELF(I)-ELK(I,J)*ELU(J) DO 120 I=1,NPE DO 120 J=1,NPE 120 ELK(I,J)=ELK(I,J)+TANG(I,J) C RETURN END
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
79
Natural boundary conditions ˆ I . Then the force in the Ith equation Next, suppose that QI is speciÞed to be Q ˆ is augmented with QI : ˆI GLK(I, N BW ) = GLK(I, N BW ) + Q
(3.5.3)
This is repeated for all N SSV conditions. Mixed boundary conditions Finally, we consider mixed boundary conditions of the form QI + βI (UI − Uref ) = 0
(3.5.4)
where βI is a function of u, say βI = βI0 + βI1 UI . The boundary condition may be implemented as follows: ³
GLK(I, N HBW ) = GLK(I, N HBW ) + βI0 + βI1 UI ³
´
´
GLK(I, N BW ) = GLK(I, N BW ) + βI0 + βI1 UI Uref
(3.5.5)
The above statement modiÞes the assembled direct stiffness matrix and source vector in direct iteration procedure. In the case of Newton—Raphson iteration, the assembled tangent matrix is modiÞed as follows: ³
´
GLK(I, N HBW ) = GLK(I, N HBW ) + βI0 + 2βI1 UI − βI1 Uref ³
´
³
(3.5.6) ´
GLK(I, N BW ) = GLK(I, N BW ) − βI0 + βI1 UI UI + βI0 + βI1 UI Uref Box 3.5.3 contains a listing of the subroutine that imposes various types of boundary conditions on an banded, unsymmetric system of equations. The major steps of the two iterative algorithms are summarized below. 1. Read in the convergence tolerance T OLR, maximum allowable number of iterations IT M AX, and the initial guess vector GU C(I). 2. Initialize the previous solution vector {GU P } = {0}. 3. Set the iteration counter, IT ER = 0. 4. Begin the iteration counter on IT ER = IT ER + 1. 5. Initialize the global coefficient matrix [GLK] (and source vector {GLF } if used); when unsymmetric banded solver is used, the last column of [GLK] takes the place of {GLF }. 6. Calculate the element coefficient matrices [ELK] using the last iteration solution {GU C} (or a weighted-average of {GU C} and {GU P } when underrelaxation is used) and element source vectors {ELF } and assemble to obtain [GLK] (and {GLF }).
80
NONLINEAR FINITE ELEMENT ANALYSIS
Box 3.5.3 Subroutine for the implementation of various types of boundary conditions.
1 C C C C C C
SUBROUTINE BNDRYUNSYM(ITYPE,MXNEQ,MXFBW,MXEBC,MXNBC,NDF,NHBW, GLK, GLU,NSPV,NSSV,NSMB,ISPV,ISSV,ISMB,VSPV,VSSV,BETA0,BETAU,UREF) __________________________________________________________________ The subroutine is used to implement specified boundary conditions on BANDED UNSYMMETRIC system of finite element equations __________________________________________________________________
IMPLICIT REAL*8 (A-H,O-Z) DIMENSION ISPV(MXEBC,2),ISSV(MXNBC,2),ISMB(MXNBC,2),VSPV(MXEBC), 1 VSSV(MXEBC),UREF(MXNBC),BETA0(MXNBC),BETAU(MXNBC), 2 GLU(MXNEQ),GLK(MXNEQ,MXFBW) C NBW=2*NHBW C C Include specified PRIMARY degrees of freedom C IF(NSPV.NE.0)THEN DO 120 NP=1,NSPV NB=(ISPV(NP,1)-1)*NDF+ISPV(NP,2) DO 110 J=1,NBW 110 GLK(NB,J)=0.0D0 GLK(NB,NHBW)=1.0D0 120 GLK(NB,NBW)=VSPV(NP) ENDIF C C Modify the source vector to include specified non-zero SECONDARY VARIABLES C IF(NSSV.NE.0)THEN DO 130 NS=1,NSSV NB=(ISSV(NS,1)-1)*NDF+ISSV(NS,2) 130 GLK(NB,NBW)=GLK(NB,NBW)+VSSV(NS) ENDIF C C Implement the specified MIXED BOUNDARY CONDITIONS C IF(NSMB.NE.0)THEN DO 150 MB=1,NSMB NB=(ISMB(MB,1)-1)*NDF+ISMB(MB,2) IF(ITYPE.LE.1)THEN GLK(NB,NHBW)=GLK(NB,NHBW)+BETA0(MB)+BETAU(MB)*GLU(NB) GLK(NB,NBW)=GLK(NB,NBW)+UREF(MB)*(BETA0(MB)+BETAU(MB)*GLU(NB)) ELSE GLK(NB,NHBW)=GLK(NB,NHBW)+BETA0(MB)+2.0*BETAU(MB)*GLU(NB) * -UREF(MB)*BETAU(MB) GLK(NB,NBW)=GLK(NB,NBW)+UREF(MB)*(BETA0(MB)+BETAU(MB)*GLU(NB)) * -(BETA0(MB)+BETAU(MB)*GLU(NB))*GLU(NB) ENDIF 150 CONTINUE ENDIF RETURN END
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
81
7. Impose the boundary conditions (the essential boundary conditions must be homogeneous). 8. Solve the equations (solution is returned in the last column of [GLK]). 9a. In direct iteration, update the current and previous solution vectors {GU P } = {GU C} and {GU C} = {GLF } ({GLF } = [GLK]last ). 9b. In Newton—Raphson iteration, update the current and previous solution vectors {GU P } = {GU C} and {GU C} = {GU C} + {GLF }. 10. Calculate the residual or solution error, ERROR [see Eqs. (3.4.2)—(3.4.3)]. 11. If ERROR ≤ T OLR print IT ER, ERROR, and {GU C} and stop. If ERROR > T OLR, continue. 12. If IT ER > IT M AX, stop; otherwise, repeat steps 4 through 11. Example 3.5.1 Consider heat transfer in an isotropic bar of length L = 0.18 m. The surface of the bar is insulated so that there is no convection from the surface. The governing equation of the problem is the same as Eq. (3.1.1) with b = c = 0, u = T , the temperature. The conductivity a(x, T ) = k is assumed to vary according to the relation k = k0 (1 + βT )
(3.5.7)
where k0 is the constant thermal conductivity [k0 = 0.2 W/(m ◦ K)] and β the temperature coefficient of thermal conductivity [β = 2 × 10−3 (◦ C−1 )]. Suppose that there is no internal heat generation (i.e. f = 0) and the boundary conditions are T (0) = 500◦ K,
T (L) = 300◦ K
(3.5.8)
Table 3.5.1 shows the linear and nonlinear solutions T (x). The results obtained with the direct iteration method and Newton—Raphson method with ² = 0.001 are tabulated in Table 3.5.1. In both methods, the convergent solution was obtained for three iterations. Both methods and both meshes give the same solution.
Table 3.5.1 Finite element solutions of a nonlinear heat conduction equation. DI/NR
Direct Iteration
Newton—Raphson
x
Linear
8L
4Q
8L
4Q
0.0000 0.0225 0.0450 0.0675 0.0900 0.1125 0.1350 0.1575 0.1800
500.00 475.00 450.00 425.00 400.00 375.00 350.00 325.00 300.00
500.00 477.24 453.94 430.06 405.54 380.35 354.40 327.65 300.00
500.00 477.24 453.94 430.06 405.54 380.35 354.40 327.65 300.00
500.00 477.24 453.94 430.05 405.54 380.34 354.40 327.65 300.00
500.00 477.24 453.94 430.05 405.54 380.34 354.40 327.65 300.00
82
NONLINEAR FINITE ELEMENT ANALYSIS
3.6 Closing Remarks In this chapter, Þnite element formulations of nonlinear boundary-value problems in one dimension are discussed, iterative methods of solving the nonlinear algebraic equations are studied, and computer implementation of the nonlinear Þnite element analysis is outlined. The simple class of problems discussed herein should give the reader a clear understanding of the workings of nonlinear Þnite element analysis steps. In the next chapter we will consider multi-variable, one-dimensional, nonlinear equations governing bending and stretching of straight beams.
Problems 3.1 Consider the second-order differential equation −
³
du d µ dx dx
´
= f (x),
µ = µ0
³ du ´n−1 dx
(a)
where u(x) is the dependent unknown, f (x) is a known function of position x, and µ is a function of the dependent variable, as given in Eq. (a). Write the Þnite element model and derive the tangent stiffness matrix coefficients. 3.2 Compute the tangent matrix for the case a(x, u) = ae0 (x) du , c(x, u) = 0, and β = 0 dx (see Example 3.4.2). 3.3 Consider the nonlinear differential equation −
h
i
√ du d (u + 2) = 1, dx dx
du (0) = 0, dx
0<x<1
u(1) = 0
(a)
(b)
Analyze the nonlinear problem using the Þnite element method with direct iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. 3.4 Formulate Problem 3.2 with Newton—Raphson iteration procedure, and compute the tangent coefficient matrix. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. 3.5 Formulate the nonlinear differential equation −
d2 u + 2u3 = 0, dx2
u(1) = 1,
h
1<x<2
du + u2 dx
i
=0
(a) (b)
x=2
using the Þnite element method, and solve the problem using direct iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. The exact solution is given by u(x) = 1/x. 3.6 Compute the tangent stiffness matrix associated with Problem 3.5, and solve it with Newton—Raphson iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements.
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
83
3.7 Formulate the nonlinear differential equation −
du d2 u = 0, − 2u dx dx2 u(0) = 1,
0<x<1
u(1) = 0.5
(a) (b)
using the Þnite element method, and solve the problem using direct iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. The exact solution is given by u(x) = 1/(1 + x). 3.8 Compute the tangent stiffness matrix associated with Problem 3.7, and solve it with Newton—Raphson iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. 3.9 Formulate the nonlinear differential equation in Problem 3.7 subject to the boundary conditions h i du =0 (a) + u2 u(0) = 1, dx x=1
using the Þnite element method, and solve the problem using direct iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. The exact solution is given by u(x) = 1/(1 + x). 3.10 Compute the tangent stiffness matrix associated with Problem 3.9, and solve it with Newton—Raphson iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. 3.11 Formulate the nonlinear differential equation in Problem 3.7 subject to the boundary conditions h du i h du i + 2u + u2 = 1, =0 (a) dx dx x=0 x=1
using the Þnite element method, and solve the problem using direct iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. The exact solution is given by u(x) = 1/(1 + x). 3.12 Compute the tangent stiffness matrix associated with Problem 3.11, and solve it with Newton—Raphson iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear elements and 2 and 4 quadratic elements. 3.13 Formulate the nonlinear differential equation −
h du dx
³
d2 u du − dx dx2
i
+u
x=0
´3
= 0,
0<x<1
h du i
3 =√ , 2
dx
= 0.5
(a)
(b)
x=1
using the Þnite element method, and solve the problem using direct iteration procedure. Tabulate the nodal values of u(x) for 4 and 8 linear p elements and 2 and 4 quadratic elements. The exact solution is given by u(x) = 2(1 + x). 3.14 Consider simultaneous steady-state conduction and radiation in a plate. The mathematical formulation of the problem in non-dimensional form is given by −
³
d dθ k(θ) dξ dξ
´
θ(0) = θ0 ,
= 0,
0 < ξ < ξ0
θ(ξ0 ) = 1.0
(a) (b)
84
NONLINEAR FINITE ELEMENT ANALYSIS
where ξ is the non-dimensional thickness coordinate, θ is the non-dimensional temperature, and k is the conductivity
³
k(θ) = k0 1 +
4 3 θ 3N
´
(c)
and N is called the conduction-to-radiation parameter. Develop the Þnite element model of the problem and compute the element tangent matrix. 3.15 Analyze the nonlinear problem in Problem 3.14 using the Þnite element method with Newton—Raphson iteration procedure. Take k0 = 1, N = 0.01, ξ0 = 1, and θ0 = 0.5. Tabulate and plot the nodal values of θ(ξ) for 8 linear elements and 4 quadratic elements. 3.16 The explosion of a solid explosive material in the form of an inÞnite cylinder may be described by [3] ³ ´ 1 d du − r = 2eu , 0 < r < 1 r dr dr subject to the boundary conditions At r = 0 :
du = 0; dr
At r = 1 : u = 0
The exact solution of the nonlinear equation is u(r) = ln
4 (1 + r2 )2
Analyze the nonlinear problem using the Þnite element method with (a) Newton— Raphson and (b) direct iteration procedure. Tabulate and plot the nodal values of u(r) for 8 linear elements and 4 quadratic elements and compare with the exact solution. 3.17 Redo Problem 3.16 when the right-hand side is replaced by eu . This problem has two solutions 8λi , i = 1, 2 ui (r) = ln (1 + λi r2 )2 where λi are the roots of the equation 8λ =1 (1 + λ)2 3.18 Heat and mass transfer within a porous catalyst particle is described by [3]
∙
¸
c(1 − u) d2 u a du = b2 u exp + , r dr 1 + d(1 − u) dr2
0
subject to the boundary conditions At r = 0 :
du = 0; dr
At r = 1 : u = 1
Here a, b, c, and d are the problem parameters. Analyze the nonlinear problem using the Þnite element method with the direct iteration procedure. Take a = 0, b = 1, c = 2 and d = 0.1, and tabulate and plot the solutions u(r) for meshes of 8 linear elements and 4 quadratic elements. 3.19 Repeat Problem 3.18 with the data a = 2, b = 2, c = 4 and d = 0.2.
NONLINEAR EQUATIONS IN SINGLE VARIABLE IN ONE DIMENSION
85
3.20 Repeat Problem 3.18 with the data a = 0, b = 0.16, c = 14 and d = 0.7 The problem has three possible numerical solutions. 3.21 Axial mixing in an isothermal tubular reactor where a second-order reaction occurs is described by [3] 1 d2 u du + Da u2 = 0, 0 < x < 1 − + Pe dx2 dx subject to the boundary conditions At x = 0 : u = 1 +
1 du ; Pe dx
du =0 dx
At x = 1 :
where Pe and Da are the problem parameters. Analyze the nonlinear problem using the Þnite element method with the direct iteration procedure. Take Pe=5 and Da=1, and tabulate and plot the solution u(x) for 8 linear elements. 3.22 Consider the pair of nonlinear differential equations d3 u 1 + 6 dx3
µ
d2 u dx2
¶2
v
dv = 0, dx
d2 v 1 du + 2 dx dx2
³ dv ´3 dx
=0
subject to the boundary conditions u(0) = v(0) = 1,
u(1) = 16,
dv (0) = −1, dx
v(1) = 0.5
Formulate the Þnite element model of the equations and compute the tangent coefficient matrix. 3.23 Consider the pair of nonlinear differential equations −
1 d2 u du + + β (u − uc ) = α Da (1 − v) exp Pe dx2 dx −
dv 1 d2 v = Da (1 − v) exp + Pe dx2 dx
µ
µ
u 1 + u/γ
u 1 + u/γ
¶
,
¶
in (0,1) and subject to the boundary conditions dv du , Pe v = dx dx dv du = 0, =0 dx dx
At x = 0 : Pe u = At x = 1 :
Formulate the Þnite element model of the equations and compute the tangent coefficient matrix.
References 1. Reddy, J. N., An Introduction to the Finite Element Method, 2nd edn, McGraw—Hill, New York (1993). 2. Sachdev, P. L., A Compendium on Nonlinear Ordinary Differential Equations, John Wiley, New York (1997). 3. Kubicek, M. and Hlavacek, V., Numerical Solution of Nonlinear Boundary Value Problems with Applications, Prentice—Hall, Englewood Cliffs, NJ (1983).
This page intentionally left blank
4 Nonlinear Bending of Straight Beams
4.1 Introduction In this chapter, we consider a slightly more complicated one-dimensional nonlinear problem than that was discussed in Chapter 1. A beam is a structural member whose length to cross-sectional dimensions is very large and it undergoes not only stretching along its length but also bending about an axis transverse to the length. When the applied loads on the beam are large, the linear load—deßection relationship ceases to be valid because the beam develops internal forces that resist deformation, and the magnitude of internal forces increases with the loading as well as the deformation. This nonlinear load—deßection response of straight beams is the topic of this section. In developing a general nonlinear formulation of beams, straight or curved, one must deÞne the measures of stress and strain consistent with the deformations accounted for in the formulation. Such a formulation, called a continuum formulation, will be discussed in Chapter 9. The present nonlinear formulation of straight beams is based on assumptions of large transverse displacements, small strains and small to moderate rotations. These assumptions allow us to use the stress measure of force per unit undeformed area and strain measure of change in length to the original length (and in the case of shear strain, change in the angle from π/2). The changes in the geometry are small so that no distinction between the Piola—Kirchoff and Cauchy stresses (to be discussed in detail later) will be made. The nonlinearity in the formulation comes solely from the inclusion of the inplane forces that are proportional to the square of the rotation of the transverse normal to the beam axis. Two different theories to model the kinematic behavior of beams are considered here: (1) the Euler—Bernoulli beam theory (EBT) that neglects the transverse shear strain, and (2) the Timoshenko beam theory (TBT), which accounts for the transverse shear strain in the simplest way. In each
88
NONLINEAR FINITE ELEMENT ANALYSIS
case, we begin with an assumed displacement Þeld and compute strains that are consistent with the kinematic assumptions of the theory. Then we develop the weak forms using the principle of virtual displacements and the associated displacement Þnite element model. We also discuss certain computational aspects (e.g. membrane and shear locking) and iterative methods for the problems at hand. Computer implementation issues are also presented. Discussion of other linear Þnite element models of the Timoshenko beam theory are also presented for completeness.
4.2 Euler—Bernoulli Beams 4.2.1 Basic Assumptions For the sake of completeness, the governing equations of the nonlinear bending of beams are developed from basic considerations. The classical beam theory is based on the Euler—Bernoulli hypothesis that plane sections perpendicular to the axis of the beam before deformation remain (a) plane, (b) rigid (not deform), and (c) rotate such that they remain perpendicular to the (deformed) axis after deformation. The assumptions amount to neglecting the Poisson effect and transverse strains. A reÞned theory is that due to Timoshenko, and it will be discussed in the sequel. The principle of virtual displacements will be used to formulate the variational problem and associated Þnite element model.
4.2.2 Displacement Field and Strains The bending of beams with moderately large rotations but with small strains can be derived using the displacement Þeld u1 = u0 (x) − z
dw0 , u2 = 0, u3 = w0 (x) dx
(4.2.1)
where (u1 , u2 , u3 ) are the total displacements along the coordinate directions (x, y, z), and u0 and w0 denote the axial and transverse displacements of a point on the neutral axis. Using the nonlinear strain-displacement relations (sum on repeated subscripts is implied; see Chapter 9) 1 εij = 2
Ã
∂ui ∂uj + ∂xj ∂xi
!
1 + 2
Ã
∂um ∂um ∂xi ∂xj
!
(4.2.2)
and omitting the large strain terms but retaining only the square of du3 /dx (which represents the rotation of a transverse normal line in the beam), we obtain
NONLINEAR BENDING OF STRAIGHT BEAMS
ε11
ε0xx
µ
89
¶
d2 w0 1 dw0 2 du0 −z = εxx = + dx dx2 2 dx " # Ã ! µ ¶2 du0 1 dw0 d2 w0 = −z + dx 2 dx dx2 ≡ ε0xx + zε1xx µ ¶ du0 1 dw0 2 d2 w0 = , ε1xx = − 2 + dx 2 dx dx
(4.2.3a) (4.2.3b)
and all other strains are zero. Note that the notation x1 = x, x2 = y, and x3 = z is used. These strains are known as the von K´ arm´ an strains.
4.2.3 Weak Forms The weak form of structural problems can be directly derived (i.e. without knowing the governing differential equations) using the principle of virtual displacements. The principle states that if a body is in equilibrium, the total virtual work done by actual internal as well as external forces in moving through their respective virtual displacements is zero. The virtual displacements are arbitrary except that they are zero where displacements are prescribed. The analytical form of the principle over a typical element Ωe = (xa , xb ) (see Figure 4.2.1) is given by (see Reddy [2]) δW e ≡ δWIe − δWEe = 0
(4.2.4)
where δWIe is the virtual strain energy stored in the element due to actual stresses σij in moving through the virtual strains δεij , and δWEe is the work done by externally applied loads in moving through their respective virtual displacements. Here σij and εij denote the Cartesian components of the stress and the Green strain tensors, respectively. Due to the assumption of small strains, no distinction will be made here between the Cauchy and second Piola—Kirchhoff stress tensors (see Chapter 9). For the beam element, we have δWIe δWEe
= =
Z
Ve
Z xb xa
δεij σij dV q δw0 dx +
Z xb xa
f δu0 dx +
6 X
(4.2.5) Qei δ∆ei
i=1
where V e denotes the element volume, q(x) is the distributed transverse load (measured per unit length), f (x) is the distributed axial load (measured per unit length), Qei are the generalized nodal forces, and δ∆ei are the virtual
90
NONLINEAR FINITE ELEMENT ANALYSIS
generalized nodal displacements of the element (see Figure 4.2.1) deÞned by ∆e1 ∆e4 Qe1 Qe2 Qe3
∙
¸
dw0 = u0 (xa ), = w0 (xa ), = − ≡ θ(xa ) dx xa ∙ ¸ dw0 = u0 (xb ), ∆e5 = w0 (xb ), ∆e6 = − ≡ θ(xb ) (4.2.6a) dx xb = −Nxx (xa ), Qe4 = Nxx (xb ) ∙ ¸ ∙ ¸ dMxx dMxx dw0 dw0 Nxx + Nxx + =− , Qe5 = dx dx xa dx dx xb e = −Mxx (xa ), Q6 = Mxx (xb ) (4.2.6b) ∆e2
∆e3
In view of the explicit nature of the assumed displacement Þeld (4.2.5) in the thickness coordinate z and its independence of coordinate y, the volume integral can be expressed as a product of integrals over the length and area of the element: Z Z xb Z (·) dV = (·) dA dx Ve
Ae
xa
Therefore, the expression for the virtual strain energy can be simpliÞed as follows (only non-zero components of strain and stress are ε11 ≡ εxx and σ11 ≡ σxx ) δWIe = =
Z
xb
xa xb
Z
=
xb
xa
Ae
Z
Ae
xa
Z
Z
"µ
δεxx σxx dA dx = "µ
¶
Z
Ae
³
´
δε0xx + zδε1xx σxx dA dx #
d2 δw0 −z σxx dA dx dx2
∆5 ∆3
1
xa
dδu0 dw0 dδw0 + dx dx dx ¶
xb
d2 δw0 dδu0 dw0 dδw0 Nxx − Mxx + dx dx dx dx2
∆2 ∆1
Z
he
(a)
2
#
(4.2.7)
Q5
Q2
∆6 ∆4
dx
Q6
Q3 Q1
1
he
2
Q4
(b)
Figure 4.2.1 The Euler—Bernoulli beam Þnite element with generalized displacement and force degrees of freedom. (a) Nodal displacements. (b) Nodal forces.
NONLINEAR BENDING OF STRAIGHT BEAMS
91
where Nxx is the axial force (measured per unit length) and Mxx is the moment (measured per unit length) Nxx =
Z
Ae
σxx dA , Mxx =
Z
Ae
σxx z dA
(4.2.8)
The virtual work statement in Eq. (4.2.7) becomes 0=
Z xb "µ dδu0 xa
−
#
dx
f (x) δu0 (x) dx −
6 X
¶
dw0 dδw0 d2 δw0 + Nxx − Mxx dx dx dx dx2
Z xb xa
q(x) δw0 (x) dx −
Z xb xa
Qei δ∆ei
(4.2.9)
i=1
The above weak form is equivalent to the following two statements, which are obtained by collecting terms involving δu0 and δw0 separately [see the deÞnitions in Eqs. (4.2.6a,b)]: 0= 0=
Z xb µ dδu0 xa Z xb xa
"
dx
dδw0 dx
¶
Nxx − δu0 f (x) µ
¶
dx − Qe1 δ∆e1 − Qe4 δ∆e4
(4.2.10a)
#
dw0 d2 δw0 Mxx − δw0 q(x) dx Nxx − dx dx2
− Qe2 δ∆e2 − Qe3 δ∆e3 − Qe5 δ∆e5 − Qe6 δ∆e6
(4.2.10b)
The differential equations governing nonlinear bending of straight beams can be obtained, although not needed for Þnite element model development, from the virtual work statement in (4.2.9), equivalently, the weak forms (4.2.10a,b), or from a vector approach in which forces and moments are summed over a typical beam element. Integration by parts of the expressions in (4.2.9) to relieve δu0 and δw0 of any differentiation results in 0=
Z xb (µ dNxx xa
∙
¶
"
d − − f δu0 − dx dx
+ Nxx δu0 +
µ
µ
¶
¶
#
)
6 X
Qei δ∆ei
dw0 d2 Mxx + q δw0 dx Nxx + dx dx2
dw0 dδw0 dMxx δw0 − Mxx Nxx + dx dx dx
¸xb
xa
−
i=1
Since δu0 and δw0 are arbitrary and independent of each other in xa < x < xb as well as at x = xa and x = xb (independently), it follows that the governing equations of equilibrium, known as the Euler equations, are δu0 : δw0 :
dNxx = f (x) dx µ ¶ d dw0 d2 Mxx − = q(x) Nxx − dx dx dx2 −
(4.2.11a) (4.2.11b)
92
NONLINEAR FINITE ELEMENT ANALYSIS
In view of the deÞnitions (4.2.6a), deÞnitions (4.2.6b) are obtained as the natural (or force) boundary conditions Qe1 + Nxx (xa ) = 0, Qe4 − Nxx (xb ) = 0 ∙ ¸ ∙ ¸ dMxx dMxx dw0 dw0 e e Q2 + = 0, Q5 − =0 Nxx + Nxx + dx dx xa dx dx xb Qe3 + Mxx (xa ) = 0, Qe6 − Mxx (xb ) = 0 (4.2.12) The vector approach involves identifying a typical beam element of length ∆x with all its forces and moments, summing them, and taking the limit ∆x → 0. Consider the beam element shown in Figure 4.2.2, where Nxx is the internal axial force, V (x) is the internal vertical shear force, Mxx is the internal bending moment, f (x) is the external axial force, and q(x) is external distributed transverse load. Summing the forces in the x and z coordinate directions, and moments about the y axis, we obtain X
X
X
Fx = 0 :
− Nxx + (Nxx + ∆Nxx ) + f (x)∆x = 0
Fz = 0 :
− V + (V + ∆V ) + q(x)∆x = 0
My = 0 :
− Mxx + (Mxx + ∆Mxx ) − V ∆x + Nxx ∆x
dw0 dx
+ q(x)∆x(c∆x) = 0
q(x) x f(x)
z
q(x) V
V + ∆V
Nxx+∆Nxx x
Nxx Mxx
z
∆x
Mxx + ∆Mxx
dw dx
Figure 4.2.2 A typical beam element with forces and moments to derive equations of equilibrium using the vector approach.
NONLINEAR BENDING OF STRAIGHT BEAMS
93
Taking the limit ∆x → 0, we obtain the following three equations: dNxx + f (x) = 0 dx dV + q(x) = 0 dx dMxx dw0 − V + Nxx =0 dx dx which are equivalent to the two equations in (4.2.11a,b). Note that V is the shear force on a section perpendicular to the x-axis, and it is not equal to the shear force Q(x) acting on the section perpendicular to the deformed beam. In fact, one can show that V = Q + Nxx (dw0 /dx). If one starts with the governing equations (4.2.11a,b), their weak forms can be developed using the usual three-step procedure: Z xb
µ
Z xb
"
¶
dNxx 0= v1 − − f dx dx xa ¶ Z xb µ dv1 = Nxx − v1 f dx − [v1 Nxx ]xxba dx xa ¶ Z xb µ dv1 Nxx − v1 f dx − v1 (xa )[−Nxx (xa )] − v1 (xb )Nxx (xb ) (4.2.13a) = dx xa 0=
xa
=
v2
µ
dx
∙
− v2
"
µ
#
¶
dw0 d2 Mxx − q dx Nxx − dx dx2
µ Z xb " dv2 dw0 xa
=
d − dx
dx
Nxx
¶
dw0 dMxx Nxx + dx dx
µ Z xb dv2 dw0
¶
#
d2 v2 − Mxx − v2 q dx dx2 ¶¸xb
xa
−
∙µ
d2 v2 Mxx dx2
¶
dv2 − Mxx dx #
¸xb
xa
Nxx − − v2 q dx dx ∙ µ ¶¸ ∙ ¸ dw0 dw0 dMxx dMxx − v2 (xa ) − − v2 (xb ) Nxx − Nxx + dx dx dx dx xb xa ∙ ¸ ∙ ¸ dv2 dv2 − − [−Mxx (xa )] − − Mxx (xb ) (4.2.13b) dx xa dx xb xa
dx
where v1 and v2 are the weight functions, whose meaning is obvious if the expressions f v1 dx and qv2 dx are to represent the work done by external forces. We see that v1 ∼ δu0 and v2 ∼ δw0 . Clearly, Eqs. (4.2.13a,b) are the same, with the definitions (4.2.6b) or (4.2.12), as those in Eqs. (4.2.10a,b). The resultant force Nxx and moment Mxx can be expressed in terms of the displacements once the constitutive behavior is assumed. Suppose that the
94
NONLINEAR FINITE ELEMENT ANALYSIS
beam is made of a linear elastic material. Then the total stress is related to the total strain by Hooke’s law σxx = E e εxx Then we have Nxx =
Z
σxx dA =
Ae
=
Z
=
Aexx
Mxx =
Z
Ae
"
Z
Ae
du0 1 + dx 2
E
e
"
du0 1 + dx 2
µ
σxx z dA =
Ae
=
Z
=
e Bxx
Ae
"
E "
du0 1 + dx 2
µ
E e εxx dA
µ
dw0 dx
dw0 dx Z
Ae
du0 1 + dx 2
e
(4.2.14)
µ
¶2
¶2 #
#
d2 w0 −z dA dx2
e − Bxx
d2 w0 dx2
(4.2.15a)
E e εxx z dA
dw0 dx
dw0 dx
¶2
¶2 #
#
d2 w0 −z z dA dx2
e − Dxx
d2 w0 dx2
(4.2.15b)
e , and De where Aexx , Bxx xx are the extensional, extensional-bending, and bending stiffnesses of the beam element
(Aexx ,
e Bxx ,
e Dxx )
=
Z
Ae
³
´
E e 1, z, z 2 dA
(4.2.16)
For beams made of an isotropic material, the extensional—bending stiffness e is zero when the x-axis is taken along the geometric centroidal axis. We Bxx e = 0, Ae = E e Ae , and D e = E e I e , where Ae and I e are the crosshave Bxx xx xx sectional area and second moment of inertia (about the y-axis) of the beam element. For simplicity, we shall omit the element label e on the variables. In general, Axx , Bxx , and Dxx are functions of x whenever the modulus E and/or the cross-sectional area is a function of x. The virtual work statements (4.2.10a,b) can be expressed in terms of the generalized displacements (u0 , w0 ) by using Eqs. (4.2.15a,b). We have 0=
Z xb xa
"
dδu0 du 1 Axx + dx dx 2
µ
dw0 dx
¶2 #
dx −
Z xb xa
f (x)δu0 dx
− Q1 δu0 (xa ) − Q4 δu0 (xb ) 0=
Z xb ( xa
−
"
dδw0 dw0 du0 1 Axx + dx dx dx 2
Z xb xa
(4.2.17a) µ
dw0 dx
¶2 #
dδ 2 w0 d2 w0 + Dxx dx2 dx2
)
dx
qδw0 dx − Q2 δw0 (xa ) − Q3 δθ(xa ) − Q5 δw0 (xb ) − Q6 δθ(xb ) (4.2.17b)
NONLINEAR BENDING OF STRAIGHT BEAMS
95
where it is assumed that the coupling coefficient Bxx is zero because of the choice of the coordinate system; R that is, the x-axis is assumed to coincide with the geometric centroidal axis A z dA = 0.
4.2.4 Finite Element Model Let the axial displacement u0 (x) and transverse deflection w0 (x) are interpolated as [θ = −(dw0 /dx)] u0 (x) =
2 X
uj ψj (x) ,
w0 (x) =
j=1
¯ 1 ≡ w0 (xa ), ∆
4 X
¯ j φj (x) ∆
(4.2.18)
¯ 4 ≡ θ(xb ) ∆
(4.2.19)
j=1
¯ 2 ≡ θ(xa ), ∆
¯ 3 ≡ w0 (xb ), ∆
and ψj are the linear Lagrange interpolation functions, and φj are the Hermite cubic interpolation functions. For a linear problem, this element gives exact ¯ i for any f (x) and q(x) when Axx and Dxx nodal displacements ui and ∆ are element-wise constants. Then the element is said to be a superconvergent element. Substituting Eq. (4.2.18) for u0 (x), (4.2.19) for w0 (x), and δu0 (x) = ψi (x) and δw0 (x) = φi (x) (to obtain the ith algebraic equation of the model) into the weak forms (4.2.17a,b), we obtain 0=
2 X
j=1
0=
2 X
j=1
4 X
11 Kij uj +
J=1 21 KIj uj +
4 X
J=1
12 ¯ ∆J − Fi1 KiJ
(i = 1, 2)
(4.2.20a)
22 ¯ ∆J − FI2 KIJ
(I = 1, 2, 3, 4)
(4.2.20b)
where 11 Kij 21 KIj 22 KIJ
Z
µ
Z xb "
µ
Z xb
dψi dψj dw0 1 xb 12 = Axx = Axx dx , KiJ dx dx 2 xa dx xa Z xb dw0 dφI dψj 21 12 = Axx = 2KjI dx , KIj dx dx dx xa =
Fi1 =
Z xb xa
Z xb xa
d2 φI d2 φJ 1 Dxx 2 dx + 2 dx dx 2 ˆi , f ψi dx + Q
FI2 =
xa
Z xb xa
Axx
dw0 dx
¶
¶2 #
¯I q φI dx + Q
dψi dφJ dx dx dx
dφI dφJ dx dx dx (4.2.21)
ˆ 1 = Q1 , Q ˆ 2 = Q4 , Q ¯ 1 = Q2 , for (i, j = 1, 2) and (I, J = 1, 2, 3, 4), where Q ¯ 2 = Q3 , Q ¯ 3 = Q5 , and Q ¯ 4 = Q6 . See Eq. (4.2.6b) for the definitions of Qi . Q Note that the coefficient matrices [K 12 ], [K 21 ] and [K 22 ] are functions of the
96
NONLINEAR FINITE ELEMENT ANALYSIS
unknown w0 (x). Also, note that [K 12 ]T 6= [K 21 ]; hence, the element direct stiffness matrix is unsymmetric. αβ The above deÞnition of coefficients Kij is based on a particular linearization of Eqs. (4.2.17a,b) , which is probably the most natural. Other forms of linearization are possible. For example, if consider Eq. (4.2.17a). the coefficient of dδu0 /dx contains a linear term and a nonlinear term. To preserve the linear bar stiffness, the linear term should be kept as a part of the stiffness matrix. The nonlinear term can be either included in the stiffness coefficient, as is done in the deÞnition given in Eq. (4.2.21), or the whole nonlinear term may be assumed to be known from the previous iteration. In the latter case, the term ends up in the load vector {F 1 }. This choice of linearization is known to slow down the convergence. In the case of Eq. (4.2.17b), we know that the term dw0 /dx outside the square brackets is due to the nonlinear strain. Hence, it was linearized (i.e. calculated using the solution 21 of Eq. (4.2.21). One may linearize from the previous iteration) in deÞning Kij Eq. (4.2.17b) such that du0 /dx +0.5(dw0 /dx)2 is calculated using the solution 21 = 0 and K 22 will have additional from the previous iteration. In that case Kij ij contribution. Thus, it is possible to computationally decouple the equations ¯ and solve the two equations iteratively, feeding the solution for {u} and {∆} from one equation to the other. However, such a strategy often results in nonconvergence. Equations (4.2.20a,b) can be written compactly as 2 X X
αγ γ Kip ∆p = Fiα , or
γ=1 p=1
2 X
α1 Kip up +
p=1
4 X
α2 ¯ ∆P = Fiα KiP
(4.2.22)
¾
(4.2.23)
P =1
In matrix form, we have ∙
[K 11 ] [K 12 ] [K 21 ] [K 22 ]
¸½
{∆1 } {∆2 }
¾
=
½
{F 1 } {F 2 }
where ¯ i , i = 1, 2, 3, 4 ∆2i = ∆
∆1i = ui , i = 1, 2;
(4.2.24)
Note that the direct stiffness matrix is unsymmetric only due to the fact that [K 12 ] contains the factor 1/2 whereas [K 21 ] does not. One way to make [K 21 ]T = [K 12 ] is to split the linear strain du0 /dx in Eq. (4.2.17) into two equal parts and take one of the two parts as known from a previous iteration: Z xb ( xa
dδw0 Aexx
1 = 2
"
dw0 du0 1 + dx dx dx 2
Z xb xa
Aexx
(
µ
dw0 dx "
¶2 #)
dx µ
dw0 dδw0 du0 du0 dw0 + + dx dx dx dx dx
¶2 #
dδw0 dw0 dx dx
)
dx (4.2.25)
NONLINEAR BENDING OF STRAIGHT BEAMS
97
The Þrst term of the above equation constitutes [K 21 ] and the second one constitutes a part of [K 22 ]. The symmetrized equations are ∙
¯ 11 ] [K ¯ 12 ] ¸ ½ {u} ¾ ½ {F 1 } ¾ [K = ¯ 21 ] [K ¯ ¯ 22 ] [K {∆} {F 2 }
(4.2.26)
where
12 ¯ iJ K 21 ¯ Ij K 22 ¯ IJ K
Z xb
dψi dψj dx dx dx xa µ ¶ Z dw0 dψi dφJ 1 xb 12 = KiJ = Aexx dx 2 xa dx dx dx µ ¶ Z 1 xb e dw0 dφI dψj 21 12 ¯ jI ¯ Ij = Axx =K dx , K 2 xa dx dx dx Z xb 2 2 e d φI d φJ = Dxx dx dx2 dx2 xa
11 11 ¯ ij = Kij = K
1 + 2
Z xb xa
Aexx
Aexx
"
µ
du0 dw0 + dx dx
¶2 #
dφI dφJ dx dx dx
(4.2.27)
Note that in the symmetrized case, we must assume that u0 (x) is also known from a previous iteration.
4.2.5 Iterative Solutions of Nonlinear Equations The direct iteration and Newton—Raphson methods introduced in Chapter 3 are revisited here in connection with the nonlinear Þnite element equations of the EBT. Consider the nonlinear equations (4.2.23), which can be written as [K e ({∆e })]{∆e } = {F e }
(4.2.28)
where ¯ e1 , ∆e3 = ∆ ¯ e2 , ∆e4 = u2 , ∆e5 = ∆ ¯ e3 , ∆e6 = ∆ ¯ e4 ∆e1 = u1 , ∆e2 = ∆
(4.2.29a)
F1e = F11 , F2e = F12 , F3e = F22 , F4e = F21 , F5e = F32 , F6e = F42
(4.2.29b)
The system (4.2.28) of nonlinear algebraic equations can be linearized using the direct iteration and Newton—Raphson iterative methods of Section 3.4. These are presented next. Note that the linearized equations may be symmetric or unsymmetric, depending on the formulation, and therefore an appropriate equation solver must be used. On the other hand, an unsymmetric banded equations solver may be used in all cases.
98
NONLINEAR FINITE ELEMENT ANALYSIS
Direct iteration procedure In the direct iteration procedure, the solution at the rth iteration is determined from the assembled set of equations (r−1) ¯ [K({∆}(r−1) )]{∆}r = {F } or [K({∆} )]{∆}r = {F }
(4.2.30)
where the direct stiffness matrix [K e ] is evaluated at the element level using the known solution {∆e }(r−1) at the (r − 1)st iteration. Newton—Raphson iteration procedure In the Newton—Raphson procedure, the linearized element equation is of the form [T ({∆}(r−1) ]{∆}r = −{R({∆}(r−1) )} = {F } − ([K e ]{∆e })(r−1)
(4.2.31)
where the tangent stiffness matrix [T e ] associated with the Euler—Bernoulli beam element is calculated using the deÞnition [T ] ≡
µ
∂{R} ∂{∆}
¶(r−1)
Tije
, or
≡
Ã
∂Rie ∂∆ej
!(r−1)
(4.2.32)
The solution at the rth iteration is then given by {∆}r = {∆}(r−1) + {δ∆}
(4.2.33)
Although the direct stiffness matrix [K e ] is unsymmetric, it can be shown that the tangent stiffness matrix [T e ] is symmetric. Further, it can be shown ¯ e] that the tangent stiffness matrix is the same whether one uses [K e ] or [K [see Eqs. (4.2.23) and (4.2.26)]. The coefficients of the element tangent stiffness matrix [T e ] can be computed using the deÞnition in (4.2.32). In terms of the components deÞned in Eq. (4.2.22), we can write Tijαβ
=
⎛
⎞(r−1)
∂Riα ⎠ ⎝ ∂∆βj
(4.2.34)
for α, β = 1, 2. The components of the residual vector can be expressed as Riα =
2 X X
γ=1 p=1
= =
2 X
αγ γ Kip ∆p − Fiα
α1 1 Kip ∆p +
4 X
p=1
P =1
2 X
4 X
p=1
α1 Kip up +
P =1
α2 2 KiP ∆P − Fiα
α2 ¯ ∆P − Fiα KiP
(4.2.35)
NONLINEAR BENDING OF STRAIGHT BEAMS
99
Note that the range of p is dictated by the size of the matrix [K αβ ]. We have Tijαβ = =
⎛
⎞
⎛
∂Riα ⎠ ⎝ ∂∆βj
2 X X
γ=1 p=1 αβ = Kij +
⎛
⎞
2 X ∂ ⎝X αγ γ = Kip ∆p − Fiα ⎠ ∂∆βj γ=1 p=1
⎝K
γ αγ ∂∆p
ip
+
∂∆βj
αγ ∂Kip
∂∆βj
⎞
∆γp ⎠
4 X ∂ ³ α1 ´ ∂ ³ α2 ´ ¯ K u + KiP ∆P p ip β β ∂∆ p=1 ∂∆j P =1 j 2 X
(4.2.36)
We compute the tangent stiffness matrix coefficients Tijαβ explicitly as shown below: Tij11
=
11 Kij
+
2 11 X ∂Kip
p=1 11 = Kij +
2 X
p=1
Since
∂uj
4 12 X ∂KiP ¯P ∆ up +
∂uj
P =1
0 · up +
4 X
P =1
¯P 0·∆
(4.2.37)
αβ ∂Kij = 0 for all α, β, i, j and k ∂uk
(4.2.38)
the coefficients [T 11 ] and [T 21 ] of the tangent stiffness matrix are the same as those of the direct stiffness matrix: [T 11 ] = [K 11 ] , [T 21 ] = [K 21 ]
(4.2.39)
Next consider 12 12 = KiJ + TiJ
2 X
p=1
=
12 KiJ
Ã
+0+
11 ∂Kip ¯J ∂∆
4 X
= =
12 KiJ
+ +
=
+
xa
P =1 xa "Z 4 xb X xa
Z xb 1 xa
4 X
P =1
Ã
∂ Axx ¯ 2 ∂ ∆J
"Z 4 xb 1 X
P =1 12 KiJ
up +
"Z xb 1
P =1
12 KiJ
!
∂ Axx ¯ 2 ∂ ∆J
µ
à 4 X K
12 ∂KiP ¯J ∂∆
dw0 dx
!
¶
#
dψi dφP ¯P dx ∆ dx dx
¯ K dφK ∆ dx #
¯P ∆
!
1 dφJ dψi dφP ¯P Axx dx ∆ 2 dx dx dx
dψi dφJ Axx 2 dx dx
à 4 ! X dφP ¯ ∆P dx P =1
dx
#
dψi dφP ¯P dx ∆ dx dx
100
NONLINEAR FINITE ELEMENT ANALYSIS
=
12 KiJ
+
Z xb µ 1 xa
12 12 = KiJ + KiJ
22 TIJ
=
22 KIJ
+
2 X
p=1
=
22 KIJ
+
2 X
Ã
xa
22 = KIJ +
Z xb xa
=
!
22 KIJ
+
Z xb xa
xa
µ
à 4 X K
dw0 dx ⎛
Ã
22 ∂KIP ¯J ∂∆
(4.2.40) !
¯ K dφK ∆ dx
¶2
!
¯P ∆ #
dφI dψp dx up dx dx #
dφI dφP ¯P dx ∆ dx dx ⎞
2 dφI dφJ ⎝X dψp ⎠ Axx up dx dx dx p=1 dx
µ
Z xb
4 X
P =1
∂ Axx ¯ 2 ∂ ∆J
xa
Axx
up +
∂ Axx ¯ ∂ ∆J
"Z 4 xb 1 X
P =1
+
21 ∂KIp ¯J ∂∆
"Z xb
p=1
+
¶
dw0 dψi dφJ Axx dx 2 dx dx dx 12 21 = 2KiJ = KJi
dw0 dx
Axx
¶
µ
dφI dφJ dx dx
à 4 X
¯ P dφP ∆ dx P =1
du0 dw0 dw0 + dx dx dx
¶
!
dx
dφI dφJ dx dx dx
(4.2.41)
4.2.6 Load Increments Examining the expression (4.2.15a) for the internal axial force Nxx , it is clear that the rotation of a transverse normal contributes to tensile component of Nxx irrespective of the sign of the load. As a result, the beam becomes increasingly stiff with an increase in load. Hence, for large loads the nonlinearity may be too large for the numerical scheme to yield convergent solution. Therefore, it is necessary to divide the total load F into several smaller load increments δF1 , δF2 , . . . , δFN such that F =
N X
δFi
(4.2.42)
i=1
For the Þrst load step, the iterative procedure outlined earlier can be used to determine the deßection. If it does not converge within a reasonable number of iterations, it may be necessary to further reduce the load increment F1 = δF1 . Once the solution for the Þrst load increment is obtained, it is used as the initial “guess” vector for the next load F2 = δF1 + δF2 . This is continued until the total load is reached. Another way to accelerate the convergence is to use a weighted average of the solutions from the last two iterations in evaluating the stiffness matrix at
NONLINEAR BENDING OF STRAIGHT BEAMS
101
the rth iteration: {∆∗ }r−1 = γ{∆}r−2 + (1 − γ){∆}r−1 ,
0≤γ≤1
(4.2.43)
where γ is called the acceleration parameter. A value of γ = 0.5 is suggested when the iterative scheme experiences convergence difficulty. Otherwise, one should use γ = 0.
4.2.7 Membrane Locking For the linear case, the axial displacement u0 is uncoupled from the bending deßection w0 , and they can be determined independently from the Þnite element models [see Eqs. (4.2.20a,b)] 11
1
[K ]{u} = {F }, [K
22(L)
¯ = {F 2 }, ]{∆}
11 Kij
22(L) KIJ
=
=
Z xb xa
Z xb xa
dψi dψj dx dx dx
(4.2.44)
d2 φI d2 φJ dx dx2 dx2
(4.2.45)
Aexx
e Dxx
respectively. Here the superscript L signiÞes the linear stiffness coefficients. Under the assumptions of linearity, if a beam is subjected to only bending forces and no axial loads, then u0 (x) = 0 when u0 is speciÞed to be zero at (at least) one point. In other words, a hinged—hinged beam and a pinned—pinned beam (see Figures 4.2.3(a) and (b), respectively) will have the same deßection w0 (x) under the same loads and u0 (x) = 0 for all x. However, this is not the case when the beam undergoes nonlinear bending. The coupling between u0 and w0 will cause the beam to undergo axial displacement even when there are no axial forces, and the solution (u0 , w0 ) will be different for the two cases shown in Figure 4.2.3. First, we note that the hinged—hinged beam does not have any end constraints on u0 . If the geometry, boundary conditions, and loading are symmetric about the center, then u0 = 0 there. Consequently, the beam does not experience any axial strain, that is, ε0xx = 0 (because the beam is free to slide on the rollers to accommodate transverse deßection). On the other hand, the pinned—pinned beam is constrained from axial movement at x = 0 and x = L. As a result, it will develop axial strain to accommodate the transverse deßection. The former beam will have larger transverse deßection than the latter, as the latter offers axial stiffness to stretching, and the axial stiffness increases with the load. Thus, for a hinged—hinged beam, the element should experience no stretching: ε0xx ≡
du0 1 + dx 2
µ
dw0 dx
¶2
= 0 (membrane strain)
(4.2.46)
102
NONLINEAR FINITE ELEMENT ANALYSIS
u≠0 w=0
u=0 w=0
u=0 w=0
u≠0 w=0
(b)
(a)
Figure 4.2.3 Nonlinear bending of (a) hinged—hinged and (b) pinned— pinned beams. In order to satisfy the constraint in (4.2.46), we must have du0 ∼ dx
µ
dw0 dx
¶2
(4.2.47)
The similarity is in the sense of having the same degree of polynomial variation of du0 /dx and (dw0 /dx)2 . For example, when u0 is interpolated using linear functions and w0 with cubic, the constraint in Eq. (4.2.47) is clearly not met and the resulting element stiffness matrix is excessively stiff (hence, results in zero displacement Þeld), and the element is said to lock. This phenomenon is known as the membrane locking. In fact, unless a very higherorder interpolation of u0 is used, the element will not satisfy the constraint. A practical way to satisfy the constraint in Eq. (4.2.47) is to use the minimum interpolation of u0 and w0 (i.e. linear interpolation of u0 and Hermite cubic interpolation of w0 ) but treat ε0xx as a constant. Since du0 /dx is constant, it is necessary to treat (dw0 /dx)2 as a constant in numerically evaluating the element stiffness coefficients. Thus, if Axx is a constant, all nonlinear stiffness coefficients should be evaluated using one-point Gauss quadrature, that is, use the reduced integration. These coefficients include 12 , K 21 , T 12 , T 21 , and the nonlinear parts of K 22 and T 22 . All other terms Kij ij ij ij ij may be evaluated exactly using two-point quadrature for constant values of Axx and Dxx .
4.2.8 Computer Implementation The ßow chart for nonlinear bending of beams is shown in Figure 4.2.4. Note that there is an outer loop on load increments (NLS=number of load steps). Except for the deÞnition of the stiffness coefficients, much of the logic remains the same as that shown in Box 3.5.1. The element stiffness matrix in Eq. (4.2.22) is deÞned by submatrices [K 11 ], [K 12 ], and [K 22 ], and the solution vector {∆} is partitioned into the ¯ of transverse displacements. axial displacement vector {u} and vector {∆}
NONLINEAR BENDING OF STRAIGHT BEAMS
103
Load loop DO L=1, NLS F=F+DF Iter = 0
Iter = Iter + 1
Initialize global Kij, fi DO 1 to n
Transfer global information (material properties, geometry, and solution) to element
CALL ELKF to calculate Kij(n) and fi(n), and assemble to form global Kij and Fi Impose boundary conditions and solve the equations
Error < ε yes no
Print solution
yes Iter < Itmax no
Write a message
STOP
Figure 4.2.4 A computer ßow chart for the nonlinear Þnite element analysis of beams.
104
NONLINEAR FINITE ELEMENT ANALYSIS
In practice, it is desirable to rearrange the solution vector as ¯ 1 , θ1 = ∆ ¯ 2 , u2 , w2 = ∆ ¯ 3 , θ2 = ∆ ¯ 4 }T {∆} = {u1 , w1 = ∆
(4.2.48)
This in turn requires rearrangement of the stiffness coefficients such that the original symmetry, if any, is preserved. For linear interpolation of u0 (x) and Hermite cubic interpolation of w0 (x), the submatrix [K 11 ] is of the order 2×2, [K 12 ] is 2×4, and [K 22 ] is 4×4. Therefore, the total size of the stiffness matrix is 6 × 6. Thus Eq. (4.2.23) has the speciÞc matrix form ⎡
11 K11 11 ⎢ K21 ⎢ 21 ⎢ K11 ⎢ ⎢ K 21 ⎢ 21 ⎣ K 21 31 21 K41
11 K12 11 K22 21 K12 21 K22 21 K32 21 K42
12 K11 12 K21 22 K11 22 K21 22 K31 22 K41
12 K12 12 K22 22 K12 22 K22 22 K32 22 K42
12 K13 12 K23 22 K13 22 K23 22 K33 22 K43
⎤⎧
⎫
⎧
⎫
12 K14 ue1 ⎪ ⎪ F11 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 12 ⎪ ⎪ ⎪ ⎪ K24 ⎥ ue2 ⎪ F21 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎥ ⎬ 22 ⎥ ⎨ ∆ ¯e ⎬ ⎨F2 ⎪ K14 1 1 ⎥ = 22 ⎥ ⎪ ∆ ¯e ⎪ ⎪ K24 F22 ⎪ ⎪ ⎪ 2⎪ ⎥⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 22 e 2⎪ ⎦ ¯ ⎪ ⎪ ⎪ ∆ K34 ⎪ F ⎪ ⎪ ⎪ ⎭ ⎩ 3e ⎭ ⎩ 32 ⎪ 22 ¯ ∆4 K44 F4
(4.2.49)
Rearranging the equations according to the displacement vector in Eq. (4.2.48), we obtain ⎡
11 K11 21 ⎢ K11 ⎢ 21 ⎢ K21 ⎢ ⎢ K 11 ⎢ 21 ⎣ K 21 31 21 K41
12 K11 22 K11 22 K21 12 K21 22 K31 22 K41
12 K12 22 K12 22 K22 12 K22 22 K32 22 K42
11 K12 21 K12 21 K22 11 K22 21 K32 21 K42
12 K13 22 K13 22 K23 12 K23 22 K33 22 K43
⎤⎧
⎫
⎧
⎫
12 K14 ue1 ⎪ ⎪ F11 ⎪ ⎪ ⎪ 2⎪ ⎪ ⎪ ⎪ 22 ⎥ ⎪ ∆ ¯e ⎪ ⎪ ⎪ ⎪ ⎪ K14 F1 ⎪ ⎪ ⎪ ⎪ 1⎪ ⎪ ⎪ ⎪ ⎪ ⎥ ⎬ ⎨ ⎨ 22 e 2 ¯ ⎥ K24 ⎥ ∆2 F2 ⎬ = 12 ⎥ ⎪ ue ⎪ 1 K24 ⎪ ⎪ ⎪ F2 ⎪ ⎪ ⎪ 2⎪ ⎥⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 22 e ⎦ ¯ ⎪ ⎪ ⎪ ∆ K34 ⎪ F32 ⎪ ⎪ ⎪ ⎪ 3⎪ ⎭ ⎩ ⎭ ⎩ 22 2 ¯e ∆ K44 F 4 4
(4.2.50)
The computer implementation of such rearrangement of element coefficients is presented in Box 4.2.1, where N DF denotes the degrees of freedom per node (=3) and N P E the nodes per element (=2). This rearrangement is carried out after the element coefficients [K 11 ], [K 12 ], [K 22 ], {F 1 } = {0}, and {F 2 } are computed inside loops on Gauss quadrature. There are two loops, one for full integration and another for reduced integration. The number of full Gauss points (NGP) is determined by the highest polynomial degree p of all integrands of the linear stiffness coefficients (recall that reduced integration is to be used for the nonlinear terms): NGP=(p+1)/2. For example, if linear interpolation of u0 and Hermite cubic interpolation of w0 is used, the integrands of the stiffness coefficients deÞned in Eq. (4.2.21) have the following polynomial degrees (assuming that the nonlinear terms are treated as if they are constant): 11 Kij = degree of Axx ,
12 KiJ = degree of Axx ,
22(1)
22(2)
e + 2, KIJ = degree of Aexx + 0 KIJ = degree of Dxx Fi1 = degree of f (x) + 1, FI2 = degree of q(x) + 3
NONLINEAR BENDING OF STRAIGHT BEAMS
105
Box 4.2.1 Fortran statements to rearrange stiffness coefficients. C C C C
Rearranging of the element matrix coefficients for the EULER−BERNOULLI beam element (EBE)
II=1 DO 200 I=1,NPE I0=2*I-1 ELF(II+1)=ELF2(I0) ELF(II+2)=ELF2(I0+1) JJ=1 DO 100 J=1,NPE J0=2*J-1 ELK(II,JJ) = ELK11(I,J) ELK(II,JJ+1) = ELK12(I,J0) ELK(II,JJ+2) = ELK12(I,J0+1) ELK(II+1,JJ) = ELK21(I0,J) ELK(II+2,JJ) = ELK21(I0+1,J) ELK(II+1,JJ+1) = ELK22(I0,J0) ELK(II+1,JJ+2) = ELK22(I0,J0+1) ELK(II+2,JJ+1) = ELK22(I0+1,J0) ELK(II+2,JJ+2) = ELK22(I0+1,J0+1) 100 JJ=NDF*J+1 200 II=NDF*I+1
e , F X = f , and In particular, for constant values of AXX = Aexx , DXX = Dxx 2 QX = q, we have NGP = (3 + 1)/2 = 2 (dictated by FI ) and the number of reduced integration points is LGP = 1. The full Gauss quadrature is used to evaluate [K 11 ], [K 22(1) ], {F 1 }, and {F 2 }, whereas the reduced integration is used to evaluate [K 12 ] and [K 22(2) ]. The computation of the direct stiffness coefficients and force vectors deÞned in Eq. (4.2.21) is straightforward. For example, we have
ELF 1(i) = ELF 1(i) + F X ∗ SF L(i) ∗ CNST ELF 2(I) = ELF 2(I) + QX ∗ SF H(I) ∗ CN ST ELK11(i, j) = ELK11(i, j) + AXX ∗ GDSF L(i) ∗ GDSF L(j) ∗ CN ST ELK22(I, J) = ELK22(I, J) + DXX ∗ GDDSF H(I) ∗ GDDSF H(J) ∗ CN ST in the full integration loop, and ELK12(i, J) = ELK12(i, J) + 0.5 ∗ AXX ∗ DW ∗ GDSF L(i) ∗ GDSF H(J) ∗ CNST
106
NONLINEAR FINITE ELEMENT ANALYSIS
ELK21(I, j) = ELK21(I, j) + AXX ∗ DW ∗ GDSF H(I) ∗ GDSF L(j) ∗ CN ST ELK22(I, J) = ELK22(I, J) + 0.5 ∗ AXX ∗ DW ∗ DW ∗ GDSF H(I) ∗ GDSF H(J) ∗ CN ST in the reduced integration loop. Here, SF L(i) = ψi , SF H(I) = φI , d2 φI dψi I GDSF H(I) = dφ dx , GDDSF H(I) = dx2 , GDSF L(i) = dx , and DW = (dw0 /dx) for i, j = 1, 2 and I, J = 1, 2, 3, 4. Similarly, the extra terms that need to be added to the direct stiffnesses can be computed in the reduced integration loop as [see Eq. (4.2.41)] T AN G12(i, J) = T AN G12(i, J) + 0.5 ∗ AXX ∗ DW ∗ GDSF L(i) ∗ GDSF H(J) ∗ CN ST T AN G22(I, J) = T AN G22(I, J) + AXX ∗ (DU + DW ∗ DW ) ∗ GDSF H(I) ∗ GDSF H(J) ∗ CN ST where DU = (du0 /dx). Example 4.2.1 Consider a beam of length L = 100 in., 1 in. × 1 in. cross-sectional dimensions, hinged at both ends, made of steel (E = 30 msi), and subjected to uniformly distributed load of intensity q0 lb/in. Using the symmetry about x = L/2, one-half of the domain is used as the computational domain. The geometric boundary conditions for the computational domain are ³ ´ dw0 =0 (4.2.51) w0 (0) = u0 (L/2) = dx x= L2 The load is divided into load increments of equal size ∆q0 = 1 lb/in. A tolerance of ² = 10−3 and maximum allowable iterations of 30 (per load step) are used in the analysis. The initial solution vector is chosen to be the zero vector, so that the Þrst iteration solution corresponds to the linear solution q L4 u0 (x) = 0, w0 (x) = 0 24Dxx
µ
x x3 x4 −2 3 + 4 L L L
¶
(4.2.52)
In particular, the center deßection is (for q0 = 1) L 5q0 L4 = 0.5208 in. w0 ( ) = 2 384Dxx
(4.2.53)
For the four element mesh, the linear stiffness matrix, force vector, and the global linear solution vector are given by (with the speciÞed boundary conditions ∆2 = 0, ∆13 = 0 and ∆15 = 0)
⎡ 24 0.0000 0.00 −24 0.0000 0.00 ⎤ 0 −0.1536 −0.96 ⎥ 0.1536 −0.96 ⎢ 0 ⎢ 0 −0.9600 8.00 0 0.9600 4.00 ⎥ e 5 ⎥ [K ] = 10 ⎢ ⎢ −24 0.0000 0.00 24 0.0000 0.00 ⎥ ⎣ ⎦ 0 0
−0.1536 −0.9600
0.96 4.00
0 0
0.1536 0.9600
0.96 8.00
NONLINEAR BENDING OF STRAIGHT BEAMS
{F e } =
⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩
⎫ 0.000 ⎪ ⎪ 6.250 ⎪ ⎪ ⎬
−13.021
0.000 ⎪ ⎪ ⎪ 6.250 ⎪ ⎭ 13.021
,
⎧ ⎫ ∆3 ⎪ ⎪ ⎪ ⎪ ⎪ ∆5 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆6 ⎪ ⎪ ⎪ ⎨ ⎬ ∆8
∆9 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆11 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ∆12 ⎪ ⎭
=
∆14
107
⎧ ⎫ −0.01666 ⎪ ⎪ ⎪ ⎪ ⎪ 0.20223 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ −0.01523 ⎪ ⎪ ⎪ ⎨ ⎬ 0.37109
−0.01146 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 0.48218 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ −0.00612 ⎪ ⎭
0.52083
Table 4.2.1 contains the results of the nonlinear analysis obtained with the direct iteration procedure as well as the Newton—Raphson iteration (acceleration parameter, γ = 0). The Gauss rule M × N has the meaning that M Gauss points are used for the evaluation of linear stiffness coefficients as well as the force components, and N Gauss points are used to evaluate the nonlinear stiffness coefficients. As discussed earlier, the problem should not exhibit any nonlinearity. The correct solution (4.2.53) is predicted by the use of 2 × 1 Gauss rule (see the last column of Table 4.2.1). Both 4 and 8 element meshes and direct and Newton—Raphson methods predicted the same result. The 2 × 2 Gauss rule not only yields incorrect results, but it takes more iterations to converge.
Table 4.2.1 Finite element results for the deßections of a hinged—hinged beam under uniformly distributed load. Load q0
Direct iteration (DI) (2 × 2) 4 elem.
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0 ∗
0.5108 0.9739 1.3763 1.7269 2.0356 2.3122 2.5617 2.7936 3.0049 3.2063
(3)∗ (5) (6) (7) (9) (11) (14) (17) (22) (29)
8 elem. 0.5182 1.0213 1.4986 1.9451 2.3609 2.7471 3.1054 3.4418 3.7570 4.5013
(3) (3) (4) (4) (5) (5) (6) (7) (7) (8)
Newton—Raphson (NR) (2 × 2) 4 elem. 0.5108 0.9739 1.3764 1.7265 2.0351 2.3116 2.5630 2.7930 3.0060 3.2051
(4) (4) (4) (4) (4) (3) (2) (2) (3) (3)
8 elem. 0.5182 1.0213 1.4986 1.9453 2.3607 2.7467 3.1074 3.4422 3.7564 4.0523
(4) (4) (4) (4) (4) (3) (2) (2) (2) (2)
DI—NR 2×1 4 and 8 0.5208 1.0417 1.5625 2.0833 2.6042 3.1250 3.6458 4.1667 4.6875 5.2083
(3) (3) (3) (3) (3) (3) (3) (3) (3) (3)
Number of iterations taken to converge.
Example 4.2.2 Next, we consider the straight beam of Example 4.2.1 with (a) pinned ends, and (b) clamped ends, and under uniformly distributed transverse load. Noting the symmetry of the solution about x = L/2, one-half of the domain is used as the computational domain. The geometric boundary conditions for the computational domain of the two problems are dw0 L | L =0 pinned: u0 (0) = w0 (0) = u0 ( ) = 2 dx x= 2 dw0 L dw0 clamped: u0 (0) = w0 (0) = | = u0 ( ) = | L =0 dx x=0 2 dx x= 2
(4.2.54) (4.2.55)
108
NONLINEAR FINITE ELEMENT ANALYSIS
The load increments of ∆q0 = 1.0 lb/in., a tolerance of ² = 10−3 , and maximum allowable iterations of 25 (per load step) are used in the analysis. The initial solution vector is chosen to be the zero vector. Solutions to the linear problems are
³
clamped: u0 (x) = 0,
´
x 2 q0 L4 x2 1− 2 24Dxx L L µ ¶ x q0 L4 x3 x4 w0 (x) = −2 3 + 4 24Dxx L L L
pinned: u0 (x) = 0, w0 (x) =
(4.2.56) (4.2.57)
and the maximum deßections occurs at L/2. For q0 = 1 lb/in., L = 100 in., and E = 30 × 106 psi, they are given by (Dxx = EH 3 /12, H = 1) L pinned: w0 ( ) = 2 L clamped: w0 ( ) = 2
5q0 L4 = 0.5208 in. 384Dxx q0 L4 = 0.1042 in. 384Dxx
(4.2.58) (4.2.59)
The linear nodal displacements obtained using four elements in half beam are
⎧ ⎫ ∆3 ⎪ ⎪ ⎪ ⎪ ⎪ ∆5 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆6 ⎪ ⎪ ⎪ ⎨ ⎬ ∆8
∆9 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆ 11 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ∆12 ⎪ ⎭ ∆14
=
pinned
⎧ ⎫ −0.01666 ⎪ ⎪ ⎪ ⎪ 0.20223 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ −0.01523 ⎪ ⎪ ⎪ ⎨ ⎬ 0.37109
−0.11458 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 0.48218 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ − 0.00612 ⎪ ⎪ ⎩ ⎭
,
⎧ ⎫ ∆5 ⎪ ⎪ ⎪ ⎪ ⎪ ∆6 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ∆8 ⎪ ⎬ ∆14
0.52083
=
∆
9 ⎪ ⎪ ⎪ ∆11 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆ ⎩ 12 ⎪ ⎭
clamped
⎧ ⎫ 0.01994 ⎪ ⎪ ⎪ ⎪ ⎪ −0.00273 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ 0.05859 ⎪ ⎬ −0.00313
⎪ ⎪ ⎪ 0.09155 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ − 0.00195 ⎩ ⎭ 0.10417
Tables 4.2.2 and 4.2.3 contain the results of the nonlinear analysis of pinned—pinned and clamped—clamped beams, respectively; the results were obtained with the Newton—Raphson iteration method. The direct iteration method did not converge even for 100 iterations per load step when ∆q = 1.0. It is possible to Þnd a value of ∆q and IT MAX for which one can obtain converged solutions.
Table 4.2.2 Finite element results for the deßections of a pinned—pinned beam under uniform load (N—R). 2×2 Load q0 1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0 ∗
4 elements 0.3669 0.5424 0.6601 0.7510 0.8263 0.8912 0.9485 1.0002 1.0473 1.0908
(5)∗ (4) (3) (3) (3) (3) (3) (3) (3) (3)
2×1 8 elements
4 elements
8 elements
0.3680 0.5446 0.6629 0.7543 0.8299 0.8950 0.9525 1.0043 1.0516 1.0952
0.3687 0.5466 0.6663 0.7591 0.8361 0.9027 0.9617 1.0150 1.0638 1.1089
0.3685 0.5457 0.6645 0.7564 0.8324 0.8979 0.9558 1.0080 1.0557 1.0997
Number of iterations taken to converge.
(5) (4) (3) (3) (3) (3) (3) (3) (3) (3)
(5) (4) (4) (4) (4) (4) (4) (4) (4) (4)
(5) (4) (4) (4) (4) (4) (4) (4) (4) (4)
NONLINEAR BENDING OF STRAIGHT BEAMS
109
There is no signiÞcant difference between the solutions obtained with the two integration rules for this problem. Figure 4.2.5 shows the load—deßection curves for the two beams. If the axial displacement degrees of freedom are suppressed (i.e. equivalent to setting u0 = 0 at every point of the beam) in the nonlinear analysis of beams, the beam will behave very stiff, and the deßections experienced will be less than those shown in Tables 4.2.2 and 4.2.3 and Figure 4.2.5.
Table 4.2.3 Finite element results for the deßections of a clamped—clamped beam under uniform load (N—R and 2 × 1 Gauss rule). Direct iteration Load q0
4 elements
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0
0.1033 0.2022 0.2938 0.3773 0.4529 0.5213 0.5840 0.6412 0.6945 0.7433
8 elements
4 elements
8 elements
0.1034 0.2023 0.2939 0.3774 0.4531 0.5215 0.5842 0.6412 0.6944 0.7431
0.1034 0.2022 0.2939 0.3773 0.4528 0.5214 0.5839 0.6413 0.6943 0.7435
0.1034 0.2023 0.2939 0.3774 0.4530 0.5216 0.5841 0.6414 0.6943 0.7433
(3) (4) (4) (5) (5) (6) (7) (8) (9) (10)
(3) (3) (3) (3) (3) (3) (3) (3) (3) (3)
Number of iterations taken to converge.
1.20 1.10 1.00
Pinned-pinned
0.90
Deflection, w0
∗
(3)∗ (4) (4) (5) (5) (6) (7) (8) (9) (10)
Newton—Raphson iteration
0.80 0.70 0.60 0.50 0.40
Clamped-clamped
0.30 0.20 0.10 0.00 0.0 1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0
Load, q0
Figure 4.2.5 Load versus deßection curves.
(3) (3) (3) (3) (3) (3) (3) (3) (3) (3)
110
NONLINEAR FINITE ELEMENT ANALYSIS
4.3 Timoshenko Beams 4.3.1 Displacement Field and Strains The EBT is based on the assumption that a straight line transverse to the axis of the beam before deformation remains (i) straight, (ii) inextensible, and (iii) normal to the mid-plane after deformation. In the TBT, the Þrst two assumptions are kept but the normality condition is relaxed by assuming that the rotation is independent of the slope (w0,x ) of the beam. The displacement Þeld of the beam in the TBT can be expressed as u1 = u0 (x) + zφx (x),
u2 = 0,
u3 = w0 (x)
(4.3.1)
where (u1 , u2 , u3 ) are the displacements of a point along the (x, y, z) coordinates, (u0 , w0 ) are the displacements of a point on the mid-plane of an undeformed beam, and φx is the rotation (about the y-axis) of a transverse straight line (see Figure 4.3.1). The only non-zero strains are
γxz
µ
¶
µ
∂u1 1 dw0 2 du0 1 dw0 = + + ∂x 2 dx dx 2 dx ∂u1 ∂u3 dw0 0 = + = φx + ≡ γxz ∂z ∂x dx
εxx =
¶2
+z
dφx ≡ ε0xx + zε1xx (4.3.2) dx (4.3.3)
The virtual strains are δε0xx =
dδu0 dw0 dδw0 dδφx dδw0 0 + , δε1xx = , δγxz = δφx + dx dx dx dx dx
γxz x
φx
−
dw0 dx
w0 −
dw0 dx
z
u0
Figure 4.3.1 Kinematics of a beam in the TBT.
(4.3.4)
NONLINEAR BENDING OF STRAIGHT BEAMS
111
4.3.2 Weak Forms Next, we use the principle of virtual displacements to develop the necessary weak statements of the TBT. We have 0 = δW e ≡ δWIe + δWEe
δWIe =
=
Z xb Z x Z xa b x
=
Z
Ae
Z xa b ³ xa
δWEe
Ae
=−
(4.3.5)
(σxx δεxx + σxz δγxz ) dA dx h
³
´
i
0 σxx δε0xx + zδε1xx + σxz δγxz dA dx
´
0 Nxx δε0xx + Mxx δε1xx + Qx δγxz dx
"Z xb xa
qδw0 dx +
Z xb xa
f δu0 dx +
6 X
(4.3.6a)
Qei δ∆ei
i=1
#
(4.3.6b)
where q is the distributed transverse load, Qei are the element generalized forces, ∆ei element generalized displacements, and Nxx =
Z
A
σxx dA, Mxx =
Z
A
σxx z dA, Qx = Ks
Z
A
σxz dA
(4.3.7)
and Ks is the shear correction coefficient introduced to account for the difference between the shear energy calculated using equilibrium stresses and that predicted by the Timoshenko beam theory on account of constant state of shear stress through the beam height. For example, consider a homogeneous beam with rectangular cross-section, with width b and height h. The actual shear stress distribution through the thickness of the beam is given by c σxz
"
µ
2z 3Q0 = 1− 2bh h
¶2 #
, −
h h ≤z≤ 2 2
where Q0 is the transverse load. The transverse shear stress in the first-order f = Q /bh. The strain energies due to transverse shear theory is a constant, σxz 0 stresses in the two theories are Usc =
1 2G13
Z
A
c 2 (σxz ) dA =
3Q20 1 , Usf = 5G13 bh 2G13
Z ³ A
f σxz
´2
dA =
Q20 2G13 bh
The shear correction factor is the ratio of Usf to Usc , which gives Ks = 5/6. The shear correction factor, in general, depends on the geometry and material properties.
112
NONLINEAR FINITE ELEMENT ANALYSIS
The Euler—Lagrange equations are given by δu0 : δφ : δw0 :
dNxx = f (x) dx dMxx + Qx = 0 − dx µ ¶ dw0 dQx d − Nxx = q(x) − dx dx dx −
(4.3.8) (4.3.9) (4.3.10)
It is clear that (u0 , w0 , φx ) are the primary variables and Nxx , Qx , and Mxx
(4.3.11)
are the secondary variables. Thus the pairing of the primary and secondary variables is as follows: (u0 , Nxx ),
(w0 , Qx ),
(φx , Mxx )
(4.3.12)
Only one member of each pair may be speciÞed at a point in the beam. If we assume linear elastic behavior σxx = Eεxx ,
σxz = Gγxz
(4.3.13a)
the axial force Nxx , the shear force Qx , and bending moment Mxx can be expressed in terms of the generalized displacements (u0 , w0 , φx ) using the deÞnitions (4.3.7). We obtain Nxx = Axx
"
"
du0 1 + dx 2
µ
µ
dw0 dx
du0 1 dw0 Mxx = Bxx + dx 2 dx µ ¶ dw0 Qx = Sxx + φx dx
¶2 #
¶2 #
+ Bxx
dφx dx
+ Dxx
dφx dx
(4.3.13b)
where Axx , Bxx , and Dxx are deÞned in Eq. (4.2.16), and Sxx is the shear stiffness Z G dA = Ks GA (4.3.13c) Sxx = Ks A
G being the shear modulus, Ks the shear correction coefficient, and A the area of cross-section. As discussed earlier, the stiffnesses Axx , Bxx , and Dxx are functions of x whenever the modulus E and/or cross-sectional area is a function of x.
NONLINEAR BENDING OF STRAIGHT BEAMS
113
The equations of equilibrium of the TBT for the isotropic case can be expressed in terms of the generalized displacements as d − dx
−
(
du0 1 + dx 2
µ
dw0 dx
¶2 #)
=f
(4.3.14)
dw0 d + φx Sxx dx dx ( " µ ¶ #) dw0 du0 1 dw0 2 d − Axx =q + dx dx dx 2 dx µ ¶ µ ¶ dφx dw0 d + φx = 0 Dxx + Sxx − dx dx dx
(4.3.15)
∙
Axx
"
µ
¶¸
(4.3.16)
4.3.3 General Finite Element Model The Þnite element model of the Timoshenko beam equations can be constructed using the virtual work statement in Eqs. (4.3.5), where the axial force Nxx , the shear force Qx , and bending moment Mxx are known in terms of the generalized displacements (u0 , w0 , φx ) by Eq. (4.3.13b). The virtual work statement (4.3.5) is equivalent to the following three statements 0=
Z xb (
"
dδu0 du0 1 Axx + dx dx 2
xa
µ
dw0 dx
− Qe1 δu0 (xa ) − Qe4 δu0 (xb )
¶2 #
)
+ f δu0 dx (4.3.17)
( " µ ¶ µ ¶2 # Z xb dδw0 dw dw du dw 1 0 0 0 0 e Sxx + φx + Aexx + 0=
dx
xa
)
dx
dx
−δw0 q dx − Qe2 δw0 (xa ) − Qe5 δw0 (xb )
Z xb ∙
e dδφx Dxx
µ
dw0 dφx e 0= δφx + Sxx + φx dx dx dx xa − Qe3 δφx (xa ) − Qe6 δφx (xb )
dx
2
dx
(4.3.18) ¶¸
dx (4.3.19)
where δu0 , δw0 , and δφx are the virtual displacements. The Qei have the same physical meaning as in the Euler—Bernoulli beam element, and their relationship to the horizontal displacement u0 , transverse deßection w0 , and rotation φx , is Qe1 = −Nxx (xa ),
Qe4 = Nxx (xb ) ¸ ∙ ¸ ∂w0 ∂w0 e e , Q5 = Qx + Nxx Q2 = − Qx + Nxx ∂x x=xa ∂x x=xb Qe3 = −Mxx (xa ), Qe6 = Mxx (xb ) (4.3.20) ∙
114
NONLINEAR FINITE ELEMENT ANALYSIS
An examination of the virtual work statements (4.3.17)—(4.3.19) suggests that u0 (x), w0 (x), and φx (x) are the primary variables and therefore must be carried as nodal degrees of freedom. In general, u0 , w0 , and φx need not be approximated by polynomials of the same degree. However, the approximations should be such that possible deformation modes (i.e. kinematics) are represented correctly. We will return to this point shortly. It is also possible to develop the weak forms (4.3.17)—(4.3.19) using the governing equations (4.3.8)—(4.3.10) and introducing the secondary variables (4.3.20). It is left as an exercise to the reader. Suppose that the displacements are approximated as u0 (x) =
m X
(1)
uej ψj , w0 (x) =
j=1
n X
(2)
wje ψj , φx (x) =
j=1
p X
(3)
sej ψj
(4.3.21)
j=1
(α)
where ψj (x) (α = 1, 2, 3) are Lagrange interpolation functions of degree (m − 1), (n − 1), and (p − 1), respectively. At the moment, the values of m, n, and p are arbitrary, that is, arbitrary degree of polynomial approximations of u0 , w0 , and φx may be used. Substitution of (4.3.21) for u0 , w0 , and φx , and (1) (2) (3) δu0 = ψi , δw0 = ψi , and δφx = ψi into Eqs. (4.3.17)—(4.3.19) yields the Þnite element model 0= 0= 0=
m X
j=1 m X j=1 m X
11 e Kij uj +
21 e Kij uj +
31 e Kij uj +
j=1
11 Kij
=
xa
21 Kij = 22 Kij
Z xb
=
23 Kij = 33 Kij =
Z xb xa
Z xb xa
Z xb xa
Z xb xa
n X
j=1 n X j=1 n X
12 e Kij wj +
22 e Kij wj +
32 e Kij wj +
j=1
dx,
12 Kij
1 = 2
(1)
Axx
(2) dw0 dψi dψj dx dx dx (2)
(2) dψ dψj Sxx i dx dx (2)
Sxx ⎛
dψi dx
(3)
ψj
j=1 p X j=1 p X j=1
(1)
(1) dψi dψj Axx dx dx
p X
xa
(4.3.22)
23 e Kij sj − Fi2
(4.3.23)
33 e Kij sj − Fi3
(4.3.24)
(2)
(1) dw0 dψi dψj Axx dx dx dx
13 Kij = 0,
dx,
1 dx + 2
Z xb
13 e Kij sj − Fi1
Z xb xa
Axx
µ
dw0 dx
dx
31 Kij =0
¶2
(2)
(2) dψi dψj dx dx
dx
32 dx = Kji (3)
⎞
(3) dψ dψj (3) (3) ⎝Dxx i + Sxx ψi ψj ⎠ dx dx dx
(4.3.25a)
NONLINEAR BENDING OF STRAIGHT BEAMS
Fi1 = Fi2 =
Z xb x Z xa b xa
(1)
(1)
(1)
(2)
(2)
(2)
115
ψi f dx + Qe1 ψi (xa ) + Qe4 ψi (xb ) ψi q dx + Qe2 ψi (xa ) + Qe5 ψi (xb ) (3)
(3)
Fi3 = Qe3 ψi (xa ) + Qe6 ψi (xb )
(4.3.25b)
The element equations (4.3.22)—(4.3.24) can be expressed in matrix form as ⎡
⎤⎧
⎫
⎧
⎫
[K 11 ] [K 12 ] [K 13 ] ⎨ {u} ⎬ ⎨ {F 1 } ⎬ ⎣ [K 21 ] [K 22 ] [K 23 ] ⎦ {w} = {F 2 } ⎩ ⎭ ⎩ ⎭ {s} [K 31 ] [K 32 ] [K 33 ] {F 3 }
(4.3.26)
(α)
The choice of the approximation functions ψi dictates different Þnite element (1) (2) models. The choice of linear polynomials ψi = ψi is known to yield a stiffness matrix that is nearly singular. This will be discussed further in the (1) (2) next section. When ψi are quadratic and ψi are linear, the stiffness matrix is 5 × 5. It is possible to eliminate the interior degree of freedom for w0 and (1) obtain 4 × 4 stiffness matrix. This element behaves well. When ψi are cubic (2) and ψi are quadratic, the stiffness matrix is 7 × 7. If the interior nodal degrees of freedom are eliminated, one obtains 4 × 4 stiffness matrix that is known to yield the exact solution at the nodes in the linear case when the shear stiffness and bending stiffnesses are element-wise constant. More details of various Timoshenko beam elements will be given in the sequel.
4.3.4 Shear and Membrane Locking A number of Timoshenko beam Þnite elements for the linear case (i.e. without von K´arm´ an nonlinearity) have appeared in the literature. They differ from each other in the choice of approximation functions used for the transverse deßection w0 and rotation φx , or in the variational form used to develop the Þnite element model. Some are based on equal interpolation and others on unequal interpolation of w0 and φx . The Timoshenko beam Þnite element with linear interpolation of both w0 and φx is the simplest element. Linear interpolation of w0 means that the slope dw0 /dx is constant (see Figure 4.3.2). In thin beam limit, that is, as the length-to-thickness ratio becomes large (say, 100), the slope should be equal to −φx , which is also represented as linear as opposed to being a constant. On the other hand, a constant representation of φx results in zero bending energy while the transverse shear is non-zero. This inconsistency in the representation of the kinematics through linear approximation of both w0 and φx results in zero displacements and rotations, which trivially satisfy the Kirchhoff constraint φx = −dw0 /dx, and the element is said be very stiff in the thin beam limit. Such behavior is known as shear locking.
116
NONLINEAR FINITE ELEMENT ANALYSIS
w2 w1
s1 1
2
1
s2 he
he
2
Figure 4.3.2 Kinematics of deformation of the Timoshenko beam element when both w0 and φx are interpolated linearly. To overcome the locking, one may use equal interpolation for both w0 and φx but treat φx as a constant in the evaluation the shear strain, γxz = (dw0 /dx) + φx . This is often realized by using selective integration, in which one-point (reduced) Gauss quadrature is used to evaluate the stiffness coefficients associated with the transverse shear strain, and all other coefficients of the stiffness matrix are evaluated using exact (full) integration. A more detailed discussion on the alleviation of shear locking and membrane locking in Timoshenko beam element is presented below. Since applied distributed loads are represented as point loads in the Þnite e element method, Eq. (4.3.15) with q = 0 and constant Sxx implies that 0 ≡ φx + (shear strain) γxz
dw0 = constant dx
(4.3.27)
Similarly, for a problem that involves only bending deformation, the element should experience no stretching [see Eq. (4.3.14) with f = 0]: (membrane strain) ε0xx ≡
du0 1 + dx 2
µ
dw0 dx
¶2
=0
(4.3.28)
In order to satisfy the above constraints, we must have dw0 dx µ ¶ dw0 2 du0 ∼ dx dx φx ∼
(4.3.29) (4.3.30)
The similarity is in the sense of having the same degree of polynomial variation. For example, when φx is linear and w0 is quadratic, the constraint in Eq. (4.3.27) is clearly met. Similarly, when both u0 and w0 are linear, the constraint in Eq. (4.3.28) is automatically met; however, when quadratic
NONLINEAR BENDING OF STRAIGHT BEAMS
117
interpolation is used for both u0 and w0 , du0 /dx is linear and (dw0 /dx)2 is quadratic and the resulting element experiences locking, known as the membrane locking. If u0 is interpolated using a cubic polynomial, w0 with a quadratic polynomial, and φx with a linear polynomial, we have dw0 (linear) dx µ ¶ dw0 2 du0 (quadratic) (quadratic) ∼ dx dx φx (linear) ∼
(4.3.31) (4.3.32)
In summary, the constraints would be satisÞed for the following two cases: • u0 , φx , and w0 all linear, with constant representation of γxz ; the latter can be accomplished by using reduced integration to evaluate the shear stiffness coefficients. • u0 is cubic, w0 is quadratic, and φx is linear. However, this will result in a 9 × 9 stiffness matrix with different degrees of freedom at different nodes, making it difficult (but not impossible) to implement into a computer program. The membrane locking can also be avoided, in addition to using appropriate interpolation of the variables, by using selective Gauss quadrature, as discussed in Section 4.2.7. In the present study, we shall use equal linear or quadratic interpolation of the variables (u0 , w0 , φ) with reduced integration of all nonlinear terms (to avoid membrane locking) and shear terms, that is, stiffness coefficients involving Sxx (to avoid shear locking) of the stiffness matrix.
4.3.5 Tangent Stiffness Matrix Returning to the nonlinear Þnite element model (4.3.26) of Section 4.3.3, we compute the tangent stiffness matrix of the Timoshenko beam element. Much of the computer implementation discussion presented in Section 4.2.8 is also valid for the Timoshenko beam element. The tangent matrix coefficients are deÞned by αβ Tijαβ = Kij +
n 3 X X
∂ ¡ αγ ¢ γ Kik ∆k β γ=1 k=1 ∂∆j
In particular, we have 11 +0 Tij11 = Kij
Tij12
=
12 Kij
1 + 2
Z xb xa
(2)
(1) dw0 dψi dψj 12 dx = 2Kij Axx dx dx dx
(4.3.33)
118
NONLINEAR FINITE ELEMENT ANALYSIS
13 Tij13 = Kij =0 21 21 + 0 = Kij Tij21 = Kij
Tij22
=
22 Kij
+
Z
xb
xa
Axx
"
µ
du0 dw0 + dx dx
¶2 #
(2)
(2) dψi dψj dx dx dx
23 23 + 0 = Kij Tij23 = Kij 31 31 Tij31 = Kij + 0 = Kij 32 32 Tij32 = Kij + 0 = Kij 33 33 Tij33 = Kij + 0 = Kij
(4.3.34)
αβ are deÞned by Eq. (4.3.25a). where the direct stiffness coefficients Kij As discussed earlier, we must use reduced integration on nonlinear stiffness coefficients and shear stiffness coefficients, while the remaining stiffness coefficients may be evaluated using full integration. For example, consider the following integral expression:
Z
xb
xa
⎡
(2)
(2) 3 du0 dψi dψj ⎣ + Axx dx dx dx 2
µ
dw0 dx
¶2
(2)
⎤
(2) dψi dψj ⎦ dx dx dx
(4.3.35)
If quadratic interpolation of both u0 and w0 is used (see Figure 4.3.3) and Axx is constant, then the Þrst term in the integrand is a cubic polynomial while the second term is a fourth-order polynomial. Thus, exact evaluation of the Þrst term requires two-point Gauss quadrature while the second term requires three-point Gauss quadrature. If we use two-point Gauss quadrature 22 ), the Þrst term in the coefficient of A to evaluate Tij22 (and Kij xx is integrated exactly while the second term is integrated approximately. This amounts to approximating (dw0 /dx)2 as a linear polynomial. Consequently, the constraint ε0xx = 0 [see Eq. (4.3.28)] is satisÞed. The rearrangement of the elements of nodal displacement vector, as shown αβ in Eq. (4.2.50), requires rearranging of Kij of Eq. (4.3.26). Box 4.3.1 shows the logic for this rearrangement.
w1
s1
w2 2
1
2 he
he
w1 1
w2 2 he
s2
1
s1
w3 3
1
s2 2 he
s3 3
Figure 4.3.3 Linear and quadratic Timoshenko beam Þnite elements.
NONLINEAR BENDING OF STRAIGHT BEAMS
119
Box 4.3.1 Fortran statements to rearrange stiffness coefficients. C Rearranging of the element stiffness coefficients C of the TIMOSHENKO beam element (TBT) C ELK11, ELF1, etc are defined by Eqs. .. (4.3.25a,b) C II=1 DO 160 I=1,NPE JJ=1 ELF(II) = ELF1(I) ELF(II+1) = ELF2(I) DO 150 J=1,NPE ELK(II,JJ) = ELK11(I,J) ELK(II,JJ+1) = ELK12(I,J) ELK(II+1,JJ) = ELK21(I,J) ELK(II+1,JJ+1) = ELK22(I,J) ELK(II+1,JJ+2) = ELK23(I,J) ELK(II+2,JJ+1) = ELK32(I,J) ELK(II+2,JJ+2) = ELK33(I,J) 150 JJ=J*NDF+1 160 II=I*NDF+1
Example 4.3.1 Consider the hinged—hinged beam of Example 4.2.1. Using the symmetry about x = L/2, one-half of the domain is used as the computational domain. The geometric boundary conditions for the computational domain are L L w0 (0) = u0 ( ) = φx ( ) = 0 2 2
(4.3.36)
The load is divided into load increments of equal size ∆q0 = 1 lb/in. A tolerance of ² = 10−3 is used in the analysis. The initial solution vector is chosen to be the zero vector, so that the Þrst iteration solution corresponds to the linear problem. The exact linear solution is (u0 (x) = 0) q0 L4 24Dxx
µ
¶
x x3 x4 q L2 −2 3 + 4 + 0 L 2Sxx L L
µ
x x2 − 2 L L
¶
,
φx (x) =
q 0 L3 24Dxx
µ
¶
x2 x3 +4 3 2 L L (4.3.37) The center deßection of the linear problem is (q0 = 1 lb/in., E = 30 × 106 psi, ν = 0.25, and Ks = 5/6) w0 (x) =
L 5q0 L4 q L2 + 0 = 0.5208 + 0.0125 × 10−4 = 0.5208 in. w0 ( ) = 2 384Dxx 8Sxx
1−6
(4.3.38)
Thus, the effect of shear deformation is negligible. It should be noted that the reducedintegration (Timoshenko) element (RIE), in general, does not give exact nodal values even for the linear problem (i.e. not a superconvergent element). For a reÞned mesh and/or higher-order elements, one may expect to get the exact linear solution.
120
NONLINEAR FINITE ELEMENT ANALYSIS
For the mesh of four reduce integration elements, the linear stiffness matrix, force vector, and the global linear solution vector are (with ν = 0.25 and speciÞed boundary conditions ∆2 = 0, ∆13 = 0 and ∆15 = 0)
⎡ 24 0.0 0.0 −24 0.0 0.0 ⎤ 0 −8.0 −50.0 ⎥ 8.0 −50.0 ⎢ 0 ⎢ 0 −50.0 314.5 0 50.0 310.5 ⎥ e 5 ⎢ ⎥ [K ] = 10 ⎢ −24 0.0 0.0 24 0.0 0.0 ⎥ ⎣ ⎦ −8.0 −50.0
0 0
{F e } =
⎧ 0.00 ⎫ ⎪ ⎪ ⎪ ⎪ ⎪ 6.25 ⎪ ⎪ ⎪ ⎨ ⎬ 0.00
0.00 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ 6.25 ⎪ ⎭
,
0.00
50.0 310.5
⎧ ⎫ ∆3 ⎪ ⎪ ⎪ ⎪ ⎪ ∆5 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆6 ⎪ ⎪ ⎪ ⎨ ⎬ ∆8
∆9 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ∆11 ⎪ ⎪ ⎪ ⎪ ⎪ ∆12 ⎪ ⎪ ⎪ ⎪ ⎩ ⎭ ∆14
0 0
=
8.0 50.0
50.0 314.5
⎧ ⎫ −0.01641 ⎪ ⎪ ⎪ ⎪ ⎪ 0.19659 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ −0.01504 ⎪ ⎪ ⎪ ⎨ ⎬ 0.36142
−0.01133 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ 0.47009 ⎪ ⎪ ⎪ ⎪ ⎪ −0.00605 ⎪ ⎪ ⎪ ⎪ ⎩ ⎭
0.5079
Table 4.3.1 contains the results obtained with the Newton—Raphson iteration; FI denotes full integration (NGP = LGP = 2 for linear elements NGP = LGP = 3 for quadratic elements) and RI denotes reduced integration (NGP = 2 and LGP = 1 for linear elements and NGP = 3 and LGP = 2 for quadratic elements). The convergence is reached in 3 iterations. It is clear that the quadratic elements are not as sensitive as the linear elements to locking; also, the effect of locking on the solution becomes less with reÞned meshes. The convergence of the solution with mesh reÞnement is also clear.
Table 4.3.1 Finite element results for the deßections of a hinged—hinged beam under uniform load. Load q0
Integration rule
4L
2Q
8L
4Q
16L
8Q
1.0
RI FI
0.5079 0.0101
0.5210 0.4943
0.5177 0.0370
0.5210 0.5149
0.5201 0.1223
0.5210 0.5198
2.0
RI FI
1.0159 0.0201
1.0419 0.9817
1.0354 0.0741
1.0419 1.0294
1.0403 0.2447
1.0419 1.0395
3.0
RI FI
1.5238 0.0302
1.5629 1.4560
1.5531 0.1111
1.5629 1.5428
1.5604 0.3670
1.5629 1.5592
4.0
RI FI
2.0318 0.0403
2.0838 1.9130
2.0708 0.1482
2.0838 2.0548
2.0806 0.4893
2.0838 2.0788
5.0
RI FI
2.5397 0.0504
2.6048 2.3502
2.5885 0.1852
2.6048 2.5654
2.6007 0.6117
2.6048 2.5983
10.0
RI FI
5.0794 0.1007
5.2096 4.2312
5.1770 0.3704
5.2096 5.0728
5.2014 1.2233
5.2096 5.1927
NONLINEAR BENDING OF STRAIGHT BEAMS
121
Example 4.3.2 Here we consider the pinned—pinned beam of Example 3.2.2. The geometric boundary conditions for the computational domain of the problem are L L u0 (0) = w0 (0) = u0 ( ) = φx ( ) = 0 2 2
(4.3.39)
The load increments of ∆q0 = 1.0 lb/in., a tolerance of ² = 10−3 is used in the analysis. The initial solution vector is chosen to be the zero vector. Table 4.3.2 contains the results for pinned—pinned beam; the results were obtained with the Newton—Raphson iteration (γ = 0) method and reduced integration. The convergence of the solution with mesh reÞnement and higher-order elements is apparent from the results. Also, higher-order elements and reÞned meshes are less sensitive to shear locking.
Table 4.3.2 Finite element results for the deßections of a pinned—pinned beam under uniformly distributed load. Load q0 1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0 ∗
4L 0.3654 0.5439 0.6637 0.7562 0.8327 0.8985 0.9567 1.0090 1.0568 1.1009
2Q (5)∗ (4) (3) (3) (3) (3) (3) (3) (3) (3)
0.3687 0.5458 0.6644 0.7560 0.8318 0.8970 0.9546 1.0065 1.0538 1.0975
8L (5) (4) (3) (3) (3) (3) (3) (3) (3) (3)
0.3677 0.5451 0.6639 0.7557 0.8316 0.8969 0.9546 1.0066 1.0540 1.0977
4Q (5) (4) (3) (3) (3) (3) (3) (3) (3) (3)
0.3685 0.5454 0.6640 0.7555 0.8312 0.8964 0.9540 1.0058 1.0531 1.0967
(5) (4) (3) (3) (3) (3) (3) (3) (3) (3)
Number of iterations taken to converge.
Table 4.3.3 contains nonlinear deßections, w ¯ = wmax 102 (Dxx /L4 ), of pinned—pinned beams for various length-to-thickness ratios L/H. The effect of shear deformation is clear from the results; thicker the beams, larger the shear strains and deßections w. ¯ Of course, the maximum deßection wmax will be smaller with smaller L/H ratio (or thicker beams), because thicker beams have larger stiffness. Thus they also exhibit less geometric nonlinearity, as can be seen from Figure 4.3.4, where the deßection at the center, w0 (L/2), is plotted as a function of the load q0 for various values of L/H ratio. The deßections predicted by the TBT are the same as those predicted by the EBT when L/H ≥ 100. Lastly, we consider the clamped—clamped beam of Example 4.2.3. The geometric boundary conditions for the computational domain of the problem are L L u0 (0) = w0 (0) = φx (0) = u0 ( ) = φx ( ) = 0 2 2
(4.3.40)
All other parameters are taken to be the same as in the case of the pinned—pinned beam. Table 4.3.4 contains the nonlinear analysis results for clamped—clamped beam; the results were obtained with the direct iteration as well as the Newton—Raphson iteration method using (a) mesh of 8 linear Timoshenko beam elements, and (b) 4 quadratic Timoshenko beam elements. The results obtained with both methods and meshes are virtually the same, although the direct iteration scheme takes more iterations to converge.
122
NONLINEAR FINITE ELEMENT ANALYSIS
Table 4.3.3 The effect of length-to-thickness ratio on the deßections w ¯ = wmax 102 Dxx /L4 of a pinned—pinned beam under uniformly distributed load (4Q element mesh). Load q0
Length-to-thickness ratio, L/H 10 1.335 (2)∗ 2.669 (2) 4.004 (2) 5.338 (2) 6.673 (2) 8.008 (2) 9.342 (2) 10.677 (2) 12.011 (2) 13.346 (2)
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0
25
1.310 (2) 2.620 (2) 3.931 (2) 5.241 (2) 6.551 (2) 7.861 (2) 9.171 (2) 10.480 (2) 11.790 (2) 13.099 (2)
1.307 (2) 2.614 (2) 3.921 (2) 5.228 (2) 6.534 (2) 7.840 (2) 9.145 (2) 10.450 (2) 11.753 (2) 13.056 (2)
100 0.921 1.364 1.660 1.889 2.078 2.241 2.385 2.515 2.633 2.742
(5) (4) (3) (3) (3) (3) (3) (3) (3) (3)
Number of iterations taken to converge.
L = Length, H = Height of the beam
w (in.)
∗
20
L = 100 H
L = 50 H L = 10 H
q (psi.)
Figure 4.3.4 Load versus deßection curves for pinned—pinned beam.
NONLINEAR BENDING OF STRAIGHT BEAMS
123
Table 4.3.4 Finite element results for the deßections of a clamped—clamped beam under uniformly distributed load (ν = 0.25). Direct iteration Load q0 1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0
0.1019 0.1997 0.2906 0.3738 0.4493 0.5178 0.5806 0.6379 0.6908 0.7406
4Q (3)∗ (4) (4) (5) (5) (6) (7) (8) (8) (9)
8L
0.1035 0.2025 0.2943 0.3778 0.4535 0.5219 0.5846 0.6416 0.6947 0.7434
(3) (4) (4) (5) (5) (6) (7) (8) (9) (10)
4Q
0.1019 0.1997 0.2906 0.3737 0.4492 0.5179 0.5805 0.6380 0.6910 0.7403
(3) (3) (3) (3) (3) (3) (3) (3) (3) (3)
0.1035 0.2025 0.2943 0.3778 0.4534 0.5220 0.5845 0.6418 0.6946 0.7436
(3) (3) (3) (3) (3) (3) (3) (3) (3) (3)
Number of iterations taken to converge.
EBT = Euler−Bernoulli beam theory TBT = Timoshenko beam theory
0.3
TBT w = wEH3/qL4
Nondimensional deflection
∗
8L
Newton—Raphson Iteration
L/H=10 0.2
EBT
TBT L/H=100
0.1
0.0 0
2
4 6 Load, q (psi)
8
10
Figure 4.3.5 Load—deßection response predicted by the EBT and TBT for clamped—clamped, thin (L/H = 100) and thick (L/H = 10) beams. We close this chapter with a note that the geometric nonlinearity considered in the analysis of beams in this chapter is one where the strains are assumed to be small while the rotations are moderately large. In Chapter 9 on continuum formulations, we will revisit this topic in the context of plane elasticity.
124
NONLINEAR FINITE ELEMENT ANALYSIS
Problems 4.1 Consider the nonlinear differential equations
d2 dx2
µ
dNxx = f (x) dx
−
Dxx
d2 w0 dx2
¶
−
(a)
³
d dw Nxx 0 dx dx
´
= q(x)
(b)
where q(x) is the distributed transverse force (positive upward), and Nxx = Axx
∙
³ dw ´2 ¸
1 du0 + dx 2
0
(c)
dx
Rewrite the equations (by introducing the bending moment M (x) as a dependent variable) as a set of second-order equations d − dx
½
Axx
∙
1 du0 + dx 2
³ dw ´2 ¸¾ 0
dx
− f (x) = 0
(d)
d2 w0 Mxx − =0 Dxx dx2 ½ ∙ ¸¾ ³ ´ 1 dw0 2 d dw0 du0 Axx + − = q(x) dx dx dx 2 dx
(e)
−
−
d2 Mxx dx2
(f)
Develop: (a) the weak form, and (b) the Þnite element model using interpolation of the form u0 =
m X
uej ψj(1) (x), w0 =
j =1
n X
wje ψj(2) (x), Mxx =
j =1
r X
Mje ψj(3) (x)
(g)
j =1
4.2 Consider the problem of (linear) bending of beams according to the Euler—Bernoulli beam theory. The principle of minimum total potential energy states that if the beam is in equilibrium then the total potential energy associated with the equilibrium conÞguration is the minimum; that is, the equilibrium displacements are those which make the total potential energy a minimum. Thus, solving the equations governing the equilibrium of the Euler—Bernoulli beam is equivalent to minimizing the total potential energy Π(u0 , w0 ) =
Z
xb xa
−
Z
½
xb
Axx 2
∙
1 du0 + dx 2
³ dw ´2 ¸2 0
dx
(f u0 + qw0 ) dx
+
Dxx 2
µ
d2 w0 dx2
¶2 ¾
dx (a)
xa
where Axx = Ex A and Dxx = Ex Iyy are the extensional and bending stiffnesses. The necessary condition for the minimum of a functional is that its Þrst variation be zero: δΠ = 0, which yields the governing equations of equilibrium. As you know, the statement δΠ = 0 is the same as the weak forms of the governing equations of the Euler—Bernoulli beam theory. The weak form requires Hermite cubic interpolation of the transverse deßection w0 . Now suppose that we wish to relax the continuity required of the interpolation used for w0 (x) by introducing the relation dw0 = ϕ(x) dx
(b)
NONLINEAR BENDING OF STRAIGHT BEAMS
125
Then the total potential energy functional takes the form Π(u0 , w0 , ϕ) =
Z
½
xb
xa
−
Z
Axx 2
∙
1 du0 + dx 2
xb xa
³ dw ´2 ¸2 0
dx
(f u0 + qw0 ) dx −
6 X
Dxx + 2
³ dϕ ´2 ¾ dx
dx
∆ei Qei
(c)
i=1
Since the functional now contains only the Þrst derivative of u0 and ϕ, linear Lagrange (minimum) interpolation can be used. Thus the original problem is replaced with the following equivalent problem: Minimize Π(u0 , w0 , ϕ) in Eq. (c) subjected to the constraint dw0 − ϕ(x) = 0 dx
(d)
Develop the penalty function formulation of the constrained problem by deriving (a) the weak form, and (b) the Þnite element model. 4.3 Develop the weak forms of the governing equations (4.3.8)—(4.3.10); make use of the deÞnitions in Eq. (4.3.20). 4.4 Analyze a clamped (at both ends) beam under uniformly distributed load (of intensity, q0 ) using the Newton—Raphson iteration method and (a) the Euler—Bernoulli beam element, and (b) the Timoshenko beam element. Plot the non-dimensional maximum deßection, w ¯ = wmax /L versus the load parameter, P¯ = q0 L3 /EI, with at least twelve points on the graph. Use 8 elements in the beam, with
h
x , L
D11
dφ φ + D12 dr r
EA = 30 × 106 1 + 0.5
i
EI =
h
30 × 106 x 1 + 0.5 12 L
i3
(a)
and L = 100. Investigate the effect of numerical integration rule on the accuracy of the results. 4.5 The principle of minimum total potential energy for axisymmetric bending of polar orthotropic plates according to the Þrst-order shear deformation theory requires δΠ(w0 , φ) = 0, where δΠm = 2
Z a "³ b
+ A55
³
dw0 φ+ dr
´³
´
³
´
dδφ 1 dφ φ D12 δφ + + D22 dr r dr r
dδw0 δφ + dr
´
#
− 2qδw0 rdr
(a)
where b is the inner radius and a the outer radius. Derive the displacement Þnite element model of the equations. In particular, show that the Þnite element model is of the form (i.e. deÞne the matrix coefficients of the following equation)
∙
[K 11 ] [K 12 ]T
[K 12 ] [K 22 ]
¸½
{w} {φ}
¾
=
½
{F } {0}
¾
(b)
4.6 Implement the displacement Þnite element model into a computer program and verify with analytical solutions of simply supported and clamped circular plates (see Reddy [3]).
126
NONLINEAR FINITE ELEMENT ANALYSIS
4.7 Include the geometric nonlinearity (by accounting for the von K´ arm´ an nonlinear strains) in the total potential energy functional of Problem 4.5, and develop the Þnite element model. 4.8 Implement the nonlinear Þnite element model of Problem 4.7 into a computer program and validate it with other published results (see Chapter 6).
References 1. Reddy, J. N., An Introduction to the Finite Element Method, 2nd edn, McGraw—Hill, New York (1993). 2. Reddy, J. N., Energy Principles and Variational Methods in Applied Mechanics, 2nd edn, John Wiley, New York (2002). 3. Reddy, J. N., Theory and Analysis of Elastic Plates, Taylor and Francis, Philadelphia, PA (1999).
5 Heat Transfer and Other Field Problems in Two Dimensions
5.1 Model Equation The Þnite element analysis of nonlinear two-dimensional problems involves the same basic steps as those described for one-dimensional problems in Chapter 3. Finite element formulation of a model second-order equation was presented in Section 2.3. Here, we extend that development to problems in which the coefficients of the differential equation are possibly functions of the dependent variable and its derivatives. Consider the problem of Þnding the solution u of the following secondorder partial differential equation (a slightly more general equation than the one considered in Section 2.3) µ
¶
µ
¶
∂ ∂u ∂u ∂ − axx − ayy + a00 u = f (x, y) in Ω ∂x ∂x ∂y ∂y
(5.1.1)
where axx , ayy , and a00 are known functions of position (x, y) and the dependent unknown u and its derivatives, and f is a known function of position in a two-dimensional domain Ω with boundary Γ [see Figure 5.1.1(a)]. For example, axx may be assumed to be of the form axx = axx (x, y, u,
∂u ∂u , ) ∂x ∂y
(5.1.2)
The equation is subject to certain boundary conditions, whose form will be apparent from the weak formulation. ¯ is discretized into a collection In the Þnite element method, the domain Ω e of elements Ω [see Figure 5.1.1(b)] ¯ ≈ Ωh = Ω
N [
e=1
¯ = Ω ∪ Γ, Ω ¯ e = Ωe ∪ Γe ¯ e, Ω Ω
(5.1.3)
128
NONLINEAR FINITE ELEMENT ANALYSIS
Domain Ω
Boundary Γ
Triangular element
(a)
Quadrilateral element (b)
Figure 5.1.1 Finite element discretization of a two-dimensional domain Ω and a typical Þnite element Ωe .
5.2 Weak Form We use a representative element domain Ωe to derive the weak form of the model equation, with the assumption that each element has a unique geometric shape and associated interpolation functions. Following the steps of Section 2.3, the weak form of Eq. (5.2.1) over a typical Þnite element Ωe , whether triangular or quadrilateral shape, can be developed. The Þrst step is to multiply Eq. (5.2.1) with a weight function w, which is assumed to be differentiable once with respect to x and y, and then integrate the equation over the element domain Ωe : ∙
Z
µ
¶
µ
¶
¸
∂ ∂ ∂u ∂u 0= w − axx − ayy + a00 u − f dx dy e ∂x ∂x ∂y ∂y Ω
(5.2.1)
In the second step we distribute the differentiation among u and w equally. To achieve this, we integrate the Þrst two terms in Eq. (5.2.1) by parts using the component forms of the Green—Gauss theorem (gradient or divergence theorem). 0=
Z
µ
¶
∂w ∂u ∂w ∂u + ayy + a00 wu − wf dx dy e ∂x ∂x ∂y ∂y Ω µ ¶ I ∂u ∂u w axx nx + ayy ny ds − ∂x ∂y Γe axx
(5.2.2)
where nx and ny are the components (i.e. the direction cosines) of the unit normal vector ˆ = nx ˆi + ny ˆj = cos α ˆi + sin α ˆj n (5.2.3)
TWO-DIMENSIONAL PROBLEMS IN SINGLE VARIABLE
129
on the boundary Γe , and ds is the arc length of an inÞnitesimal line element along the boundary (see Figure 5.2.1). The circle on the boundary integral denotes integration over the closed boundary Γe . From an inspection of the boundary term in Eq. (5.2.2), we note that u is the primary variable. The coefficient of the weight function w in the boundary expression is axx
∂u ∂u nx + ayy ny ≡ qn ∂x ∂y
(5.2.4)
and it constitutes the secondary variable. Thus, the weak form of Eq. (5.2.1) is 0=
Z
Ωe
µ
¶
∂w ∂u ∂w ∂u axx + ayy + a00 wu − w f dx dy − ∂x ∂x ∂y ∂y
I
Γe
w qn ds (5.2.5)
The function qn = qn (s) denotes the outward ßux from the boundary as we move counter-clockwise along the boundary Γe . The secondary variable qn is of physical interest in most problems. For example, in the case of the heat transfer through an anisotropic medium, aij denotes the conductivities of the medium, and qn denotes the heat ßux normal to the boundary of the element. The weak form (or weighted-integral statement) in (5.2.5) forms the basis of the Þnite element model of Eq. (5.2.1).
5.3 Finite Element Model The weak form in Eq. (5.2.5) requires that the approximation chosen for u should be at least linear in both x and y so that every term in Eq. (5.2.5) has a non-zero contribution to the integral. Since the primary variable is just u, which must be made continuous between elements, the Lagrange family of interpolation functions is admissible. Hence, u is approximated over a typical
y
^ n
ny
nx
dy dx
ds
Dom ain , Ω Bou n da r y, Γ x
Figure 5.2.1 A typical two-dimensional domain with a curved boundary.
130
NONLINEAR FINITE ELEMENT ANALYSIS
Þnite element Ωe by the expression u(x, y) ≈
ueh (x, y)
=
n X
uej ψje (x, y)
(5.3.1)
j=1
where uej is the value of ueh at the jth node of the element, and ψje are the Lagrange interpolation functions, which have the property ψie (xj , yj ) = δij
(5.3.2)
where (xj , yj ) are the global coordinates of the jth node of the element Ωe . Substituting the Þnite element approximation (5.3.1) for u into the weak form (5.2.5), we obtain
0=
Z
Ωe
"
⎛
⎞
#
− wf dx dy − =
n X
j=1
⎛
⎞
n n n X X X ∂ψje ∂ψje ∂w ⎝ ∂w ⎝ ⎠+ ⎠ + a00 w axx uj ayy uj uj ψje ∂x ∂x ∂y ∂y j=1 j=1 j=1
I
Γe
w qn ds
e e Kij uj − fie − Qei
(5.3.3)
where e Kij
=
fie = Qe =
Z
Ωe
Z
Ωe
I
Γe
Ã
!
∂ψ e ∂ψje ∂ψ e ∂ψje axx i + ayy i + a00 ψie ψje dx dy ∂x ∂x ∂y ∂y
ψie f dx dy
(5.3.4)
ψie qn ds
e = K e (i.e. [K] is symmetric), even though it may be a function Note that Kij ji of the unknown nodal values uej . The set of n nonlinear algebraic equations can be written in matrix form as
[K e ]{ue } = {f e } + {Qe }
(5.3.5)
Equation (5.3.5) represents the Þnite element model of Eq. (5.1.1). This completes the Þnite element model development. The usual tasks of assembly of element equations, imposition of boundary conditions, and solution of linear algebraic equations (after an iterative method is applied) are standard and therefore not discussed here (see Reddy [1]).
TWO-DIMENSIONAL PROBLEMS IN SINGLE VARIABLE
131
5.4 Solution Procedures 5.4.1 Direct Iteration The assembled form of the nonlinear equation (5.3.5) is [K({U })]{U } = {F }
(5.4.1)
where [K] is the assembled coefficient matrix, {U } the vector of global nodal values, and {F } the assembled source vector. In the direct iteration procedure, the solution at the rth iteration is determined from the equation [K({U}(r−1) )]{U }(r) = {F }
(5.4.2)
where the direct matrix [K] is evaluated using the solution (known) at the (r−1)st iteration. The direct iteration procedure can be applied to the element equation (5.3.5), as was done in Chapters 3 and 4. We obtain [K e ({ue }(r−1) )]{ue }(r) = {F e }
(5.4.3)
5.4.2 Newton—Raphson Iteration In the Newton—Raphson procedure, we solve the equation [T ({U }(r−1) )]{δU } = −{R({U }(r−1) )}
(5.4.4)
where {R} is the residual vector −{R({U }(r−1) )} = {F } − [K({U }(r−1) )]{U }(r−1)
(5.4.5)
and [T ] is the tangent matrix (r−1)
[T ({U }
)] ≡
µ
∂{R} ∂{U }
¶(r−1)
(5.4.6)
The solution at the end of the rth iteration is then given by {U }r = {U }(r−1) + {δU }
(5.4.7)
At the element level, Eq. (5.4.4) takes the form [T e ({ue }(r−1) )]{δue } = {F e ({ue }(r−1) )} − [K e ({ue }(r−1) ]{ue }(r−1)
(5.4.8)
The coefficients of the tangent matrix can be computed using the deÞnition Tije ≡
n e X ∂Kim ∂Rie e = uem + Kij ∂uej ∂u j m=1
(5.4.9)
132
NONLINEAR FINITE ELEMENT ANALYSIS
Example 5.4.1 Suppose that aexx and aeyy have the form ∂u ∂u + aexuy · ∂x ∂y ∂u ∂u e e e e + ayuy · = ay0 (x, y) + ayu · u + ayux · ∂x ∂y
aexx = aex0 (x, y) + aexu · u + aexux · aeyy
(5.4.10)
where ax0 , axu , and so on are functions of only x and y. In addition, we assume that a00 is only a function of x and y. Then we have e + Tije = Kij
n X e ∂Kim
m=1
∂uj
uem
(5.4.11)
where n X e ∂Kim
m=1
∂uj
uem
=
n ∙Z X
m=1 n
=
X ½Z
m=1
+ =
Ωe
Z
Ωe
µ
µ
e e ∂ae ∂aeyy ∂ψie ∂ψm ∂aexx ∂ψie ∂ψm e + + 00 ψie ψm ∂uj ∂x ∂x ∂uj ∂y ∂y ∂uj
∙µ
aexu ψje
Ωe
+
aexux
∂ψje ∂ψje + aexuy ∂x ∂y
∂ψje ∂ψje + aeyuy aeyu ψje + aeyux ∂x ∂y
∙
∂u ∂ψie ∂x ∂x
∂u ∂ψie + ∂y ∂y
µ
µ
aexu ψje + aexux
aeyu ψje
+
aeyux
¶
¶
¶
¸
dx dy uem
e ∂ψie ∂ψm ∂x ∂x
#
)
e ∂ψie ∂ψm dx dy uem ∂y ∂y
∂ψje ∂ψje + aexuy ∂x ∂y
∂ψje ∂ψe + aeyuy j ∂x ∂y
¶
¶#
dx dy
(5.4.12)
Note that, although [K e ] is symmetric, the symmetry of [T e ] depends on the nature of the nonlinearity.
5.5 Computer Implementation 5.5.1 Introduction An accurate representation of non-rectangular domains and domains with curved boundaries can be accomplished by the use of reÞned meshes and/or irregularly shaped elements. For example, a non-rectangular region can be represented more accurately by triangular and quadrilateral elements than rectangular elements. However, it is easy to derive interpolation functions for a rectangular element, and it is easier to evaluate integrals over rectangular geometries than over irregular geometries. Therefore, it is practical to use quadrilateral elements with straight or curved sides but have a means to evaluate the integrals involved in the deÞnitions of the coefficient matrices e and T e over the quadrilateral elements. A coordinate transformation Kij ij
TWO-DIMENSIONAL PROBLEMS IN SINGLE VARIABLE
133
between the coordinates (x, y) used in the formulation of the problem, called global coordinates, and another coordinate system (ξ, η), called local coordinate system, that is convenient in deriving the interpolation functions and evaluating the integrals is needed. The choice of the local coordinate system is dictated by the choice of numerical integration method. Here we shall use, as was done in one-dimensional problems, the Gauss quadrature method to evaluate integrals deÞned over two-dimensional elements. The main steps in the numerical evaluation of Þnite element matrices are reviewed here (see Section 2.5 for more details).
5.5.2 Numerical Integration ˆ is accomplished by a coordinate The transformation between Ωe and Ω transformation of the form [cf. Eqs. (2.5.1) and (2.5.2)] x=
m X
xej ψˆje (ξ, η) ,
y=
j=1
m X
yje ψˆje (ξ, η)
(5.5.1)
j=1
while a typical dependent variable u(x, y) is approximated by u(x, y) =
n X
j=1
uej ψje (x, y) =
n X
uej ψje (x(ξ, η), y(ξ, η))
(5.5.2)
j=1
ˆ and where ψˆje denotes the interpolation functions of the master element Ω e e ψj are interpolation functions of a typical element Ω over which u is approximated. The transformation (5.5.1) maps a point (x, y) in a typical ˆ and vice element Ωe of the mesh to a point (ξ, η) in the master element Ω versa, if the Jacobian of the transformation is positive-deÞnite. The positivedeÞnite requirement of the Jacobian dictates admissible geometries of elements in a mesh. Recall that a Þnite element model is nothing but a system of algebraic equations among the nodal values of the primary variables and secondary variables. The coefficients of these algebraic equations contain integrals of the physical parameters (e.g. material properties) and approximation functions. The integral expressions are, in general, complicated algebraically due to the spatial variation of the parameters and their dependence on the solution and possibly its derivatives as well as due to the coordinate transformations. Therefore, the integrals are evaluated numerically, which requires evaluation of the integrand at a selective number of points in the domain, multiply their values with suitable weights and summing. Here we discuss the Gauss quadrature to evaluate integrals over quadrilateral elements.
134
NONLINEAR FINITE ELEMENT ANALYSIS
We illustrate the essential elements of the Gauss quadrature by considering the integral expression [see Eq. (5.3.4)] Z
∙
¸
∂ψ e ∂ψje ∂ψ e ∂ψje + ayy (x, y) i + a00 (x, y)ψie ψje dx dy = axx (x, y) i ∂x ∂x ∂y ∂y Ωe (5.5.3) e ˆ We wish to transform the integral from Ω to the master element Ω = {(ξ, η) : −1 ≤ ξ ≤ 1, −1 ≤ η ≤ 1} so that the Gauss quadrature can be used. From Eq. (2.5.6), we have e e Kij
( ∂ψe )
( ∂ψ ) i
i
∂x ∂ψie ∂y
−1
= [J]
∂ξ ∂ψie ∂η
(5.5.4)
which gives the derivatives of ψie with respect to the global coordinates (x, y) in terms of the derivatives of ψie with respect to the local coordinates (ξ, η). The matrix [J e ] is the Jacobian matrix of the transformation (5.5.1) e
[J] =
" ∂x ∂ξ ∂x ∂η
∂y ∂ξ ∂y ∂η
#e
(5.5.5)
and its determinant |J| is the Jacobian, which must be greater than zero in order to invert Eq. (5.5.4). Negative non-zero values of |J| imply that a right-hand coordinate system is transformed to a left-hand coordinate system, which should be avoided. The Jacobian matrix can be computed using the transformation (5.5.1) in Eq. (5.5.5). We have [J]e =
" ∂x
∂ξ ∂x ∂η
⎡ ˆ ∂ ψ1 = ⎣ ∂ξ ∂ ψˆ1 ∂η
∂y ∂ξ ∂y ∂η
#e
∂ ψˆ2 ∂ξ ∂ ψˆ2 ∂η
=
⎡P
ˆ m x ∂ ψi ⎣ Pi=1 i ∂ξ ∂ ψˆi m i=1 xi ∂η
··· ···
∂ ψˆm ∂ξ ∂ ψˆm ∂η
⎤e
⎡
⎢ ⎦ ⎢ ⎢ ⎣
Pm
ˆ
∂ ψi i=1 yi ∂ξ
Pm
ˆ
∂ ψi i=1 yi ∂η
x1 x2 .. .
y1 y2 .. .
xm
ym
⎤e ⎥ ⎥ ⎥ ⎦
⎤e ⎦
(5.5.6)
Thus, given the global coordinates (xj , yj ) of element nodes and the interpolation functions ψˆje used for geometry, the Jacobian matrix can be evaluated using Eq. (5.5.6). Note that ψˆje are different, in general, from ψje used in the approximation of the dependent variables. The Jacobian is given by |J| = J11 J22 − J12 J21 (5.5.7) We have from Eq. (5.5.4) ⎧ e⎫ ∂ψ ⎪ ⎨ ∂xi ⎪ ⎬ ⎪ ⎩ ∂ψie ⎪ ⎭ ∂y
= [J]−1
⎧ e⎫ ∂ψ ⎪ ⎨ ∂ξi ⎪ ⎬ ⎪ ⎩ ∂ψie ⎪ ⎭ ∂η
≡ [J ∗ ]
⎧ e⎫ ∂ψ ⎪ ⎨ ∂ξi ⎪ ⎬ ⎪ ⎩ ∂ψie ⎪ ⎭ ∂η
(5.5.8)
TWO-DIMENSIONAL PROBLEMS IN SINGLE VARIABLE
135
where ∗ = J11
J22 J12 J11 J21 ∗ ∗ ∗ =− = =− , J12 , J22 , J21 |J| |J| |J| |J|
(5.5.9)
e in Eq. (5.5.3), we can write it now in Returning to the coefficients Kij terms of the natural coordinates (ξ, η) as
e Kij =
Z ( ˆ Ω
Ã
e e ∗ ∂ψi ∗ ∂ψi axx (ξ, η) J11 + J12 ∂ξ ∂η
Ã
+ ayy (ξ, η)
≡
Z
e ∗ ∂ψj J21
∂ξ
)
e ∗ ∂ψj + J22
∂η
!Ã
!Ã
∂ψje ∂ψje ∗ ∗ J11 + J12 ∂ξ ∂η
e ∗ ∂ψj J21
∂ξ
e ∗ ∂ψj + J22
∂η
!
!
+ a00 (ξ, η)ψie ψje |J| dξ dη ˆ Ω
Fij (ξ, η) dξ dη
(5.5.10)
where the element area dA = dxdy in element Ωe is transformed to |J| dξ dη ˆ in the master element Ω. Using the Gauss quadrature formulas for integrals deÞned over a ˆ which are the same as those for the onerectangular master element Ω, dimensional quadrature, we obtain Z
ˆ Ω
Fij (ξ, η) dξ dη = ≈
Z 1 "Z 1 −1
−1
N M X X
#
Fij (ξ, η) dη dξ ≈
Fij (ξI , ηJ ) WI WJ
Z 1 "X N
−1 J=1
#
Fij (ξ, ηJ ) WJ dξ (5.5.11)
I=1 J=1
where M and N denote the number of Gauss quadrature points in the ξ and η directions, (ξI , ηJ ) denote the Gauss points, and WI and WJ denote the corresponding Gauss weights (see Table 2.5.1). As already discussed, the number of Gauss points required to evaluate an integral accurately is based on the following rule: if the integrand is a polynomial of degree p, it is integrated exactly by employing N GP ≡ N = int[ 12 (p + 1)]; that is, the smallest integer greater than 12 (p + 1). In most cases, the interpolation functions are of the same degree in both ξ and η, and we take N GP = M GP ≡ M .
5.5.3 Element Calculations Calculation of element coefficients require evaluation of interpolation functions and their derivatives. The Fortran statements for the calculation of the
136
NONLINEAR FINITE ELEMENT ANALYSIS
Jacobian matrix and determinant are given in the subroutine SHPRCT (see Appendix 2 of Reddy [1]). The notation used is as follows: ∂ψie ∂ψie , DSF (2, i) = ∂ξ ∂η [ELXY ] = array of the global coordinates of element nodes ELXY (i, 1) = xi , ELXY (i, 2) = yi [GJ] = the Jacobian matrix, [J]; [GJ] = [DSF ][ELXY ] [GJIN V ] = inverse of the Jacobian matrix, [GJ]−1 DET = the determinant of the Jacobian matrix, |J| ∂ψie ∂ψie , GDSF (2, i) = GDSF (1, i) = ∂x ∂y [GDSF ] = [GJIN V ][DSF ] SF (i) = ψie ,
DSF (1, i) =
The above calculations are carried out in the subroutine SHPRECT. The subroutine ELECOFNT that calculates [K e ], [T e ], and {f e } for the direct iteration and Newton—Raphson iteration is listed in Box 5.5.1. The following notation is used (n = N P E): ELF (i) = fie ,
e ELK(i, j) = Kij ,
T AN G(i, j) =
n e X ∂Kim ue
m=1
∂uj
m
GAU SP T (I, J) = Ith Gauss point in the Jth Gauss-point rule (I ≤ J) GAU SW T (I, J) = Ith Gauss weight in the Jth Gauss-point rule (I ≤ J) ELU (I) = uei from the previous iteration Other variables have the same meaning as indicated earlier. It is assumed that the coefficients ax0 and ay0 are linear functions of x and y ax0 = ax00 + ax0x x + ax0y y,
ay0 = ay00 + ay0x x + ay0y y
(5.5.12)
Of course, other variations of the coefficients may be assumed and implemented without difficulty. Example 5.5.1 Consider heat transfer in an isotropic medium [axx = ayy in Eq. (5.2.1)] of rectangular shape a × b = 0.18 × 0.1 m. The conductivity axx = ayy = k is assumed to vary according to the relation (a00 = 0) (5.5.13) k = k0 (1 + βT ) where k0 is the constant thermal conductivity, β the temperature coefficient of thermal conductivity, and T the temperature. Suppose that there is no internal heat generation (i.e. f = 0) and the boundary conditions are T (0, y) = 500◦ K, T (a, y) = 300◦ K ∂T = 0 at y = 0, b for any x ∂y
(5.5.14a) (5.5.14b)
TWO-DIMENSIONAL PROBLEMS IN SINGLE VARIABLE
137
Box 5.5.1 Subroutine (in Fortran) ELECOFNT for the calculation of element matrices [K e ], [T e ], and {f e } of the model problem in Eq. (5.2.1). C C C C C C C C C C C C C
SUBROUTINE ELECOEF(NPE,NGP,ITYPE,NONLN) ________________________________________________________________ Element calculations based on linear and quadratic rectangular elements and isoparametric formulation are carried out for the model equation in (4.2.1). − Nodes per element (4: linear; 8: serendipity quadratic, 9: complete quadratic) NGP − Number of Gauss points. ITYPE − Type of iterative method used: ITYPE=1, Direct iteration, ITYPE>1, Newton−Raphson iteration ________________________________________________________________ NPE
IMPLICIT REAL*8(A-H,O-Z) COMMON/STF/ELF(7),ELK(9,9),ELXY(9,2),ELU(9) COMMON/PST/A10,A1X,A1Y,A20,A2X,A2Y,A00,F0,FX,FY, * A1U,A1UX,A1UY,A2U,A2UX,A2UY COMMON/SHP/SF(9),GDSF(2,9) DIMENSION GAUSPT(5,5),GAUSWT(5,5),TANG(9,9) C DATA GAUSPT/5*0.0D0, -0.57735027D0, 0.57735027D0, 3*0.0D0, 2 -0.77459667D0, 0.0D0, 0.77459667D0, 2*0.0D0, -0.86113631D0, 3 -0.33998104D0, 0.33998104D0, 0.86113631D0, 0.0D0, -0.90617984D0, 4 -0.53846931D0,0.0D0,0.53846931D0,0.90617984D0/ C 2 3 4 C C C
DATA GAUSWT/2.0D0, 4*0.0D0, 2*1.0D0, 3*0.0D0, 0.55555555D0, 0.88888888D0, 0.55555555D0, 2*0.0D0, 0.34785485D0, 2*0.65214515D0, 0.34785485D0, 0.0D0, 0.23692688D0, 0.47862867D0, 0.56888888D0, 0.47862867D0, 0.23692688D0/ Initialize the arrays
DO 100 I = 1,NPE ELF(I) = 0.0 DO 100 J = 1,NPE IF(ITYPE.GT.1)THEN TANG(I,J)=0.0 ENDIF 100 ELK(I,J)= 0.0 C C Do-loops on numerical (Gauss) integration begin here. Subroutine C SHPRCT (SHaPe functions for ReCTangular elements) is called here C DO 200 NI = 1,NGP DO 200 NJ = 1,NGP XI = GAUSPT(NI,NGP) ETA = GAUSPT(NJ,NGP) CALL SHPRCT (NPE,XI,ETA,DET,ELXY) CNST = DET*GAUSWT(NI,NGP)*GAUSWT(NJ,NGP) X=0.0 Y=0.0 U = 0.0 UX= 0.0 UY= 0.0
138
NONLINEAR FINITE ELEMENT ANALYSIS
Box 5.5.1 (continued) DO 140 I=1,NPE U=U+ELU(I)*SF(I) UX=UX+ELU(I)*GDSF(1,I) UY=UY+ELU(I)*GDSF(2,I) X=X+ELXY(I,1)*SF(I) 140 Y=Y+ELXY(I,2)*SF(I) C C Define the coefficients of the differential equation C FXY=F0+FX*X+FY*Y AXX=AX0+AXX*X+AXY*Y AYY=AY0+AYX*X+AYY*Y IF(NONLN.GT.0)THEN AXX=AXX+AXU*U+AXUX*UX+AXUY*UY AYY=AYY+AYU*U+AYUX*UX+AYUY*UY ENDIF C C Define the element source vector and coefficient matrix C DO 180 I=1,NPE ELF(I)=ELF(I)+FXY*SF(I)*CNST DO 160 J=1,NPE S00=SF(I)*SF(J)*CNST S11=GDSF(1,I)*GDSF(1,J)*CNST S22=GDSF(2,I)*GDSF(2,J)*CNST ELK(I,J)=ELK(I,J)+A11*S11+A22*S22+A00*S00 C C Define the part needed to add to [K] to define [T] C IF(ITYPE.GT.1)THEN S10=GDSF(1,I)*SF(J)*CNST S20=GDSF(2,I)*SF(J)*CNST S12=GDSF(1,I)*GDSF(2,J)*CNST S21=GDSF(2,I)*GDSF(1,J)*CNST TANG(I,J)=TANG(I,J) * +UX*(A1U*S10+AXUX*SXX+AXUY*S12) * +UY*(A2U*S20+AYUX*SYX+AYUY*S22) ENDIF 160 CONTINUE 180 CONTINUE 200 CONTINUE C C Compute the residual vector and tangent matrix C IF(ITYPE.GT.1)THEN DO 220 I=1,NPE DO 220 J=1,NPE 220 ELF(I)=ELF(I)-ELK(I,J)*ELU(J) DO 240 I=1,NPE DO 240 J=1,NPE 240 ELK(I,J)=ELK(I,J)+TANG(I,J) ENDIF RETURN END
This is essentially a one-dimensional problem (in the x coordinate), and can be solved as such (see Table 3.5.1). Table 5.5.1 shows the linear and nonlinear solutions T (x, y0 ) for any y0 . Direct iteration is used to solve the problem. It took two iterations to converge (² = 0.01). Also, the solution is independent of the mesh in the y-direction. The present results were found to be identical to those obtained with the one-dimensional model (for the same tolerance of ² = 0.01).
TWO-DIMENSIONAL PROBLEMS IN SINGLE VARIABLE
139
Table 5.5.1 Finite element solutions of a nonlinear heat conduction equation [k0 = 0.2 W/(m ◦ K) and β = 2 × 10−3 (◦ K−1 )]. x
Linear
4 × 4L*
2 × 2Q9
8 × 8L4
4 × 4Q9
0.0000 0.0225 0.0450 0.0675 0.0900 0.1125 0.1350 0.1575 0.1800
500.00 475.00 450.00 425.00 400.00 375.00 350.00 325.00 300.00
500.00
500.00
500.00 477.31 454.03 430.12 405.57 380.32 354.34 327.58 300.00
500.00 477.31 454.03 430.12 405.57 380.32 354.34 327.58 300.00
−
−
454.02
454.03
−
−
405.56
405.57
−
−
354.33
354.34
−
−
300.00
300.00
* m × nL4, for example, denotes a mesh of the four-node linear (L) elements.
Problems 5.1 Consider the nonlinear problem of Example 5.5.1 (heat transfer in two dimensions). Use the uniform 4 × 4 nine-node quadratic element mesh to analyze the problem using the following data and boundary conditions: a = 0.18 m, b = 0.1 m, f0 = 0 W/m3
(a)
k = k0 (1 + βT ) , k0 = 25 W/(m ◦ C)
(b)
◦
◦
T (0, y) = 100 C , T (a, y) = 50 C k
∂T + hc (T − T∞ ) = 0 at y = 0, b ∂n
(c)
Use β = 0.2, T∞ = 10◦ C, and hc = 50 W/(m2 ◦ C). 5.2 The energy equation for simultaneous conduction and radiation in a participating medium can be expressed by −∇ · [ke (T )∇T ] = g where ke (T ) = k +
16σn2 T 3 3β
Here T is the temperature, g is the internal heat generation, n denotes the refractive index of the medium, σ is the Stefan—Boltzman constant, and β is the Roseland mean ¨ extinction coefficient (see Ozisik [4]). Develop the Þnite element model of the equation and determine the tangent coefficient matrix for a planar (two-dimensional) domain. 5.3 Repeat Problem 5.2 for a radially axisymmetric domain. 5.4 Suppose that the boundary of a typical Þnite element is subject to both convective and enclosed radiation heat transfer [cf. Eq. (2.3.36)]: (axx
∂u ∂u nx + ayy ny ) + hc (u − uc ) + σ²(u4 − u4c ) = qn ∂x ∂y
where σ is the Stefan—Boltzman constant and ² is the emissivity of the surface. Reformulate the Þnite element equations in (2.3.39) to account for the radiation term. Hint: σ²(u4 − u4c ) = σ²(u2 + u2c )(u + uc )(u − uc ) ≡ hr (u)(u − uc ).
140
NONLINEAR FINITE ELEMENT ANALYSIS
5.5 Compute the tangent coefficient matrix associated with the nonlinear radiation boundary condition of Problem 5.4.
References 1. Reddy, J. N., An Introduction to the Finite Element Method, 2nd edn, McGraw—Hill, New York (1993). 2. Reddy, J. N. and Gartling, D. K., The Finite Element Method in Heat Transfer and Fluid Dynamics, 2nd edn, CRC Press, Boca Raton, FL (2001). 3. Reddy, J. N., Energy Principles and Variational Methods in Applied Mechanics, 2nd edn, John Wiley, New York (2002). ¨ 4. Ozisik, M. N., Finite Difference Methods in Heat Transfer, CRC Press, Boca Raton, FL (1994). 5. Holman, J. P., Heat Transfer, 7th edn, McGraw—Hill, New York (1990).
6 Nonlinear Bending of Elastic Plates and Shells 6.1 Introduction A plate is a ßat structural element with planform dimensions that are large compared to its thickness and is subjected to loads that cause bending deformation in addition to stretching. In most cases, the thickness is no greater than one-tenth of the smallest in-plane dimension. A shell is much like a plate except that it is not ßat but curved. Because of the smallness of thickness dimension, it is often not necessary to model them using threedimensional elasticity equations. Simple two-dimensional plate and shell theories can be developed to study the deformation and stresses in plate structures undergoing small strains, small to moderate rotations, and large displacements (i.e. w0 /h ≥ 1). Here we derive governing equations of the classical and Þrst-order theories of plates and shells with the von K´arm´an strains, and develop their displacement Þnite element models. The principle of virtual displacements is used to derive the weak forms, and the displacement Þnite element models are developed using the weak forms.
6.2 Classical Plate Theory 6.2.1 Assumptions of the Kinematics The classical plate theory (CPT) is one in which the displacement Þeld is selected so as to satisfy the Kirchhoff hypothesis. The Kirchhoff hypothesis has the following three assumptions (see Figure 6.2.1): (1) Straight lines perpendicular to the mid-surface (i.e. transverse normals) before deformation, remain straight after deformation. (2) The transverse normals do not experience elongation (i.e. they are inextensible). (3) The transverse normals rotate such that they remain perpendicular to the mid-surface after deformation.
142
NONLINEAR FINITE ELEMENT ANALYSIS
x y z u0
−
x w0
∂w 0 ∂x
−
∂w 0 ∂x
z
Figure 6.2.1 Undeformed and deformed geometries of an edge of a plate under the Kirchhoff assumptions.
6.2.2 Displacement Field and Strains Let us denote the undeformed mid-plane of the plate with the symbol Ω0 . The total domain of the plate is the tensor product Ω0 ×(−h/2, h/2). The boundary of the total domain consists of surfaces St (z = h/2) and Sb (z = −h/2), and ¯ ≡ Γ × (−h/2, h/2). In general, Γ is a curved surface, with outward the edge Γ ˆ = nx e ˆx + ny e ˆy , where nx and ny are the direction cosines of the unit normal n normal. The Kirchhoff hypothesis implies the following form of the displacement Þeld (see Reddy [1—3] and Figure 6.2.1) ∂w0 ∂x ∂w0 v(x, y, z) = v0 (x, y) − z ∂y w(x, y, z) = w0 (x, y) u(x, y, z) = u0 (x, y) − z
(6.2.1)
where (u0 , v0 , w0 ) denote the displacements of a material point at (x, y, 0) in (x, y, z) coordinate directions. The nonlinear strains are given by
NONLINEAR BENDING OF ELASTIC PLATES AND SHELLS
E11 = E12 = E13 = E22 = E23 = E33 =
"µ
¶
µ
¶
µ
143
¶ #
∂u 2 ∂v 2 ∂w 2 ∂u 1 + + + ∂x 2 ∂x ∂x ∂x µ ¶ 1 ∂u ∂v ∂u ∂u ∂v ∂v ∂w ∂w + + + + 2 ∂y ∂x ∂x ∂y ∂x ∂y ∂x ∂y µ ¶ 1 ∂u ∂w ∂u ∂u ∂v ∂v ∂w ∂w + + + + 2 ∂z ∂x ∂x ∂z ∂x ∂z ∂x ∂z "µ ¶ µ ¶2 µ ¶2 # 2 ∂u ∂v ∂w ∂v 1 + + + ∂y 2 ∂y ∂y ∂y µ ¶ 1 ∂v ∂w ∂u ∂u ∂v ∂v ∂w ∂w + + + + 2 ∂z ∂y ∂y ∂z ∂y ∂z ∂y ∂z "µ ¶ µ ¶2 µ ¶ # 2 ∂u ∂v ∂w 2 ∂w 1 + + + ∂z 2 ∂z ∂z ∂z
(6.2.2)
If the components of the displacement gradients are of the order ², i.e. ∂u ∂u ∂v ∂v ∂w , , , , = O(²) ∂x ∂y ∂x ∂y ∂z
(6.2.3)
then the small strain assumption implies that terms of the order ²2 are omitted in the strains. If the rotations of transverse normals are moderate (say 10◦ − 15◦ ), then the following terms are small but not negligible compared to ² µ ¶ µ ¶ ∂w 2 ∂w 2 ∂w ∂w , , (6.2.4) ∂x ∂y ∂x ∂y Thus for small strains and moderate rotations, the strain—displacement relations (6.2.2) take the form
εxz εyz
µ
¶
µ
∂u 1 ∂w 2 1 ∂u ∂v ∂w ∂w + + + , εxy = ∂x 2 ∂x 2 ∂y ∂x ∂x ∂y µ ¶ µ ¶2 1 ∂u ∂w ∂v 1 ∂w = , εyy = + + 2 ∂z ∂x ∂y 2 ∂y µ ¶ 1 ∂v ∂w ∂w = , εzz = + 2 ∂z ∂y ∂z
εxx =
¶
(6.2.5)
where, for this special case of geometric nonlinearity (i.e. small strains but moderate rotations), the notation εij is used in place of Eij . The corresponding Second—Piola Kirchhoff stresses will be denoted σij . For the displacement Þeld in Eq. (6.2.1), ∂w/∂z = 0. In view of the assumptions in Eqs. (6.2.3) and (6.2.4), the strains (6.2.5) for the displacement
144
NONLINEAR FINITE ELEMENT ANALYSIS
Þeld (6.2.1) reduce to µ
¶
∂u0 1 ∂w0 2 ∂ 2 w0 −z + ∂x 2 ∂x ∂x2 Ã ! 1 ∂u0 ∂v0 ∂w0 ∂w0 ∂ 2 w0 = + + − 2z 2 ∂y ∂x ∂x ∂y ∂x∂y
εxx = εxy
εyy =
∂v0 1 + ∂y 2 µ
µ
∂w0 ∂y
¶2
−z
∂ 2 w0 ∂y 2
¶
1 ∂w0 ∂w0 − =0 + 2 ∂x ∂x µ ¶ 1 ∂w0 ∂w0 = − =0 + 2 ∂y ∂y =0
εxz = εyz εzz
(6.2.6)
(6.2.7)
The strains in Eqs. (6.2.6) and (6.2.7) are called the von K´ arm´ an strains, and the associated plate theory is termed the classical plate theory with the von K´ arm´ an strains. Note that the transverse strains (εxz , εyz , εzz ) are identically zero in the classical plate theory. In matrix notation, Eq. (6.2.6) can be written as ⎧ ⎫ ⎨ εxx ⎬
0
⎧ ⎪ ⎪ ⎪ ⎨
∂u0 ∂x
+
1 2
+
³
³
∂w0 ∂x
γxy
´2
´2 ∂w0 ∂y ∂w0 ∂w0 + ∂x ∂x ∂y
∂v0 1 ε = ⎪ ⎩ yy ∂y + 2 ⎪ 0 ⎭ �