Finite Element Lecture by Expert Prof
Finite Element Lecture by Expert Prof
Overview
11
Chapter 1: OVERVIEW
12
TABLE OF CONTENTS
Page
1.1.
1.2. 1.3.
1.4.
1. 1. 1.
Where This Material Fits 1.1.1. Computational Mechanics . . . . . . 1.1.2. Statics vs. Dynamics . . . . . . . 1.1.3. Linear vs. Nonlinear . . . . . . . . 1.1.4. Discretization Methods . . . . . . 1.1.5. FEM Variants . . . . . . . . . . What Does a Finite Element Look Like? The FEM Analysis Process 1.3.1. The Physical FEM . . . . . . . . 1.3.2. The Mathematical FEM . . . . . . . 1.3.3. Synergy of Physical and Mathematical FEM Interpretations of the Finite Element Method 1.4.1. Physical Interpretation . . . . . . . 1.4.2. Mathematical Interpretation . . . . . Keeping the Course *What is Not Covered *Historical Sketch and Bibliography 1.7.1. Who Invented Finite Elements? . . . . 1.7.2. G1: The Pioneers . . . . . . . . 1.7.3. G2: The Golden Age . . . . . . . . 1.7.4. G3: Consolidation . . . . . . . . 1.7.5. G4: Back to Basics . . . . . . . . 1.7.6. Precursors . . . . . . . . . . . 1.7.7. Recommended Books for Linear FEM . . 1.7.8. Hasta la Vista, Fortran . . . . . . . Notes and Bibliography . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . .
. . . . . . . . . . .
13 13 14 14 14 15 15 17 17 18 19 110 111 111 112 112 113 113 113 114 114 114 115 116 116 117 118 119
12
13
1.1
New technologies spawn new ways to tell old stories. FEM is old by electronic age standards. This book is an introduction to the analysis of linear elastic structures by the Finite Element Method (FEM). This Chapter presents an overview of where the book ts, and what nite elements are. 1.1. Where This Material Fits The eld of Mechanics can be subdivided into three major areas: Theoretical Applied Computational
Mechanics
(1.1)
Theoretical mechanics deals with fundamental laws and principles of mechanics studied for their intrinsic scientic value. Applied mechanics transfers this theoretical knowledge to scientic and engineering applications, especially as regards the construction of mathematical models of physical phenomena. Computational mechanics solves specic problems by simulation through numerical methods implemented on digital computers.
Remark 1.1. Paraphrasing an old joke about mathematicians, one may dene a computational mechanician
as a person who searches for solutions to given problems, an applied mechanician as a person who searches for problems that t given solutions, and a theoretical mechanician as a person who can prove the existence of problems and solutions.
1.1.1. Computational Mechanics Several branches of computational mechanics can be distinguished according to the physical scale of the focus of attention: Nanomechanics and micromechanics Solids and Structures Computational Mechanics Continuum mechanics Fluids Multiphysics Systems
(1.2)
Nanomechanics deals with phenomena at the molecular and atomic levels of matter. As such it is closely linked to particle physics and chemistry. Micromechanics looks primarily at the crystallographic and granular levels of matter. Its main technological application is the design and fabrication of materials and microdevices. Continuum mechanics studies bodies at the macroscopic level, using continuum models in which the microstructure is homogenized by phenomenological averages. The two traditional areas of application are solid and uid mechanics. The former includes structures which, for obvious reasons, are fabricated with solids. Computational solid mechanics takes an applied sciences approach, whereas computational structural mechanics emphasizes technological applications to the analysis and design of structures. Computational uid mechanics deals with problems that involve the equilibrium and motion of liquid and gases. Well developed subsidiaries are hydrodynamics, aerodynamics, acoustics, atmospheric physics, shock, combustion and propulsion. 13
Chapter 1: OVERVIEW
14
Multiphysics is a more recent newcomer. This area is meant to include mechanical systems that transcend the classical boundaries of solid and uid mechanics, as in interacting uids and structures. Phase change problems such as ice melting and metal solidication t into this category, as do the interaction of control, mechanical and electromagnetic systems. Finally, system identies mechanical objects, whether natural or articial, that perform a distinguishable function. Examples of man-made systems are airplanes, buildings, bridges, engines, cars, microchips, radio telescopes, robots, roller skates and garden sprinklers. Biological systems, such as a whale, amoeba, inner ear, or pine tree are included if studied from the viewpoint of biomechanics. Ecological, astronomical and cosmological entities also form systems.1 In the progression of (1.2) system is the most general concept. A system is studied by decomposition: its behavior is that of its components plus the interaction between components. Components are broken down into subcomponents and so on. As this hierarchical breakdown process continues, individual components become simple enough to be treated by individual disciplines, but component interactions get more complex. Consequently there is a tradeoff art in deciding where to stop.2 1.1.2. Statics vs. Dynamics Continuum mechanics problems may be subdivided according to whether inertial effects are taken into account or not: Statics Continuum mechanics (1.3) Dynamics In dynamics actual time dependence must be explicitly considered, because the calculation of inertial (and/or damping) forces requires derivatives respect to actual time to be taken. Problems in statics may also be time dependent but with inertial forces ignored or neglected. Accordingly static problems may be classed into strictly static and quasi-static. For the former time need not be considered explicitly; any historical time-like response-ordering parameter, if one is needed, will do. In quasi-static problems such as foundation settlement, metal creep, rate-dependent plasticity or fatigue cycling, a realistic measure of time is required but inertial forces are still neglected. 1.1.3. Linear vs. Nonlinear A classication of static problems that is particularly relevant to this book is Statics Linear Nonlinear (1.4)
Linear static analysis deals with static problems in which the response is linear in the cause-andeffect sense. For example: if the applied forces are doubled, the displacements and internal stresses also double. Problems outside this domain are classied as nonlinear.
1
Except that their function may not be clear to us. The usual approach of science of constructing a mathematical model cannot answer the questions of why there should be a universe for the model to describe. Why does the universe go to all the bother of existing? Is the unied theory so compelling that it brings about its own existence? Or does it need a creator, and, if so, does he have any other effect on the universe? And who created him? (Stephen Hawking). Thus in breaking down a car engine for engineering analysis, say, the decomposition does not usually proceed beyond the components you can buy at a parts shop.
14
1.2
A nal classication of CSM static analysis is based on the discretization method by which the continuum mathematical model is discretized in space, i.e., converted to a discrete model with a nite number of degrees of freedom: Finite Element (FEM) Boundary Element (BEM) Finite Difference (FDM) Spatial discretization method Finite Volume (FVM) Spectral Meshfree
(1.5)
In CSM linear problems nite element methods currently dominate the scene as regards space discretization.3 Boundary element methods post a strong second choice in specic application areas. For nonlinear problems the dominance of nite element methods is overwhelming. Space nite difference methods in solid and structural mechanics have virtually disappeared from practical use. This statement is not true, however, for uid mechanics, where nite difference discretization methods are still important. Finite-volume methods, which directly address the discretization of conservation laws, are important in difcult problems of uid mechanics, for example high-Re gas dynamics. Spectral methods are based on transforms that map space and/or time dimensions to spaces (for example, the frequency domain) where the problem is easier to solve. A recent newcomer to the scene are the meshfree methods. These combine techniques and tools of nite element methods such as variational formulation and interpolation, with nite difference features such as non-local support. 1.1.5. FEM Variants The term Finite Element Method actually identies a broad spectrum of techniques that share common features outlined in subsequent Chapters. Two subclassications that t well applications to structural mechanics are4 Displacement Stiffness Equilibrium FEM Formulation FEM Solution Flexibility (1.6) Mixed Mixed (a.k.a. Combined) Hybrid Using the foregoing classication, we can state the topic of this book more precisely: the computational analysis of linear static structural problems by the Finite Element Method. Of the variants listed in (1.6), emphasis is placed on the displacement formulation and stiffness solution. This combination is called the Direct Stiffness Method or DSM.
3 4
There are nite element discretizations in time, but they are not so widely used as nite differences. The distinction between these subclasses require advanced technical concepts, which cannot be covered in an introductory treatment such as this book.
15
Chapter 1: OVERVIEW
16
(b)
4 3 2
(a) r d
(c)
4
(d) 2r sin(/n)
i
2/n
j r
6 7
Figure 1.1. The nd problem treated with FEM concepts: (a) continuum object, (b) a discrete approximation by inscribed regular polygons, (c) disconnected element, (d) generic element.
1.2. What Does a Finite Element Look Like? The subject of this book is FEM. But what is a nite element? The term admits of two interpretations, as discussed later. For now the underlying concept will be partly illustrated through a truly ancient problem: nd the perimeter L of a circle of diameter d . Since L = d , this is equivalent to obtaining a numerical value for . Draw a circle of radius r and diameter d = 2r as in Figure 1.1(a). Inscribe a regular polygon of n sides, where n = 8 in Figure 1.1(b). Rename polygon sides as elements and vertices as nodes. Label nodes with integers 1, . . . 8. Extract a typical element, say that joining nodes 45, as shown in Figure 1.1(c). This is an instance of the generic element i j pictured in Figure 1.1(d). The element length is L i j = 2r sin(/ n ). Since all elements have the same length, the polygon perimeter is L n = n L i j , whence the approximation to is n = L n /d = n sin(/ n ).
Table 1.1. Rectication of Circle by Inscribed Polygons (Archimedes FEM) n 1 2 4 8 16 32 64 128 256 n = n sin(/ n ) 0.000000000000000 2.000000000000000 2.828427124746190 3.061467458920718 3.121445152258052 3.136548490545939 3.140331156954753 3.141277250932773 3.141513801144301 Extrapolated by WynnExact to 16 places
Values of n obtained for n = 1, 2, 4, . . . 256 are listed in the second column of Table 1.1. As can be seen the convergence to is fairly slow. However, the sequence can be transformed by Wynns algorithm5 into that shown in the third column. The last value displays 15-place accuracy. Some key ideas behind the FEM can be identied in this example. The circle, viewed as a source mathematical object, is replaced by polygons. These are discrete approximations to the circle. The sides, renamed as elements, are specied by their end nodes. Elements can be separated by
5
A widely used lozenge extrapolation algorithm that speeds up the convergence of many sequences. See, e.g, [273].
16
17
1.3
disconnecting nodes, a process called disassembly in the FEM. Upon disassembly a generic element can be dened, independently of the original circle, by the segment that connects two nodes i and j . The relevant element property: side length L i j , can be computed in the generic element independently of the others, a property called local support in the FEM. The target property: the polygon perimeter, is obtained by reconnecting n elements and adding up their length; the corresponding steps in the FEM being assembly and solution, respectively. There is of course nothing magic about the circle; the same technique can be be used to rectify any smooth plane curve.6 This example has been offered in the FEM literature, e.g. in [172], to aduce that nite element ideas can be traced to Egyptian mathematicians from circa 1800 B.C., as well as Archimedes famous studies on circle rectication by 250 B.C. But comparison with the modern FEM, as covered in following Chapters, shows this to be a stretch. The example does not illustrate the concept of degrees of freedom, conjugate quantities and local-global coordinates. It is guilty of circular reasoning: the compact formula = limn n sin(/ n ) uses the unknown in the right hand side.7 Reasonable people would argue that a circle is a simpler object than, say, a 128-sided polygon. Despite these aws the example is useful in one respect: showing a elders choice in the replacement of one mathematical object by another. This is at the root of the simulation process described below. 1.3. The FEM Analysis Process Processes using FEM involve carrying out a sequence of steps in some way. Those sequences take two canonical congurations, depending on (i) the environment in which FEM is used and (ii) the main objective: model-based simulation of physical systems, or numerical approximation to mathematical problems. Both are reviewed below to introduce terminology used in the sequel. 1.3.1. The Physical FEM A canonical use of FEM is simulation of physical systems. This requires models. Consequenty the methodology is often called model-based simulation. The process is illustrated in Figure 1.2. The centerpiece is the physical system to be modeled. Accordingly, this conguration is called the Physical FEM. The processes of idealization and discretization are carried out concurrently to produce the discrete model. The solution step is handled by an equation solver often customized to FEM, which delivers a discrete solution (or solutions).
6 7
occasionally relevant
SOLUTION
Physical system
FEM
Discrete model
VERIFICATION
Discrete solution
solution error
Figure 1.2. The Physical FEM. The physical system (left) is the source of the simulation process. The ideal mathematical model (should one go to the trouble of constructing it) is inessential.
A similar limit process, however, may fail in three or more dimensions. This objection is bypassed if n is advanced as a power of two, as in Table 1.1, by using the half-angle recursion 1 1 sin2 2 , started from 2 = for which sin = 1.
2 sin =
17
Chapter 1: OVERVIEW
18
Figure 1.2 also shows an ideal mathematical model. This may be presented as a continuum limit or continuication of the discrete model. For some physical systems, notably those well modeled by continuum elds, this step is useful. For others, such as complex engineering systems (say, a ying aircraft) it makes no sense. Indeed Physical FEM discretizations may be constructed and adjusted without reference to mathematical models, simply from experimental measurements. The concept of error arises in the Physical FEM in two ways. These are known as verication and validation, respectively. Verication is done by replacing the discrete solution into the discrete model to get the solution error. This error is not generally important. Substitution in the ideal mathematical model in principle provides the discretization error. This step is rarely useful in complex engineering systems, however, because there is no reason to expect that the continuum model exists, and even if it does, that it is more physically relevant than the discrete model. Validation tries to compare the discrete solution against observation by computing the simulation error, which combines modeling and solution errors. As the latter is typically unimportant, the simulation error in practice can be identied with the modeling error. In real-life applications this error overwhelms the other two.8 One way to adjust the discrete model so that it represents the physics better is called model updating. The discrete model is given free parameters. These are determined by comparing the discrete solution against experiments, as illustrated in Figure 1.3. Inasmuch as the minimization conditions are generally nonlinear (even if the model is linear) the updating process is inherently iterative.
Physical system
Experimental database
FEM
Discrete solution
EXPERIMENTS
1.3.2. The Mathematical FEM The other canonical way of using FEM focuses on the mathematics. The process steps are illustrated in Figure 1.4. The spotlight now falls on the mathematical model. This is often an ordinary or partial differential equation in space and time. A discrete nite element model is generated from a variational or weak form of the mathematical model.9 This is the discretization step. The FEM equations are solved as described for the Physical FEM. On the left Figure 1.4 shows an ideal physical system. This may be presented as a realization of the mathematical model. Conversely, the mathematical model is said to be an idealization of this system. E.g., if the mathematical model is the Poissons PDE, realizations may be heat conduction or an electrostatic charge-distribution problem. This step is inessential and may be left out. Indeed Mathematical FEM discretizations may be constructed without any reference to physics.
8 9
All models are wrong; some are useful (George Box) The distinction between strong, weak and variational forms is discussed in advanced FEM courses. In the present book such forms will be largely stated (and used) as recipes.
18
19
Mathematical model
IDEALIZATION REALIZATION
1.3
FEM
SOLUTION
VERIFICATION
Discrete model
IDEALIZATION & DISCRETIZATION
Discrete solution
VERIFICATION
Figure 1.4. The Mathematical FEM. The mathematical model (top) is the source of the simulation process. Discrete model and solution follow from it. The ideal physical system (should one go to the trouble of exhibiting it) is inessential.
The concept of error arises when the discrete solution is substituted in the model boxes. This replacement is generically called verication. As in the Physical FEM, the solution error is the amount by which the discrete solution fails to satisfy the discrete equations. This error is relatively unimportant when using computers, and in particular direct linear equation solvers, for the solution step. More relevant is the discretization error, which is the amount by which the discrete solution fails to satisfy the mathematical model.10 Replacing into the ideal physical system would in principle quantify modeling errors. In the Mathematical FEM this is largely irrelevant, however, because the ideal physical system is merely that: a gment of the imagination. 1.3.3. Synergy of Physical and Mathematical FEM The foregoing canonical sequences are not exclusive but complementary. This synergy11 is one of the reasons behind the power and acceptance of the method. Historically the Physical FEM was the rst one to be developed to model complex physical systems such as aircraft, as narrated in 1.7. The Mathematical FEM came later and, among other things, provided the necessary theoretical underpinnings to extend FEM beyond structural analysis. A glance at the schematics of a commercial jet aircraft makes obvious the reasons behind the Physical FEM. There is no simple differential equation that captures, at a continuum mechanics level,12 the structure, avionics, fuel, propulsion, cargo, and passengers eating dinner. There is no reason for despair, however. The time honored divide and conquer strategy, coupled with abstraction, comes to the rescue.
10 11
This error can be computed in several ways, the details of which are of no importance here. Such interplay is not exactly a new idea: The men of experiment are like the ant, they only collect and use; the reasoners resemble spiders, who make cobwebs out of their own substance. But the bee takes the middle course: it gathers its material from the owers of the garden and eld, but transforms and digests it by a power of its own. (Francis Bacon). Of course at the (sub)atomic level quantum mechanics works for everything, from landing gears to passengers. But it would be slightly impractical to represent the aircraft by, say, 1036 interacting particles modeled by the Schro dinger equations. More seriously, Truesdell and Toupin correctly note that Newtonian mechanics, while not appropriate to the corpuscles making up a body, agrees with experience when applied to the body as a whole, except for certain phenomena of astronomical scale [253, p. 228].
12
19
Chapter 1: OVERVIEW
110
First, separate the structure out and view the rest as masses and forces. Second, consider the aircraft structure as built up of substructures (a part of a structure devoted to a specic function): wings, fuselage, stabilizers, engines, landing gears, and so on. Take each substructure, and continue to break it down into components: rings, ribs, spars, cover plates, actuators, etc. Continue through as many levels as necessary. Eventually those components become sufciently simple in geometry and connectivity that they can be reasonably well described by the mathematical models provided, for instance, by Mechanics of Materials or the Theory of Elasticity. At that point, stop. The component level discrete equations are obtained from a FEM library based on the mathematical model.
at hem Matmodel ical
Figure 1.5. Combining physical and mathematical modeling through multilevel FEM. Only two levels (system and component) are shown for simplicity.
The system model is obtained by going through the reverse process: from component equations to substructure equations, and from those to the equations of the complete aircraft. This system assembly process is governed by the classical principles of Newtonian mechanics, which provide the necessary inter-component glue. The multilevel decomposition process is diagramed in Figure 1.5, in which intermediate levels are omitted for simplicity
Remark 1.2. More intermediate decomposi-
tion levels are used in systems such as offshore and ship structures, which are characterized by a modular fabrication process. In that case multilevel decomposition mimics the way the system is actually fabricated. The general technique, called superelements, is discussed in Chapter 11.
Remark 1.3. There is no point in practice in going beyond a certain component level while considering the complete system. The reason is that the level of detail can become overwhelming without adding relevant information. Usually that point is reached when uncertainty impedes further progress. Further renement of specic components is done by the so-called global-local analysis technique outlined in Chapter 10. This technique is an instance of multiscale analysis.
Physical System
;; ;;
Figure 1.6. The idealization process for a simple structure. The physical system here a roof truss is directly idealized by the mathematical model: a pin-jointed bar assembly. For this particular structure idealized and discrete models coalesce.
For sufciently simple structures, passing to a discrete model is carried out in a single idealization and discretization step, as illustrated for the truss roof structure shown in Figure 1.6. Other levels are unnecessary in such cases. Of course the truss may be viewed as a substructure of the roof, and the roof as a a substructure of a building. 110
;; ;;
111
1.4
1.4. Interpretations of the Finite Element Method Just like there are two complementary ways of using the FEM, there are two complementary interpretations for teaching it. One stresses the physical signicance and is aligned with the Physical FEM. The other focuses on the mathematical context, and is aligned with the Mathematical FEM. 1.4.1. Physical Interpretation The physical interpretation focuses on the owchart of Figure 1.2. This interpretation has been shaped by the discovery and extensive use of the method in the eld of structural mechanics. The historical connection is reected in the use of structural terms such as stiffness matrix, force vector and degrees of freedom, a terminology that carries over to non-structural applications. The basic concept in the physical interpretation is the breakdown ( disassembly, tearing, partition, separation, decomposition) of a complex mechanical system into simpler, disjoint components called nite elements, or simply elements. The mechanical response of an element is characterized in terms of a nite number of degrees of freedom. These degrees of freedoms are represented as the values of the unknown functions as a set of node points. The element response is dened by algebraic equations constructed from mathematical or experimental arguments. The response of the original system is considered to be approximated by that of the discrete model constructed by connecting or assembling the collection of all elements. The breakdown-assembly concept occurs naturally when an engineer considers many articial and natural systems. For example, it is easy and natural to visualize an engine, bridge, aircraft or skeleton as being fabricated from simpler parts. As discussed in 1.3, the underlying theme is divide and conquer. If the behavior of a system is too complex, the recipe is to divide it into more manageable subsystems. If these subsystems are still too complex the subdivision process is continued until the behavior of each subsystem is simple enough to t a mathematical model that represents well the knowledge level the analyst is interested in. In the nite element method such primitive pieces are called elements. The behavior of the total system is that of the individual elements plus their interaction. A key factor in the initial acceptance of the FEM was that the element interaction can be physically interpreted and understood in terms that were eminently familiar to structural engineers. 1.4.2. Mathematical Interpretation This interpretation is closely aligned with the owchart of Figure 1.4. The FEM is viewed as a procedure for obtaining numerical approximations to the solution of boundary value problems (BVPs) posed over a domain . This domain is replaced by the union of disjoint subdomains (e) called nite elements. In general the geometry of is only approximated by that of (e) . The unknown function (or functions) is locally approximated over each element by an interpolation formula expressed in terms of values taken by the function(s), and possibly their derivatives, at a set of node points generally located on the element boundaries. The states of the assumed unknown function(s) determined by unit node values are called shape functions. The union of shape functions patched over adjacent elements form a trial function basis for which the node values represent the generalized coordinates. The trial function space may be inserted into the governing equations and the unknown node values determined by the Ritz method (if the solution extremizes a variational 111
Chapter 1: OVERVIEW
112
principle) or by the Galerkin, least-squares or other weighted-residual minimization methods if the problem cannot be expressed in a standard variational form.
Remark 1.4. In the mathematical interpretation the emphasis is on the concept of local (piecewise) approximation. The concept of element-by-element breakdown and assembly, while convenient in the computer implementation, is not theoretically necessary. The mathematical interpretation permits a general approach to the questions of convergence, error bounds, trial and shape function requirements, etc., which the physical approach leaves unanswered. It also facilitates the application of FEM to classes of problems that are not so readily amenable to physical visualization as structures; for example electromagnetics and heat conduction. Remark 1.5. It is interesting to note some similarities in the development of Heavisides operational meth-
ods, Diracs delta-function calculus, and the FEM. These three methods appeared as ad-hoc computational devices created by engineers and physicists to deal with problems posed by new science and technology (electricity, quantum mechanics, and delta-wing aircraft, respectively) with little help from the mathematical establishment.13 Only some time after the success of the new techniques became apparent were new branches of mathematics (operational calculus, distribution theory and piecewise-approximation theory, respectively) constructed to justify that success. In the case of the nite element method, the development of a formal mathematical theory started in the late 1960s, and much of it is still in the making.
1.5. Keeping the Course The rst Part of this book, covered in Chapters 2 through 10, stresses the physical interpretation of FEM within the framework of the Direct Stiffness Method (DSM). This is done on account of its instructional advantages. Furthermore the computer implementation becomes more transparent because the sequence of operations can be placed in close correspondence with the DSM steps. Chapters 11 through 19 deal specically with element formulations. Ingredients of the mathematical interpretation are called upon whenever it is felt proper and convenient to do so. Nonetheless excessive entanglement with the mathematical theory is avoided if it may obfuscate the physics. In Chapters 2 and 3 the time is frozen at about 1965, and the DSM presented as an aerospace engineer of that time would have understood it. This is not done for sentimental reasons, although that happens to be the year in which the writer began thesis work on FEM under Ray Clough. Virtually all commercial codes are now based on the DSM and the computer implementation has not essentially changed since the late 1960s.14 What has greatly improved since is marketing sugar: user interaction and visualization.
1.6.
Oliver Heaviside took heavy criticism from the lotus eaters, which he returned with gusto. His legacy is a living proof that England is the paradise of individuality, eccentricity, heresy, anomalies, hobbies and humors (George Santayana). Paul Dirac was luckier: he was shielded as member of the physics establishment and eventually received a Nobel Prize. Gilbert Strang, the rst mathematician to dwelve in the real FEM (the one created by engineers) was kind to the founders. With the gradual disappearance of Fortran as a live programming language, noted in 1.7.7, changes at the implementation level have recently accelerated. E.g., C++, Python, Java and Matlab wrappers are becoming more common.
14
112
113
4. 5. 6. 7. 8. 9. 10. 11.
1.7 *HISTORICAL SKETCH AND BIBLIOGRAPHY Variational methods in mechanics. General mathematical theory of nite elements. Buckling and stability analysis. General nonlinear response analysis. Structural optimization. Error estimates and problem-adaptive discretizations. Non-structural and multiphysics applications of FEM. Designing and building production-level FEM software and use of special hardware (e.g. vector and parallel computers)
Topics 15 belong to what may be called Advanced Linear FEM, whereas 67 pertain to Nonlinear FEM. Topics 810 fall into advanced applications, whereas 11 is an interdisciplinary topic that interweaves with computer science. 1.7.
This section summarizes the history of structural nite elements since 1950 to date. It functions as a hub for chapter-dispersed historical references. For exposition convenience, structural nitelementology may be divided into four generations that span 10 to 15 years each. There are no sharp intergenerational breaks, but noticeable change of emphasis. The following summary does not cover the conjoint evolution of Matrix Structural Analysis into the Direct Stiffness Method from 1934 through 1970. This was the subject of a separate essay [89], which is also given in Appendix H. 1.7.1. Who Invented Finite Elements? Not just one individual, as this historical sketch will make clear. But if the question is tweaked to: who created the FEM in everyday use? there is no question in the writers mind: M. J. (Jon) Turner at Boeing over the period 19501962. He generalized and perfected the Direct Stiffness Method, and forcefully got Boeing to commit resources to it while other aerospace companies were mired in the Force Method. During 195253 he oversaw the development of the rst continuum based nite elements. In addition to Turner, major contributors to current practice include: B. M. Irons, inventor of isoparametric models, shape functions, the patch test and frontal solvers; R. J. Melosh, who recognized the Rayleigh-Ritz link and systematized the variational derivation of stiffness elements; and E. L. Wilson, who developed the rst open source (and widely imitated and distributed) FEM software. All of these pioneers were in the aerospace industry at least during part of their careers. That is not coincidence. FEM is the conuence of three ingredients, one of which is digital computation. And only large industrial companies (as well as some government agencies) were able to afford mainframe computers during the 1950s. Who were the popularizers? Four academicians: J. H. Argyris, R. W. Clough, H. C. Martin, and O. C. Zienkiewicz are largely responsible for the technology transfer from the aerospace industry to a wider range of engineering applications during the 1950s and 1960s. The rst three learned the method from Turner directly or indirectly. As a consultant to Boeing in the early 1950s, Argyris, a Force Method expert then at Imperial College, received reports from Turners group, and weaved the material into his inuencial 1954 serial [8]. To Argyris goes the credit of being the rst in constructing a displacement-assumed continuum element [8,p. 62]. Clough and Martin, then junior professors at U.C. Berkeley and U. Washington, respectively, spent faculty internship summers at Turners group during 1952 and 1953. The result of this seminal collaboration was a celebrated paper [255], widely considered the start of the present FEM. Clough baptized the method in 1960 [40] and went on to form at Berkeley the rst research group to propel the idea into Civil Engineering applications. Olek Zienkiewicz, originally an expert in nite difference methods who learned the trade from Southwell, was convinced in 1964 by Clough to try FEM. He went on to write the rst textbook on the subject [277] and to organize another important Civil Engineering research group in the University of Wales at Swansea.
113
Chapter 1: OVERVIEW
114
1.7.2. G1: The Pioneers The 1956 paper by Turner, Clough, Martin and Topp [255], henceforth abbreviated to TCMT, is recognized as the start of the current FEM, as used in the overwhelming majority of commercial codes. Along with Argyris serial [8] they prototype the rst generation, which spans 1950 through 1962. A panoramic picture of this period is available in two textbooks [194,205]. Przemienieckis text is still reprinted by Dover. The survey by Gallagher [108] was inuential at the time but is now difcult to access outside libraries. The pioneers were structural engineers, schooled in classical mechanics. They followed a century of tradition in regarding structural elements as a device to transmit forces. This element as force transducer was the standard view in pre-computer structural analysis. It explains the use of ux assumptions to derive stiffness equations in TCMT. Element developers worked in, or interacted closely with, the aircraft industry. (As noted above, only large aerospace companies were then able to afford mainframe computers.) Accordingly they focused on thin structures built up with bars, ribs, spars, stiffeners and panels. Although the Classical Force Method dominated stress analysis during the 1950s [89], stiffness methods were kept alive by use in dynamics and vibration. It is not coincidence that Turner was an world-class expert in aeroelasticity. 1.7.3. G2: The Golden Age The next period spans the golden age of FEM: 19621972. This is the variational generation. Melosh showed [179] that conforming displacement models are a form of Rayleigh-Ritz based on the minimum potential energy principle. This inuential paper marks the conuence of three lines of research: Argyris dual formulation of energy methods [8], the Direct Stiffness Method (DSM) of Turner [256258], and early ideas of interelement compatibility as basis for error bounding and convergence [101,178]. G1 workers thought of nite elements as idealizations of structural components. From 1962 onward a two-step interpretation emerges: discrete elements approximate continuum models, which in turn approximate real structures. By the early 1960s FEM begins to expand into Civil Engineering through Cloughs Boeing-Berkeley connection [48,49] and had been baptized [40,42]. Reading Fraeijs de Veubekes famous article [102] side by side with TCMT [255] one can sense the ongoing change in perspective opened up by the variational framework. The rst book devoted to FEM appears in 1967 [277]. Applications to nonstructural problems had started in 1965 [276], and were treated in some depth by Martin and Carey [172]. From 1962 onwards the displacement formulation dominates. This was given a big boost by the invention of the isoparametric formulation and related tools (numerical integration, tted natural coordinates, shape functions, patch test) by Irons and coworkers [144148]. Low order displacement models often exhibit disappointing performance. Thus there was a frenzy to develop higher order elements. Other variational formulations, notably hybrids [195,200], mixed [130,239] and equilibrium models [102] emerged. G2 can be viewed as closed by the monograph of Strang and Fix [228], the rst book to focus on the mathematical foundations. 1.7.4. G3: Consolidation The post-Vietnam economic doldrums are mirrored during this post-1972 period. Gone is the youthful exuberance of the golden age. This is consolidation time. Substantial effort is put into improving the stock of G2 displacement elements by tools initially labeled variational crimes [227], but later justied. Textbooks by Hughes [142] and Bathe [15] reect the technology of this period. Hybrid and mixed formulations record steady progress [13]. Assumed strain formulations appear [162]. A booming activity in error estimation and mesh adaptivity is fostered by better understanding of the mathematical foundations [237]. Commercial FEM codes gradually gain importance. They provide a reality check on what works in the real world and what doesnt. By the mid-1980s there was gathering evidence that complex and high order elements were commercial ops. Exotic gadgetry interweaved amidst millions of lines of code easily breaks down in new releases. Complexity is particularly dangerous in nonlinear and dynamic analyses conducted by novice users. A trend back toward simplicity starts [164,167].
114
115
1.7.5. G4: Back to Basics
The fourth generation begins by the early 1980s. More approaches come on the scene, notably the Free Formulation [27,28], orthogonal hourglass control [96], Assumed Natural Strain methods [17,224], stress hybrid models in natural coordinates [198,206], as well as variants and derivatives of those approaches: ANDES [76,183], EAS [220,221] and others. Although technically diverse the G4 approaches share two common objectives: (i) (ii) Elements must t into DSM-based programs since that includes the vast majority of production codes, commercial or otherwise. Elements are kept simple but should provide answers of engineering accuracy with relatively coarse meshes. These were collectively labeled high performance elements in 1989 [73].
Two more recent trends can be noted: increased abstraction on the mathematical side,15 and canned recipes for running commercial software on the physical side. Things are always at their best in the beginning, said Pascal. Indeed. By now FEM looks like an aggregate of largely disconnected methods and recipes. The blame should not be placed on the method itself, but on the community split noted in the book Preface. 1.7.6. Precursors As used today, FEM represents the conuence of three ingredients: Matrix Structural Analysis (MSA), variational approximation theory, and the digital computer. These came together in the early 1950. The reader should not think, however, that they simultaneouly appeared on the table through some alchemy. MSA came on the scene in the mid 1930s when desk calculators became popular, as narrated in Appendix H. And variational approximation schemes akin to those of modern FEM were proposed before digital computers. Three examples: The historical sketch of [172] says that Archimedes used nite elements in determining the volume of solids. The alleged linkage is tenuous. Indeed he calculated areas, lengths and volumes of geometrical objects by dividing them into simpler ones and adding their contributions, passing to the limit as necessary. Where does variational approximation come in? Well, one may argue that the volume (area, length) measure of an object is a scalar functional of its geometry. Transmute measure into energy and simpler objects into elements and you capture one of the FEM tenets: the energy of the system is the sum of element energies. But for Archimedes to reach modern FEM long is the way, and hard, since physical energy calculations require derivatives and Calculus would not be invented for 20 centuries. In his studies leading to the creation of variational calculus, Euler divided the interval of denition of a one-dimensional functional into nite intervals and assumed a linear variation over each, dened by end values [155, p. 53]. Passing to the limit he obtained what is now called the Euler-Lagrange differential equation of variational calculus. Thus Euler deserves credit for being the rst to use a piecewise linear function with discontinuous derivatives at nodes to produce, out of the hat, an ODE with second derivatives. He did not use those functions, however, to obtain an approximate value of the functional.16 In the early 1940s Courant wrote an expository article [55] advocating the variational treatment of partial differential equations. The Appendix of this article contains the rst FEM-style calculations on a triangular net for determining the torsional stiffness of a hollow shaft. He used piecewise linear interpolation over each triangle as Rayleigh-Ritz trial functions, and called his idea generalized nite differences.
15 16
If you go too far up, abstraction-wise, you run out of oxygen. (Joel Spolsky). That would have preceded the invention of direct variational methods (Rayleigh-Ritz) for over one century, while representing also the rst FEM-style calculation. A near miss indeed.
115
Chapter 1: OVERVIEW
116
A direct variational approach similar to Courants was continued by Synge and Prager in the context of functional analysis [203] and exposed in Synges book [236] as the hypercircle method.17 The seminal paper by Turner et al [255] cites two immediate DSM precursors, both dated 1953, by Levy [159] and Schuerch [217]. (Only the former is available as a journal article; both have delta wings in the title.) From [255, p. 806]: In a recent paper Levy has presented a method of analysis for highly redundant structures that is particularly suited to the use of high-speed digital computing machines. . . . The stiffness matrix for the entire structure is computed by simple summation of of the stiffness matrices of the elements of the structure.
Precursors prior to 1950 had no inuence on the rapid developments of Generation 1 outlined in 1.7.2. Two crucial pieces were missing. First, and most important, was the programmable digital computer. Without computers FEM would be a curiosity, worth perhaps a footnote in an arcane book. Also missing was a driving application that could get the long-term attention of scientists and engineers as well as industrial resources to fund R&D work. Aerospace structural mechanics provided the driver because the necessary implementation apparatus of MSA was available since the late 1930s [105]. Matrix procedures had to be moved from desk calculators and punched-tape accounting machines to digital computers, which afuent aerospace companies were able to afford amidst Cold War paranoia. Can you imagine defense funds pouring into hypercircles? Once all pieces were in place, synergy transformed the method into a product, and FEM took off. 1.7.7. Recommended Books for Linear FEM The literature is vast: over 200 textbooks and monographs have appeared since 1967. Some recommendations for readers interested in further studies within linear FEM are offered below. Basic level (reference): Zienkiewicz and Taylor [280]. This two-volume set is a comprehensive upgrade of the previous edition [278]. Primarily an encyclopdic reference work that gives a panoramic coverage of FEM applications, as well as a comprehensive list of references. Not a textbook or monograph. Prior editions suffered from loose mathematics, largely xed in this one. A three-volume fth edition has appeared recently. Basic level (textbook): Cook, Malkus and Plesha [50]. The third edition is comprehensive in scope although the coverage is more supercial than Zienkiewicz and Taylor. A fourth edition has appeared recently. Intermediate level: Hughes [142]. It requires substantial mathematical expertise on the part of the reader. Recently (2000) reprinted as Dover edition. Mathematically oriented: Strang and Fix [228]. Still the most readable mathematical treatment for engineers, although outdated in several subjects. Out of print. Best value for the $$$: Przemienieckis Dover edition [205], list price $15.95 (2003). A reprint of a 1966 McGraw-Hill book. Although woefully outdated in many respects (the word nite element does not appear except in post-1960 references), it is a valuable reference for programming simple elements. Contains a fairly detailed coverage of substructuring, a practical topic missing from the other books. Comprehensive bibliography in Matrix Structural Analysis up to 1966. Most fun (if you appreciate British humor): Irons and Ahmad [148]. Out of print. For buying out-of-print books through web services, check the metasearch engine in www3.addall.com (most comprehensive; not a bookseller) as well as that of www.amazon.com. A newcomer is www.campusi.com
17
Curiously this book does not mention, even in passing, the use of digital computers that had already been commercially available for several years. The few numerical examples, all in 2D, are done by hand via relaxation methods.
116
117
1.7.8. Hasta la Vista, Fortran
Most FEM books that include programming samples or even complete programs use Fortran. Those face an uncertain future. Since the mid-1990s, Fortran is gradually disappearing as a programming language taught in USA engineering undergraduate programs. (It still survives in Physics and Chemistry departments because of large amounts of legacy code.) So one end of the pipeline is drying up. Low-level scientic programming is moving to C and C++, mid-level to Java, Perl and Python, high-level to Matlab, Mathematica and their free-source Linux equivalents. How attractive can a book teaching in a dead language be? To support this argument with some numbers, here is a September-2003 snapshot of ongoing open source software projects listed in http://freshmeat.net. This conveys the relative importance of various languages (a mixed bag of newcomers, going-strongs, have-beens and never-was) in the present environment. Lang Projects Perc Ada 38 0.20% Assembly 170 0.89% C 5447 28.55% Cold Fusion 10 0.05% Dylan 2 0.01% Erlang 11 0.06% Forth 15 0.08% Java 2332 12.22% Logo 2 0.01% Object Pascal 9 0.05% Other 160 0.84% Pascal 38 0.20% Pike 3 0.02% PROGRESS 2 0.01% Rexx 7 0.04% Simula 1 0.01% Tcl 356 1.87% Xbasic 1 0.01% Total Projects: 19079 Notes and Bibliography Here is Ray Cloughs personal account of how FEM and DSM emerged at Boeing in the early 1950s.
My involvement with the FEM began when I was employed by the Boeing Airplane Company in Seattle during summer 1952 as a member of their summer faculty program. When I had joined the civil engineering faculty at Berkeley in 1949, I decided to take advantage of my MIT structural dynamics background by taking up the eld of Earthquake Engineering. So because the Boeing summer faculty program offered positions with their structural dynamics unit, I seized on that as the best means of advancing my preparation for the earthquake engineering eld. I was particularly fortunate in this choice of summer work at Boeing because the head of their structural dynamics unit was Mr. M. J. Turner a very capable man in dealing with problems of structural vibrations and utter. When I arrived for the summer of 1952, Jon Turner asked me to work on the vibration analysis of a delta wing structure. Because of its triangular plan form, this problem could not be solved by procedures based on standard beam theory; so I spent the summer of 1952 trying to formulate a delta wing model built up as an assemblage of one-dimensional beams and struts. However, the results of deection analyses based on this type of mathematical model were in very poor agreement with data obtained from laboratory tests of a scale model of a delta wing. My nal conclusion was that my summers work was a total failurehowever, at least I learned what did not work. Spurred by this disappointment, I decided to return to Boeing for the summer faculty program in 1953. During the winter, I stayed in touch with Jon Turner so I was able to rejoin the structural dynamics unit in June. The
Lang Projects Perc Lang Projects APL 3 0.02% ASP 25 Awk 40 0.21% Basic 15 C# 41 0.21% C++ 2443 Common Lisp 27 0.14% Delphi 49 Eiffel 20 0.10% Emacs-Lisp 33 Euler 1 0.01% Euphoria 2 Fortran 45 0.24% Haskell 28 JavaScript 236 1.24% Lisp 64 ML 26 0.14% Modula 7 Objective C 131 0.69% Ocaml 20 Other Scripting Engines 82 0.43% Perl 2752 14.42% PHP 2020 PL/SQL 58 0.30% Pliant 1 Prolog 8 0.04% Python 1171 Ruby 127 0.67% Scheme 76 Smalltalk 20 0.10% SQL 294 Unix Shell 550 2.88% Vis Basic 15 YACC 11 0.06% Zope 34
Perc 0.13% 0.08% 12.80% 0.26% 0.17% 0.01% 0.15% 0.34% 0.04% 0.10% 10.59% 0.01% 6.14% 0.40% 1.54% 0.08% 0.18%
117
Chapter 1: OVERVIEW
118
most important development during the winter was that Jon suggested we try to formulate the stiffness property of the wing by assembling plane stress plates of either triangular or rectangular shapes. So I developed stiffness matrices for plates of both shapes, but I decided the triangular form was much more useful because such plates could be assembled to approximate structures of any conguration. Moreover, the stiffness properties of the individual triangular plates could be calculated easily based on assumptions of uniform states of normal stress in the X and the Y directions combined with an uniform state of shear stress. Then the stiffness of the complete structure was obtained by appropriate addition of the contributions from the individual pieces. The Boeing group called this procedure the direct stiffness method. The remainder of the summer of 1953 was spent in demonstrating that deections calculated for structures formed as assemblages of triangular elements agreed well with laboratory measurements on the actual physical models. Also, it became apparent that the precision of the calculated results could be improved asymptotically by continued renement of the nite element mesh. The conclusions drawn from that summers work were presented in a paper given by Jon Turner at the annual meeting of the Institute of Aeronautical Sciences in January 1954. However, for reasons I never understood Jon did not submit the paper for publication until many months later. So this paper, which often is considered to be the rst published description of the FEM, was not published until September 1956 more than two years after the verbal presentation. It is important to note that the basic purpose of the work done by Jon Turners structural dynamics unit was vibration and utter analysis. They were not concerned with stress analysis because that was the responsibility of the stress analysis unit. However, it was apparent that the model formed by the direct stiffness method could be used for stress analysis as well as for vibration analysis, and I made plans to investigate this stress analysis application as soon as possible. However, because of my other research responsibilities, I was not able to spend any signicant time on the stress analysis question until I went on my sabbatical leave to Trondheim, Norway in September 1956. Then, when I arrived in Norway all I could do was to outline the procedures for carrying out the analysis, and to do calculations for very small systems using a desk calculator because the Norwegian Institute of Technology did not yet have an automatic digital computer. The presentation of the paper to the Institute of Aeronautical Sciences was the rst introduction of the principles of the FEM to a technical audience; although some of the basic concepts of the method were stated a short time later in a series of articles published in Aircraft Engineering by Dr. John H. Argyris during October 1954 to May 1955. However, the rectangular element presented in those articles is only a minor part of that contribution. The Argyris work came to my attention during my sabbatical leave in Norway, and I considered it then (as I still do now) to be the most important series of papers ever published in the eld of Structural Mechanics. I credit that work for extending the scope of my understanding of structural theory to the level it eventually attained. From my personal point of view, the next important event in nite element history was the coining of the name FEM. My purpose in choosing that name was to distinguish clearly the relatively large size pieces of the structure that make up a nite element assemblage as contrasted with the innitesimal contributions that go into evaluation of the displacements of a structure in a typical virtual work analysis. The name rst appeared in a publication that was written to demonstrate the nite element procedure for the civil engineering profession. A much more signicant application of the method was presented at the Symposium on the use of Computers in Civil Engineering, held in Lisbon, Portugal in 1962, where it was used to evaluate the stress concentrations developed in a gravity dam that had cracked at its mid-section.
118
119
Homework Exercises for Chapter 1 Overview
Exercises
EXERCISE 1.1 [A:15] Work out Archimedes problem using a circumscribed regular polygon, with n =
EXERCISE 1.2 [D:20] Select one of the following vehicles: truck, car, motorcycle, or bicycle. Draw a two
level decomposition of the structure into substructures, and of selected components of some substructures.
EXERCISE 1.3 [D:30] In one of the earliest articles on the FEM, Clough [42] writes:
When idealized as an assemblage of appropriately shaped two- and three-dimensional elements in this manner, an elastic continuum can be analyzed by standard methods of structural analysis. It should be noted that the approximation which is employed in this case is of physical nature; a modied structural system is substituted for the actual continuum. There need be no approximation in the mathematical analysis of this structural system. This feature distinguishes the nite element technique from nite difference methods, in which the exact equations of the actual physical system are solved by approximate mathematical procedures. Discuss critically the contents of this paragraph while placing it in the context of time of writing (early 1960s). Is the last sentence accurate?
119
Introduction to FEM
Overview
IFEM Ch 1Slide 1
Introduction to FEM
Course Coverage
This course consists of three Parts: I. Finite Element Basic Concepts
IFEM Ch 1Slide 2
Introduction to FEM
Mechanics
IFEM Ch 1Slide 3
Introduction to FEM
Computational Mechanics
Branches of Computational Mechanics can be distinguished according to the physical focus of attention
Computational Mechanics
Nano and Micromechanics Continuum Mechanics: Solids and Structures Fluids Multiphysics Systems
IFEM Ch 1Slide 4
Introduction to FEM
Statics
Dynamics
IFEM Ch 1Slide 5
Introduction to FEM
CSM Statics
A further subdivision of problems in CSM Statics is
CSM Statics
Linear
Nonlinear
IFEM Ch 1Slide 6
Introduction to FEM
Finite Element Method Finite Difference Method Boundary Element Method Finite Volume Method Spectral Method Mesh-Free Method
IFEM Ch 1Slide 7
Introduction to FEM
Formulation of FEM Model
IFEM Ch 1Slide 8
Introduction to FEM
IFEM Ch 1Slide 9
Introduction to FEM
r d
5 1 5
2r sin(/n) i
2/n 6 7 8
j r
IFEM Ch 1Slide 10
Introduction to FEM
n 1 2 4 8 16 32 64 128 256
n = n sin(/n) 0.000000000000000 2.000000000000000 2.828427124746190 3.061467458920718 3.121445152258052 3.136548490545939 3.140331156954753 3.141277250932773 3.141513801144301
Extrapolated by Wynn-
Exact to 16 places
IFEM Ch 1Slide 11
Introduction to FEM
Roof Truss
support
joint
; ; ;
IFEM Ch 1Slide 12
; ; ;
Introduction to FEM
Physical
Breakdown of structural system into components (elements) and reconstruction by the assembly process Emphasized in Part I
IFEM Ch 1Slide 13
Introduction to FEM
generally irrelevant
SOLUTION
Physical system
FEM
Discrete model
VERIFICATION
Discrete solution
solution error
IFEM Ch 1Slide 14
Introduction to FEM
FEM
SOLUTION
VERIFICATION
Discrete model
IDEALIZATION & DISCRETIZATION
Discrete solution
VERIFICATION
IFEM Ch 1Slide 15
Introduction to FEM
FEM
Discrete solution
IFEM Ch 1Slide 16
Introduction to FEM
NT
atic hemel t a d M mo
al
FEM
Li
y brar
IFEM Ch 1Slide 17
Introduction to FEM
IFEM Ch 1Slide 18
21
22
TABLE OF CONTENTS
Page
2.8.
2. 2. 2.
Why A Plane Truss? Truss Structures Idealization Members, Joints, Forces and Displacements The Master Stiffness Equations The DSM Steps Breakdown 2.7.1. Disconnection . . . . . . . . . . 2.7.2. Localization . . . . . . . . . . 2.7.3. Computation of Member Stiffness Equations Assembly: Globalization 2.8.1. Coordinate Transformations . . . . . 2.8.2. Transformation to Global System . . . . Notes and Bibliography . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
22
23
2.2
TRUSS STRUCTURES
This Chapter begins the exposition of the Direct Stiffness Method (DSM) of structural analysis. The DSM is by far the most common implementation of the Finite Element Method (FEM). In particular, all major commercial FEM codes are based on the DSM. The exposition is done by following the DSM steps applied to a simple plane truss structure. The method has two major stages: breakdown, and assembly+solution. This Chapter covers primarily the breakdown stage. 2.1. Why A Plane Truss? The simplest structural nite element is the 2-node bar (also called linear spring) element, which is illustrated in Figure 2.1(a). Perhaps the most complicated nite element (at least as regards number of degrees of freedom) is the curved, three-dimensional brick element depicted in Figure 2.1(b). Yet the remarkable fact is that, in the DSM, the simplest and most complex elements are treated alike! To illustrate the basic steps of this democratic method, it makes educational sense to keep it simple and use a structure composed of bar elements.
(a) (b)
Figure 2.1. From the simplest through a highly complex structural nite element: (a) 2-node bar element for trusses, (b) 64-node tricubic, brick element for three-dimensional solid analysis.
A simple yet nontrivial structure is the pin-jointed plane truss.1 Using a plane truss to teach the stiffness method offers two additional advantages: (a) Computations can be entirely done by hand as long as the structure contains just a few elements. This allows various steps of the solution procedure to be carefully examined and understood before passing to the computer implementation. Doing hand computations on more complex nite element systems rapidly becomes impossible. (b) The computer implementation on any programming language is relatively simple and can be assigned as preparatory computer homework before reaching Part III. 2.2. Truss Structures Plane trusses, such as the one depicted in Figure 2.2, are often used in construction, particularly for roong of residential and commercial buildings, and in short-span bridges. Trusses, whether two or three dimensional, belong to the class of skeletal structures. These structures consist of elongated structural components called members, connected at joints. Another important subclass of skeletal structures are frame structures or frameworks, which are common in reinforced concrete construction of buildings and bridges. Skeletal structures can be analyzed by a variety of hand-oriented methods of structural analysis taught in beginning Mechanics of Materials courses: the Displacement and Force methods. They can also be analyzed by the computer-oriented FEM. That versatility makes those structures a good choice
1
A one dimensional bar assembly would be even simpler. That kind of structure would not adequately illustrate some of the DSM steps, however, notably the back-and-forth transformations from global to local coordinates.
23
24
member support
joint
Figure 2.2. An actual plane truss structure. That shown is typical of a roof truss used in building construction.
to illustrate the transition from the hand-calculation methods taught in undergraduate courses, to the fully automated nite element analysis procedures available in commercial programs. In this and the next Chapter we will go over the basic steps of the DSM in a hand-computer calculation mode. This means that although the steps are done by hand, whenever there is a procedural choice we shall either adopt the way that is better suited towards the computer implementation, or explain the difference between hand and computer computations. The actual computer implementation using a high-level programming language is presented in Chapter 4. To keep hand computations manageable in detail we use just about the simplest structure that can be called a plane truss, namely the three-member truss illustrated in Figure 2.3. The idealized model of the example truss as a pin-jointed assemblage of bars is shown in Figure 2.4(a), which also gives its geometric and material properties. In this idealization truss members carry only axial loads, have no bending resistance, and are connected by frictionless pins. Figure 2.4(b) shows idealized support conditions as well as the applied point loads applied on truss joints.
It should be noted that as a practical structure the example truss is not particularly useful the one depicted in Figure 2.2 is far more common in construction. But with the example truss we can go over the basic DSM steps without getting mired into too many members, joints and degrees of freedom. 2.3. Idealization Although the pin-jointed assemblage of bars (as depicted in Figure 2.4) is sometimes presented as an actual problem, it actually represents an idealization of a true truss structure. The axially-carrying members and frictionless pins of this structure are only an approximation of a real truss. For example, building and bridge trusses usually have members joined to each other through the use of gusset plates, which are attached by nails, bolts, rivets or welds. See Figure 2.2. Consequently members will carry some bending as well as direct axial loading. Experience has shown, however, that stresses and deformations calculated for the simple idealized problem will often be satisfactory for overall-design purposes; for example to select the cross section of the members. Hence the engineer turns to the pin-jointed assemblage of axial force elements and uses it to carry out the structural analysis. This replacement of true by idealized is at the core of the physical interpretation of the nite element method discussed in 1.4. 24
25
2.4
(a)
L E A
(3)
fy3, u y3
3
fx3, u x3
(b)
f y3 = 1
3
(3) (3)
fx3 = 2
L = 10 E (2) A (2) = 50
(2)
y fx1, u x1
1
y fx2, u x2
2
;; ;; ;;
25
fy1, u y1
(1)
fy2, u y2
Figure 2.4. Pin-jointed idealization of example truss: (a) geometric and elastic properties, (b) support conditions and applied loads.
2.4. Members, Joints, Forces and Displacements The idealization of the example truss, pictured in Figure 2.4, has three joints, which are labeled 1, 2 and 3, and three members, which are labeled (1), (2) and (3). These members connect joints 12, 23, and 13, respectively. The member lengths are denoted by L (1) , L (2) and L (3) , their elastic moduli by E (1) , E (2) and E (3) , and their cross-sectional areas by A(1) , A(2) and A(3) . Note that an element number superscript is enclosed in parenthesis to avoid confusion with exponents. Both E and A are assumed to be constant along each member. Members are generically identied by index e (because of their close relation to nite elements, see below). This index is placed as superscript of member properties. For example, the cross-section area of a generic member is Ae . The member superscript is not enclosed in parentheses in this case because no confusion with exponents can arise. But the area of member 3 is written A(3) and not A3 . Joints are generically identied by indices such as i , j or n . In the general FEM, the names joint and member are replaced by node and element, respectively. The dual nomenclature is used in the initial Chapters to stress the physical interpretation of the FEM. The geometry of the structure is referred to a common Cartesian coordinate system {x , y }, which is called the global coordinate system. Other names for it in the literature are structure coordinate system and overall coordinate system. The key ingredients of the stiffness method of analysis are the forces and displacements at the joints. In a idealized pin-jointed truss, externally applied forces as well as reactions can act only at the joints. All member axial forces can be characterized by the x and y components of these forces, denoted by f x and f y , respectively. The components at joint i will be identied as f xi and f yi , respectively. The set of all joint forces can be arranged as a 6-component column vector called f. The other key ingredient is the displacement eld. Classical structural mechanics tells us that the displacements of the truss are completely dened by the displacements of the joints. This statement is a particular case of the more general nite element theory. The x and y displacement components will be denoted by u x and u y , respectively. The values of u x and u y at joint i will be called u xi and u yi . Like joint forces, they are arranged into a 6-component vector called u. Here are the two vectors
;; ;; ;;
(1)
26
of nodal forces and nodal displacements, shown side by side: fx1 ux1 f y1 u y1 f u f = x2 , u = x2 . f y2 u y2 fx3 ux3 f y3 u y3
(2.1)
In the DSM these six displacements are the primary unknowns. They are also called the degrees of freedom or state variables of the system.2 How about the displacement boundary conditions, popularly called support conditions? This data will tell us which components of f and u are actual unknowns and which ones are known a priori. In pre-computer structural analysis such information was used immediately by the analyst to discard unnecessary variables and thus reduce the amount of hand-carried bookkeeping. The computer oriented philosophy is radically different: boundary conditions can wait until the last moment. This may seem strange, but on the computer the sheer volume of data may not be so important as the efciency with which the data is organized, accessed and processed. The strategy save the boundary conditions for last will be followed here also for the hand computations.
Remark 2.1. Often column vectors such as (2.1) will be displayed in row form to save space, with a transpose
2.5. The Master Stiffness Equations The master stiffness equations relate the joint forces f of the complete structure to the joint displacements u of the complete structure before specication of support conditions. Because the assumed behavior of the truss is linear, these equations must be linear relations that connect the components of the two vectors. Furthermore it will be assumed that if all displacements vanish, so do the forces.3 If both assumptions hold the relation must be homogeneous and expressable in component form as K x 1x 1 K x 1 y 1 K x 1x 2 K x 1 y 2 K x 1x 3 K x 1 y 3 ux1 fx1 f y 1 K y 1x 1 K y 1 y 1 K y 1x 2 K y 1 y 2 K y 1x 3 K y 1 y 3 u y 1 f x 2 K x 2x 1 K x 2 y 1 K x 2x 2 K x 2 y 2 K x 2x 3 K x 2 y 3 u x 2 (2.2) = . f y 2 K y 2x 1 K y 2 y 1 K y 2x 2 K y 2 y 2 K y 2x 3 K y 2 y 3 u y 2 fx3 K x 3x 1 K x 3 y 1 K x 3x 2 K x 3 y 2 K x 3x 3 K x 3 y 3 ux3 f y3 K y 3x 1 K y 3 y 1 K y 3x 2 K y 3 y 2 K y 3x 3 K y 3 y 3 u y3 In matrix notation: f = K u.
2
(2.3)
Primary unknowns is the correct mathematical term whereas degrees of freedom has a mechanics avor: any of a limited number of ways in which a body may move or in which a dynamic system may change (Merrian-Webster). The term state variables is used more often in nonlinear analysis, material sciences and statistics. This assumption implies that the so-called initial strain effects, also known as prestress or initial stress effects, are neglected. Such effects are produced by actions such as temperature changes or lack-of-t fabrication, and are studied in Chapter 29.
26
27
2.7
BREAKDOWN
Here K is the master stiffness matrix, also called global stiffness matrix, assembled stiffness matrix, or overall stiffness matrix. It is a 6 6 square matrix that happens to be symmetric, although this attribute has not been emphasized in the written-out form (2.2). The entries of the stiffness matrix are often called stiffness coefcients and have a physical interpretation discussed below. The qualiers (master, global, assembled and overall) convey the impression that there is another level of stiffness equations lurking underneath. And indeed there is a member level or element level, into which we plunge in the Breakdown section.
Remark 2.2. Interpretation of Stiffness Coefcients. The following interpretation of the entries of K is valuable
for visualization and checking. Choose a displacement vector u such that all components are zero except the i th one, which is one. Then f is simply the i th column of K. For instance if in (2.3) we choose u x 2 as unit displacement, u = [0 0 1 0 0 0 ]T , f = [ K x 1x 2 K y 1x 2 K x 2x 2 K y 2x 2 K x 3x 2 K y 3x 2 ]T . (2.4)
Thus K y 1x 2 , say, represents the y -force at joint 1 that would arise on prescribing a unit x -displacement at joint 2, while all other displacements vanish. In structural mechanics this property is called interpretation of stiffness coefcients as displacement inuence coefcients. It extends unchanged to the general nite element method.
2.6. The DSM Steps The DSM steps, major and minor, are summarized in Figure 2.5 for the convenience of the reader. The two major processing steps are Breakdown, followed by Assembly & Solution. A postprocessing substep may follow, although this is not part of the DSM proper.
Breakdown
(Section 2.7)
Merge The rst 3 DSM substeps are: (1) disconnection, Assembly & Application of BCs Solution (2) localization, and (3) computation of member Solution stiffness equations. Collectively these form (Secs 2.8, 3.2-3.4) Recovery of Derived Quantities the breakdown. The rst two are agged as conceptual in Figure 2.5 because they are not acpost-processing conceptual processing tually programmed as such: they are implicitly steps steps steps carried out through the user-provided problem denition. Processing actually begins at the Figure 2.5. The Direct Stiffness Method steps. member-stiffness-equation forming substep.
2.7. Breakdown 2.7.1. Disconnection To carry out the rst breakdown step we proceed to disconnect or disassemble the structure into its components, namely the three truss members. This task is illustrated in Figure 2.6. To each member e = 1, 2, 3 assign a Cartesian system {x e, y e }. Axis x e is aligned along the axis of the eth member. e Actually x runs along the member longitudinal axis; it is shown offset in that Figure for clarity. By convention the positive direction of x e runs from joint i to joint j , where i < j . The angle formed e e by x and x is the orientation angle . The axes origin is arbitrary and may be placed at the member midpoint or at one of the end joints for convenience. 27
28
_ _ fyi , uyi
_
y
_
x
i k s = EA / L
(3) y 1 x (1)
_
x (2)
(2)
y (2) x(1)
_
(b) F
j F L d
y(1)
Figure 2.6. Breakdown of example truss into individual members (1), (2) and (3), and selection of local coordinate systems.
Figure 2.7. Generic truss member referred to its local coordinate system {x , y }: (a) idealization as bar element, (b) interpretation as equivalent spring.
Systems {x e, y e } are called local coordinate systems or member-attached coordinate systems. In the general nite element method they also receive the name element coordinate systems. 2.7.2. Localization Next we drop the member identier e so that we are effectively dealing with a generic truss member, as illustrated in Figure 2.7(a). The local coordinate system is {x , y }. The two end joints are i and j . As shown in that gure, a generic truss member has four joint force components and four joint displacement components (the member degrees of freedom). The member properties are length L , elastic modulus E and cross-section area A. 2.7.3. Computation of Member Stiffness Equations The force and displacement components of the generic truss member shown in Figure 2.7(a) are linked by the member stiffness relations , f = Ku which written out in full is xi xi K f xi yi xi K fyi = K x j xi fx j fyj K
y j xi
xi yi K yi yi K x j yi K y j yi K
xi x j K yi x j K xjxj K yjx j K
(2.6)
are called the member joint forces and member joint displacements, respectively, Vectors f and u is the member stiffness matrix or local stiffness matrix. When these relations are interpreted whereas K from the standpoint of the general FEM, member is replaced by element and joint by node. in terms of L , E and A. The most There are several ways to construct the stiffness matrix K straightforward technique relies on the Mechanics of Materials approach covered in undergraduate 28
29
2.8
ASSEMBLY: GLOBALIZATION
courses. Think of the truss member in Figure 2.7(a) as a linear spring of equivalent stiffness ks , an interpretation illustrated in Figure 2.7(b). If the member properties are uniform along its length, Mechanics of Materials bar theory tells us that4 ks = Consequently the force-displacement equation is F = ks d = EA d, L (2.8) EA , L (2.7)
where F is the internal axial force and d the relative axial displacement, which physically is the bar elongation. The axial force and elongation can be immediately expressed in terms of the joint forces and displacements as F = fx j = fxi , d=u xj u xi , (2.9) which express force equilibrium5 and kinematic compatibility, respectively. Combining (2.8) and (2.9) we obtain the matrix relation6 1 f xi yi E A 0 f f= = 1 fx j L 0 fy j Hence 0 0 0 0 1 0 1 0 0 0 0 0 0 u xi 0u yi u , =K 0 u xj 0 u yj
(2.10)
1 E A 0 = K 1 L 0
1 0 0 0 . 1 0 0 0
(2.11)
This is the truss stiffness matrix in local coordinates. Two other methods for obtaining the local force-displacement relation (2.8) are covered in Exercises 2.6 and 2.7. 2.8. Assembly: Globalization The rst substep in the assembly & solution major step, as shown in Figure 2.5, is globalization. This operation is done member by member. It refers the member stiffness equations to the global system {x , y } so it can be merged into the master stiffness. Before entering into details we must establish relations that connect joint displacements and forces in the global and local coordinate systems. These are given in terms of transformation matrices.
4 5
See for example, Chapter 2 of [19]. Equations F = fx j = fxi follow by considering the free body diagram (FBD) of each joint. For example, take joint i as a FBD. Equilibrium along x requires F fxi = 0 whence F = fxi . Doing the same on joint j yields F = fx j . The matrix derivation of (2.10) is the subject of Exercise 2.3.
29
210
uyj
uyj
uxj
fyj
fyj
fxj
y
uyi
_
x
_
j
fyi
_
fxj
u yi
fyi
x
uxi
fxi
uxi
fxi
Figure 2.8. The transformation of node displacement and force components from the local system {x , y } to the global system {x , y }.
2.8.1. Coordinate Transformations The necessary transformations are easily obtained by inspection of Figure 2.8. For the displacements u xi = u xi c + u yi s , u x j = u x j c + u y j s, u yi = u xi s + u yi c, u y j = u x j s + u y j c, . (2.12)
where c = cos , s = sin and is the angle formed by x and x , measured positive counterclockwise from x . The matrix form of this relation is u xi c s 0 0 u xi s c 0 0 u yi u (2.13) yi = . 0 0 c s u xj ux j 0 0 s c u yj uyj The 4 4 matrix that appears above is called a displacement transformation matrix and is denoted7 by T. The node forces transform as f xi = fxi c fyi s , etc., which in matrix form become f xi c f yi s = 0 fx j 0 fyj s c 0 0 0 0 0 0 c s s c fxi fyi . fx j fy j
(2.14)
The 4 4 matrix that appears above is called a force transformation matrix. A comparison of (2.13) and (2.14) reveals that the force transformation matrix is the transpose TT of the displacement transformation matrix T. This relation is not accidental and can be proved to hold generally.8
7 8
This matrix will be called Td when its association with displacements is to be emphasized, as in Exercise 2.5. A simple proof that relies on the invariance of external work is given in Exercise 2.5. However this invariance was only checked by explicit computation for a truss member in Exercise 2.4. The general proof relies on the Principle of Virtual Work, which is discussed later.
210
211
2.8
ASSEMBLY: GLOBALIZATION
Remark 2.3. Note that in (2.13) the local system (barred) quantities appear on the left-hand side, whereas in
(2.14) they show up on the right-hand side. The expressions (2.13) and and (2.14) are discrete counterparts of what are called covariant and contravariant transformations, respectively, in continuum mechanics. The continuum counterpart of the transposition relation is called adjointness. Colectively these relations, whether discrete or continuous, pertain to the subject of duality.
Remark 2.4. For this particular structural element T is square and orthogonal, that is, TT = T1 . But this
property does not extend to more general elements. Furthermore in the general case T is not even a square matrix, and does not possess an ordinary inverse. However the congruent transformation relations (2.15)(2.17) do hold generally.
2.8.2. Transformation to Global System From now on we reintroduce the member (element) index, e. The member stiffness equations in global coordinates will be written (2.15) f e = K e ue . The compact form of (2.13) and (2.14) for the eth member is e = T e ue , u e. fe = (Te )T f (2.16)
e e e and comparing with (2.15) we nd that the member Inserting these matrix expressions into f =K u e in the local system stiffness in the global system {x , y } can be computed from the member stiffness K {x , y } through the congruent transformation9
e Te . Ke = (Te )T K Carrying out the matrix multiplications in closed form (Exercise 2.8) we get c2 E A sc Ke = 2 c Le sc
e e
(2.17)
sc s2 sc s 2
c2 sc c2 sc
sc s 2 , sc s2
(2.18)
in which c = cos e , s = sin e , with e superscripts of c and s suppressed to reduce clutter. If the angle is zero we recover (2.10), as may be expected. Ke is called a member stiffness matrix in global coordinates. The proof of (2.17) and verication of (2.18) is left as Exercise 2.8. The globalized member stiffness matrices for the example truss can now be easily obtained by inserting appropriate values into (2.18). For member (1), with end joints 12, angle (1) = 0 and the member properties given in Figure 2.4(a) we get f (1) x1 1 (1) f y1 0 f (1) = 10 1 x2 1) 0 f y(2
9
0 0 0 0
1) u( x1 1 0 1) u( 0 0 y1 (1) . 1 0 ux2 1) 0 0 u( y2
(2.19)
Also known as congruential transformation and congruence transformation in linear algebra books.
211
212
For member (2), with end joints 23, and angle (2) = 90 : f (2) x2 0 (2) f y2 0 f (2) = 5 0 x3 2) 0 f y(3 f (3) x1 0.5 (3) f y1 0.5 f (3) = 20 0.5 x3 3) 0.5 f y(3
2) u( x2 0 0 0 2) u( 1 0 1 y2 (2) . 0 0 0 ux3 2) 1 0 1 u( y3
(2.20)
Finally, for member (3), with end joints 13, and angle (3) = 45 :
3) u( x1 0.5 0.5 0.5 3) u( 0.5 0.5 0.5 y1 (3) . 0.5 0.5 0.5 ux3 3) 0.5 0.5 0.5 u( y3
(2.21)
In the following Chapter we will complete the main DSM steps by putting the truss back together through the merge step, and solving for the unknown forces and displacements.
Notes and Bibliography The Direct Stiffness Method has been the dominant FEM version since the mid-1960s, and is the procedure followed by all major commercial codes in current use. The general DSM was developed at Boeing in the early 1950s, through the leadership of Jon Turner [254257], and had defeated its main competitor, the Force Method, by 1970 [88]. All applications-oriented FEM books cover the DSM, although the procedural steps are sometimes not clearly delineated. In particular, the textbooks recommended in 1.7.6 offer adequate expositions. Trusses, also called bar assemblies, are usually the rst structures treated in Mechanics of Materials books written for undergraduate courses in Aerospace, Civil and Mechanical Engineering. Two widely used books at this level are [19] and [200]. Steps in the derivation of stiffness matrices for truss elements are well covered in a number of early treatment of nite element books, of which Chapter 5 of Przemieniecki [204] is a good example. Force and displacement transformation matrices for structural analysis were introduced by G. Kron [152]. References Referenced items have been moved to Appendix R.
212
213
Homework Exercises for Chapter 2 The Direct Stiffness Method I
Exercises
EXERCISE 2.1 [D:10] Explain why arbitrarily oriented mechanical loads on an idealized pin-jointed truss
structure must be applied at the joints. [Hint: idealized truss members have no bending resistance.] How about actual trusses: can they take loads applied between joints?
EXERCISE 2.2 [A:15] Show that the sum of the entries of each row of the master stiffness matrix K of any
plane truss, before application of any support conditions, must be zero. [Hint: apply translational rigid body motions at nodes.] Does the property hold also for the columns of that matrix?
EXERCISE 2.3 [A:15] Using matrix algebra derive (2.10) from (2.8) and (2.9). Note: Place all equations in
matrix form rst and eliminate d and F by matrix multiplication. Deriving the nal form with scalar algebra and rewriting it in matrix form gets no credit. = F d. EXERCISE 2.4 [A:15] By direct multiplication verify that for the truss member of Figure 2.7(a), f u
T
Intepret this result physically. (Hint: what is a force times displacement in the direction of the force?)
EXERCISE 2.5 [A:20] The transformation equations between the 1-DOF spring and the 4-DOF generic truss
T = F d proven in the previous exercise, and f u where Td is 1 4 and T f is 4 1. Starting from the identity T using compact matrix notation, show that T f = Td . Or in words: the displacement transformation matrix and the force transformation matrix are the transpose of each other. (This can be extended to general systems)
EXERCISE 2.6 [A:20] Derive the equivalent spring formula F = ( E A / L ) d of (2.8) by the Theory of Elasticity
relations e = d u (x )/d x (strain-displacement equation), = Ee (Hookes law) and F = A (axial force denition). Here e is the axial strain (independent of x ) and the axial stress (also independent of x ). Finally, u (x ) denotes the axial displacement of the cross section at a distance x from node i , which is linearly interpolated as x x u (x ) = u xi 1 (E2.2) +u xj L L
Justify that (E2.2) is correct since the bar differential equilibrium equation: d [ A(d /d x )]/d x = 0, is veried for all x if A is constant along the bar.
EXERCISE 2.7 [A:20] Derive the equivalent spring formula F = ( E A / L ) d of (2.8) by the principle of
Minimum Potential Energy (MPE). In Mechanics of Materials it is shown that the total potential energy of the axially loaded bar is
L
1 2 0
A e dx Fd ,
(E2.3)
where symbols have the same meaning as the previous Exercise. Use the displacement interpolation (E2.2), the strain-displacement equation e = d u /d x and Hookes law = Ee to express as a function (d ) of the relative displacement d only. Then apply MPE by requiring that / d = 0.
e eu e = K f by an appropriate matrix). Then check by hand that using that formula you get (2.18). Falks scheme is recommended for the multiplications.10
eu e , (2.15) and (2.17). (Hint: premultiply both sides of e = f EXERCISE 2.8 [A:20] Derive (2.17) from K
10
213
214
EXERCISE 2.9 [D:5] Why are disconnection and localization labeled as conceptual steps in Figure 2.5? EXERCISE 2.10 [C:20] (Requires thinking) Notice that the expression (2.18) of the globalized bar stiffness matrix may be factored as
c2 A E sc Ke = c2 Le sc
e e
sc s2 sc s 2
c2 sc c2 sc
sc c s 2 s E e Ae = [ c sc c L e s s2
s]
(E2.4)
Interpret this relation physically as a chain of global-to-local-to-global matrix operations: global displacements axial strain, axial strain axial force, and axial force global node forces.
214
Introduction to FEM
IFEM Ch 2 Slide 1
Introduction to FEM
IFEM Ch 2 Slide 2
Introduction to FEM
IDEALIZATION
DISCRETIZATION
SOLUTION
Physical system
Mathematical model
FEM
Discrete model
Discrete solution
IFEM Ch 2 Slide 3
Introduction to FEM
Idealization Process
Physical System
member support joint
IDEALIZATION
;; ;; ;;
IFEM Ch 2 Slide 4
;; ;; ;;
Introduction to FEM
;; ;;
Remove loads & supports: Disassemble:
;; ;;
battens longerons diagonals longerons
IFEM Ch 2 Slide 5
Introduction to FEM
Merge:
; ;
Solve for joint displacements:
; ;
IFEM Ch 2 Slide 6
; ;
; ;
Introduction to FEM
The Direct Stiffness Method (DSM) Steps Starting with: Idealization Breakdown (Chapter 2)
Disconnection
Localization Member (Element) Formation
IFEM Ch 2 Slide 7
Introduction to FEM
Too complicated to do by hand. We will use a simpler one to illustrate DSM steps
IFEM Ch 2 Slide 8
Introduction to FEM
IFEM Ch 2 Slide 9
Introduction to FEM
fx3, u x3
(3) (3)
L = 10 E (2) A (2) = 50
(2)
y fx1, u x1
1
x
L
(1)
(1)
fx2, u x2
2
fy1, u y1
fy2, u y2
IFEM Ch 2 Slide 10
Introduction to FEM
The Example Truss - FEM Model BCs: Applied Loads and Supports Saved for Last
f y3 = 1
3
fx3 = 2
;; ;; ;;
IFEM Ch 2 Slide 11
;; ;; ;;
Introduction to FEM
ux1 u y1 u x2 u= u y2 u x3 u y3 K x 1x 2 K y 1x 2 K x 2x 2 K y 2x 2 K x 3x 2 K y 3x 2 K x 1y2 K y1y2 K x 2y2 K y2y2 K x 3y2 K y3y2 K x 1x 3 K y 1x 3 K x 2x 3 K y 2x 3 K x 3x 3 K y 3x 3 K x 1y3 ux1 K y1y3 u y1 K x 2y3 ux2 K y2y3 u y2 K x 3y3 u x 3 K y3y3 u y3
Nodal forces
f = Ku
Nodal displacements
IFEM Ch 2 Slide 12
Introduction to FEM
xi yi K yi yi K x j yi K y j yi K
xi x j K yi x j K xjxj K yjx j K
xi y j u K xi yi y j u K yi x jyj u xj K u yj yjyj K
IFEM Ch 2 Slide 13
Introduction to FEM
y (3)
x (3) (3)
_
y 1 x
y(1) (1) 2
IFEM Ch 2 Slide 14
Introduction to FEM
_
y
_
x j
F
L d
IFEM Ch 2 Slide 15
Introduction to FEM
1 f xi EA 0 fyi = 1 fx j L 0 fy j
from which
0 0 0 0 0 0 0 0
1 EA 0 K= 1 L 0
IFEM Ch 2 Slide 16
Introduction to FEM
IFEM Ch 2 Slide 17
Introduction to FEM
uyj
uxj
y y
uyi
_
x
_
uxj
u yi
uxi uxi
u yi = u xi s + u yi c u y j = u x j s + u y j c
in which
c = cos
s = sin
IFEM Ch 2 Slide 18
Introduction to FEM
c s = 0 0
s c 0 0
0 0 c s
0 0 s c
or
_e
Te u e
IFEM Ch 2 Slide 19
Introduction to FEM
fyj
fyj
fxj
j
fyi
_
fxj
fyi
fxi
fxi
_
0 0 s c
= (T ) f
_ e T e
IFEM Ch 2 Slide 20
Introduction to FEM
u e = T e ue
f e = ( T e) T f e
Exercise 2.8
K e = ( T e )T K T e c2 sc 2 c sc sc s2 sc s 2 c2 sc c2 sc sc s 2 sc s2
e e A E e K = Le
IFEM Ch 2 Slide 21
Introduction to FEM
fx3, u x3
(3) (3)
L = 10 E (2) A (2) = 50
(2)
y fx1, u x1
1
x
L
(1)
(1)
fx2, u x2
2
fy1, u y1
fy2, u y2
Insert the geometric & physical properties of this model into the globalized member stiffness equations
IFEM Ch 2 Slide 22
Introduction to FEM
IFEM Ch 2 Slide 23
215
Homework Exercises for Chapter 2 The Direct Stiffness Method I Solutions
Solutions to Exercises
EXERCISE 2.1 Loads applied between truss joints will generally have components acting transversely to the
member axis. Transversal components cause bending, which by hypothesis cannot be resisted by the members of an idealized truss. (Members of actual trusses do have nite bending resistance but it is better not to call upon this property in the design process, except to resist own weight.)
EXERCISE 2.2 Take as node displacements u xi = u yi = 1 for i = 1, 2, . . . N , where N is the number of truss
joints (nodes). Each force component in f = Ku is then a K row sum. This force must vanish because those displacements are associated with a translational rigid body motion: {u x = 1, u y = 1} of the free-free truss structure.11 Answering for the example truss or a single element is OK.
F = fx j = fxi ,
d=u xj u xi ,
(E2.5)
in which F and d are connected by (2.8), namely F = ( E A / L )d . Express the foregoing two equations in matrix form bringing up also the y nodal displacements by introducing zeros as appropriate in the vectors: f 1 1 u xi xi EA 0 xj fyi 0 u xj u xi = [ 1 0 1 0 ] . (E2.6) f = 1 F = 1 d, d = u u xj L xj 0 0 u yj fy j and combine theses two as matrix product: f 1 xi fyi E A 0 f = 1 [ 1 0 1 L xj 0 fy j u xi 1 EA 0 xj u = 0] 1 u xj L 0 u yj
0 0 0 0
1 0 1 0
0 u xi 0u xj , xj 0u 0 u yj
(E2.7)
which is equation (2.10). This Mechanics of Materials matrix-avored technique is used in Chapter 5 to derive other structural elements.
EXERCISE 2.4
(E2.8)
This equation expresses the invariance of external energy in two different bases.
EXERCISE 2.5 If f = F T f = T f F , transposing both sides gives f = F TT f . Then
T = F TT , f u fu T
. Fd = F Td u
(E2.9)
= Fd , checked in the last exercise, we equate the right hand sides of the two Imposing energy invariance f u previous expressions: = F Td u . F TT (E2.10) fu are arbitrary we must have Because F and u TT f = Td , or
T T f = Td .
(E2.11)
11
Recall that the master stiffness equations of a plane truss relates node forces and displacements of a structure with all supports removed. Such oating structure may experience rigid body motions in the {x , y } plane.
215
216
the axial stress and axial strain e = / E = d u /d x . Therefore the displacement u must vary linearly in x , and the interpolation (E2.2) is correct. Differentiating it gives e = (u x j u xi )/ L = d / L , which combined with = Ee = Ed / L and F = A = E Ad / L = ks d yields ks = E A / L . [This argument may be reversed: assume (E2.2) is correct; it gives constant strain e and constant stress = Ee; thus it satises the bar equations identically.] /d x = (u x j u xi )/ L = d / L . Hookes law gives = Ee = EXERCISE 2.7 From (E2.2) one gets e = d u Ed / L . Both e and do not depend on x . Substitution into (E2.3) gives
L
EXERCISE 2.6 The bar equilibrium equation is satised by a constant A . Because A is constant, so are
1 2 0
EA 2 EA 2 d dx Fd = d 2 L 2L 2
dx Fd =
0
EA 2 d Fd . 2L
(E2.12)
EA = d F = 0, d L
(E2.13)
whence F = ( E A / L ) d follows.
e eu e = EXERCISE 2.8 Premultiply both sides of K f by (Te )T : e eu e. (Te )T f = (Te )T K
(E2.14)
e , the preceding equation e = Te ue and f e = (Te )T f Using the transformation equations in (2.16), namely u becomes e Te ] ue def f e = [(Te )T K = Ke ue . (E2.15) Identifying Ke with the triple matrix product in brackets yields (2.17). For the truss member the transformation matrices are (2.13) and (2.14). The triple product involved in the congruent transformation may be conveniently carried out through Falks scheme (Appendix B):
1 E e Ae 0 1 Le 0
0 0 0 0 s c 0 0
1 0 1 0 0 0 c s
0 0 0 0 0 0 s c
c s 0 0
s c 0 0 s 0 s 0 sc s2 sc s 2
0 0 c s c 0 c 0 c2 sc c2 sc
0 0 s c
= Te
c s 0 0
c 0 c 0
s 0 s 0
E e Ae e Te =K e L (E2.16)
c2 sc c2 sc
sc E e Ae s 2 e = Ke , sc L s2
analysts mind.
216
31
32
TABLE OF CONTENTS
Page
3.1. 3.2.
3.3.
3.4.
3.5.
3.6.
3. 3. 3. 3.
The Remaining DSM Steps Assembly: Merge 3.2.1. Governing Rules . . . . . . . . . . . . 3.2.2. Hand Assembly by Augmentation and Merge . . Solution 3.3.1. Applying Displacement BCs by Reduction . . . . 3.3.2. Solving for Displacements . . . . . . . . PostProcessing 3.4.1. Recovery of Reaction Forces . . . . . . . . 3.4.2. Recovery of Internal Forces and Stresses . . . . 3.4.3. *Reaction Recovery: General Case . . . . . . *Computer Oriented Assembly and Solution 3.5.1. *Assembly by Freedom Pointers . . . . . . 3.5.2. *Applying DBC by Modication . . . . . . . Prescribed Nonzero Displacements 3.6.1. Application of Nonzero-DBCs by Reduction . . 3.6.2. *Application of Nonzero-DBCs by Modication . . 3.6.3. *Matrix Forms of Nonzero-DBC Application Methods Notes and Bibliography . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . Solutions to . Exercises . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
33 33 33 34 36 36 37 37 37 38 39 39 310 310 311 311 312 313 314 314 316 318
32
3.2
ASSEMBLY: MERGE
Chapter 2 covered the initial stages of the DSM. The three breakdown steps: disconnection, localization and formation of member stiffness take us down all the way to the generic truss element: the highest level of fragmentation. This is followed by the assembly process. Assembly involves merging the stiffness equations of each member into the global stiffness equations. For this to make sense, the member equations must be referred to a common coordinate system, which for a plane truss is the global Cartesian system {x , y }. This is done through the globalization process covered in 2.8. On the computer the formation, globalization and merge steps are done concurrently, member by member. After all members are processed we have the free-free master stiffness equations. Next comes the solution. This process embodies two substeps: application of boundary conditions and solution for the unknown joint displacements. To apply the BCs, the free-free master stiffness equations are modied by taking into account which components of the joint displacements and forces are given and which are unknown. The modied equations are submitted to a linear equation solver, which returns the unknown joint (node) displacements. As discussed under Notes and Bibliography, on some FEM implementations especially programs written in the 1960s and 1970s one or more of the foregoing operations are done concurrently. The solution step completes the DSM proper. Postprocessing steps may follow, in which derived quantities such as internal forces and stresses are recovered from the displacement solution. 3.2. Assembly: Merge 3.2.1. Governing Rules The key operation of the assembly process is the placement of the contribution of each member to the master stiffness equations. The process is technically called merge of individual members. The merge operation can be physically interpreted as reconnecting that member in the process of fabricating the complete structure. For a truss structure, reconnection means inserting the pins back into the joints. See Figure 3.1. Merge logic is mathematically governed by two rules of structural mechanics:
(3) y 1 x (1) 2 (2) 3
Figure 3.1. The disconnected example truss prior to merge. All member stiffness equations are in the global system. Reconnecting the truss means putting the pins back into the joints.
1. 2.
Compatibility of displacements: The displacement of all members meeting at a joint are the same. Force equilibrium: The sum of forces exerted by all members that meet at a joint balances the external force applied to that joint. (3.1)
33
34
(a)
3) f( 3
2) f( 3
f3
(b)
3) f( 3
3
2) f( 3
(3)
(2)
Figure 3.2. The force equilibrium of joint 3 of the example truss, depicted as a free body diagram in (a). Here f3 is the known external joint force applied on the joint. Joint forces 2) (3) f( 3 and f3 are applied by the joint on the members, as illustrated in (b). Consequently 2) (3) the forces applied by the members on the joint are f( 3 and f3 . These forces would act in the directions shown in (a) if both members (2) and (3) were in tension. The 2) (3) (2) (3) free-body equilibrium statement is f3 f( 3 f3 = 0 or f3 = f3 + f3 . This translates (2) (3) (2) (3) into the two component equations: f x 3 = f x 3 + f x 3 and f y 3 = f y 3 + f y 3 , of (3.2).
The rst rule is physically obvious: reconnected joints must move as one entity. The second one can be visualized by considering a joint as a free body, although care is required in the interpretation of joint forces and their signs. Notational conventions to this effect are explained in Figure 3.2 for joint 3 of the example truss, at which members (2) and (3) meet. Application of the foregoing rules at this particular joint gives Rule 1: Rule 2:
2) (3) u( x3 = ux3 , 2) (3) u( y3 = u y3 .
2) 3) 1) 2) 3) f y 3 = f y(3 + f y(3 = f y(3 + f y(3 + f y(3 . (3.2) 1) 2) 3) 1) 2) 3) to f x(3 + f x(3 and of and f y(3 to f y(3 + f y(3 , respectively, changes nothing The addition of f x(3 because member (1) is not connected to joint 3. We are just adding zeros. But this augmentation enables us to write the key matrix relation:
(3.3)
To directly visualize how the two rules (3.1) translate to merging logic, we rst augment the member stiffness relations by adding zero rows and columns as appropriate to complete the force and displacement vectors. For member (1):
1) f x(1 10 (1) f y1 0 1) f x(2 10 1) = 0 f y(2 (1) 0 fx3 0 1) f y(3
0 0 0 0 0 0
10 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0 34
(3.4)
ASSEMBLY: MERGE
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 5 0 5
0 0 0 0 0 0
(3.5)
10 10 0 0 10 10
0 0 0 0 0 0 0 0 0 0 0 0
10 10 0 0 10 10
(3.6)
According to the rst rule, we can drop the member identier in the displacement vectors that appear in the foregoing matrix equations. Hence the reconnected member equations are (1) fx1 10 0 10 0 0 0 ux1 ( 1 ) f y1 0 0 0 0 0 u y1 0 f (1) x 2 10 0 10 0 0 0 u x 2 (3.7) , (1) = 0 0 0 0 0 u y2 f y2 0 (1) ux3 0 0 0 0 0 0 f x3 u y3 0 0 0 0 0 0 1) f y(3 (2) fx1 0 0 0 0 0 0 ux1 ( 2 ) f y1 0 0 0 0 0 0 u y1 f (2) x2 0 0 0 0 0 0 ux2 (3.8) , (2) = f y 2 0 0 0 5 0 5 u y 2 (2) ux3 0 0 0 0 0 0 f x3 u y3 0 0 0 5 0 5 2) f y(3 (3) fx1 10 10 0 0 10 10 ux1 ( 3 ) f y1 10 0 0 10 10 u y 1 10 f (3) 0 0 0 0 0 ux2 x2 0 (3.9) . (3) = 0 0 0 0 0 u y2 f y2 0 (3) ux3 10 10 0 0 10 10 f x3 u y3 10 10 0 0 10 10 3) f y(3 These three equations can be represented in direct matrix notation as f(1) = K(1) u, f(2) = K(2) u, 35 f(3) = K(3) u. (3.10)
36
According to the second rule, expressed in matrix form as (3.3), we have f = f(1) + f(2) + f(3) = K(1) + K(2) + K(3) u = K u, (3.11)
so all we have to do is add the three stiffness matrices that appear above, and we arrive at the master stiffness equations: fx1 20 f y 1 10 f x 2 10 = f y2 0 fx3 10 f y3 10 10 10 0 0 10 10 10 0 10 0 0 0 0 0 0 5 0 5 10 10 0 0 10 10 10 ux1 10 u y 1 0 ux2 . 5 u y 2 ux3 10 u y3 15
(3.12)
Using this technique member merging becomes simply matrix addition. This explanation of the assembly process is conceptually the easiest to follow and understand. It is virtually foolproof for hand computations. However, this is not the way the process is carried out on the computer because it would be enormously wasteful of storage for large systems. A computer-oriented procedure is discussed in 3.5. 3.3. Solution Having formed the master stiffness equations we can proceed to the solution phase. To prepare the equations for a linear solver we need to separate known and unknown components of f and u. In this Section a technique suitable for hand computation is described. 3.3.1. Applying Displacement BCs by Reduction If one attempts to solve the system (3.12) numerically for the displacements, surprise! The solution blows up because the coefcient matrix (the master stiffness matrix) is singular. The mathematical interpretation of this behavior is that rows and columns of K are linear combinations of each other (see Remark 3.1 below). The physical interpretation of singularity is that there are unsuppressed rigid body motions: the truss still oats in the {x , y } plane. To eliminate rigid body motions and render the system nonsingular we must apply the physical support conditions as displacement boundary conditions. From Figure 2.4(b) we observe that the support conditions for the example truss are u x 1 = u y 1 = u y 2 = 0, whereas the known applied forces are f x 2 = 0, f x 3 = 2, f y 3 = 1. (3.14) (3.13)
When solving the overall stiffness equations by hand, the simplest way to account for support conditions is to remove equations associated with known joint displacements from the master system. To apply (3.13) we have to remove equations 1, 2 and 4. This can be systematically 36
37
3.4
POSTPROCESSING
accomplished by deleting or striking out rows and columns number 1, 2 and 4 from K and the corresponding components from f and u. The reduced three-equation system is 10 0 0 0 10 10 0 10 15 ux2 ux3 u y3 = fx2 fx3 f y3 = 0 2 . 1 (3.15)
Equation (3.15) is called the reduced master stiffness system. The coefcient matrix of this system is no longer singular.
r = 3 and a rank deciency of d = N r = 6 3 = 3 (these concepts are summarized in Appendix C.) The dimension of the null space of K is d = 3. This space is spanned by three independent rigid body motions: the two rigid translations along x and y and the rigid rotation about z .
Remark 3.2. Conditions (3.13) represent the simplest type of support conditions, namely specied zero displacements. More general constraint forms, such as prescribed nonzero displacements and multifreedom constraints, are handled as described in 3.6 and Chapters 89, respectively. Remark 3.1. In mathematical terms, the free-free master stiffness matrix K in (3.12) has order N = 6, rank
3.3.2. Solving for Displacements Solving the reduced system by hand (for example, via Gauss elimination) yields ux2 ux3 u y3 = 0 0.4 . 0.2 (3.16)
This is called a partial displacement solution (also reduced displacement solution) because it excludes known displacement components. This solution vector is expanded to six components by including the three specied values (3.13) in the appropiate slots: ux1 0 u y1 0 u 0 u = x2 = . u y2 0 0.4 ux3 0.2 u y3 This is the complete displacement solution, or simply the displacement solution. 3.4. PostProcessing The last processing step of the DSM is the solution for joint displacements. But often the analyst needs information on other mechanical quantities; for example the reaction forces at the supports, or the internal member forces. Such quantities are said to be derived because they are recovered from the displacement solution. The recovery of derived quantities is part of the so-called postprocessing steps of the DSM. Two such steps are described below. 37
(3.17)
38
3.4.1. Recovery of Reaction Forces Premultiplying the complete displacement solution (3.17) by K we get 20 10 10 0 10 10 0 2 10 0 0 10 10 0 2 10 0 10 0 0 0 0 0 10 f = Ku = (3.18) = 0 0 5 0 5 0 1 0 0.4 2 10 10 0 0 10 10 0.2 1 10 10 0 5 10 15 This vector recovers the known applied forces (3.14) as can be expected. Furthermore we get three reaction forces: f x 1 = f y 1 = 2 and f y 2 = 1 that are associated with the support conditions (3.13). It is easy to check that the complete force system is in self equilibrium for the free-free structure; this is the topic of Exercise 3.1. For a deeper look at reaction recovery, study 3.4.3. 3.4.2. Recovery of Internal Forces and Stresses Often the structural engineer is not so much interested in displacements as in internal forces and stresses. These are in fact the most important quantities for preliminary structural design. In pinjointed trusses the only internal forces are the axial member forces. For the example truss these forces, denoted by F (1) , F (2) and F (3) , are depicted in Figure 3.3. The average axial stress e is obtained on dividing F e by the cross-sectional area of the member. 3 The axial force F e in member e can be obtained as follows. Extract the displacements of member e from the complete displacement solution u to form ue . Then F (3) e = Te ue . recover local joint displacements from u F (2) Compute the member elongation d e (relative axial displacement) and recover the axial force from the equivalent spring constitutive relation: E e Ae e e e e u , F = d . (3.19) de = u xj xi Le e e Note that u e yi and u y j are not needed in computing d .
F (1)
Figure 3.3. Internal forces for the example truss are the member axial forces F (1) , F (2) and F (3) . Force arrow directions shown pertain to tension.
the global displacements of the member from (3.17): u(2) = [ u x 2 u y 2 u x 3 u y 3 ]T = [ 0 0 0.4 0.2 ]T . (2) = T(2) u(2) : Convert to local displacements using u
Example 3.1. Recover F (2) in example truss. Member (2) goes from node 2 to node 3 and (2) = 90 . Extract
u x2 cos 90 sin 90 0 0 ux2 0 y 2 sin 90 cos 90 0 0 u y 2 1 u = = u x3 0 0 cos 90 sin 90 u x 3 0 u y3 0 0 sin 90 cos 90 u y3 0 x3 u x2 The member elongation is d (2) = u compressive axial force.
0 0 0 0 0 0 = . 1 0.4 0.2 0 0.2 0.4 (3.20) = 0.2 0 = 0.2, whence F (2) = (50/10) (0.2) = 1, a
1 0 0 0
0 0 0 1
strain, e = E e ee as (average) axial stress, and F e = Ae e as the axial force. This is more in tune with the Theory of Elasticity viewpoint discussed in Exercise 2.6.
Remark 3.3. An alternative interpretation of (3.19) is to regard ee = d e / L e as the (average) member axial
38
39
3.4.3. *Reaction Recovery: General Case Node forces at supports recovered from f = Ku, where u is the complete displacement solution, were called reactions in 3.4.1. Although the statement is correct for the example truss, it oversimplies the general case. To cover it, consider f as the superposition of applied and reaction forces: K u = f = fa + fr. (3.21)
Here f a collects applied forces, which are known before solving, whereas f r collects unknown reaction forces to be recovered in post-processing. Entries of f r that are not constrained are set to zero. For the example truss, f 0 f 2 0 2 x1 x1 f y1 0 f y1 2 0 2 0 0 0 upon recovery 0 0 0 upon assembly f= f= f y2 = 0 + f y2 1 = 0 + 1 . (3.22) 2 0 2 2 2 0 1 0 1 1 1 0 a r There is a clean separation in (3.22). Every nonzero entry in f comes from either f or f . This allows us to interpret f x 1 = f xr1 , f y 1 = f yr1 and f y 2 = f yr2 as reactions. If nonzero applied forces act directly on supported freedoms, however, a reinterpretation is in order. This often occurs when distributed loads such as pressure or own weight are lumped to the nodes. The adjustment can be more easily understood by following the simple example illustrated in Figure 3.4.
;; ;;
;;
(a) E, A constant
L
(b)
x
1 qL/4 1
L/2
q (uniform)
2 qL/2
3 qL/4
(c) qL 1 qL/4
2 qL/2
3 qL/4
L/2
Figure 3.4. A simple problem to illustrate reaction recovery of support reactions when nonzero applied loads act on supports. (a) bar under distributed load; (b) two-element FEM idealization; (c) free body diagram showing applied node forces in blue and support reaction in red.
The xed-free prismatic bar pictured in Figure 3.4(a) is subjected to a uniformly line load q per unit length. The bar has length L , elastic modulus E and cross-section area A. It is discretized by two equal-size elements as shown in Figure 3.4(b). The three x node displacements u 1 = u x 1 , u 2 = u x 2 and u 3 = u x 3 are taken as q L , f 2a = 1 q L and f 3a = 1 q L at degrees of freedom. The line load is converted to node forces f 1a = 1 4 2 4 nodes 1, 2 and 3, respectively, using the EbE method discussed in Chapter 7. The master stiffness equations congured as per (3.21) are 1 1 0 u1 fr 1 qL 1 (3.23) u2 = f = f a + f r = 1 2 1 2 + 0 . 4 u3 0 0 1 1 1 Applying the displacement BC u 1 = 0 and solving gives u 2 = 3q L /(8 E A) and u 3 = q L /(2 E A). Force recovery yields 2E A L 3 q L q L 3 qL 1 . (3.24) 2 , fr = f fa = 2 2 = 0 4 4 1 1 1 0 The xed-end reaction emerges as f 1r = q L , the correctness of which may be veried on examining the FBD of Figure 3.4(c). Note that taking f 1 = 3q L /4 as reaction would be in error by 25%. This general recovery procedure should always be followed when reaction values are used in the design of structural supports. f = Ku = qL 4
39
310
3.5.
3.5.1. *Assembly by Freedom Pointers The practical computer implementation of the DSM assembly process departs signicantly from the augment and add technique described in 3.2.2. There are two major differences: (I) Member stiffness matrices are not expanded. Their entries are directly merged into those of K through the use of a freedom pointer array called the Element Freedom Table or EFT.
(II) The master stiffness matrix K is stored using a special format that takes advantage of symmetry and sparseness. Difference (II) is a more advanced topic that is deferred to the last part of the book. For simplicity we shall assume here that K is stored as a full square matrix, and study only (I). For the example truss the freedom-pointer technique expresses the entries of K as the sum
3
K pq =
e=1
K iej
(3.25)
denote the entries of the 4 4 globalized member stiffness matrices in (2.19) through (2.21). Entries Here K pq that do not get any contributions from the right hand side remain zero. EFTe denotes the Element Freedom Table for member e. For the example truss these tables are K iej EFT(1) = {1, 2, 3, 4}, EFT(2) = {3, 4, 5, 6}, EFT(3) = {1, 2, 5, 6}. (3.26)
Physically these tables map local freedom indices to global ones. For example, freedom number 3 of member (2) is u x 3 , which is number 5 in the master equations; consequently EFT(2) (3) = 5. Note that (3.25) involves three nested loops: over e (outermost), over i , and over j . The ordering of the last two is irrelevant. Advantage may be taken of the symmetry of Ke and K to roughly halve the number of additions. Exercise 3.5 follows the scheme (3.25) by hand. The assembly process for general structures using this technique is studied in Chapter 25. 3.5.2. *Applying DBC by Modication In 3.3.1 the support conditions (3.13) were applied by reducing (3.12) to (3.15). Reduction is convenient for hand computations because it cuts down on the number of equations to solve. But it has a serious aw for computer implementation: the equations must be rearranged. It was previously noted that on the computer the number of equations is not the only important consideration. Rearrangement can be as or more expensive than solving the equations, particularly if the coefcient matrix is stored in sparse form or on secondary storage.1 To apply support conditions without rearranging the equations we clear (set to zero) rows and columns corresponding to prescribed zero displacements as well as the corresponding force components, and place ones on the diagonal to maintain non-singularity. The resulting system is called the modied set of master stiffness equations. For the example truss this approach yields
1 0 0 0 0 1 0 0 0 0 10 0 0 0 0 1
0 0 0 0 0 0 0 0
0 0 0 0 10 10
(3.27)
On most modern computers, reading a oating-point number from memory at a random address takes 100 to 1000 times as long as performing a oating-point arithmetic operation on numbers that are already in registers.
310
311
3.6
in which rows and columns for equations 1, 2 and 4 have been cleared. Solving this modied system produces the complete displacement solution (3.17) directly.
Remark 3.4. In a smart stiffness equation solver the modied system need not be explicitly constructed by
storing zeros and ones. It is sufcient to mark the equations that correspond to displacement BCs. The solver is then programmed to skip those equations. However, if one is using a standard solver from, say, a library of scientic routines or a commercial program such as Matlab or Mathematica, such intelligence cannot be expected, and the modied system must be set up explicitly. fy3 = 1
3.6. Prescribed Nonzero Displacements The support conditions considered in the example truss resulted in the specication of zero displacement components; for example u y 2 = 0. There are cases, however, where the known value is nonzero. This happens, for example, in the study of settlement of foundations of ground structures such as buildings and bridges, and in the analysis of motion-driven machinery components. Mathematically these are called non-homogenous boundary conditions. The treatment of this generalization of the FEM equations is studied in the following subsections.
fx3 = 2
u y2 = +0.4 going up
;; ;;
1
u y 2 = 0.4
Figure 3.5. The example truss with prescribed nonzero vertical displacements at joints 1 and 2.
3.6.1. Application of Nonzero-DBCs by Reduction We describe rst a matrix reduction technique, analogous to that used in 3.3.1, which is suitable for hand computations. Recall the master stiffness equations (3.12) for the example truss: 20 10 10 0 10 10 ux1 fx1 10 0 0 10 10 u y 1 f y 1 10 10 0 10 0 0 0 ux2 fx2 (3.28) = 0 0 5 0 5 u y 2 f y 2 0 10 10 0 0 10 10 ux3 fx3 10 10 0 5 10 15 u y3 f y3 Suppose that the applied forces are again (3.14) but the prescribed displacements change to u x 1 = 0, u y 1 = 0.5, (3.29)
This means that joint 1 goes down vertically whereas joint 2 goes up vertically, as depicted in Figure 3.5. Inserting the known data into (3.28) we get 20 10 10 0 10 10 0 fx1 10 0 0 10 10 0.5 f y 1 10 0 10 0 0 0 ux2 0 10 (3.30) = 0 0 5 0 5 0.4 f y 2 0 10 10 0 0 10 10 2 ux3 u y3 10 10 0 5 10 15 1 311
;; ;;
312
The rst, second and fourth rows of (3.30) are removed, leaving only 0 0.5 10 0 10 0 0 0 u 10 10 0 0 10 10 x 2 = 0.4 10 10 0 5 10 15 ux3 u y3
0 2 1
(3.31)
Columns 1, 2 and 4 are removed by transferring all known terms from the left to the right hand side: 0 3 . 2 (3.32) These are the reduced stiffness equations. Note that its coefcient matrix of (3.32) is exactly the same as in the reduced system (3.15) for prescribed zero displacements. The right hand side, however, is different. It consists of the applied joint forces modied by the effect of known nonzero displacements. These are called the modied node forces or effective node forces. Solving the reduced system yields 0 ux2 (3.33) u x 3 = 0.5 . u y3 0.2 10 0 0 10 0 10 0 10 15 ux2 ux3 u y3 = = Filling the missing entries with the known values (3.29) yields the complete displacement solution (listed as row vector to save space): u = [0 0.5 0 0.4 0.5 0.2 ]T . (3.34) 0 2 1 (10) 0 + 0 (0.5) + 0 0.4 (10) 0 + (10) (0.5) + 0 0.4 (10) 0 + (10) (0.5) + (5) 0.4
Taking the solution (3.34) and going through the postprocessing steps discussed in 3.4, we can nd that reaction forces and internal member forces do not change. This is a consequence of the fact that the example truss is statically determinate. The force systems (internal and external) in such structures are insensitive to movements such as foundation settlements.
3.6.2. *Application of Nonzero-DBCs by Modication The computer-oriented modication approach follows the same idea outlined in 3.5.2. As there, the main objective is to avoid rearranging the master stiffness equations. To understand the process it is useful to think of being done in two stages. First equations 1, 2 and 4 are modied so that they become trivial equations, as illustrated for the example truss and the displacement boundary conditions (3.29):
1 0 10 0 10 10
0 0 1 0 0 10 0 0 10 0 10 0
(3.35)
The solution of this system recovers (3.30) by construction (for example, the fourth equation is simply 1 u y 2 = 0.4). In the next stage, columns 1, 2 and 4 of the coefcient matrix are cleared by transferring all known terms
312
313
to the right hand side, following the same procedure explained in (3.33). We thus arrive at
1 0 0 0 0 1 0 0 0 0 10 0 0 0 0 1
0 0 0 0 0 0 0 0
0 0 0 0 10 10
(3.36)
As before, these are called the modied master stiffness equations. Note that (3.36) retains the original number and order as well as matrix symmetry. Solving this system yields the complete displacement solution (3.34). If all prescribed displacements are zero, forces on the right hand side are not modied, and one would get (3.27) as may be expected.
Remark 3.5. The modication is not actually programmed as discussed above. First the applied forces
in the right-hand side are modied for the effect of nonzero prescribed displacements, and the prescribed displacements stored in the reaction-force slots. This is called the force modication step. Second, rows and columns of the stiffness matrix are cleared as appropriate and ones stored in the diagonal positions. This is called the stiffness modication step. It is essential that the procedural steps be executed in the indicated order, because stiffness terms must be used to modify forces before they are zeroed out. 3.6.3. *Matrix Forms of Nonzero-DBC Application Methods The reduction and modication techniques for applying DBCs can be presented in compact matrix form. First, the free-free master stiffness equations Ku = f are partitioned as follows: K11 K21 K12 K22 u1 u2 = f1 . f2 (3.37)
In this matrix equation, subvectors u2 and f1 collect displacement and force components, respectively, that are known, given or prescribed. Subvectors u1 and f2 collect force and displacement components, respectively, that are unknown. Forces in f2 represent reactions on supports; consequently f2 is called the reaction vector. On transferring the known terms to the right hand side the rst matrix equation becomes K11 u1 = f1 K12 u2 . (3.38)
This is the reduced master equation system. If the support B.C.s are homogeneous (that is, all prescribed displacements are zero), u2 = 0, and we do not need to change the right-hand side: K11 u1 = f1 . Examples that illustrate (3.38) and (3.39) are (3.32) and (3.27), respectively. The computer-oriented modication technique retains the same joint displacement vector as in (3.38) through the following rearrangement: K11 0 u1 f K12 u2 = 1 . (3.40) u2 u2 0 I This modied system is simply the reduced equation (3.38) augmented by the trivial equation Iu2 = u2 . This system is often denoted as Ku = f. (3.41) Solving (3.41) yields the complete displacement solution including the specied displacements u2 . (3.39)
313
314
For the computer implementation it is important to note that the partitioned form (3.37) is only used to allow use of compact matrix notation. In actual programming the equations are not explicitly rearranged: they retain their original numbers. For instance, in the example truss u1 = ux1 u y1 u y2 DOF #1 DOF #2 DOF #4 , u2 = ux2 ux3 u y3 DOF #3 DOF #5 DOF #6 . (3.42)
The example shows that u1 and u2 are generally interspersed throughout u. Thus, matrix operations such as K12 u2 involve indirect (pointer) addressing so as to avoid explicit array rearrangement. Notes and Bibliography The coverage of the assembly and solution steps of the DSM, along with globalization and application of BCs, is not uniform across the wide spectrum of FEM books. Authors have introduced quirks although the overall concepts are not affected. The most common variations arise in two contexts: (1) Some treatments apply support conditions during merge, explicitly eliminating known displacement freedoms as the elements are processed and merged into K. The output of the assembly process is what is called here a reduced stiffness matrix.2 In the frontal solution method of Irons [146,147], assembly and solution are done concurrently. More precisely, as elements are formed and merged, displacement boundary conditions are applied, and Gauss elimination and reduction of the right hand side starts once the assembler senses (by tracking an element wavefront) that no more elements contribute to a certain node.
(2)
Both variants appeared in FEM programs written during the 1960s and 1970s. They were motivated by computer resource limitations of the time: memory was scarce and computing time expensive.3 On the negative side, interweaving leads to unmodular programming (which easily becomes spaghetti code in lowlevel languages such as Fortran). Since a frontal solver has to access the element library, which is typically the largest component of a general-purpose FEM program, it has to know how to pass and receive information about each element. A minor change deep down the element library can propagate and break the solver. Squeezing storage and CPU savings on present computers is of less signicance. Modularity, which simplies scripting in higher order languages such as Matlab is desirable because it increases plug-in operational exibility, allows the use of built-in solvers, and reduces the chance for errors. These priority changes reect economic reality: human time is nowadays far more expensive than computer time. A side benet of modular assembly-solution separation is that often the master stiffness must be used in a different way than just solving Ku = f; for example in dynamics, vibration or stability analysis. Or as input to a model reduction process. In those cases the solution stage can wait. Both the hand-oriented and computer-oriented application of boundary conditions have been presented here, although the latter is still considered an advanced topic. While hand computations become unfeasible beyond fairly trivial models, they are important from a instructional standpoint. The augment-and-add procedure for hand assembly of the master stiffness matrix is due to H. Martin [170]. The general-case recovery of reactions, as described in 3.4.3, is not covered in any FEM textbook.
2 3
For the example truss, the coefcient matrix in (3.15) is a reduced stiffness whereas that in (3.27) is a modied one. As an illustration, the rst computer used by the writer, the classical mainframe IBM 7094, had a magnetic-core memory of 32,768 36-bit words ( 0.2 MB), and was as fast as an IBM PC of the mid 1980s. One mainframe, with the processing power of a cell phone, served the whole Berkeley campus. Ph.D. students were allocated 2 CPU hours per semester. Getting a moderately complex FE model through involved heavy use of slower secondary storage such as disk or tape in batch jobs.
314
315
References Referenced items have been moved to Appendix R.
3.
References
315
316
in 3.4.2 compute the axial forces in the three members EXERCISE 3.2 [A:15] Using the method presented of the example truss. Partial answer: F (3) = 2 2.
EXERCISE 3.3 [A:20] Describe an alternative method that recovers the axial member forces of the example truss from consideration of joint equilibrium, without going through the computation of member deformations. Can this method be extended to arbitrary trusses? EXERCISE 3.4 [A:20] Suppose that the third support condition in (3.13) is u x 2 = 0 instead of u y 2 = 0. Rederive the reduced system (3.15) for this case. Verify that this system cannot be solved for the joint displacements u y 2 , u x 3 and u y 3 because the reduced stiffness matrix is singular.4 Offer a physical interpretation of this failure. EXERCISE 3.5 [N:20] Construct by hand the free-free master stiffness matrix of (3.12) using the freedom-
pointer technique (3.25). Note: start from K initialized to the null matrix, then cycle over e = 1, 2, 3.
f y2 = 0
u y2
2
E , A(1)
ux2
fx2 = P
(1)
y x
(2)
E , A(2)
;;
1
(a) (b) (c) (d)
4
S /2
S /2
;;
3
S = 8, height H = 3, elastic modulus E = 1000, cross section areas A(1) = 2 and A(2) = 4, and horizontal crown force P = f x 2 = 12. Using the DSM carry out the following steps:
EXERCISE 3.6 [N:25] Consider the two-member arch-truss structure shown in Figure E3.1. Take span
Assemble the master stiffness equations. Any method: augment-and-add, or the more advanced freedom pointer technique explained in 3.5.1, is acceptable. Apply the displacement BCs and solve the reduced system for the crown displacements u x 2 and u y 2 . Partial result: u x 2 = 9/512 = 0.01758. Recover the node forces at all joints including reactions. Verify that overall force equilibrium (x forces, y forces, and moments about any point) is satised. Recover the axial forces in the two members. Result should be F (1) = F (2) = 15/2.
A matrix is singular if its determinant is zero; cf. C.2 of Appendix C for a refresher in that topic.
316
317
EXERCISE 3.7 [N:20] Resolve items (a) through (c)
Exercises
omitting (d) of the problem of Exercise 3.6 if the vertical right support sinks so that the displacement u y 3 is now prescribed to be 0.5. Everything else is the same. Use the matrix reduction scheme of 3.6.1 to apply the displacement BCs. Consider the truss problem dened in Figure E3.2. All geometric and material properties: L , , E and A, as well as the applied forces P and H , are to be kept as variables. This truss has 8 degrees of freedom, with six of them removable by the xed-displacement conditions at nodes 2, 3 and 4. Unlike previous examples, this structure is statically indeterminate as long as = 0. (a) Show that the master stiffness equations are
EXERCISE 3.8 [A/C:25]
EA L
2cs 2
0 1 + 2c3
cs 2 c2 s cs 2
c2 s c3 c2 s c3
0 0 0 1 0 0 0 0 0 0 1
; ; ; ; ; ;
x 2 L
(1)
3
(2)
4
(3)
cs 2 c2 s 0 0 0 0 cs 2
symm
(E3.1)
in which c = cos and s = sin . Explain from physics why the 5th row and column contain only zeros. (b) (c) (d) Apply the BCs and show the 2-equation modied stiffness system. Solve for the displacements u x 1 and u y 1 . Check that the solution makes physical sense for the limit cases 0 and /2. Why does u x 1 blow up if H = 0 and 0? Recover the axial forces in the three members. Partial answer: F (3) = H /(2s ) + Pc2 /(1 + 2c3 ). Why do F (1) and F (3) blow up if H = 0 and 0?
317
Introduction to FEM
IFEM Ch 3 Slide 1
Introduction to FE
Breakdown
Disconnection Localization Member (Element) Formation Globalization Merge Application of BCs Solution Recovery of Derived Quantities processing steps post-processing steps
conceptual steps
IFEM Ch 3 Slide 2
Introduction to FEM
To apply these rules in assembly by hand, it is convenient to expand or augment the element stiffness equations as shown for the example truss on the next slide.
IFEM Ch 3 Slide 3
Introduction to FEM
0 10 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0 0
y3
0 0 0 0 0 0
10 10 10 10 0 0 = 0 0 10 10 10 10
u(1) x1 0 (1) u 0 y1 u(1) 0 x2 (1) 0 u y2 0 u(1) x3 0 u (1) y3 u (2) x1 0 0 (2) u y1 0 0 u (2) 0 0 x2 (2) 0 5 u y2 0 0 u(2) x3 0 5 u (2) y3 u (3) x1 10 10 (3) u 10 10 y1 u (3) 0 0 x2 (3) 0 0 u y2 10 10 u(3) x3 10 10 u (3)
0 0 0 0 0 0
0 0 0 0 0 0
y3
IFEM Ch 3 Slide 4
Introduction to FEM
0 0 0 0 0 0
0 0 0 0 0 0
To apply compatibility, drop the member index from the nodal displacements
y3
0 0 0 0 0 0
10 10 10 10 0 0 = 0 0 10 10 10 10
f (3) = K (3) u
y3
IFEM Ch 3 Slide 5
Introduction to FEM
(3) f3
f3 f3
(2)
3
(3) f3 (2) f3
(3)
f = f (1) + f + f (3)
(2)
IFEM Ch 3 Slide 6
Introduction to FEM
20 fx1 f y1 10 fx2 = 10 f y2 0 f x 3 10 10 f y3
10 10 0 0 10 10
10 0 0 0 10 0 0 5 0 0 0 5
10 10 0 0 10 10
ux1 10 10 u y1 0 ux2 5 u y2 10 u x 3 15 u y3
IFEM Ch 3 Slide 7
Introduction to FEM
2 Displacement BCs:
u x 1 = u y1 = u y2 = 0
Force BCs:
f x 2 = 0, f x 3 = 2, f y3 = 1
;; ;;
;; ;;
IFEM Ch 3 Slide 8
Introduction to FEM
f x 2 = 0, 0 0 0 5 0 5 10 10 0 0 10 10
f x 3 = 2,
20 10 10 0 10 10
10 10 10 0 0 10 0 0 10 0 10 0
ux1 10 10 u y1 0 ux2 5 u y2 10 u x 3 15 u y3
IFEM Ch 3 Slide 9
Introduction to FEM
or
^ ^ ^ K u = f
IFEM Ch 3 Slide 10
Introduction to FEM
Solve for Unknown Node Displacements and Complete the Displacement Vector
ux2 0 u x 3 = 0.4 0.2 u y3
0 0 0 u= 0 0.4 0.2
IFEM Ch 3 Slide 11
Introduction to FEM
0 10 10 0 0 0 = 5 0 10 0.4 0.2 15
2
2 2 0 1 2 1
Reaction Forces
;; ;; ;; ;;
1 2
IFEM Ch 3 Slide 12
Introduction to FEM
F (3) F
1
(2)
u = T u
F (1)
e e 3. compute elongation d e = u x xi j u
E eA e e = d Le
IFEM Ch 3 Slide 13
Introduction to FEM
Computer Oriented Assembly and Solution in Actual FEM Codes (delayed until Part III of course)
K stored in special sparse format (for example "skyline format") Assembly done by "freedom pointers" (Sec 3.5.1) Equations for supports are not physically deleted (Sec 3.5.2) Next slide explains this for the example truss
IFEM Ch 3 Slide 14
Computer Oriented Modification of Master Stiffness Equations (delayed until Part III of course)
Recall
u x 1 = u y1 = u y2 = 0 f x 2 = 0, 20 10 10 0 10 10 10 10 10 0 0 10 0 0 10 0 10 0 f x 3 = 2, 0 0 0 5 0 5 10 10 0 0 10 10 f y3 = 1
Introduction to FEM
(freedoms 1, 2, 4)
IFEM Ch 3 Slide 15
Introduction to FEM
Computer Oriented Modification of Master Stiffness Equations (delayed until Part III of course)
1 0 0 0 0 1 0 0 0 0 10 0 0 0 0 1
0 0 0 0 0 0 0 0
0 0 0 0 10 10
^ ^ K u= f
IFEM Ch 3 Slide 16
Introduction to FEM
; ;
IFEM Ch 3 Slide 17
; ;
u y2 = +0.4 going up
Introduction to FEM
u x 1 = 0,
u y 1 = 0.5,
u y 2 = 0.4
IFEM Ch 3 Slide 18
Introduction to FEM
Remove rows 1,2,4 but (for now) keep columns 0 0.5 0 10 0 10 0 0 0 ux2 10 10 0 0 10 10 0.4 = 2 1 10 10 0 5 10 15 ux3 u y3
IFEM Ch 3 Slide 19
Introduction to FEM
10 0 0 ux2 0 0 10 10 u x 3 = 2 0 10 15 1 u y3 (10) 0 + 0 (0.5) + 0 0.4 0 (10) 0 + (10) (0.5) + 0 0.4 = 3 (10) 0 + (10) (0.5) + (5) 0.4 2
Solving gives
IFEM Ch 3 Slide 20
Introduction to FEM
IFEM Ch 3 Slide 21
Introduction to FEM
In summary, the only changes to the DSM is in the application of displacement boundary conditions before solve
IFEM Ch 3 Slide 22
318
f y2 = 1
3
fx3 = 2
the free-free structure, calculated in (3.18), is shown in Figure E3.3. Here is the verication of overall equilibrium. f x f x 1 + f x 2 + f x 3 = 2 + 0 + 2 = 0, f y f y 1 + f y 2 + f y 3 = 2 + 1 + 1 = 0, Mwr t 2 f y 1 L (1) + f x 3 L (2) = 2 10 + 2 10 = 0. (E3.2) Note: A theorem of classical mechanics says that if a 2D force system is in translational equilibrium and its moment respect to a point is zero, the moment with respect to any other point vanishes. Therefore it is sufcient to verify moment equilibrium respect to just one point, here take to be node 2 for convenience. F (3) = 2 2 (tension).
f x 1 = 2
1
fx2 = 0 f y 2 = 1
f y 1 = 2
Figure E3.3. Joint forces on free-free example truss. Forces f x 1 , f y 1 and f y 2 are reactions; the others are applied loads.
(1) (2) EXERCISE 3.2 The computations are very simple, and yield F = 0, F = 1 (compression) and
EXERCISE 3.3 For the example truss, joint forces may be also recovered from consideration of joint equi-
librium, because the structure is statically determinate. Once the joint displacements (3.17) are known, the joint forces in the local system of member e and the internal (axial) force f e may be recovered from the generic-member equilibrium relation fe 1 xi e fyi e 0 e eu e Te ue . e = K f =K (E3.3) f = e = fx j 1 0 fyej Carrying out the operations for the example truss we get 0 1 2 2 0 0 0 (2) = (3) = (1) = f f (E3.4) f 0, 1 , 22 , 0 0 0 from which it follows that the member axial forces F (1) , F (2) and F (3) are 0, 1 (compression) and +2 2 (tension), respectively. See Figure E3.3 for physical interpretation. This method is applicable only to statically determinate structures.
EXERCISE 3.4 The reduced system is obtained by deleting the rst three equations in (3.12):
5 0 5
0 10 10
5 10 15
u y2 ux3 u y3
0 2 1
The coefcient matrix of this system is singular because the second row is the sum of the rst and third rows. Because of this property, the system cannot be solved for the displacements. Physical interpretation: the support conditions u x 1 = u y 1 = u x 2 = 0 are not sufcient to prevent an (innitesimal) rigid body rotation about joint 1.
318
319
Solutions to Exercises
EXERCISE 3.5 Begin by clearing all entries of the 6 6 matrix K to zero, so that we effectively start with
0 0 0 0 0 0 K= 0 0
0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 . 0 0 0
(E3.5)
Merge member 1 (e = 1), for which EFT(1) = {1, 2, 3, 4}. On completing the loops over i and j , we will have
10 0 10 K= 0
0 0
0 0 0 0 0 0
10 0 0 0 0 0 0 0 10 0 0 0 . 0 0 0 0 0 0 0 0 0 0 0 0
(E3.6)
Note that this is precisely the augmented member stiffness in (3.4). In fact (E3.6) may be viewed as the master stiffness matrix of a 3-node truss that consists of member 1 only. Next we merge member 2 (e = 2), for which EFT(2) = {3, 4, 5, 6}. On completion of the i , j loops we will have
10 0 10 K= 0
0 0
0 0 0 0 0 0
10 0 10 0 0 0
0 0 0 0 0 0 5 0 0 0 5 0
0 0 0 . 5 0 5
(E3.7)
This is the matrix that would result on adding the expanded matrices in (3.4) and (3.5), and may be interpreted as the master stiffness matrix of a structure that consists of members 1 and 2 only. Finally, upon merging member 3, for which EFT(3) = {1, 2, 5, 6}, we get
20 10 10 K= 0
10 10
10 10 0 0 10 10
10 0 0 0 10 0 0 5 0 0 0 5
10 10 0 0 10 10
10 10 0 . 5 10 15
(E3.8)
(a)
sc s2 sc s 2
c2 sc c2 sc
sc s 2 sc s2
(E3.9)
area and length, where c = cos e , s = sin e , E e , Ae and L e are the elastic modulus, cross-section (1) (1) (1) 2 respectively. For member (element) (1): E = 1000, A = 2, L = 4 + 32 = 5, (1) =
319
320
arctan (3/4), c = 4/5 = 0.8, s = 3/5 = 0.6. Therefore K(1) 0.64 0.48 1000 2 0.48 0.36 = 0.64 0.48 5 0.48 0.36
For member (element) (2): E (2) = 1000, A(2) = 4, L (2) = c = 4/5 = 0.8, s = 3/5 = 0.6. Therefore 0.64 0.48 1000 4 0.48 0.36 = 0.64 0.48 5 0.48 0.36
42 + (3)2 = 5, (2)
384 288 K(2) 384 288 (E3.11) Next the member stiffness equations are augmented by adding zero rows and columns as appropriate to complete the force and displacement vectors. Compatibility is used to drop the member index on the displacements. For member (1):
f (1) 256 192 256 192 0 0 ux1 x1 (1) 192 144 192 144 0 0 u y 1 f y1 (1) 256 192 256 192 0 0 fx2 ux2 (1) = 144 0 0 f y 2 192 144 192 u y2 (1) fx3 0 0 0 0 0 0 ux3
1) f y(3
(E3.12)
u y3
0 0 0 0 0 0
(E3.13)
Adding the two equations and using the force equilibrium condition f = f(1) + f(2) = (K(1) + K(2) )u = Ku, we arrive at the master stiffness equations
f 256 u 192 256 192 0 0 x1 x1 144 192 144 0 0 u y1 f y 1 192 f x 2 256 192 768 192 512 384 u x 2 = f y 2 192 144 192 432 384 288 u y 2
fx3 f y3 0 0 0 0 512 384 384 288 512 384 384 288 ux3 u y3 whence
(E3.14)
256 192 256 192 0 0 144 192 144 0 0 192 256 192 768 192 512 384 K= 192 144 192 432 384 288
0 0 0 0 512 384 384 288 512 384 384 288
(E3.15)
320
321
Solutions to Exercises
The master equations can also be derived using the freedom pointer technique described in 3.5.1, which is the way assembly is actually programmed. For this structure the Element Freedom Tables are EFT(1) = {1, 2, 3, 4} and EFT(2) = {3, 4, 5, 6}. These tables may be used to obtain the same entries of the master stiffness matrix. For hand computations this technique is more prone to error. (b) We apply the displacement boundary conditions: u x 1 = u y 1 = u x 3 = u y 3 = 0, f x 2 = P = 12, and f y 2 = 0, (E3.16)
by removing equations 1, 2, 5, and 6 from the system. This is done by deleting rows and columns 1, 2, 5, and 6 from K, and the corresponding components from f and u. The reduced two-equation system is 768 192 192 432 ux2 u y2 = fx2 f y2 = 12 0 (E3.17)
Solving this linear system by any method gives ux2 = (c) 9 512 and u y2 = 1 . 128 (E3.18)
To recover all the joint forces note that the complete displacement vector is u = [ 0 0 9/512 1/128 0 0 ]T . Using the original master stiffness equations (E3.14):
6 9/2 (E3.19) Overall equilibrium is veried by summing the forces in the {x , y } directions and taking z -moments about any joint: fx3 f y3 0 0 0 0 384 288 512 384 0 0 f x f x 1 + f x 2 + f x 3 = 6 + 12 6 = 0, 9 9 f y f y 1 + f y 2 + f y 3 = + 0 + = 0, 2 2 Mwr t 1 4 f y 2 3 f x 2 + 8 f y 3 = 0 36 + 36 = 0, Mwr t 2 3 f x 1 + 4 f y 1 3 f x 3 + 4 f y 3 = 18 + 18 18 + 18 = 0, Mwr t 3 8 f y 1 4 f y 2 3 f x 2 = 36 0 36 = 0. (d) Using the method described in 3.4.2 we proceed as follows. For member (1), c = 4/5, s = 3/5, u(1) = [ 0 0 9/512 1/128 ]T . The local joint displacements are recovered by
f 256 0 6 192 256 192 0 0 x1 144 192 144 0 0 0 9/2 f y1 192 fx2 256 192 768 192 512 384 9/512 12 = . f= f y 2 = Ku = 192 144 192 432 384 288 1/128 0
512 384 384 288
(E3.20)
u (1)
u(1) =
xi 1) u( yi 1) u( xj 1) u( yj
4/5 3/5 = 0 0
3/5 4/5 0 0
0 0 4/5 3/5
(E3.21)
The elongation is d (1) = 3/160 0 = 3/160, from which F (1) = 1000 2 (3/160)/5 = 15/2 = 7.5. The positive sign indicates that member (1) is in tension.
321
u (2)
u(2) =
xi 2) u( yi 2) u( xj 2) u( yj
4/5 3/5 = 0 0
3/5 4/5 0 0
0 0 4/5 3/5
(E3.22)
The elongation is d (2) = 0 3/320 = 3/320, from which F (2) = 1000 4 (3/320)/5 = 15/2 = 7.5. The negative sign indicates that member (2) is in compression.
EXERCISE 3.7
(a)
256 192 256 192 0 0 144 192 144 0 0 192 256 192 768 192 512 384 K= 192 144 192 432 384 288
0 0 0 0 512 384 384 288 512 384 384 288
(E3.23)
256 0 f 192 256 192 0 0 x1 f 192 144 192 144 0 0 0 y1 256 192 768 192 512 384 u x 2 12 = 192 144 192 432 384 288 u y 2 0
0 0 0 0 512 384 384 288 512 384 384 288 0 1 2 fx3 f y3
(E3.24)
(b)
For hand computation, reduce the system by removing rows 1, 2, 5 and 6 that pertain to the prescribed displacements:
0 1 2 Next, columns 1, 2, 5 and 6 are removed by tranferring all known terms from the left to the right hand side: 768 192 192 432 which gives 768 192 Solution by Gausss elimination yields ux2 = ux2 u y2 = (256)(0) + (192)(0) + (512)(0) + (384)( 1 ) 12 2 0 (192)(0) + (144)(0) + (384)(0) + (288)( 1 ) 2 192 432 ux2 u y2 = 204 144 (E3.26)
0 0 256 192 768 192 512 384 u x 2 = 12 192 144 192 432 384 288 u y 2 0
(E3.25)
(E3.27)
105 512
and
u y2 =
31 128
(E3.28)
322
323
(c)
Solutions to Exercises
To recover all the joint forces we complete the node displacement vector with the known values: uT = [ 0 and use f = Ku to get 0
105 512 31 128
1 ] 2
(E3.29)
f 256 0 6 192 256 192 0 0 x1 9 144 192 144 0 0 0 2 f y 1 192 105 f x 2 256 192 768 192 512 384 12 512 = = 31 f y 2 192 144 192 432 384 288 128 0
fx3 f y3 0 0 0 0 512 384 384 288 512 384 384 288 0 1 2 6
9 2
(E3.30)
Horizontal force equilibrium is veried by f x 1 + f x 2 + f x 3 = 6 + 12 6 = 0 and likewise for y -force and moment equilibrium. (E3.31)
323
41
42
TABLE OF CONTENTS
Page
4.1.
4.2. 4.3.
4. 4. 4.
Computer Algebra Systems 4.1.1. Why Mathematica? . . . . . 4.1.2. How to Get It . . . . . . . . 4.1.3. Programming Style and Prerequisites 4.1.4. Class Demo Scripts . . . . . . Program Organization The Element Stiffness Module 4.3.1. Module Description . . . . . 4.3.2. Programming Remarks . . . . . 4.3.3. Case Sensitivity . . . . . . 4.3.4. Testing the Member Stiffness Module Merging a Member into the Master Stiffness Assembling the Master Stiffness Modifying the Master System Recovering Internal Forces Putting the Pieces Together 4.8.1. The Driver Script . . . . . . 4.8.2. Is All of This Worthwhile? . . . Notes and Bibliography . . . . . . . . . . . . References. . . . . . . . . . . . . Exercises . . . . . . . . . . . .
. . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
42
4.1
Computer algebra systems, known by the acronym CAS, are programs designed to perform symbolic and numeric manipulations following the rules of mathematics.1 The development of such programs began in the mid 1960s. The rst comprehensive system the granddaddy of them all, called Macsyma (an acronym for Project Mac Symbolic Manipulator) was developed using the programming language Lisp at MITs famous Articial Intelligence Laboratory over the period 1967 to 1980. The number and quality of symbolic-manipulation programs has expanded dramatically since the availability of graphical workstations and personal computers has encouraged interactive and experimental programming. As of this writing the leading general-purpose contenders are Maple and Mathematica.2 In addition there are a dozen or so more specialized programs, some of which are available free or at very reasonable cost. See Notes and Bibliography at the end of the Chapter. 4.1.1. Why Mathematica? In the present book Mathematica will be used for Chapters and Exercises that develop symbolic and numerical computation for matrix structural analysis and FEM implementations. Mathematica is a commercial product developed by Wolfram Research, web site: http://www.wolfram.com. The version used to construct the code fragments presented in this Chapter is 4.1, which was commercially released in 2001. (The latest version is 7, released in 2009.) The main advantages of Mathematica for technical computing are: 1. 2. 3. 4. Availability on a wide range of platforms that range from PCs and Macs through Unix workstations. Up-to-date user interface. On all machines Mathematica offers a graphics user interface called the Notebook front-end. This is mandatory for serious work. It provides advanced result typesetting. A powerful programming language. Good documentation and abundance of application books at all levels.
One common disadvantage of CAS, and Mathematica is no exception, is computational inefciency in numerical calculations compared with a low-level implementation in, for instance, C or Fortran. The relative penalty can reach several orders of magnitude. For instructional use, however, the penalty is acceptable when compared to human efciency. This means the ability to get FEM programs up and running in very short time, with capabilities for symbolic manipulation and graphics as a bonus. 4.1.2. How to Get It Starting 1 August 2007, a free one-year license from CUs Information Technology Services (ITS) is available. Students may renew this license as long as they are registered. See Figure 1 for the How to Get It instructions. If you plan to keep Mathematica for a long time, an academic version is available. Registered students may also purchase the student version for about $150 at the UMC bookstore. You will need to show
1
Some vendors call that kind of activity doing mathematics by computer. It is more appropriate to regard such programs as enabling tools that help humans with complicated and error-prone manipulations. Mettle and metal. As of now, only humans can do mathematics. Another commonly used program for engineering computations: Matlab, does only numerical computations although a [poorly done] interface to Maple can be purchased as a toolbox.
43
44
Eligibility: students, faculty, staff and departments of all CU campuses Platforms: Mac OSX, Windows, Linux, Solaris, AIX, HP-UX How to Get It 1) Download and install software as per instructions at http://sitelic.colorado.edu/mathematica, or request an installation CD from the Site Licensing office: [email protected], 303-492-8995 2) Register your copy online at http://register.wolfram.com/ using campus license number L2437-5121 plus your computer MathID number. Be sure to use your CU mail address. 3) A password (unique to your computer) will be forwarded to you via email from Site Licensing ITS Support Question & tech support problems: send email to [email protected] Periodic hands-on workshops are available for those new to the software, click on Workshops on the Web page given above. Details (for example: what is a MathID?) about licensing & support are posted at the above web site.
Figure 4.1. Instructions to get Mathematica 7 for free from CU-ITS. Also on CAETE Slide 7.
proof you are a bona-de student at the register.3 If you are not on campus (e.g. a CAETE student) you may purchase it directly at the vendors web site http://www.wolfram.com. Again proof of registration must be provided. The student version is cheap, since the standard personal license costs over $1K and company licenses go for over $3K per seat. Unlike other commercial software products, you get the full thing; no capabilities are emasculated. But terms are strict: once installed on your laptop or desktop, it cannot be transferred to another computer since the license is forever keyed to the disk identication. 4.1.3. Programming Style and Prerequisites The following material assumes that you are a moderately experienced user of Mathematica, or are willing to learn to be one. See Notes and Bibliography for a brief discussion of tutorial and reference materials in case you are interested. Practice with the program until you reach the level of writing functions, modules and scripts with relative ease. With the Notebook interface and a good primer it takes only a few hours. When approaching that level you may notice that functions in Mathematica display many aspects similar to C.4 You can exploit this similarity if you are procient in that language. But Mathematica functions do have some unique aspects, such as matching arguments by pattern, and the fact that internal variables
3 4
Check for discounts when new versions come out; unsold previous-version copies may go for as little as $50. Simple functions can be implemented in Mathematica directly, for instance DotProduct[x ,y ]:=x.y; more complicated functions are handled by the Module construct. These constructs are called rules by computer scientists.
44
4.1
Modication of function arguments should be avoided because it may be difcult to trace side effects. The programming style enforced here outlaws output arguments and a function can only return its name. But since the name can be a list of arbitrary objects the restriction is not serious.6 Our objective is to develop a symbolic program written in Mathematica that solves the example plane truss as well as some symbolic versions thereof. The program will rely heavily on the development and use of functions implemented using the Module construct of Mathematica. Thus the style will be one of procedural programming.7 The program will not be particularly modular (in the computer science sense) because Mathematica is not suitable for that programming style.8 The code presented in Sections 4.24.7 uses a few language constructs that may be deemed as advanced, and these are briey noted in the text so that appropriate reference to the Mathematica reference manual can be made. 4.1.4. Class Demo Scripts The cell scripts shown in Figures 4.1 and 4.2 will be used to illustrate the organization of a Notebook le and the look and feel of some basic Mathematica commands. These scripts will be demonstrated in class from a laptop.
In Mathematica everything is a function, including programming constructs. Example: in C for is a loop-opening keyword, whereas in Mathematica For is a function that runs a loop according to its arguments. Such restrictions on arguments and function returns are closer in spirit to C than Fortran although you can of course modify C-function arguments using pointers exceedingly dangerous but often unavoidable. The name Module should not be taken too seriously: it is far away from the concept of modules in Ada, Modula, Oberon or Fortran 90. But such precise levels of interface control are rarely needed in symbolic languages. Indeed none of the CAS packages in popular use is designed for strong modularity because of historical and interactivity constraints.
45
46
Integration example f[x_,_, _]:=(1+ *x^2)/(1+*x+x^2); F=Integrate[f[x,-1,2],{x,0,5}]; F=Simplify[F]; Print[F]; Print[N[F]]; F=NIntegrate[f[x,-1,2],{x,0,5}]; Print["F=",F//InputForm]; 10 + Log[21] 13.0445 F=13.044522437723455
Figure 4.2. Example cell for class demo.
Fa=Integrate[f[z,a,b],{z,0,5}]; Fa=Simplify[Fa]; Print["Fa=",Fa]; Plot3D[Fa,{a,-1.5,1.5},{b,-10,10},ViewPoint->{-1,-1,1}]; Fa=FullSimplify[Fa]; (* very slow but you get *) Print["Fa=",Fa];
10
Figure 4.3. Another example cell for class demo. (Note: results shown were obtained with Mathematica version 4.2. Integration answers from versions 5 and up are different.)
46
47
4.3
Problem Driver
Cell 7
Stiffness Assembler
AssembleMasterStiffOfExampleTruss
ModifiedMasterStiffForDBC
Cell 3
Cell 4
IntForcesOfExampleTruss
Cell 6
MergeElemIntoMasterStiff
Cell 2
Bar Stiffness
ElemStiff2DTwoNodeBar
IntForces2DTwoNodeBar
Cell 1
Cell 5
Element Library
4.2. Program Organization The overall organization of the example truss program is shown in Figures 4.4 and 4.5. Figure 4.4 shows the program as divided into functional steps. For example the driver program calls the stiffness assembler, which in turn uses two functions: form bar stiffness and merge into master stiffness. This kind of functional division would be provided by any programming language. On the other hand Figure 4.5 is Mathematica specic. It shows the names of the module that implement the functional tasks and the cells where they reside. (Modules and cells are explained in the sections below.) The following sections proceed to describe the code segments of Figure 4.5, module by module. For tutorial purposes this is done in a bottom up fashion, that is, going cell by cell from left to right and bottom to top. 4.3. The Element Stiffness Module As our rst FEM code segment, the top box of Figure 4.6 shows a module that evaluates and returns the 4 4 stiffness matrix of a plane truss member (two-node bar) in global coordinates. The text in that box of that gure is supposed to be placed on a Notebook cell. Executing the cell, by clicking on it and hitting an appropriate key (<Enter> on a Mac), gives the output shown in the bottom box. The contents of the gure is described in further detail below. 4.3.1. Module Description The stiffness module is called ElemStiff2DTwoNodeBar. Such descriptive names are permitted by the language. This reduces the need for detailed comments. The module takes two arguments: { { x1,y1 },{ x2,y2 } } A two-level list9 containing the {x , y } coordinates of the bar end nodes labelled as 1 and 2.10
A level-one list is a sequence of items enclosed in curly braces. For example: { x1,y1 } is a list of two items. A level-two list is a list of level-one lists. An important example of a level-two list is a matrix. These are called the local node numbers, and replace the i , j of previous Chapters. This is a common FEM programming practice.
10
47
48
ElemStiff2DTwoNodeBar[{{x1_,y1_},{x2_,y2_}},{Em_,A_}] := Module[{c,s,dx=x2-x1,dy=y2-y1,L,Ke}, L=Sqrt[dx^2+dy^2]; c=dx/L; s=dy/L; Ke=(Em*A/L)* {{ c^2, c*s,-c^2,-c*s}, { c*s, s^2,-s*c,-s^2}, {-c^2,-s*c, c^2, s*c}, {-s*c,-s^2, s*c, s^2}}; Return[Ke] ]; Ke= ElemStiff2DTwoNodeBar[{{0,0},{10,10}},{100,2*Sqrt[2]}]; Print["Numerical elem stiff matrix:"]; Print[Ke//MatrixForm]; Ke= ElemStiff2DTwoNodeBar[{{0,0},{L,L}},{Em,A}]; Ke=Simplify[Ke,L>0]; Print["Symbolic elem stiff matrix:"]; Print[Ke//MatrixForm];
Numerical elem stiff matrix:
10 10 10 10
10 10 10 10
10 10 10 10
10 10 10 10
A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L
Figure 4.6. Module ElemStiff2DTwoNodeBar to form the element stiffness of a 2D 2-node truss element in global coordinates. Test statements (in blue) and test output.
{ Em,A }
A one-level list containing the bar elastic modulus, E and the member cross section area, A. See 4.3.3 as to why name E cannot be used.
The use of the underscore after argument item names in the declaration of the Module is a requirement for pattern-matching in Mathematica. If, as recommended, you have learned functions and modules this language-specic aspect should not come as a surprise. The module name returns the 4 4 member stiffness matrix internally called Ke. The logic that leads to the formation of that matrix is straightforward and need not be explained in detail. Note, however, the elegant direct declaration of the matrix Ke as a level-two list, which eliminates the ddling around with array indices typical of low-level programming languages. The specication format in fact closely matches the mathematical expression (2.18). 4.3.2. Programming Remarks The function in Figure 4.6 uses several intermediate variables with short names: dx, dy, s, c and L. It is strongly advisable to make these symbols local to avoid potential names clashes somewhere else.11 In the Module[ ...] construct this is done by listing those names in a list immediately after the opening bracket. Local variables may be initialized when they are constants or simple functions of the argument items; for example on entry to the module dx=x2-x1 initializes variable dx to be the difference of x node coordinates, namely x = x2 x1 .
11
The global by default choice is the worst one, but we must live with the rules of the language.
48
49
4.4
The Return statement fullls the same purpose as in C or Fortran 90. Mathematica guides and textbooks advise against the use of that and other C-like constructs. The writer strongly disagrees: the Return statement makes clear what the Module gives back to its invoker and is self-documenting. 4.3.3. Case Sensitivity Mathematica, like most recent computer languages, is case sensitive so that for instance E is not the same as e. This is ne. But the language designer decided that names of system-dened objects such as built-in functions and constants must begin with a capital letter. Consequently the liberal use of names beginning with a capital letter may run into clashes. For example you cannot use E because of its built-in meaning as the base of natural logarithms.12 In the code fragments presented throughout this book, identiers beginning with upper case are used for objects such as stiffness matrices, modulus of elasticity, and cross section area. This follows established usage in Mechanics. When there is danger of clashing with a protected system symbol, additional lower case letters are used. For example, Em is used for the elastic modulus instead of E because (as noted above) the latter is a reserved symbol. 4.3.4. Testing the Member Stiffness Module Following the denition of ElemStiff2DTwoNodeBar in Figure 4.6 there are several statements that constitute the module test script that call the module and print the returned results. Two cases are tested. First, the stiffness of member (3) of the example truss, using all-numerical values. Next, some of the input arguments for the same member are given symbolic names so they stand for variables; for example the elastic module is given as Em instead of 100 as in the foregoing test. The print output of the test is shown in the lower portion of Figure 4.6. The rst test returns the member stiffness matrix (2.21) as may be expected. The second test returns a symbolic form in which three symbols appear: the coordinates of end node 2, which is taken to be located at { L,L } instead of {10, 10}, A, which is the cross-section area and Em, which is the elastic modulus. Note that the returning matrix Ke is subject to a Simplify step before printing it, which is the subject of an Exercise. The ability to carry along variables is of course a fundamental capability of any CAS and the main reason for which such programs are used. 4.4. Merging a Member into the Master Stiffness The next fragment of Mathematica code, listed in Figure 4.7, is used in the assembly step of the DSM. Module MergeElemIntoMasterStiff receives the 4 4 element stiffness matrix formed by FormElemStiff2DNodeBar and merges it into the master stiffness matrix. The module takes three arguments: Ke eftab The 4 4 member stiffness matrix to be merged. This is a level-two list. The column of the Element Freedom Table, dened in 3.4.1, appropriate to the member being merged; cf. (3.22). Recall that the EFT lists the global equation numbers for the four member degrees of freedom. This is a level-one list consisting of 4 integers. The incoming 6 6 master stiffness matrix. This is a level-two list.
Kinp
12
In retrospect this appears to have been a highly questionable decision. System dened names should have been identied by a reserved prex or postx to avoid surprises, as done in Macsyma or Maple. Mathematica issues a warning message, however, if an attempt to redene a protected symbol is made.
49
410
Figure 4.7. Module MergeElemIntoMasterStiff to merge a 4 4 bar element stiffness into the master stiffness matrix. Test statements (in blue) and test output.
MergeElemIntoMasterStiff returns, as module name, the updated master stiffness matrix internally called K with the member stiffness merged in. Thus we encounter here a novelty: an input-output argument. Because a formal argument cannot be modied, the situation is handled by copying the incoming Kin into K on entry. It is the copy which is updated and returned via the Return statement. The implementation has a strong C avor with two nested For loops. Because the iterators are very simple, nested Do loops could have been used as well. The statements after the module provide a simple test. Before the rst call to this function, the master stiffness matrix must be initialized to a zero 6 6 array. This is done in the rst test statement using the Table function. The test member stiffness matrix is that of member (3) of the example truss, and is obtained by calling ElemStiff2DTwoNodeBar. The EFT is { 1,2,5,6 } since element freedoms 1,2,3,4 map into global freedoms 1,2,5,6. Running the test statements yields the listing given in Figure 4.7. The result is as expected. 4.5. Assembling the Master Stiffness The module AssembleMasterStiffOfExampleTruss, listed in the top box of Figure 4.8, makes use of the foregoing two modules: ElemStiff2DTwoNodeBar and MergeElemIntoMasterStiff, 410
411
4.6
AssembleMasterStiffOfExampleTruss[]:= Module[{Ke,K=Table[0,{6},{6}]}, Ke=ElemStiff2DTwoNodeBar[{{0,0},{10,0}},{100,1}]; K= MergeElemIntoMasterStiff[Ke,{1,2,3,4},K]; Ke=ElemStiff2DTwoNodeBar[{{10,0},{10,10}},{100,1/2}]; K= MergeElemIntoMasterStiff[Ke,{3,4,5,6},K]; Ke=ElemStiff2DTwoNodeBar[{{0,0},{10,10}},{100,2*Sqrt[2]}]; K= MergeElemIntoMasterStiff[Ke,{1,2,5,6},K]; Return[K] ]; K=AssembleMasterStiffOfExampleTruss[]; Print["Master stiffness of example truss:"]; Print[K//MatrixForm];
Master 20 10 10 0 10 10 stiffness of example truss: 10 10 0 10 10 10 0 0 10 10 0 10 0 0 0 0 0 5 0 5 10 0 0 10 10 10 0 5 10 15
Figure 4.8. Module AssembleMasterStiffOfExampleTruss that forms the 6 6 master stiffness matrix of the example truss. Test statements (in blue) and test output.
to form the master stiffness matrix of the example truss. The initialization of the stiffness matrix array in K to zero is done by the Table function of Mathematica, which is handy for initializing lists. The remaining statements are self explanatory. The module is similar in style to argumentless Fortran or C functions. It takes no arguments. All the example truss data is wired in. The output from the test script is shown in the lower box of Figure 4.8. The output stiffness matches that in Equation (3.12), as can be expected if all code fragments used so far work correctly. 4.6. Modifying the Master System Following the assembly process the master stiffness equations Ku = f must be modied to account for single-freedom displacement boundary conditions. This is done through the computer-oriented equation modication process outlined in 3.5.2. Module ModifiedMasterStiffForDBC and ModifiedMasterForcesForDBC carry out this modication for K and f, respectively. These two modules are listed in the top box of Figure 4.9, along with test statements. The logic of both functions is considerably simplied by assuming that all prescribed displacements are zero, that is, the BCs are homogeneous. (The more general case of nonzero prescribed values is treated in Part III of the book.) Function ModifiedMasterStiffnessForDBC has two arguments: pdof K A list of the prescribed degrees of freedom identied by their global number. For the example truss this list contains three entries: {1, 2, 4}. The master stiffness matrix K produced by the assembly process.
The function clears appropriate rows and columns of K, places ones on the diagonal, and returns the modied K as function value. The only slightly fancy thing in this module is the use of the Mathematica function Length to extract the number of prescribed displacement components: Length[pdof] here will return the value 3, which is the length of the list pdof. Similarly nk=Length[K] assigns 6 to nk, which is the order of matrix K. Although for the example truss these values are known a priori, the use of Length serves to illustrate a technique that is heavily used in more general code. 411
412
ModifiedMasterStiffForDBC[pdof_,K_] := Module[ {i,j,k,nk=Length[K],np=Length[pdof],Kmod=K}, For [k=1,k<=np,k++, i=pdof[[k]]; For [j=1,j<=nk,j++, Kmod[[i,j]]=Kmod[[j,i]]=0]; Kmod[[i,i]]=1]; Return[Kmod] ]; ModifiedMasterForcesForDBC[pdof_,f_] := Module[ {i,k,np=Length[pdof],fmod=f}, For [k=1,k<=np,k++, i=pdof[[k]]; fmod[[i]]=0]; Return[fmod] ]; K=Array[Kij,{6,6}]; Print["Assembled master stiffness:"]; Print[K//MatrixForm]; K=ModifiedMasterStiffForDBC[{1,2,4},K]; Print["Master stiffness modified for displacement B.C.:"]; Print[K//MatrixForm]; f=Array[fi,{6}]; Print["Force vector:"]; Print[f]; f=ModifiedMasterForcesForDBC[{1,2,4},f]; Print["Force vector modified for displacement B.C.:"]; Print[f];
Assembled master stiffness: Kij 1, 1 Kij 1, 2 Kij 1, Kij 2, 1 Kij 2, 2 Kij 2, Kij 3, 1 Kij 3, 2 Kij 3, Kij 4, 1 Kij 4, 2 Kij 4, Kij 5, 1 Kij 5, 2 Kij 5, Kij 6, 1 Kij 6, 2 Kij 6,
3 3 3 3 3 3
1, 2, 3, 4, 5, 6,
4 4 4 4 4 4
1, 2, 3, 4, 5, 6,
5 5 5 5 5 5
1, 2, 3, 4, 5, 6,
6 6 6 6 6 6
Master stiffness modified for displacement B.C.: 1 0 0 0 0 0 0 1 0 0 0 0 0 0 Kij 3, 3 0 Kij 3, 5 Kij 3, 6 0 0 0 1 0 0 0 0 Kij 5, 3 0 Kij 5, 5 Kij 5, 6 0 0 Kij 6, 3 0 Kij 6, 5 Kij 6, 6 Force vector: fi 1 , fi 2 , fi 3 , fi 4 , fi 5 , fi 6 Force vector modified for displacement B.C.: 0, 0, fi 3 , 0, fi 5 , fi 6
Figure 4.9. Modules ModifiedMasterStiffForDBC and ModifiedMasterForceForDBC that modify the master stiffness matrix and force vector of a truss to impose displacement BCs. Test statements (in blue) and test output.
Module ModifiedMasterForcesForDBC has similar structure and logic and need not be described in detail. It is important to note, however, that for homogeneous BCs the modules are independent of each other and may be called in any order. On the other hand, if there were nonzero prescribed displacements present the force modication must be done before the stiffness modication. This is because stiffness coefcients that are cleared in the latter are needed for modifying the force vector. The test statements are purposedly chosen to illustrate another feature of Mathematica: the use of the Array function to generate subscripted symbolic arrays of one and two dimensions. The test output is shown in the bottom box of Figure 4.9, which should be self explanatory. The force vector and its modied form are printed as row vectors to save space. 4.7. Recovering Internal Forces Mathematica provides built-in matrix operations for solving a linear system of equations and multiplying matrices by vectors. Thus we do not need to write application functions for the solution of the 412
413
4.7
IntForce2DTwoNodeBar[{{x1_,y1_},{x2_,y2_}},{Em_,A_},eftab_,u_]:= Module[ {c,s,dx=x2-x1,dy=y2-y1,L,ix,iy,jx,jy,ubar,e}, L=Sqrt[dx^2+dy^2]; c=dx/L; s=dy/L; {ix,iy,jx,jy}=eftab; ubar={c*u[[ix]]+s*u[[iy]],-s*u[[ix]]+c*u[[iy]], c*u[[jx]]+s*u[[jy]],-s*u[[jx]]+c*u[[jy]]}; e=(ubar[[3]]-ubar[[1]])/L; Return[Em*A*e] ]; p =IntForce2DTwoNodeBar[{{0,0},{10,10}},{100,2*Sqrt[2]}, {1,2,5,6},{0,0,0,0,0.4,-0.2}]; Print["Member int force (numerical):"]; Print[N[p]]; p =IntForce2DTwoNodeBar[{{0,0},{L,L}},{Em,A}, {1,2,5,6},{0,0,0,0,ux3,uy3}]; Print["Member int force (symbolic):"]; Print[Simplify[p]];
Member int force (numerical): 2.82843 Member int force (symbolic): A Em ( ux3 + uy3) 2L
Figure 4.10. Module IntForce2DTwoNodeBar for computing the internal force in a bar element. Test statements (in blue) and test output.
modied stiffness equations and for the recovery of nodal forces. Consequently, the last application functions we need are those for internal force recovery. Function IntForce2DTwoNodeBar listed in the top box of Figure 4.10 computes the internal force in an individual bar element. It is somewhat similar in argument sequence and logic to ElemStiff2DTwoNodeBar of Figure 4.6. The rst two arguments are identical. Argument eftab provides the Element Freedom Table array for the element. The last argument, u, is the vector of computed node displacements. The logic of IntForce2DTwoNodeBar is straightforward and follows the method outlined in 3.2.1. (e) in local coordinates {x , y } are recovered in array ubar, then the Member joint displacements u xi )/ L and the internal (axial) force p = E Ae is returned as function longitudinal strain e = (u xj u value. As coded the function contains redundant operations because entries 2 and 4 of ubar (that y j ) are not actually needed to get p , but were kept to illustrate the general is, components u yi and u backtransformation of global to local displacements. Running this function with the test statements shown after the module produces the output shown in the bottom box of Figure 4.10. The rst test is for member (3) of the example truss using the actual nodal displacements (3.17). It also illustrates the use of the Mathematica built in function N to produce output in oating-point form. The second test does a symbolic calculation in which several argument values are fed in variable form. The top box of Figure 4.11 lists a higher-level function, IntForceOfExampleTruss, which has a single argument: u. This is the complete 6-vector of joint displacements u. This function calls IntForce2DTwoNodeBar three times, once for each member of the example truss, and returns the three member internal forces thus computed as a 3-component list. The test statements listed after IntForcesOfExampleTruss feed the displacement solution (3.24) to the module. Running the test produces the output shown in the bottom box of Figure 4.11. The (1) (2) (3) internal forces are p = 0, p = 1 and p = 2 2 = 2.82843.
413
414
IntForcesOfExampleTruss[u_]:= Module[{f=Table[0,{3}]}, f[[1]]=IntForce2DTwoNodeBar[{{0,0},{10,0}},{100,1},{1,2,3,4},u]; f[[2]]=IntForce2DTwoNodeBar[{{10,0},{10,10}},{100,1/2},{3,4,5,6},u]; f[[3]]=IntForce2DTwoNodeBar[{{0,0},{10,10}},{100,2*Sqrt[2]}, {1,2,5,6},u]; Return[f] ]; f=IntForcesOfExampleTruss[{0,0,0,0,0.4,-0.2}]; Print["Internal member forces in example truss:"];Print[N[f]];
Internal member forces in example truss: {0., -1., 2.82843}
Figure 4.11. Module IntForceOfExampleTruss that computes internal forces in the 3 members of the example truss. Test statements (in blue) and test output.
4.8. Putting the Pieces Together After all this development and testing effort documented in Figures 4.6 through 4.11 we are ready to make use of all these bits and pieces of code to analyze the example plane truss. This is actually done with the logic shown in Figure 4.12. This particular piece of code is called the driver script. Note that it is not a Module. It uses the seven previously described modules ElemStiff2DTwoNodeBar MergeElemIntoMasterStiff AssembleMasterStiffOfExampleTruss ModifiedMasterStiffForDBC ModifiedMasterForcesForDBC IntForce2DTwoNodeTruss IntForcesOfExampleTruss
(4.1)
These functions must have been dened (compiled) at the time the driver scripts described below are run. A simple way to making sure that all of them are dened is to put all these functions in the same Notebook le and to mark them as initialization cells. These cells may be executed by picking up Kernel Initialize Execute Initialization. (An even simpler procedure would to group them all in one cell, but that would make placing separate test statements messy.) For a hierarchical version of (4.1), see the last CAETE slide. 4.8.1. The Driver Script The code listed in the top box of Figure 4.12 rst assembles the master stiffness matrix through AssembleMasterStiffOfExampleTruss. Next, it applies the displacement boundary conditions through ModifiedMasterStiffForDBC and ModifiedMasterForcesForDBC. Note that the modied stiffness matrix is placed into Kmod rather than K to save the original form of the master stiffness for the reaction force recovery later. The complete displacement vector is obtained by the matrix calculation u=Inverse[Kmod].fmod (4.2) which takes advantage of two built-in Mathematica functions. Inverse returns the inverse of its 414
415
4.8
f={0,0,0,0,2,1}; K=AssembleMasterStiffOfExampleTruss[]; Kmod=ModifiedMasterStiffForDBC[{1,2,4},K]; fmod=ModifiedMasterForcesForDBC[{1,2,4},f]; u=Simplify[Inverse[Kmod].fmod]; Print["Computed nodal displacements:"]; Print[u]; f=Simplify[K.u]; Print["External node forces including reactions:"]; Print[f]; p=Simplify[IntForcesOfExampleTruss[u]]; Print["Internal member forces:"]; Print[p];
Computed nodal displacements: 1 {0, 0, 0, 0, 2 , } 5 5 External node forces including reactions: {-2, -2, 0, 1, 2, 1} Internal member forces: {0, -1, 2 2}
Figure 4.12. Driver script for numerical analysis of example truss and its output.
f={0,0,0,0,fx3,fy3}; K=AssembleMasterStiffOfExampleTruss[]; Kmod=ModifiedMasterStiffForDBC[{1,2,4},K]; fmod=ModifiedMasterForcesForDBC[{1,2,4},f]; u=Simplify[Inverse[Kmod].fmod]; Print["Computed nodal displacements:"]; Print[u]; f=Simplify[K.u]; Print["External node forces including reactions:"]; Print[f]; p=Simplify[IntForcesOfExampleTruss[u]]; Print["Internal member forces:"]; Print[p];
Computed nodal displacements: 1 1 {0, 0, 0, 0, 10 (3 fx3 - 2 fy3), (-fx3 + fy3)} 5 External node forces including reactions: {-fx3, -fx3, 0, fx3 - fy3, fx3, fy3} Internal member forces: {0, -fx3 + fy3, 2 fx3}
Figure 4.13. Driver script for symbolic analysis of example truss and its output.
matrix argument13 The dot operator signies matrix multiply (here, matrix-vector multiply.) The enclosing Simplify function in Figure 4.12 is asked to simplify the expression of vector u in case of symbolic calculations; it is actually redundant if all computations are numerical. The remaining statements recover the node vector including reactions via the matrix-vector multiply f = K.u (recall that K contains the unmodied master stiffness matrix) and the member internal forces p through IntForcesOfExampleTruss. The code prints u, f and p as row vectors to save space. Running the script of the top box of Figure 4.12 produces the output shown in the bottom box of that gure. The results conrm the hand calculations of Chapter 3. 4.8.2. Is All of This Worthwhile? At this point you may wonder whether all of this work is worth the trouble. After all, a hand calculation (typically helped by a programable calculator) would be quicker in terms of ow time. Typing and
13
This is a highly inefcient way to solve Ku = f if this system becomes large. It is done here to keep things simple.
415
416
debugging the Mathematica fragments displayed here took the writer about six hours (although about two thirds of this was spent in editing and getting the fragment listings into the Chapter.) For larger problems, however, Mathematica would certainly beat hand-plus-calculator computations, the crossover typically appearing for 10 to 20 equations. For up to about 500 equations and using oating-point arithmetic, Mathematica gives answers within minutes on a fast PC or Mac with sufcient memory but eventually runs out of steam at about 1000 equations. For a range of 1000 to about 50000 equations, Matlab, using built-in sparse solvers, would be the best compromise between human and computer ow time. Beyond 50000 equations a program in a low-level language, such as C or Fortran, would be most efcient in terms of computer time.14 One distinct advantage of computer algebra systems emerges when you need to parametrize a small problem by leaving one or more problem quantities as variables. For example suppose that the applied forces on node 3 are to be left as f x 3 and f y 3 . You replace the last two components of array p as shown in the top box of Figure 4.13, execute the cell and shortly get the symbolic answer shown in the bottom box of that gure. This is the answer to an innite number of numerical problems. Although one may try to undertake such studies by hand, the likelyhood of errors grows rapidly with the complexity of the system. Symbolic manipulation systems can amplify human abilities in this regard, as long as the algebra does not explode because of combinatorial complexity. Examples of such nontrivial calculations will appear throughout the following Chapters.
Remark 4.1. The combinatorial explosion danger of symbolic computations should be always kept in mind. For example, the numerical inversion of a N N matrix is a O ( N 3 ) process, whereas symbolic inversion goes as O ( N !). For N = 48 the oating-point numerical inverse will be typically done in a fraction of a second. But the symbolic adjoint will have 48! = 12413915592536072670862289047373375038521486354677760000000000 terms, or O (1061 ). There may be enough electrons in this Universe to store that, but barely ...
Notes and Bibliography As noted in 4.1.2 the hefty Mathematica Book [274] is a reference manual. Since the contents are available online (click on Help in topbar) as part of purchase of the full system,15 buying the printed book is optional.16 There is a nice tutorial available by Glynn and Gray [113], list: $35, dated 1999. (Theodore Gray invented the Notebook front-end that appeared in version 2.2.) It can be also purchased on CDROM from MathWare, Ltd, P. O. Box 3025, Urbana, IL 61208, e-mail: [email protected]. The CDROM is a hyperlinked version of the book that can be installed on the same directory as Mathematica. More up to date and comprehensive is the recent appeared Mathematica Navigator in two volumes [214,215]; list: $69.95 but used copies are discounted, down to about $20. Beyond these, there are many books at all levels that expound on the use of Mathematica for various applications ranging from pure mathematics to physics and engineering. A web search (September 2003) on www3.addall.com hit 150 book titles containing Mathematica, compared to 111 for Maple and 148 for Matlab. A google search (August 2005) hits 3,820,000 pages containing Mathematica, but here Matlab wins with 4,130,000. Wolfram Research hosts the MathWorld web site at http://mathworld.wolfram.com, maintained by Eric W. Weisstein. It is essentially a hyperlinked, on-line version of his Encyclopdia of Mathematics [263].
14
The current record for FEM structural applications is about 100 million equations, done on a massively parallel supercomputer (ASCI Red at SNL). Fluid mechanics problems with over 500 million equations have been solved. The student version comes with limited help. The fth edition, covering version 5, lists for $49.95 but older editions are heavily discounted on the web, some under $2.
15 16
416
417
4.
References
To close the topic of symbolic versus numerical computation, here is a nice summary by A. Grozin, posted on the Usenet: Computer Algebra Systems (CASs) are programs [that] operate with formulas. Mathematica is a powerful CAS (though quite expensive). Other CASs are, e.g., Maple, REDUCE, MuPAD <...>. There are also quite powerful free CASs: Maxima and Axiom. In all of these systems, it is possible to do some numerical calculations (e.g., to evaluate the formula you have derived at some numerical values of all parameters). But it is a very bad idea to do large-scale numerical work in such systems: performance will suffer. In some special cases (e.g., numerical calculations with very high precision, impossible at the double-precision level), you can use Mathematica to do what you need, but there are other, faster ways to do such things. There are a number of programs to do numerical calculations with usual double-precision numbers. One example is Matlab; there are similar free programs, e.g., Octave, Scilab, R, ... Matlab is very good and fast in doing numerical linear algebra: if you want to solve a system of 100 linear equations whose coefcients are all numbers, use Matlab; if coefcients contain letters (symbolic quantities) and you want the solution as formulas, use Mathematica or some other CAS. Matlab can do a limited amount of formula manipulations using its symbolic toolbox, which is an interface to a cut-down Maple. Its a pain to use this interface: if you want Maple, just use Maple. References Referenced items have been moved to Appendix R.
417
418
Homework Exercises for Chapter 4 Analysis of Example Truss by a CAS Before doing any of these Exercises, download the Mathematica Notebook le ExampleTruss.nb from the course web site. (Go to Chapter 4 Index and click on the link). Open this Notebook le using version 4.1 or later one. The rst eight cells contain the modules and test statements listed in the top boxes of Figures 4.613. The rst six of these are marked as initialization cells. Before running driver scripts, they should be executed by picking up Kernel Evaluation Execute Initialization. Verify that the output of those six cells agrees with that shown in the bottom boxes of Figures 4.613. Then execute the driver scripts in Cells 78 by clicking on each cell and pressing the appropriate key: <Enter> on a Mac, <Shift-Enter> on a Windows PC. Compare the output with that shown in Figures 4.1213. If the output checks out, you may proceed to the Exercises.
EXERCISE 4.1 [C:10] Explain why the Simplify command in the test statements of Figure 4.3 says L>0.
(One way to gure this out is to just say Ke=Simplify[Ke] and look at the output. Related question: why does Mathematica refuse to simplify Sqrt[L^2] to L unless one species the sign of L in the Simplify command?
EXERCISE 4.2 [C:10] Explain the logic of the For loops in the merge function MergeElemIntoMasterStiff of Figure 4.4. What does the operator += do? EXERCISE 4.3 [C:10] Explain the reason behind the use of Length in the modules of Figure 4.6. Why not simply set nk and np to 6 and 3, respectively? EXERCISE 4.4 [C:15] Of the seven modules listed in Figures 4.3 through 4.8, with names collected in (4.2),
two can be used only for the example truss, three can be used for any plane truss, and two can be used for other structures analyzed by the DSM. Identify which ones and briey state the reasons for your classication.
EXERCISE 4.5 [C:20] Modify the modules AssembleMasterStiffOfExampleTruss, IntForcesOfExampleTruss and the driver script of Figure 4.9 to solve numerically the three-node, two-member truss of Exercise 3.6. Verify that the output reproduces the solution given for that problem. Hint: modify cells but keep a copy of the original Notebook handy in case things go wrong. EXERCISE 4.6 [C:25] Expand the logic of ModifiedMasterForcesForDBC to permit specied nonzero dis-
placements. Specify these in a second argument called pval, which contains a list of prescribed values paired with pdof.
xynode={{0,0},{10,0},{10,10}}; elenod={{1,2},{2,3},{3,1}}; unode={{0,0},{0,0},{2/5,-1/5}}; amp=5; p={}; For [t=0,t<=1,t=t+1/5, For [e=1,e<=Length[elenod],e++, {i,j}=elenod[[e]]; xyi=xynode[[i]];ui=unode[[i]];xyj=xynode[[j]];uj=unode[[j]]; p=AppendTo[p,Graphics[Line[{xyi+amp*t*ui,xyj+amp*t*uj}]]]; ]; ]; Show[p,Axes->False,AspectRatio->Automatic];
EXERCISE 4.7 [C:20] Explain what the program of Figure E4.1 does, and the logic behind what it does. (You
may want to put it in a cell and execute it.) What modications would be needed so it can be used for any plane struss?
418
Introduction to FEM
IFEM Ch 4 Slide 1
Introduction to FEM
IFEM Ch 4 Slide 2
Introduction to FEM
Matlab is not a CAS ("Ma" in Matlab stands for Matrix, not Math) And a host of minor players: Mathcad, Magma, ... etc
IFEM Ch 4 Slide 3
Introduction to FEM
Why Mathematica?
Strong points Implemented on many platforms
(Maple is primarily used under Unix, does not have a Mac version)
Programming facilities Graphics (greatly improved in Versions 6-7) Good documentation & many application books Since 1 August 2007: 1-year renewable campus license, free to students, faculty and staff
IFEM Ch 4 Slide 4
Introduction to FEM
MATHEMATICA
Symbolic calculations
MATLAB Floating-point (a.k.a. inexact) numeric calculations Floating-point (a.k.a. inexact) numeric calculations
IFEM Ch 4 Slide 5
Introduction to FEM
Popularity Contest by Number of "Hits" on www3.addall.com Book Search Engine (Sep 2003)
IFEM Ch 4 Slide 6
Introduction to FEM
IFEM Ch 4 Slide 7
Introduction to FEM
Eligibility: students, faculty, staff and departments of all CU campuses Platforms: Mac OSX, Windows, Linux, Solaris, AIX, HP-UX How to Get It 1) Download and install software as per instructions at http://sitelic.colorado.edu/mathematica, or request an installation CD from the Site Licensing office: [email protected], 303-492-8995 2) Register your copy online at http://register.wolfram.com/ using campus license number L2437-5121 plus your computer MathID number. Be sure to use your CU mail address. 3) A password (unique to your computer) will be forwarded to you via email from Site Licensing ITS Support Question & tech support problems: send email to [email protected] Periodic hands-on workshops are available for those new to the software, click on Workshops on the Web page given above. Details (for example: what is a MathID?) about licensing & support are posted at the above web site.
IFEM Ch 4 Slide 8
Introduction to FEM
Integration example
f[x_,_,_]:=(1+*x^2)/(1+*x+x^2); F=Integrate[f[x,-1,2],{x,0,5}]; F=Simplify[F]; Print[F]; Print[N[F]]; F=NIntegrate[f[x,-1,2],{x,0,5}]; Print["F=",F//InputForm];
Input Cell
Output Cells
IFEM Ch 4 Slide 9
Introduction to FEM
Fa=Integrate[f[z,a,b],{z,0,5}]; Fa=Simplify[Fa]; Print["Fa=",Fa]; Plot3D[Fa,{a,-1.5,1.5},{b,-10,10},ViewPoint->{-1,-1,1}]; Fa=FullSimplify[Fa]; (* very slow but you get *) Print["Fa=",Fa];
Fa 2 2 10 4 a a2 a a2 a2 2 a 4 4 a2 a2 b 2 4 a 4 a2 b Log 26 a a2 10 4 b Log 10 5a 2 a2 b Log 1 4 a a2 a2 a 4 4 a2 4 a2 2 a2 b Log 1 a a2 a2 b Log a2 b Log 10 10 4 a a2 a2 a 4 4 a2 4 a2 a 4 a2
b Log 1 4 a2 2 b Log
10
Fa 5 b 2
1 a b Log 26 2 2 a2 b
IFEM Ch 4 Slide 10
Introduction to FEM
Stiffness Assembler
Bar Stiffness
Element Library
IFEM Ch 4 Slide 11
Introduction to FEM
Cells 7-8
AssembleMasterStiffOfExampleTruss
ModifiedMasterStiffForDBC
Cell 3
Cell 4
IntForcesOfExampleTruss
Cell 6
MergeElemIntoMasterStiff
Cell 2
ElemStiff2DTwoNodeBar
IntForces2DTwoNodeBar
Cell 1
Cell 5
IFEM Ch 4 Slide 12
Introduction to FEM
10 10 10 10
10 10 10 10
10 10 10 10
10 10 10 10
A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L A Em 2 2 L
IFEM Ch 4 Slide 13
Introduction to FEM
IFEM Ch 4 Slide 14
Introduction to FEM
IFEM Ch 4 Slide 15
Introduction to FEM
1, 2, 3, 4, 5, 6,
6 6 6 6 6 6
IFEM Ch 4 Slide 16
Introduction to FEM
IFEM Ch 4 Slide 17
Introduction to FEM
IntForcesOfExampleTruss[u_]:= Module[{f=Table[0,{3}]}, f[[1]]=IntForce2DTwoNodeBar[{{0,0},{10,0}},{100,1},{1,2,3,4},u]; f[[2]]=IntForce2DTwoNodeBar[{{10,0},{10,10}},{100,1/2},{3,4,5,6},u]; f[[3]]=IntForce2DTwoNodeBar[{{0,0},{10,10}},{100,2*Sqrt[2]}, {1,2,5,6},u]; Return[f] ]; f=IntForcesOfExampleTruss[{0,0,0,0,0.4,-0.2}]; Print["Internal member forces in example truss:"];Print[N[f]];
Internal member forces in example truss: {0., -1., 2.82843}
IFEM Ch 4 Slide 18
Introduction to FEM
IFEM Ch 4 Slide 19
Introduction to FEM
IFEM Ch 4 Slide 20
Introduction to FEM
Driver program (samples in Cells 7 & 8) AssembleMasterStiffOfExampleTruss Assembly ElemStiff2DTwoNodeBar MergeElemIntoMasterStiff ModifiedMasterStiffForDBC ModifiedMasterForcesForDBC [Solve: by library] IntForcesOfExampleTruss IntForce2DTwoNodeTruss Postprocessing Globalization Merge Apply BCs
IFEM Ch 4 Slide 21
419
Homework Exercises for Chapter 4 Analysis of Example Truss by a CAS Solutions
EXERCISE 4.1 Not assigned. EXERCISE 4.2 Not assigned. EXERCISE 4.3 Not assigned. EXERCISE 4.4
Solutions to Exercises
Usable for any plane truss but not other elements Usable for any plane truss but not other elements Usable for example truss only Usable for any structure Usable for any structure Usable for any plane truss but not other elements Usable for example truss only
EXERCISE 4.5 Cells 3, 6 and 7 are modied as shown in Figure E4.2 below. The other cells can be kept
untouched.
Cell 3: module to assemble master stiffness matrix of truss of Exercise 3.6
AssembleMasterStiffOfExampleTruss[]:= Module[{Ke,K=Table[0,{6},{6}]}, Ke=ElemStiff2DTwoNodeBar[{{-4,0},{0,3}},{1000,2}]; K= MergeElemIntoMasterStiff[Ke,{1,2,3,4},K]; Ke=ElemStiff2DTwoNodeBar[{{ 0,3},{4,0}},{1000,4}]; K= MergeElemIntoMasterStiff[Ke,{3,4,5,6},K]; Return[K] ];
419
420
420
51
52
TABLE OF CONTENTS
Page
5.1. 5.2.
5.3.
5.4.
5. 5. 5.
Introduction Formulation of MoM Members 5.2.1. What They Look Like . . . . . . . . 5.2.2. End Quantities, Degrees of Freedom, Joint Forces 5.2.3. Internal Quantities . . . . . . . . . . 5.2.4. Discrete Field Equations, Tonti Diagram . . . Simplex MoM Members 5.3.1. The Bar Element Revisited . . . . . . . 5.3.2. The Spar Element . . . . . . . . . . 5.3.3. The Shaft Element . . . . . . . . . . *Non-Simplex MoM Members 5.4.1. *Formulation Rules . . . . . . . . . . 5.4.2. *Examples . . . . . . . . . . . . Notes and Bibliography . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
52
53 5.1. Introduction
5.2
The truss member used as example in Chapters 24 is an instance of a structural element. Such elements may be formulated directly using concepts and modeling techniques developed in Mechanics of Materials (MoM).1 The construction does not involve the more advanced tools that are required for the continuum nite elements that appear in Part II. This Chapter presents an overview of the technique to construct the element stiffness equations of MoM members using simple matrix operations. These simplied equations come in handy for a surprisingly large number of applications, particularly in skeletal structures. Focus is on simplex elements, which may be formed directly as a sequence of matrix operations. Non-simplex elements are presented as a recipe because their proper formulation requires work theorems not yet studied. The physical interpretation of the FEM is still emphasized. Consequently we continue to speak of structures built up of members (elements) connected at joints (nodes). 5.2. Formulation of MoM Members 5.2.1. What They Look Like MoM-based formulations are largely restricted to intrinsically one-dimensional members. These are structural components one of whose dimensions, called longitudinal, is signicantly larger than the other two, called the transverse dimensions. Such members are amenable to the simplied structural theories developed in MoM textbooks. This Chapter covers only straight members with geometry dened by the two end joints.2 The member cross sections are dened by the intersection of planes normal to the longitudinal dimension with the member. See Figure 5.1. Note that although the individual member will be idealized as being one-dimensional in its intrinsic or local coordinate system, it often functions as component of a two- or three-dimensional structure. This class of structural components embodies bars, beams, beam-columns, shafts and spars. Although geometrically similar, the names distinguish the main kind of internal forces the member resists and transmits: axial forces for bars, bending and shear forces for beams, axial compression and bending for beam-columns, torsion forces for shafts, and shear forces for spars. Members are connected at their end joints by displacement degrees of freedom. For truss (bar) and spar members those freedoms are translational components of the joint displacements. For other types, notably beams and shafts, nodal rotations are chosen as additional degrees of freedom. Structures fabricated with MoM members are generally three-dimensional. Their geometry is dened with respect to a global Cartesian coordinate system {x , y , z }. Two-dimensional idealizations are useful simplications should the nature of the geometry and loading allow the reduction of the structural model to one plane of symmetry, which is chosen to be the {x , y } plane. Plane trusses and plane frameworks are examples of such simplications.
1
Mechanics of Materials was called Strength of Materials in older texts. It covers bars, beams, shafts, arches, thin plates and shells, but only one-dimensional models are considered in introductory undergraduate courses. MoM involves ab initio phenomenological assumptions such as plane sections remain plane or shear effects can be neglected in thin beams. These came about as the byproduct of two centuries of structural engineering practice, justied by success. A similar acronym (MOM) is used in Electrical Engineering for something completely different: the Method of Moments. Advanced Mechanics of Materials includes curved members. Plane arch elements are studied in Chapter 13.
53
54
Figure 5.1. A Mechanics of Materials (MoM) member is a structural element one of whose dimensions (the longitudinal dimension) is signicantly larger than the other two. Local axes {x , y , z } are chosen as indicated. Although the depicted member is prismatic, some applications utilize tapered or stepped members, the cross section of which varies as a function of x .
In this Chapter we study generic structural members that t the preceding class. An individual member is identied by e but this superscript will be usually suppressed in the equations below to reduce clutter. The local axes are denoted by {x , y , z }, with x along the longitudinal direction. See Figure 5.1. The mathematical model of a MoM member is obtained by an idealization process. The model represents the member as a line segment that connects the two end joints, as depicted in Figure 5.2. 5.2.2. End Quantities, Degrees of Freedom, Joint Forces The set of mathematical variables used to link members are called end quantities or connectors. In the Direct Stiffness Method (DSM) these are joint displacements (the degrees of freedom) and the joint forces. These quantities are related by the member stiffness equations. . The degrees of freedom at the end joints i and j are collected in the joint displacement vector u This may include translations only, rotations only, or a combination of translations and rotations. . Component The vector of joint forces f groups components in one to one correspondence with u pairs must be conjugate in the sense of the Principle of Virtual Work. For example if the x -translation , the corresponding entry in f is the x -force fxi at i . If the rotation about at joint i : u xi appears in u z j appears in u , the corresponding entry in z at joint j : f is the z -moment m zj . 5.2.3. Internal Quantities Internal quantities are mechanical actions that take place within the member. Those actions involve stresses and deformations. Accordingly two types of internal quantities appear: Internal member forces form a nite set of stress-resultant quantities collected in an array p. They are obtained by integrating stresses over each cross section, and thus are also called generalized stresses in structural mechanics. This set characterizes the forces resisted by the material. Stresses at any point in a section may be recovered if p is known. Member deformations form a nite set of quantities, chosen in one-to one correspondence with internal member forces, and collected in an array v. This set characterizes the deformations experienced by the material. They are also called generalized strains in structural theory. Strains at any point in the member can be recovered if v is known. As in the case of end quantities, internal forces and deformations are paired in one to one correspondence. For example, the axial force in a bar member must be paired either with an average 54
55
5.2
y i z
(e)
Internal quantities are defined within the member and may depend on x .
Figure 5.2. The FE mathematical idealization of a MoM member. The model is one-dimensional in x . The two end joints are the site of end quantities: joint forces and displacements, that interconnect members. Internal quantities characterize internal forces, stresses and deformations in the member.
axial deformation, or with the total elongation. Pairs that mutually correspond in the sense of the Principle of Virtual Work are called conjugate. Unlike the case of end quantities, conjugacy of internal quantities is not a mandatory requirement although it simplies some expressions. 5.2.4. Discrete Field Equations, Tonti Diagram , v, p and The matrix equations that connect u f are called the discrete eld equations. There are three of them. by the kinematic compatibility The member deformations v are linked to the joint displacements u conditions, also called the deformation-displacement or strain-displacement equations: . v = Bu (5.1)
u
The internal member forces are linked to the member deformations by the constitutive equations. In the absence of initial strain effects those equations are homogeneous: p = S v. (5.2)
Stiffness =A SBu=K u f
T
Kinematic v=Bu
Equilibrium = AT p f
Finally, the internal member forces are linked to the joint forces by the equilibrium equations. If the internal forces p are constant over the member, the relation is simply f = AT p. (5.3)
p=Sv
Constitutive
Figure 5.3. Tonti diagram of the three discrete eld equations (5.1)(5.3) and the stiffness equation (5.4) for a simplex MoM member. Internal and end quantities appear inside the orange and yellow boxes, respectively.
55
56
The foregoing equations can be presented graphically as shown in Figure 5.3. This is a discrete variant of the so-called Tonti diagrams, which represent governing equations as arrows linking boxes containing kinematic and static quantities. Tonti diagrams for eld (continuum) equations are introduced in Chapter 11. Matrices B, S and A receive the following names in the literature: A S B Equilibrium, leverage Rigidity, material, constitutive4 Compatibility, deformation-displacement, strain-displacement
If the element is sufciently simple, the determination of these three matrices can be carried out through MoM techniques. If the construction requires more advanced tools, however, recourse to the general methodology of nite elements and variational principles is necessary. 5.3. Simplex MoM Members Throughout this section we assume that the internal quantities are constant over the member length. Such members are called simplex elements. If so the matrices A, B and S are independent of member cross section. For simplex elements the derivation of the element stiffness equations reduces to a straightforward sequence of matrix multiplications. Under the constancy-along-x assumption, elimination of the interior quantities p and v from (5.1)(5.3) yields the element stiffness relation u =K , f = AT S B u whence the element stiffness matrix is = AT S B. K (5.5) (5.4)
, u }, are conjugate in the sense of the Principle of Virtual Work, it can be If both pairs: {p, v} and {f shown that A = B and that S is symmetric. In that case = BT SB. K (5.6)
is a symmetric matrix. Symmetry is computationally desirable for reasons outlined in Part III.
symmetric even if S is unsymmetric and A = B. However there are more opportunities to go wrong. must come out to be are conjugate (as required in 5..2.2) but p and v are not, K Remark 5.1. If f and u
5.3.1. The Bar Element Revisited The simplest MoM element is the prismatic bar or truss member already derived in Chapter 2. See Figure 5.4. This qualies as simplex because all internal quantities are constant. One minor difference in the derivation below is that the joint displacements and forces in the y direction are omitted in the generic element because they contribute nothing to the stiffness equations. In the
4
The name rigidity matrix for S is preferable. It is a member integrated version of the cross section constitutive equations. The latter are usually denoted by symbol R, as in 5.4.
56
57
5.3
(a) z F z x y
(b) y xi i f xi , u EA xj j f xj , u x
Figure 5.4. The prismatic bar (also called truss) member: (a) individual member shown in 3D space, (b) idealization as generic member.
FEM terminology, freedoms associated with zero stiffness are called inactive. Three choices for internal deformation and force variables are considered next. The results conrm that the element stay the same. stiffness equations coalesce, as expected, since the end quantities f and u Derivation Using Axial Elongation and Axial Force. The member axial elongation d is taken as deformation measure, and the member axial force F as internal force measure. Hence v and p reduce to the scalars d and p F , respectively. The chain of discrete eld equations is easily constructed: d = [ 1 Consequently = AT S B = S BT B = S [ 1 K 1] EA 1 = 1 L 1 1 1 . 1 (5.8) 1] u xi u xj , = Bu F= EA d = S d, L f= fxi fx j = 1 F = AT F . 1 (5.7)
Note that A = B because F and d are conjugate: F d is work. The foregoing equations can be represented graphyically with the discrete Tonti diagram of Figure 5.5.
Stiffness EA 1 1 _ u f= 1 1 L _ _ u f
_
d=
Kinematic u xi = Bu 1 1 u xj d
f= F= EA d = Sd L Constitutive
Equilibrium fxi 1 = F = AT F 1 fx j
Figure 5.5. Tonti diagram for the bar element discrete equations (5.7)(5.8).
Derivation Using Mean Axial Strain and Axial Force. Instead of d we may use the mean axial strain e = d / L as deformation measure whereas F is kept as internal force measure. The only change 57
58
(a) z z x y
fyj , u yj j x
Figure 5.6. The prismatic spar (also called shear-web) member: (a) individual member shown in 3D space, (b) idealization as generic member in local system.
is that B becomes [ 1 1 ] / L whereas S becomes E A. Matrix A does not change. The product as in (5.8), as can be expected. Now AT is not equal to B because F and AT S B gives the same K e are not conjugate, but they differ only by a factor 1/ L . Derivation Using Mean Axial Strain and Axial Stress. We keep the mean axial strain e = d /L as deformation measure but take the mean axial stress = F / A (which is not conjugate to e ) as internal force measure. Now B = [ 1 1 ] / L , S = E and AT = A [ 1 1 ]. The product AT S B shown in (5.8). gives again the same K y j are not part of (5.7) and (5.8) the Transformation to Global Coordinates. Since u yi and u displacement transformation matrix from local to global {x , y } coordinates is 2 4, instead of 4 4 as in 2.8.1. On restoring the element identier e the appropriate local-to-global transformation is ue xi e 0 u yi = Te ue , s ue xj ue yj
e = u
u e xi u e xj
c 0
s 0
0 c
(5.9)
, cf. Figure 2.8. The 4 4 globalized where c = cos e , s = sin e , and e is the angle from x to x e e T e e element stiffness matrix K = (T ) K T agrees with (2.18). The extension of (5.9) to 3D is handled as an Exercise. 5.3.2. The Spar Element The spar or shear-web member has two joints (end nodes): i and j . This member can only resist and transmit a constant shear force V in the plane of the web, which is chosen to be the {x , y } plane. See Figure 5.6. It is often used for modeling high-aspect aircraft wing structures, as illustrated in Figure 5.7. We consider here only prismatic spar members of uniform material and constant cross section, which thus qualify as simplex. The active degrees of freedom for a generic spar member of length L , as depicted in Figure 5.6(b), y j . Let G be the shear modulus and As the effective shear area. (A concept developed are u yi and u in Mechanics of Materials; for a narrow rectangular cross section, As = 5 A /6.) The shear rigidity is G As . As deformation measure the mean shear strain = V /(G As ) is chosen. 58
5.3
1 V = AT V , 1 (5.10) Note that A = B because V and are not work-conjugate. (This difference is easily adjusted for, however; see Exercise 5.1.) The local stiffness equations follow as = 1 [ 1 L 1] , = Bu V = G As = S , f= = f= fyi fy j = = AT S Bu G As L 1 1 1 1 u yi u yj u . =K (5.11)
u yi u yj
fyi fy j
If the spar member is used in a two dimensional context, the displacement transformation from local to global coordinates {x , y } is ue xi e u e s c 0 0 yi u yi = Te ue , e = = u u e 0 0 s c u e yj xj ue yj (5.12) e e e where c = cos , s = sin , and is the angle from x to x , cf. Figure 2.8. The 4 4 globalized e Te . This spar stiffness matrix is then Ke = (Te )T K is worked out in Exercise 5.2. More often, however, the spar member will be a component in a three-dimensional structural model, e.g. the aircraft wing shown in Figure 5.7. If so the determination of the 26 transformation matrix is more involved, as an orientation node is required. This is the topic of Exercise 5.5. 5.3.3. The Shaft Element The shaft, also called torque member, has two joints (end nodes): i and j . A shaft can only resist and transmit a constant torque or twisting moment T along its longitudinal axis x , as pictured in Figure 5.8(a). We consider here only prismatic shaft members with uniform material and constant cross section, which thus qualify as simplex. The active degrees of freedom of a generic shaft member of length L , x j . These are the innitesimal end rotations about x xi and , positive depicted in Figure 5.8(b), are according to the right-hand rule. The associated joint (node) forces are end moments denoted as m xi and m xj. The only internal force is the torque T , positive if acting as pictured in Figure 5.8(a). Let G be the shear modulus and G J the effective torsional rigidity.5 As deformation measure pick the relative
5
Figure 5.7. Spar members in aircraft wing (Piper Cherokee). For more impressive aircraft structures see CAETE slides.
J has dimension of (length)4 . For a circular or annular cross section it reduces to the polar moment of inertia about x . The determination of J for noncircular cross sections is covered in Mechanics of Materials textbooks.
59
510
(a) y z _ _ m xi , xi x y z T
x _ _ m xj , xj T xi m xi, i
Figure 5.8. The prismatic shaft (also called torque member): (a) individual member shown in 3D space, (b) idealization as generic member in the local system.
x j xi . The kinematic, constitutive, and equilibrium equations provided by twist angle = Mechanics of Materials are = [ 1 1] xi x j , = Bu T = GJ = S , L f= m xi m xj = 1 T = BT T . 1 (5.13)
If the shaft is used in a two-dimensional context, the displacement transformation to global coordinates {x , y } within the framework of innitesimal rotations, is
e xi e x j e xi e 0 yi = Te e , e s x j e y j
e = u
c 0
s 0
0 c
(5.15)
. Note that e collects only where as usual c = cos e , s = sin e , and e is the angle from x to x global node rotations components. This operation is elaborated further in Exercise 5.3.
5.4.
The straightforward formulation of simplex MoM elements does not immediately carry over to the case in which internal quantities p and v vary over the member; that is, depend on x . The dependence may be due to element type, varying cross section, or both. As a result, one or more of the matrices A, B and S depend on x . Such members are called non-simplex. e of non-simplex The matrix multiplication rule (5.4) cannot be used to construct the element stiffness matrix K T e )B(x ) would depend on x . On the other hand, K members. This can be grasped by observing that A(x ) S(x and must be independent of x because it relates the end quantities u f.
510
511
5.4.1. *Formulation Rules
The derivation of non-simplex MoM elements requires use of the work principles of mechanics, for example the Principle of Virtual Work or PVW. Thus, more care must be exercised in the choice of conjugate internal quantities. The following rules can be justied through the arguments presented in Part II. They are stated here as recipe, and apply only to displacement-assumed elements. Rule 1. Select internal deformations v(x ) and internal forces p(x ) that are conjugate in the PVW sense. Link deformations to node displacements by v(x ) = B(x )u. Rule 2. From the PVW it may be shown (see Remark 5.2 below) that the force equilibrium equation exists only in a differential sense: f. (5.16) BT d p = d Here d in d p denotes differentiation with respect to x . The meaning of d p is simply p(x ) dx . That is, the differential of internal forces as one passes from cross-section x to a neighboring one x +d x . The interpretation of d f is less immediate because f is not a function of x . It actually means the contribution of that member slice to the building of the node force vector f. See (5.18) and (5.19) below. Rule 3. The constitutive relation is p = Rv, (5.17)
= f
0 L
Stiffness u BT R B dx
in which R, which may depend on x , must be symmetric. Note that symbol R in (5.17) replaces the S of (5.2). Matrix R pertains to a specic cross section whereas S applies to the entire member. This distinction is further elaborated in Exercise 5.9. The discrete relations supplied by the foregoing rules are displayed in the discrete Tonti diagram of Figure 5.9. Internal quantities are now eliminated starting from the differential equilibrium relation (5.16):
Kinematic
Equilibrium
v=Bu
= BT dp df p=Rv Constitutive p
Figure 5.9. Discrete Tonti diagram of the equations for a non-simplex MoM member.
(5.18)
d f=
u =K , BT R B d x u
(5.19)
does not depend on x because u . Consequently the local element stiffness matrix is = K
0 L
BT R B d x
(5.20)
The recipe (5.20) will be justied in Part II through energy methods. It will be seen that it generalizes to arbitrary displacement-assumed nite elements in any number of space dimensions. It is used in the derivation of the stiffness equations of the plane beam element in Chapter 12. The reduction of (5.20) to (5.6) when the dependence on x disappears is the subject of Exercise 5.8.
T = d pT v = d pT (B u ) = and associated deformations v: d undergoing virtual node displacements u f u T T T . Since u is arbitrary, B d p = d f. (B d p) u
Remark 5.2. The proof of (5.16) follows by equating expressions of the virtual work of a slice of length d x
511
512
5.4.2. *Examples
Example 5.1. A two-node bar element has constant elastic modulus E but a continuously varying area: Ai ,
A j and Am at i , j and m , respectively, where m is the midpoint between end joints i and j . This variation can be tted by ) + A j N j (x ) + Am Nm ( x ). (5.21) A( x ) = A i Ni ( x ) = 1 (1 ), N j (x ) = 1 (1 + ) and Nm (x ) = 1 2 , with = 2x / L 1, are interpolating Here Ni (x 2 2 polynomials further studied in Part II as element shape functions. As internal quantities take the strain e and the axial force p = E Ae, which are conjugate quantities. Assuming the strain e to be uniform over the element (this is characteristic of a displacement assumed element and is justied through the method of shape functions explained in Part II.) the MoM equations are , e = Bu p = E A( x ) e = R (x ) e, d f = BT d p, B= 1 [ 1 L 1]. (5.22)
Inserting into (5.20) and carrying out the integration yields = EA K L 1 1 1 , 1 with = 1 ( Ai + A j ) + 2 Am . A 6 3 (5.23)
Example 5.2. Same as in the previous case but now the strain e is taken to be e = p /( E A), whereas the axial and are best force p is constant and dened by p = fxi = fx j . The integrals become rational functions of x evaluated through Mathematica. The completion of this Example is the matter of an Exercise.
Notes and Bibliography The derivation of MoM elements using straightforward matrix algebra is typical of pre-1962 Matrix Structural Analysis (MSA). The excellent book of Pestel and Leckie [193], unfortunately out of print, epitomizes that approach. Historically this idea interweaved with Generation 1 of FEM, as outlined in 1.5.3. By 1970 simplied derivations had fallen out of favor as yokelish. But these elements do not need improvement. They still work ne: a bar or beam stiffness today is the same as 40 years ago.6 The Mechanics of Materials books by Beer-Johnston [19] and Popov [200] can be cited as being widely used in US undergraduate courses. But they are not the only ones. A September 2003 in-print book search through www3.addall.com on Mechanics of Materials returns 99 hits whereas one on Strength of Materials (the older name) compiles 112. Folding editions and paper/softback variants one gets about 60 books; by all accounts an impressive number. Spar members are discussed only in MoM books that focus on aircraft structures, since they are primarily used in modeling shear web action. On the other hand, bars, shafts and beams are standard fare. The framework presented here is a tiny part of MSA. A panoramic view, including linkage to continuum formulations from the MSA viewpoint, is presented in [79]. The source of Tonti diagrams is discussed in Chapter 11. References Referenced items have been moved to Appendix R.
The chief technical difference is the heavier use of differential equations prior to 1962, as opposed to the energy methods in vogue today. The end result for simple one-dimensional models is the same.
512
513
Homework Exercises for Chapter 5 Constructing MoM Members
Exercises
formulated in 5.3.2, so that A = B. Draw the Tonti diagram with the discrete equations for that choice of v and p , using Figure 5.5 as guide (that is, with the actual matrix equations along the arrows).
EXERCISE 5.1 [A:10] Explain how to select the deformation variable v (paired to V ) of the spar member
EXERCISE 5.2 [A:15] Obtain the 4 4 global element stiffness matrix of a prismatic spar member in a two
dimensional Cartesian system {x , y }. Start from (5.11). Indicate where the transformation (5.12) comes from e Te in closed form. (Hint: read 2.8). Evaluate Ke = (Te )T K
EXERCISE 5.3 [A:15] Obtain the 4 4 global element stiffness matrix of a prismatic shaft element in a two dimensional Cartesian system {x , y }. Include only node rotation freedoms in the global displacement vector. Start from (5.14). Justify the transformation (5.15) (Hint: innitesimal rotations transform as vectors). e Te in closed form. Evaluate Ke = (Te )T K
(a)
j (x j , y j , zj ) uxj x E, A
(b)
j y i (x i , yi , z i ) y z z x
Figure E5.1. Bar element in 3D for Exercise 5.4.
uxi
y L i
EXERCISE 5.4 [A+N:15(10+5)] A bar element moving in three dimensional space is completely dened
by the global coordinates {xi , yi , z i }, {x j , y j , z j } of its end nodes i and j , as illustrated in Figure E5.1. e = Tue . The 2 6 displacement transformation matrix T, with superscript e dropped for brevity, links u e e contains the two local displacements u xi and u x j whereas u contains the six global displacements Here u u xi , u yi , u zi , u x j , u y j , u z j . (a) From vector mechanics show that T= 1 L x ji 0 y ji 0 z ji 0 0 x ji 0 y ji 0 z ji = cx ji c y ji cz ji 0 0 0 0 0 0 cx ji c y ji cz ji (E5.1)
in which L is the element length, x ji = x j xi , etc., and cx ji = x ji / L , etc., are the direction cosines of the vector going from i to j . (b) Evaluate T for a bar going from node i at {1, 2, 3} to node j at {3, 8, 6}.
EXERCISE 5.5 [A+N:30(10+15+5)] A spar element in three dimensional space is only partially dened by the global coordinates {xi , yi , z i }, {x j , y j , z j } of its end nodes i and j , as illustrated in Figure E5.2. The problem is that axis y , which denes the direction of shear force transmission, is not uniquely dened by i 7 and j . Most FEM programs use the orientation node method to complete the denition. A third node k , not
7
The same ambiguity arises in beam elements in 3D space. These elements are covered in Part III.
513
514
(b) a b h m i c Lc j x
(a)
k (xk , yk , z k) G, A s u yi i (x i , yi , z i) y z z x y
uyj j (x j , y j , z j) x y
uxi
colinear with i and j , is provided by the user. Nodes {i , j , k } dene the {x , y } plane and thus z . The projection of k on line i j is point m . The distance h > 0 from m to k is called h as shown in Figure E5.2(b). The e = Tue . 2 6 displacement transformation matrix T, with superscript e omitted to reduce clutter, relates u e contains the local transverse displacements u yi and u y j whereas ue contains the global displacements Here u u xi , u yi , u zi , u x j , u y j , u z j . (a) Show that T= 1 h xkm 0 ykm 0 z km 0 0 xkm 0 ykm 0 z km = cxkm c ykm czkm 0 0 0 0 0 0 cxkm c ykm czkm (E5.2)
in which xkm = xk xm , etc., and cxkm = xkm / h , etc., are the direction cosines of the vector going from m to k . (Assume that the position of m is known. That computation is carried out in the next item.) (b) Work out the formulas to compute the coordinates of point m in terms of the coordinates of {i , j , k }. Assume a , b and L are computed immediately from the input data. Using the notation of Figure E5.2(b) p ( p a )( p b)( p L ) with and elementary trigonometry, show that h = 2 A / L , where A = 2 2 2 ( L + a + b ) (Heron s formula), cos = ( L + b a )/( 2 bL ) , cos = ( L 2 + a 2 b2 )/(2a L ), p= 1 2 c = b cos , L c = a cos , xm = xi ( L c)/ L + x j c/ L , etc.8 Evaluate T for a spar member going from node i at {1, 2, 3} to node j at {3, 8, 6}. with k at {4, 5, 6}.
(c)
EXERCISE 5.6 [A:20] Explain how thermal effects can be generally incorporated in the constitutive equation
An alternative and more elegant procedure, found by a student in 1999, can be sketched as follows. From Figure E5.2(b) obviously the two subtriangles imk and jkm are right-angled at m and share side km of length h . Apply Pythagoras theorem twice, and subtract so as to cancel out h 2 and c2 , getting a linear equation for c that can be solved directly.
514
515
Exercises
EXERCISE 5.10 [A:25(10+5+10)] Consider a non-simplex element in which R varies with x but B = A is
R(x ) dx
0
(E5.3)
for a tapered bar with area dened by the linear law A = Ai (1 x Apply (E5.3) to obtain K /L ) + A j x /L , where Ai and A j are the end areas at i and j , respectively. Take B = [ 1 1 ] / L . Apply (E5.3) to verify the result (5.23) for a bar with parabolically varying cross section.
EXERCISE 5.11 [A/C+N:30(25+5)] A prismatic bar element in 3D space is referred to a global coordinate
system {x , y , z }, as in Figure E5.1. The end nodes are located at {x1 , y1 , z 1 } and {x2 , y2 , z 2 }.9 The elastic modulus E and the cross section area A are constant along the length. Denote x21 = x2 x1 , y21 = y2 y1 , 2 2 2 z 21 = z 2 z 1 and L = x21 + y21 + z 21 . (a) Show that the element stiffness matrix in global coordinates can be compactly written10 Ke = (b) EA T B B, L3 in which B = [ x21 y21 z 21 x21 y21 z 21 ] . (E5.4)
Compute Ke if the nodes are at {1, 2, 3} and {3, 8, 6}, with elastic modulus E = 343 and cross section area A = 1. Note: the computation can be either done by hand or with the help of a program such as the following Mathematica module, which is used in Part III:
Stiffness3DBar[ncoor_,mprop_,fprop_,opt_]:= Module[ {x1,x2,y1,y2,z1,z2,x21,y21,z21,Em,Gm,rho,alpha,A, num,L,LL,LLL,B,Ke}, {{x1,y1,z1},{x2,y2,z2}}=ncoor; {x21,y21,z21}={x2-x1,y2-y1,z2-z1}; {Em,Gm,rho,alpha}=mprop; {A}=fprop; {num}=opt; If [num,{x21,y21,z21,Em,A}=N[{x21,y21,z21,Em,A}]]; LL=x21^2+y21^2+z21^2; L=PowerExpand[Sqrt[LL]]; LLL=Simplify[LL*L]; B={{-x21,-y21,-z21,x21,y21,z21}}; Ke=(Em*A/LLL)*Transpose[B].B; Return[Ke]]; ClearAll[Em,A]; Em=343; A=1;
9 10
End nodes are labeled 1 and 2 instead of i and j to agree with the code listed below. There are several ways of arriving at this result. Some are faster and more elegant than others. Here is a sketch of one of the ways. Denote by L 0 and L the lengths of the bar in the undeformed and deformed congurations, respectively. Then
2 1 2 (L
L2 0 ) = x 21 (u x 2 u x 1 ) + y21 (u y 2 u y 1 ) + z 21 (u z 2 u z 1 ) + Q Bu,
in which Q is a quadratic function of node displacements which is therefore dropped in the small-displacement linear theory. Also on account of small displacements
2 1 2 (L 1 L2 0 ) = 2 ( L + L 0 )( L L 0 ) L
L.
Hence the small axial strain is e = L / L = (1/ L 2 )Bue , which begins the Tonti diagram. Next is F = E A e. Finally you must show that force equilibrium at nodes requires fe = (1/ L )BT F . Multiplying through gives (E5.4). A plodding way is to start from the local stiffness (5.8) and transform to global using (E5.1).
515
516
ncoor={{0,0,0},{2,6,3}}; mprop={Em,0,0,0}; fprop={A}; opt={False}; Ke=Stiffness3DBar[ncoor,mprop,fprop,opt]; Print["Stiffness of 3D Bar Element:"]; Print[Ke//MatrixForm]; Print["eigs of Ke: ",Eigenvalues[Ke]]; As a check, the six eigenvalues of this particular Ke should be 98 and ve zeros.
EXERCISE 5.12 [A/C:25] Complete Example 5.2.
516
Introduction to FEM
IFEM Ch 5 Slide 1
Introduction to FEM
Skeletal structural members whose stiffness equations can be constructed by Mechanics of Materials (MoM) methods
IFEM Ch 5 Slide 2
Introduction to FEM
ection
One dimension (longitudinal) much larger than the other two (transverse)
IFEM Ch 5 Slide 3
Introduction to FEM
Spars (aka Webs): transmit shear Beam-columns: transmit bending + axial force
IFEM Ch 5 Slide 4
Introduction to FEM
IFEM Ch 5 Slide 5
Introduction to FEM
Kinematic
Constitutive
Equilibrium
IFEM Ch 5 Slide 6
Introduction to FEM
Kinematic v = B u p=Sv
= AT p Equilibrium f
Constitutive
IFEM Ch 5 Slide 7
Introduction to FEM
Elimination of the Internal Quantities v and p gives the Element Stiffness Equations through Simple Matrix Multiplications
u =K f = AT S B u = AT S B K
If B = A
= BT S B K
symmetric if S is
IFEM Ch 5 Slide 8
Introduction to FEM
(b)
y xi i f xi , u
EA
xj j f xj , u
IFEM Ch 5 Slide 9
Introduction to FEM
EA F= d = S d, L xi f 1 F = AT F f= = 1 fx j EA T T K=A SB=SB B= L 1 1 1 1
Can be expanded to the 4 x 4 of Chapter 2 by adding two _ _ zero rows and columns to accomodate uyi and uy j
IFEM Ch 5 Slide 10
Introduction to FEM
Stiffness
EA L
_ 1 1 u 1 1 _ f
Kinematic
d= 1 1 u xi u xj = Bu
f=
Equilibrium
f= fxi fx j = 1 F = AT F 1
F=
EA d = Sd L
Constitutive
IFEM Ch 5 Slide 11
Introduction to FEM
IFEM Ch 5 Slide 12
Introduction to FEM
IFEM Ch 5 Slide 13
Introduction to FEM
= G As K
L
1 1
1 1
IFEM Ch 5 Slide 14
Introduction to FEM
IFEM Ch 5 Slide 15
Introduction to FEM
v=Bu
Kinematic
p = Rv
From internal forces to node forces
Constitutive
= AT dp df
Equilibrium
IFEM Ch 5 Slide 16
Introduction to FEM
Tonti Diagram of Matrix Equations for Non-Simplex MoM Element (with A=B)
= f
0 L
Stiffness
u
Kinematic (at each section)
u BT R B dx
v=Bu
= BT dp df p=Rv
Equilibrium
IFEM Ch 5 Slide 17
Introduction to FEM
IFEM Ch 5 Slide 18
Introduction to FEM
IFEM Ch 5 Slide 19
Introduction to FEM
IFEM Ch 5 Slide 20
Introduction to FEM
IFEM Ch 5 Slide 21
517
Homework Exercises for Chapter 5 Constructing MoM Members Solutions
Solutions to Exercises
See Figure E5.3(a). The constitutive equation is V = (G As / L ) d y . It is easily checked that B = [ 1 1 ] = A. Thus d y and V are conjugate. The Tonti diagram is shown in Figure E5.3(b).
(a) (b)
u
EXERCISE 5.1 Take d y = L = u yj u yi as deformation variable v paired to the transverse shear force V .
K = AT S B =
G As 1 1 1 1 L
f
dy = [ 1 1 ] yi = B u u
yj
V
u
dy
f = yi =
f f yj
1 V = AT V 1
x
V dy
V=
G As dy = S d y L
Note: A = B
Figure E5.3. Solutions to Exercise 5.1: (a): conjugate variable d y (displacements grossly exaggerated for visibility); (b) Tonti diagram.
EXERCISE 5.2 The displacement transformation matrix Te is obtained by extracting rows 2 and 4 from that
(E5.5)
e Te gives the closed form of the spar element stiffness in global Carrying out the multiplication (Te )T K coordinates 2 s sc s 2 sc sc c2 sc c2 e Te = G A s . (E5.6) Ke = (Te )T K s 2 sc s 2 sc L sc c2 sc c2
EXERCISE 5.3 The displacement transformation matrix Te is the same as that in (2.13) with the u x and u y
replaced by x and y , respectively, because innitesimal rotations transform exactly as vectors. As usual, the e Te force transformation matrix is (Te )T . The result for the globalized element stiffness matrix Ke = (Te )T K is the same as (2.18), with factor E A / L replaced by G J / L .
EXERCISE 5.4
(a)
By elementary kinematics: u x = u x cx ji + u y c y ji + u z cz ji (E5.7) where {cx ji , c y ji , cz ji } are the 3 direction cosines of longitudinal x , dened by end nodes i and j (i j ) with respect to {x , y , z }, respectively. These 3 numbers are easily computed as {x ji / L , y ji / L , z ji / L }, respectively, in which x ji = x j xi , y ji = y j yi , z ji = z j z i are the node coordinate differences and
517
518
L= (b)
2 2 x2 ji + y ji + z ji is the element length. Evaluating this formula at end nodes i and j and puting in
2 0
6 0
3 0
0 2
0 6
0 3
(E5.8)
(a)
From kinematics, at any point on the line i - j (the longitudinal axis of the spar) we can write the displacement in the y direction as the linear combination of global displacements: u y = cx y u x + cy y u y + cz y uz (E5.9)
b y i
k a h m c Lc j x
where cx y , cy y and cz y are the direction cosines formed by y with the x , y and z global axes, respectively. But the direction y can be dened by that of the vector joining m to k , where m is the projection of the orientation node on i - j ; see Figure E5.4. Consequently cx y = cxkm , c y y = c ykm , and cz y = czkm and u y = cxkm u x + c ykm u y + czkm u z (E5.10)
Evaluate this relation at node i : u yi = cxkm u xi + c ykm u yi + czkm u zi and at node j : u y j = cxkm u x j + c ykm u y j + czkm u z j . Collecting and passing to matrix form gives
u xi u yi . = T ue . . . uzj
(E5.11)
The global components of vector m k are xkm = xk xm , ykm = yk ym and z km = z k z m and its 2 2 2 length is h = xkm + ykm + z km . Consequently cxkm = xkm / h , c ykm = x ym / h and czkm = z km / h . This proves the form of T given in (E5.2). This assumes that the location of m is known, which is the topic of the next item. (b) Before proceeding to locate m the lengths a , b and L are computed from the coordinate data for {i , j , k }. These are the triangle side lengths pictured in Figure E5.4, are always positive. Then compute 2 A from Herons area formula given in the Exercise assignment, taking the + sign of the square root so A 0. If A = 0 orientation node k is colinear with {i , j } and the computation aborts. Since 2 A = Lh , obviously h = 2 A / L , which must be positive. The location of point m is determined if the signed distance c from node i is computed. This can be done in several ways. Two methods are described below. Method I. The method outlined in the Exercise proceeds as follows. Compute cos from the cosine law at vertex i : cos = ( L 2 + b2 a 2 )/(2bL ), Then c = b cos = b( L 2 + b2 a 2 )/(2bL ) = ( L 2 + b2 a 2 )/(2 L ). The global coordinates of m are obtained by linear interpolation of those of i and j : xm = xi ( L c)/ L + x j c/ L , ym = xi ( L c)/ L + y j c/ L and z m = z i ( L c)/ L + z j c/ L . Then form xkm , ykm , z km , divide by h to get the direction cosines and store in T as per (E5.11). Method II. (Suggested in footnote to Exercise assignment). Apply Pithagoras theorem twice: h 2 = (b2 c2 ) and h 2 = a 2 ( L c)2 . On subtracting, h 2 and c2 cancel out giving b2 a 2 + L 2 2 Lc = 0, whence c = ( L 2 + b2 a 2 )/(2 L ), which is the same result as above. The coordinates of m are dened by interpolation, and T constructed as described for Method I.
518
61
62
TABLE OF CONTENTS
Page
6.1. 6.2.
FEM Terminology Idealization 6.2.1. Models . . . . . . . . . . . . 6.2.2. Mathematical Models . . . . . . . 6.2.3. Implicit vs. Explicit Modeling . . . . . 6.3. Discretization 6.3.1. Analytical or Numerical? . . . . . . 6.3.2. Error Sources and Approximation . . . 6.3.3. Other Discretization Methods . . . . 6.4. The Finite Element Method 6.5. Element Attributes 6.5.1. Dimensionality . . . . . . . . . . 6.5.2. Nodes . . . . . . . . . . . . 6.5.3. Geometry . . . . . . . . . . . 6.5.4. Degrees of Freedom . . . . . . . . 6.5.5. Nodal Forces . . . . . . . . . . 6.5.6. Constitutive Properties . . . . . . . 6.5.7. Fabrication Properties . . . . . . . 6.6. Classication of Mechanical Elements 6.6.1. Primitive Structural Elements . . . . 6.6.2. Continuum Elements . . . . . . . . 6.6.3. Special Elements . . . . . . . . . 6.6.4. Macroelements . . . . . . . . . . 6.6.5. Substructures . . . . . . . . . . 6.7. Assembly 6.8. Boundary Conditions 6.8.1. Essential and Natural B.C. . . . . . . 6.8.2. Boundary Conditions in Structural Problems 6. Notes and Bibliography . . . . . . . . . . . . . . . 6. References. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . . .
. . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . .
. . . . . . .
. . . . . . . .
. . . . . . . .
. . . .
63 64 65 65 66 66 66 67 68 68 68 69 69 610 610 610 610 610 610 611 611 611 612 612 612 613 613 613 614 614
62
63
6.1
FEM TERMINOLOGY
Chapters 2 through 5 cover material technically known as Matrix Structural Analysis or MSA. This is a subject that historically preceded the Finite Element Method (FEM), as chronicled in Appendix H. This Chapter begins covering the FEM proper. This is distinguished from MSA by two traits: The ability to go beyond structures. The prominent role of continuum models and variational mathematics.
This Chapter introduces terminology used in FEM modeling, and surveys attributes and types of nite elements used in structural mechanics. The next Chapter gives more specic rules for dening meshes and boundary conditions. 6.1. FEM Terminology The ubiquitous term degrees of freedom, often abbreviated to either freedom or DOF, has gured prominently in the preceding Chapters. This term, as well as stiffness matrix and force vector, originated in structural mechanics, the application for which FEM was invented. These names have carried over to non-structural applications. This terminology overspill is discussed next. Classical analytical mechanics is that invented by Euler and Lagrange in the XVIII century and further developed by Hamilton and Jacobi as a systematic formulation of Newtonian mechanics. Its objects of attention are models of mechanical systems ranging from material particles composed of sufciently large number of molecules, through airplanes, to the Solar System.1 The spatial conguration of any such system is described by its degrees of freedom or DOF. These are also called generalized coordinates. The terms state variables and primary variables are also used, particularly in mathematically oriented treatments. If the number of degrees of freedom is nite, the model is called discrete, and continuous otherwise. Because FEM is a discretization method, the number of DOF of a FEM model is necessarily nite. They are collected in a column vector called u. This vector is called the DOF vector or state vector. The term nodal displacement vector for u is reserved to mechanical applications. In analytical mechanics, each degree of freedom has a corresponding conjugate or dual term, which represents a generalized force.2 In non-mechanical applications, there is a similar set of conjugate quantities, which for want of a better term are also called forces or forcing terms. They are the agents of change. These forces are collected in a column vector called f. The inner product fT u has the meaning of external energy or work. Just as in the truss problem, the relation between u and f is assumed to be of linear and homogeneous. The last assumption means that if u vanishes so does f. The relation is then expressed by the master stiffness equations: Ku = f. (6.1) K is universally called the stiffness matrix even in non-structural applications because no consensus has emerged on different names. The physical signicance of the vectors u and f varies according to the application being modeled, as illustrated in Table 6.1.
1
For cosmological scales, such as galaxy clusters or black holes, the general theory of relativity is necessary. For the atomic and sub-particle world, quantum mechanics is appropriate. In variational mathematics this is called a duality pairing.
63
64
Table 6.1. Signicance of u and f in Miscellaneous FEM Applications Application Problem Structures and solid mechanics Heat conduction Acoustic uid Potential ows General ows Electrostatics Magnetostatics State (DOF) vector u represents Displacement Temperature Displacement potential Pressure Velocity Electric potential Magnetic potential Conjugate vector f represents Mechanical force Heat ux Particle velocity Particle velocity Fluxes Charge density Magnetic intensity
If the relation between forces and displacements is linear but not homogeneous, equation (6.1) generalizes to Ku = f M + f I . (6.2)
Here f I is the initial node force vector introduced in Chapter 29 for effects such as temperature changes, and f M is the vector of mechanical forces. The basic steps of FEM are discussed below in more generality. Although attention is focused on structural problems, most of the steps translate to other applications problems as noted above. The role of FEM in numerical simulation is schematized in Figure 6.1, which is a merged simplication of Figures 1.2 and 1.3. Although this diagram oversimplies the way FEM is actually used, it serves to illustrate terminology. The three key simulation steps shown are: idealization, discretization and solution. Each step is a source of errors. For example, the discretization error is the discrepancy that appears when the discrete solution is substituted in the mathematical model. The reverse steps: continuication and realization, are far more difcult and (generally) ill-posed problems. The idealization and discretization steps, briey mentioned in Chapter 1, deserve further discussion. The solution step is dealt with in more detail in Part III of this book.
IDEALIZATION Physical system DISCRETIZATION SOLUTION Discrete solution Solution error
FEM
Mathematical model Discrete model
CONTINUIFICATION
64
65 6.2. Idealization
6.2
IDEALIZATION
Idealization passes from the physical system to a mathematical model. This is the most important step in engineering practice, because it cannot be canned. It must be done by a human. 6.2.1. Models The word model has the traditional meaning of a scaled copy or representation of an object. And that is precisely how most dictionaries dene it. We use here the term in a more modern sense, which has become increasingly common since the advent of computers: A model is a symbolic device built to simulate and predict aspects of behavior of a system. (6.3) Note the distinction made between behavior and aspects of behavior. To predict everything, in all physical scales, you must deal with the actual system. A model abstracts aspects of interest to the modeler.3 The qualier symbolic means that a model represents a system in terms of the symbols and language of another discipline. For example, engineering systems may be (and are) modeled with the symbols of mathematics and/or computer sciences.4 6.2.2. Mathematical Models Mathematical modeling, or idealization, is a process by which an engineer or scientist passes from the actual physical system under study, to a mathematical model of the system, where the term model is understood in the sense of (6.3). The process is called idealization because the mathematical model is necessarily an abstraction of the physical reality note the phrase aspects of behavior in (6.3). The analytical or numerical results produced by the mathematical model are physically re-interpreted only for those aspects.5 To give an example of the choices that an engineer may face, suppose that the structure is a at plate structure subjected to transverse loading. Here is a non-exhaustive list of four possible mathematical models: 1. 2. 3. 4. A very thin plate model based on Von Karmans coupled membrane-bending theory. A thin plate model, such as the classical Kirchhoff s plate theory. A moderately thick plate model, for example Mindlin-Reissner plate theory. A very thick plate model based on three-dimensional elasticity.
The person responsible for this kind of decision is supposed to be familiar with the advantages, disadvantages, and range of applicability of each model. Furthermore the decision may be different in static analysis than in dynamics.
3 4 5
All models are wrong, some are useful. (George Box) A problem-denition input le, a digitized earthquake record, or a stress plot are examples of the latter. Whereas idealization can be reasonably taught in advanced design courses, the converse process of realization or identication see Figure 6.1 generally requires considerable physical understanding and maturity that can only be gained through professional experience.
65
66
Why is the mathematical model an abstraction of reality? Engineering systems, particularly in Aerospace and Mechanical, tend to be highly complex. For simulation it is necessary to reduce that complexity to manageable proportions. Mathematical modeling is an abstraction tool by which complexity can be controlled. This is achieved by ltering out physical details that are not relevant to the analysis process. For example, a continuum material model lters out the aggregate, crystal, molecular and atomic levels of matter. Engineers are typically interested in a few integrated quantities, such as the maximum deection of a bridge or the fundamental periods of an airplane. Although to a physicist this is the result of the interaction of billions and billions of molecules, such details are weeded out by the modeling process. Consequently, picking a mathematical model is equivalent to choosing an information lter. 6.2.3. Implicit vs. Explicit Modeling
ENT PON M CO EVEL L
ent ponns Com atio equ
TEM SYS EL V LE e
plet Com tion solu em Syst rete disc del mo
Figure 6.2. A reproduction of Figure 1.5 with some relabeling. Illustrates implicit modeling: picking elements from an existing FEM code consents to an idealization. This has legal and professional implications.
As noted the diagram of Figure 6.1 is an oversimplication of engineering practice. The more common scenario is that pictured in Figures 1.2, 1.4 and 1.5. The latter is reproduced in Figure 6.2 for convenience. A common scenario in industry is: you have to analyze a structure or a substructure, and at your disposal is a black box general-purpose nite element program. Those programs offer a catalog of element types; for example, bars, beams, plates, shells, axisymmetric solids, general 3D solids, and so on. The moment you choose specic elements from the catalog you automatically accept the mathematical models on which the elements are based. This is implicit modeling. Ideally you should be fully aware of the implications of your choice. Providing such nite element literacy is one of the objective of this book. Unfortunately many users of commercial programs are unaware of the implied-consent aspect of implicit modeling and their legal implications. The other extreme happens when you select a mathematical model of the physical problem with your eyes wide open and then either shop around for a nite element program that implements that model, or write the program yourself. This is explicit modeling. It requires far more technical expertise, resources, experience and maturity than implicit modeling. But for problems that fall out of the ordinary it could be the right thing to do. In practice a combination of implicit and explicit modeling is common. The physical problem to be simulated is broken down into subproblems. Those subproblems that are conventional and t available programs may be treated with implicit modeling, whereas those that require special handling may only submit to explicit modeling. 66
67 6.3. Discretization
6.3
DISCRETIZATION
Mathematical modeling is a simplifying step. But models of physical systems are not necessarily simple to solve. They often involve coupled partial differential equations in space and time subject to boundary and/or interface conditions. Such models have an innite number of degrees of freedom. 6.3.1. Analytical or Numerical? At this point one faces the choice of going for analytical or numerical solutions. Analytical solutions, also called closed form solutions, are more intellectually satisfying, particularly if they apply to a wide class of problems, so that particular instances may be obtained by substituting the values of free parameters. Unfortunately they tend to be restricted to regular geometries and simple boundary conditions. Moreover some closed-form solutions, expressed for example as inverses of integral transforms, may have to be anyway numerically evaluated to be useful. Most problems faced by the engineer either do not yield to analytical treatment or doing so would require a disproportionate amount of effort.6 The practical way out is numerical simulation. Here is where nite element methods enter the scene. To make numerical simulations practical it is necessary to reduce the number of degrees of freedom to a nite number. The reduction is called discretization. The product of the discretization process is the discrete model. As discussed in Chapter 1, for complex engineering systems this model is the product of a multilevel decomposition. Discretization can proceed in space dimensions as well as in the time dimension. Because the present book deals primarily (except in Part IV) with static problems, we need not consider the time dimension and are free to concentrate on spatial discretization. 6.3.2. Error Sources and Approximation Figure 6.1 tries to convey graphically that each simulation step introduces a source of error. In engineering practice modeling errors are by far the most important. But they are difcult and expensive to evaluate, because model validation requires access to and comparison with experimental results. These may be either scarce, or unavailable in the case of a new product in the design stage. Next in order of importance is the discretization error. Even if solution errors are ignored and usually they can the computed solution of the discrete model is in general only an approximation in some sense to the exact solution of the mathematical model. A quantitative measurement of this discrepancy is called the discretization error. The characterization and study of this error is addressed by a branch of numerical mathematics called approximation theory. Intuitively one might suspect that the accuracy of the discrete model solution would improve as the number of degrees of freedom is increased, and that the discretization error goes to zero as that number goes to innity. This loosely worded statement describes the convergence requirement of
6
This statement has to be tempered in two respects. First, the wider availability and growing power of computer algebra systems, outlined in Chapter 4, has widened the realm of analytical solutions than can be obtained within a practical time frame. Second, a combination of analytical and numerical techniques is often effective to reduce the dimensionality of the problem and to facilitate parameter studies. Important examples are provided by Fourier analysis, perturbation and boundary-element methods.
67
68
discrete approximations. One of the key goals of approximation theory is to make the statement as precise as it can be expected from a branch of mathematics.7 6.3.3. Other Discretization Methods It was stated in Chapter 1 that the most popular discretization techniques in structural mechanics are nite element methods and boundary element methods. The nite element method (FEM) is by far the most widely used. The boundary element method (BEM) has gained in popularity for special types of problems, particularly those involving innite domains, but remains a distant second, and seems to have reached its natural limits. In non-structural application areas such as uid mechanics and electromagnetics, the nite element method is gradually making up ground but faces stiff competition from both the classical and energybased nite difference methods. Finite difference and nite volume methods are particularly well entrenched in computational uid dynamics spanning moderate to high Reynolds numbers. 6.4. The Finite Element Method The nite element method (FEM) is the dominant discretization technique in structural mechanics. As discussed in Chapter 1, the FEM can be interpreted from either a physical or mathematical standpoint. The treatment in Chapters 110 emphasizes the former. The basic concept in the physical FEM is the subdivision of the mathematical model into disjoint (non-overlapping) components of simple geometry called nite elements or elements for short. The response of each element is expressed in terms of a nite number of degrees of freedom characterized as the value of an unknown function, or functions, at a set of nodal points. The response of the mathematical model is then considered to be approximated by that of the discrete model obtained by connecting or assembling the collection of all elements. The disconnection-assembly concept occurs naturally when examining many articial and natural systems. For example, it is easy to visualize an engine, bridge, building, airplane, or skeleton as fabricated from simpler components. Unlike nite difference models, nite elements do not overlap in space. In the mathematical interpretation of the FEM, this property goes by the name disjoint support or local support. 6.5. Element Attributes Just like members in the truss example, one can take nite elements of any kind one at a time. Their local properties can be developed by considering them in isolation, as individual entities. This is the key to the modular programming of element libraries. In the Direct Stiffness Method, elements are isolated by the disconnection and localization steps, which were described for the truss example in Chapter 2. The procedure involves the separation of elements from their neighbors by disconnecting the nodes, followed by referral of the element to a
7
The discretization error is often overhyped in the FEM literature, since it provides an inexhaustible source of publishable poppycock. If the mathematical model is way off, reducing the discretization error buys nothing; just a more accurate answer to the wrong problem.
68
69
1D
2D
2D
3D
Figure 6.3. Typical nite element geometries in one through three dimensions.
convenient local coordinate system.8 After that we can consider generic elements: a bar element, a beam element, and so on. From the standpoint of the computer implementation, it means that you can write one subroutine or module that constructs, by suitable parametrization, all elements of one type, instead of writing a new one for each element instance. Following is a summary of the data associated with an individual nite element. This data is used in nite element programs to carry out element level calculations. 6.5.1. Dimensionality Elements can have intrinsic dimensionality of one, two or three space dimensions.9 There are also special elements with zero dimensionality, such as lumped springs or point masses. The intrinsic dimensionality can be expanded as necessary by use of kinematic transformations. For example a 1D element such as a bar, spar or beam may be used to build a model in 2D or 3D space. 6.5.2. Nodes Each element possesses a set of distinguishing points called nodal points or nodes for short. Nodes serve a dual purpose: denition of element geometry, and home for degrees of freedom. When a distinction is necessary we call the former geometric nodes and the latter connection nodes. For most elements studied here, geometric and connector nodes coalesce. Nodes are usually located at the corners or end points of elements, as illustrated in Figure 6.3. In the so-called rened or higher-order elements nodes are also placed on sides or faces, as well as possibly the interior of the element.
8
Both steps are only carried out in the modelers mind. They are placed as part of the DSM for instructional convenience. In practice, processing begins directly at the element level. In dynamic analysis, time may appear as an additional dimension.
69
610
Remark 6.1. In some elements geometric and connection nodes may be at different locations. This is illustrated
by the Veubeke equilibrium triangle described in Chapter 15. Some elements have purely geometric nodes, also called orientation nodes to complete the denition of certain geometric attributes. An example is the spar element in 3D shown in Figure E5.2, in which a third geometric node is used to dene a local plane.
6.5.3. Geometry The geometry of the element is dened by the placement of the geometric nodal points. Most elements used in practice have fairly simple geometries. In one-dimension, elements are usually straight lines or curved segments. In two dimensions they are of triangular or quadrilateral shape. In three dimensions the most common shapes are tetrahedra, pentahedra (also called wedges or prisms), and hexahedra (also called cuboids or bricks). See Figure 6.3. 6.5.4. Degrees of Freedom The element degrees of freedom (DOF) specify the state of the element. They also function as handles through which adjacent elements are connected. DOFs are dened as the values (and possibly derivatives) of a primary eld variable at connector node points. The actual selection depends on criteria studied at length in Part II. Here we simply note that the key factor is the way in which the primary variable appears in the mathematical model. For mechanical elements, the primary variable is the displacement eld and the DOF for many (but not all) elements are the displacement components at the nodes. 6.5.5. Nodal Forces There is always a set of nodal forces in a one-to-one correspondence with degrees of freedom. In mechanical elements the correspondence is established through energy arguments. 6.5.6. Constitutive Properties For a mechanical element these are relations that specify the material behavior. For example, in a linear elastic bar element it is sufcient to specify the elastic modulus E and the thermal coefcient of expansion . 6.5.7. Fabrication Properties For mechanical elements these are fabrication properties which have been integrated out from the element dimensionality. Examples are cross sectional properties of MoM elements such as bars, beams and shafts, as well as the thickness of a plate or shell element. For computer implementation the foregoing data sets are organized into appropriate data structures. These are used by element generation modules to compute element stiffness relations in the local system. 610
Physical Structural Component Mathematical Model Name bar Finite Element Idealization
beam
tube, pipe
spar (web)
611
Physical
6.6
Finite element idealization
Physical
plates
3D solids
6.6. Classication of Mechanical Elements The following classication of nite elements in structural mechanics is loosely based on the closeness of the element with respect to the original physical structure. It is given here because it claries points that recur in subsequent sections, as well as providing insight into advanced modeling techniques such as hierarchical breakdown and global-local analysis. 6.6.1. Primitive Structural Elements These resemble fabricated structural components. They are often drawn as such; see Figure 6.4. The qualier primitive distinguishes them from macroelements, which is another element class described below. Primitive means that they are not decomposable into simpler elements. These elements are usually derived from Mechanics-of-Materials simplied theories and are better understood from a physical, rather than mathematical, standpoint. Examples are the elements discussed in Chapter 5: bars, cables, beams, shafts, spars. 6.6.2. Continuum Elements These do not resemble fabricated structural components at all. They result from the subdivision of blobs of continua, or of structural components viewed as continua. Unlike structural elements, continuum elements are better understood in terms of their mathematical interpretation. Examples: plates, slices, shells, axisymmetric solids, general solids. See Figure 6.5. 6.6.3. Special Elements Special elements partake of the characteristics of structural and continuum elements. They are derived from a continuum mechanics standpoint but include features closely related to the physics of the problem. Examples: crack elements for fracture mechanics applications, shear panels, innite and semi-innite elements, contact and penalty elements, rigid-body elements. See Figure 6.6. 611
612
Crack element
Infinite element
Figure 6.6. Special element examples.
Honeycomb panel
6.6.4. Macroelements Macroelements are also called mesh units and superelements, although the latter term overlaps with substructures (dened below). These often resemble structural components, but are fabricated with simpler elements. See Figure 6.7. The main reason for introducing macroelements is to simplify preprocessing tasks. For example, it may be simpler to dene a regular 2D mesh using quadrilaterals rather than triangles. The fact that, behind the scene, the quadrilateral is actually a macroelement may not be important to most users. Similarly a box macroelement can save modeling times for structures that are built by such components; for example box-girder bridges 6.6.5. Substructures Also called structural modules and superelements. These are sets of elements with a well dened structural function, typically obtained by cutting the complete structure into functional components. Examples: the wings and fuselage of an airplane; the towers, deck and cables of a suspension bridge. The distinction between substructures and macroelements is not clear-cut. The main conceptual distinction is that substructures are dened top down as parts of a complete structure, whereas macroelements are built bottom up from primitive elements. The term superelement is often used in a collective sense to embrace element groupings. This topic is further covered in Chapter 10. 6.7. Assembly The assembly procedure of the Direct Stiffness Method for a general nite element model follows rules identical in principle to those discussed for the truss example. As in that case the processs involves two basic steps: Globalization. The element equations are transformed to a common global coordinate system, if necessary. Merge. The element stiffness equations are merged into the master stiffness equations by appropriate indexing and matrix-entry addition. 612
Figure 6.7. Macroelement examples.
613
6.8
BOUNDARY CONDITIONS
The hand calculations for the example truss conceal, however, the implementation complexity. The master stiffness equations in practical applications may involve thousands or even millions of freedoms, and programming can become involved. The topic is elaborated upon in Chapter 25. 6.8. Boundary Conditions A key strength of the FEM is the ease and elegance with which it handles arbitrary boundary and interface conditions. This power, however, has a down side. A big hurdle faced by FEM newcomers is the understanding and proper handling of boundary conditions. Below is a simple recipe for treating boundary conditions. The following Chapter provides more specic rules and examples. 6.8.1. Essential and Natural B.C. The key thing to remember is that boundary conditions (BCs) come in two basic avors: essential and natural. Essential BCs directly affect DOFs, and are imposed on the left-hand side vector u. Natural BCs do not directly affect DOFs and are imposed on the right-hand side vector f. The mathematical justication for this distinction requires use of concepts from variational calculus, and is consequently relegated to Part II. For the moment, the basic recipe is: 1. 2. If a boundary condition involves one or more degrees of freedom in a direct way, it is essential. An example is a prescribed node displacement. Otherwise it is natural.
The term direct is meant to exclude derivatives of the primary function, unless those derivatives also appear as degrees of freedom, such as rotations in beams and plates. 6.8.2. Boundary Conditions in Structural Problems Essential boundary conditions in mechanical problems involve displacements (but not strain-type displacement derivatives). Support conditions for a building or bridge problem furnish a particularly simple example. But there are more general boundary conditions that occur in practice. A structural engineer must be familiar with displacement B.C. of the following types. Ground or support constraints. Directly restraint the structure against rigid body motions. Symmetry conditions. To impose symmetry or antisymmetry restraints at certain points, lines or planes of structural symmetry. This allows the discretization to proceed only over part of the structure with a consequent savings in modeling effort and number of equations to be solved. Ignorable freedoms. To suppress displacements that are irrelevant to the problem.10 Even experienced users of nite element programs are sometimes bafed by this kind. An example are rotational degrees of freedom normal to smooth shell surfaces.
10
613
614
Connection constraints. To provide connectivity to adjoining structures or substructures, or to specify relations between degrees of freedom. Many conditions of this type can be subsumed under the label multipoint constraints or multifreedom constraints. These can be notoriously difcult to handle from a numerical standpoint, and are covered in Chapters 89.
Notes and Bibliography Most FEM textbooks do not provide a systematic treatment of modeling. This is no accident: few academic authors have experience with complex engineering systems. Good engineers are too busy (and in demand) to have time for writing books. This gap has been particularly acute since FEM came on the scene because of generational gaps: real engineers tend to mistrust the computer, and often for good reason. The notion of explicit versus implicit modeling, which has legal and professional implications, is rarely mentioned. FEM terminology is by now standard, and so is a majority of the notation. But that is not so in early publications. E.g. K is universally used11 for stiffness matrix in virtually all post-1960 books. There are a few exceptions: the often cited Przemieniecki [204] uses S. There is less unanimity on u and f for node displacement and force vectors, respectively; some books such as Zienkiewicz and Taylor [279] still use different symbols. The element classication given here attempts to systematize dispersed references. In particular, the distinction between macroelements, substructures and superelements is an ongoing source of confusion, particularly since massively parallel computation popularized the notion of domain decomposition in the computer science community. The all-encompassing term superelement emerged in Norway by 1968 as part of the implementation of the computer program SESAM. Additional historical details are provided in Chapter 10. The topic of BC classication and handling is a crucial one in practice. More modeling mistakes are done in this aspect of FEM application than anywhere else. References Referenced items have been moved to Appendix R.
11
A symbol derived from the spring constant k that measures the stiffness of a mechanical spring.
614
Introduction to FEM
IFEM Ch 6 Slide 1
Introduction to FEM
FEM Terminology
degrees of freedom (abbrv: DOF) state (primary) variables: displacements in mechanics conjugate variables: forces in mechanics stiffness matrix master stiffness equations
Ku =f Ku =f M + fI
IFEM Ch 6 Slide 2
Introduction to FEM
IFEM Ch 6 Slide 3
Introduction to FEM
Mathematical model
FEM
Discrete model
CONTINUIFICATION
IFEM Ch 6 Slide 4
Introduction to FEM
Physical System
IDEALIZATION
;; ;; ;;
Mathematical Model
IFEM Ch 6 Slide 5
;; ;; ;;
Introduction to FEM
IFEM Ch 6 Slide 6
Introduction to FEM
Implicit Modeling
E PON M CO EVEL L
en ponns o Com i t a equ t
NT
IFEM Ch 6 Slide 7
Introduction to FEM
Disconnection
Breakdown Localization Member (Element) Formation -> generic elements
IFEM Ch 6 Slide 8
Introduction to FEM
IFEM Ch 6 Slide 9
Introduction to FEM
IFEM Ch 6 Slide 10
Introduction to FEM
2D
2D
3D
IFEM Ch 6 Slide 11
Introduction to FEM
Superelements
IFEM Ch 6 Slide 12
Introduction to FEM
beam
tube, pipe
spar (web)
IFEM Ch 6 Slide 13
Introduction to FEM
Continuum Elements
Physical Finite element idealization Physical Finite element idealization
plates
3D solids
IFEM Ch 6 Slide 14
Introduction to FEM
Special Elements
double node
Infinity
Crack element
Infinite element
Honeycomb panel
IFEM Ch 6 Slide 15
Introduction to FEM
MacroElements
IFEM Ch 6 Slide 16
Introduction to FEM
Substructures
IFEM Ch 6 Slide 17
Introduction to FEM
Substructures (cont'd)
S4 S6
S2
S5
S1 S3
IFEM Ch 6 Slide 18
Introduction to FEM
WING BODY INTERSECTION ANALYSIS 4 substructures,12549 elements 4266 nodes, 25596 freedoms
CARGO DOOR CABIN ANALYSIS 747 Regions Analyzed with FEM-DSM at Boeing
IFEM Ch 6 Slide 19
Introduction to FEM
Essential
Two types
Natural
IFEM Ch 6 Slide 20
Introduction to FEM
IFEM Ch 6 Slide 21
Introduction to FEM
IFEM Ch 6 Slide 22
Introduction to FEM
;;;;;;;;; ;;;;;;;;;
Unsaturated fill Sandstone Base rock Base ground motion
IFEM Ch 6 Slide 23
Saturated soil
Introduction to FEM
;; ;; ;;
21.37"
GRAPHITE
INSULATOR
IFEM Ch 6 Slide 24
Introduction to FEM
Neutral Axis Stringer Web Frame Cross section of tanker Centerline Girder Longitudinal
IFEM Ch 6 Slide 25
Introduction to FEM
IFEM Ch 6 Slide 26
Introduction to FEM
IFEM Ch 6 Slide 27
71
72
TABLE OF CONTENTS
Page
7.1. 7.2.
7.3.
7.4. 7.5.
7.6.
7. 7. 7.
General Recommendations Guidelines on Element Layout 7.2.1. Mesh Renement . . . . . . . 7.2.2. Element Aspect Ratios . . . . . 7.2.3. Physical Interfaces . . . . . . 7.2.4. Preferred Shapes . . . . . . . Direct Lumping of Distributed Loads 7.3.1. Node by Node (NbN) Lumping . . 7.3.2. Element by Element (EbE) Lumping 7.3.3. *Weighted Lumping . . . . . . 7.3.4. *Energy Consistent Lumping . . Boundary Conditions Support Conditions 7.5.1. Supporting Two Dimensional Bodies 7.5.2. Supporting Three Dimensional Bodies Symmetry and Antisymmetry Conditions 7.6.1. Visualization . . . . . . . . 7.6.2. Effect of Loading Patterns . . . . Notes and Bibliography . . . . . . . . . . . . . References. . . . . . . . . . . . . Exercises . . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
73 73 73 74 75 75 75 76 76 79 79 710 711 711 712 712 712 713 714 715 716
72
73
This Chapter continues the exposition of nite element modeling principles. After some general recommendations, it gives guidelines on layout of nite element meshes, conversion of distributed loads to node forces, and handling the simplest forms of support boundary conditions. The next two Chapters deal with more complicated forms of boundary conditions called multifreedom constraints. The presentation is recipe oriented and illustrated by specic examples from structural mechanics. Most examples are two-dimensional. No attempt is made at rigorous justication of rules and recommendations, because that would require mathematical tools beyond the scope of this course. 7.1. General Recommendations The general rules that should guide you in the use of commercial or public FEM packages, are1
Use the simplest type of nite element that will do the job. Never, never, never mess around with complicated or special elements, unless you are absolutely sure of what you are doing. Use the coarsest mesh you think will capture the dominant physical behavior of the physical system, particularly in design applications.
Three word summary: keep it simple. Initial FE models may have to be substantially revised to accommodate design changes. There is little point in using complicated models that will not survive design iterations. The time for renement is when the design has stabilized and you have a better picture of the underlying physics, possibly reinforced by experiments or observation. 7.2. Guidelines on Element Layout The following guidelines are stated for structural applications. As noted above, they will be often illustrated for two-dimensional meshes of continuum elements for ease of visualization. 7.2.1. Mesh Renement Use a relatively ne (coarse) discretization in regions where you expect a high (low) gradient of strains and/or stresses.2 Regions to watch out for high gradients are: Near entrant corners (see Remark below) or sharply curved edges. In the vicinity of concentrated (point) loads, concentrated reactions, cracks and cutouts. In the interior of structures with abrupt changes in thickness, material properties or cross sectional areas.
The examples in Figure 7.1 illustrate some of these danger regions. Away from such regions one can use a fairly coarse discretization within constraints imposed by the need of representing the structural geometry, loading and support conditions reasonably well.
1 2
Paraphrasing the Bellman in The Hunting of the Snark: what I say three times is true. Gradient is the key word. High gradient means rapid variation. A high value by itself means nothing in this context.
73
74
entrant corners (cf. Remark 7.1) Cutouts Cracks weld Vicinity of concentrated (point) loads, and sharp contact areas
Material interfaces
Figure 7.1. Some situations where a locally rened nite element discretization (in the red-shaded areas) is recommended.
Remark 7.1. The rst bullet above mentions entrant corner. That is a region where isostatics (principal stress trajectories) bunch up. For a two-dimensional problem mathematically posed on a singly-connected interior domain, they can be recognized as follows. Traverse the boundary CCW so the body or structure is on your left. When hitting a sharp or rounded corner, look at the angle (positive CCW) formed by the exterior normals (the normal going toward your right) before and after, measured from before to after, and always taking the positive value. If the angle exceeds 180 , it is an entrant corner. [If it is close to 360 , it is a crack tip.] For exterior problems or multiple-connected domains, the denition must be appropriately adjusted.
When discretizing two and three dimensional problems, try to avoid nite elements of high aspect ratios: elongated or skinny elements, such as the ones illustrated on the right of Figure 7.2. (The aspect ratio of a two- or three-dimensional element is the ratio between its largest and smallest dimension.) As a rough guideline, elements with aspect ratios exceeding 3 should be viewed with caution and those exceeding 10 with alarm. Such elements will not necessarily produce bad results that depends on the loading and boundary conditions of the problem but do introduce the potential for trouble.
Remark 7.2. In many thin structures modeled as continuous bodies the appearance of skinny elements is inevitable on account of computational economy reasons. An example is provided by the three-dimensional modeling of layered composites in aerospace and mechanical engineering problems.
74
75
No
7.3
OK
Physical interface
Figure 7.3. llustration of the rule that elements should not cross material interfaces.
7.2.3. Physical Interfaces A physical interface, resulting from example from a change in material, should also be an interelement boundary. That is, elements must not cross interfaces. See Figure 7.3. 7.2.4. Preferred Shapes In 2D FE modeling, if you have a choice between triangles and quadrilaterals with similar nodal arrangement, prefer quadrilaterals. Triangles are quite convenient for mesh generation, mesh transitions, rounding up corners, and the like. But sometimes triangles can be avoided altogether with some thought. One of the homework exercises is oriented along these lines. In 3D FE modeling, prefer strongly bricks over wedges, and wedges over tetrahedra. The latter should be used only if there is no viable alternative.3 The main problem with tetrahedra and wedges is that they can produce wrong stress results even if the displacement solution looks reasonable. 7.3. Direct Lumping of Distributed Loads In practical structural problems, distributed loads are more common than concentrated (point) loads.4 Distributed loads may be of surface or volume type. Distributed surface loads (called surface tractions in continuum mechanics) are associated with actions such as wind or water pressure, snow weight on roofs, lift in airplanes, live loads on bridges, and the like. They are measured in force per unit area. Volume loads (called body forces in continuum mechanics) are associated with own weight (gravity), inertial, centrifugal, thermal, prestress or electromagnetic effects. They are measured in force per unit volume. A derived type: line loads, result from the integration of surface loads along one transverse direction, such as a beam or plate thickness, or of volume loads along two transverse directions, such as a bar or beam area. Line loads are measured in force per unit length. Whatever their nature or source, distributed loads must be converted to consistent nodal forces for FEM analysis. These forces end up in the right-hand side of the master stiffness equations.
3
Unfortunately, many existing space-lling automatic mesh generators in three dimensions produce tetrahedral meshes. There are generators that try to produce bricks, but these often fail in geometrically complicated regions. In fact, one of the objectives of a good structural design is to avoid or alleviate stress concentrations produced by concentrated forces.
75
76
Distributed load intensity (load acts downward on boundary)
;; ;; ;; ;;
3
f3 = P 4 5 6
Boundary
Figure 7.4. NbN direct lumping of distributed line load, illustrated for a 2D problem.
The meaning of consistent can be made precise through variational arguments, by requiring that the distributed loads and the nodal forces produce the same external work. Since this requires the introduction of external work functionals, the topic is deferred to Part II. However, a simpler approach called direct load lumping, or simply load lumping, is often used by structural engineers in lieu of the mathematically impeccable but complicated variational approach. Two variants of this technique are described below for distributed surface loads. 7.3.1. Node by Node (NbN) Lumping The node by node (NbN) lumping method is graphically explained in Figure 7.4. This example shows a distributed surface loading acting normal to the straight boundary of a two-dimensional FE mesh. (The load is assumed to have been integrated through the thickness normal to the gure, so it is actually a line load measured as force per unit length.) The procedure is also called tributary region or contributing region method. For the example of Figure 7.4, each boundary node is assigned a tributary region around it that extends halfway to adjacent nodes. The force contribution P of the cross-hatched area is directly assigned to node 3. This method has the advantage of not requiring the error-prone computation of centroids, as needed in the EbE technique discussed below. For this reason it is often preferred in hand computations.5 It can be extended to three-dimensional meshes as well as volume loads.6 It should be avoided, however, when the applied forces vary rapidly (within element length scales) or act only over portions of the tributary regions. 7.3.2. Element by Element (EbE) Lumping In this variant the distributed loads are divided over element domains. The resultant load is assigned to the centroid of the load diagram, and apportioned to the element nodes by statics. A node force is obtained by adding the contributions from all elements meeting at that node. The procedure is illustrated in Figure 7.5, which shows details of the computation over 23. The total force at node
5 6
It has been extensively used in the aircraft industry for smooth-varying pressure loads computations. The computation of tributary areas and volumes for general 2D and 3D regions can be done through the so-called Voronoi diagrams. This is an advanced topic in computational geometry (see, e.g., [84]) and thus not treated here.
76
77
Force P has magnitude of crosshatched area under load curve and acts at its centroid
e f2 = (b/Le )P
f3e = (a/Le)P
2
6
P
a b
f2e
f3e
Figure 7.5. EbE direct lumping of distributed line load, illustrated for a 2D problem.
3, for instance, would be that contributed by segments 23 and 34. For the frequent case in which the variation of the load over the element is linear (so the area under the load is a trapezoid) the node forces can be computed directly by the formulas given in Figure 7.6. If applicable, EbE is more accurate than NbN lumping. In fact it agrees with consistent node lumping for simple elements that possess only corner nodes. In those cases it is not affected by sharpness of the load variation and can be even used for point loads that are not applied at the nodes.
e f ie = L (2qi +qj ) 6
qj f je = L (qi +2qj )
6
e
Le
Figure 7.6. EbE lumping of linearly varying line load over element.
The EbE procedure is not applicable if the centroidal resultant load cannot be apportioned by statics. This happens if the element has midside faces or internal nodes in addition to corner nodes, or if it has rotational degrees of freedom. For those elements the variational-based consistent approach covered in Part II and briey outlined in 7.3.3, is preferable.
Example 7.1. Figures 7.7(a,b) show web-downloaded pictures of the Norfork Dam, a 220-ft high, concretebuilt gravity dam. Its typical cross section is shown in 7.7(c). The section is discretized by triangular elements as illustrated in Figure 7.7(d). The dam has a length of 2624 ft and was constructed over the White River in Arkansas over 194144.7 The structure is assumed to be in plane strain. Accordingly the FEM model shown in 7.7(d) is a typical 1-ft slice of the dam and near-eld soil.
In the analysis of dam and marine structures, a wet node of a FEM discretization is one in contact with the water. The effect of hydrostatic pressure is applied to the structure through nodal forces on wet nodes. The wet nodes for a water head of 180 ft over the riverbed are shown in Figure 7.8(b). Nodes are numbered 1 through 9 for convenience. The pressure in psf (lbs per sq-ft) is p = 62.4 d where d is the depth in ft. Compute the horizontal hydrostatic nodal forces f x 1 and f x 2 using NbN and EbE, assuming that the wet face AB is vertical for simplicity.
7
As discussed in Notes and Bibliography, this example has historical signicance, as the rst realistic Civil Engineering structure modeled ca. 1960 by the Finite Element Method, which until then had been largely conned to aerospace.
77
(a)
(b)
78
(c) y
Concrete dam
EL. 364'
x
spillway crest 188' over riverbed
200'
Water
(d)
Soil
Figure 7.7. Norfork Dam: (a,b) pictures; (c) cross section of dam above foundation (line inside dam is a thermally induced crack considered in the 1960 study); (d) coarse mesh including foundation and soil but not crack [56,64]
(a)
180 ft Water
d
A 1 y =180 1
2 y =136 2 3 y = 84
3
(b)
22 1 2 3 4 5
C
9 8
p=62.4 d (lbs/sq-ft)
7 6
70 120 162
(c)
5 x5 =0 x =70 All dimensions in ft. x =210 6 Plane strain model, slice x8 =350 7 x 9=490 1 ft thick normal to section
y4 = 36 y5 = 0
1 44 2 96 144 3 180 4 5
Figure 7.8. Norfork Dam example: (a) computation of wet node forces due to hydrostatic pressure; (b) NbN tributary regions; (c) EbE regions.
Node by Node. For node 1 go halfway to 2, a distance of (180 136)/2 = 22 ft. The tributary load area is a triangle extending 22 ft along y with bottom pressure 62.4 22 = 1372.8 psf and unit width normal to 22 1372.8 = 15101 lbs. For node 2 go up 22 ft and down (136 84)/2 = 26 ft. The paper, giving f x 1 = 1 2 tributary load area is a trapezoid extending 22 + 26 = 48 ft vertically, with pressures 1372.8 psf at the top and 62.4 70 = 4368.0 psf at the bottom. This gives f x 2 = 48 (1372.8 + 4368.0)/2 = 137779 lbs. Element by Element. It is convenient to pre-compute hydro pressures at wet node levels: p1 = 0, p2 = 62.4 44 = 2745.6 psf, p3 = 62.4 96 = 5990.4. Because the variation of p is linear, the formulas of Figure 1) 1) = (44/6)(2 0 + 2745.6) = 20134 lbs, f x(2 = (44/6)(0 + 2 2745.6) = 7.6 can be applied directly: f x(1 (2) 40269 lbs and f x 2 = (52/6)(2 2745.6 + 5990.4) = 99507 lbs. Adding contributions to nodes 1 and 2: 1) 1) 2) = 20134 lbs and f x 2 = f x(2 + f x(2 = 40269 + 99507 = 139776 lbs. f x 1 = f x(1 The computations for wet nodes 3 through 9 are left as an exercise.
78
79
(The node numbering is different). The specic weight for concrete of = 200 pcf (pounds per cubic foot). Compute the node force f y 11 due to own weight. For this calculation NbN is unwieldy because computation of the nodal tributary region requires construction of a Voronoi diagram. (Furthermore for constant specic weight it gives the same answer as EbE.) To apply EbE, select the elements that contribute to 11: the six triangles (9), (10), (11), (15), (16) and (17).
2 4 7
(10)
Example 7.2. Figure 7.9 shows the mesh for the y > 0 portion of the gravity dam of the previous example.
1
(5)
(1)
3 6
(8) (12)
5
(6)
(7)
The area of a triangle with corners at {x1 , y1 }, {x2 , y2 } 10 (9) 11 (11) 12 (13) 13 (15) and {x3 , y3 }} is given by A = (x2 y3 x3 y2 ) + (x3 y1 (19) (17) x1 y3 ) + (x1 y2 x2 y1 ). Applying this to the geometry of 14 (14) 15 (16) 16 (18) 17 (20) 18 (29) (21) (27) the gure one nds that the areas are A(9) =, A(10) =, (23) (25) 19 (22) (28) (26) (24) A(11) =, A(15) =, A(16) =, and A(17) =. The weight 24 20 22 21 23 forces on each element are W (9) = h , W (10) = h , Figure 7.9. Computation of weight force at node W (11) = h , A(15) = h , A(16) = h , and A(17) = h , 11 of gravity dam example of Figure 7.7(d). where h is the thickness normal to the gure (1 ft here).
Node 7 8 9 10 11 12 13 14 15 16 17 18
x *.00 *.00 *.00 *.00 *.00 *.00 *.00 *.00 *.00 *.00 *.00 *.00
y 152.00 152.00 152.00 94.00 94.00 94.00 94.00 40.00 40.00 40.00 40.00 40.00
For uniform element thickness and specic weight, one third of each force goes to each element corner. Thus node 11 receives (W (9) + W (10) + W (11) + W (17) + W (18) ) = (7.1) f y 11 = 1 3 (example incomplete, TBF) 7.3.3. *Weighted Lumping The NbN and EbE methods are restricted to simple elements, specically those with corner nodes only. We outline here a general method that works for more complicated models. The mathematical justication requires energy theorems covered in Part II. Thus at this stage the technique is merely presented as a recipe. To x the ideas consider again the 2D situation depicted in Figures 7.4 and 7.5. Denote the distributed load by q (x ). We want to nd the lumped force f n at an interior node n of coordinate xn . Let the adjacent nodes be n 1 and n + 1, with coordinates xn1 and xn+1 , respectively. Introduce a weight function Wn (x ) with properties to be specied below. The lumped force is given by fn =
xn +1 xn 1
Wn ( x ) q ( x ) d x
(7.2)
For this formula to make sense, the weight function must satisfy several properties: 1. 2. 3. Unit value at node n : Wn (xn ) = 1. Vanishes over any element not pertaining to n : Wn = 0 if x xn1 or x xn+1 Gives the same results as NbN or EbE for constant q over elements with corner nodes only. Wn ( x ) = 1 For EbE pick if
1 (xn1 2
Both NbN and EbE are special cases of 7.2. For NbN pick + xn ) x 1 (xn + xn+1 ), 2 wn (x ) = 0 otherwise. (7.3)
if xn x xn+1 , 0 otherwise. These particular weight functions are depicted in Figure 7.10.
xx 1 1 xn xnn 1 Wn ( x ) = x xn 1 x n +1 x n
if xn1 x xn ,
(7.4)
79
710
(a)
Wn = 1 1
(b) n1
Wn 1
n1
xn
n+1
xn
n+1
Figure 7.10. Weight functions corresponding to: (a) NbN lumping, and (b) EbE lumping.
7.3.4. *Energy Consistent Lumping The rule 7.2 can be justied from the standpoint of the Principle of Virtual Work. Let u n be a virtual node displacement paired to f n . Take u n Wn (x ) to be the associated displacement variation. The external virtual work of q (x ) is q (x )Wn (x ) u n d x extended over the portion where Wn = 0. Equating this to f n u n and cancelling u n from both sides yields 7.2. If Wn is the trial displacement function actually used for the development of element equations the lumping is called energy consistent, or consistent for short.
W1 = (1)/2 = N1
3 f 3 =? 1
2
2
W2 = 1 = N2
1
3
1
W3= (1+)/2 = N3 2 1 a
= 1 2x/a x
(As will be seen later, trial functions are the union of shape functions over the patch of all elements connected to node n .) This important technique is studied in Part II of the course after energy methods are introduced.
Example 7.3. Conside the mesh of 9-node quadrilaterals shown in Figure 7.11. (This is later used as a benchmark problem in Chapter 27.) The upper plate edge 13 is subject to a uniform normal load qh per unit length, where h is the plate thickness. The problem is to compute the node forces f 1 , f 2 and f 3 . If 12 and qha and f 2 = 1 qha . But 23 were on two different elements, both NbN and EbE would give f 1 = f 3 = 1 4 2 this lumping is wrong for an element with midside nodes. Instead, pick the weight functions Wi (i = 1, 2, 3) shown on the right of Figure 7.11.
Since there is only one element on the loaded edge, the Wi are actually the quadratic shape functions Ni for a 3-node line element, developed in later Chapters. The dimensionless variable is called an isoparametric natural coordinate. Applying the rule 7.2 we get
a
f1 =
0
dx d = W1 ( x ) q h d x = W1 ( ) q h d 1
1 1
1 (1 )q h ( 1 a) d = 1 qha . 2 2 6
(7.5)
Similarly f 2 = 2 qha and f 3 = f 1 . As a check, f 1 + f 2 + f 3 = qha , which is the total load acting on the 3 plate edge.
710
711
7.5
SUPPORT CONDITIONS
; ;;;; ;
; ; ;;;; ;;;; ; ;;
B B A A
;;;
;; ;;
x
(a)
(b)
(c)
; ;;;
B A
7.4. Boundary Conditions The key distinction between essential and natural boundary conditions (BC) was introduced in the previous Chapter. The distinction is explained in Part II from a variational standpoint. In this section we discuss the simplest essential boundary conditions in structural mechanics from a physical standpoint. This makes them relevant to problems with which a structural engineer is familiar. Because of the informal setting, the ensuing discussion relies heavily on examples. In structural problems formulated by the DSM, the recipe of 6.7.1 that distinguishes between essential and natural BC is: if it directly involves the nodal freedoms, such as displacements or rotations, it is essential. Otherwise it is natural. Conditions involving applied loads are natural. Essential BCs take precedence over natural BCs. The simplest essential boundary conditions are support and symmetry conditions. These appear in many practical problems. More exotic types, such as multifreedom constraints, require more advanced mathematical tools and are covered in the next two Chapters. 7.5. Support Conditions Supports are used to restrain structures against relative rigid body motions. This is done by attaching them to Earth ground (through foundations, anchors or similar devices), or to a ground structure which is viewed as the external environment.8 The resulting boundary conditions are often called motion constraints. In what follows we analyze two- and three-dimensional motions separately. 7.5.1. Supporting Two Dimensional Bodies Figure 7.12 shows two-dimensional bodies that move in the plane of the paper. If a body is not restrained, an applied load will cause innite displacements. Regardless of loading conditions, the body must be restrained against two translations along x and y , and one rotation about z . Thus the minimum number of constraints that has to be imposed in two dimensions is three. In Figure 7.12, support A provides translational restraint, whereas support B, together with A, provides rotational restraint. In nite element terminology, we say that we delete (x, remove, preclude) all translational displacements at point A, and that we delete the translational degree of
8
For example, the engine of a car is attached to the vehicle frame through mounts. The car frame becomes the ground structure, which moves with respect to Earth ground, as Earth rotates and moves through space, etc.
711
712
freedom directed along the normal to the AB direction at point B. This body is free to distort in any manner without the supports imposing any deformation constraints. Engineers call A and B reaction-to-ground points. This means that if the supports are conceptually removed, applied loads are automatically balanced by reactive forces at A and B, in accordance with Newtons third law. Additional freedoms may be precluded to model greater restraint by the environment. However, Figure 7.12(a) does illustrate the minimal number of constraints. Figure 7.12(b) is a simplication of Figure 7.12(a). Here the line AB is parallel to the global y axis. We simply delete the x and y translations at point A, and the x translation at point B. If the roller support at B is modied as in 7.12(c), however, it becomes ineffective in constraining the innitesimal rotational motion about point A because the rolling direction is normal to AB. The conguration of 7.12(c) is called a kinematic mechanism, and will result in a singular modied stiffness matrix. 7.5.2. Supporting Three Dimensional Bodies Figure 7.13 illustrates the extension of the freedomrestraining concept to three dimensions. The minimal number of freedoms that have to be constrained is now six and many combinations are possible. In the example of Figure 7.13, all three degrees of freedom at point A have been xed. This prevents all rigid body translations, and leaves three rotations to be taken care of. The x displacement component at point B is deleted to prevent rotation about z , the z component is deleted at point C to prevent rotation about y , and the y component is deleted at point D to prevent rotation about x . 7.6. Symmetry and Antisymmetry Conditions Engineers doing nite element analysis should be on the lookout for conditions of symmetry or antisymmetry. Judicious use of these conditions allows only a portion of the structure to be analyzed, with a consequent saving in data preparation and computer processing time.9 7.6.1. Visualization Recognition of symmetry and antisymmetry conditions can be done by either visualization of the displacement eld, or by imagining certain rotational ot reection motions. Both techniques are illustrated for the two-dimensional case. A symmetry line in two-dimensional motion can be recognized by remembering the mirror displacement pattern shown in Figure 7.14(a). Alternatively, a 180 rotation of the body about the symmetry line reproduces exactly the original problem. An antisymmetry line can be recognized by the displacement pattern illustrated in Figure 7.14(b).
9
; ; ; ;; ;; ;; ;; ; ; ;;
y B A C z
Even if symmetry or antisymmetry are not explicitly applied through boundary conditions, they provide valuable checks on the computed solution.
712
; ;
D
713
Alternatively, a 180 rotation of the body about the antisymmetry line reproduces exactly the original problem except that all applied loads are reversed. Similar recognition patterns can be drawn in three dimensions to help visualization of planes of symmetry or antisymmetry. More complex regular patterns associated with sectorial symmetry (also called harmonic symmetry) as well as rotational symmetry can be treated in a similar manner, but will not be discussed here. 7.6.2. Effect of Loading Patterns
(b)
Antisymmetry line
A'
loads
A"
displacement vectors
A' A
A"
Although the structure may look symmetric in shape, it must be kept in mind that model reduction can be used only if the loading conditions are also symmetric or antisymmetric.
y (a) A C B D x (b)
Consider the plate structure shown in Figure 7.15(a). This structure is symmetrically loaded on the x - y plane. Applying the recognition patterns stated above one concludes that the structure is doubly symmetric in both geometry and loading. It is evident that no displacements in the x -direction are possible for any point on the y -axis, and that no y displacements are possible for points on the x axis. A nite element model of this structure may look like that shown in Figure 7.15(b). On the other hand if the loading is antisymmetric, as illustrated in Figure 7.16(a), the x axis becomes an antisymmetry line as none of the y = 0 points can move along the x direction. The boundary conditions to be imposed on the FE model are also different, as shown in Figure 7.16(b).
Remark 7.3. For the case shown in Figure 7.16(b) note that all rollers slide in the same direction. Thus the vertical rigid body motion along y is not precluded. To do that, one node has to be constrained in the y direction. If there are no actual physical supports, the choice is arbitrary and amounts only to an adjustment on the overall (rigid-body) vertical motion. In Figure 7.16(b) the center point C has been so chosen. But any other node could be selected as well; for example A or D. The important thing is not to overconstrain the structure by applying more than one y constraint.
713
;; ;; ; ;
; ; ;
A C
B D
714
y (a) A B x (b)
; ; ;;;;
A B C
Vertical (y) motion of C (or another node) should be constrained to eliminate the y rigid motion
Remark 7.4. Point loads acting at nodes located on symmetry or antisymmetry lines require special care. For example, consider the doubly symmetric plate structure of Figure 7.15 under the two point loads of magnitude P , as pictured in Figure 7.17(a). If the structure is broken down into 4 quadrants as in Figure 7.17(b), P must be halved as indicated in Figure 7.17(c). The same idea applies to point loads on antisymmetry lines, but there the process is trickier, as illustrated in Figure 7.18. The load must not be applied if the node is xed against motion, since then the node force will appear as a reaction.
(a)
A B D
(b)
C
P/2 P/2
P/2 P/2
A C
B D
; ;; ;; ;; ;;
P/2
2P
Distributed loads should not be divided when the structure is broken down into pieces, since the lumping process will take care of the necessary apportionment to nodes. Notes and Bibliography FEM modeling rules in most textbooks are often diffuse, if given at all. In those that focus on the mathematical interpretation of FEM they are altogether lacking; the emphasis being on academic boundary value problems.
714
;; ;; ; ;; ; ;;
P/2
; ; ;
;; ;; ;;
;; ; ; ; ; ;
;; ;; ;;
(c)
P/2
715
7.
References
The rule collection at the start of this Chapter attempts to place important recommendations in one place. The treatment of boundary conditions, particularly symmetry and antisymmetry, tends to be also aky. A notable exception is [190], which is understandable since Irons worked in industry (at Rolls-Royce Aerospace Division) before moving to academia. The Norfork Dam used in Examples 7.1 and 7.2 (and two Exercises) for hydrostatic load-lumping calculations was the rst realistic Civil Engineering structure analyzed by FEM. It greatly contributed to the acceptance of the method beyond the aerospace industry where it had originated. How this seminal event came to pass is narrated by Wilson in [64], from which the following fragment is taken. Annotations are inserted in squared brackets. On the recommendation from Dr. Roy Carlson, a consultant to the Little Rock District of the Corps of Engineers, Clough [then a Professor at UC Berkeley] submitted [in 1960] a proposal to perform a nite element analysis of Norfork Dam, a gravity dam that had a temperature induced vertical crack near the center of the section. The proposal contained a coarse mesh solution that was produced by the new program [a matrix code developed by E. L. Wilson, then a doctoral student under Cloughs supervision; the mesh is that shown in Figure 7.7(d)] and clearly indicated the ability of the new method to model structures of arbitrary geometry with different orthotropic properties within the dam and foundation. The nite element proposal was accepted by the Corps over an analog computer proposal submitted by Professor Richard MacNeal of CalTech [who later directed the development of NASTRAN under a NASA contract in the late 1960s], which at that time was considered as the state-of-the-art method for solving such problems. The Norfork Dam project provided an opportunity to improve the numerical methods used within the program and to extend the nite element method to the nonlinear solution of the crack closing due to hydrostatic loading. Wilson and a new graduate student, Ian King, conducted the detailed analyses that were required by the study. The signicant engineering results of the project indicated that the cracked dam was safe [since the crack would be closed as the reservoir was lled]. References Referenced items moved to Appendix R.
715
716
Homework Exercises for Chapters 6 and 7 FEM Modeling: Mesh, Loads and BCs
P C A E D F M L J I B G
;;
N
;;
H
EXERCISE 7.1 [D:10] The plate structure shown in Figure E7.1 is loaded and deforms in the plane of the paper. The applied load at D and the supports at I and N extend over a fairly narrow area. List what you think are the likely trouble spots that would require a locally ner nite element mesh to capture high stress gradients. Identify those spots by its letter and a reason. For example, D : vicinity of point load.
EXERCISE 7.2 [D:15] Part of a two-dimensional FE mesh has been set up as indicated in Figure E7.2.
Region ABC D is still unmeshed. Draw a transition mesh within that region that correctly merges with the regular grids shown, uses 4-node quadrilateral elements (quadrilaterals with corner nodes only), and avoids triangles. Note: There are several (equally acceptable) solutions.
EXERCISE 7.3 [A:15] A rectangular plate of constant thickness h and inplane dimensions 8a and 6a is meshed with 8 rectangular elements as shown in Figure E7.3(a). The plate specic weight is and acts along the y axis direction.
(a)
Compute the node forces due to plate weight at nodes 1 through 15, using the NbN method. Obtain the node-tributary regions as sketched in Figure E7.3(b), which shows each element divided by the medians drawn as dashed lines (the tributary region of node 7 is shown in yellow). Partial answer: f y 1 = 2a 2 h . Check that adding up all y forces at the 15 nodes one gets W = 48a 2 h . Repeat the computations using the EbE method. For this, take the total weight force on each element, and assign one quarter to each corner node. (This agrees with consistent energy lumping for 4-node rectangular elements.) Do the results agree with NbN lumping?
(b)
716
717
Exercises
(a)
1
(b)
1 2 3 4 5
y x
6
(1)
7
(2)
8
(3)
9
(4)
6a
10 6 7 8 9 10
2a
11
(5)
12
(6)
13
(7)
14
(8)
15 11 12 13 14 15
8a
Figure E7.3. (a) Mesh layout for Exercise 7.3. (b) shows tributary area for node 7.
EXERCISE 7.4 [N/C:20] Complete the computation of hydrostatic node forces on the Norfork Dam under a
water head of 180 ft, initiated in Example 7.1, using the data of Figure 7.8, and either the NbN or EbE method (pick one). Assume face AB is vertical. Do two checks: sum of horizontal (x ) forces on nodes 1 through 5 is 1 1802 62.4 lbs, and sum of vertical ( y ) forces on nodes 5 through 9 is 180 62.4 490 lbs. 2
EXERCISE 7.5 [N/C:25] Complete the computation of own weight nodal forces of the coarse mesh of the Norfork dam proper, initiated in Example 7.2, reusing the data of Figure 7.9. Use the EbE method. Recover coordinates, and write a computer program to compute node forces. Compute the total weight of the dam slice in lbs. EXERCISE 7.6 [A:10] Figure E7.4 depicts two
instances of a pull test. In (a) a stiffer material (steel rod) is pulled out of a softer one (concrete block); in this case the load transfer diagram shows a rapid variation near the inner end of the rod. In (b) a softer material (plastic rod) is pulled out of a stiffer one (concrete rod), and the load transfer diagram is reversed. If the test is to be simulated by a nite element model, indicate for (a) and (b) where a ner mesh would be desirable. Explain.
(a)
(b)
EXERCISE 7.7 [D:20] Identify the symmetry and antisymmetry lines in the two-dimensional problems illustrated in Figure E7.5. They are: (a) a circular disk under two diametrically opposite point forces (the famous Brazilian test for concrete); (b) the same disk under two diametrically opposite force pairs; (c) a clamped semiannulus under a force pair oriented as shown; (d) a stretched rectangular plate with a central circular hole. Finally (e) and (f) are half-planes under concentrated loads.10
Steel
Plastic
Having identied those symmetry/antisymmetry lines, state whether it is possible to cut the complete structure to one half or one quarter before laying out a nite element mesh. Then draw a coarse FE mesh indicating, with rollers or xed supports, which kind of displacement BCs you would specify on the symmetry or antisymmetry lines. Note: Do all sketches on your paper, not on the printed gures.
10
Note that (e) is the famous Flamants problem, which is important in the 2D design of foundations of civil structures. The analytical solution of (e) and (f) may be found, for instance, in Timoshenko-Goodiers Theory of Elasticity, 2nd Edition, page 85ff.
717
718
(a)
P (b) P
P P
;; ;;
P P
(d)
45
o
(c)
(uniform)
center hole
fixed
q
45o
P
(f)
(e)
EXERCISE 7.8 [D:20] You (a nite element guru) pass away and come back to the next life as an intelligent
but hungry bird. Looking around, you notice a succulent big worm taking a peek at the weather. You grab one end and pull for dinner; see Figure E7.6. After a long struggle, however, the worm wins. While hungrily looking for a smaller one your thoughts wonder to FEM and how the worm extraction process might be modeled so you can pull it out more efciently. Then you wake up to face this homework question. Try your hand at the following worm modeling points. (a) The worm is simply modeled as a string of one-dimensional (bar) elements. The worm axial force is of course constant from the beak B to ground level G , then decreases rapidly because of soil friction (which varies roughly as plotted in the gure above) and drops to nearly zero over D E . Sketch how a good worm-element mesh should look like to capture the axial force well. On the above model, how would you represent boundary conditions, applied forces and friction forces? Next you want a more rened anaysis of the worm that distinguishes skin and insides. What type of nite element model would be appropriate? (Advanced) Finally, point out what need to be added to the model of (c) to include the soil as an elastic medium.
718
719
B
Exercises
; ; ; ; ; ; ; ; ;;;;;;;;
G D
friction force on worm surface
Two symmetry lines in 2D cannot cross at a nite point, unless that point is xed. Two antisymmetry lines in 2D cannot cross at a nite point, unless that point is xed. A symmetry line and an antisymmetry line must cross at right angles, unless the cross point is xed.
Note: proofs of (a,b,c) are very similar; just draw vectors at alleged intersections. angle / n from each other. This is called sectorial symmetry if n 3. Draw a picture for n = 5, say for a car wheel. Explain why point C is xed.
EXERCISE 7.11 [A/D:25, 5 each] A body is in 3D space. The analogs of symmetry and antisymmetry lines EXERCISE 7.10 [A/D:15] A 2D body has n > 1 symmetry lines passing through a point C and spanning an
are symmetry and antisymmetry planes, respectively. The former are also called mirror planes. (a) (b) (c) (d) (e) State the kinematic properties of symmetry and antisymmetric planes, and how they can be identied. Two symmetry planes intersect. State the kinematic properties of the intersection line. A symmetry plane and an antisymmetry plane planes intersect. State the kinematic properties of the intersection line. Can the angle between the planes be arbitrary? Can two antisymmetry planes intersect? Three symmetry planes intersect. State the kinematic properties of the intersection point.
EXERCISE 7.12 [A:25] A 2D problem is called periodic in the x direction if all elds, in particular displace-
ments, repeat upon moving over a distance a > 0: u x (x + a , y ) = u x (x , y ) and u y (x + a , y ) = u y (x , y ). Can this situation be treated by symmetry and/or antisymmetry lines?
EXERCISE 7.13 [A:25] Extend the previous exercise to antiperiodicity, in which u x (x + a , y ) = u x (x , y ) and u y (x + a , y ) = u y (x , y ). EXERCISE 7.14 [A:20] Prove that EbE and energy consistent lumping agree if the element shape functions are piecewise linear. EXERCISE 7.15 [A:40] If the world were spatially n -dimensional (meaning it has elliptic metric), how many
719
Introduction to FEM
IFEM Ch 7 Slide 1
Introduction to FEM
Topics in Chapter 7
General Modeling Rules Finite Element Mesh Layouts Distributed Loads NbN Lumping EbE Lumping Displacement BCs suppressing rigid body motions taking advantage of symmetry and antisymmetry
IFEM Ch 7 Slide 2
Introduction to FEM
IFEM Ch 7 Slide 3
Introduction to FEM
In product design situations several FEM models of increasing refinement will be set up as design evolves Ergo, do not overkill at the beginning
IFEM Ch 7 Slide 4
Introduction to FEM
entrant corners Cutouts Cracks weld Vicinity of concentrated (point) loads, and sharp contact areas
Material interfaces
IFEM Ch 7 Slide 5
Introduction to FEM
IFEM Ch 7 Slide 6
Introduction to FEM
No
OK
Physical interface
IFEM Ch 7 Slide 7
Introduction to FEM
Other things being equal, prefer in 2D: Quadrilaterals over Triangles in 3D: Bricks over Wedges Wedges over Tetrahedra
IFEM Ch 7 Slide 8
Introduction to FEM
;; ;; ;; ;;
3
f3 = P 4 5 6
Boundary
IFEM Ch 7 Slide 9
Introduction to FEM
f2e 1
f 2 = (b/L )P
C
e
f3e = (a/Le)P
f3e
2
4 5 6 Boundary
P
a b
IFEM Ch 7 Slide 10
Introduction to FEM
EbE Shortcut for Linearly Varying Line Load (Bypasses Centroid Calculation)
e L f i = 6 (2qi +qj )
qi
qj
e L f j = (qi +2qj )
IFEM Ch 7 Slide 11
Introduction to FEM
IFEM Ch 7 Slide 12
Introduction to FEM
IFEM Ch 7 Slide 13
Introduction to FEM
; ; ;;;;
(a)
(b)
y B
(c)
B
; ;;;
A
;; ;;
; ;;; ;
A
; ; ;;;
A
; ;
x
IFEM Ch 7 Slide 14
Introduction to FEM
IFEM Ch 7 Slide 15
;; ;; ;;
x
Introduction to FEM
(a)
Symmetry line
(b)
Antisymmetry line
A' loads
A' A
A"
IFEM Ch 7 Slide 16
Introduction to FEM
(b)
; ;; ; ; ;
IFEM Ch 7 Slide 17
; ;
A C
B D
Introduction to FEM
(b)
;; ;; ;; ;; ;; ;; ;; ;; ;; ;;
A B C
Vertical (y) motion of one node such as C or D may be constrained to suppress y-RBM
IFEM Ch 7 Slide 18
Introduction to FEM
(a)
A B D
(b)
P/2 P/2
P/2 P/2
IFEM Ch 7 Slide 19
; ;;; ; ; ; ;
; ; ;
(c)
P/2
Introduction to FEM
A C
B D
; ; ;; ;; ;; ;; ;;
P/2
IFEM Ch 7 Slide 20
;; ;; ;; ; ;; ; ;;
P/2
; ; ;
2P
; ; ;
720
Homework Exercises for Chapter 7. - Solutions FEM Modeling: Mesh, Loads and BCs
EXERCISE 7.1 Trouble spots from recipe are: B, F, J, M (entrant corners), N, D, I (concentrated forces).
Figure E7.7. Figure shows principal stress trajectories or isostatics. They are drawn in red for tension and blue for compression. (Determined from experimental data gathered in 1964 photoelasticity project at UC Berkeley.) Trajectories bunch up in regions of high stress gradients near loads and entrant corners.
EXERCISE 7.2 What perhaps are the two simplest solutions for the transition zone are pictured in Figure
E7.8.
Several quadrilateral-based transition meshes are illustrated in Figure E7.9 for completeness; redrawn from Irons and Ahmad [148]. The solutions of Figure E7.8 are essentially variations of (e) and (f). Solution (d) is interesting in that it produces somewhat better looking element shapes.
EXERCISE 7.3
(a)
Counting tributary squares of size a a rapidly gives the answer: f y 1 = f y 5 = 2a 2 h , f y 2 = f y 3 = f y 4 = 4a 2 h , f y 6 = f y 10 = 3a 2 h , f y 7 = f y 8 = f y 9 = 6a 2 h , f y 11 = f y 15 = a 2 h , n =15 f y 12 = f y 13 = f y 14 = 2a 2 h . Check: W = n=1 f yn = (2 2 + 3 4 + 2 3 + 3 6 + 2 1 + 3 2) a 2 h = 48 a 2 h . The results are identical to NbN. When doing it by hand, EbE is slower because NbN can be done by grid eyeballing.
(b)
720
721
Solutions to Exercises
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
EXERCISE 7.4
This Exercise was solved with the Mathematica scripts listed in Figure E7.10. Note that the logic of the EbE script is simpler, with less ifs and buts than NbN. This is generally true of their computer implementations. Results of running these scripts are collected in the Table 7.1. Table 7.1. Results for Exercise 7.4 (forces in lbs) Node Node by Node (NbN) x -force y -force 15100.8 0 137779.2 0 296400.0 0 369532.8 0 192067.2 393120.0 0 1179360.0 0 1572480.0 0 1572480.0 0 786240.0 1010880.0 5503680.0 Element by Element (EbE) x -force y -force 20134.4 139776.0 295360.0 366912.0 188697.6 0 0 0 0 1010880.0 0 0 0 0 393120.0 1179360.0 1572480.0 1572480.0 786240.0 5503680.0
1 2 3 4 5 6 7 8 9 Sum
The sum of x -forces and y -forces checks out with the total hydrostatic forces 1 1802 62.4 = 1010880.0 lbs 2 and 490 180 62.4 = 5503680.0 lbs, respectively.
721
722
EXERCISE 7.5 Exercise never assigned. EXERCISE 7.6 Exercise never assigned. EXERCISE 7.7 Symmetry and antisymmetry lines are identied on Figure E7.11. Problem domains may be
reduced to the darker regions. Appropriate supports to realize these symmetry and antisymmetry conditions as well as actual supports (if given) are depicted in Figure E7.11.
EXERCISE 7.8 (a) From the beak to ground one worm-bar element is enough. Smaller elements inside
the ground, specially near G , to capture high force gradient. May increase in size as end E is approached. (b) Pull force as axial load at B . Friction forces, assumed known may be represented by tangentially lumping on worm nodes. Lateral worm displacement precluded by rollers over G E . (c) A 2D or 3D continuum-element solid model representing skin and insides.
722
723
Solutions to Exercises
P
(a) (b)
Partial credit for finding only the two symmetry lines if BCs & loads are correctly treated (see next figure)
P P
(c)
(e)
(d) A 2D or 3D continuum-element model for soil. No innite elements are needed because the problem is highly localized (a worm is not a dam). Friction may be represented by special nonlinear elements on the worm surface, but that is an advanced topic.
EXERCISE 7.9 Exercise never assigned. EXERCISE 7.10 Exercise never assigned. EXERCISE 7.11 Exercise never assigned. EXERCISE 7.12 Exercise never assigned. EXERCISE 7.13 Exercise never assigned.
(d)
(f)
723
724
(a)
; ;;; ; ;
; ; ;
P/2
(c)
(e)
Important BCs
; ; ; ;; ;; ; ; ; ; ; ; ;
P/2
;;; ; ; ;
(d)
no supports on hole edge nodes!
; ; ; ; ; ; ;; ; ;; ;;
(b)
P/2
(f)
Important BCs
BCs on truncated mesh edges can be fairly arbitrary if sufficiently away from load. Recommend placing rollers as shown but full fixity would not be a serious mistake
Figure E7.12. Representation of the kinematic boundary conditions on the reduced regions (darker areas) of the previous gure. Only extremely coarse FEM meshes sketched since the only important answers are the treatment of boundary conditions and loads.
EXERCISE 7.14 Exercise never assigned. EXERCISE 7.15 Exercise never assigned. EXERCISE 7.16 n (n + 1)/2.
724
; ; ;; ; ;; ; ;; ; ; ;;;; ;; ;;
P
; ; ; ; ; ; ;
P/2
P/2
; ; ; ; ;;;; ;;
BCs on truncated mesh edges can be fairly arbitrary if sufficiently away from load. Recommend placing rollers as shown but full fixity would not be a serious mistake
MultiFreedom Constraints I
81
82
TABLE OF CONTENTS
Page
8.1.
8.2. 8.3.
8. 8. 8.
Classication of Constraint Conditions 8.1.1. MultiFreedom Constraints . . . . . . . 8.1.2. Methods for Imposing Multifreedom Constraints 8.1.3. *MFC Matrix Forms . . . . . . . . . The Example Structure The Master-Slave Method 8.3.1. A One-Constraint Example . . . . . . . 8.3.2. Several Homogeneous MFCs . . . . . . 8.3.3. Nonhomogeneous MFCs . . . . . . . . 8.3.4. *The General Case . . . . . . . . . 8.3.5. *Retaining the Original Freedoms . . . . . 8.3.6. Model Reduction by Kinematic Constraints . 8.3.7. Assessment of the Master-Slave Method . . . Notes and Bibliography . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . .
82
83
8.1
8.1. Classication of Constraint Conditions In previous Chapters we have considered structural support conditions that are mathematically expressable as constraints on individual degrees of freedom: nodal displacement component = prescribed value. (8.1)
These are called single-freedom constraints. Chapter 3 explains how to incorporate constraints of this form into the master stiffness equations, using hand- or computer-oriented techniques. The displacement boundary conditions studied in Chapter 7, which include modeling of symmetry and antisymmetry, lead to constraints of this form. For example: u x 4 = 0, u y 9 = 0.6. (8.2)
These are two single-freedom constraints. The rst one is homogeneous while the second one is non-homogeneous. These attributes are dened below. 8.1.1. MultiFreedom Constraints The next step up in complexity involves multifreedom equality constraints, or multifreedom constraints for short, the last name being acronymed to MFC. These are functional equations that connect two or more displacement components: F (nodal displacement components) = prescribed value, (8.3)
where function F vanishes if all its nodal displacement arguments do. Equation (8.3), in which all displacement components are in the left-hand side, is called the canonical form of the constraint. An MFC of this form is called multipoint or multinode if it involves displacement components at different nodes. The constraint is called linear if all displacement components appear linearly on the left-hand-side, and nonlinear otherwise. The constraint is called homogeneous if, upon transfering all terms that depend on displacement components to the left-hand side, the right-hand side the prescribed value in (8.3) is zero. It is called non-homogeneous otherwise. In this and next Chapter only linear constraints will be studied. Furthermore more attention is devoted to the homogeneous case, because it arises more frequently in practice.
Remark 8.1. The most general constraint class is that of inequality constraints, such as u y 5 2u x 2 0.5.
These constraints are relatively infrequent in linear structural analysis, except in problems that involve contact conditions. They are of paramount importance, however, in other elds such as optimization and control.
83
84
u , ux2 = 1 2 y2
u x 2 2u x 4 + u x 6 = 1 , 4
(x5 + u x 5 x3 u x 3 )2 + ( y5 + u y 5 y3 u y 3 )2 = 0.
(8.4)
The rst one is linear and homogeneous. It is not a multipoint constraint because it involves the displacement components of one node: 2. The second one is multipoint because it involves three nodes: 2, 4 and 6. It is linear and non-homogeneous. The last one is multipoint, nonlinear and homogeneous. Geometrically it expresses that the distance between nodes 3 and 5 in two-dimensional motions on the {x , y } plane remains constant. This kind of constraint appears in geometrically nonlinear analysis of structures, which is a topic beyond the scope of this book.
8.1.2. Methods for Imposing Multifreedom Constraints Accounting for multifreedom constraints is done at least conceptually by changing the assembled master stiffness equations to produce a modied system of equations: Ku = f
MFC
u = K f.
(8.5)
The modication process (8.5) is also called constraint application or constraint imposition. The modied system is that submitted . to the equation solver, which returns u The procedure is owcharted in Figure 8.1. The sequence of operations sketched therein applies to all methods outlined below. 1.
Three methods for treating MFCs are discussed in this and the next Chapter: Master-Slave Elimination. The degrees of freedom involved in each MFC are separated into master and slave freedoms. The slave freedoms are then explicitly eliminated. The modied equations do not contain the slave freedoms. Penalty Augmentation. Also called the penalty function method. Each MFC is viewed as the presence of a ctitious elastic structural element called penalty element that enforces it approximately. This element is parametrized by a numerical weight. The exact constraint is recovered if the weight goes to innity. The MFCs are imposed by augmenting the nite element model with the penalty elements. Lagrange Multiplier Adjunction. For each MFC an additional unknown is adjoined to the master stiffness equations. Physically this set of unknowns represent constraint forces that would enforce the constraints exactly should they be applied to the unconstrained system.
2.
3.
For each method the exposition tries to give rst the basic avor by working out the same example for each method. The general technique is subsequently presented in matrix form for completeness but is considered an advanced topic. Conceptually, imposing MFCs is not different from the procedure discussed in Chapter 3 for singlefreedom constraints. The master stiffness equations are assembled ignoring all constraints. Then 84
85
8.2
the MFCs are imposed by appropriate modication of those equations. There are, however, two important practical differences: 1. The modication process is not unique because there are alternative constraint imposition methods, namely those listed above. These methods offer tradeoffs in generality, programming implementation complexity, computational effort, numerical accuracy and stability. In the implementation of some of these methods notably penalty augmentation constraint imposition and assembly are carried out simultaneously. In that case the framework rst assemble, then modify, is not strictly respected in the actual implementation.
2.
Remark 8.2. The three methods are also applicable, as can be expected, to the simpler case of a single-freedom constraint such as (8.2). For most situations, however, the generality afforded by the penalty function and Lagrange multiplier methods are not warranted. The hand-oriented reduction process discussed in Chapters 3 and 4 is in fact a special case of the master-slave elimination method in which there is no master. Remark 8.3. Often both multifreedom and single-freedom constraints are prescribed. The modication
process then involves two stages: apply multifreedom constraints and apply single freedom constraints. The order in which these are carried out is implementation dependent. Most implementations do the MFCs rst, either after the assembly is completed or during the assembly process. The reason is practical: single-freedom constraints are often automatically taken care of by the equation solver itself. 8.1.3. *MFC Matrix Forms Matrix forms of linear MFCs are often convenient for compact notation. An individual constraint such as the second one in (8.4) may be written [1 In direct matrix notation: i = gi , i u a (no sum on i ) (8.7) i collects the set of degrees of i is a row vector, u in which index i (i = 1, 2, . . .) identies the constraint, a freedom that participate in the constraint, and gi is the right hand side scalar (0.25 in the foregoinf example). The bars over a and u distinguishes (8.7) from the expanded form (8.9) discussed below. For method description and general proofs it is often convenient to expand matrix forms so that they embody all degrees of freedom. For example, if (8.6) is part of a two-dimensional nite element model with 12 freedoms: u x 1 , u y 1 , . . . u y 6 , the left-hand side row vector may be expanded with nine zeros as follows 2 1] ux2 ux4 ux6 = 0.25. (8.6)
u
x1
[0 0 1 0 0
0 2
u y1 0 ] u x 2 = 0.25, . . .
u y6
(8.8)
in which case the matrix notation ai u = gi A u = g, (8.9) (8.10) is used. Finally, all multifreedom constraints expressed as (8.9) may be collected into a single matrix relation:
in which rectangular matrix A is formed by stacking the ai s as rows and column vector g is formed by stacking the gi s as entries. If there are 12 degrees of freedom in u and 5 multifreedom constraints then A will be 5 12.
85
86
u5 , f5
(5)
u 1 , f1
(1)
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u6 , f 6
(6)
u7 , f7
x
7
Figure 8.2. A one-dimensional problem discretized with six bar nite elements. The seven nodes may move only along the x direction. Subscript x is omitted from the u s and f s to reduce clutter.
8.2. The Example Structure The one-dimensional nite element discretization shown in Figure 8.2 will be used throughout Chapters 8 and 9 to illustrate the three MFC application methods. This structure consists of six bar elements connected by seven nodes that can only displace in the x direction. Before imposing various multifreedom constraints discussed below, the master stiffness equations for this problem are assumed to be K 11 K 12 0 0 0 0 0 or Ku = f. (8.12) The nonzero stiffness coefcients K i j in (8.11) depend on the bar rigidity properties. For example, if E e Ae / L e = 100 for each element e = 1, . . . , 6, then K 11 = K 77 = 100, K 22 = . . . = K 66 = 200, K 12 = K 23 = . . . = K 67 = 100. However, for the purposes of the following treatment the coefcients may be kept arbitrary. The component index x in the nodal displacements u and nodal forces f has been omitted for brevity. Now let us specify a multifreedom constraint that states that nodes 2 and 6 must move by the same amount: u2 = u6. (8.13) Passing all node displacements to the right hand side gives the canonical form: u 2 u 6 = 0. (8.14) K 12 K 22 K 23 0 0 0 0 0 K 23 K 33 K 34 0 0 0 0 0 K 34 K 44 K 45 0 0 0 0 0 K 45 K 55 K 56 0 0 0 0 0 K 56 K 66 K 67 0 u1 0 u2 0 u3 0 u4 = 0 u5 K 67 u6 K 77 u7 f1 f2 f3 f4 , f5 f6 f7
(8.11)
Constraint conditions of this type are sometimes called rigid links because they can be mechanically interpreted as forcing node points 2 and 6 to move together as if they were tied by a rigid member.1 We now study the imposition of constraint (8.14) on the master equations (8.11) by the methods mentioned above. In this Chapter the master-slave method is treated. The other two methods: penalty augmentation and Lagrange multiplier adjunction, are discussed in the following Chapter.
1
This physical interpretation is exploited in the penalty method described in the next Chapter. In two and three dimensions rigid link constraints are more complicated.
86
To apply this method by hand, the MFCs are taken one at a time. For each constraint a slave degree of freedom is chosen. The freedoms remaining in that constraint are labeled master. A new set is established by removing all slave freedoms from u. This new vector of degrees of freedom u contains master freedoms as well as those that do not appear in the MFCs. A matrix transformation is generated. This equation is used to apply a congruent transformation equation that relates u to u to the master stiffness equations. This procedure yields a set of modied stiffness equations that . Because the modied system does not contain the are expressed in terms of the new freedom set u slave freedoms, these have been effectively eliminated. 8.3.1. A One-Constraint Example The mechanics of the process is best seen by going through an example. To impose (8.14) pick u 6 as slave and u 2 as master. Relate the original unknowns u 1 , . . . u 7 to the new set in which u 6 is missing: u1 1 0 0 0 0 0 u1 u2 0 1 0 0 0 0 u u3 0 0 1 0 0 0 2 u (8.15) u4 = 0 0 0 1 0 0 3 , u4 u5 0 0 0 0 1 0 u5 u6 0 1 0 0 0 0 u7 u7 0 0 0 0 0 1 This is the required transformation relation. In compact form: u = Tu . (8.16)
Replacing (8.15) into (8.12) and premultiplying by TT yields the modied system u = K f, in which = TT K T, K f = TT f. (8.17)
(8.18)
Equation (8.18) is a new linear system containing 6 equations in the remaining 6 unknowns: u 1 , u 2 , u 3 , u 4 , u 5 and u 7 . Upon solving it, u 6 is recovered from the constraint (8.13).
Remark 8.4. The form of modied system (8.17) can be remembered by a simple mnemonic rule: premultiply
87
88
Remark 8.5. For a simple freedom constraint such as u 4 = 0 the only possible choice of slave is of course
u 4 and there is no master. The congruent transformation is then nothing more than the elimination of u 4 by striking out rows and columns from the master stiffness equations.
Remark 8.6. For a simple MFC such as u 2 = u 6 , it does not matter which degree of freedom is chosen as master or unknown. Choosing u 2 as slave produces a system of equations in which now u 2 is missing:
11
0 0 0
K 12 0
0 K 33 K 34 0 K 23 0
0 K 34 K 44 K 45 0 0
0 0 K 45 K 55 K 56 0
K 12 K 23 0 K 56 K 22 + K 66 K 67
0 u1 f1 0 u 3 f3 0 u 4 = f4 . 0 u 5 f5 K 67 u6 f2 + f6 K 77 u7 f7
(8.19)
Although (8.18) and (8.19) are algebraically equivalent, the latter would be processed faster if a skyline solver (Part III of course) is used for the modied equations.
8.3.2. Several Homogeneous MFCs The matrix equation (8.17) in fact holds for the general case of multiple homogeneous linear constraints. Direct establishment of the transformation equation, however, is more complicated if slave freedoms in one constraint appear as masters in another. To illustrate this point, suppose that for the example system we have three homogeneous multifreedom constraints: u 2 u 6 = 0, u 1 + 4u 4 = 0, 2u 3 + u 4 + u 5 = 0, (8.20)
Picking as slave freedoms u 6 , u 4 and u 3 from the rst, second and third constraint, respectively, we can solve for them as u6 = u2, u4 = 1 u , 4 1 u3 = 1 (u + u 5 ) = 1 u 1 u . 2 4 8 1 2 5 (8.21)
Observe that solving for u 3 from the third constraint brings u 4 to the right-hand side. But because u 4 is also a slave freedom (it was chosen as such for the second constraint) it is replaced in favor of u . The matrix form of the transformation (8.21) is u 1 using u 4 = 1 4 1 1 u1 0 u2 1 u3 81 u4 = 4 u5 0 u6 0 u7 0 0 0 1 0 0 1 2 0 0 1 0 0 1 0 0 0 0 0 u1 u2 0 u5 , 0 u7 0 1
(8.22)
The modied system is now formed through the congruent transformation (8.17). Note that the slave freedoms selected from each constraint must be distinct; for example the choice u 6 , u 4 , u 4 would be inadmissible as long as the constraints are independent. This rule is easy to enforce when slave freedoms are chosen by hand, but can lead to implementation and numerical difculties when it is programmed as an automated procedure, as further discussed later. 88
89
Remark 8.7. The three MFCs (8.20) with u 6 , u 4 and u 2 chosen as slaves and u 1 , u 2 and u 5 chosen as masters,
1 This may be compactly written As us + Am um = 0. Solving for the slave freedoms gives us = A s A m um . produces (8.22). This general matrix form is considered in 8.4.4. Expanding with zeros to ll out u and u Note that non-singularity of As is essential for this method to work.
8.3.3. Nonhomogeneous MFCs Extension to non-homogeneous constraints is immediate. In this case he transformation equation becomes non-homogeneous. For example suppose that (8.14) has a nonzero prescribed value: u 2 u 6 = 0.2 (8.24)
Nonzero RHS values such as 0.2 in (8.24) may be often interpreted physically as gaps (thus the use of the symbol g in the matrix form). Chose u 6 again as slave: u 6 = u 2 0.2, and build the transformation 0 1 0 0 0 0 0 u1 u1 0 u2 0 1 0 0 0 0 u2 u3 0 0 1 0 0 0 0 u (8.25) u4 = 0 0 0 1 0 0 3 + 0 . u4 u5 0 0 0 0 1 0 0 u5 u6 0.2 0 1 0 0 0 0 u7 u7 0 0 0 0 0 0 1 In compact matrix notation, + g. u = Tu (8.26) Here the constraint gap vector g is nonzero and T is the same as before. To get the modied system applying the shortcut rule of Remark 8.4, premultiply both sides of (8.26) by TT K, replace Ku by f, and pass the data to the RHS: u = K f, in which = TT K T, K f = TT (f K g). (8.27)
, the complete displacement vector is recovered from (8.26). For the MFC Upon solving (8.27) for u (8.24) this technique gives the system u1 f1 K 12 0 0 0 0 K 11 0 K 56 K 67 u 2 f 2 + f 6 0.2 K 66 K 12 K 22 + K 66 K 23 K 23 K 33 K 34 0 0 u3 f3 0 (8.28) = . 0 u4 f4 0 K 34 K 44 K 45 0 0 K 56 0 K 45 K 55 0 u5 f 5 0.2 K 56 0 0 0 K 77 u7 f 7 0.2 K 67 0 K 67 See Exercise 8.2 for multiple non-homogeneous MFCs. 89
810
8.3.4. *The General Case For implementation in general-purpose programs the master-slave method can be described as follows. The degrees of freedoms in u are classied into three types: independent or unconstrained, masters and slaves. (The unconstrained freedoms are those that do not appear in any MFC.) Label these sets as uu , um and us , respectively, and partition the stiffness equations accordingly: Kuu T Kum T Kus Kum Kmm T Kms Kus Kms Kss uu um us = fu fm fs (8.29)
The MFCs may be written in matrix form as A m u m + A s us = g A , where As is assumed square and nonsingular. If so we can solve for the slave freedoms:
1 1 us = A s Am um + As g A = T um + g, def
(8.30)
Inserting into the partitioned stiffness equations (8.30) and symmetrizing yields Kuu symm Kmm Kum + Kus T T + T Kms + Kms T + TT Kss T
T
uu um
(8.32)
It is seen that the misleading simplicity of the handworked examples is gone. 8.3.5. *Retaining the Original Freedoms A potential disadvantage of the master-slave method in computer work is that it requires a rearrangement of is a subset of u. The disadvantage can be annoying when sparse the original stiffness equations because u matrix storage schemes are used for the stiffness matrix, and becomes intolerable if secondary storage is used for that purpose. With a bit of trickery it is possible to maintain the original freedom ordering. Let us display it for the example problem under (8.14). Instead of (8.15), use the square transformation
u1 1 u 2 0 u3 0 u4 = 0 u5 0 u6 0 u7 0
0 1 0 0 0 1 0
0 0 1 0 0 0 0
0 0 0 1 0 0 0 0 K 56 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 u1 0 u2 0 u3 0 u4 , 0 u5 u 6 0 u7 1 0 u1 f1 K 67 u 2 f 2 + f 6 0 u 3 f3 0 u 4 = f4 , 0 u 5 f5 u 6 0 0 K 77 u7 f7
(8.33)
in which u 6 is a placeholder for the slave freedom u 6 . The modied equations are
K 11 K 12 0 0 0 0 0
K 12 K 22 + K 66 K 23 0 K 56 0 K 67
0 K 23 K 33 K 34 0 0 0
0 0 K 34 K 44 K 45 0 0
0 0 0 K 45 K 55 0 0
(8.34)
which are submitted to the equation solver. If the solver is not trained to skip zero rows and columns, a one 6 = 0, and this should be placed in the diagonal entry for the u 6 (sixth) equation. The solver will return u placeholder value is replaced by u 2 . Note several points in common with the computer-oriented placeholder technique described in 3.4 to handle single-freedom constraints.
810
811
u 1 , f1
(1)
8.3
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
u 7, f7
1
u 1, f1
x
1 7
5 slave DOFs to be eliminated Reduced model
Master
u 1, f1
Master
u 7, f7
x
7
Figure 8.3. Model reduction of the example structure of Figure 8.2 to the end freedoms.
8.3.6. Model Reduction by Kinematic Constraints The congruent transformation equations (8.17) and (8.27) have additional applications beyond the master-slave method. An important one is model reduction by kinematic constraints. Through this procedure the number of DOF of a static or dynamic FEM model is reduced by a signicant number, typically to 1% 10% of the original number. This is done by taking a lot of slaves and a few masters. Only the masters are left after the transformation. The reduced model is commonly used in subsequent calculations as component of a larger system, particularly during design or in parameter identication.
Example 8.2. Consider the bar assembly of Figure 8.2. Assume that the only masters are the end motions u 1
or
. u = Tu
(8.35)
17 K 77 K
u1 u7
f1 , f7
(8.36)
(8.37)
811
812
(* Model Reduction Example *) ClearAll[K11,K12,K22,K23,K33,K34,K44,K45,K55,K56,K66, f1,f2,f3,f4,f5,f6]; K={{K11,K12,0,0,0,0,0},{K12,K22,K23,0,0,0,0}, {0,K23,K33,K34,0,0,0},{0,0,K34,K44,K45,0,0}, {0,0,0,K45,K55,K56,0},{0,0,0,0,K56,K66,K67}, {0,0,0,0,0,K67,K77}}; Print["K=",K//MatrixForm]; f={f1,f2,f3,f4,f5,f6,f7}; Print["f=",f]; T={{6,0},{5,1},{4,2},{3,3},{2,4},{1,5},{0,6}}/6; Print["T (transposed to save space)=",Transpose[T]//MatrixForm]; Khat=Simplify[Transpose[T].K.T]; fhat=Simplify[Transpose[T].f]; Print["Modified Stiffness:"]; Print["Khat(1,1)=",Khat[[1,1]],"\nKhat(1,2)=",Khat[[1,2]], "\nKhat(2,2)=",Khat[[2,2]] ]; Print["Modified Force:"]; Print["fhat(1)=",fhat[[1]]," fhat(2)=",fhat[[2]] ];
K11 K12 0 0 0 0 0 K12 K22 K23 0 0 0 0 0 K23 K33 K34 0 0 0 0 0 K34 K44 K45 0 0 0 0 0 K45 K55 K56 0 0 0 0 0 K56 K66 K67 0 0 0 0 0 K67 K77 f1, f2, f3, f4, f5, f6, f7 1 T transposed to save space 0
5 6 1 6 2 3 1 3 1 2 1 2 1 3 2 3 1 6 5 6
0 1
Modified Stiffness: 1 Khat 1,1 36 K11 60 K12 25 K22 40 K23 16 K33 24 K34 9 K44 12 K45 4 K55 4 K56 K66 36 1 Khat 1,2 6 K12 5 K22 14 K23 8 K33 18 K34 9 K44 18 K45 8 K55 14 K56 5 K66 6 K67 36 1 Khat 2,2 K22 4 K23 4 K33 12 K34 9 K44 24 K45 16 K55 40 K56 25 K66 60 K67 36 K77 36 Modified Force: 1 fhat 1 6 f1 6 1 6
5 f2
4 f3
3 f4
2 f5
f6
fhat 2
f2
2 f3
3 f4
4 f5
5 f6
6 f7
Figure 8.4. Mathematica script for the model reduction example of Figure 8.3.
This reduces the order of the FEM model from 7 to 2. A Mathematica script to do the reduction is shown in Figure 8.4. The key feature is that the masters are picked a priori, as the freedoms to be retained in the model for further use.
Remark 8.8. Model reduction can also be done by the static condensation method explained in Chapter 10. As its name indicates, condensation is restricted to static analysis. On the other hand, for such problems it is exact whereas model reduction by kinematic constraints generally introduces approximations.
812
8.3
What are the good and bad points of this constraint application method? It enjoys the advantage of being exact (except for inevitable solution errors) and of reducing the number of unknowns. The concept is also easy to explain and learn. The main implementation drawback is the complexity of the general case as can be seen by studying (8.29) through (8.32). The complexity is due to three factors: 1. 2. 3. The equations may have to be rearranged because of the disappearance of the slave freedoms. This drawback can be alleviated, however, through the placeholder trick outlined in 8.3.5. An auxiliary linear system, namely (8.31), has to be assembled and solved to produce the transformation matrix T and vector g. The transformation process may generate many additional matrix terms. If a sparse matrix storage scheme is used for K, the logic for allocating memory and storing these entries can be difcult and expensive.
The level of complexity depends on the generality allowed as well as on programming decisions. At one extreme, if K is stored as full matrix and slave freedom coupling in the MFCs is disallowed the logic is simple.2 At the other extreme, if arbitrary couplings are permitted and K is placed in secondary (disk) storage according to some sparse scheme, the complexity can become overwhelming. Another, more subtle, drawback of this method is that it requires decisions as to which degrees of freedom are to be treated as slaves. This can lead to implementation and numerical stability problems. Although for disjointed constraints the process can be programmmed in reliable form, in more general cases of coupled constraint equations it can lead to incorrect decisions. For example, suppose that in the example problem you have the following two MFCs:
1 u 6 2
+1 u = u6, 2 4
u 3 + 6u 6 = u 7 .
(8.38)
For numerical stability reasons it is usually better to pick as slaves the freedoms with larger coefcients. If this is done, the program would select u 6 as slave freedoms from both constraints. This leads to a contradiction because having two constraints we must eliminate two slave degrees of freedom, not just one. The resulting modied system would in fact be inconsistent. Although this defect can be easily xed by the program logic in this case, one can imagine the complexity burden if faced with hundreds or thousands of MFCs. Serious numerical problems can arise if the MFCs are not independent. For example:
1 u 6 2
= u6,
1 u 5 3
+ 6u 6 = u 7 ,
u 2 + u 3 u 7 = 0.
(8.39)
The last constraint is an exact linear combination of the rst two. If the program blindly choses u 2 , u 3 and u 7 as slaves, the modied system is incorrect because we eliminate three equations when in fact there are only two independent constraints.
2
This is the case in model reduction, since each slave freedom appears in one and only one MFC.
813
814
Exact linear dependence, as in (8.39), can be recognized by a rank analysis of the As matrix dened in (8.30). In oating-point arithmetic, however, such detection may fail because that kind of computation is inexact by nature.3 The complexity of slave selection is in fact equivalent to that of automatically selecting kinematic redundancies in the Force Method of structural analysis. It has led implementors of programs that use this method to require masters and slaves be prescribed in the input data, thus transfering the burden to users. The method is not generally extendible to nonlinear constraints without case by case programming. In conclusion, the master-slave method is useful when a few simple linear constraints are imposed by hand. As a general purpose technique for nite element analysis it suffers from complexity and lack of robustness. It is worth learning, however, because of the great importance of congruent transformations in model reduction for static and dynamic problems.
Notes and Bibliography Multifreedom constraints are treated in several of the FEM books recommended in 1.7.5, notably Zienkiewicz and Taylor [304]. The master-slave method was incorporated to treat MFCs as part of the DSM developed at Boeing during the 1950s. It is rst summarily described in the DSM-overview by Turner, Martin and Weikel [279, p. 212]. The implementation differs, however, from the one described here because the relation of FEM to energy methods was not clear at the time. The master-slave method became popular through its adoption by the general-purpose NASTRAN code developed in the late 1960s [8] and early assessments of its potential [271]. The implementation unfortunately relied on user inputs to identify slave DOFs. Through this serious blunder the method gained a reputation for unreliability that persists to the present day. The important application of master-slave to model reduction, which by itself justies teaching the method, is rarely mentioned in FEM textbooks. References Referenced items have been moved to Appendix R.
The safest technique to identify dependencies is to do a singular-value decomposition (SVD) of As . This can be, however, prohibitively expensive if one is dealing with hundreds or thousands of constraints.
814
815
Homework Exercises for Chapter 8 MultiFreedom Constraints I
Exercises
e = 1, . . . , 6. Consequently K 11 = K 77 = 100, K 22 = . . . = K 66 = 200, K 12 = K 23 = . . . = K 67 = 100. The applied node forces are taken to be f 1 = 1, f 2 = 2, f 3 = 3, f 4 = 4, f 5 = 5, f 6 = 6 and f 7 = 7, which are easy to remember. The structure is subjected to one support condition: u 1 = 0 (a xed left end), and to one MFC: u 2 u 6 = 1/5. Solve this problem using the master-slave method to process the MFC, taking u 6 as slave. Upon forming the modied system (8.27) apply the left-end support u 1 = 0 using the placeholder method of 3.4. Solve the equations and verify that the displacement solution and the recovered node forces including reactions are u = [ 0 0.270 Ku = [ 27 26.5 0.275 3 4 0.250 5 0.185 0.070 7 ]T 0.140 ]T (E8.1)
EXERCISE 8.1 [C+N:20] The example structure of Figure 8.1 has E e Ae / L e = 100 for each element
18.5
Use Mathematica or Matlab to do the algebra is recommended. For example, the Mathematica script of Figure E8.1 solves this Exercise.
(* Exercise 8.1 - Master-Slave Method *) (* MFC: u2-u6 = 1/5 - slave: u6 *) MasterStiffnessOfSixElementBar[kbar_]:=Module[ {K=Table[0,{7},{7}]}, K[[1,1]]=K[[7,7]]=kbar; For [i=2,i<=6,i++,K[[i,i]]=2*kbar]; For [i=1,i<=6,i++,K[[i,i+1]]=K[[i+1,i]]=-kbar]; Return[K]]; FixLeftEndOfSixElementBar[Khat_,fhat_]:=Module[ {Kmod=Khat,fmod=fhat}, fmod[[1]]=0; Kmod[[1,1]]=1; Kmod[[1,2]]=Kmod[[2,1]]=0; Return[{Kmod,fmod}]]; K=MasterStiffnessOfSixElementBar[100]; Print["Stiffness K=",K//MatrixForm]; f={1,2,3,4,5,6,7}; Print["Applied forces=",f]; T={{1,0,0,0,0,0},{0,1,0,0,0,0},{0,0,1,0,0,0}, {0,0,0,1,0,0},{0,0,0,0,1,0},{0,1,0,0,0,0}, {0,0,0,0,0,1}}; Print["Transformation matrix T=",T//MatrixForm]; g={0,0,0,0,0,-1/5,0}; Print["Constraint gap vector g=",g]; Khat=Simplify[Transpose[T].K.T]; fhat=Simplify[Transpose[T].(f-K.g)]; {Kmod,fmod}=FixLeftEndOfSixElementBar[Khat,fhat]; (* fix left end *) Print["Modified Stiffness upon fixing node 1:",Kmod//MatrixForm]; Print["Modified RHS upon fixing node 1:",fmod]; umod=LinearSolve[Kmod,fmod]; Print["Computed umod (lacks slave u6)=",umod]; u=T.umod+g; Print["Complete solution u=",u]; Print["Numerical u=",N[u]]; fu=K.u; Print["Recovered forces K.u with reactions=",fu]; Print["Numerical K.u=",N[fu]];
815
816
EXERCISE 8.2 [C+N:25] As in the previous Exercise but applying the following three MFCs, two of which
Hint. Chose u 4 , u 5 and u 6 as slaves. Much of the script shown for Exercise 8.1 can be reused. The main changes are in the formation of T and g. If you are a Mathematica wizard (or willing to be one) those can be automatically formed by the statements listed in Figure E8.2.
sol=Simplify[Solve[{u2-u6==1/5, u3+2*u4==-2/3,2*u3-u4+u5==0},{u4,u5,u6}]]; ums={u1,u2,u3,u4,u5,u6,u7}/.sol[[1]]; um={u1,u2,u3,u7}; T=Table[Coefficient[ums[[i]],um[[j]]],{i,1,7},{j,1,4}]; g=ums/.{u1->0,u2->0,u3->0,u4->0,u5->0,u6->0,u7->0}; Print["Transformation matrix T=",T//MatrixForm]; Print["Gap vector g=",g];
If you do this, explain what it does and why it works. Otherwise form and enter T and g by hand. The numerical results (shown to 5 places) should be u = [ 0. 0.043072 0.075033 Ku = [ 4.3072 16.118 10.268 0.29582 37.085 0.14575 16.124 0.15693 7. ] T . 0.086928 ]T , (E8.3)
8.1176
EXERCISE 8.3 [A:25] Can the MFCs be pre-processed to make sure that no slave freedom in a MFC appears
as master in another?
EXERCISE 8.4 [A:25] In the general case discussed in 8.4.4, under which condition is the matrix As of (8.30) diagonal and thus trivially invertible? EXERCISE 8.5 [A:25] Work out the general technique by which the unknowns need not be rearranged, that
are the same. Use placeholders for the slave freedoms. (Hint: use ideas of 3.4). is, u and u
EXERCISE 8.6 [A/C:35] Is it possible to establish a slave selection strategy that makes As diagonal or triangular? (This requires knowledge of matrix techniques such as pivoting.) EXERCISE 8.7 [A/C:40] Work out a strategy that produces a well conditioned As by selecting new slaves as linear combinations of nite element freedoms if necessary. (Requires background in numerical analysis and advanced programming experience in matrix algebra).
816
Introduction to FEM
MultiFreedom Constraints I
IFEM Ch 8 Slide 1
Introduction to FEM
Multifreedom Constraints
Single freedom constraint examples
u x 2 2u x 4 +u x 6 = 0.25
( x5 +u x 5 x3 u x 3 ) 2 +( y5 +u y 5 y3 u y 3 )2 = 0
nonlinear, homogeneous
IFEM Ch 8 Slide 2
Introduction to FEM
IFEM Ch 8 Slide 3
Introduction to FEM
Chapter 8
Chapter 9
IFEM Ch 8 Slide 4
Introduction to FEM
penalty function
IFEM Ch 8 Slide 5
Introduction to FEM
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
Multifreedom constraint:
u 2 u6 = 0
u2 = u6
or
IFEM Ch 8 Slide 6
Introduction to FEM
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
f1 f2 f3 f4 f5 f6 f7
Ku = f
IFEM Ch 8 Slide 7
Introduction to FEM
u2 = u6
or
u 2 u6 = 0
0 u1 0 u2 0 u3 0 u4 0 u5 0 u7 1
^ u=Tu
IFEM Ch 8 Slide 8
Introduction to FEM
Ku = f
^ u = Tu ^ KTu = f ^ TT K T u = TT f ^ ^ ^
Ku = f
IFEM Ch 8 Slide 9
Introduction to FEM
In full K 11 K 12 K 12 K 22 + K 66 0 K 23 0 0 0 K 56 0 K 67
u K f =
0 K 23 K 33 K 34 0 0 0 0 K 34 K 44 K 45 0 0 K 56 0 K 45 K 55 0 0 u1 K 67 u2 0 u3 = 0 u4 0 u5 K 77 u7
f1 f2 + f6 f3 f4 f5 f7
Solve for
u , then recover u = T u
IFEM Ch 8 Slide 10
Multiple MFCs
Suppose
u 2 u 6 = 0, u6 = u2 u 1 + 4 u4 = 0,
Introduction to FEM
2u 3 + u 4 + u 5 = 0
0 1 0 0 1 0
0 0 0 1 0 0
0 1 2
0 0 u 1 0 u2 0 u5 0 u7 0 1
IFEM Ch 8 Slide 11
Introduction to FEM
Non-homogeneous MFCs
u 2 u 6 = 0.2 u1 1 u2 0 u3 0 u4 = 0 u5 0 u6 0 u7 0
Pick again u 6 as slave, put into matrix form:
0 1 0 0 0 1 0
0 0 1 0 0 0 0
0 0 0 1 0 0 0
0 0 0 0 1 0 0
0 u1 0 u2 0 u3 0 u4 + 0 u5 0 u7 1
0 0 0 0 0 0.2 0
IFEM Ch 8 Slide 12
Introduction to FEM
Premultiply both sides by TT K, replace K u = f and pass data to RHS. This gives
u = f K
with
= TT K T and f = TT (f K g) K
a modified force vector
IFEM Ch 8 Slide 13
Introduction to FEM
K 11 K 12 0 0 0 0
K 12 K 22 + K 66 K 23 0 K 56 K 67
0 K 23 K 33 K 34 0 0
0 0 K 34 K 44 K 45 0
0 K 56 0 K 45 K 55 0
IFEM Ch 8 Slide 14
Introduction to FEM
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
u 7, f7
1
u 1, f1
x
1
5 slave DOFs to be eliminated
Master
u 1, f1
Reduced model
Master
u 7, f7
x
7
IFEM Ch 8 Slide 15
Introduction to FEM
5 slaves
2 masters
where
11 = K 17 = K 77 = K f1 =
1 (36 K 11 +60 K 12 +25 K 22 +40 K 23 +16 K 33 +24 K 34 +9 K 44 +12 K 45 +4 K 55 +4 K 56 + K 66 ) 36 1 (6 K 12 +5 K 22 +14 K 23 +8 K 33 +18 K 34 +9 K 44 +18 K 45 +8 K 55 +14 K 56 +5 K 66 +6 K 67 ) 36 1 ( K 22 +4 K 23 +4 K 33 +12 K 34 +9 K 44 +24 K 45 +16 K 55 +40 K 56 +25 K 66 +60 K 67 +36 K 77 ) 36 1 (6 f 1 +5 f 2 +4 f 3 +3 f 4 +2 f 5 + f 6 ), f7 = 1 ( f +2 f 3 +3 f 4 +4 f 5 +5 f 6 +6 f 7 ). 6 6 2
IFEM Ch 8 Slide 16
Introduction to FEM
12 K34
24 K45
5 f2
4 f3
3 f4
2 f5
f6
fhat 2
1 6
f2
2 f3
3 f4
4 f5
5 f6
6 f7
IFEM Ch 8 Slide 17
Introduction to FEM
IFEM Ch 8 Slide 18
817
Homework Exercises for Chapter 8. - Solutions MultiFreedom Constraints I
Solutions to Exercises
EXERCISE 8.1 Here are the results of running the Mathematica program under version 4.2:
Stiffness K
100 100 0 0 0 0 0
0 0 0 0 0 100 100
Applied forces
1, 2, 3, 4, 5, 6, 7 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 400 100 0 100 100 0 100 200 100 0 0 0 0 100 200 100 0 0 100 0 100 200 0 0 100 0 0 0 100
Transformation matrix T
Computed umod
lacks slave u6 0,
0,
EXERCISE 8.2
817
818
(* Exercise 8.2 - Master-Slave Method *) (* MFCs: u2-u6=1/5, u3+2u4=-2/3, 2u3-u4+u5=0 - slaves: u4,u5,u6 *) K=MasterStiffnessOfSixElementBar[100]; Print["Stiffness K=",K//MatrixForm]; f={1,2,3,4,5,6,7}; Print["Applied forces=",f]; T={{1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, -1/2, 0}, {0, 0, -5/2, 0}, {0, 1, 0, 0}, {0, 0, 0, 1}}; Print["Transf matrix T (transposed)=",Transpose[T]//MatrixForm]; g={0, 0, 0, -1/3, -1/3, -1/5, 0}; Print["Constraint gap vector g=",g]; Khat=Simplify[Transpose[T].K.T]; fhat=Simplify[Transpose[T].(f-K.g)]; {Kmod,fmod}=FixLeftEndOfSixElementBar[Khat,fhat]; (* fix left end *) Print["Modified Stiffness upon fixing node 1:",Kmod//MatrixForm]; Print["Modified RHS upon fixing node 1:",fmod]; umod=LinearSolve[Kmod,fmod]; Print["Computed umod (lacks slaves)=",umod]; u=T.umod+g; Print["Complete solution u=",u]; Print["Numerical u=",SetPrecision[N[u],5]]; fu=K.u; Print["Recovered forces K.u with reactions=",fu]; Print["Numerical K.u=",SetPrecision[N[fu],5]];
Modules MasterStiffnessOfSixElementBar and FixLeftEndOfSixElementBar are listed in the statement of Exercise 8.1. T and g were actually computed by the commands shown in the statement of the Exercise, printed in InputForm and fed into the script. But they could have also been computed by hand. Running this code gives
Stiffness K
100 100 0 0 0 0 0
0 0 0 0 0 100 100
Applied forces
1, 2, 3, 4, 5, 6, 7 1 0 0 0 1 0 0 0
1 2
0 0
5 2
0 0 1 0 0 0
Transf matrix T
transposed
0 0 1
0 1 Constraint gap vector g , 3 1 0 Modified Stiffness upon fixing node 1: 0 0 Modified RHS upon fixing node 1: 0, Computed umod lacks slaves 0, 0, 44 , 3
0 0 0 1 0, 0, 0, , 3
0 100 0 100
133 1530 223 , 1530 2401 , 15300 0.15693, 133 1530 0.086928 138 ,7 17
659 , 15300
2263 , 7650
0, 0.043072,
0.075033,
0.29582,
0.14575,
Recovered forces K.u with reactions Numerical K.u 4.3072, 16.118, 10.268,
818
819
EXERCISE 8.3 Never assigned. EXERCISE 8.4 Never assigned. EXERCISE 8.5 Never assigned. EXERCISE 8.6 Never assigned.
Solutions to Exercises
EXERCISE 8.7 If you can solve this one as a hobby, apply for a job with MSC Software.
819
MultiFreedom Constraints II
91
92
TABLE OF CONTENTS
Page
9.1.
9.2.
9.3. 9.4. 9. 9. 9.
The Penalty Method 9.1.1. Physical Interpretation . . . . . . . . 9.1.2. Choosing the Penalty Weight . . . . . . 9.1.3. The Square Root Rule . . . . . . . . 9.1.4. Penalty Elements for General MFCs . . . 9.1.5. *The Theory Behind the Recipe . . . . . 9.1.6. Assessment of the Penalty Method . . . . Lagrange Multiplier Adjunction 9.2.1. Physical Interpretation . . . . . . . . 9.2.2. Lagrange Multipliers for General MFCs . . 9.2.3. *The Theory Behind the Recipe . . . . . 9.2.4. Assessment of the Lagrange Multiplier Method *The Augmented Lagrangian Method Summary Notes and Bibliography . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
92
93
9.1
In this Chapter we continue the discussion of methods to treat multifreedom constraints (MFCs). The master-slave method described previously was found to exhibit serious shortcomings for treating arbitrary constraints, although the method has important applications to model reduction. We now pass to the study of two other methods: penalty augmentation and Lagrange multiplier adjunction. Both techniques are better suited to general implementations of the Finite Element Method, whether linear or nonlinear. 9.1. The Penalty Method
u 1 , f1
(1)
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
9.1.1. Physical Interpretation The penalty method will be rst presented using a physical argument, leaving the mathematical formulation to a subsequent section. Consider again the example structure of Chapter 8, which is reproduced in Figure 9.1 for convenience. To impose u 2 = u 6 imagine that nodes 2 and 6 are connected with a fat bar of axial stiffness w, labeled with element number 7, as shown in Figure 9.2. This bar is called a penalty element and w is its penalty weight. Such an element, albeit ctitious, can be treated exactly like another bar element insofar as continuing the assembly of the master stiffness equations. The penalty element stiffness equations, K(7) u(7) = f(7) , are1 1 1 u2 0 w = (9.1) u6 1 1 0 Because there is one freedom per node, the two local element freedoms map into global freedoms 2 and 6, respectively. Using the assembly rules of Chapter 3 we obtain the following modied master = stiffness equations: Ku f, which shown in detail are K 11 K 12 0 0 0 0 0 K 12 K 22 + w K 23 0 0 w 0 0 K 23 K 33 K 34 0 0 0 0 0 K 34 K 44 K 45 0 0 0 0 0 K 45 K 55 K 56 0 0 w 0 0 K 56 K 66 + w K 67 0 u1 0 u2 0 u3 0 u4 = 0 u5 K 67 u6 K 77 u7 f1 f2 f3 f4 . f5 f6 f7
(9.2)
u, and only K has changed. This system can now be submitted to the equation solver. Note that u
1
93
94
u5 , f5
(5)
u 1 , f1
(1)
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u6 , f 6
(6)
u7 , f7
x
7
4
(7)
9.1.2. Choosing the Penalty Weight What happens when (9.2) is solved numerically? If a nite weight w is chosen the constraint u 2 = u 6 is approximately satised in the sense that one gets u 2 u 6 = eg , where eg = 0. The gap error eg is called the constraint violation. The magnitude |eg | of this violation depends on the weight: the larger w , the smaller the violation. More precisely, it can be shown that |eg | becomes proportional to 1/w as w gets to be sufciently large (see Exercises). For example, raising w from, say, 106 to 107 can be expected to cut the constraint violation by roughly 10 if the physical stiffnesses are small compared to w. Therefore it seems as if the proper strategy should be: try to make w as large as possible while respecting computer overow limits. However, this is misleading. As the penalty weight w tends to the modied stiffness matrix in (9.2) becomes more and more ill-conditioned with respect to inversion. To make this point clear, suppose for deniteness that the rigidities E e Ae / L e of the actual bars e = 1, . . . 6 are unity, that w >> 1, and that the computer solving the stiffness equations has a oating-point precision of 16 decimal places. Numerical analysts characterize such precision by saying that f = O (1016 ), where | f | is the smallest power of 10 that perceptibly adds to 1 in oating-point arithmetic.2 The modied stiffness matrix of (9.2) becomes 1 1 0 0 0 0 0 0 w 0 1 2 + w 1 0 1 2 1 0 0 0 0 K= 0 (9.3) 0 1 2 1 0 0 0 0 1 2 1 0 0 0 w 0 0 1 2 + w 1 0 0 0 0 0 1 1 Clearly as w rows 2 and 6, as well as columns 2 and 6, tend to become linearly dependent; in fact the negative of each other. But linear dependency means singularity. Thus K approaches singularity as w . In fact, if w exceeds 1/ f = 1016 the computer will not be able to distinguish K from an exactly singular matrix. If w << 1016 but w >> 1, the effect will be seen in returned by the equation solver. increasing solution errors affecting the computed displacements u These errors, however, tend to be more of a random nature than the constraint violation error.
2
Such denitions are more rigurously done by working with binary numbers and base-2 arithmetic but for the present discussion the use of decimal powers is sufcient.
94
9.1
Obviously we have two effects at odds with each other. Making w larger reduces the constraint violation error but increases the solution error. The best w is that which makes both errors roughly equal in absolute value. This tradeoff value is difcult to nd aside of systematically running numerical experiments. In practice the heuristic square root rule is often followed. This rule can be stated as follows. Suppose that the largest stiffness coefcient, before adding penalty elements, is of the order of 10k and that the working machine precision is p digits.3 Then choose penalty weights to be of order 10k + p/2 with the proviso that such a choice would not cause arithmetic overow.4 For the above example in which k 0 and p 16, the optimal w given by this rule would be w 108 . This w would yield a constraint violation and a solution error of order 108 . Note that there is no simple way to do better than this accuracy aside from using extended (e.g., quad) oatingpoint precision. This is not easy to do when using standard low-level programming languages. The name square root arises because the recommended w is in fact 10k 10 p . It is seen that picking the weight by this rule requires knowledge of both stiffness magnitudes and oating-point hardware properties of the computer used, as well as the precision selected by the program. 9.1.4. Penalty Elements for General MFCs For the constraint u 2 = u 6 the physical interpretation of the penalty element is clear. Nodal points 2 and 6 must move in lockstep long x , which can be approximately enforced by the heavy bar device shown in Figure 9.2. But how about 3u 3 + u 5 4u 6 = 1? Or just u 2 = u 6 ? The treatment of more general constraints is linked to the theory of Courant penalty functions, which in turn is a topic in variational calculus. Because the necessary theory given in 9.1.5 is viewed as an advanced topic, the procedure used for constructing a penalty element is stated here as a recipe. Consider the homogeneous constraint 3u 3 + u 5 4u 6 = 0. Rewrite this equation in matrix form [3 1 u3 4 ] u 5 u6 = 0, (9.5) (9.4)
u3 4 ] u 5 u6
9 3 12
3 1 4
12 4 16
u3 u5 u6
e ue = =K
0 0 . 0
(9.6)
Such order-of-magnitude estimates can be readily found by scanning the diagonal of K because the largest stiffness coefcient of the actual structure is usually a diagonal entry. If overows occurs, the master stiffness should be scaled throughout or a better choice of physical units made.
95
96
is the unscaled stiffness matrix of the penalty element. This is now multiplied by the Here K penalty weight w and assembled into the master stiffness matrix following the usual rules. For the example problem, augmenting (9.2) with the w-scaled penalty element (9.6) yields K 11 K 12 0 0 0 0 0 K 12 K 22 K 23 0 0 0 0 0 K 23 K 33 + 9w K 34 3w 12w 0 0 0 K 34 K 44 K 45 0 0 0 0 3w K 45 K 55 + w K 56 4w 0 0 0 12w 0 K 56 4w K 66 + 16w K 67 0 u1 0 u2 0 u3 0 u4 = 0 u5 K 67 u6 K 77 u7 f1 f2 f3 f4 . f5 f6 f7
(9.7)
If the constraint is nonhomogeneous the force vector is also modied. To illustrate this effect, consider the MFC: 3u 3 + u 5 4u 6 = 1. Rewrite in matrix form as [3 1 u3 4 ] u 5 u6 = 1. (9.8)
Premultiply both sides by the transpose of the coefcient matrix: 9 3 12 Scaling by w and assembling yields K 11 K 12 0 0 0 0 0 K 12 K 22 K 23 0 0 0 0 0 K 23 K 33 + 9w K 34 3w 12w 0 0 0 K 34 K 44 K 45 0 0 0 0 3w K 45 K 55 + w K 56 4w 0 0 0 12w 0 K 56 4w K 66 + 16w K 67 u1 f1 0 0 u2 f2 0 u 3 f 3 + 3w 0 u4 = f4 . 0 u 5 f5 + w K 67 u6 f 6 4w K 77 u7 f7 (9.10) 3 1 4 12 4 16 u3 u5 u6 = 3 1 . 4 (9.9)
9.1.5. *The Theory Behind the Recipe The rule comes from the following mathematical theory. Suppose we have a set of m linear MFCs. Using the matrix notation introduced in 8.1.3, these will be stated as apu = bp, p = 1, . . . m (9.11)
where u contains all degrees of freedom and each a p is a row vector with same length as u. To incorporate the MFCs into the FEM model one selects a weight w p > 0 for each constraints and constructs the so-called Courant quadratic penalty function or penalty energy
m
P=
p =1
Pp ,
with
Pp = u T
1 T a a u 2 p p
T ( p) 1 T ( p) w p aT p bp = 2 u K u u f ,
(9.12)
96
97
9.1
( p) where we have called K( p) = w p aT = w p aT bi . P is added to the potential energy function p a p and f 1 T T = 2 u Ku u f to form the augmented potential energy a = + P . Minimization of a with respect to u yields m m
Ku +
p =1
( p)
u=f+
p =1
f( p ) .
(9.13)
Each term of the sum on p , which derives from term Pp in (9.12), may be viewed as contributed by a penalty ( p) = w p aT element with globalized stiffness matrix K( p) = w p aT p a p and globalized added force term f p bp. To use a even more compact form we may write the set of multifreedom constraints as Au = b. Then the penalty augmented system can be written compactly as (K + AT WA) u = f + WAT b, (9.14)
where W is a diagonal matrix of penalty weights. This compact form, however, conceals the conguration of the penalty elements.
9.1.6. Assessment of the Penalty Method The main advantage of the penalty function method is its straightforward computer implementation. Looking at modied systems such as (9.2), (9.7) or (9.10) it is obvious that the master equations are the same. Constraints may be programmed as penalty need not be rearranged. That is, u and u elements, and stiffness and force contributions of these elements merged through the standard assembler. In fact using this method there is no need to distinguish between unconstrained and constrained equations! Once all elements regular and penalty are assembled, the system can be passed to the equation solver.5 An important advantage with respect to the master-slave (elimination) method is its lack of sensitivity with respect to whether constraints are linearly dependent. To give a simplistic example, suppose that the constraint u 2 = u 6 appears twice. Then two penalty elements connecting 2 and 6 will be inserted, doubling the intended weight but not otherwise causing undue harm. An advantage with respect to the Lagrange multiplier method described in 9.2 is that positive deniteness is not lost. Such loss can affect the performance of certain numerical processes.6 Finally, it is worth noting that the penalty method is easily extendible to nonlinear constraints although such extension falls outside the scope of this book. The main disadvantage, however, is a serious one: the choice of weight values that balance solution accuracy with the violation of constraint conditions. For simple cases the square root rule previously described often works, although its effective use calls for knowledge of the magnitude of stiffness coefcients. Such knowledge may be difcult to extract from a general purpose black box program. For difcult cases selection of appropriate weights may require extensive numerical experimentation, wasting the user time with numerical games that have no bearing on the actual objective, which is getting a solution. The deterioration of the condition number of the penalty-augmented stiffness matrix can have serious side effects in some solution procedures such as eigenvalue extraction or iterative solvers.
5 6
Single freedom constraints, such as those encountered in Chapter 3, are usually processed separately for efciency. For example, solving the master stiffness equations by Cholesky factorization or conjugate-gradients.
97
98
u5 , f5
(5)
u 1 , f1
(1)
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u6 , f 6
(6)
u7 , f7
x
7
Figure 9.3. Physical interpretation of Lagrange multiplier adjunction to enforce the MFC u 2 = u 6 .
Finally, even if optimal weights are selected, the combined solution error cannot be lowered beyond a threshold value. From this assessment it is evident that penalty augmentation, although superior to the master-slave method from the standpoint of generality and ease of implementation, is no panacea. 9.2. Lagrange Multiplier Adjunction 9.2.1. Physical Interpretation As in the case of the penalty function method, the method of Lagrange multipliers can be given a rigorous justication within the framework of variational calculus. But in the same spirit it will be introduced for the example structure from a physical standpoint that is particularly illuminating. Consider again the constraint u 2 = u 6 . Borrowing some ideas from the penalty method, imagine that nodes 2 and 6 are connected now by a rigid link rather than a exible one. Thus the constraint is imposed exactly. But of course the penalty method with an innite weight would blow up. We may remove the link if it is replaced by an appropriate reaction force pair (, +), as illustrated in Figure 9.3. These are called the constraint forces. Incorporating these forces into the original stiffness equations (8.10) we get u1 f1 0 0 0 0 0 K 11 K 12 0 0 0 0 u 2 f2 K 12 K 22 K 23 K 23 K 33 K 34 0 0 0 u 3 f3 0 (9.15) 0 0 u 4 = f4 . 0 K 34 K 44 K 45 0 0 u 5 f5 0 0 K 45 K 55 K 56 0 u6 f6 + 0 0 0 0 K 56 K 66 K 67 0 0 0 0 0 K 67 K 77 u7 f7 This is called a Lagrange multiplier. Because is an unknown, let us transfer it to the left hand side by appending it to the vector of unknowns: u1 f1 0 0 0 0 0 0 K 11 K 12 u2 0 0 0 0 1 f2 K 12 K 22 K 23 u 0 0 0 0 3 f3 K 23 K 33 K 34 0 u (9.16) 0 0 0 4 = f4 . 0 K 34 K 44 K 45 0 u5 0 0 0 K K K 0 0 f 5 45 55 56 u f6 0 0 0 0 K 56 K 66 K 67 1 6 u7 f7 0 0 0 0 0 K 67 K 77 0 98
99
9.2
But now we have 7 equations in 8 unknowns. To render the system determinate, the constraint condition u 2 u 6 = 0 is appended as eighth equation: K 11 K 12 0 0 0 0 0 0 K 12 K 22 K 23 0 0 0 0 1 0 K 23 K 33 K 34 0 0 0 0 0 0 K 34 K 44 K 45 0 0 0 0 0 0 K 45 K 55 K 56 0 0 0 0 0 0 K 56 K 66 K 67 1 0 0 0 0 0 K 67 K 77 0 u1 0 1 u2 0 u3 0 u4 = 0 u5 1 u 6 0 u7 0 f1 f2 f3 f4 , f5 f6 f7 0
(9.17)
This is called the multiplier-augmented system. Its coefcient matrix, which is symmetric, is called the bordered stiffness matrix. The process by which is appended to the vector of original unknowns is called adjunction. Solving this system provides the desired solution for the degrees of freedom while also characterizing the constraint forces through . 9.2.2. Lagrange Multipliers for General MFCs The general procedure will be stated rst as a recipe. Suppose that we want to solve the example structure subjected to three MFCs u 2 u 6 = 0, 5u 2 8u 7 = 3, 3u 3 + u 5 4u 6 = 1, (9.18)
(9.19)
Three Lagrange multipliers: 1 , 2 and 3 , are required to take care of three MFCs. Adjoin those unknowns to the nodal displacement vector. Symmetrize the coefcient matrix by appending 3 columns that are the transpose of the 3 last rows in (9.19), and lling the bottom right-hand corner 99
910
0 0 K 34 K 44 K 45 0 0 0 0 0
0 0 0 K 45 K 55 K 56 0 0 0 1
0 0 0 0 K 56 K 66 K 67 1 0 4
0 0 0 0 0 K 67 K 77 0 8 0
0 0 1 5 0 0 0 0 0 0 1 0 0 8 0 0 0 0 0 0
u1 0 0 u2 3 u3 0 u4 1 u5 = 4 u 6 0 u7 0 1 2 0 3 0
f1 f2 f3 f4 f5 . f6 f7 0 3 1
(9.20)
9.2.3. *The Theory Behind the Recipe The recipe illustrated by (9.20) comes from a well known technique of variational calculus. Using the matrix notation introduced in 8.1.3, compactly denote the set of m MFCs by Au = b, where A is m n . The uT Ku uT f. To impose the constraint, potential energy of the unconstrained nite element model is = 1 2 adjoin m Lagrange multipliers collected in vector and form the Lagrangian L (u, ) = + T (Au b) = 1 uT Ku uT f + T (Au b). 2 AT 0 (9.21)
The master stiffness matrix K in (9.22) is said to be bordered with A and AT . Solving this system provides u and . The latter can be interpreted as forces of constraint in the following sense: a removed constraint can be replaced by a system of forces characterized by multiplied by the constraint coefcients. More precisely, the constraint forces are AT .
9.2.4. Assessment of the Lagrange Multiplier Method In contrast to the penalty method, the method of Lagrange multipliers has the advantage of being exact (aside from computational errors due to nite precision arithmetic). It provides directly the constraint forces, which are of interest in many applications. It does not require guesses as regards weights. As the penalty method, it can be extended without difculty to nonlinear constraints. It is not free of disadvantages. It introduces additional unknowns, requiring expansion of the original stiffness method, and more complicated storage allocation procedures. It renders the augmented stiffness matrix indenite, an effect that may cause grief with some linear equation solving methods that rely on positive deniteness. Finally, as the master-slave method, it is sensitive to the degree of linear independence of the constraints: if the constraint u 2 = u 6 is specied twice, the bordered stiffness is obviously singular. On the whole this method appears to be the most elegant one for a general-purpose nite element program that is supposed to work as a black box by minimizing guesses and choices from its users. Its implementation, however, is not simple. Special care must be exercised to detect singularities due to constraint dependency and to account for the effect of loss of positive deniteness of the bordered stiffness on equation solvers. 910
911
9.3.
9.4
SUMMARY
The general matrix forms of the penalty function and Lagrangian multiplier methods are given by expressions (9.13) and (9.22), respectively. A useful connection between these methods can be established as follows. Because the lower diagonal block of the bordered stiffness matrix in (9.22) is null, it is not possible to directly eliminate . To make this possible, replace this block by S1 , where S is a constraint-scaling diagonal matrix of appropriate order and is a small number. The reciprocal of is a large number called w = 1/ . To maintain exactness of the second equation, S1 is added to the right-hand side: K A AT S1 u = S P
1
(9.23)
Here superscript P (for predicted value) is attached to the on the right-hand side as a tracer. We can now formally solve for and subsequently for u. The results may be presented as (K + wAT SA) u = f + wAT Sb AT P , = P + wS(b Au), Setting P = 0 in the rst matrix equation yields (K + wAT SA) u = f + wAT Sb. On taking W = wS, the general matrix equation (9.13) of the penalty method is recovered. This relation suggests the construction of iterative procedures in which one tries to improve the accuracy of the penalty function method while w is kept constant [70]. This strategy circumvents the aforementioned ill-conditioning problems when the weight w is gradually increased. One such method is easily constructed by inspecting (9.24). Using superscript k as an iteration index and keeping w xed, solve equations (9.24) in tandem as follows: (K + AT WA) uk = f + AT Wb AT k , (9.26) k +1 = k + W(b Auk ), for k = 0, 1, . . . , beginning with 0 = 0. Then u0 is the penalty solution. If the process converges one recovers the exact Lagrangian solution without having to solve the Lagrangian system (9.23) directly. The family of iterative procedures that may be precipitated from (9.24) collectively pertains to the class of augmented Lagrangian methods. (9.25) (9.24)
9.4. Summary The treatment of linear MFCs in nite element systems can be carried out by several methods. Three of these: master-slave elimination, penalty augmentation and Lagrange multiplier adjunction, have been discussed. It is emphasized that no method is uniformly satisfactory in terms of generality, robustness, numerical behavior and simplicity of implementation. Figure 9.4 gives an assessment of the three techniques in terms of seven attributes. 911
Generality Ease of implementation Sensitivity to user decisions Accuracy Sensitivity as regards constraint dependence Retains positive definiteness Modifies unknown vector
Master-Slave Elimination fair poor to fair high variable high yes yes
912
For a general purpose program that tries to attain black box behavior (that is, minimal decisions on the part of users) the method of Lagrange multipliers has the edge. This edge is unfortunately blunted by a fairly complex computer implementation and by the loss of positive deniteness in the bordered stiffness matrix.
Notes and Bibliography A form of the penalty function method, quite close to that described in 9.1.5, was rst proposed by Courant in the early 1940s [54]. It entered the FEM through the work of numerous people in the 1960s. There is a good description in the book by Zienkiewicz and Taylor [279]. The Lagrange Multiplier method is much older. Multipliers (called initially coefcients) were described canique Analytique monograph [153], as part of the procedure for forming the by Lagrange in his famous Me function now called the Lagrangian. Its use in FEM is more recent than penalty methods. Augmented Lagrangian methods have received much attention since the late 1960s, when they originated in the eld of constrained optimization [131,201]. The use of the Augmented Lagrangian Multiplier method for FEM kinematic constraints is rst discussed in [70], wherein the iterative algorithm (9.26) for the master stiffness equations is derived. References Referenced items have been moved to Appendix R.
912
913
Homework Exercises for Chapter 9 MultiFreedom Constraints II
Exercises
EXERCISE 9.1 [C+N:20] This is identical to Exercise 8.1, except that the MFC u 2 u 6 = 1/5 is to be treated by the penalty function method. Take the weight w to be 10k , in which k varies as k = 3, 4, 5, . . . 16. For each sample w compute the Euclidean-norm solution error e(w) = ||u p (w) uex ||2 , where u p is the computed solution and uex is the exact solution listed in (E8.1). Plot k = log10 w versus log10 e and report for which weight e attains a minimum. (See Slide #5 for a check). Does it roughly agree with the square root rule (9.1.3) if the computations carry 16 digits of precision?
As in Exercise 8.1, use Mathematica, Matlab (or similar) to do the algebra. For example, the following Mathematica script solves this Exercise: (* Exercise 9.1 - Penalty Method *) (* MFC: u2-u6=1/5 variable w *) K=MasterStiffnessOfSixElementBar[100]; Print["Stiffness K=",K//MatrixForm]; f={1,2,3,4,5,6,7}; Print["Applied forces=",f]; uexact= {0,0.27,0.275,0.25,0.185,0.07,0.14}; ew={}; For [w=100, w<=10^16, w=10*w; (* increase w by 10 every pass *) Khat=K; fhat=f; Khat[[2,2]]+=w; Khat[[6,6]]+=w; Khat[[6,2]]=Khat[[2,6]]-=w; fhat[[2]]+=(1/5)*w; fhat[[6]]-=(1/5)*w; (*insert penalty *) {Kmod,fmod}=FixLeftEndOfSixElementBar[Khat,fhat]; u=LinearSolve[N[Kmod],N[fmod]]; Print["Weight w=",N[w]//ScientificForm," u=",u//InputForm]; e=Sqrt[(u-uexact).(u-uexact)]; (*Print["L2 solution error=",e//ScientificForm]; *) AppendTo[ew,{Log[10,w],Log[10,e]}]; ]; ListPlot[ew,AxesOrigin->{5,-8},Frame->True, PlotStyle-> {AbsolutePointSize[4],AbsoluteThickness[2],RGBColor[1,0,0]}, PlotJoined->True,AxesLabel->{"Log10(w)","Log10(u error)"}]; Here MasterStiffnessOfSixElementBar and FixLeftEndOfSixElementBar are the same modules listed in Exercise 8.1. Note: If you run the above program, you may get several beeps from Mathematica as it is processing some of the systems with very large weights. Dont be alarmed: those are only warnings. The LinearSolve function for weights of order 1012 or bigger are ill-conditioned. is alerting you that the coefcient matrices K
EXERCISE 9.2 [C+N:15] Again identical to Exercise 8.1, except that the MFC u 2 u 6 = 1/5 is to be treated by the Lagrange multiplier method. The results for the computed u and the recovered force vector Ku should agree with (E8.1). Use Mathematica, Matlab (or similar) to do the algebra. For example, the following Mathematica script solves this Exercise:
(* Exercise 9.2 - Lagrange Multiplier Method *) (* MFC: u2-u6=1/5 *) K=MasterStiffnessOfSixElementBar[100]; Khat=Table[0,{8},{8}]; f={1,2,3,4,5,6,7}; fhat=AppendTo[f,0]; For [i=1,i<=7,i++, For[j=1,j<=7,j++, Khat[[i,j]]=K[[i,j]] ]]; {Kmod,fmod}=FixLeftEndOfSixElementBar[Khat,fhat];
913
914
Kmod[[2,8]]=Kmod[[8,2]]= 1; Kmod[[6,8]]=Kmod[[8,6]]=-1; fmod[[8]]=1/5; Print["Kmod=",Kmod//MatrixForm]; Print["fmod=",fmod]; umod=LinearSolve[N[Kmod],N[fmod]]; u=Take[umod,7]; Print["Solution u=",u ,", lambda=",umod[[8]]]; Print["Recovered node forces=",K.u]; Here MasterStiffnessOfSixElementBar and FixLeftEndOfSixElementBar are the same modules listed in Exercise 8.1. Does the computed solution agree with (E8.1)?
EXERCISE 9.3 [A:10] For the example structure, show which penalty elements would implement the fol-
As answer, show the stiffness equations of those two elements in a manner similar to (9.1).
EXERCISE 9.4 [A/C+N:15+15+10] Suppose that the assembled stiffness equations for a one-dimensional nite element model before imposing constraints are
2 1 0
1 2 1
0 1 2
u1 u2 u3
1 0 2
(E9.2)
This system is to be solved subject to the multipoint constraint u1 = u3. (a) (b) (E9.3)
Impose the constraint (E9.3) by the master-slave method taking u 1 as master, and solve the resulting 2 2 system of equations by hand. Impose the constraint (E9.3) by the penalty function method, leaving the weight w as a free parameter. Solve the equations by hand or CAS (Cramers rule is recommended) and verify analytically that as w the solution approaches that found in (a). Tabulate the values of u 1 , u 2 , u 3 for w = 0, 1, 10, 100. Hint 1: the value of u 2 should not change. Hint 2: the solution for u 1 should be (6w + 5)/(4w + 4). Impose the constraint (E9.3) by the Lagrange multiplier method. Show the 4 4 multiplier-augmented system of equations analogous to (9.13) and solve it by computer or calculator.
(c)
ure E9.1 rests on a skew-roller that forms a 45 angle with the horizontal axis x . The member is loaded axially by a force P as shown. The nite element equations upon removing the xed right end freedoms {u x 2 , u x 2 , 2 }, but before imposing the skew-roller MFC, are E A/ L 0 0 0 12 E I / L 3 6E I /L 2 0 6E I /L 2 4E I /L ux1 u y1 1 = P 0 0 , (E9.4)
EXERCISE 9.5 [A/C:10+15+10] The left end of the cantilevered beam-column member illustrated in Fig-
where E , A, and I = Izz are given member properties, 1 is the left end rotation, and L is the member length.7
7
The stiffness equations for a beam column are derived in Part III of this book. For now consider (E9.4) as a recipe.
914
915
Exercises
To simplify the calculations set P = E A, and I = AL 2 , in which and are dimensionless parameters, and express the following solutions in terms of and . (a) Apply the skew-roller constraint by the master-slave method (make u y 1 slave) and solve for u x 1 and 1 in terms of L , and . This may be done by hand or a CAS. Partial solution: u x 1 = L /(1 + 3). Apply the skew-roller constraint with the penalty method by inserting a penalty element at node 1. Follow the rule of 9.1.4 to construct the 2 2 penalty stiffness. Compute u x 1 from the modied equations (Cramers rule is recommended if solved by hand). Verify that as w the answer obtained in (a) is recovered. Partial solution: u x 1 = L (3 E A + w L )/(3 E A + w L (1 + 3)). Can the penalty stiffness be physically interpreted in some way?
(b)
; ;;;
1
beam-column member x P
E, A, I
45
; ; ;
2
(c)
Apply the skew roller constraint by Lagrangian multiplier adjunction, and solve the resulting 4 4 system of equations using a CAS (by hand it will take long). Verify that you get the same solution as in (a).
EXERCISE 9.6 [A:5+5+10+10+5] A cantiveler beam-column is to be joined to a plane stress plate mesh as
depicted in Figure E9.2.8 Both pieces move in the plane {x , y }. Plane stress elements have two degrees of freedom per node: two translations u x and u y along x and y , respectively, whereas a beam-column element has three: two translations u x and u y along x and y , and one rotation (positive CCW) z about z . To connect the cantilever beam to the mesh, the following gluing conditions are applied: (1) The horizontal (u x ) and vertical (u y ) displacements of the beam at their common node (2 of beam, 4 of plate) are the same. The beam end rotation 2 and the mean rotation of the plate edge 35 are the same. For innitesimal displacements and rotaa vg tions the latter is 35 = (u x 5 u x 3 )/ H . Write down the three MFC conditions: two from (1) and one from (2), and state whether they are linear and homogeneous.
a vg
H/2
4 7 10
H H/2
(2)
y x
Questions: (a)
Figure E9.2. Beam linked to plate in plane stress for Exercise 9.6. Beam shown slightly separate from plate for visualization convenience: nodes 2 and 4 actually are at the same location.
(b) (c)
Where does the above expression of 35 come from? (Geometric interpretation is OK.) Can it be made more accurate9 by including u x 4 ? Write down the master-slave transformation matrix if {u x 2 , u y 2 , 2 } are picked as slaves. It is sufcient to write down the transformation for the DOFs of nodes 2, 3, 4, and 5, which gives a T of order 9 6, since the transformations for the other freedoms are trivial. If the penalty method is used, write down the stiffness equations of the three penalty elements assuming the same weight w is used. Their stiffness matrices are of order 2 2, 2 2 and 3 3, respectively. (Do not proceed further)
(d)
This is extracted from a question previously given in the Aerospace Ph. D. Preliminary Exam. Technically it is not difcult once the student understand what is being asked. This can take some time, but a HW is more relaxed. To answer the second question, observe that the displacements along 34 and 45 vary linearly. Thus the angle of rotation about z is constant for each of them, and (for innitesimal displacements) may be set equal to the tangent.
915
916
(e)
If Lagrange multiplier adjunction is used, how many Lagrange multipliers will you need to append? (Do not proceed further).
can be written down as a EXERCISE 9.7 [A:30] Show that the master-slave transformation method u = Tu special form of the method of Lagrange multipliers. Start from the augmented functional
MS
) = 1 uT Ku uT f + T (u Tu 2
MS
(E9.5)
EXERCISE 9.8 [A:35] Check the matrix equations (9.23) through (9.26) quoted for the Augmented Lagrangian method. EXERCISE 9.9 [A:40] (Advanced, close to a research paper). Show that the master-slave transformation
can be expressed as a limit of the penalty function method as the weights go to innity. Start method u = Tu from the augmented functional
P
)T (u Tu ) = 1 uT Ku uT f + 1 w(u Tu 2 2
(E9.6)
and take the limit w . Hint: Write down the matrix stationarity conditions with respect to to u and u using Woodburys formula (Appendix C, C.5.2) (K + w TT ST)1 = K1 K1 TT (K + w1 S1 )1 T K1 . show that K
1
(E9.7) (E9.8)
= TK1 TT .
916
Introduction to FEM
MultiFreedom Constraints II
IFEM Ch 9 Slide 1
Introduction to FEM
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
u2 = u6
IFEM Ch 9 Slide 2
Introduction to FEM
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
x
7
4
(7)
1 1 1 1
u2 u6
0 0
IFEM Ch 9 Slide 3
Introduction to FEM
f1 f2 f3 f4 f5 f6 f7
IFEM Ch 9 Slide 4
Introduction to FEM
best w
6 8 10 12 14
IFEM Ch 9 Slide 5
Introduction to FEM
=1
9 3 12 3 1 4 12 4 16
u3 u5 u6
3 1 4
IFEM Ch 9 Slide 6
Introduction to FEM
IFEM Ch 9 Slide 7
Introduction to FEM
u 2 , f2
(2)
u 3 , f3
(3)
u4 , f4
(4)
u5 , f5
(5)
u6 , f 6
(6)
u7 , f7
K 11 K 12 0 0 0 0 0
K 12 K 22 K 23 0 0 0 0
IFEM Ch 9 Slide 8
Introduction to FEM
K 11 K 12 0 0 0 0 0
K 12 K 22 K 23 0 0 0 0
0 K 23 K 33 K 34 0 0 0
0 0 K 34 K 44 K 45 0 0
0 0 0 K 45 K 55 K 56 0
0 0 0 0 K 56 K 66 K 67
0 0 0 0 0 K 67 K 77
u1 0 u2 1 u3 0 u4 0 u5 = 0 u6 1 u7 0
f1 f2 f3 f4 f5 f6 f7
This is now a system of 7 equations and 8 unknowns. Need an extra equation: the MFC.
IFEM Ch 9 Slide 9
Introduction to FEM
K 11 K 12 0 0 0 0 0 0
K 12 K 22 K 23 0 0 0 0 1
0 K 23 K 33 K 34 0 0 0 0
0 0 K 34 K 44 K 45 0 0 0
0 0 0 K 45 K 55 K 56 0 0
0 0 0 0 K 56 K 66 K 67 1
0 0 0 0 0 K 67 K 77 0
f1 f2 f3 f4 f5 f6 f7 0
This is the multiplier-augmented system. The new coefficient matrix is called the bordered stiffness.
IFEM Ch 9 Slide 10
Introduction to FEM
K 12 0 0 0 0 0 0
0 0
K 12 K 22 K 23 0 0 0 0 1 5 0
0 K 23 K 33 K 34 0 0 0 0 0 3
0 0 K 34 K 44 K 45 0 0 0 0 0
0 0 0 K 45 K 55 K 56 0 0 0 1
0 0 0 0 K 56 K 66 K 67 1 0 4
0 0 u1 0 u2 0 u3 0 u4 = K 67 u5 K 77 u6 0 u7 8 0
f1 f2 f3 f4 f5 f6 f7 0 3 1
IFEM Ch 9 Slide 11
Introduction to FEM
IFEM Ch 9 Slide 12
Introduction to FEM
DISADVANTAGES difficult implementation additional unknowns loses positive definiteness sensitive to constraint dependence
IFEM Ch 9 Slide 13
Introduction to FEM
IFEM Ch 9 Slide 14
917
Solutions to Exercises
EXERCISE 9.1 The result of running the Mathematica script on version 4.2 on a Mac G4 are shown in Figure
E9.3. Some intermediate printout produced in the weight loop has been deleted to save space. The log-log plot has been massaged through Adobe Illustrator to boost line widths.
Weight w = 1. x 10 3 L2 solution error = 4.05286 x 10 2 Weight w = 1. x 10 4 3 L2 solution error = 4.14382 x 10 5 Weight w = 1. x 10 L2 solution error = 4.15314 x 10 4 Weight w = 1. x 106 L2 solution error = 4.15407 x 10 5
-4
-8 4 6 8 10 12
Log 10 (w)
14 16
The minimum solution error is obtained for w 1010 , which gives roughly 8 digits of accuracy. The square root rule suggests taking w 102 1016/2 = 1010 so for this simple problem it works well. Note: The plot minimum and ascending branch shape may depend on the oating-point hardware used. On PCs in which Mathematica takes advantage of the 80-bit oating-point registers of the Pentium, the maximum accuracy is signicantly better (about 14 places) and the optimal weight moves up to w 1016 .
EXERCISE 9.2 The results of running the given Mathematica script for the Lagrangian Multiplier method are shown in Figure E9.4.
1 0 0 200 0 100 0 0 Kmod = 0 0 0 0 0 0 0 1 0 100 200 100 0 0 0 0 0 0 100 200 100 0 0 0 1 0 0 0 100 200 100 0 0 0 0 0 0 100 200 100 1 0 0 0 0 0 100 100 0 0 1 0 0 0 1 0 0
fmod = { 0, 2, 3, 4, 5, 6, 7, } 5 Solution u = { 0., 0.27, 0.275, 0.25, 0.185, 0.07, 0.14 }, lambda = 24.5 Recovered node forces = { 27., 26.5, 3., 4., 5., 18.5, 7.}
Figure E9.4. Results from Exercise 10.2.
917
918
EXERCISE 9.3 The penalty elements for the stated MFCs are obtained with the rules explained in 9.1.4:
w w
EXERCISE 9.4
1 1
1 1 3 9
u2 u6 u2 u6
= =
1 3
0 0 1 3
(E9.9) (E9.10)
1 3
(a)
(E9.12)
(b)
Solving this system by Cramers rule yields u1 = u 2 = 1.5 for any w, u3 = 6w + 7 . 4w + 4 (E9.14)
As w the solution tends to u 1 = u 2 = u 3 = 1.5, which is the same found in (a). For sample nite values of w we get w=0 u 1 = 1.250, u 2 = 1.500, u 3 = 1.750 w=1 u 1 = 1.375, u 2 = 1.500, u 3 = 1.625 w = 10 u 1 = 1.477, u 2 = 1.500, u 3 = 1.523 (E9.15) w = 100 u 1 = 1.498, u 2 = 1.500, u 3 = 1.502 (c) Lagrange-multiplier augmented system:
2 1 2 1 0 1 1 0
0 1 2 1
1 u1 1 0 u2 0 = . 1 u 3 2 0 0
(E9.16)
E A/ L 0 0
0 12 E I / L 3 6E I /L 2
0 6E I /L 2 4E I /L
ux1 u y1 1
P 0 0
(E9.17)
918
919
(a)
Solutions to Exercises
Master-slave method. The MFC is u x 1 = u y 1 . Transformation equation with u x 1 as master: ux1 u y1 1 = 1 1 0 0 0 1 ux1 , 1 . u = Tu (E9.19)
or
Applying the congruent transformation to (E9.18) yields EA L Solving: ux1 = L , 1 + 3 1 = 3 , 2(1 + 3) (E9.21) 1 + 12 6 L 6 L 4 L 2 ux1 1 = E A . 0 (E9.20)
from which the physical solution in terms of P , E , A , I , L is easily recovered. (b) Penalty function method. The penalty element stiffness equation is wE A 1 1 1 1 ux1 u y1 = 0 . 0 (E9.22)
As w the displacement u x 1 approaches that in (E9.21). Likewise for u y 1 (which approaches u x 1 in the limit) and 1 . Physical interpretation: the penalty element may be viewed as a ctious truss element of rigidity w E A attached to node 1 and oriented 135 with restect to x . In fact this is a way to implement skew rollers in FEM programs that lack other means of implementing MFC, as long as a truss element is available in the element library. Note: if the penalty weight w is not divided by E A as in (E9.22), E A appears in the solution as reported in an email last week. That solution is also considered correct. (c) The Lagrange Multiplier method gives
EA
L 0 0 1
0 A 12 E L 6 E A 1
0 6 E A 4 E AL 0
ux1 E A 1 u y 1 = 0 , 1 0 0 0 0 1
(E9.25)
919
920
(a)
3
avg 35
plate edge
(b)
3
ux3
H
4
+ z
y x ux5
5
H/2 H/2
45
Figure E9.5. Geometric interpretation of plate edge rotations for Exercise 10.6.
EXERCISE 9.6
(a)
u y2 = u y4 ,
2 = 35 = (u x 5 u x 3 )/2.
a vg
(E9.26)
These three MFCs are linear and homogeneous. (b) The rotation 35 of the plate edge 35 about z is dened in terms of the displacements of the nodes 35. From geometry, see Figure E9.5(a): 35 tan 35
a vg a vg
ux5 ux3 H
(E9.27)
where the replacements are justied by the small-displacements and small-angles assumptions of this course. Trying to rene this estimate by accounting for the displacement of node 4, we have two angles identied in Figure E9.5(b): 34 tan 34 (u x 4 u x 3 )/( H /2) = 2(u x 4 u x 3 )/ H and 45 tan 45 (u x 5 u x 4 )/( H /2) = 2(u x 5 u x 4 )/ H . Assuming that the rotation at node 4 is the average of these (which is reasonable since the lengths 34 and 45 are the same) we get 4
a vg
= 1 ( + 45 ) = 2 34
1 2
2(u x 4 u x 3 ) 2(u x 5 u x 4 ) + H H
ux5 ux3 . H
(E9.28)
It is seen that u x 4 cancels out and we get back (E9.27). Conclusion: the inclusion of node 4 makes no difference in this particular conguration. Note. Another way to rene the rotation estimate would be to try a least-square linear t through u x 3 , u x 4 and u x 5 . If correctly explained and worked out, this alternative method is also acceptable as answer for the second part of the question. (c) With u x 2 , u y 2 and 2 as slave freedoms the master-slave transformation is
ux2
0 u y 2 0 2 1/ H ux3 1 u y3 = 0 u 0 x4 u y4 0 ux5 0 u y5 0
0 0 0 0 1 0 0 0 0
1 0 0 0 0 1 0 0 0
0 1 0 0 0 0 1 0 0
0 0 1/ H 0 0 0 0 1 0
(E9.29)
920
921
(d) The penalty elements for the MFCs (E9.26) are 1 1 ux2 0 = , ux4 1 1 0 1 1 u y2 0 = , For u y 2 = u y 4 : w u y4 1 1 0 1 1/ H 1/ H 2 For 2 = (u x 5 u x 3 )/ H : w 1/ H 1/ H 2 1/ H 2 1/ H 1/ H 1/ H 2 For u x 2 = u x 4 : w
Solutions to Exercises
Scaled versions of the latter (for example, using H 2 + u x 3 u x 5 = 0 as MFC) are also OK as answers. (e) Three multipliers, one for each MFC.
MS
are f 0 0 (E9.31)
K I TT
I 0 0
T 0 0
u u
= Tu, which is the equation of the master-slave method. Eliminating u and , in that order, yields TT KTu
EXERCISE 9.8 Never assigned. EXERCISE 9.9 Solution given in paper [71].
921
10
101
102
TABLE OF CONTENTS
Page
10.1. Superelement Concept 10.1.1. Where Does the Idea Come From? . . . . 10.1.2. Subdomains . . . . . . . . . . . 10.1.3. *Mathematical Requirements . . . . . . 10.2. Static Condensation 10.2.1. Condensation by Explicit Matrix Operations 10.2.2. Condensation by Symmetric Gauss Elimination 10.2.3. Recovery of Internal Freedoms . . . . . 10.3. Global-Local Analysis 10. Notes and Bibliography . . . . . . . . . . . . . . . . 10. References. . . . . . . . . . . . . . . . 10. Exercises . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
103 103 105 105 105 105 106 108 108 1010 1010 1011
102
10.1
SUPERELEMENT CONCEPT
A superelement is a grouping of nite elements that, upon assembly, may be regarded as an individual element for computational purposes. These purposes may be driven by modeling or processing needs. A random assortment of elements does not necessarily make up a superelement. To be considered as such, a grouping must meet certain conditions. Informally we can say that it must form a structural component on its own. This imposes certain conditions stated mathematically in 10.1.3. Inasmuch as these conditions involve advanced concepts such as rank sufciency, which are introduced in later Chapters, the restrictions are not dwelled upon here. As noted in Chapter 6, superelements may originate from two overlapping contexts: bottom up or top down. In a bottom up context one thinks of superelements as built from simpler elements. In a top-down context, superelements may be thought as being large pieces of a complete structure. This dual viewpoint motivates the following classication: Macroelements. These are superelements assembled with a few primitive elements. Also called mesh units when they are presented to program users as individual elements. Substructures. Complex assemblies of elements that result on breaking up a structure into distinguishable portions. When does a substructure becomes a macroelement or vice-versa? There are no precise rules. In fact the generic term superelement was coined to cover the entire spectrum, ranging from individual elements to complete structures. This universality is helped by common processing features. Both macroelements and substructures are treated exactly the same way as regards matrix processing. The basic rule is that associated with condensation of internal degrees of freedom. The technique is illustrated in the following section with a simple example. The reader should note, however, that condensation applies to any superelement, whether composed of two or a million elements.1 10.1.1. Where Does the Idea Come From? Substructuring was invented by aerospace engineers in the early 1960s2 to carry out a rst-level breakdown of complex systems such as a complete airplane, as depicted in Figure 10.1. The decomposition may continue hierarchically through additional levels as illustrated in Figure 10.2. The concept is also natural for space vehicles operating in stages, such as the Apollo short stack depicted in Figure 10.3. Three original motivating factors for substructuring can be cited. 1. Facilitate division of labor. Substructures with different functions are done by separate design groups with specialized knowledge and experience. For instance an aircraft company may set up a fuselage group, a wing group, a landing-gear group, etc. These groups are thus protected from hurry up and wait constraints. More specically: a wing design group can keep on working on renements, improvements and experimental model verication as long as the interface information (the wing-fuselage intersection) stays sensibly unchanged.
Of course the computer implementation becomes totally different as one goes from macroelements to substructures, because efcient processing for large matrix systems requires exploitation of sparsity. See Notes and Bibliography at the end of this Chapter.
103
104
S4 S6
S2
S5
S1 S3
Figure 10.1. Complete airplane broken down into six level one substructures identied as S1 through S6 .
level two substructure
Figure 10.2. Further breakdown of wing structure. The decomposition process may continue down to the individual element level.
2.
Take advantage of repetition. Often structures are built of several identical or nearly identical units. For instance, the wing substructures S2 and S3 of Figure 10.1 are mirror images on reection about the fuselage midplane, and so are the stabilizers S4 and S5 . Even if the loading is not symmetric about that midplane, recognizing repetitions saves model preparation time. Overcome computer limitations. The computers of the 1960s operated under serious memory limitations. (For example, the rst supercomputer: the Control Data 6600, had a total high-speed memory of 131072 60-bit words or 1.31 MB; that machine cost $10M in 1966 dollars.) It was difcult to t a complex structure such as an airplane as one entity. Substructuring permitted the complete analysis to be carried out in stages through use of auxiliary storage devices such as tapes or disks.
COMMAND MODULE
SERVICE MODULE
3.
INSTRUMENT UNIT
Of the three motivations, the rst two still hold today. The third one has moved to a different plane: parallel processing, as noted in 10.1.2 below. In the late 1960s the idea was picked up and developed extensively by the offshore and shipbuilding 104
105
10.2
STATIC CONDENSATION
industries, the products of which tend to be modular and repetitive to reduce fabrication costs. As noted above, repetition favors the use of substructuring techniques. At the other end of the superelement spectrum, the mesh units herein called macroelements appeared in the mid 1960s. They were motivated by user convenience. For example, in hand preparation of models, quadrilateral and bricks involve less human labor than triangles and tetrahedra, respectively. It was therefore natural to combine the latter to assemble the former. Going a step further one can assemble components such as box elements for applications such as box-girder bridges. 10.1.2. Subdomains Applied mathematicians working on solution procedures for parallel computation have developed the concept of subdomains. These are groupings of nite elements that are entirely motivated by computational considerations. They are subdivisions of the nite element model done more or less automatically by a program called domain decomposer. Although the concepts of substructures and subdomains overlap in many respects, it is better to keep the two separate. The common underlying theme is divide and conquer but the motivation is different.
10.1.3. *Mathematical Requirements A superelement is said to be rank-sufcient if its only zero-energy modes are rigid-body modes. Equivalently, the superelement does not possess spurious kinematic mechanisms. Verication of the rank-sufcient condition guarantees that the static condensation procedure described below will work properly.
10.2. Static Condensation Degrees of freedom of a superelement are classied into two groups: Internal Freedoms. Those that are not connected to the freedoms of another superelement. Nodes whose freedoms are internal are called internal nodes. Boundary Freedoms. These are connected to at least another superelement. They usually reside at boundary nodes placed on the periphery of the superelement. See Figure 10.4. The objective is to get rid of all displacement degrees of freedom associated with internal freedoms. This elimination process is called static condensation, or simply condensation. Condensation may be presented in terms of explicit matrix operations, as shown in the next subsection. A more practical technique based on symmetric Gauss elimination is discussed later. 10.2.1. Condensation by Explicit Matrix Operations To carry out the condensation process, the assembled stiffness equations of the superelement are partitioned as follows: ub f Kbb Kbi = b . (10.1) Kib Kii ui fi where subvectors ub and ui collect boundary and interior degrees of freedom, respectively. Take the second matrix equation: (10.2) Kib ub + Kii ui = fi , 105
106
(a)
i b b b
(b)
i b b
Figure 10.4. Classication of superelement freedoms into boundary and internal. (a) shows the vertical stabilizer substructure S6 of Figure 10.2. (The FE mesh is pictured as two-dimensional for illustrative purposes; for an actual aircraft it will be three dimensional.) Boundary freedoms are those associated to the boundary nodes labeled b (shown in red), which are connected to the fuselage substructure. (b) shows a quadrilateral macroelement mesh-unit fabricated with 4 triangles: it has one interior and four boundary nodes.
(10.3)
Replacing into the rst matrix equation of (10.1) yields the condensed stiffness equations bb ub = fb . K In this equation, bb = Kbb Kbi K1 Kib , K ii
1 fb = fb Kbi Kii fi ,
(10.4)
(10.5)
are called the condensed stiffness matrix and force vector, respectively, of the substructure. From this point onward, the condensed superelement may be viewed, from the standpoint of further operations, as an individual element whose element stiffness matrix and nodal force vector are Kbb and fb , respectively. Often each superelement has its own local coordinate system. A transformation of (10.5) to an overall global coordinate system is necessary upon condensation. In the case of multiple levels, the transformation is done with respect to the next-level superelement coordinate system. This coordinate transformation procedure automates the processing of repeated portions.
Remark 10.1. The feasibility of the condensation process (10.3)(10.5) rests on the non-singularity of Kii . This matrix is nonsingular if the superelement is rank-sufcient in the sense stated in 10.1.3, and if xing the boundary freedoms precludes all rigid body motions. If the former condition is veried but not the latter, the superelement is called oating. Processing oating superelements demands more advanced computational techniques, among which one may cite the use of projectors and generalized inverses [90].
106
107
10.2
STATIC CONDENSATION
CondenseLastFreedom[K_,f_]:=Module[{pivot,c,Kc,fc, n=Length[K]}, If [n<=1,Return[{K,f}]]; Kc=Table[0,{n-1},{n-1}]; fc=Table[0,{n-1}]; pivot=K[[n,n]]; If [pivot==0, Print["CondenseLastFreedom:", " Singular Matrix"]; Return[{K,f}]]; For [i=1,i<=n-1,i++, c=K[[i,n]]/pivot; fc[[i]]=f[[i]]-c*f[[n]]; For [j=1,j<=i,j++, Kc[[j,i]]=Kc[[i,j]]=K[[i,j]]-c*K[[n,j]] ]; ]; Return[Simplify[{Kc,fc}]] ]; K={{6,-2,-1,-3},{ -2,5,-2,-1},{ -1,-2,7,-4},{-3,-1,-4,8}}; f={3,6,4,0}; Print["Before condensation:"," K=",K//MatrixForm," f=",f//MatrixForm]; {K,f}=CondenseLastFreedom[K,f];Print["Upon condensing DOF 4:", " K=",K//MatrixForm," f=",f//MatrixForm]; {K,f}=CondenseLastFreedom[K,f];Print["Upon condensing DOF 3:", " K=",K//MatrixForm," f=",f//MatrixForm];
Figure 10.5. Mathematica module to condense the last degree of freedom from a stiffness matrix and force vector. The test statements carry out the example (10.6)(10.10).
10.2.2. Condensation by Symmetric Gauss Elimination In the computer implementation of the the static condensation process, calculations are not carried out as outlined above. There are two major differences. The equations of the substructure are not actually rearranged, and the explicit calculation of the inverse of Kii is avoided. The procedure may be in fact coded as a variant of symmetric Gauss elimination. To convey the avor of this technique, consider the following stiffness equations of a superelement: 3 6 2 1 3 u1 5 2 1 u 2 6 2 (10.6) = . 4 u3 1 2 7 4 0 u4 3 1 4 8 Suppose that the last two displacement freedoms: u 3 and u 4 , are classied as interior and are to be statically condensed out. To eliminate u 4 , perform symmetric Gauss elimination of the fourth row and column: (3) (3) (3) 3 0(3) 2 (1) 1 (4) 6 (3) u1 8 8 8 8 (3)(1) (1)(1) (4)(1) 0(1) (10.7) 5 2 u2 = 6 8 , 2 8 8 8 (3)(4) (1)(4) (4)(4) 0 ( 4 ) u3 1 2 7 4
8 8 8 8
or
4 u3 5 Repeat the process for the third row and column to eliminate u 3 :
39 8 19 8
39 8 19 8 5 2
19 8
39 8 5 2
5 u1 3 2 5 u2 = 6 .
2
(10.8)
(5/2)(5/2) 5 (5/2)(5/2) 5
19 8
39 8
(5/2)(5/2) 5 (5/2)(5/2) 5
u1 u2
3 6
4(5/2) 5 4(5/2) 5
(10.9)
107
108
or
29 8 29 8
29 8
29 8
u1 u2
5 . 8
(10.10)
These are the condensed stiffness equations. Figure 10.5 shows a Mathematica program that carries out the foregoing steps. Module CondenseLastFreedom condenses the last freedom of a stiffness matrix K and a force vector f. It is invoked as { Kc,fc }=CondenseLastFreedom[K,f]. It returns the condensed stiffness Kc and force vector fc as new arrays. To do the example (10.6)(10.10), the module is called twice, as illustrated in the test statements of Figure 10.5. Obviously this procedure is much simpler than going through the explicit matrix inverse. Another important advantage of Gauss elimination is that equation rearrangement is not required even if the condensed degrees of freedom do not appear sequentially. For example, suppose that the assembled superelement contains originally eight degrees of freedom and that the freedoms to be condensed out are numbered 1, 4, 5, 6 and 8. Then Gauss elimination is carried out over those equations only, and the condensed (3 3) stiffness and (3 1) force vector extracted from rows and columns 2, 3 and 7. An implementation of this process is considered in Exercise 10.2.
Remark 10.2. The symmetric Gauss elimination procedure, as illustrated in steps (10.6)(10.10), is primarily
useful for macroelements and mesh units, since the number of stiffness equations for those typically does not exceed a few hundreds. This permits the use of full matrix storage. For substructures containing thousands or millions of degrees of freedom such as in the airplane example the elimination is carried out using more sophisticated sparse matrix algorithms; for example that described in [70].
Remark 10.3. The static condensation process is a matrix operation called partial inversion or partial elimi-
nation that appears in many disciplines. Here is the general form. Suppose the linear system Ax = y, where A is n n square and x and y are n -vectors, is partitioned as A11 A21 A12 A22 x1 x2 = y1 . y2 (10.11)
Assuming the appropriate inverses to exist, then the following are easily veried matrix identities:
1 1 A A 11 11 A12 1 1 A21 A 11 A22 A21 A11 A12
y1 x2
x1 , y2
x1 y2
y1 . x2
(10.12)
We say that x1 has been eliminated or condensed out in the left identity and x2 in the right one. In FEM applications, it is conventional to condense out the bottom vector x2 , so the right identity is relevant. If A is symmetric, to retain symmetry in (10.12) it is necessary to change the sign of one of the subvectors.
10.2.3. Recovery of Internal Freedoms (to be added) 10.3. Global-Local Analysis As discussed in the rst Chapter, complex engineering systems are often modeled in a multilevel fashion following the divide and conquer approach. The superelement technique is a practical realization of that approach. A related, but not identical, technique is multiscale analysis. The whole system is rst analyzed as a global entity, discarding or passing over details deemed not to affect its overall behavior. Local details 108
109
10.3
GLOBAL-LOCAL ANALYSIS
coarse mesh
Figure 10.6. Left: example panel structure for global-local analysis. Right: a FEM mesh for a one-shot analysis.
finer meshes
are then analyzed using the results of the global analysis as boundary conditions. The process can be continued into the analysis of further details of local models. And so on. When this procedure is restricted to two stages and applied in the context of nite element analysis, it is called global-local analysis in the FEM literature. In the global stage the behavior of the entire structure is simulated with a nite element model that necessarily ignores details such as cutouts or joints. These details do not affect the overall behavior of the structure, but may have a bearing on safety. Such details are a posteriori incorporated in a series of local analyses. The gist of the global-local approach is explained in the example illustrated in Figures 10.6 and 10.7. Although the structure is admittedly too simple to merit the application of global-local analysis, it serves to illustrate the basic ideas. Suppose one is faced with the analysis of the rectangular panel shown on the top of Figure 10.6, which contains three small holes. The bottom of that gure shows a standard (one-stage) FEM treatment using a largely regular mesh that is rened near the holes. Connecting the coarse and ne meshes usually involves using multifreedom constraints because the nodes at mesh boundaries do not match, as depicted in that gure. Figure 10.7 illustrates the global-local analysis procedure. The global analysis is done with a coarse but regular FEM mesh which ignores the effect of the holes. This is followed by local analysis of the region near the holes using rened nite element meshes. The key ingredient for the local analyses is the application of boundary conditions (BCs) on the ner mesh boundaries. These BCs may be of displacement (essential) or of force (natural) type. If the former, the applied boundary displacements are interpolated from the global mesh solution. If the latter, the internal forces or stresses obtained from the global calculation are converted to nodal forces on the ne meshes through a lumping process. The BC choice noted above gives rise to two basic variations of the global-local approach. Experience accumulated over several decades3 has shown that the stress-BC approach generally gives more reliable answers. The global-local technique can be extended to more than two levels, in which case it receives the more encompassing name multiscale analysis. Although this generalization is still largely in the realm of
3
Particularly in the aerospace industry, in which the global-local technique has been used since the early 1960s.
109
1010
Global analysis with a coarse mesh, ignoring holes, followed bylocal analysis of the vicinity of the holes with finer meshes:
research, it is receiving increasing attention from various science and engineering communities for complex products such as the thermomechanical analysis of microelectronic components.
Notes and Bibliography Substructuring was invented by aerospace engineers in the early 1960s. Przemienieckis book [205] contains a fairly complete bibliography of early work. Most of this was in the form of largely inaccessible internal company or lab reports and so the actual history is difcult to trace. Macroelements appeared simultaneously in many of the early FEM codes. Quadrilateral macroelements fabricated with triangles are described in [68]. For a survey of uses of the static condensation algorithm in FEM, see [270]. The generic term superelement was coined in the late 1960s by the SESAM group at DNV Veritas [65]. The matrix form of static condensation for a complete structure is presented in [8, p. 46], as a scheme to eliminate unloaded DOF in the displacement method. It is unclear when this idea was rst applied to substructures or macroelements. The rst application for reduced dynamical models is by Guyan [121]. The application of domain decomposition to parallel FEM solvers has produced an enormous and highly specialized literature. Procedures for handling oating superelements using generalized inverse methods are discussed in [90]. The global-local analysis procedure described here is also primarily used in industry and as such it is rarely mentioned in academic textbooks. References Referenced items have been moved to Appendix R.
1010
1011
Homework Exercises for Chapter 10 Superelements and Global-Local Analysis
EXERCISE 10.1 [N:15] The free-free stiffness equations of a superelement are
Exercises
(E10.1)
Eliminate u 2 and u 3 from (E10.1) by static condensation, and show (but do not solve) the condensed equation system. Use either the explicit matrix inverse formulas (10.5) or the symmetric Gauss elimination process explained in 10.2.2. Hint: regardless of method the result should be 52 36 36 184 u1 u4 = 15 . 30 (E10.2)
EXERCISE 10.2 [C+N:20] Generalize the program of Figure 10.5 to a module CondenseFreedom[K,f,k] that is able to condense the kth degree of freedom from K and f, which is not necessarily the last one. That is, k may range from 1 to n, where n is the number of freedoms in Ku = f. Apply that program to solve the previous Exercise.
Hint: here is a possible way of organizing the inner loop: ii=0; For [i=1,i<=n,i++, If [i==k, Continue[]]; ii++; c=K[[i,k]]/pivot; fc[[ii]]=f[[i]]-c*f[[k]]; jj=0; For [j=1,j<=n,j++, If [j==k,Continue[]]; jj++; Kc[[ii,jj]]=K[[i,j]]-c*K[[k,j]] ]; ]; Return[{Kc,fc}]
EXERCISE 10.3 [D:15] Explain the similarities and differences between superelement analysis and global-local
FEM analysis.
EXERCISE 10.4 [A:20] If the superelement stiffness K is symmetric, the static condensation process can be viewed as a special case of the master-slave transformation method discussed in Chapter 8. To prove this, take exterior freedoms ub as masters and interior freedoms ui as slaves. Assume the master-slave transformation relation def ub I 0 u= = = Tub g. (E10.3) [ ub ] 1 1 ui Kii Kib Kii fi u = TT KT and = f = TT (f Kg), and show that K f coalesces with the condensed stiffness Work out K T 1 T 1 . (Take advantage of the symmetry properties Kbi equations (10.4)(10.5) if ub u = Kib , (Kii ) = Kii .) EXERCISE 10.5 [D:30] (Requires thinking) Explain the conceptual and operational differences between onestage FEM analysis and global-local analysis of a problem such as that illustrated in Figures 10.6 and 10.7. Are the answers the same? What is gained, if any, by the global-local approach over the one-stage FEM analysis? EXERCISE 10.6 [N:20] The widely used Guyans scheme [121] for dynamic model reduction applies the staticcondensation relation (E10.3) as master-slave transformation to both the stiffness and the mass matrix of the superelement. Use this procedure to eliminate the second and third DOF of the mass-stiffness system:
2 1 M= 0 0
1 4 1 0
0 1 4 1
0 0 , 1 2
1 1 0 0 2 1 0 1 K= . 0 1 2 1 0 0 1 1
(E10.4)
1011
1012
+ )v i = 0 i2 K Compute and compare the vibration frequencies of the eigensystems (M + i2 K)vi = 0 and (M before and after reduction. Hints. The four original squared frequencies are the eigenvalues of M1 K, which may be obtained, for example, with the Matlab eig function. The largest is 2, lowest 0. To perform the Guyan reduction is is convenient to reorder M and K so that rows and columns 2 and 3 become 3 and 4, respectively: 2 2 0 1 0
0 2 0 1
1 0 4 1
0 v1 1 1 v4 0 = 1 v2 1 v3 4 0
0 1 0 v1 1 0 1 v4 , 0 2 1 v2 v3 1 1 2
(E10.5)
which in partitioned matrix form is 2 Mbb Mib Mbi Mii vb vi = Kbb Kib Kbi Kii vb . vi (E10.6)
Next show that static condensation of K is equivalent to a master-slave transformation I 1 Kib Kii 1 0 = 2/3 1/3
T=
0 1 1/3 2/3
relating
v1 1 v4 0 v = 2/3 2 v3 1/3
0 1 v1 . 1/3 v4 2/3
(E10.7)
= TT KT, nd the two squared frequencies of the condensed = TT MT and K The rest is easy. Form M eigensystem and verify that they approximate the two lowest original squared frequencies.
EXERCISE 10.7 [A:20] Two beam elements: 12 and 23, each of length L and rigidity E I are connected at node 2. The macroelement has 6 degrees of freedom: {v1 , 1 , v2 , 2 , v3 , 3 }. Eliminate the two DOF of node 2 by condensation. Is the condensed stiffness the same as that of a beam element of length 2 L and rigidity E I ?
1012
Introduction to FEM
10
IFEM Ch 10 Slide 1
Introduction to FEM
Superelements
Two extremes
Macroelements Substructures
IFEM Ch 10 Slide 2
Introduction to FEM
S2
S4
S6
S5
S1 S3
IFEM Ch 10 Slide 3
Introduction to FEM
Substructures (cont'd)
level two substructure (wing section)
IFEM Ch 10 Slide 4
Introduction to FEM
WING BODY INTERSECTION ANALYSIS 4 substructures,12549 elements 4266 nodes, 25596 freedoms
CARGO DOOR CABIN ANALYSIS 747 Regions Analyzed with FEM-DSM at Boeing
IFEM Ch 10 Slide 5
Introduction to FEM
IFEM Ch 10 Slide 6
Introduction to FEM
Multilevel FEM Substructuring was Invented in the Norwegian Offshore Industry in the mid/late 60s
IFEM Ch 10 Slide 7
Introduction to FEM
From DNV (Det Norske Veritas) web-posted brochure. Permission requested for inclusion in book proper.
IFEM Ch 10 Slide 8
Introduction to FEM
SERVICE MODULE
INSTRUMENT UNIT
IFEM Ch 10 Slide 9
Introduction to FEM
Static Condensation
A universal way to eliminate internal DOFs
i i b b b b b
Substructure
Macroelement
IFEM Ch 10 Slide 10
Introduction to FEM
Kbb Kib
Kbi Kii
ub ui
fb fi
Kbb ub = fb
where
IFEM Ch 10 Slide 11
Introduction to FEM
2
1
2 5 2
( 1) ( 3) 8 ( 1) ( 1) 8 ( 1) ( 4) 8
1 2 7
( 4) ( 3) 8 ( 4) ( 1) 8 ( 4) ( 4) 8
3 u1 u2 = 6 u3 4
0( 3) 8 0( 1) 8 0( 4) 8
39 8 19 8 5 2
19 8 39 8 5 2
u 3 5 1 2 u2 = 6 5 2
5 u3 4
Condensed equations
IFEM Ch 10 Slide 12
Introduction to FEM
39 8 19 8 5 2
19 8 39 8 5 2
u 3 5 1 2 u2 = 6 5 2 5 u3 4
Now eliminate u3
39 8 19 8
19 8 39 8
u1 u2
3 6
4( 5/2 ) 5 4( 5/2 ) 5
29 8 29 8
29 8 29 8
u1 u2
5 8
Condensed equations
IFEM Ch 10 Slide 13
Introduction to FEM
IFEM Ch 10 Slide 14
Introduction to FEM
Before condensation: K
1 2 7 4
19 8 39 8 5 2 29 8 29 8
3 1 4 8
5 2 5 2
3 6 4 0 3 6 4
5 5 8
IFEM Ch 10 Slide 15
Introduction to FEM
IFEM Ch 10 Slide 16
Introduction to FEM
coarse mesh
finer meshes
IFEM Ch 10 Slide 17
Introduction to FEM
Global analysis with a coarse mesh, ignoring holes, followed by local analysis of the vicinity of the holes with finer meshes (next slide)
IFEM Ch 10 Slide 18
Introduction to FEM
Local Analysis
BCs of displacement or (better) of force type using results extracted from the global analysis
IFEM Ch 10 Slide 19
1013
Solutions to Exercises
EXERCISE 10.1 To apply the matrix form of static condensation, prepare the partitions
Kii = Then
132 44 44 44 88 0 10 5 , Kbi = , Kbb = , fi = , fb = . 44 176 44 44 0 220 15 20 bb = Kbb Kbi K1 Kib = K ii 52 36 , 36 184 15 1 fb = fb Kbi Kii fi = . 30
(E10.8)
(E10.9)
Performing symmetric Gauss elimination on u 2 and u 3 gives the same answer. This was actually done with Mathematica by testing the module of the next Exercise.
EXERCISE 10.2
Module CondenseFreedom listed in Figure E10.1 statically condenses an arbitrary DOF. The test statements given in Figure E10.2 process the system of Exercise 10.1. The results reproduce (E10.9).
CondenseFreedom[K_,f_,k_]:=Module[{c,pivot,Kc,fc, ii,jj,n=Length[K]}, If [n<=0,Return[{K,f}]]; If [k<=0 || k>n, Return[{K,f}]]; Kc=Table[0,{n-1},{n-1}]; fc=Table[0,{n-1}]; pivot=K[[k,k]]; If [pivot==0,Print["CondenseFreedom:", "Singular Matrix"]; Return[{K,f}]]; ii=0; For [i=1,i<=n,i++, If [i==k, Continue[]]; ii++; c=K[[i,k]]/pivot; fc[[ii]]=f[[i]]-c*f[[k]]; jj=0; For [j=1,j<=n,j++, If [j==k,Continue[]]; jj++; Kc[[ii,jj]]=K[[i,j]]-c*K[[k,j]] ]; ]; Return[{Kc,fc}] ];
1013
1014
EXERCISE 10.3 Similarity: both are staged processes. Difference: in superelements staging is controlled by
the way a single model is decomposed, whereas in global-local analysis staging is dictated by the use of two models.
EXERCISE 10.4 Here are the necessary matrix manipulations:
I = TT KT = [ I Kbi K1 ] Kbb Kbi K 1 ii Kib Kii Kib Kii 1 Kbb Kbi Kii Kib 1 1 bb . = [ I Kbi Kii = Kbb Kbi Kii Kib = K ] 0 f = TT (f Kg) = [ I = [I
1 Kbi Kii ] 1 Kbi Kii ] 1 fb Kbi Kii fi 0
(E10.10)
fb Kbb fi Kib
Kbi Kii
0 1 fi Kii
1 = fb Kbi Kii fi = fb .
(E10.11)
EXERCISE 10.5 The answers are not the same unless the process is iterated.
(To be expanded).
1 4 1 0
0 1 4 1
0 v1 1 1 0 0 v1 0 v2 1 2 1 0 v2 = , 1 v3 0 1 2 1 v3 v4 v4 2 0 0 1 1
(E10.12)
2 = 0, 1
2 2 = 1/5 = 0.2,
2 3 = 1,
2 4 = 2.
(E10.13)
To perform the Guyan reduction with matrix operations it is convenient to rearrange the system so that the DOF to be eliminated: v2 and v3 , appear at the bottom of the eigenvector: 2 0 2 1 0
0 2 0 0
1 0 4 1
0 v1 1 1 v4 0 = 1 v2 1 v3 4 0
0 1 0 v1 1 0 1 v4 , 0 2 1 v2 v3 1 1 2
(E10.14)
which in partitioned matrix form is 2 Mbb Mib Mbi Mii vb vi = Kbb Kib Kbi Kii vb . vi (E10.15)
The transformation matrix given in the Exercise statement is I 1 Kii Kib 1 0 = 2/3 1/3
T=
0 1 1/3 2/3
relating
v1 1 v4 0 v = 2/3 2 v3 1/3
0 1 v1 . 1/3 v4 2/3
(E10.16)
1014
1015
Solutions to Exercises
To show that this transformation, applied as a master-slave congruential transformation, is equivalent to stiffness matrix condensation, observe that = Kbb Kbi K1 Kib = K ii 1 3
1 3
1 3
1 3
while
TT KT =
1 3
1 3
1 3
1 3
. =K
(E10.17)
(The general proof is given as the solution of Exercise 10.4, but the numerical verication of (E10.17) is sufcient = TT M T v v = TT K T, M =K in which K for this Exercise.) The reduced vibration eigenproblem is 2 M T = [ v1 v4 ] . Carrying out the congruential transformations we obtain the reduced eigensystem and v 2 6 3 3 6 v1 v4 = 1 3
1 3
1 3
1 3
v1 . v4
(E10.18)
(E10.19)
The zero frequency (which is associated to a rigid body mode) is reproduced exactly. The rst nonzero frequency 2 is found within an error of about 5%. The third and fourth frequencies are lost in the reduction process.
EXERCISE 10.7 Not assigned.
1015
11
111
112
TABLE OF CONTENTS
Page
11.1. A New Beginning 11.2. Denition of Bar Member 11.3. Variational Formulation 11.3.1. The Total Potential Energy Functional . 11.3.2. Variation of an Admissible Function . 11.3.3. The Minimum Potential Energy Principle 11.3.4. TPE Discretization . . . . . . . 11.3.5. Bar Element Discretization . . . . . 11.3.6. Shape Functions . . . . . . . . 11.3.7. The Strain-Displacement Equation . . 11.3.8. *Trial Basis Functions . . . . . . 11.4. The Finite Element Equations 11.4.1. The Stiffness Matrix . . . . . . . 11.4.2. The Consistent Node Force Vector . . 11.5. *Accuracy Analysis 11.5.1. *Nodal Exactness and Superconvergence 11.5.2. *Fourier Patch Analysis . . . . . 11.5.3. *Robin BCs . . . . . . . . . . 11. Notes and Bibliography . . . . . . . . . . . . . . 11. References . . . . . . . . . . . . . . 11. Exercises . . . . . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . . . . . .
. . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
113 113 113 113 116 116 117 117 118 118 119 119 119 1110 1110 1110 1111 1112 1113 1114 1115
112
11.3
VARIATIONAL FORMULATION
This Chapter begins Part II of the course. This Part focuses on the construction of structural and continuum nite elements using a variational formulation based on the Total Potential Energy. Why only elements? Because the other synthesis steps of the DSM: globalization, merge, BC application and solution, remain the same as in Part I. Those operations are not element dependent. Individual elements are constructed in this Part beginning with the simplest ones and progressing to more complicated ones. The formulation of 2D nite elements from a variational standpoint is discussed in Chapters 14 and following. Although the scope of that formulation is broad, exceeding structural mechanics, it is better understood by going through specic elements rst. From a geometrical standpoint the simplest nite elements are one-dimensional or line elements. This means that the intrinsic dimensionality is one, although these elements may be used in one, two or three space dimensions upon transformation to global coordinates as appropriate. The simplest one-dimensional structural element is the two-node bar element, which we have already encountered in Chapters 2, 3 and 5 as the truss member. In this Chapter the bar stiffness equations are rederived using the variational formulation. For uniform properties the resulting equations are the same as those found previously using the physical or Mechanics of Materials approach. The variational method has the advantage of being readily extendible to more complicated situations, such as variable cross section or more than two nodes. 11.2. Denition of Bar Member In structural mechanics a bar is a structural component characterized by two properties: (1) One preferred dimension: the longitudinal dimension or axial dimension is much larger that the other two dimensions, which are collectively known as transverse dimensions. The intersection of a plane normal to the longitudinal dimension and the bar denes the cross sections. The longitudinal dimension denes the longitudinal axis. See Figure 11.1. (2) The bar resists an internal axial force along its longitudinal dimension. In addition to trusses, bar elements are used to model cables, chains and ropes. They are also used as ctitious elements in penalty function methods, as discussed in Chapter 9. We will consider here only straight bars, although their cross section may vary. The one-dimensional mathematical model assumes that the bar material is linearly elastic, obeying Hookes law, and that displacements and strains are innitesimal. Figure 11.2 pictures the relevant quantities for a xedfree bar. Table 11.1 collects the necessary terminology for the governing equations. Figure 11.3 displays the governing equations of the bar in a graphic format called a Tonti diagram. The formal similarity with the diagrams used in Chapter 5 to explain MoM elements should be noted, although the diagram of Figure 11.3 pertains to the continuum model rather than to the discrete one. 113
114
Table 11.1
Quantity x (.) u (x ) q (x ) L E A EA e = du /d x = u = Ee = Eu F = A = E A e = E Au P
Meaning Longitudinal bar axis d (.)/d x Axial displacement Distributed axial force, given per unit of bar length Total bar length Elastic modulus Cross section area; may vary with x Axial rigidity Innitesimal axial strain Axial stress Internal axial force Prescribed end load
x is used in this Chapter instead of x (as in Chapters 23) to simplify the notation.
cross section
;; ;;
;;;
x
Cross section
q(x)
P
Longitudinal axis
11.3. Variational Formulation To illustrate the variational formulation, the nite element equations of the bar will be derived from the Minimum Potential Energy principle. 11.3.1. The Total Potential Energy Functional In Mechanics of Materials it is shown that the internal energy density at a point of a linear-elastic material subjected to a one-dimensional state of stress and strain e is U = 1 (x )e(x ), where 2 is to be regarded as linked to the displacement u through Hookes law = Ee and the straindisplacement relation e = u = du /d x . This U is also called the strain energy density. Integration 114
115
Displacement Axial BCs displacement u(x)
11.3
VARIATIONAL FORMULATION
Kinematic
e=u'
F'+q=0 Equilibrium
F = EA e Constitutive
Force BCs
Figure 11.3. Tonti diagram for the continuum model of a bar member. Field equations and BCs are represented as lines connecting the boxes. Yellow (brown) boxes contain unknown (given) quantities.
over the volume of the bar gives the total internal energy U=
1 2
e dV =
V
L 1 2 0
Fe d x =
L 1 2 0
( E Au )u d x =
L 1 2 0
u E A u dx,
(11.1)
in which all integrand quantities may depend on x . The external energy due to applied mechanical loads pools contributions from two sources: 1. 2. The distributed load q (x ). This contributes a cross-section density of q (x )u (x ) because q is assumed to be already integrated over the section. Any applied end load(s). For the xed-free example of Figure 11.2 the end load P would contribute P u ( L ).
The second source may be folded into the rst by conventionally writing any point load P acting at a cross section x = a as a contribution P (a ) to q (x ), where (a ) denotes the one-dimensional Dirac delta function at x = a . If this is done the external energy can be concisely expressed as W =
0 L
q u dx.
(11.2)
Mathematically this is a functional, called the Total Potential Energy functional or TPE. It depends only on the axial displacement u (x ). In variational calculus this is called the primary variable of the functional. When the dependence of on u needs to be emphasized we shall write [u ] = U [u ]W [u ], with brackets enclosing the primary variable. To display both primary and independent variables we write, for example, [u (x )] = U [u (x )] W [u (x )]. 115
116 is
Remark 11.1. According to the rules of Variational Calculus, the Euler-Lagrange equation for
d = q ( E A u ) = 0 (11.4) u dx u This is the equation of equilibrium in terms of the axial displacement, usually written ( E A u ) + q = 0, or E A u + q = 0 if E A is constant. This equation is not explicitly used in the FEM development. It is instead replaced by = 0, with the variation restricted over the nite element interpolation functions.
11.3.2. Variation of an Admissible Function The concept of admissible variation is fundamental in both variational calculus and the variationally formulated FEM. Only the primary variable(s) of a functional may be varied. For the TPE functional (11.4) this is the axial displacement u (x ). Suppose that u (x ) is changed to u (x ) + u (x ).1 This is illustrated in Figure 11.4, where for convenience u (x ) is plotted normal to x . The functional changes from to + . The function u (x ) and the scalar are called the variations of u (x ) and , respectively. The variation u (x ) should not be confused with the ordinary differential du (x ) = u (x ) d x since on taking the variation the independent variable x is frozen; that is, x = 0.
u(x)+u(x) u(x)
u(L)
u(x)
u(0) = 0
A displacement variation u (x ) is said to be admissible when both u (x ) and u (x ) + u (x ) are kinematically admissible in the sense of the Principle of Virtual Work (PVW). This agrees with the conditions stated in the classic variational calculus. A kinematically admissible axial displacement u (x ) obeys two conditions: (i) It is continuous over the bar length, that is, u (x ) C0 in x [0, L ].
Figure 11.4. Concept of admissible variation of the axial displacement function u (x ). For convenience u (x ) is plotted normal to the longitudinal axis. Both depicted u (x ) and u (x ) + u (x ) are kinematically admissible, and so is the variation u (x ).
(ii) It satises exactly any displacement boundary condition, such as the xed-end specication u (0) = 0 of Figure 11.2. The variation u (x ) depicted in Figure 11.4 is kinematically admissible because both u (x ) and u (x ) + u (x ) satisfy the foregoing conditions. The physical meaning of (i)(ii) is the subject of Exercise 11.1. 11.3.3. The Minimum Potential Energy Principle The Minimum Potential Energy (MPE) principle states that the actual displacement solution u (x ) that satises the governing equations is that which renders stationary:2 = U W = 0 iff u = u (11.5)
The symbol not immediately followed by a parenthesis is not a delta function but instead denotes variation with respect to the variable that follows. The symbol iff in (11.5) is an abbreviation for if and only if .
116
117
11.3
VARIATIONAL FORMULATION
u (x ) of (11.5) exists, is unique, and renders [u ] a minimum over the class of kinematically admissible displacements. The last attribute explains the mininum in the name of the principle.
Remark 11.2. Using standard techniques of variational calculus3 it can be shown that if E A > 0 the solution
11.3.4. TPE Discretization To apply the TPE functional (11.2) to the derivation of nite element equations we replace the continuum mathematical model by a discrete one consisting of a union of bar elements. For example, Figure 11.5 illustrates the subdivision of a bar member into four two-node elements. Functionals are scalars. Therefore, corresponding to a discretization such as that shown in Figure 11.5, the TPE functional (11.4) may be decomposed into a sum of contributions of individual elements:
u 1, f1
(1)
u 2, f2
(2)
u 3, f3
(3)
u 4, f4
(4)
u 5, f5
1 u
5
u5
u2 u1 = 0
u3
u4
u(x)
Figure 11.5. FEM discretization of bar member. A piecewise- linear admissible displacement trial function u (x ) is drawn underneath the mesh. It is assumed that the left end is xed; thus u 1 = 0.
(1)
(2)
+ ... +
( Ne )
(11.6)
where Ne is the number of elements. The same decomposition applies to the internal and external energies, as well as to the stationarity condition (11.5): =
(1)
(2)
+ ... +
( Ne )
= 0.
(11.7)
Using the fundamental lemma of variational calculus,4 it can be shown that (11.7) implies that for a generic element e we may write
e
= U e W e = 0.
(11.8)
This variational equation is the basis for the derivation of element stiffness equations once the displacement eld has been discretized over the element, as described next.
Remark 11.3. In mathematics (11.8) is called a weak form. In mechanics it also states the Principle of Virtual
Work for each element: U e = W e , which says that the virtual work of internal and external forces on admissible displacement variations is equal if the element is in equilibrium [200].
3 4
See references in Notes and Bibliography at the end of Chapter. See, e.g., Chapter II of Gelfand and Fomin [110].
117
118
11.3.5. Bar Element Discretization Figure 11.6 depicts a generic bar element e. It has two nodes, which are labeled 1 and 2. These are = x x1 , which measures called the local node numbers.5 The element is referred to its local axis x e the distance from its left end. The two degrees of freedom are u 1 and u e 2 . (Bars are not necessary on these values since the directions of x and x are the same.) The element length is = L e . The mathematical concept of bar nite elements is based on approximation of the axial displacement u (x ) over the element. The exact displacement u is replaced by an approximate displacement u (x ) u e (x ) (11.9)
over the nite element mesh. This approximate displacement, u e (x ), taken over all elements e = 1, 2, . . . N e , is called the nite element trial expansion or simply trial expansion. See Figure 11.5. This FE trial expansion must belong to the class of kinematically admissible displacements dened in 11.3.2. Consequently, it must be C0 continuous over and between elements. 11.3.6. Shape Functions In a two-node bar element the only possible variation of the displacement u e that satises the interelement continuity requirement stated above is linear. It can be expressed by the interpolation formula ue e e e e e e u e ( x ) = N1 u 1 + N2 u 2 = [ N1 (11.10) = Nue . N2 ] 1 ue 2
e e The functions N1 and N2 that multiply the node displacements u 1 and u 2 are called shape functions. These functions interpolate the internal displacement u e directly from the node values.
See Figure 11.6. For the bar element, with x = x x1 measuring the distance from the left node i , the shape functions are
e =1 N1
(e)
e = L - = x x - x1
= 1 ,
e = N2
= .
(11.11)
/ is a dimensionless coordinate, Here = (x x1 )/ = x also known as a natural coordinate. Note that d x = d and e has the value 1 at node 1 d = d x / . The shape function N1 e has the value and 0 at node 2. Conversely, shape function N2 0 at node 1 and 1 at node 2. This is a general property of shape functions. It follows from the fact that element displacement interpolations such as (11.10) are based on physical node values.
1 Ne i
1 x/
0 Nje 1
x/
0
Note the notational change from the labels i and j of Part I. This will facilitate transition to multidimensional elements.
118
119
11.4
Remark 11.4. In addition to continuity, shape functions must satisfy a completeness requirement with respect
to the governing variational principle. This condition is stated and discussed in later Chapters. Sufces for now to say that the shape functions (11.11) do satisfy this requirement.
11.3.7. The Strain-Displacement Equation The axial strain over the element is e du e d N1 e= = (u e ) = dx dx where B= is called the strain-displacement matrix.
11.3.8. *Trial Basis Functions
(1) (2) (3) (4)
e d N2 dx
ue 1 ue 2 1 [ 1
[ 1
1]
ue 1 ue 2
= Bue ,
(11.12)
1]
(11.13)
Shape functions are associated with elements. A trial basis function, or simply basis function, is associated with a node. Suppose node i of a bar discretization connects elements (e1) and (e2). The trial basis function Ni is dened as Ni(e1) Ni(e2)
1 u
x if x element (e1) Ni ( x ) = (11.14) if x element (e2) Figure 11.7. Trial basis function for node 3. 0 otherwise For a piecewise linear discretizations such as the two-node bar this function has the shape of a hat. Thus it is sometimes called a hat function or chapeau function. See Figure 11.7, in which i = 3, e1 = 2, e2 = 3. The concept is important in the variational interpretation of FEM as a Rayleigh-Ritz method.
N3(2)
(3) N3
(thick line)
N3
11.4. The Finite Element Equations In linear FEM the discretization process for the TPE functional leads to the following algebraic form e = U e W e, U e = 1 (ue )T Ke ue , W e = (ue )T fe , (11.15) 2 where Ke and fe are called the element stiffness matrix and the element consistent nodal force vector, respectively. Note that in (11.15) the three energies are only function of the node displacements ue . U e and W e depend quadratically and linearly, respectively, on those displacements. Taking the variation of the discretized TPE of (11.15) with respect to the node displacements gives6 e T = ue Ke ue fe = 0. (11.16) e u Because the variations ue can be arbitrary, the bracketed quantity must vanish, which yields
e
= ue
Ke ue = fe
(11.17)
These are the element stiffness equations. Hence the foregoing names given to Ke and fe are justied a posteriori.
6 e The 1 2 factor disappears on taking the variation because U is quadratic in the node displacements. For a review on the calculus of discrete quadratic forms, see Appendix D.
119
1110
11.4.1. The Stiffness Matrix For the two-node bar element, the internal energy U e is Ue =
1 2 x2 x1
e E A e dx =
1 1 2 0
e E A e d ,
(11.18)
where the strain e is related to the nodal displacements through (11.12). This form is symmetrically expanded by inserting e = Bue into the second e and e = e T = (ue )T BT into the rst e: Ue =
1 1 2 0
[ ue 1
ue 2]
1 1 1 E A [ 1 1
1]
ue 1 ue 2
d .
(11.19)
The nodal displacements can be moved out of the integral, giving Ue = in which Ke =
0 1 1 1 2
[ ue 1
ue 2]
EA
2
1 1
1 1
ue 1 ue 2
1 2
ue
Ke ue .
(11.20)
E A BT B d =
0
EA
2
1 1
1 1
d .
(11.21)
is the element stiffness matrix. If the rigidity E A is constant over the element, Ke = E A B T B
0 1
d =
EA
2
1 1
1 1
EA
1 1
1 . 1
(11.22)
This is the same element stiffness matrix of the prismatic truss member derived in Chapters 2 and 5 by a Mechanics of Materials approach, but now obtained through a variational argument. 11.4.2. The Consistent Node Force Vector The consistent node force vector fe introduced in (11.15) comes from the element contribution to the external work potential W : We =
x2 x1
q u dx =
0
q NT ue d = ue
T 0
d = ue
T e
f,
(11.23)
in which = (x x1 )/ . Consequently fe =
x2
q
x1
dx =
0
d .
(11.24)
If the force q is constant over the element, one obtains the same results as with the EbE load-lumping method of Chapter 7. See Exercise 11.3. 1110
1111
11.5.
*Accuracy Analysis
Low order 1D elements may give surprisingly high accuracy. In particular the lowly two-node bar element can display innite accuracy under some conditions. This phenomenon is studied in this advanced section as it provides an introduction to modied equation methods and Fourier analysis along the way. 11.5.1. *Nodal Exactness and Superconvergence Suppose that the following two conditions are satised: 1. 2. The bar properties are constant along the length (prismatic member). The distributed load q (x ) is zero between nodes. The only applied loads are point forces at the nodes.
If so, a linear axial displacement u (x ) as dened by (11.10) and (11.11) is the exact solution over each element since constant strain and stress satisfy, element by element, all of the governing equations listed in Figure 11.3.7 It follows that if the foregoing conditions are veried the FEM solution is exact; that is, it agrees with the analytical solution of the mathematical model.8 Adding extra elements and nodes would not change the solution. That is the reason behind the truss discretizations used in Chapters 23: one element per member is enough if they are prismatic and loads are applied to joints. Such models are called nodally exact. What happens if the foregoing assumptions are not met? Exactness is then generally lost, and several elements per member may be benecial if spurious mechanisms are avoided.9 For a 1D lattice of equal-length, prismatic two-node bar elements, an interesting and more difcult result is: the solution is nodally exact for any loading if consistent node forces are used. This is proven in the subsection below. This result underlies the importance of computing node forces correctly. If conditions such as equal-length are relaxed, the solution is no longer nodally exact but convergence at the nodes is extremely rapid (faster than could be expected by standard error analysis) as long as consistent node forces are used. This phenomenon is called superconvergence in the FEM literature. 11.5.2. *Fourier Patch Analysis The following analysis is based on the modied differential equation (MoDE) method of Warming and Hyett [261] combined with the Fourier patch analysis approach of Park and Flaggs [188,189]. Consider a lattice of two-node prismatic bar elements of constant rigidity E A and equal length , as illustrated in Figure 11.8. The total length of the lattice is L . The system is subject to an arbitrary axial load q (x ). The only requirement on q (x ) is that it has a convergent Fourier series in the space direction.
q(x)
xi = xj
k EA = const
xj xk = xj +
L
1 (xj x)/ = 1
Two-element patch ijk i
1
j
1 + (x jx)/ = 1+
k
From the lattice extract a patch10 of two elements connecting nodes xi , x j and xk as shown in Figure 11.8. The
7
The internal equilibrium equation p + q = E A u + q = 0 is trivially veried because q = 0 from the second assumption, and u = 0 because of shape function linearity. In variational language: the Green function of the u = 0 problem is included in the FEM trial space. These can happen when transforming such elements for 2D and 3D trusses. See Exercise E11.7. A patch is the set of all elements connected to a node; in this case j .
8 9 10
1111
1112
fj =
xi
q (x ) N j (x ) d x =
1
q (x j + )(1 + ) d +
0
q (x j + )(1 ) d .
(11.26)
Here N j (x ) is the hat trial basis function for node j , depicted in Figure 11.8, and = (x x j )/ is a dimensionless coordinate that takes the values 1, 0 and 1 at nodes i , j and k , respectively. If q (x ) is expanded in Fourier series
M
q (x ) =
m =1
q m e i m x ,
m = m / L ,
(11.27)
(the term m = 0 requires special handling) the exact solution of the continuum equation E A u + q = 0 is
M
u (x ) =
m =1
i m x u , me
u m =
qm eim x . 2 E Am
(11.28)
fj =
m =1
f jm ,
f jm = qm
sin2 ( 1 ) 2 m
1 2 2 4 m
e i m x 2 .
(11.29)
To construct a modied differential equation (MoDE), expand the displacement by Taylor series centered at node j . Evaluate at i and k : u i = u j u j + 2 u j /2! 3 u j /3! + 4 u ijv /4! + . . . and u k = u j + u j + 2 u j /2 + 3 u j /3! + 4 u ijv /4! + . . .. Replace these series into (11.25) to get 2 E A
2 4 1 i + ... u j + u ijv + u v 2! 4! 6! j
= fj.
(11.30)
This is an ODE of innite order. It can be reduced to an algebraic equation by assuming that the response of v 2 4 u jm , u ijm = m u jm , etc, and the MoDE becomes (11.30) to qm eim x is harmonic: u jm eim x . If so u jm = m sin2 ( 1 ) i m x j 2 2 4 4 1 2 m ) u = f = q e . m + m . . . u jm = 4 E A sin2 ( 1 m jm jm m 2 2 1 2! 4! 6! 2 4 m (11.31) 2 Solving gives u jm = qm eim x j /( E Am ), which compared with (11.28) shows that u jm = u for any m > 0. m Consequently u j = u j . In other words, the MoDE (11.30) and the original ODE: E Au + q = 0 have the same value at x = x j for any load q (x ) developable as (11.27). This proves nodal exactness. In between nodes the two solutions will not agree.11
2 2 E A m
The case m = 0 has to be treated separately since the foregoing expressions become 0/0. The response to a uniform q = q0 is a quadratic in x , and it is not difcult to prove nodal exactness.
11
The FEM solution varies linearly between nodes whereas the exact one is generally trigonometric.
1112
1113
11.5.3. *Robin BCs
Suppose that for a bar of length L one has the following end conditions: u (0) = au (0) + b at x = 0 and u ( L ) = au ( L ) + b at x = L , in which a and b are given coefcients. Those are called Robin BCs in the literature. Adjoining them as Courant penalty terms gives the functional
L
F (u ) =
0
(11.32)
Divide [0,L] into Ne elements and N = Ne + 1 nodes. Do C 0 linear interpolation over each element, insert uT Ku fT v, in which u is the vector of node values, K the master stiffness matrix into F (u ) to get Fd (u ) = 1 2 and f the master force vector. Coefcients a and b will affect both K and f. Vanishing of the rst variation: Fd = 0 yields the FEM equations Ku = f to be solved for u. The Robin BCs at x = 0 and x = L will affect the stiffness and force contributions of the rst and last elements, but not those of interior elements. This kind of boundary value problem (i.e., with Robin BCs) is common in heat conduction and heat transfer with convection given over cooling surfaces. In that case the heat ux is proportional to the difference of the (unknown) surface temperature and that of the cooling uid. Elements that touch the convention boundary are affected. Notes and Bibliography The foregoing development pertains to the simplest structural nite element: the two-node bar element. For bars this may be generalized in various directions. Rened bar elements. Adding internal nodes we can pass from linear to quadratic and cubic shape functions. These elements are rarely useful on their own right, but as accessories to 2D and 3D high order continuum elements (for example, to model edge reinforcements.) For that reason they are not considered here. The 3-node bar element is developed in exercises assigned in Chapter 16. Two- and three-dimensional truss structures. The only additional ingredients are the transformation matrices discussed in Chapters 3 and 6. Curved bar elements. These can be derived using isoparametric mapping, a device introduced later. Matrices for straight bar elements are available in any nite element book; for example Przemieniecki [204]. Tonti diagrams were introduced in the 1970s in papers now difcult to access, for example [251]. Scanned images are available, howewer, at http://www.dic.units.it/perspage/discretephysics The fundamentals of Variational Calculus may be studied in the excellent textbook [110], which is now available in an inexpensive Dover edition. The proof of the MPE principle can be found in texts on variational methods in mechanics. For example: Langhaar [155], which is the most readable old fashioned treatment of the energy principles of structural mechanics, with a beautiful treatment of virtual work. (Out of print but used copies may be found via the web engines cited in 1.5.2.) The elegant treatment by Lanczos [154] is recommended as reading material although it is more oriented to physics than structural mechanics. The rst accuracy study of FEM discretizations using modied equation methods is by Waltz et. al. [259]; however their procedures were faulty, which led to incorrect conclusions. The rst correct derivation of modied equations appeared in [261]. The topic has recently attracted interest from applied mathematicians because modied equations provide a systematic tool for backward error analysis of differential equations: the discrete solution is the exact solution of the modied problem. This is particularly important for the study of long term behavior of discrete dynamical systems, whether deterministic or chaotic. Recommended references along these lines are [117,121,232]. Nodal exactness of bar models for point node loads is a particular case of a theorem by Tong [250]. For arbitrary loads it was proven by Park and Flaggs [188,189], who followed a variant of the scheme of 11.5.2.
1113
1114
A different technique is used in Exercise 11.8. The budding concept of superconvergence, which emerged in the late 1960s, is outlined in the book of Strang and Fix [227]. There is a monograph [260] devoted to the subject; it covers only Poisson problems but provides a comprehensive reference list until 1995. References Referenced items moved to Appendix R.
1114
1115
Homework Exercises for Chapter 11 Variational Formulation of Bar Element
Exercises
EXERCISE 11.1 [D:10] Explain the kinematic admissibility requirements stated in 11.3.2 in terms of physics, namely ruling out the possibility of gaps or interpenetration as the bar material deforms. EXERCISE 11.2 [A/C:15] Using (11.21), derive the stiffness matrix for a tapered bar element in which the cross section area varies linearly along the element length:
A = Ai (1 ) + A j ,
(E11.1)
where Ai and A j are the areas at the end nodes, and = x e / is the dimensionless coordinate dened in 11.3.6. Show that this yields the same answer as that of a stiffness of a constant-area bar with cross section 1 ( Ai + A j ). Note: the following Mathematica script may be used to solve this exercise:12 2
ClearAll[Le,x,Em,A,Ai,Aj]; Be={{-1,1}}/Le; =x/Le; A=Ai*(1- )+Aj* ; Ke=Integrate[Em*A*Transpose[Be].Be,{x,0,Le}]; Ke=Simplify[Ke]; Print["Ke for varying cross section bar: ",Ke//MatrixForm];
of constant area A subject to a uniform axial force q = g A per unit length along the element. Show that this vector is the same as that obtained with the element-by-element (EbE) lumping method of 8.4, which g A , to each node. simply assigns half of the total load: 1 2
EXERCISE 11.4 [A/C:15] Repeat the previous calculation for the tapered bar element subject to a force q = g A per unit length, in which A varies according to (E11.1) whereas and g are constant. Check that if g A . Note: the following Mathematica script may be used to solve this Ai = A j one recovers f i = f j = 1 2 exercise:13
ClearAll[q,A,Ai,Aj, ,g,Le,x]; =x/Le; Ne={{1- , }}; A=Ai*(1- )+Aj* ; q= *g*A; fe=Integrate[q*Ne,{x,0,Le}]; fe=Simplify[fe]; Print["fe for uniform load q: ",fe//MatrixForm]; ClearAll[A]; Print["fe check: ",Simplify[fe/.{Ai->A,Aj->A}]//MatrixForm];
EXERCISE 11.5 [A/C:20] A tapered bar element of length , end areas Ai and A j with A interpolated as
per (E11.1), and constant density , rotates on a plane at uniform angular velocity (rad/sec) about node i . Taking axis x along the rotating bar with origin at node i , the centrifugal axial force is q (x ) = A2 x along the length, in which x x e . Find the consistent node forces as functions of , Ai , A j , and , and specialize 2 A 2 for A = Ai = A j . the result to the prismatic bar A = Ai = A j . Partial result check: f j = 1 3
12
The ClearAll[...] at the start of the script is recommended programming practice to initialize variables and avoid cell crosstalk. In a Module this is done by listing the local variables after the Module keyword. The ClearAll[A] before the last statement is essential; else A would retain the previous assignation.
13
1115
1116
EXERCISE 11.6 [A:15] (Requires knowledge of Diracs delta function properties.) Find the consistent load
vector fe if the bar is subjected to a concentrated axial force Q at a distance x = a from its left end. Use Equation (11.32), with q (x ) = Q (a ), in which (a ) is the one-dimensional Diracs delta function at x = a . Note: the following script does it by Mathematica, but it is overkill:
ClearAll[Le,q,Q,a,x]; =x/Le; Ne={{1- , }}; q=Q*DiracDelta[x-a]; fe=Simplify[ Integrate[q*Ne,{x,-Infinity,Infinity}] ]; Print["fe for point load Q at x=a: ",fe//MatrixForm];
EXERCISE 11.7 [C+D:20] In a learned paper, Dr. I. M. Clueless proposes improving the result for the example truss by putting three extra nodes, 4, 5 and 6, at the midpoint of members 12, 23 and 13, respectively. His reasoning is that more is better. Try Dr. C.s suggestion using the Mathematica implementation of Chapter 4 and verify that the solution blows up because the modied master stiffness is singular. Explain physically what happens. EXERCISE 11.8 [A:35, close to research paper level]. Prove nodal exactness of the two-node bar element for arbitrary but Taylor expandable loading without using the Fourier series approach. Hints: expand q (x ) = q (x j ) + ( )q (x j ) + ( )2 q (x j )/2! + . . ., where = x x j is the distance to node j , compute the consistent force f j (x ) from (11.26), and differentiate the MoDE (11.30) repeatedly in x while truncating all derivatives to a maximum order n 2. Show that the original ODE: E Au + q = 0, emerges as an identity regardless of how many derivatives are kept.
1116
Introduction to FEM
11
IFEM Ch 11 Slide 1
Introduction to FEM
;; ;; ;;
Cross section
P
Longitudinal axis x
IFEM Ch 11 Slide 2
Introduction to FEM
;;;
q(x)
IFEM Ch 11 Slide 3
Introduction to FEM
_ * x is used in this Chapter instead of x (as in Chapters 2-3) to simplify the notation
IFEM Ch 11 Slide 4
Introduction to FEM
Kinematic
e=u'
F'+q=0 Equilibrium
F = EA e
Constitutive
Force BCs
unknown
IFEM Ch 11 Slide 5
Introduction to FEM
U=
L 1 2 0
Fe d x =
L 1 2 0
( E Au' ) u' d x =
L 1 2
u' E Au' d x
0
External work
W =
0
qu d x
= U W
IFEM Ch 11 Slide 6
Introduction to FEM
u(x)
u(0) = 0
L
u(x) is kinematically admissible if u(x) and u(x) + u(x) (i) are continuous over bar length, i.e. u (x) C 0 in x [0, L ]. (ii) satisfy exactly displacement BC; in the figure, u(0) = 0
IFEM Ch 11 Slide 7
Introduction to FEM
= U W = 0
iff
u = u*
IFEM Ch 11 Slide 8
Introduction to FEM
u 1, f1
(1)
u 2, f2
(2)
u 3, f3
(3)
u 4, f4
(4)
u 5, f5
IFEM Ch 11 Slide 9
Introduction to FEM
u 2, f2
(2)
u 3, f3
(3)
u 4, f4
(4)
u 5, f5
u
u2 u1 = 0
Axial displacement plotted normal to x for visualization convenience
u3
u4
u(x)
u5
IFEM Ch 11 Slide 10
Introduction to FEM
= U W = 0
But and
iff
(2) (2)
u = u* + ... +
(exact solution)
(N e) (N e)
(1)
(1)
+ ... +
= 0
From fundamental lemma of variational calculus, each element variation must vanish, giving
e = U e W e = 0
IFEM Ch 11 Slide 11
Introduction to FEM
(e)
e = L - = x x - x1
1 Ne i
1 x/
0 Nje 1
x/
0
IFEM Ch 11 Slide 12
Introduction to FEM
in which
N1e = 1 = xx1
xx1
= 1 ,
N2 =
xx1
IFEM Ch 11 Slide 13
Introduction to FEM
{
u e
Ue =
1 e )T ( u 2
Ke ue
W e = (ue ) T f e
T
Ke ue f e = 0
(Appendix D)
u e
is arbitrary [...] = 0
Ke u e = f e
the element stiffness equations
IFEM Ch 11 Slide 14
Introduction to FEM
e E A e dx
0
e = u'
1] = 1 1 ue 1 e u2
1 2
[ u1
1 1 u2 ] 1 EA 1 1 1 1
[ 1
e u1 ue 2
dx
T
U =
e
1 2
e [ u1
ue 2
]
0
dx
ue
Ke u e
Ke =
0
E A BT B d x =
0
EA
2
1 1
dx
IFEM Ch 11 Slide 15
Introduction to FEM
q u dx =
(u e )T NTq d x = u e
0
T 0
d x = ue
fe
Since
ue
is arbitrary
fe =
0
dx
in which
xx1
IFEM Ch 11 Slide 16
Introduction to FEM
= q
0
dx = q
the same result as with EbE load lumping (i.e., assigning one half of the total load to each node)
IFEM Ch 11 Slide 17
1116
Homework Exercises for Chapter 11. Variational Formulation of Bar Element Solutions
EXERCISE 11.1 If the function u (x ) is discontinuous at x = a , material gap or interpenetration at that cross section occurs. The rst requirement rules that out at an arbitrary cross section. The second requirement does the same for supports. EXERCISE 11.2 Only A in (11.28) is a function of x . Consequently
Ke =
0
EA
2
1 1
1 1
dx =
E
2
1 1
1 1
A( x ) d x .
0
(E11.2)
But
1 1
A( x ) d x =
0 0
A( ) d =
0
Ai (1 ) + A j d =
1 ( Ai 2
, + Aj) = A
(E11.3)
EA
1 1
1 . 1
(E11.4)
f =
e 0
1 g A
d x = g A
0
d = g A
1 2 1 2
= 1 g A 2
1 . 1
(E11.5)
fe =
0
g A
d x = g
0
Ai (1 ) + A j (1 ) A i (1 ) + A j
d = g
1 3 1 6
Ai + 1 A 6 j Ai + 1 A 3 j
. (E11.6)
e So the answer is f xi =
1 ( Ai 12
+ A j ) 2 2 , f xej =
1 ( Ai 12
+ 3 A j ) 2 2 .
1116
1117
EXERCISE 11.6
Solutions to Exercises
fe =
0
1 x/ x/
Q (a ) d x = Q
1a . a
(E11.7)
EXERCISE 11.7 Three zero energy mechanisms occur because the bars can hinge without restraints about the midpoint nodes 4, 5 and 6. Removal would require messy MFC constraints. But the addition of these nodes is unnecessary since one element per member gives the exact answer if the loads are applied at the nodes, as discussed in 11.5.
q /4! + 4 q /6! + 6 q /8! + . . .), where q and its derivatives are evaluated at x = x2 . Insert this into the RHS of (11.30). Differentiate both sides repeatedly with respect to x keeping only even derivatives up to a certain order. The conguration is illustrated here when keeping up to the eighth derivative of u (x ) and sixth of q (x ):
2
EXERCISE 11.8 The consistent node force computed from (11.26) is f j = 2 (q /2! +
1 2! 2 E A
0 0
0
4! 1 2! 0 0
6!
2
4! 1 2! 0
8! u f j j 4 u f 6! j = j = 2 2 uj fj 12 1 2! uj fj
1 2! 0
0
0
4! 1 2! 0 0
6!
2
4! 1 2! 0
8! q j 4 q 6! j 2 qj 12 q j 1 2!
(E11.8)
Cancelling the common Toeplitz coefcient matrix, which is possible since it is obviously nonsingular,14 and the factor, one gets (from the rst row) E Au j + q j = 0 identically for any differentiation order. Consequently the FEM solution is nodally exact for any load, as load as the consistent force computation is used. As usual the fastest route, if and when applicable, is to use the Laplace transform L. Let s be the transform (s ). Transforming (11.30) with the nodal force f j found above yields variable, with L(d k F (x )/d x k ) s k F (s ) = (2/ ) cosh( s ) 1 s 2 q (s ), or E A s 2 u (s ) + q (s ) = 0, with subscript j (2 E A / ) cosh( s ) 1 u suppressed for brevity. Backtransforming gives E Au j + q j = 0.
14
The determinant of a triangular matrix is the product of the diagonal entries, all of which are nonzero.
1117
12
121
122
TABLE OF CONTENTS
Page
12.1. Introduction 12.2. What is a Beam? 12.2.1. Terminology . . . . . . . . . . . 12.2.2. Mathematical Models . . . . . . . . . 12.2.3. Assumptions of Classical Beam Theory . . . 12.3. The Bernoulli-Euler Beam Theory 12.3.1. Element Coordinate Systems . . . . . . . 12.3.2. Kinematics . . . . . . . . . . . . 12.3.3. Loading . . . . . . . . . . . . . . 12.3.4. Support Conditions . . . . . . . . . 12.3.5. Strains, Stresses and Bending Moments . . . 12.4. Total Potential Energy Functional 12.5. Beam Finite Elements 12.5.1. Finite Element Trial Functions . . . . . . 12.5.2. Shape Functions . . . . . . . . . . . 12.6. The Finite Element Equations 12.6.1. The Stiffness Matrix of a Prismatic Beam . . 12.6.2. Consistent Nodal Force Vector for Uniform Load 12. Notes and Bibliography . . . . . . . . . . . . . . . . 12. References. . . . . . . . . . . . . . . . . 12. Exercises . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
123 123 123 123 124 124 124 125 125 125 125 126 128 128 128 129 1210 1210 1215 1215 1216
122
12.2
WHAT IS A BEAM?
The previous Chapter introduced the TPE-based variational formulation of nite elements, which was illustrated for the bar element. This Chapter applies that technique to a more complicated one-dimensional element: the plane beam described by engineering beam theory. Mathematically, the main difference of beams with respect to bars is the increased order of continuity required for the assumed transverse-displacement functions to be admissible. Not only must these functions be continuous but they must possess continuous x rst derivatives. To meet this requirement both deections and slopes are matched at nodal points. Slopes may be viewed as rotational degrees of freedom in the small-displacement assumptions used here. 12.2. What is a Beam? Beams are the most common type of structural component, particularly in Civil and Mechanical Engineering. A beam is a bar-like structural member whose primary function is to support transverse loading and carry it to the supports. See Figure 12.1. By bar-like it is meant that one of the dimensions is considerably larger than the other two. This dimension is called the longitudinal dimension or beam axis. The intersection of planes normal to the longitudinal dimension with the beam member are called cross sections. A longitudinal plane is one that passes through the beam axis.
A beam resists transverse loads mainly through bending action, Bending produces compressive longitudinal stresses in one side of the beam and tensile stresses in the other. The two regions are separated by a neutral surface of zero stress. The combination of tensile and compressive stresses produces an internal bending moment. This moment is the primary mechanism that transports loads to the supports. The mechanism is illustrated in Figure 12.2. 12.2.1. Terminology
Neutral surface Compressive stress
Tensile stress
Figure 12.2. Beam transverse loads are primarily resisted by bending action.
A general beam is a bar-like member designed to resist a combination of loading actions such as biaxial bending, transverse shears, axial stretching or compression, and possibly torsion. If the internal axial force is compressive, the beam has also to be designed to resist buckling. If the beam is subject primarily to bending and axial forces, it is called a beam-column. If it is subjected primarily to bending forces, it is called simply a beam. A beam is straight if its longitudinal axis is straight. It is prismatic if its cross section is constant. A spatial beam supports transverse loads that can act on arbitrary directions along the cross section. A plane beam resists primarily transverse loading on a preferred longitudinal plane. This Chapter considers only plane beams. 123
124
12.2.2. Mathematical Models One-dimensional mathematical models of structural beams are constructed on the basis of beam theories. Because beams are actually three-dimensional bodies, all models necessarily involve some form of approximation to the underlying physics. The simplest and best known models for straight, prismatic beams are based on the Bernoulli-Euler beam theory (also called classical beam theory and engineering beam theory), and the Timoshenko beam theory. The Bernoulli-Euler theory is that taught in introductory Mechanics of Materials courses, and is the one emphasized in this Chapter. The Timoshenko beam model is presented in Chapter 13, which collects advanced material. Both models can be used to formulate beam nite elements. The Bernoulli-Euler beam theory leads to the so-called Hermitian beam elements.1 These are also known as C 1 elements for the reason explained in 12.5.1. This model neglects the effect of transverse shear deformations on the internal energy. Elements based on Timoshenko beam theory, also known as C 0 elements, incorporate a rst order correction for transverse shear effects. This model assumes additional importance in dynamics and vibration. 12.2.3. Assumptions of Classical Beam Theory The Bernoulli-Euler or classical beam theory for plane beams rests on the following assumptions: 1. Planar symmetry. The longitudinal axis is straight and the cross section of the beam has a longitudinal plane of symmetry. The resultant of the transverse loads acting on each section lies on that plane. The support conditions are also symmetric about this plane. Cross section variation. The cross section is either constant or varies smoothly. Normality. Plane sections originally normal to the longitudinal axis of the beam remain plane and normal to the deformed longitudinal axis upon bending. Strain energy. The internal strain energy of the member accounts only for bending moment deformations. All other contributions, notably transverse shear and axial force, are ignored. Linearization. Transverse deections, rotations and deformations are considered so small that the assumptions of innitesimal deformations apply. Material model. The material is assumed to be elastic and isotropic. Heterogeneous beams fabricated with several isotropic materials, such as reinforced concrete, are not excluded.
2. 3. 4. 5. 6.
12.3. The Bernoulli-Euler Beam Theory 12.3.1. Element Coordinate Systems Under transverse loading one of the top surfaces shortens while the other elongates; see Figure 12.2. Therefore a neutral surface that undergoes no axial strain exists between the top and the bottom. The intersection of this surface with each cross section denes the neutral axis of that cross section.2
1
The qualier Hermitian relates to the use of a transverse-displacement interpolation formula studied by the French mathematician Hermite. The term has nothing to do with the mathematical model used. If the beam is homogenous, the neutral axis passes through the centroid of the cross section. If the beam is fabricated of different materials for example, a reinforced concrete beam the neutral axes passes through the centroid of an equivalent cross section. This topic is covered in Mechanics of Materials textbooks; for example Popov [201].
124
125
12.3
y, v
q(x) y,v
m
zc
Neutral surface
x, u
z
Beam cross section
Figure 12.3. Terminology and choice of axes for Bernoulli-Euler model of plane beam.
The Cartesian axes for plane beam analysis are chosen as shown in Figure 12.3. Axis x lies along the longitudinal beam axis, at neutral axis height. Axis y lies in the symmetry plane and points upwards. Axis z is directed along the neutral axis, forming a RHS system with x and y . The origin is placed at the leftmost section. The total length (or span) of the beam member is called L . 12.3.2. Kinematics The motion under loading of a plane beam member in the x , y plane is described by the two dimensional displacement eld u (x , y ) , (12.1) v(x , y ) where u and v are the axial and transverse displacement components, respectively, of an arbitrary beam material point. The motion in the z direction, which is primarity due to Poissons ratio effects, is of no interest. The normality assumption of the Bernoulli-Euler model can be represented mathematically as u (x , y ) = y v(x ) = y v = y , x v(x , y ) = v(x ). (12.2)
Note that the slope v = v/ x = d v/d x of the deection curve has been identied with the rotation symbol . This is permissible because represents to rst order, according to the kinematic assumptions of this model, the rotation of a cross section about z positive CCW. 12.3.3. Loading The transverse force per unit length that acts on the beam in the + y direction is denoted by q (x ), as illustrated in Figure 12.3. Concentrated loads and moments acting on isolated beam sections can be represented by the delta function and its derivative. For example, if a transverse point load F acts at x = a , it contributes F (a ) to q (x ). If the concentrated moment C acts at x = b, positive CCW, it contributes C (b) to q (x ), where denotes a doublet acting at x = b. 12.3.4. Support Conditions Support conditions for beams exhibit far more variety than for bar members. Two canonical cases are often encountered in engineering practice: simple support and cantilever support. These are illustrated in Figures 12.4 and 12.5, respectively. Beams often appear as components of skeletal structures called frameworks, in which case the support conditions are of more complex type. 125
126
Figure 12.5. A cantilever beam is clamped at one end and free at the other. Airplane wings and stabilizers are examples of this conguration.
12.3.5. Strains, Stresses and Bending Moments The Bernoulli-Euler or classical model assumes that the internal energy of beam member is entirely due to bending strains and stresses. Bending produces axial stresses x x , which will be abbreviated to , and axial strains ex x , which will be abbreviated to e. The strains can be linked to the displacements by differentiating the axial displacement u (x ) of (12.2): e= d 2v 2v u = y 2 = y 2 = y v = y . x x dx (12.3)
Here denotes the deformed beam axis curvature, which to rst order is d 2 v/d x 2 = v . The bending stress = x x is linked to e through the one-dimensional Hookes law = Ee = E y d 2v = E y , dx2 (12.4)
where E is the longitudinal elastic modulus. The most important stress resultant in classical beam theory is the bending moment M , which is dened as the cross section integral M=
A
y d x = E
d 2v dx2
y 2 d A = E I .
A
y
(12.5)
Here I Izz denotes the moment of inertia A y 2 d A of the cross section with respect to the z (neutral) axis. The bending moment M is considered positive if it compresses the upper portion: y > 0, of the beam cross section, as illustrated in Figure 12.6. This convention explains the negative sign of y in the integral (12.5). The product E I is called the bending rigidity of the beam with respect to exure about the z axis.
M
z x
V
Figure 12.6. Positive sign convention for M and V .
The governing equations of the Bernoulli-Euler beam model are summarized in the Tonti diagram of Figure 12.7. 126
127
12.4
Displacement BCs
Transverse displacements
v(x) = v'' M = EI
Constitutive
q(x)
Kinematic
M''=q Equilibrium
Curvature
(x)
Bending moment
Force BCs
M(x)
Figure 12.7. The Tonti diagram for the governing equations of the Bernoulli-Euler beam model.
12.4. Total Potential Energy Functional The total potential energy of the beam is =U W (12.6)
where as usual U and W denote the internal and external energies, respectively. As previously explained, in the Bernoulli-Euler model U includes only the bending energy: U=
1 2
e dV =
V
L 1 2 0
M dx =
L 1 2 0
E I 2 dx =
L 1 2 0
EI v
dx =
L 1 2 0
v E I v dx. (12.7)
qv d x.
(12.8)
The three functionals , U and W must be regarded as depending on the transverse displacement v(x ). When this dependence needs to be emphasized we write [v ], U [v ] and W [v ]. Note that [v ] includes up to second derivatives in v , because v = appears in U . This number is called the variational index. Variational calculus tells us that since the index is 2, admissible displacements v(x ) must be continuous, have continuous rst derivatives (slopes or rotations), and satisfy the displacement BCs exactly. This continuity requirement can be succintly stated by saying that admissible displacements must be C 1 continuous. This condition guides the construction of beam nite elements described below.
Remark 12.1. If there is an applied distributed moment m (x ) per unit of beam length, the external energy L (12.8) must be augmented with a 0 m (x )(x ) d x term. This is further elaborated in Exercises 12.4 and 12.5. Such kind of distributed loading is uncommon in practice although in framework analysis occasionally the need arises for treating a concentrated moment between nodes.
127
128
Beam nite elements are obtained by subdividing beam members longitudinally. The simplest Bernoulli-Euler plane beam element has two end nodes: 1 and 2, and four degrees of freedom (DOF). These are collected in the node displacement vector ue = [ v1 1 v2 2 ]T . (12.9)
2 v2
y, v
v1 1
E, I
2
x
x, u
P(x,y)
Figure 12.8. The two-node Bernoulli-Euler plane beam element with four DOFs.
The element is shown in Figure 12.8, which pictures the undeformed and deformed congurations. 12.5.1. Finite Element Trial Functions
The freedoms (12.9) are used to dene uniquely the variation of the transverse displacement v e (x ) over the element. The C 1 continuity requirement says that both v(x ) and the slope = v (x ) = d v(x )/d x must be continuous over the entire member, and in particular between beam elements. C 1 continuity can be trivially met within each element by choosing polynomial interpolation shape functions as shown below, because polynomials are C continuous. Matching nodal displacements and rotations with adjacent elements enforces the necessary interelement continuity.
interpenetration gap
(a)
(b)
v(x)
v(x)
Figure 12.9. Deection of a clamped-SS beam discretized with four elements, grossly exaggerated for visibility. (a) Cubic deection elements; (b) linear deection elements. The latter maintains only C 0 continuity, leading to unacceptable material gap and interpenetration at nodes.
Remark 12.2. The physical reason for C 1 continuity is illustrated in Figure 12.9, in which the lateral deection
curve v(x ) is grossly exaggerated for visibility. The left gure shows the approximation of v(x ) by four cubic functions, which maintain the required continuity. The right gure shows an attempt to approximate v(x ) by four piecewise linear functions that maintain only C 0 continuity. In this case material gap and interpenetration occur at the nodes, as well as at the clamped left end, because section rotations jump between elements.
12.5.2. Shape Functions The simplest shape functions that meet the C 1 continuity requirement for the nodal DOF conguration (12.9) are called the Hermitian cubic shape functions. The interpolation formula based on these functions is v1 1 e e e e e e (12.10) v e = [ Nv 1 N 1 Nv 2 N 2 ] v = N u . 2 2 128
129
12.6
These shape functions are conveniently expressed in terms of the dimensionless natural coordinate = 2x 1, (12.11)
where is the element length. Coordinate varies from = 1 at node 1 (x = 0) to = +1 and at node 2 (x = ). Note that d x /d = 1 2 d /d x = 2/ . The shape functions in terms of are
e 2 1 Nv 1 = 4 (1 ) (2 + ), e N 1 = e Nv 2 = e N 2 = 1 (1 )2 (1 + ), 8 1 (1 + )2 (2 ), 4 1 (1 + )2 (1 ). 8
v1 = 1
(12.12)
= 1
e N2 ()
=1
The curvature that appears in U can be expressed in terms of the nodal displacements by differentiating twice with respect to x : 4 d 2 v e ( ) 4 d Ne e d 2 v e (x ) = 2 = 2 2 u = B ue = N ue . = 2 2 dx d d Here B = N is the 1 4 curvature-displacement matrix B=
Remark 12.3. The 4/
2
(12.13)
3 1
3 + 1 .
(12.14)
factor in (12.13) comes from the differentiation chain rule. If f (x ) is a function of x , and = 2x / 1, noting that d (2/ )/d x = 0 one gets d f (x ) d f ( ) d 2 d f ( ) = = , dx d d x d 0 d 2 f (x ) d (2/ ) d f ( ) 2 d + = dx2 dx d dx d f ( ) d = 4 d 2 f ( ) . (12.15) 2 d 2
12.6. The Finite Element Equations Insertion of (12.12) and (12.14) into the TPE functional specialized to this element, yields the quadratic form in the nodal displacements
e
=1 (ue )T Ke ue (ue )T fe , 2
1
(12.16)
where Ke =
0
E I BT B d x = 129
E I BT B
1
1 2
d ,
(12.17)
1210
ClearAll[EI,l,]; B={{6*,(3*-1)*l,-6*,(3*+1)*l}}/l^2; Ke=(EI*l/2)*Integrate[Ne,{,-1,1}]; Ke=Simplify[Ke]; Print["Ke for prismatic beam:\n",Ke//MatrixForm]; Ke for prismatic beam: 12 EI 6 EI _ 12 EI l3 l l3 6 EI 4 EI _ 6 EI l2 l l2 _ 12 EI _ 6 EI 12 EI l3 l2 l3 6 EI 2 EI _ 6 EI l2 l l2 6 EI l2 2 EI l 6 EI l2 4 EI l ClearAll[q,l,]; Ne={{2*(1-)^2*(2+), (1-)^2*(1+)*l, 2*(1+)^2*(2-),(1+)^2*(1-)*l}}/8; fe=(q*l/2)*Integrate[Ne,{,-1,1}]; fe=Simplify[fe]; Print["fe^T for uniform load q:\n",fe//MatrixForm]; fe^T for uniform load q: lq l 2q l q _ l 2q 2 12 2 12
NT q d x =
NT q
1
1 2
d ,
(12.18)
is the consistent element node force vector. The calculation of the entries of Ke and fe for prismatic beams and uniform load q is studied next. More complex cases are treated in the Exercises. 12.6.1. The Stiffness Matrix of a Prismatic Beam If the bending rigidity E I is constant over the element it can be moved out of the -integral in (12.17): K =
e 1 EI 2
3 1 6 3 + 1 d . (12.19)
EI B B d = 2 1
T
3 1 6 6 1
1
3 + 1 Expanding and integrating over the element yields 36 2 6(3 +1) 36 2 6(3 1) 12 6 12 6 EI 1 (3 1)2 2 6(3 1) (9 2 1) 2 4 2 6 2 2 d = E I Ke = 3 3 12 6 36 2 6(3 +1) 2 1 symm 4 2 symm (3 +1)2 2 (12.20) Although the foregoing integrals can be easily carried out by hand, it is equally expedient to use a CAS such as Mathematica or Maple. For example the Mathematica script listed in the top box of Figure 12.11 processes (12.20) using the Integrate function. The output, shown in the bottom box, corroborates the hand integration result.
1210
1211
12.6.2. Consistent Nodal Force Vector for Uniform Load If q does not depend on x it can be moved out of (12.18), giving 1 (1 )2 (2 + ) 4 1 1 1 (1 )2 (1 + ) 8 e T 1 1 N d = 2 q f = 2q d = 1 2 1 1 4 (1 + ) (2 ) (1 + )2 (1 ) 1 8
1 2
(12.21)
1 6 q 1 . 1 6
This shows that a uniform load q over the beam element maps to two transverse node loads q /2, as may be expected, plus two nodal moments q 2 /12. The latter are called the xed-end moments in the structural mechanics literature.3 The hand result (12.21) can be veried with the Mathematica script of Figure 12.12, in which fe is printed as a row vector to save space.
;;;;;; ;; ;; ;;
1
M
2
(a)
y,v
EI constant
Example 12.1. To see the beam element in action consider the cantilever illustrated in Figure 12.13(a). The
beam is prismatic with constant rigidity E I and span L . It is discretized with a single element as shown in Figure 12.13(b,c,d), and subjected to the three load cases pictured there. Case I involves an applied end moment M , case II a transverse end force P , and case III a uniformly distributed load q over the entire beam. The FEM equations are constructed using the stiffness matrix (12.20) with = L . For the rst two load cases, forces at end node 2 are directly set up from the given loads since no lumping is needed. Applying the support conditions v1 = 1 = 0 gives the reduced stiffness equations EI L3 12 6 L 6 L 4L 2
I v2 2I
I II = M L 2 /(2 E I ) and v2 = P L 3 /(3 E I ), for load cases I and II, respectively. Solving gives the tip deections v2 and the tip rotations 2I = M L / E I and 2I I = P L 2 /(2 E I ). These agree with the analytical values provided by Bernoulli-Euler beam theory. Thus a one-element idealization is sufcient for exactness. The reason is that the analytical deection proles v(x ) are quadratic and cubic polynomials in x for cases I and II, respectively. Both are included in the span of the element shape functions. Displacements v(x ), rotations (x ) and moments M (x ) expressed as functions of x also agree with the analytical solution, as may be expected. 3
Introduced by Hardy Cross in 1930 (long before FEM) as a key ingredient for his moment distribution method. Indeed the title of his famous paper [59] is Analysis of continuous frames by distributing xed-end moments.
;;
A
P
2 q uniform 2
x L
Figure 12.13. Cantilever beam problem for Example 12.1: (a) structure, (b-c): one-element FEM idealizations for three load cases.
0 , M
EI L3
12 6 L
6 L 4L 2
II v2 2I I
P , 0
(12.22)
1211
1212
EI v(x)/(qL4 )
0.2 0.15 0.1 0.05
0.2 0.4 0.6 0.8
EI (x)/(qL 3 )
0.3 0.25 0.2 0.15 0.1 0.05
0.2 0.4 0.6 0.8
M(x)/(qL2 )
0.5 0.4 0.3 0.2 0.1
x/L
x/L
x/L
0.2 0.4 0.6 0.8 1
Figure 12.14. FEM versus analytical solutions for load case III of Example 12.1.
The results for load case III are more interesting since now the exact deection is a quartic polynomial, which lies beyond the span of the FEM shape functions. A dimensionless parameter 0 1 is introduced in the reduced stiffness equations to study the effect of load lumping method on the solution: EI L3 12 6 L 6 L 4L 2
III v2 2I I I
1 2
qL
1 1 6 L
(12.23)
Setting = 1 gives the energy consistent load lumping (12.21) whereas = 0 gives the EbE (here same III q L with zero xed-end moments. The solution of (12.23) is v2 = as NbN) load lumping f 2I I I = 1 2 III 4 3 q L (4 )/(24 E I ) and 2 = q L (3 )/(12 E I ). From this one recovers the displacement, rotation and bending moment over the beam as v I I I (x ) = q L 2 x 2 L (6) 2x , 24 E I I I I (x ) = q L x L (6) 3x , 12 E I M I I I (x ) = qL L (6) 6x . 12 (12.24)
q x 2 (3 L 2 3 L x +x 2 ) , 24 E I
III ex (x ) =
q x (6 L 2 4 L x +x 2 ) , 6 EI
III Mex (x ) =
1 2
q ( L x )2 .
(12.25)
The FEM and analytical solutions (12.24)-(12.25) are graphically compared in Figure 12.14. Deections and rotations obtained with the consistent load lumping = 1 agree better with the analytical solution. In addition the nodal values are exact (a superconvergence result further commented upon in the next Example). For the bending moment the values provided by the EbE lumping = 0 are nodally exact but over the entire beam III (x ). the = 1 solution gives a better linear t to the parabolic function Mex
Example 12.2. The second example involves a simply supported beam under uniform line load q , depicted in Figure 12.15(a). It is prismatic with constant rigidity E I , span L , and discretized with two elements of length L 1 = L (/ + ) and L 2 = L L 1 = L (/ ), respectively. (Ordinarily two elements of the same length / L would be used; the scalar (/, /) is introduced to study the effect of unequal element sizes.)
y,v A
(a)
q (uniform) x L
EI constant B 1
y,v
(b)
x 1 2
2
; ; ;
1212
L1=L(1 2 +)
L2=L(1 2 )
Figure 12.15. SS beam problem for Example 12.2: (a) structure, (b) two-element FEM idealization.
; ;
1213
Using (12.20) and (12.21) to form the stiffness and consistent forces for both elements, assembling and applying the support conditions v1 = v3 = 0, provides the reduced stiffness equations 8L 2 1+2 24 L 2 EI (1+2) 2 L L3 14 +2 0
L (1+2)2 24 1 24 L 1 2 v qL 2 (12) = 2 2 4L 2 L 3 12 3 2
0 8L 2 12 L (12) 24
.
(12.26)
Solving for the lateral displacement of node 2 gives v2 = q L 4 (5 24 2 + 16 4 )/(384 E I ). The exact deection is v(x ) = q L 4 ( 2 3 + 4 )/(24 E I ) with = x / L . Replacing x = L 1 = L (/ + ) yields exact = q L 4 (5 24 2 + 16 4 )/(384 E I ), which is the same as the FEM result. Likewise 2 is exact. v2 The result seems prima facie surprising. First, since the analytical solution is a quartic polynomial in x we have no reason to think that a cubic element will be exact. Second, one would expect accuracy deterioration as the element sizes differ more and more with increasing . The fact that the solution at nodes is exact for any combination of element lengths is an illustration of superconvergence, a phenomenon already discussed in 11.5. A general proof of nodal exactness is given in 13.7, but it does require advanced mathematical tools. Note that displacements and rotations inside elements will not agree with the exact one; this can be observed in Figure 12.14(a,b) for load case III of the previous example.
y,v (a) A x B
EI constant
q(x)=w constant
; ;
L1= 1 L 2
L y,v (b) 1 x 1 2 w
2
L1= 1 L 2
;; ;;
; ;
(c)
0.1 0.2 0.3
L4= 1 L 2
Figure 12.16. Continuum beam problem for Example 12.3, (a): structure, (b) two-element FEM model of half beam, (c) scaled external energy of FEM model as function of .
Example 12.3. (Adapted from a driven-tank experiment by Patrick Weidman). This example displays the
advantages of symbolic computation for solving a problem in geometric design: optimal location of supports. The prismatic continuous beam shown in Figure 12.16(a) is free at ends A and E, and simply supported at B, C and D. The beam has total span L and constant bending rigidity E I . It is loaded by a uniform distributed L from the left load q (x ) = w . Support C is at midspan whereas B and D are at distances L 1 = L 4 = 1 2 and right free ends, respectively. Here 0 < 1 is a design parameter to be determined as discussed later. Since the problem is symmetric about midspan C only one half of the structure, say AC, need to be discretized. The nite element model of this portion is shown in Figure 12.16(b). It has two beam elements and three nodes
;; ;;
1213
0.4
0.5
1214
placed at A, B and C, respectively. Element lengths depend on the design parameter , which is carried along as a variable. The six degrees of freedom are collected in u = [ v1 1 v2 2 v3 3 ]T . The master stiffness equations are 6L 24 0 0 3 2 6L L2 0 0 2 6 L (12) 6L 24 6 L 24 13 24 4 E I 3 2 3 3 2 2 3 2 2 2 L 3 6L 6 L (12) L 2L L2 6L 2 2 2 2 24 6 L 6 24 0 0 3 2 L 3 2 6L L2 2L 2 0 0 6L 2 2 3 6L 2 6L 2 2L 2
24
v1 0 L 2 0 1 12 fr v wL 1 2 2 = + 4 L (2 1) 0 2 12 v3 f 3r 3 mr L 2 3 12
(12.27) in which = 1 . Note that reaction forces are carefully segregated in (12.27) to simplify application of the general recovery technique discussed in 3.4.3. The support BCs are v2 = v3 = 3 = 0, where the latter comes from the symmetry condition at C. Removing those freedoms provides the reduced stiffness equations
24 6 L 6 L 3 2 2 4E I 6L 2L 2 L 2 2 L3 2 2
6L 2 L Solving yields v1 = wL4 (1 + )3 2 , 768 E I 1 =
v1 w L L 2 1 = . 12 4 L (2 1) 2 2L 12
(12.28)
wL3 (1 + )3 2 , 384 E I
2 =
The complete solution is u = [ v1 1 0 2 0 0 ]T . Inserting into (12.27) and solving for reactions gives fr 2 = w L 3 + 2 + 2 , 16 fr 3 = w L 5 10 2 , 16 mr 3 = wL2 (1 2 2 ). 32 (12.30)
whence the support reactions follow as R B = fr 2 and RC = 2 fr 3 . It remains to nd the best . Of course best depends on the optimality criterion. Four choices are examined below. ()/(18432 E I ), Minimum External Energy. The external energy at equilibrium is W () = fT u = w 2 L 5 W 2 3 4 5 in which W () = 1 5 2 + 26 + 5 + 3 . Minimizing W with respect to may be interpreted () over as nding the stiffest structure (in the energy sense) under the given load vector f. A plot of W 1 0 2 clearly displays a minimum at 0.27 as shown in Figure 12.16(c). Solving the quartic equation /d = 0 gives one positive real root in the range [0, 1), which to 5 places is best = 0.26817. dW Equal Reactions. A second choice is to require that supports at B and C take the same load: R B = RC (note that, because of symmetry, R D = R B ). Setting fr 2 = 2 fr 3 with their expressions taken from (12.30), yields 1 2 2 2 3 + 2 + = 10 20 2 , or 7 22 3 = 0. This quadratic has the roots = 3 (11 142). The positive real root best = 0.30546 makes R B = RC = R D = w L /3, as may be expected. L ], with Minimum Relative Deection. Consider two sections located at xi and x j , in which {xi , x j } [0, 1 2 lateral displacements vi = v(xi ) and v j = v(x j ), respectively. The maximum relative deection is dened as max v max ji () = max |v j vi | for a xed . We seek the [0, 1) that minimizes v ji (). The computations are far more complex than for the previous two criteria and are the subject of Exercise 12.11. Result: the best
1214
1215
12.
References
is the positive real root of 4 + 11 81 2 49 3 47 4 = 0, which to 5 places is best = 0.26681. If this < w L 4 /(67674 E I ). value is adopted, the relative deection does not exceed vimax j Minimum Absolute Moment. Let M (x , ) denote the bending moment function recovered from the FEM L ]. We solution for a xed . The maximum absolute moment is M max () = max | M (x , )| for x [0, 1 2 seek an [0, 1) that minimizes it. This is the topic of Exercise 12.12. This problem is less well posed than the previous one because M (x , ) varies linearly over each element, is nonzero at node 1 and discontinous at node 2. On the other hand, the exact bending moment varies parabolically, is zero at node 1 and continuous at node 2. Result: using the FEM-recovered M (x , ) and taking the average M at node 2, one nds that the best is the positive root of 2 4 15 2 = 0, or best = 0.25540, for which M max < w L 2 /589. The optimal solution using the exact moment distribution, however, is quite different. This is an intrinsic weakness of displacement-based FEM since internal forces are obtained by differentiation, which boosts errors. To get a better result a ner mesh would be needed. In summary, the optimal from the foregoing criteria varies between 0.255 to 0.306. As a reasonable compromise an engineer could pick best 0.28. Notes and Bibliography The Bernoulli-Euler (BE) beam model synthesizes pioneer work by Jacob and Daniel Bernoulli as well as that of Leonhard Euler in the XVIII Century. Although the model was rst enunciated by 1750, it was not applied in structural design and analysis until the second half of the XIX Century. While Galileo Galilei is credited with rst attempts at a theory, recent studies [14] argue that Leonardo da Vinci made crucial observations a century before Galileo. However, da Vinci lacked Hookes law and calculus to complete the theory. A comprehensive source of stiffness and mass matrices of plane and spatial beams is the book by Przemieniecki [205]. The derivation of stiffness matrices is carried out there using differential equilibrium equations rather than energy methods. This was in fact the common practice before 1962, as inuenced by the use of transfer matrix methods [194] on the limited memory computers of the time. Results for prismatic elements, however, are identical. Energy derivations were popularized by Archer [11,12], Martin [170] and Melosh [178,179]. References Referenced items have been moved to Appendix R.
1215
1216
Use of Mathematica or similar CAS tool is recommended since the integrals are time consuming and error prone. Mathematica hint: write EI = EI1*(1- )/2 + EI2*(1+ )/2; (E12.2)
and keep EI inside the argument of Integrate. Check whether you get back (12.20) if EI=EI1=EI2. If you use Mathematica, this check can be simply done after you got and printed the tapered beam Ke, by writing ClearAll[EI]; Ke=Simplify[ Ke/.{EI1->EI,EI2->EI}]; and printing this matrix.4
EXERCISE 12.2 [A/C:20] Use (12.18) to derive the consistent node force vector fe for a Hermitian beam
Again use of a CAS is recommended, particularly since the polynomials to be integrated are quartic in , and hand computations are error prone. Mathematica hint: write q = q1*(1- )/2 + q2*(1+ )/2; (E12.4)
and keep q inside the argument of Integrate. Check whether you get back (12.21) if q1 = q2 = q (See previous Exercise for Mathematica procedural hints).
EXERCISE 12.3 [A:20] Obtain the consistent node force vector fe of a Hermitian beam element subject to
a transverse point load P at abscissa x = a where 0 a . Use the Diracs delta function expression q (x ) = P (a ) and the fact that for any continuous function f (x ), 0 f (x ) (a ) d x = f (a ) if 0 a . Check the special cases a = 0 and a = .
EXERCISE 12.4 [A:25] Derive the consistent node force vector fe of a Hermitian beam element subject to a
linearly varying z -moment m per unit length, positive CCW, dened by the law m (x ) = m 1 (1 )/2 + m 2 (1 + )/2. Use the fact that the external work per unit length is m (x )(x ) = m (x ) v (x ) = (ue )T (d N/d x )T m (x ). For arbitrary m (x ) show that this gives f =
e 0
NT m dx = x
1 1
NT 2 m
1 1 2
d =
1
T N m d ,
(E12.5)
T where N denote the column vectors of beam shape function derivatives with respect to . Can you see a shortcut that avoids the integral altogether if m is constant?
EXERCISE 12.5 [A:20] Obtain the consistent node force vector fe of a Hermitian beam element subject to
a concentrated moment (point moment, positive CCW) C applied at x = a . Use the expression (E12.5) in which m (x ) = C (a ), where (a ) denotes the Diracs delta function at x = a . Check the special cases a = 0, a = and a = /2.
4
ClearAll[EI] discards the previous denition (E12.2) of EI; the same effect can be achieved by writing EI=. (dot).
1216
1217
EXERCISE 12.6 [A/C:25] Consider the one-dimensional Gauss integration rules.5
1
Exercises
One point :
1 1
. f ( ) d = 2 f (0).
(E12.6)
Two points:
1 1
(E12.7) (E12.8)
Three points:
1
d ,
1 1
d ,
1
2 d , . . .
(E12.9)
until the rule fails. In this way verify that rules (E12.6), (E12.7) and (E12.8) are exact for polynomials of degree up to 1, 3 and 5, respectively. (Labor-saving hint: for odd monomial degree no computations need to be done; why?).
EXERCISE 12.7 [A/C:25] Repeat the derivation of Exercise 12.1 using the two-point Gauss rule (E12.7) to
evaluate integrals in . A CAS is recommended. If using Mathematica you may use a function denition to 1 save typing. For example to evaluate 1 f ( ) d in which f ( ) = 6 4 3 2 + 7, by the 3-point Gauss rule (E12.8), say f[ ]:=6 ^4-3 ^2+7; int=Simplify[(5/9)*(f[-Sqrt[3/5]]+f[Sqrt[3/5]])+(8/9)*f[0]]; and print int. To form an element by Gauss integration dene matrix functions in terms of , for example Be[ ], or use the substitution operator /., whatever you prefer. Check whether one obtains the same answers as with analytical integration, and explain why there is agreement or disagreement. Hint for the explanation: consider the order of the polynomials you are integrating over the element.
EXERCISE 12.8 [A/C:25] As above but for Exercise 12.2. EXERCISE 12.9 [A/C:30] Derive the Bernoulli-Euler beam stiffness matrix (12.20) using the method of
differential equations. To do this integrate the homogeneous differential equation E I v = 0 four times over a cantilever beam clamped at node 1 over x [0, ] to get v(x ). The process yields four constants of integration C1 through C4 , which are determined by matching the two zero-displacement BCs at node 1 and the two force BCs at node 2. This provides a 2 2 exibility matrix relating forces and displacements at node j . Invert to get a deformational stiffness, and expand to 4 4 by letting node 1 translate and rotate.
EXERCISE 12.10 [C:20] Using Mathematica, repeat Example 12.2 but using EbE lumping of the distributed force q . (It is sufcient to set the nodal moments on the RHS of (12.26) to zero.) Is v2 the same as the exact exact as function of , and draw conclusions. analytical solution? If not, study the ratio v2 /v2 EXERCISE 12.11 [C:25] For the continuous beam of Example 12.3, verify the results given there for the optimal that minimizes the maximum relative deection. Plot the deection prole when = best . EXERCISE 12.12 [C:25] For the continuous beam of Example 12.3, verify the results given there for the optimal that minimizes the absolute bending moment. Plot the moment diagram when = best .
5
1217
Introduction to FEM
12
IFEM Ch 12 Slide 1
Introduction to FEM
IFEM Ch 12 Slide 2
Introduction to FEM
Neutral surface
Compressive stress
Tensile stress
IFEM Ch 12 Slide 3
Introduction to FEM
Beam Configuration
Spatial (General Beams) Plane (This Chapter)
Beam Models
Bernoulli-Euler Timoshenko (more advanced topic: described in Chapter 13 but not covered in course)
IFEM Ch 12 Slide 4
Introduction to FEM
y, v q(x) x, u Neutral surface y, v Beam cross section Neutral axis Symmetry plane
IFEM Ch 12 Slide 5
Introduction to FEM
Simply Supported
Cantilever
IFEM Ch 12 Slide 6
Introduction to FEM
2v u d 2v = y 2 = y 2 = y e= x x dx d 2v = Ee = E y 2 = Ey dx
M=EI
Plus equilibrium equation M'' = q (replaced by MPE principle in FEM)
IFEM Ch 12 Slide 7
Introduction to FEM
P'(x+u,y+v) y, v
x, u
IFEM Ch 12 Slide 8
Introduction to FEM
Displacement BCs
Transverse displacements
v(x) = v'' M = EI
Constitutive
q(x)
Kinematic
M''=q Equilibrium
Curvature
(x)
Bending moment
Force BCs
M(x)
IFEM Ch 12 Slide 9
Introduction to FEM
U=
=
1 2
x x ex x d V =
V L
L 1 2 0
M dx =
L 1 2
EI
0
2v x2
dx
1 2
E I 2 dx
W=
0
qv d x
IFEM Ch 12 Slide 10
Introduction to FEM
2 v2 v1 1
v 1 ue = v2 2
1
IFEM Ch 12 Slide 11
Introduction to FEM
v(x)
v(x)
IFEM Ch 12 Slide 12
Introduction to FEM
2 v2
v1 1
E, I
2
x
x, u
P(x,y)
IFEM Ch 12 Slide 13
Introduction to FEM
v1 e e 1 N 2 ]v = N u 2 2 = 2x 1
2
Nve 2() =
1 4
(1 + ) (2 )
2
Ne 1() =
1 8
(1 )2 (1 + )
e N2 () = 1 8 (1 + ) (1 )
IFEM Ch 12 Slide 14
Introduction to FEM
1 4
(1 ) (2 + )
2
1 8
(1 )2 (1 + ) (1 + ) (2 )
2 2
1 4
e N2 () = 1 (1 + ) (1 ) 8
=1
IFEM Ch 12 Slide 15
Introduction to FEM
v1 1 v2 2
2 d = N ue 2 dx def
= B ue
IFEM Ch 12 Slide 16
Introduction to FEM
d f () 4 d 2 f() = 2 d d
B=
3 1 6
3 + 1
IFEM Ch 12 Slide 17
Introduction to FEM
1 2
ue
K ue ue
fe
we get
1
=
0
E I BT B d x =
E I BT B
1
1 2
fe =
0
NT q d x =
NT q
1
1 2
IFEM Ch 12 Slide 18
Introduction to FEM
K
e
EI = 3 2
1
1
36 2
6 (3 1)` (3 1) 2
2
36 2 6(3 1) 36 2
d 6(3 + 1) (9 2 1) (3 + 1) 2
2 2
6(3 + 1)
symm 12 EI = 3 symm 6 4 2 12 6 12
6 2 2 6 4 2
IFEM Ch 12 Slide 19
Introduction to FEM
Mathematica Script for Symbolic Computation of Prismatic Plane Beam Element Stiffness
ClearAll[EI,l,]; B={{6*,(3*-1)*l,-6*,(3*+1)*l}}/l^2; Ke=(EI*l/2)*Integrate[Transpose[B].B,{,-1,1}]; Ke=Simplify[Ke]; Print["Ke for prismatic beam:"]; Print[Ke//MatrixForm];
Ke for prismatic beam:
EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l EI l
IFEM Ch 12 Slide 20
Introduction to FEM
f =
e
1 1 q 2 1
N d = 1 q 2 =q
1 2 1 12 1 2 1 12
IFEM Ch 12 Slide 21
Introduction to FEM
Mathematica Script for Computation of Consistent Node Force Vector for Uniform q
ClearAll[q,l,] Ne={{2*(1-)^2*(2+), (1-)^2*(1+)*l, 2*(1+)^2*(2-),-(1+)^2*(1-)*l}}/8; fe=(q*l/2)*Integrate[Ne,{,-1,1}]; fe=Simplify[fe]; Print["fe^T for uniform load q:"]; Print[fe//MatrixForm];
fe^T for uniform load q:
lq l q lq l q
IFEM Ch 12 Slide 22
1215
Solutions to Exercises
Homework Exercises for Chapter 12 - Variational Formulation of Plane Beam Element Solutions
EXERCISE 12.1 A Mathematica script for fe by analytical integration is shown in Figure E12.1.
ClearAll[EI,EIi,EIj,Le, , ]; Le= ; Be={{6* ,(3* -1)*Le,-6* ,(3* +1)*Le}}; EI=EI1*(1- )/2+EI2*(1+ )/2; Ke=1/(2*Le^3)*Integrate[EI*Transpose[Be].Be,{ ,-1,1}]; Ke=Simplify[Ke]; Print["Ke for variable xsec beam:\n", Ke//MatrixForm]; ClearAll[EI]; Ke=Simplify[Ke/.{EI2->EI,EI2->EI}]; Print["Ke for EI1=EI2=EI is ", Ke//MatrixForm];
Ke for variable xsec beam: 6 EI1 EI2 2 2 EI1 EI2
3 2
6 EI1 EI2
3
2 EI1 2 EI2
2
2 2 EI1 EI2
2
2 2 EI1 EI2
2
6 EI1 EI2
3
6 EI1 EI2
3
2 EI1 2 EI2
2
EI1 EI2
2 EI1 2 EI2
2
EI1 3 EI2
Ke = 1
3
6( E I1 + E I2 )
symm
2(2 E I1 + E I2 ) (3 E I1 + E I2 ) 2
6( E I1 + E I2 ) 2(2 E I1 + E I2 ) 6( E I1 + E I2 )
2( E I1 + E I2 ) ( E I1 + E I2 ) 2 . 2(2 E I1 + 2 E I2 ) ( E I1 + 2 E I2 ) 2
(E12.10)
The print output of the check E I1 = E I2 = E I is omitted to save space, but it reproduces the matrix (12.20).
EXERCISE 12.2 A Mathematica script for fe by analytical integration is shown in Figure E12.2.
ClearAll[q,q1,q2, , ]; Le= ; Ne={2*(1- )^2*(2+ ), (1- )^2*(1+ )*Le, 2*(1+ )^2*(2- ),-(1+ )^2*(1- )*Le}/8; q=q1*(1- )/2+q2*(1+ )/2; fe=Simplify[ (Le/2)*Integrate[q*Ne,{ ,-1,1}] ]; Print["fe^T for lin varying load q:\n",fe]; ClearAll[q]; fe=Simplify[fe/.{q1->q,q2->q}]; Print["check for q1=q2=q: ",fe]; fe^T for lin varying load q: 1 1 1 1 { 20 (7 q1 + 3 q2) (3 q1 + 2 q2) 2 20 (3 q1 + 7 q2) 60 (2 q1 + 3 q2) 60
Figure E12.2. Script to solve Exercise 12.2
1215
1216
Transcribing the result: fe = [ 3(7q1 + 3q2 ) (3q1 + 2q2 ) 3(3q1 + 7q2 ) (2q1 + 3q2 ) ]T . (E12.11)
60
The output of the check qi = q j = q is omitted to save space, but it does reproduce (12.21).
EXERCISE 12.3 Following the hint, the shape function matrix is evaluated at x = a , or = 2a / 1:
fe = P NT
2a / 1
P
2
(a )2 (2a + )
a (a )2
a 2 (2a 3 )
a 2 (a )
(E12.12)
distributed moment m .
ClearAll[m,Le, , ]; Le= ; Ne={2*(1- )^2*(2+ ), (1- )^2*(1+ )*Le, 2*(1+ )^2*(2- ),-(1+ )^2*(1- )*Le}/8; m=m1*(1- )/2+m2*(1+ )/2; fe=Integrate[m*D[Ne, ],{ ,-1,1}]; fe=Simplify[fe]; Print["fe: ", fe]; fe: { 1 (m1 + m2) 2
1 12
(m1 m2)
1 2
(m1 + m2)
1 (m1 12
m2)
This gives 1 (E12.13) [ 6(m 1 + m 2 ) (m 1 m 2 ) 6(m 1 + m 2 ) (m 1 m 2 ) ]T . 12 There is a shortcut for uniform m ; that is, m 1 = m 2 = m . Moving m out of the integral (E12.5) gives fe =
1
fe = m
1
T N d = m NT
=1 =1
= m [ 1
0 ]T .
(E12.14)
fe = C
d NT dx
=
x a
2C d NT d
=
2a / 1
C
2
6a (a )
( 3a )( a )
6a ( a )
a (3a 2 )
1 2
If a = 0 and a = , fe reduces to [ 0 C 0 0 ]T and [ 0 0 0 C ]T , respectively, as expected. If a = C [ 3/(2 ) 1/4 3/(2 ) 1/4 ]T , which is not that obvious.
(E12.15) we get
EXERCISE 12.6 The results of this exercise are collected on Table 12.1. The rules with 1, 2 and 3 points fail for monomial degrees 2, 4 and 6, respectively, and are exact for degrees up to one less. The property is extendible to any rule order: a Gauss rule with p points integrates exactly polynomials of degree 2 p 1 or less, as proven in texts on numerical analysis. Note that since the rules are symmetric about x = 0 they are exact for any odd function about x = 0 because the integral of any such function from 1 to 1 is zero. Consequently odd-degree monomials, such as or 3 , are integrated exactly by all rules.
1216
1217
Table 12.1. Results From Exercise 12.6 Monomial degree 1 2 3 4 5 6
2 3
Solutions to Exercises
0 Exact One-point rule (E12.6) Two-point rule (E12.7) Three-point rule (E12.8)
2 0 2 0 2 0 2 0
0 0 0
2 5 2 9 2 5
2 7
0
2 3 2 3
6 25
EXERCISE 12.7 A Mathematica script to compute Ke by two-point Gauss rule is shown in Figure E12.4.
This result reproduces exactly (E12.10) because the polynomials being integrated for linearly varying E I are cubic in (B, BT and E I are linear in ). From Exercise 12.6, the 2-point Gauss rule integrates exactly polynomials of order up to and including 3.
ClearAll[EI,EI1,EI2, , ]; Le= ; Be={{6* ,(3* -1)*Le,-6* ,(3* +1)*Le}}; EI=EI1*(1- )/2+EI2*(1+ )/2; Ke1=(1/(2*Le^3))*(EI*Transpose[Be].Be)/. -> Sqrt[3]/3; Ke2=(1/(2*Le^3))*(EI*Transpose[Be].Be)/. ->-Sqrt[3]/3; Ke=Simplify[Ke1+Ke2]; Print["2-Gauss-pt Ke for var xsec beam:\n ",Ke//MatrixForm]; 2-Gauss-pt Ke for var xsec beam:
6 EI1 EI2
3
2 2 EI1 EI2
2
6 EI1 EI2
3
2 EI1 2 EI2
2
2 2 EI1 EI2
2
2 2 EI1 EI2
2
6 EI1 EI2
3
6 EI1 EI2
3
2 EI1 2 EI2
2
EI1 EI2
2 EI1 2 EI2
2
EI1 3 EI2
EXERCISE 12.8 A Mathematica script to compute Ke by two-point Gauss rule is shown in Figure E12.5.
ClearAll[q,q1,q2, , ]; Le= ; Ne={2*(1- )^2*(2+ ), (1- )^2*(1+ )*Le, 2*(1+ )^2*(2- ),-(1+ )^2*(1- )*Le}/8; q=q1*(1- )/2+q2*(1+ )/2; fe1=(Le/2)*(Ne*q)/. -> Sqrt[3]/3; fe2=(Le/2)*(Ne*q)/. ->-Sqrt[3]/3; fe=Simplify[fe1+fe2]; Print["2-Gauss-pt fe^T for var load q:\n ",fe]; 2-pt Gauss for var load q: 1 1 { 36 (13 q1 + 5 q2) (2 q1 + q2) 36
1 36
(5 q1 + 13 q2)
1 36 (q1 + 2 q2)
This result is different from (E12.11) because the polynomials being integrated for linearly varying q are quartic in , and the 2-point Gauss rule is not exact for that order. But for uniform q the results would be the same.
1217
1218
r = 4(1 4 2 )/(5 4 2 ). For = 0 the ratio is 4/5 and the FEM result is 20% in error. As grows the error increases, for example if = 1/4, r = 12/19 = 0.6317 and the error is over 36%.
EXERCISE 12.10 The FEM result is v2 = q L 4 (1 4 2 )2 /(96 E I ). The ratio to the exact solution is
1218
13
131
132
TABLE OF CONTENTS
Page
13.1. Introduction 13.2. Generalized Interpolation 13.2.1. Legendre Polynomials . . . . . . . . . . . 13.2.2. Generalized Stiffnesses . . . . . . . . . . . 13.2.3. Transforming to Physical Freedoms: BE Model . . . 13.2.4. Transforming to Physical Freedoms: Shear-Flexible Model 13.2.5. Hinged Plane Beam Element . . . . . . . . . 13.2.6. Timoshenko Plane Beam Element . . . . . . . . 13.2.7. Shear-Curvature Recovery . . . . . . . . . . 13.2.8. Beam on Elastic Supports . . . . . . . . . . . 13.3. Interpolation with Homogeneous ODE Solutions 13.3.1. Exact Winkler/BE-Beam Stiffness . . . . . . . 13.4. Equilibrium Theorems 13.4.1. Self-Equilibrated Force System . . . . . . . . . 13.4.2. Handling Applied Forces . . . . . . . . . . 13.4.3. Flexibility Equations . . . . . . . . . . . . 13.4.4. Rigid Motion Injection . . . . . . . . . . . 13.4.5. Applications . . . . . . . . . . . . . . . 13.5. Flexibility Based Derivations 13.5.1. Timoshenko Plane Beam-Column . . . . . . . 13.5.2. Plane Circular Arch in Local System . . . . . . . 13.5.3. Plane Circular Arch in Global System . . . . . . 13.6. *Accuracy Analysis 13.6.1. *Accuracy of Bernoulli-Euler Beam Element . . . . 13.6.2. *Accuracy of Timoshenko Beam Element . . . . . 13. Notes and Bibliography . . . . . . . . . . . . . . . . . . . . 13. References . . . . . . . . . . . . . . . . . . . 13. Exercises . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
133 133 133 134 134 135 135 136 137 139 1311 1311 1316 1316 1316 1317 1319 1319 1320 1320 1322 1325 1326 1326 1329 1329 1330 1331
132
133
13.1.
Introduction
This Chapter develops special one-dimensional elements, such as thick beams, arches and beams on elastic foundations, that require mathematical and modeling resources beyond those presented in Chapters 1112. The techniques used are less elementary,1 and may be found in books on Advanced Mechanics of Materials, e.g. [31,34]. Readers are expected to be familiar with ordinary differential equations and energy methods. The Chapter concludes with beam accuracy analysis based on the modied equation method. All of this Chapter material would be normally bypassed in an introductory nite element course. It is primarily provided for offerings at an intermediate level, for example a rst graduate FEM course in Civil Engineering. Such courses may skip most of Part I as being undergraduate material. 13.2.
Generalized Interpolation
For derivation of special and C 0 beam elements it is convenient to use a transverse-displacement cubic interpolation in which the nodal freedoms v1 , v2 , 1 and 2 are replaced by generalized coordinates c1 to c4 : v( ) = Nc1 c1 + Nc2 c2 + Nc3 c3 + Nc4 c4 = Nc c. (13.1)
Here Nci ( ) are generalized shape functions that satisfy the completeness requirement discussed in Chapter 19. Nc is a 14 matrix whereas c is a column 4-vector. Formula (13.1) is a generalized interpolation. It includes the Hermite interpolation (12.1012.12) as an instance when c1 = v1 , c2 = v1 , c3 = v2 and c4 = v2 . 13.2.1. Legendre Polynomials An obvious generalized interpolation is the ordinary cubic polynomial v( ) = c1 + c2 + c3 2 + c4 3 , but this turns out not to be particularly useful. A more seminal expression is v( ) = L 1 c1 + L 2 c2 + L 3 c3 + L 4 c4 = L c, where the L i are the rst four Legendre polynomials L 1 ( ) = 1, L 2 ( ) = , L 3 ( ) = 1 (3 2 1), 2 L 4 ( ) = 1 (5 3 3 ). 2 (13.3) (13.2)
Here c1 through c4 have dimension of length. Functions (13.3) and their rst two -derivatives are plotted in Figure 13.1. Unlike the shape functions (12.12), the L i have a clear physical meaning: L 1 Translational rigid body mode. L 2 Rotational rigid body mode. L 3 Constant-curvature deformation mode, symmetric with respect to = 0. L 4 Linear-curvature deformation mode, antisymmetric with respect to = 0. These properties are also shared by the standard polynomial c1 + c2 + c3 2 + c4 3 . What distinguishes the set (13.3) are the orthogonality properties Q0 =
0
Q2 =
0
(L )T L d x = (.)
48
3
diag [ 0 0 3 25 ] ,
Q3 =
14400
5
diag [ 0 0 0 1 ] ,
in which
(13.4) Qn is called the covariance matrix for the n th derivative of the Legendre polynomial interpolation. The rst-derivative covariance Q1 = 0 (L )T L d x is not diagonal, but this matrix is not used here.
1
d (.) . dx
They do not reach, however, the capstone level of Advanced Finite Element Methods.
133
134
15
L3
1
L4
0.5
L1 L2
0.5 1
0.5
dL 2 /d
1 0.5
dL4 /d dL /d 3 4
2 0.5 1
d 2L3 /d 2
1 0.5
10 5 5 10 15
d 2L4 /d 2
0.5
0.5 1
dL1 /d
Figure 13.1. The Legendre polynomials and their rst two -derivatives shown over [1, 1]. Those interpretable as beam rigid body modes ( L 1 and L 2 ) in black; deformational modes ( L 3 and L 4 ) in color.
Remark 13.1. The notation (13.2)(13.3) is FEM oriented. L 1 through L 4 are called P0 through P3 in the mathematical
literature; e.g. Chapter 22 of the handbook [1]. The general denition for n = 0, 1 . . . is
n
L n +1 ( ) Pn ( ) =
k =0
n k
n 1 k
1 2
1 2n
(13.5) n . They can where n is the binomial coef cient. Legendre polynomials are normalized by P ( 1 ) = 1, P ( 1 ) = ( 1 ) n n k also be indirectly dened by generating functions such as
k =0
n k
( 1)n k ( +1)k =
1 2n
n /2 k =0
n k
2n 2k n 2k . n
Pn ( ) z =
n k =0
1 1 2 z + z 2
or alternatively
k =0
1 Pn ( ) z n = e x z J0 (z n!
1 2 ).
(13.6)
They can also be dened through a 3-term recurrence relation: (n + 2) Pn +2 ( ) (2n + 3) Pn +1 ( ) + (n + 1) Pn ( ) = 0 started with P0 ( ) = 1 and P1 ( ) = . One important application of these polynomials in numerical analysis is the construction of one-dimensional Gauss integration rules: the abscissas of the n -point rule are the zeros of L n +1 ( ) = Pn ( ).
13.2.2. Generalized Stiffnesses The beam stiffness matrix expressed in terms of the ci is called a generalized stiffness. Denote the beam bending and shear rigidities by R B and R S , respectively. Then Kc = KcB + KcS , where KcB comes from the bending energy and KcS from the shear energy. For the latter is its assumed that the mean shear distortion at a cross section is = 2 v , where is a dimensionless coefcient that depends on the mean-shear model used. Then KcB =
0
R B (L ) T L d x ,
KcS =
0
RS 2
(L ) T L d x .
(13.7)
In the case of a Bernoulli-Euler (BE) beam, the shear contribution is dropped: Kc = KcB . Furthermore if the element is prismatic, R B = E I is constant. If so KcS = R B and KcB = E I Q2 , where Q2 is the second diagonal matrix in (13.4). With view to future use it is convenient to differentiate between symmetric and antisymmetric bending rigidities R Bs and R Ba , which are associated with the responses to modes L 3 and L 4 , respectively. Assuming R Bs and R Ba to be uniform along the element we get Kc = KcBs + KcBa , KcBs = 144 R Bs
3
diag [ 0 0 1 0 ] ,
KcBa =
1200 R Ba
3
diag [ 0 0 0 1 ] ,
(13.8)
If shear exibility is accounted for, the contribution KcS of (13.7) is kept. Assuming R S to be constant over the element, Kc is split into 3 contributions (two bending and one shear): Kc = KcBs + KcBa + KcS , with KcS = R S 2
4
Q3 =
14400 R S 2
diag [ 0 0 0 1 ] .
(13.9)
134
135
13.2.3. Transforming to Physical Freedoms: BE Model For a BE beam model, the generalized coordinates ci of (13.2) can be connected to the physical DOFs by
v1 1 1 0 v = 1 2 2 0
1 1 1 c1 2/ 6/ 12/ c2 , 1 1 1 c3 c4 2/ 6/ 12/
c1 30 1 36 c2 c = 0 60 3 c4 6
5 30 3 36 5 0 3 6
5 v1 3 1 . 5 v2 2 3
(13.10)
1 In compact form: ue = G B c and c = H B ue , with H B = G B . Here 1 v1 and 2 v2 , which reects the fundamental plane sections remain plane kinematic assumption of the BE model. The physical stiffness is
Ke = H T B KcBs + KcBa
12 Ra 1 6 Ra HB = 3 12 Ra 6 Ra
6 Ra (3 Ra + Rs ) 6 Ra (3 Ra Rs )
12 Ra 6 Ra 12 Ra 6 Ra
6 Ra (3 Ra Rs ) 6 Ra (3 Ra + Rs )
(13.11)
If Rs = Ra = E I the well known stiffness matrix (12.20) is recovered, as can be expected. The additional freedom conferred by (13.11) is exhibited later in two unconventional applications. 13.2.4. Transforming to Physical Freedoms: Shear-Flexible Model A shear exible beam has mean shear distortion = 2 v . If is constant and v( ) interpolated by (13.2), v = 120 c4 / 3 . Thus = 120 c4 / is constant over the element. The end rotational freedoms become 1 = v1 + and 2 = v2 + . Using = 12 to simplify the algebra, the transformations (13.10) change to v1 1 v2 5 3 2 1+ (13.12) 1 e e u = H u . Transforming K of (13.9) to physical freedoms yields In compact form, ue = G S c and c = G S c S the stiffness used to construct the Timoshenko beam element in 13.2.6:
1 v1 0 1 v = 1 2 2 0
1 1 1 2 6 12+10 1 1 1 2 6 12+10
30 c1 c1 36 +30 c2 c2 1 1 + , = c3 c3 60 0 6 c4 c4 1+
5 3 1+ 5 3 1+
30 36+30 1+ 0 6 1+
5 3 1+
Ke = H T S Kc H S =
R Bs
0 0 0 0
0 0 1 0 0 0 1 0
0 1 12 R Ba + R S 2 + 0 4 3 (1 + )2 1
4 2 4 2
2
2
2
2
4 2 4 2
2
2
. (13.13) 2
2
y
13.2.5. Hinged Plane Beam Element The two-node prismatic plane BE beam element depicted in Figure 13.2 has a mechanical hinge at midspan ( = 0). The cross sections on both sides of the hinge can rotate respect to each other. The top gure also sketches a fabrication method sometimes used in short-span pedestrian bridges. Gaps on either side of the hinged section cuts are lled with a bituminous material that permits slow relative rotations. Both the curvature and the bending moment M must vanish at midspan. But in a element built via cubic interpolation of v(x ), = v must vary linearly in both and x .
hinge
1
/2 /2
2 x
Figure 13.2. Beam element with hinge located at midspan. The top gure sketches a hinge fabrication method.
135
136
Consequently the mean curvature, which is controlled by the Legendre function L 2 (shown in blue on Figure 13.1) must be zero. The kinematic constraint of zero mean curvature is enforced by setting the symmetric bending rigidity R Bs = 0 whereas the antisymmetric bending rigidity is the normal one: R Ba = E I . Plugging into (13.11) yields 4 3 E I 2 Ke = 3 4 2
2
2
2
2
4 2 4 2
2
2
3E I
3
[2 2 ]
= 2
2
. (13.14)
This matrix has rank one, as it can be expected from the last (dyadic) expression in (13.14). Ke has one nonzero eigenvalue: 6 E I (4 + 2 )/ 3 , and three zero eigenvalues. The eigenvector associated with the nonzero eigenvalue pertains2 to the antisymmetric deformational mode L 3 . Matrix (13.14) can be derived by more sophisticated methods (e.g., mixed variational principles) but the present technique is the most expedient one.
Example 13.1.
EI constant
This example deals with the prismatic continuous beam shown in Figure 13.3(a). This has two spans with lengths L and L , respectively, where is a design parameter, and is subjected to uniform load q0 . The beam is free, simple supported and xed at nodes 1, 2 and 3, respectively. There is a hinge at the center of the 23 span. Of interest is the design question: for which > 0 is the tip deection at end 1 zero? The beam is discretized with two elements: (1) and (2), going from 1 to 2 and 2 to 3, respectively, as shown in the gure. The stiffnesses for elements (1) and (2) are those of (12.20) and (13.14), respectively, whereas (12.21) is used to build the consistent node forces for both elements.
q0
;;
3
; ;
(b) 2
v1 1 2 = q0 L 2
hinge
L/2
(2) L
L/2
3 = 0.362
Figure 13.3. Beam problem for Example 13.1. (a): beam problem, (b) deection prole when = 0.362. L 2 /6 L (1 2 )/6
Assembling and applying the support conditions v2 = v3 = 3 = 0, provides the reduced stiffness equations EI L3 12/ 3 6 L / 2 6 L / 2 6 L / 2 4 L 2 / 2 L 2 / 6 L / 2 2 L 2 / 2 L (4 + 3)/ . (13.15)
Solving for the node displacements gives v1 = q0 L 4 (12 2 + 9 3 2)/(72 E I ), 1 = q0 L 3 (1 6 2 6 3 )/(36 E I ) and 2 = q0 L 3 (1 6 2 )/(36 E I ). The equation v1 = 0 is quartic in and has four roots, which to 8 places are 1 = 1.17137898, 2 = 0.52399776, 3 = 0, and 4 = 0.3620434. Since the latter is the only positive root, the solution is = 0.362. The deection prole for this value is pictured in Figure 13.3(b).
13.2.6. Timoshenko Plane Beam Element As observed in 12.2.2, the Timoshenko beam model [243] includes a rst order correction for transverse shear exibility. The key kinematic assumption changes to plane sections remain plane but not necessarily normal to the deformed neutral surface. This is illustrated in Figure 13.4(a) for a 2-node plane beam element. The cross section rotation differs from v by . Ignoring axial forces, the displacement eld is analogous to that of the Bernoulli-Euler model (12.2) but with a shear correction: u (x , y ) = y ,
2
v(x , y ) = v(x ),
with
v + = v + , x
V . G As
(13.16)
Compare the vector in the last expression in (13.14) to the last row of H B in (13.10).
136
137
(a) 1 1
v' 1 =|dv/dx|1
y, v
Deformed cross section
2 2
v' 2 =|dv/dx|2
(b) y M z V
Positive M, V conventions
(c)
v1
1
v(x)
2
v2 x, u
V(+)
A positive transverse shear force V produces a CCW rotation (+) of the beam cross section
Figure 13.4. Two-node Timoshenko plane beam element: (a) kinematics (when developed with cubic shape functions, 1 = 2 = ); (b) M and V sign conventions; (c) concurrence of sign conventions for V and .
Here V is the transverse shear force, the shear rotation (positive CCW) averaged over the cross section, G the shear modulus and As the effective shear area.3 The product R S = G As is the shear rigidity. . To correlate def with the notation of 13.2.4, note that V = E I v , = 2 v = V /(G As ), so = E I /(G As 2 ) and = 12 = 12 E I G As 2 (13.17)
This dimensionless ratio characterizes the shear slenderness of the beam element.4 It is not an intrinsic beam property because it involves the element length. As 0 the Timoshenko model reduces to the BE model. Replacing R Bs = R Ba = E I and R S = G As = 12 E I /( 2 ) into (13.13) yields the Timoshenko beam stiffness 12 6 12 6 2 2 EI (4 + ) 6 (2 ) 6 Ke = 3 (13.18) 12 6 12 6 (1 + ) 2 2 (2 ) 6 (4 + ) 6 If = 0 this reduces to (12.20). The Mathematica module TimoshenkoBeamStiffness[Le,EI, ], listed in Figure 13.5, implements (13.18).
TimoshenkoBeamStiffness[Le_,EI_,_]:=Module[{Ke}, Ke=EI/(Le*(1+))*{{ 12/Le^2, 6/Le,-12/Le^2, 6/Le }, { 6/Le , 4+, -6/Le , 2- }, {-12/Le^2, -6/Le, 12/Le^2,-6/Le}, { 6/Le , 2-, -6/Le , 4+ }}; Return[Ke]];
Figure 13.5. Module to produce stiffness matrix for Timoshenko beam element.
The calculation of the consistent node forces for uniform transverse load is covered in Exercise 13.2. A hinged Timoshenko beam is constructed in Exercise 13.3.
3
A concept dened in Mechanics of Materials; see e.g. Chapter 10 of Popov [201] or Chapter 12 of Timoshenko and 1 2 Goodier [245]. As is calculated by equating the internal shear energy 1 2 V = 2 V /(G As ) to that produced by the shear stress distribution over the cross section. For a thin rectangular cross section and zero Poissons ratio, As = 5 A /6. Note that in (13.8)(13.9), 1200 R Bs /
3
137
138
y,v
P
x 1 L/2 L 2
2
P
3 (a) Finite element
discretization
Mz = PL 2
Figure 13.6. Example: cantilever beam discretized with two Timoshenko beam elements.
13.2.7. Shear-Curvature Recovery When using the Timoshenko beam model, the following arises during postprocessing. Suppose that the element node displacement vector ue = ue T is given following the solution process. Recover the mean shear e e distorsion and the curvature over the element on the way to internal forces and stresses. The problem is not trivial because e is part of the rotational freedoms. The recovery process can be effectively done by passing rst to generalized coordinates: ce = H S ue , and then to Bernoulli-Euler node displacements: e e e e ue B E = G B c = G B H S u = TBT uT , in which
;; ;;
1
def
L/2
Vy =P
T BT = G B H S = I 1+
L1e 0
1 Le
0
1 2
0
1 Le
0
1 2 1 2
(13.19)
0
1 2
0
1 Le
e =
1 e e e (v v2 )+ 1 ( e + 1 ) 2 2 Le 1
(13.20)
The curvature is obtained from the Bernoulli-Euler vector: = Be ue B E , where the curvature displacement matrix Be is that given in the previous Chapter.
Example 13.2. Consider the prismatic cantilever beam of length L pictured in Figure 13.6(a). It is subject to two point
loads as shown. Shear exibility is to be accounted for using the Timoshenko model. The bending and shear rigidities E Izz and G As are constant along the span. The objective is to nd deections, curvatures and shear distortions and associated bending moments and shear forces. It is sufcient to discretize the beam with two Timoshenko beam elements oength L /2 as shown in the gure. The stiffness matrices for both elements are given by (13.18), in which L e = L /2 and = 12 E Izz /(G As ( L /2)2 ) = 48 E Izz /(G As L 2 ). The master stiffness equations are 48 12 L 2 E Izz 48 L 3 (1+ ) 12 L 0 0
12 L ) 12 L L 2 (2 ) 0 0 L 2 (4+
48 12 L 96 0 48 12 L
12 L ) 0 2 L 2 (4+ ) 12 L L 2 (2 ) L 2 (2
0 0 48 12 L 48 12 L
0 v1 0 0 1 0 12 L v2 P . = L 2 (2 ) 2 0 P 12 L v3 0 L 2 (4+ ) 3
(13.21)
138
139
Setting the displacement B.C. v1 = 1 = 0 and solving yields
T P L2 . 0 0 L 1 L (22 + ) 3 4 24 2 4 E Izz The mean element shear distortions are calculated from (13.22) using (13.20). This gives
u=
(13.22)
P L2 P = (13.23) 48 E Izz G As The element-level Bernoulli-Euler node displacements are obtained from (13.22) on subtracting the shear distortions (13.23) from the rotations: T T P L2 P L2 L 1) 2) L (22 + ) 3 + u( u( = . (13.24) 0 0 L 1 , 1+ B = 4E I B 4 12 24 2 12 4 E Izz 4 zz (1) = 0, (2) =
(1) (2) 1 Note that B 2 = 1 = B 2 = 1 + 12 , the kink being due to the shear distortion jump at node 2. The curvatures are now recovered as PL PL 1) 2) (2) (1) = B(1) u( (2) = B(2) u( (13.25) B = 2E I , B = 4 E I (1 ), zz zz e = G A (e) and M e = E I e , The transverse shear force resultant and bending moment are easily recovered as Vy s zz z respectively. The results are drawn in Figure 13.6(b,c).
13.2.8. Beam on Elastic Supports Sometimes beams, as well as other structural members, may be supported elastically along their span. Two common congurations that occur in structural engineering are: (i) (ii) Beam resting on a continuum medium such as soil. This is the case in foundations. Beam supported by discrete but closely spaced exible supports, as in the bed of springs pictured in Figure 13.7. This occurs in railbeds (structurally rails are beams supported by crossties) and some types of grillworks.
The Winkler foundation is a simplied elastic-support model. It is an approximation for (i) because it ignores multidimensional elasticity effects as well as friction. It is a simplication of (ii) because the discrete nature of supports is smeared out. It is nonetheless popular, particularly in foundation and railway engineering, when the presence of physical uncertainties would not justify a more complicated model. Such uncertainties are inherent in soil mechanics. The Winkler model may be viewed as a continuication of case (ii). Take a beam slice going from x to x + d x . The spring-reaction force acting on the beam is taken to be d f F = k F v(x ) d x . Here v(x ) is the transverse deection and k F the Winkler foundation stiffness, which has dimension of force per length-squared. Force d f F has the opposite sign of v(x ), pushing up if the beam moves down and pulling down if it moves up. Beam-foundation separation effects that may occur in case (i) are ignored here because that would lead to a nonlinear contact problem. The internal energy stored in the d x slice of Winkler springs is / v d f F = / k F v 2 d x . Consequently the e of the beam element so that it becomes effect of elastic supports is to modify the internal energy U B
y, v q(x)
beam
;;;;;;;;;
bed of springs
139
Chapter 13: ADVANCED ONE-DIMENSIONAL ELEMENTS Figure 13.7. A beam supported by a bed of springs. Continuication of this conguration leads to the Winkler foundation model treated in this subsection.
e e U e = UB + UF , e with U F = 1 2 0
1310
k F v2 d x .
(13.26)
Therefore the total stiffness of the element is computed by adding the foundation stiffness to the beam stiffness. Care must be taken, however, that the same set of nodal freedoms is used. This is best handled by doing the generalized stiffness KcF rst, and then using the appropriate generalized-to-physical transformation. If the transverse deection v is interpolated with (13.2) as v = L c, the generalized Winkler foundation stiffness for constant k F is KcF = k F
0
L T L d x = k F Q0 ,
(13.27)
where Q0 is the rst diagonal matrix in (13.4). This holds regardless of beam model. Now if the member resting on the foundation is modeled as a BE beam, one picks H B of (13.10) as generalized-to-physical transformation matrix to get 156 22 54 13 k F 22 13 3 2 4 2 T , (13.28) Ke 54 F = k F H B Q0 H B = 13 156 22 420 4 2 13 3 2 22 If instead the supported member is modeled as a Timoshenko beam, one picks H S of (13.12) to get
T Ke F = k F H S Q0 H S
+35 2 ) +7 2 ) +35 2 ) +7 2 ) (13.29) The module TimoshenkoWinklerStiffness[Le,kF, ] listed in Figure 13.8 implements the stiffness (13.29). To get the BE-beam Winkler stiffness (13.28), invoke with = 0. Examples of use of this module are provided in 13.3.1.
TimoshenkoWinklerStiffness[Le_,kF_,_]:=Module[{KeW}, KeW={{4*(78+147*+70*^2), Le*(44+77*+35*^2), 4*(27+63*+35*^2), -Le*(26+63*+35*^2)}, {Le*(44+77*+35*^2), Le^2*(8+14*+7*^2), Le*(26+63*+35*^2), -Le^2*(6+14*+7*^2)}, {4*(27+63*+35*^2), Le*(26+63*+35*^2), 4*(78+147*+70*^2), -Le*(44+77*+35*^2)}, {-Le*(26+63*+35*^2),-Le^2*(6+14*+7*^2), -Le*(44+77*+35*^2), Le^2*(8+14*+7*^2)}}* kF*Le/(840*(1+)^2); Return[KeW]];
+70 2 ) (44+77 +35 2 ) 4(27+63 2 (8+14 +7 2 ) (26+63 +35 2 ) 2 2 +35 ) (26+63 +35 ) 4(78+147 +35 2 ) 2 (6+14 +7 2 ) (44+77
Figure 13.8. Stiffness matrix module for a Winkler foundation supporting a Timoshenko beam element.
1310
1311
13.3.
For both BE and Timoshenko beam models, the Legendre polynomials L 1 ( ) through L 4 ( ) are exact solutions of the homogeneous, prismatic, plane beam equilibrium equation E I d 4 v/d x 4 = 0. When used as shape functions in the generalized interpolation (13.2), the resulting stiffness matrix is exact if the FEM model is loaded at the nodes, as further discussed in 13.6. The technique can be extended to more complicated onedimensional problems. It can be used to derive exact stiffness matrices if homogeneous solutions are available in closed form, and are sufciently simple to be amenable to analytical integration. The following subsection illustrates the method for a BE beam resting on a Winkler elastic foundation. 13.3.1. Exact Winkler/BE-Beam Stiffness Consider again a prismatic, plane BE beam element resting on a Winkler foundation of stiffness k F , as pictured in Figure 13.7. The governing equilibrium equation for constant E I > 0 and k F > 0 is E I d 4 v/d x 4 + k F v = q (x ). The general homogeneous solution over an element of length going from x = 0 to x = is v(x ) = e c1 sin + c2 cos + e c3 sin + c4 cos , with = x / and =
4
kF . (13.30) 4E I
Here the ci are four integration constants to be determined from four end conditions: the nodal degrees of freedom v1 , v1 , v2 and v2 . These constants are treated as generalized coordinates and as before collected into vector c = [ c1 c2 c3 c4 ]T . The solution (13.30) is used as generalized interpolation with e sin through e cos as the four shape functions. Differentiating twice gives v = d v/d x and v = d 2 v/d x 2 . The TPE functional of the element in terms of the generalized coordinates can be expressed as
e c
=
0
1 2
E I (v )2 + 1 k v 2 q0 v d x = 1 cT (KcB + KcF ) c cT fc . 2 F 2
(13.31)
This denes KcB and KcF as generalized element stiffnesses due to beam bending and foundation springs, respectively, whereas fc is the generalized force associated with a transverse load q (x ). The nodal freedoms are linked to generalized coordinates by
0 1 0 1 v1 c1 / / / / 1 c2 v = c . e cos e sin e cos e sin 1 3 e (cos + sin ) e (cos sin ) e (cos sin ) e (cos + sin ) 1 c4 (13.32)
1 In compact form this is ue = G F c. Inverting gives c = H F ue with H F = G F . The physical stiffness is e e e e T e T K = K B + K F with K B = H F KcB H F and K F = H F KcF H F . The consistent force vector is fe = HT F fc . Computation with transcendental functions by hand is unwieldy and error-prone, and at this point it is better e to leave that task to a CAS. The Mathematica script listed in Figure 13.9 is designed to produce Ke B , K F and e f for constant E I and k F , and uniform transverse load q (x ) = q0 . The script gives
1311
1312
Figure 13.9. Script to produce the exact Winkler-BE beam stiffness matrix and consistent force vector.
BEBeamWinklerExactStiffness[Le_,EI_,kF_,q0_]:=Module[{B1,B2,B3,B4,B5,B6, F1,F2,F3,F4,F5,F6,f1,f2,facB,facF,facf,KeB,KeF,fe, }, =PowerExpand[Le*((kF/(4*EI))^(1/4))]; B1 =2* ^2*(-4*Sin[2* ]+Sin[4* ]+4*Sin[ ]*(Cos[ ]*Cosh[2* ]+ 8* *Sin[ ]*Sinh[ ]^2)+2*(Cos[2* ]-2)*Sinh[2* ]+Sinh[4* ]); B2 =2*Le* *(4*Cos[2* ]-Cos[4* ]-4*Cosh[2* ]+ Cosh[4* ]8* *Sin[2* ]*Sinh[ ]^2+8* *Sin[ ]^2*Sinh[2* ]); B3 =-(Le^2*(8* *Cos[2* ]-12*Sin[2* ]+Cosh[2* ]*(6*Sin[2* ]-8* )+3*Sin[4* ]+ 2*(6-3*Cos[2* ]+4* *Sin[2* ])*Sinh[2* ]-3*Sinh[4* ])); B4 =-4*Le* *( *Cosh[3* ]*Sin[ ]- *Cosh[ ]*(-2*Sin[ ]+Sin[3* ])+( *(Cos[ ]+ Cos[3* ])+Cosh[2* ]*(-2* *Cos[ ]+4*Sin[ ])+2*(-5*Sin[ ]+Sin[3* ]))*Sinh[ ]); B5 =-4* ^2*(2*Cos[ ]*(-2+Cos[2* ]+Cosh[2* ])*Sinh[ ]+Sin[3* ]* (Cosh[ ]-2* *Sinh[ ])+Sin[ ]*(-4*Cosh[ ]+Cosh[3* ]+2* *Sinh[3* ])); B6 =2*Le^2*(Cosh[3* ]*(-2* *Cos[ ]+3*Sin[ ])+Cosh[ ]*(2* *Cos[3* ]+3*(Sin[3* ]4*Sin[ ]))+(9*Cos[ ]-3*Cos[3* ]-6*Cos[ ]*Cosh[2* ]+16* *Sin[ ])*Sinh[ ]); F1 =2* ^2*(-32* *Sin[ ]^2*Sinh[ ]^2+6*(-2+Cos[2* ])* (Sin[2* ]+Sinh[2* ])+6*Cosh[2* ]*(Sin[2* ]+Sinh[2* ])); F2 =2*Le* *(4*Cos[2* ]-Cos[4* ]-4*Cosh[2* ]+Cosh[4* ]+ 8* *Sin[2* ]*Sinh[ ]^2-8* *Sin[ ]^2*Sinh[2* ]); F3 =Le^2*(8* *Cos[2* ]+4*Sin[2* ]-2*Cosh[2* ]*(4* +Sin[2* ])-Sin[4* ]+ 2*(Cos[2* ]+4* *Sin[2* ]-2)*Sinh[2* ]+Sinh[4* ]); F4 =4*Le* *( *Cosh[3* ]*Sin[ ]- *Cosh[ ]*(-2*Sin[ ]+Sin[3* ])+( *Cos[ ]+ *Cos[3* ]+10*Sin[ ]-2*Cosh[2* ]*( *Cos[ ]+2*Sin[ ])-2*Sin[3* ])*Sinh[ ]); F5 =-4* ^2*(6*Cos[ ]*(-2+Cos[2* ]+Cosh[2* ])*Sinh[ ]+Sin[3* ]* (3*Cosh[ ]+2* *Sinh[ ])+Sin[ ]*(-12*Cosh[ ]+3*Cosh[3* ]-2* *Sinh[3* ])); F6 =-2* Le^2*(-(Cosh[3* ]*(2* *Cos[ ]+Sin[ ]))+Cosh[ ]*(2* *Cos[3* ]+ 4*Sin[ ]-Sin[3* ])+(Cos[3* ]+Cos[ ]*(2*Cosh[2* ]-3)+16* *Sin[ ])*Sinh[ ]); f1=2* *(Cosh[ ]-Cos[ ])*(Sin[ ]-Sinh[ ]); f2=-(Le*(Sin[ ]-Sinh[ ])^2); g=2-Cos[2* ]-Cosh[2* ]; facf=(q0*Le)/( ^2*g); facB=(EI* /Le^3)/(4*g^2); facF=(kF*Le)/(16* ^3*g^2); KeB=facB*{{B1,B2,B5,-B4},{ B2,B3,B4,B6},{B5,B4,B1,-B2},{-B4,B6,-B2,B3}}; KeF=facF*{{F1,F2,F5,-F4},{ F2,F3,F4,F6},{F5,F4,F1,-F2},{-F4,F6,-F2,F3}}; fe=facf*{f1,f2,f1,-f2}; Return[{KeB,KeF,fe}]];
Figure 13.10. Module to get the exact BE-Winkler stiffness and consistent load vector.
1312
1313
y, v
k F constant L
2L
in which g = 2 cos 2 cosh 2, B1 = 2 2 (4 sin 2 + sin 4 +4 sin (cos cosh 2 +8 sin sinh2 )+2(cos 2 2) sinh 2 + sinh 4 ), B2 = 2 (4 cos 2 cos 4 4 cosh 2 + cosh 4 8 sin 2 sinh2 +8 sin2 sinh 2 ), B3 = ( 2 (8 cos 2 12 sin 2 + cosh 2 (6 sin 2 8 )+3 sin 4 + 2(63 cos 2 +4 sin 2) sinh 2 3 sinh 4 )), B4 = 4 ( cosh 3 sin cosh (2 sin + sin 3 )+( (cos + cos 3 ) + cosh 2 (2 cos +4 sin )+2(5 sin + sin 3 )) sinh ), B5 = 4 2 (2 cos (2+ cos 2 + cosh 2 ) sinh + sin 3 (cosh 2 sinh ) + sin (4 cosh + cosh 3 +2 sinh 3 )) B6 = 2 2 (cosh 3 (2 cos +3 sin )+ cosh (2 cos 3 +3(4 sin + sin 3 )) +(9 cos 3 cos 3 6 cos cosh 2 +16 sin ) sinh ) F1 = 2 2 (32 sin2 sinh2 +6(2+ cos 2 )(sin 2 + sinh 2 )+6 cosh 2 (sin 2 + sinh 2)), F2 = 2 (4 cos 2 cos 4 4 cosh 2 + cosh 4 +8 sin 2 sinh2 8 sin2 sinh 2 ), F3 =
2
F4 = 4 ( cosh 3 sin cosh (sin 3 2 sin )+( cos + cos 3 +10 sin 2 cosh 2 ( cos +2 sin )2 sin 3 ) sinh ), F5 = 4 2 (6 cos (2+ cos 2 + cosh 2 ) sinh + sin 3 (3 cosh +2 sinh ), + sin (12 cosh +3 cosh 3 2 sinh 3 )) F6 = 2 2 ((cosh 3(2 cos + sin ))+ cosh (2 cos 3 +4 sin sin 3 ) +(cos 3 + cos (2 cosh 2 3)+16 sin ) sinh ), (13.34) These expressions are used to code module BEBeamWinklerExactStiffness[Le,EI,kF,q0], which is listed in Figure 13.10.
Example 13.3. A xed-xed BE beam rests on a Winkler foundation as shown in Figure 13.11. The beam has span 2 L , and
f 2 = (sin sinh )2 .
constant E I . The Winkler foundation coefcient k F is constant. As usual in foundation engineering we set k F = E I 4 / L 4 , (13.35)
1313
Chapter 13: ADVANCED ONE-DIMENSIONAL ELEMENTS Table 13.1 - Results for Example of Figure 13.11 at Selected Values Load case (I): Central Point Load exact C I Ne = 2 Ne = 4 Ne = 8 0.999997 0.969977 0.668790 0.049152 0.003220 3.23107 0.999997 0.970003 0.671893 0.065315 0.006648 8.03107 Load case (II): Line Load Over Right Half exact C I I Ne = 2 Ne = 4 Ne = 8 0.999997 0.969977 0.668790 0.049152 0.003220 3.23107 0.999997 0.968742 0.658316 0.041254 0.002393 2.62107 0.999997 0.968666 0.657746 0.041317 0.002395 2.42107
1314
0.999997 0.999997 0.970005 0.968661 0.672167 0.657708 0.067483 0.041321 0.008191 0.002394 1.63106 2.40107
where is a dimensionless rigidity to be kept as parameter.5 The beam is subjected to two load cases: (I) a central point load P at x = L , and (II) a uniform line load q0 over the right half x L . See Figure 13.11. All quantities are kept symbolic. The focus of interest is the deection vC at midspan C (x = L ). For convenience this I () = C ()v I and v I I () = C ()v I I for load cases (I) and (II)), respectively. is rendered dimensionless by taking vC I II C C0 C0 I I I 3 Here vC 0 = P L /(24 E I ) and vC 0 = q0 L 4 /(48 E I ) are the midspan deections of cases (I) and (II) for = 0, that is, k F = 0 (no foundation). The exact deection factors for this model are 13 4 6 2 cos 2 + cosh 2 2 137 8 =1 + ... C I () = 3 420 138600 sin 2 + sinh 2 (13.36) 163 4 48 (cos / 2 cosh / 2)(sin / 2 sinh / 2) 20641 8 =1 + + ... C I I () = 4 5040 19958400 sin 2 + sinh 2 Both load cases were symbolically solved with two exact elements of length L produced by the module of Figure 13.10. As can be expected, the answers reproduce the exact solutions (13.36). Using any number of those elements would match (13.36) as long as the midspan section C is at a node. Then both cases were solved with 2, 4, and 8 elements with the stiffness (13.28) produced by cubic polynomials. The results are shown in a log-log plot in Figure 13.12. Results for selected values of are presented in Table 13.1. As can be seen, for a soft foundation characterized by < 1, the cubic-polynomial elements gave satisfactory results and converged quickly to the exact answers, especially in load case (II). As grows over one, the deections become rapidly smaller, and the polynomial FEM results exhibit higher relative errors. On the other hand, the absolute errors remain small. The conclusion is that exact elements are only worthwhile in highly rigid foundations (say > 5) and then only if results with small relative error are of interest.
0 1 2 3 4 5 6 1 0.5 0 0.5 1 2 poly elements 4 poly elements 8 poly elements 0 1 2 exact elements 2 3 4 5 6 2 1 0.5 0 0.5 1
log10 CI
Load Case I: Central Point Load
log10 CII
Load Case II: Uniform Line Load Over Right Half
2 exact elements
log 10
1.5
log 10
1.5 2
Figure 13.12. Log-log plots of C I () and C I I () for Example of Figure 13.11 over range [0.1, 100].
Note that is a true physical parameter, whereas is discretization dependant because it involves the element length.
1314
1315
Remark 13.2. To correlate the exact stiffness and consistent forces with those obtained with polynomial shape functions it is illuminating to expand (13.33) as power series in . The rationale is that as the element size gets smaller, = 4 k F /(4 E I ) goes to zero for xed E I and k F . Mathematica gives the expansions
8 12 e 4 8 e 4 Ke B = K B 0 + K B 8 + K B 12 + . . . , K F = K F 0 + K F 4 + K F 8 + . . . , f = f0 + f4 + . . . ,
(13.37)
in which Ke B0
Ke B 12
25488 5352 23022 5043 2 E I 5352 1136 5043 1097 2 = eqn (12.20) , Ke , B8 = 23022 5043 25488 5352 4365900 3 2 2 5043 1097 5352 1136 528960 113504 522090 112631 2 2 EI 112631 24273 113504 24384 = , Ke F 0 = eqn (13.28), 522090 112631 528960 113504 5959453500 3 112631 24273 2 113504 24384 2 kF 4 e 3k F 4 e q0 K B 8 , Ke K , fe = [6 F8 = 2E I 8 E I B 12 0 12 6 ]T , fe 4 = q0 [ 14 3 14 3 ]T . 5040
(13.38)
Ke F4 =
Thus as 0 we recover the stiffness matrices and force vector derived with polynomial shape functions, as can be expected. Note that K B 0 and K F 0 decouple, which allows them to coded as separate modules. On the other hand the exact stiffnesses are coupled if > 0. The foregoing expansions indicate that exactness makes little difference if < 1.
1315
1316
13.4.
Equilibrium Theorems
One way to get high performance mechanical elements is to use equilibrium conditions whenever possible. These lead to exibility methods. Taking advantage of equilibrium is fairly easy in one space dimension. It is more difcult in two and three, because it requires advanced variational methods that are beyond the scope of this book. This section surveys theorems that provide the theoretical basis for exibility methods. These are applied to 1D element construction in 13.5. 13.4.1. Self-Equilibrated Force System First we establish a useful theorem that links displacement and force transformations. Consider a FEM discretized body such as that pictured in Figure 13.13(a). The generic potato intends to symbolize any discretized material body: an element, an element assembly or a complete structure. Partition its degrees of freedom into two types: r and s . The s freedoms (s stands for suppressed or supported) are associated with a minimal set of supports that control rigid body motions or RBMs. The r freedoms (r is for released) collect the rest. In the gure those freedoms are shown collected at invididual points Ps and Pr for visualization convenience. Node forces, displacements and virtual displacements associated with those freedoms are partitioned accordingly. Thus f us us u= , u = . (13.39) f= s , fr ur ur The dimension n s of fs , us and us is 1, 3 and 6 in one-, two- and three-dimensional space, respectively. Figure 13.13(b) shows the force system {fs , fr } undergoing virtual displacements, which are exaggerated for visibility.6 Consider now the rigid + deformational displacement decomposition u = Gus + d, in which matrix G (of appropriate order) represents a rigid motion and d are deformational displacements. Evaluating this at the r freedoms gives ur = Gr us + dr , ur = Gr us + dr , (13.40) The rst decomposition in (13.40), being linear in the actual displacements, is only valid only in geometrically linear analysis. That for virtual displacements is valid for a much broader class of problems. If the supported freedom motion vanishes: us = 0, then ur = dr . Thus dr represents a relative displacement of the unsupported freedoms with respect to the rigid motion Gus , and likewise for the virtual displacements. Because a relative motion is necessarily associated with deformations, the alternative name deformational displacements is justied.
T T fs + ur fr . If the force system in Figure 13.13(a) is in The external virtual work is W = Ws + Wr = us self equilibrium and the virtual displacements are imparted by rigid motions dr = 0 and ur = Gr us , the T T T T T fs + us Gr fr = us (fs + Gr fr ) = 0. Because the us are arbitrary, virtual work must vanish: W = us it follows that T T fs + Gr fr = 0, fs = Gr fr . (13.41)
These are the overall static equilibrium equations of a discrete mechanical system in self equilibrium. Sometimes it is useful to express the foregoing expressions in the complete-vector form u= us ur = I 0 us us + , u = ur Gr dr = I 0 f us + , f= s fr Gr dr =
T Gr I
fr . (13.42)
Under virtual displacements the forces are frozen for application of the Principle of Virtual Work. If the model is geometrically nonlinear, the rst form in (13.42) does not hold.
1316
1317
(a)
us fs
P s
ur
P r
fr P r
fs
P s
fr
Figure 13.13. Body to illustrate equilibrium theorems. Nodal freedoms classied into supported (s ) and released (r ), each lumped to a point to simplify diagram. (a) Self equilibrated node force system. (b) Force system of (a) undergoing virtual displacements; grossly exaggerated for visibility.
Remark 13.3. The freedoms in us are virtual supports, chosen for convenience in exibility derivations. They should not
be confused with actual or physical supports. For instance Civil Engineering structures tend to have redundant physical supports, whereas aircraft or orbiting satellites have none. 13.4.2.
Consider now a generalization of the previous scenario. An externally applied load system of surface or body forces, not necessarily in self equilibrium, acts on the body. For example, the surface tractions pictured in Figure 13.14(a). To bring this under the framework of equilibrium analysis, a series of steps are required. First, the force system is replaced by a single resultant q, as pictured in 13.14(b).8 The point of application is Pq . Equilibrium is restored by introducing node forces qr and qs at the appropriate freedoms. The overall equilibrium condition is obtained by putting the system {q, qr , qs } through rigid-motion virtual displacements, as pictured in Figure 13.14(c). Point Pq moves T (q + GT q + GT q) = 0 whence through uq , and G evaluated at Pq is Gq . The virtual work is W = us s r r q
T T qr + Gq q = 0. qs + Gr
(13.43)
If (13.43) is sufcient to determine qs and qr , the load system of Figure 13.14(a) can be effectively replaced by the nodal forces qs and qr , as depicted in 13.14(d). These are called the equivalent node forces. But in general (13.43) is insufcient to fully determine qs and qr . The remaining equations to construct the equivalent forces must come from a theorem that accounts for the internal energy, as discussed in 13.4.3. Adding (13.41) and (13.43) gives the general overall equilibrium condition
T T fs + qs + Gr (fr + qr ) + Gq q = 0,
(13.44)
out the virtual work by appropriately integrating distributed effects. The resultant is primarily useful as an instructional tool, because matrix Gq is not position dependent.
Remark 13.5. Conditions (13.41) and (13.43), which were derived through the PVW, hold for general mechanical systems
under mild reversibility requirements [253, 231], including geometric nonlinearities. From now on we restrict attention to systems linear in the actual displacements.
13.4.3. Flexibility Equations The rst step in FEM equilibrium analysis is obtaining discrete exibility equations. The stiffness equations introduced in Chapter 2 relate forces to displacements. At the element level they are fe = Ke ue . By denition,
8
Although the gure shows a resultant point force, in general it may include a point moment that is not shown for simplicity. See also Remark 13.3.
1317
1318
(a) P s P r
(b)
qs
P s P q
qr
P r
t(x)
(c)
q ur
(d)
us
P s
qs uq
P q
qr
P r
qs
P s
q r
P r
q
Figure 13.14. Processing non-self-equilibrated applied loads with exibility methods. (a) Body under applied distributed load. (b) Substitution by resultant and self equilibration. (c) Deriving overall equilibrium conditions through the PVW. (d) Replacing the applied loads by equivalent nodal forces.
exibility equations relate displacements to forces: ue = Fe fe , where Fe is the element exibility matrix. So the expectation is that the exibility can be obtained as the inverse of the stiffness: Fe = (Ke )1 . Right? Wrong. Recall that Ke for a disconnected free-free element is singular. Its ordinary inverse does not exist. Expectations go up in smoke. The same difculty holds for a superelement or complete structure. To get a conventional exibility matrix9 it is necessary to remove all rigid body motions in advance. This can be done through the virtual supports introduced in 13.4.1. The support motions us are xed, say us = 0. Flexibility equations are sought between what is left of the kinematics. Dropping the element superscript for brevity, for a linear problem one gets (13.45) Frr fr = dr . Note that ur does not appear: only the deformational or relative displacements. To recover ur it is necessary to release the supports, but if that is naively done Frr ceases to exist. This difculty is overcome in 13.4.4. There is another key difference with stiffness methods. The DSM assembly procedure covered in Chapter 3 (and extended in Chapter 25 to general structures) does not translate into a similar technique for exibility methods. Although it is possible to assemble exibilities of MoM elements, the technique is neither simple nor elegant. And it becomes dauntingly complex when tried on continuum-based elements [83]. So one of the main uses of exibility equations today is as a stepping stone on the way to derive element stiffness equations, starting from (13.45). The procedural steps are explained in 13.4.4. But how should (13.45) be derived? There are several methods but only one, based on the Total Complementary Potential Energy (TCPE) principle of variational mechanics is described here. To apply TCPE, the complementary energy of the body must be be expressed as a function of the nodal forces fr . For xed supports (us = 0) and a linear system, the functional can be expressed as
T T T (fr ) = U (fr ) fr dr = 1 fT Frr fr + fr br fr dr + 2 r 0.
(13.46)
Here U is the internal complementary energy, also called the stress energy by many authors, e.g., [120], br is a term resulting from loading actions such as as thermal effects, body or surface forces, and 0 is independent of
9
In the FEM literature it is often called simply the exibility. The reason is that for a long time it was believed that getting a exibility matrix required a supported structure. With the recent advent of the free-free exibility (see Notes and Bibliography) it becomes necessary to introduce a deformational or conventional qualier.
1318
1319
fr . Calculation of U in 1D elements involves expressing the internal forces (axial force, shear forces, bending moments, torque, etc.) in terms of fr from statics. Application examples are given in the next section.10 The TCPE principle states that is stationary with respect to variations in fr when kinematic compatibility is satised: = Frr fr + br dr = 0, whence dr = Frr fr + br . (13.47) fr By hypothesis the deformational exibility Frr is nonsingular. Solving for fr gives the deformational stiffness equations 1 fr = Krr dr qr , with Krr = Frr and qr = Krr br . (13.48) The matrix Krr is the deformational stiffness matrix, whereas qr is the equivalent load vector.. 13.4.4. Rigid Motion Injection Suppose that Frr and qr of (13.48) have been found, for example from the TPCE principle (13.47). The goal is to arrive at the free-free stiffness equations, which are partitioned in accordance with (13.39) as fs fr = Kss Kr s Ksr Krr us ur qs , qr (13.49)
To justify the presence of Krr and qr here, set us = 0, whence ur = dr . Consequently the second equation reduces to fr = Krr dr qr , which matches (13.48). Inserting fs and fr into (13.44) yields
T T T T (Kss + Gr Kr s )us + (Ksr + Gr Krr )ur + qs + Gr qr + Gq q = 0,
(13.50)
and replacing ur = Gr us + dr ,
T T T T T Kss + Gr Kr s + Ksr Gr + Gr Krr Gr us + Ksr + Gr Krr dr + qs + Gr qr + Gq q = 0.
(13.51)
Because us , dr and q can be arbitrarily varied, each bracket in (13.51) must vanish identically, giving
T T qr Gq q, qs = Gr T Ksr = Gr Krr , T Kr s = Ksr = Krr Gr ,
(13.52)
us ur
T T Gr qr Gq q . qr
(13.53)
qr +
Gq T q = TT Krr T u TT qr + Tq q, 0 (13.54)
1 T. Alternatively (13.54) may be derived by plugging The end result is that the free-free stiffness is TT Frr dr = ur Gr us into (13.48) and then into (13.44).
10
For 2D and 3D elements the process is more delicate and demands techniques, such as hybrid variational principles, that lie beyond the scope of this material.
1319
1320
R=
S GS
(13.55)
is called a rigid body motion matrix or simply RBM matrix. The columns of R represent nodal values of rigid motions, hence the name. The scaling provided by S may be adjusted to make R simpler. The key property is T R = 0 and thus K R = TT Krr T R = 0. Other properties are studied in [90].
13.4.5. Applications Stiffness Equilibrium Tests. If one injects ur = Gus and qr = 0 into (13.54) the result is fr = 0 and fs = 0. That is, all node forces must vanish for arbitrary us . This test is useful at any level (element, superelement, full structure) to verify that a directly generated K (that is, a K constructed independently of overall equilibrium) is clean as regards rigid body modes. Element Stiffness from Flexibility. Here Frr is constructed at the supported element level, inverted to get Krr and rigid motions injected through (13.54). Applications to element construction are illustrated in 13.5. Experimental Stiffness from Flexibility. In this case Frr is obtained through experimental measurements on a supported structure or substructure.11 To insert this as a user dened superelement in a DSM code, it is necessary to produce a stiffness matrix. This is done again by inversion and RBM injection. 13.5.
The equilibrium theorems of the foregoing section are applied to the exibility derivation of several onedimensional elements. 13.5.1. Timoshenko Plane Beam-Column A beam-column member combines axial and bending effects. A 2-node, straight beam-column has three DOFs at each node: the axial displacement, the transverse displacement and a rotation. If the cross section is doubly symmetric, axial and bending effects are decoupled. A prismatic, plane element of this kind is shown in Figure 13.15(a). End nodes are 12. The bending component is modeled as a Timoshenko beam. The element is subjected to the six node forces shown, and to a uniformly distributed load q0 . To suppress rigid motions node 1 is xed as shown in Figure 13.15(b), making the beam a cantilever. Following the notation of 13.4.113.4.2, 1 0 0 0 1 x , 0 0 0 (13.56) Further, Gr = G( ) and Gq = G( /2). The internal forces are the axial force F (x ), the transverse shear V (x ) and the bending moment M (x ). These are directly obtained from statics by doing a free-body diagram at distance x from the left end as illustrated in Figure 13.15(c). With the positive convention as shown we get us = , dr = ur = , fs = , fr = , q= , G( x ) = N (x ) = f x 2 , V (x ) = f y 2 q0 ( x ), M (x ) = m 2 + f y2 ( x ) + 1 q ( x )2 . 2 0 (13.57) ux1 u y1 1 ux2 u y2 2 fx1 f y1 m1 fx2 f y2 m2 0 q 0
11
The classical static tests on an airplane wing are performed by applying transverse forces and torques to the wing tip with the airplane safely on the ground. These experimental inuence coefcients can be used for model validation.
1320
1321
y,v
(b)
1
(a)
m1 fx1 1
fy1
E,I,G,As constant q0 x
q0
fy2
2
q0
fy2 m2 fx2
m2 f x2
Figure 13.15. Flexibility derivation of Timoshenko plane beam-column stiffness: (a) element and node forces, (b) removal of RBMs by xing left node, (c) FBD that gives internal forces at varying x .
Useful check: d M /d x = V . Assuming a doubly symmetric section so that N and M are decoupled, the element TCPE functional is
;;
(c)
+F(x) x
+V(x) +M(x)
fy2 m2 f x2
1 2 0
N2 M2 V2 + + EA EI G As
T T T d x fr dr = 1 fT Frr fr + fr br fr dr + 2 r
0,
2 in which Frr = = 0 fr fr
Term
0
EA
3
(4 + ) , 24 E I 2E I
2 2
0 3 (4 + ) br = q0 12 E I .
2
(13.58)
6E I
Applying the TCPE principle yields Frr fr = br dr . This is inverted to produce the deformational stiffness relation fr = Krr dr + qr , in which EA 0 0 0 0 12 E I 1 2 6E I 3 Krr = Frr = qr = q0 Krr br = q0 /2 . (13.59) (1 + ) (1 + ) , 2 q0 /12 E I (4 + ) 0 2 6E I (1 + ) (1 + ) To use (13.54) the following transformation matrices are required:
T Gr TT = 0
0 0 = 1
0 0
0 0 1 0 1 , 0 0 1 0 0 1
Gq Tq = 0
0 0 = 0
0 0
0 1 /2 0 0 0
0 0 1 , 0 0 0
q=
0 q0 0
(13.60)
Injecting the rigid body modes from (13.54), Ke = TT Krr T and fe = TT qr , yields
1 0 EA e 0 K = 1
f = q0
e
0 0 [ 0 1/2
0 0 0 0 0 0
0 1 0 0 0 0 0 1 0 0 0 0 /12 0
0 0 0 0 EI 0 0 + 3 (1 + 0 0 0 0 0 0 1/2 /12 ]T .
0 0 ) 0
0 0
0 12 6 0 12 6
0 6 2 (4 + 0 6 2 (2
0 0 ) 0 0 0 ) 0
0 12 6 0 12 6
0 6 2 (2 0 6 2 (4 +
) ) (13.61)
1321
1322
ClearAll[Le,EI,GAs,,q0,fx2,fy2,m2]; GAs=12*EI/(*Le^2); F=fx2; V=-fy2-q0*(Le-x); M=m2+fy2*(Le-x)+(1/2)*q0*(Le-x)^2; Print["check dM/dx=V: ",Simplify[D[M,x]-V]]; Ucd=F^2/(2*EA)+M^2/(2*EI)+V^2/(2*GAs); Uc=Simplify[Integrate[Ucd,{x,0,Le}]]; Print["Uc=",Uc]; u2=D[Uc,fx2]; v2=D[Uc,fy2]; 2=D[Uc,m2]; Frr={{ D[u2,fx2], D[u2,fy2], D[u2,m2]}, { D[v2,fx2], D[v2,fy2], D[v2,m2]}, { D[ 2,fx2], D[ 2,fy2], D[ 2,m2]}}; br={D[Uc,fx2],D[Uc,fy2],D[Uc,m2]}/.{fx2->0,fy2->0,m2->0}; Print["br=",br]; Frr=Simplify[Frr]; Print["Frr=",Frr//MatrixForm]; Krr=Simplify[Inverse[Frr]]; Print["Krr=",Krr//MatrixForm]; qr=Simplify[-Krr.br]; Print["qr=",qr]; TT={{-1,0,0},{0,-1,0},{0,-Le,-1},{1,0,0},{0,1,0},{0,0,1}}; T=Transpose[TT]; Simplify[Ke=TT.Krr.T]; Print["Ke=",Ke//MatrixForm]; GrT={{1,0,0},{0,1,0},{0,Le,1}}; Gr=Transpose[GrT]; GqT={{1,0,0},{0,1,0},{0,Le/2,1}}; Gq=Transpose[GqT]; Print["Gr=",Gr//MatrixForm," Gq=",Gq//MatrixForm]; qv={0,q0*Le,0}; Print["qs=",Simplify[-GrT.qr-GqT.qv]];
Figure 13.16. Script to derive the stiffness matrix and consistent load vector of the prismatic, plane Timoshenko beam element of Figure 13.15 by exibility methods.
(a)
m1 fx1
(b)
fy2
1 2
m2
fx2
+V() +F()
(c)
|2|
|R|
m2
m2
Figure 13.17. Flexibility derivation of plane circular arch element: (a) element and node forces, (b) removal of RBMs by xing left node, (c) free body diagram of varying cross section.
+ y x 1 C +H 2 1 2 O 2S R +ds y x
O +2 +R 2 2 +R
+ C H x +2 O 2S y +ds R 1 2 +ds
O 2 +H C + 2S x y 1
H +ds C
+ 2S
The bending component is the same stiffness found previously in 13.2.6; compare with (13.18). The node force vector is the same as the consistent one constructed in an Exercise. A useful verication technique is to support the beam element at end 2 and recompute Ke and fe . This should reproduce (13.61). All of the foregoing computations were carried out by the Mathematica script shown in Figure 13.16.
1322
1323
13.5.2. Plane Circular Arch in Local System
In this and next subsection, the exibility method is used to construct the stiffness matrix of a curved, prismatic, plane beam-column element with circular prole, pictured in Figure 13.17(a). The local system {x , y } is dened as shown there: x is a chord axis that passes through end nodes 12, and goes from 1 to 2. Axis y is placed at +90 from x . No load acts between nodes. In a curved plane element of this nature, axial extension and bending are intrinsically coupled. Thus consideration of three freedoms per node is mandatory. These are the translations along x and y , and the rotation about z . This element can be applied to the analysis of plane arches and ring stiffeners (as in airplane fuselages and submarine pressure hulls). If the arch curvature varies along the member, it should be subdivided into sufciently small elements over each of which the radius magnitude is sensibly constant. Care must be taken as regards sign conventions to ensure correct results when the arch convexity and node numbering changes. Various cases are pictured in Figure 13.18. The conventions are as follows: (1) (2) The local node numbers dene a positive arclength traversal along the element midline as going from 1 to 2. The curved length (not shown in gure) and the (chord) spanlength 2 S are always positive. The arch rise H , the angular span 2 and the arch radius R are signed quantities as illustrated in Figure 13.18. The rise is the distance from chord midpoint to arch crown C: it has the sign of its projection on y . The angular span 2 is that subtended by the arch on moving from 1 to 2: it is positive if CCW. Finally, the radius R has the sign of so = 2 R is always positive. S = R sin , H = R (cos 1) (13.62)
The location of an arch section is dened by the tilt angle measured from the circle center-to-crown symmetry line OC, positive CCW. See Figure 13.18. The differential arclength ds = R d always points in the positive traversal sense 1 2. The rigid motions are removed by xing the left end as shown in in Figure 13.17(b). The internal forces F (), V () and M () at an arbitrary cross section are obtained from the FBD of Figure 13.17(c) to be F = f x 2 cos + f y 2 sin , V = f x 2 sin f y 2 cos , M = m 2 + f x 2 R (cos cos )+ f y 2 R (sin sin ). (13.63) For typical straight beam-column members there are only two practically useful models: Bernoulli-Euler (BE) and Timoshenko. For curved members there are many more. These range from simple corrections to BE through theory-of-elasticity-based models. The model selected here is one of intermediate complexity. It is dened by the internal complementary energy functional U =
0
( F M / R )2 M2 + 2E A 2E I
ds =
( F M / R )2 M2 + 2E A 2E I
R d .
(13.64)
The assumptions enbodies in this formula are: (1) the shear energy density V 2 /(2G As ) is neglected; (2) the cross section area A and moment of inertia I are unchanged with respect of those of the straight member. These assumptions are reasonable if | R | > 10 r , where r = + I / A is the radius of gyration of the cross section. Further corrections are treated in Exercises. To simplify the ensuing formulas it is convenient to take EA = EI
2 R22
4E I
2 2
or
2r
with r 2 =
I . A
(13.65)
This denes as a dimensionless geometric parameter. Note that this is not an intrinsic measure of arch slenderness, because it involves the element length.12 The necessary calculations are carried out by the
12
1323
1324
Mathematica script of Figure 13.21, which has been pared down to essentials to save space. The deformational exibility and stiffness computed are Frr = F11 symm F12 F22 F13 F23 F33 ,
1 Krr = Frr =
K 11 symm
K 12 K 22
K 13 K 23 K 33
in which (rst expression is exact value, second a Taylor series expansion in ) 16 E I 3 3 sin F12 = sin (1 + 2 4 E I 3 F13 = F22 =
2
F11 =
2(2 + 2
) + 2(1 + 2
2
) cos 2 3 sin 2 =
3
60 E I
15
+ 2 (2 15
) + O ( 4 )
2 E I 2
3
sin (1 + 2 2(2 + 2
2 2
1 3 2 + O ( 3 ), 12 E I 3 2 ) cos = 1 3 2 + O ( 3 ), 6E I ) cos =
2
16 E I 3 2 sin F23 = (1 + 2 2E I
) 2(1 + 2
2
) cos 2 sin 2 =
2
60 E I F33 =
20 + 3 2 (5 (1 + 2
2
2) + O ( 4 ),
)=
2
12 E I
6 + 2 (6
1) + O ( 4 ),
2
EI
). (13.66)
Introduce d1 = (1 + K 11 =
4 E I 4 EI (1 + 2 2 ) = 45 2 + 2 (15 2 + 45 4 1) + O ( 4 ), K 12 = 0, 3d 45 3 1 4 E I 2 6E I K 13 = 2 (1 + 2 2 ) cos sin = 2 2 (3 2 1) + O ( 3 ), d1 8 E I 3 12 E I sin EI K 22 = 3 = (5 + 2 ) + O ( 4 ), K 23 = K 22 = 3 (30 + 2 ) + O ( 4 ), 3 d2 5 2 5 EI 8 2 (3 + 2 2 2 ) 9 + 16 cos 2 7 cos 4 8 sin 2 2 + (1 + 2 2 ) cos 2 K 33 = 8 d1 d2 EI = 180 2 + 2 (5 48 2 ) + O ( 4 ), 45 2 (13.67) The constraint K 23 = K 22 sin /(2) must be veried by any arch stiffness, regardless of the TCPE form used. The necessary transformation matrix to inject the rigid body modes T = [ G I ] = 1 0 0 0 1 0 0 2 R sin 1 1 0 0 0 1 0 0 0 1 = 1 0 0 0 1 0 0 sin / 1 1 0 0 0 1 0 0 0 1 . (13.68)
K 0 K 13 K 11 0 K 13 11 K 22 K 23 0 K 22 K 23 0 K 13 K 23 K 33 K 13 K 23 K 36 e T K = T Krr T = K 11 0 K 13 K 11 0 K 13
0 K 13 K 22 K 23 K 23 K 36 0 K 13 K 22 K 23 K 23 K 33
(13.69)
1324
1325
ClearAll[ ,,,,R,F,M,V,Le,EA,EI]; EA=4*EI/(^2*Le^2); V=-fy2*Cos[]+fx2*Sin[]; F=fx2*Cos[]+fy2*Sin[]; M=m2+fx2*R*(Cos[]-Cos[ ])+fy2*R*(Sin[]+Sin[ ]); Ucd=(F-M/R)^2/(2*EA)+ M^2/(2*EI); Uc=Simplify[Integrate[Ucd*R,{,- , }]]; Print["Uc=",Uc]; u2=D[Uc,fx2]; v2=D[Uc,fy2]; 2=D[Uc,m2]; Frr=Simplify[{{ D[u2,fx2], D[u2,fy2], D[u2,m2]}, { D[v2,fx2], D[v2,fy2], D[v2,m2]}, { D[ 2,fx2], D[ 2,fy2], D[ 2,m2]}}]; Frr=FullSimplify[Frr/.{R->Le/(2* )}]; Print["Frr=",Frr//MatrixForm]; Krr=FullSimplify[Inverse[Frr]]; Print["Krr=",Krr//MatrixForm]; TT={{-1,0,0},{0,-1,0},{0,-2*R*Sin[ ],-1},{1,0,0},{0,1,0},{0,0, 1}}; TT=TT/.{R->Le/(2* )}; T=Transpose[TT]; Ke=Simplify[TT.Krr.T]; Print["Ke=",Ke//MatrixForm];
Figure 13.19. Script to produce circular arch element stiffness in local coordinates.
(a)
3 (x3 ,y3 )
(b)
2 3 2 1 1 R 3
(c) b H 2S a
2
x
Figure 13.20. Plane circular arch element in global coordinates: (a) geometric id (b) intrinsic geometry recovery.
+ 2 (12 2 5) + O ( 4 )
As a check, if 0 the entries reduce to that of the beam-column modeled with Bernoulli-Euler. For example K 11 4 E I 2 / 3 = E A / , K 22 12 E I / 3 , K 33 4 E I / , K 36 2 E I / , etc. 13.5.3. Plane Circular Arch in Global System To use the circular arch element in a 2D nite element program it is necessary to specify its geometry in the {x , y } plane and then to transform the stiffness (13.69) to global coordinates. The rst requirement can be handled by providing the coordinates of three nodes: {xi , yi }, i = 1, 2, 3. Node 3 (see Figure) is a geometric node that serves to dene the element mean curvature but has no associated freedoms. (Section to be completed).
1325
1326
Figure 13.21. Module to produce plane circular arch element stiffness in global coordinates.
13.6.
*Accuracy Analysis
This section presents the accuracy analysis of a repeating lattice of beam elements, analogous to that done for the bar element in 12.5. The analysis uses the method of modied differential equations (MoDE) mentioned in the Notes and Bibliography of Chapter 12. It is performed using a repeated differentiations scheme similar to that used in solving Exercise 12.8. Only the case of the Bernoulli-Euler model is worked out in detail. 13.6.1. *Accuracy of Bernoulli-Euler Beam Element Consider a lattice of repeating two-node, prismatic, plane Bernoulli-Euler beam elements of rigidity E I and length , as illustrated in Figure 13.22. The system is subject to an arbitrary lateral load q (x ), which is assumed innitely differentiable in x . From the lattice extract a patch of two elements: (1) and (2), connecting nodes i j and j k , respectively, as shown in Figure 13.22. The FEM patch equations at node j are
q(x)
i j k EI = const L vj = 1 Two-element patch ijk j = 1 Trial functions at node j
xi = xj
xj xk = xj +
i vj 12 6 24 0 12 6 = fj i (1) j (2) k 2 2 2 j 3 6 2 0 8 6 2 mj vk Figure 13.22. Repeating beam lattice for accuracy analysis. k (13.70) Expand v(x ), (x ) and q (x ) in Taylor series about x = x j , truncating at n + 1 terms for v and , and m + 1 terms for q . Using = (x x j )/ , the series are v(x ) = v j + v j + ( 2 2 /2!)v j + . . . + ( n n / n !)v [jn] , (x ) = n] 2 2 /2!)q j + . . . + ( m m / m !)q [jm ] . j + j + ( 2 2 /2!) j + . . . + ( n n / n !) [ j , and q ( x ) = q j + q j + ( Here v [jn] , etc., is an abbreviation for d n v(x j )/d x n .13 Evaluate the v(x ) and (x ) series at i and k by setting
EI
13
v
i
Brackets are used instead of parentheses to avoid confusion with element superscripts. If derivatives are indexed by primes or roman numerals the brackets are omitted.
1326
1327
= 1, and insert in (13.70). Use the q (x ) series evaluated over elements (1) and (2), to compute the consistent forces f j and m j as
1 1 1 1
fj =
(13.71) (1) (1) (2) 1 (1) 2 (1) (1) 2 (1) (2) 2 (2) = 1 ( 1 + ) ( 2 ) , N = ( 1 + ) ( 1 ) N = ( 1 ) ( 2 + ), and Here N3 4 1 4 8 4 (2) (2) 2 (2) N2 = 8 (1 ) (1 + ) are the Hermitian shape functions components of the j node trial function, whereas q (1) = q ( (1) ), (1) = 1 (1 (1) ) and q (2) = q ( (2) ), (2) = 1 (1 + (2) ) denote the lateral loads. 2 2 To show the resulting system in compact matrix form it is convenient to collect the derivatives at node j into vectors: v j = [ v j v j v j . . . v [jn] ]T ,
n] T j = [ j j j . . . [ j ] ,
q j = [ q j q j q j . . . q [jn] ]T .
(13.72)
(13.73)
Here Svv , Sv , Sv and S are triangular Toeplitz matrices of order (n +1) (n +1) whereas Pv and P are generally rectangular matrices of order (n +1) (m +1). Here is the expression of these matrices for n = 8, m = 4: 0 0 0 0 = EI 0 0 0 0 0
Svv
0 0 0 0 0 0 0 0 0
12
0
12
0 0 0 0 0 0 0 0
0
12
0 0 0 0 0 0 0
0 0
12
3 30
0
3 30
5 1680 3 30
0 0 0 0 Sv = E I 0 0 0
12
0 0 0 0 0 0
0 0
12
0 0 0 0 0
0 0
12
0 0 0 0
3
0 0 0
0 , 0 12
0 0
5
0 0 0 0 Sv = E I 0 0 0
12
0 0 0 0 0 0 0 0 0 0
0 2 0 0 0 10 420 12 3 5 0 2 0 10 0 420 3 12 0 0 2 0 0 10 12 3 0 0 0 2 0 10 12 0 0 0 0 2 0 0 0 0 0 12 0 2 0 0 0 0 0 12 0 0 0 0 0 0 0 12 0 0 0 0 0 0 0
12
0 0 0 0 0 0 0 0 0 0
0 2 12 0 12 0 0 0 0 0 0 0 0 0 0 0 0 0
0 10 0 420 0 3 5 2 0 10 0 420 3 0 2 0 10 0 3 12 0 2 0 10 0 12 0 2 0 0 0 12 0 2 0 0 0 12 0 0 0 0 0 12 0 0 0 0 0
3 5 3 5 7
0 0 0 , S = E I 0 0 0 0
0
0 2 12 0 12 0 0 0 0 0 0 0 0 0 0 0 0 0
1327
1328
5
0 0 0 Pv = 0 0 0
15
0
3
560
3
0 0 0 0 0 0 0 0
0 0 15 0 0 0 , 0 0 0 0 0 0 0 0 0 0 0
15
0 0
0 0 0 0 P = 0 0 0 0 0
15
0
3
315
0
5
0 0 0 0 0 0 0 0
15
0
3
315
0 0 0 0 0 0 0
15
0
3
0 0 0 0 0 0
15
0 0 0 0 0
(13.75)
(13.76) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
5
0 720 0 0 0 0 0 0 0 0 0 0 0 1 P = Pv Sv S 0 0 v P = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (13.77) iii 4 iv / 720 ) = q q The nontrivial differential relations14 given by S v j = P q j are E I (v ijv 4 v v j j j /720, vi v ii v iii iv v E I v j = q j , E I v j = q j , E I v j = q j , and E I v j = q j . The rst one is a truncation of the innite order MoDE. Elimination of all v j derivatives but v ijv yields
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
5
0 0 0 0 0 0 0 0 1 S = Svv Sv S Sv = E I 0 0 0 0 0 0
0 720 0 0 0 0 0 0 , 0 0 0 0 0 0 0 0
E I v ijv = q j ,
(13.78)
exactly. That this is not a uke can be conrmed by increasing n and while taking m = n 4. The rst 4 . The last 4 rows of P, which are columns and last 4 rows of S, which are always zero, are removed to get S =P for any also zero, are removed to get P. With m = n 4 both matrices are of order n 3 n 3. Then S n , which leads immediately to (13.78). This was conrmed with Mathematica running n up to 24. The foregoing analysis shows that the BE cubic element is nodally exact for any smooth load over a repeating lattice if consistent load computation is used. Exercise 13.18 veries that the property is lost if elements are not identical. Numerical experiments conrm these conclusions. The Laplace transform method only works part way: it gives a different innite order MoDE but recovers (13.78) as n . These accuracy properties are not widely known. If all beam elements are prismatic and subjected only to point loads at nodes, overall exactness follows from a theorem by Tong [251], which is not surprising since the exact solution is contained in the FEM approximation. For general distributed loads the widespread belief is that the cubic element incurs O ( 4 ) errors. The rst study of this nature by Waltz et. al. [260] gave the modied differential equation (MoDE) for a uniform load q as vi v
4
720
v viii + . . . =
q . EI
(13.79)
14
Derivatives of order 4 and higher are indicated by Roman numeral superscripts instead of primes.
1328
1329
The above terms are correct. In fact a more complete expression, obtained in this study, is 7 8 q viii + . . . 720 3024 720 3024 259200 (13.80) 4 But the conclusion that the principal error term is of order [260, p. 1009] is incorrect. The misinterpretation is due to (13.80) being an ODE of innite order. Truncation is ne if followed by elimination of higher derivatives. If this is done, the nite order MoDE (13.78) emerges regardless of where (13.80) is truncated; an obvious clue being the repetition of coefcients in both sides. The moral is that conclusions based on innite order ODEs should be viewed with caution, unless corroborated by independent means. EI vi v v viii + vx =q qiv + q vi 13.6.2. *Accuracy of Timoshenko Beam Element Following the same procedure it can be shown that the innite order MoDE for a Timoshenko beam element repeating lattice with the stiffness (13.18) and consistent node forces is EI v ijv + = qj
2 i vv j 4 4 6
7 8 v xii + . . . 259200
12
4
(1 + 5 5 720
6
iii + vv j
(20 + 7
2
70 60480
+ 35
vx j + ...
(1 + 5 ) i v qj + 720
= 12 E I /(G As 2 ). (13.81) = 0. Elimination of higher order derivatives gives the nite order MoDE (aka in which E I v ijv = q j
2
(20 + 14 35 60480
i qv j ) + ...,
12
qj = qj
EI q . G As j
(13.82)
which repeats for any n > 8. This happens to be the exact governing differential equation for a statically loaded Timoshenko beam [95, p. 23]. Consequently the Timoshenko beam is nodally exact under the same conditions previously stated for the Bernoulii-Euler model. Notes and Bibliography The material in this Chapter interwines the very old and the very new. Before energy methods came to the FEM forefront by 1960 (see historical sketch in 1.7), ordinary differential equations (ODE) and exibility methods were essential part of the toolbox repertoire of the professional structural engineer. Traces of that dominance may be found in the books by Przemieniecki [205], Pestel and Leckie [194] and the survey by Gallagher [108]. Energy derivations were popularized by Archer [11,12], Martin [170] and Melosh [178,179]. For one-dimensional elements, however, results are often identical. This can provide a valuable crosscheck. The Legendre interpolation (13.2) was introduced in [85,88] to study optimal mass-stiffness combinations for beam elements in the context of nite element templates [78]. The diagonal covariance matrices Qn given in (13.4) play a key role in model customization. The hinged element stiffness (13.14) is rederived in the Advanced FEM Lecture Notes [86] using a mixed variational principle. The separation of uncoupled rigidity effects in stiffness forms such as (13.8) and (13.9) is suggested by template theory [92]. The Timoshenko beam model was originally proposed in [243]. Timoshenko cleverly packaged the model with miscellaneous ingredients introduced earlier by Bresse and Hencky. It has become important as a tool for transient response and control simulations because its dynamic form is strictly hyperbolic.15 The Timoshenko beam element stiffness (13.18) rst appeared in [255] in the guise of a spar element for use in aircraft structures;
15
The Bernoulli-Euler beam dynamic model is parabolic and thus exhibits an innite transverse wave speed. Such a model is unsuitable for wave propagation problems.
1329
1330
the end node freedoms of that element differring from the classical set used here. The particular form (13.18) is derived in Section 5.6 of [205] using ODEs. This beam model pertains to the class of C 0 elements that have been extensively studied in the FEM literature after 1968. The book of Hughes [142] provides a comprehensive treatment of such methods for beams and plates. The classical work on beams on elastic foundations is by Hetenyi [133]. Useful solutions are tabulated in Roark-Youngs handbook [212]. That the use of homogeneous solutions of governing differential equations yields nodally-exact stiffness equations was rst proven generally by Tong [251] in a Galerkin context. This derivation procedure, however, was rarely used after the 1960s. Two obstacles: (1) it is largely restricted to either one dimensional elements, or to problems with special symmetries that can be modeled with ODEs;16 (2) rapidly increasing solution complexity in complicated problems discouraged hand derivations. Whereas the rst limitation still holds, the increasing availability of CAS allows timely consideration of more difcult problems. The construction of the exact beam-on-Winkler-foundation element in 13.3 offers a case in point. Using Mathematica the complete derivation, checking and fully-symbolic testing took about 6 hours, whereas a hand derivation, coding and numerical testing would likely take weeks or months. The main application of exact elements appears to be a priori error estimation: how many simpler elements are needed to do the job of an exact one? The construction of stiffness matrices from exibility information was historically one of the rst techniques by which stiffness equations of MoM members were derived. The rigid body injection method of 13.4.4 largely follows Section 6.6 of [205]. The presentation of discrete-system equilibrium theorems in 13.4.2 includes a new ingredient missing from previous work: handling non-self-equilibrated loading systems. This extension removes the 40-year-old objection that exibility methods (or more generally, schemes based on the TCPE principle) are unable to produce equivalent or consistent node forces. The use of equilibrium methods for multidimensional nite elements was pioneered by Fraeijs de Veubeke in the 1960s and early 1970s. His obsession with solution bounding got these methods seriously stuck, however, because of difculties in interelement connections that maintain system-level equilibrium, as well as avoidance of spurious modes. More practical extensions lead to the so-called Trefftz and equilibrium hybrid methods. These are presently the topic of active research17 but require advanced variational techniques beyond the scope of this book. Another recent advance is the discovery of the free-free exibility as the true dual of the free-free stiffness [82,90,83]. This extension relies heavily on projection operators. That Hermitian BE element models are nodally exact if consistent loads are used is stated in [148, Sec. 8.3] as the beam theorem. Despite the name, no proof is given; only anecdotal evidence it was likely discovered by numerical experimentation. A proof based on Fourier series appears in [95]. As the study in 13.6 illustrates, modied equation methods in boundary value problems18 are delicate and should be used with care. Their intricacies bafed Strang and Fix who, upon doing Fourier analysis of a cubic beam element, incorrectly stated [228, p. 171] that only one of the discrete equations that for v(x ) is consistent and the others are completely inconsistent. The alternative is the variational approach to error analysis. Although more robust and forgiving, predictions are often so conservative as to be of little value. References Referenced items have been moved to Appendix R.
16 17 18
For example, symmetrically loaded circular plates or shells of revolution. Along with discontinuous Galerkin methods, a reinvention of Fraeijs de Veubekes weakly diffusive models. They are more forgiving in initial value problems.
1330
1331
Homework Exercises for Chapter 13 Advanced One-Dimensional Elements
Exercises
EXERCISE 13.1 [A:15] Evaluate the strain and stress elds associated with the Timoshenko beam displacement eld (13.16). EXERCISE 13.2 [A/C:20] Find the consistent node forces for a Timoshenko beam element under a uniform
(a) (b)
Find the end displacement v2 and end rotation 2 in terms of P , E , G , I , As and L . Compare with the analytical values P L 3 /(3 E I ) + P L /(G As ) and P L 2 /(2 E I ), respectively. Why does the nite element model provides the exact answer with one element?
EXERCISE 13.5 [A:25] (Requires math ability). Discuss what happens in (13.18) if EXERCISE 13.6 [A:10] For a given number of elements N e of length
. Is the result useful for a shear-only spar element? Hint: eliminate 1 and 2 by a master-slave MFC. = 2 L / N e , relate and in Example
13.2.
EXERCISE 13.7 [A/C:40] (research paper level). Derive an exact Timoshenko-beam-on-Winkler-foundation equation method.element using the differential equation method. EXERCISE 13.8 [C:30] Write Mathematica code to verify the nodal exactness conclusion of 13.6.1 using the repeated differentiation approach. EXERCISE 13.9 [C:30] As above, but using the Laplace transform. Show that this only does half the job. EXERCISE 13.10 [A/C:35] Find the general symbolic expression of the terms in the innite order MoDE
(13.80).
EXERCISE 13.11 [A/C:40] (research paper level) Analyze nodal accuracy if the length of the beam elements . in the lattice of Figure 13.22 alternates between (1 ) , where 0 1 2 EXERCISE 13.12 [A/C:35] Using Mathematica, verify the results (13.81) and (13.82) in 13.6.2.
1331
\HideDisplacementBoxes \hfuzz=100pt \footline={\hfill IFEM Ch 13 -- Slide \folio \hfill} \hSlide -25pt $$\BoxedEPSF{IFEM.Ch13.Slide01.eps scaled 600}$$ \ven
\bye
IFEM.Ch13.Slides.tex
page 1
14
141
142
TABLE OF CONTENTS
Page
14.1. Introduction 14.1.1. Plate in Plane Stress . . . . 14.1.2. Mathematical Model . . . 14.2. Plane Stress Problem Description 14.2.1. Given Problem Data . . . . 14.2.2. Problem Unknowns . . . . 14.3. Linear Elasticity Equations 14.3.1. Governing Equations . . . . 14.3.2. Boundary Conditions . . . 14.3.3. Weak Forms versus Strong Form 14.3.4. Total Potential Energy . . . 14.4. Finite Element Equations 14.4.1. Displacement Interpolation . . 14.4.2. Element Energy . . . . . 14.4.3. Element Stiffness Equations . 14. Notes and Bibliography . . . . . . . . . . . 14. References . . . . . . . . . . . 14. Exercises . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . . . . .
143 143 144 144 144 145 146 147 147 148 149 1410 1410 1411 1411 1412 1412 1413
142
14.1 INTRODUCTION
We now pass to the variational formulation of two-dimensional continuum nite elements. The problem of plane stress will serve as the vehicle for illustrating such formulations. As narrated in 1.7.1, continuum nite elements were invented in the aircraft industry (at Boeing, early 1950s) to solve this kind of problem when it arose in the design and analysis of delta wing panels [323]. The problem is presented here within the framework of the linear theory of elasticity. 14.1.1. Plate in Plane Stress In structural mechanics, a at thin sheet of material is called a plate.1 The distance between the plate faces is called the thickness and denoted by h . The midplane lies halfway between the two faces. z The direction normal to the midplane is the transverse direction. Directions parallel to the midplane are called in-plane directions. The global axis z will be oriented along the transverse direction. Axes x and y are placed in the midplane, forming a right-handed Rectangular Cartesian Coordinate (RCC) system. Thus the midplane equation is z = 0. See Figure 14.1.
y x
Figure 14.1. A plate structure in plane stress.
A plate loaded in its midplane is said to be in a state of plane stress, or a membrane state, if the following assumptions hold: 1. 2. 3. 4. All loads applied to the plate act in the midplane direction, and are symmetric with respect to the midplane. All support conditions are symmetric about the midplane. In-plane displacements, strains and stresses can be taken to be uniform through the thickness. The normal and shear stress components in the z direction are zero or negligible.
The last two assumptions are not necessarily consequences of the rst two. For the latter to hold, the thickness h should be small, typically 10% or less, than the shortest in-plane dimension. If the plate thickness varies it should do so gradually. Finally, the plate fabrication must exhibit symmetry with respect to the midplane. To these four assumptions we add the following restriction: 5. The plate is fabricated of the same material through the thickness. Such plates are called transversely homogeneous or (in aerospace) monocoque plates.
The last assumption excludes wall constructions of importance in aerospace, in particular composite and honeycomb sandwich plates. The development of mathematical models for such congurations requires a more complicated integration over the thickness as well as the ability to handle coupled bending and stretching effects, and will not be considered here.
1
If it is relatively thick, as in concrete pavements or Argentinian beefsteaks, the term slab is also used but not for plane stress conditions.
143
144
y
Midplane
Mathematical idealization
Plate
Remark 14.1. Selective relaxation from assumption 4 leads to the so-called generalized plane stress state, in
which z stresses are accepted. The plane strain state is obtained if strains in the z direction are precluded. Although the construction of nite element models for those states has many common points with plane stress, we shall not consider those models here. For isotropic materials the plane stress and plane strain problems can be mapped into each other through a ctitious-property technique; see Exercise 14.1.
Remark 14.2. Transverse loading on a plate produces plate bending, which is associated with a more complex conguration of internal forces and deformations. This subject is studied in more advanced courses.
14.1.2. Mathematical Model The mathematical model of the plate in plane stress is a two-dimensional boundary value problem (BVP). The BVP is posed over a plane domain with a boundary , as illustrated in Figure 14.2. In this idealization the third dimension is represented as functions of x and y that are integrated through the plate thickness. Engineers often work with internal plate forces, which result from integrating the in-plane stresses through the thickness. See Figure 14.3. 14.2. Plane Stress Problem Description 14.2.1. Given Problem Data Domain geometry. This is dened by the boundary illustrated in Figure 14.2.
Thickness. Most plates used as structural components have constant thickness. If the thickness does vary, in which case h = h (x , y ), it should do so gradually to maintain the plane stress state. Material data. This is dened by the constitutive equations. Here we shall assume that the plate material is linearly elastic but not necessarily isotropic. Specied Interior Forces. These are known forces that act in the interior of the plate. There are of two types. Body forces or volume forces are forces specied per unit of plate volume; for example the plate weight. Face forces act tangentially to the plate faces and are transported to the midplane. For example, the friction or drag force on an airplane skin is of this type if the skin is modeled to be in plane stress. Specied Surface Forces. These are known forces that act on the boundary of the plate. In elasticity these are called surface tractions. In actual applications it is important to know whether these forces are specied per unit of surface area or per unit length. 144
145
14.2
pxx
pxy
dy dx
In-plane stresses
y
h
dx dy
yy xx xy = yx
y x
h bx by
In-plane strains
dx dy h
In-plane displacements
dx dy h
eyy e xx e xy = eyx
y x
ux
uy
Figure 14.3. Notational conventions for in-plane stresses, strains, displacements and internal forces of a thin plate in plane stress.
Displacement Boundary Conditions. These specify how the plate is supported. Points on the plate boundary may be xed, allowed to move in one direction, or subject to multipoint constraints. In addition symmetry and antisymmetry lines may be identied as discussed in Chapter 8. If no displacement boundary conditions are imposed, the plate structure is said to be free-free. 14.2.2. Problem Unknowns The unknown elds are displacements, strains and stresses. Because of the assumed wall fabrication homogeneity the in-plane components are assumed to be uniform through the plate thickness. Thus the dependence on z disappears and all such components become functions of x and y only. Displacements. The in-plane displacement eld is dened by two components: u( x , y ) = u x (x , y ) u y (x , y ) (14.1)
The transverse displacement component u z (x , y , z ) component is generally nonzero because of Poissons ratio effects, and depends on z . However, this displacement does not appear in the governing equations. Strains. The in-plane strain eld forms a tensor dened by three independent components: ex x , e yy and ex y . To allow stating the FE equations in matrix form, these components are conventionally arranged to form a 3-component strain vector e(x , y ) = ex x ( x , y ) e yy (x , y ) 2ex y (x , y ) 145 (14.2)
146
Body forces
b
Equilibrium DT + b = 0 in (aka Balance)
Stresses
Strains
Constitutive
=Ee or e = C in
Force BCs
T n = t or pT n = q ^ on t
^
Figure 14.4. The Strong Form of the plane stress equations of linear elastostatics displayed as a Tonti diagram. Yellow boxes identify prescribed elds whereas orange boxes denote unknown elds. The distinction between Strong and Weak Forms is explained in 14.3.3.
The factor of 2 in ex y shortens strain energy expressions. The shear strain components ex z and e yz vanish. The transverse normal strain ezz is generally nonzero because of Poissons ratio effects. This strain does not enter the governing equations as unknown, however, because the associated stress zz is zero. This eliminates the contribution of zz ezz to the internal energy. Stresses. The in-plane stress eld forms a tensor dened by three independent components: x x , yy and x y . As in the case of strains, to allow stating the FE equations in matrix form, these components are conventionally arranged to form a 3-component stress vector (x , y ) = x x ( x , y ) yy (x , y ) x y ( x , y ) (14.3)
The remaining three stress components: zz , x z and yz , are assumed to vanish. The plate internal forces are obtained on integrating the stresses through the thickness. Under the assumption of uniform stress distribution, px x = x x h , p yy = yy h , px y = x y h . (14.4)
These p s also form a tensor. They are called membrane forces in the literature. See Figure 14.3. 14.3. Linear Elasticity Equations We shall develop plane stress nite elements in the framework of classical linear elasticity. The necessary governing equations are presented below. They are graphically represented in the Strong Form Tonti diagram of Figure 14.4.
146
14.3
The three internal elds: displacements, strains and stresses 14.114.3 are connected by three eld equations: kinematic, constitutive and internal-equilibrium equations. If initial strain effects are ignored, these equations read ex x / x 0 ux , e yy = 0 / y uy 2ex y / y / x E 11 E 12 E 13 ex x x x yy = E 12 E 22 E 23 e yy , x y E 13 E 23 E 33 2ex y x x b 0 / x 0 / y . yy + x = by 0 0 / y / x x y The compact matrix version of 14.5 is e = D u, = E e, DT + b = 0, (14.6)
(14.5)
Here E = ET is the 3 3 stress-strain matrix of plane stress elastic moduli, D is the 3 2 symmetric-gradient operator and its transpose the 2 3 tensor-divergence operator.2 If the plate material is isotropic with elastic modulus E and Poissons ratio , the moduli in the E /(1 + ) = G , E 12 = E 11 constitutive matrix E reduce to E 11 = E 22 = E /(1 2 ), E 33 = 1 2 and E 13 = E 23 = 0. See also Exercise 14.1. 14.3.2. Boundary Conditions Boundary conditions prescribed on may be of two types: displacement BC or force BC (the latter is also called stress BC or traction BC). To write down those conditions it is conceptually convenient to break up into two subsets: u and t , over which displacements and force or stresses, respectively, are specied. See Figure 14.5. Displacement boundary conditions are prescribed on . u=u
u
are prescribed displacements. Often u = 0. This happens in xed portions of the boundary, Here u as the ones illustrated in Figure 14.5. Force boundary conditions (also called stress BCs and traction BCs in the literature) are specied on t . They take the form . n = t (14.8) Here t are prescribed surface tractions specied as a force per unit area (that is, not integrated through the thickness), and n is the stress vector shown in Figure 14.5.
2
147
148
n (unit t exterior normal)
^ t
nt nn
^ tn ^ t
^ tt
Figure 14.5. Displacement and force (stress, traction) boundary conditions for the plane stress problem.
= t h . This form is used more often than 14.8 in structural design, particularly Here pn = n h and q when the plate wall construction is inhomogeneous. The components of n in Cartesian coordinates follow from Cauchys stress transformation formula x x n x + x y n y n = x y n x + yy n y nx = 0 0 ny ny nx x x yy x y , (14.10)
in which n x and n y denote the Cartesian components of the unit normal vector ne (also called the y = ny . x = nx and t direction cosines of the normal). Thus 14.8 splits into two scalar conditions: t The derivation of 14.10 is the subject of Exercise 14.4. It is sometimes convenient to write the condition 14.8 in terms of normal n and tangential t directions: n , nn = t t nt = t (14.11)
in which nn = nx n x + ny n y and nt = nx n y + ny n x .
Remark 14.3. The separation of into u and t is useful for conciseness in the mathematical formulation, such as the energy integrals presented below. It does not exhaust, however, all BC possibilities. Frequently at points of one species a displacement in one direction and a force (or stress) in the other. An example of these are roller and sliding conditions as well as lines of symmetry and antisymmetry. To cover these situations one needs either a generalization of the split, in which u and t are permitted to overlap, or to dene another portion m for mixed conditions. Such generalizations will not be presented here, as they become unimportant once the FE discretization is done.
148
149
Displacement Prescribed BCs Displacements displacements ^ u u = u ^ u on u
e = D u Kinematic in
14.3
Body forces
b
= 0 in
Equilibrium (weak)
Strains
Constitutive
=Ee or e = C in
Stresses
Figure 14.6. The TPE-based Weak Form of the plane stress equations of linear elastostatics. Weak links are marked with grey lines.
14.3.3. Weak Forms versus Strong Form We introduce now some further terminology from variational calculus. The Tonti diagram of Figure 14.4 is said to display the Strong Form of the governing equations because all relations are veried point by point. These relations, called strong links, are shown in the diagram with black lines. A Weak Form is obtained by relaxing one or more strong links. Those are replaced by weak links, which enforce relations in an average or integral sense rather than point by point. The weak links are then provided by the variational formulation chosen for the problem. Because in general many variational forms of the same problem are possible, there are many possible Weak Forms. On the other hand the Strong Form is unique. The Weak Form associated with the Total Potential Energy (TPE) variational form is illustrated in Figure 14.6. The internal equilibrium equations and stress BC become weak links, which are drawn by gray lines. These equations are given by the variational statement = 0, where the TPE functional is given in the next subsection. The FEM displacement formulation discussed below is based on this particular Weak Form. 14.3.4. Total Potential Energy As usual the Total Potential Energy functional for the plane stress problem is given by = U W. The internal energy is the elastic strain energy: U=
1 2
(14.12)
h T e d
1 2
h eT E e d .
(14.13)
The derivation details are relegated to Exercise E14.5. The external energy is the sum of contributions from known interior and boundary forces: W = h uT b d +
t
td . h uT
(14.14)
149
1410
t.
Note that the boundary integral over is taken only over over which tractions or forces are specied. 14.4. Finite Element Equations The necessary equations to apply the nite element method to the plane stress problem are collected here and expressed in matrix form. The domain of Figure 14.7(a) is discretized by a nite element mesh as illustrated in Figure 14.7(b). From this mesh we extract a generic element labeled e with n 3 node points. In subsequent derivations the number n is kept arbitrary. Therefore, the formulation is applicable to arbitrary two-dimensional elements, for example those sketched in Figure 14.8. To comfortably accommodate general element types, the node points will be labeled 1 through n . These are called local node numbers. Numbering will always start with corners.
(a)
(b)
(c)
The element domain and boundary are denoted by e and e , respectively. The element has 2n degrees of freedom. These are collected in the element node displacement vector in a node by node arrangement: (14.15) ue = [ u x 1 u y 1 u x 2 . . . u xn u yn ]T . 14.4.1. Displacement Interpolation The displacement eld ue (x , y ) over the element is interpolated from the node displacements. We shall assume that the same interpolation functions are used for both displacement components.3 Thus
n n
u x (x , y ) =
i =1
Nie (x , y ) u xi ,
u y (x , y ) =
i =1
Nie (x , y ) u yi ,
(14.16)
where Nie (x , y ) are the element shape functions. In matrix form: u(x , y ) = u x (x , y ) = u y (x , y )
e N1 0
0 e N1
e N2 0
0 e N2
... ...
e Nn 0
0 e e e u = Nu . Nn
(14.17)
This N (with superscript e omitted to reduce clutter) is called the shape function matrix. It has dimensions 2 2n . For example, if the element has 4 nodes, N is 2 8. The interpolation condition on the element shape function Nie (x , y ) states that it must take the value one at the i th node and zero at all others. This ensures that the interpolation 14.17 is correct at the nodes. Additional requirements on the shape functions are stated in later Chapters.
3
This is the so called element isotropy condition, which is studied and justied in advanced FEM courses.
1410
1411
3
2
14.4
3
4 6 1 2 1 4
5 2
4 9 10 1 12 11 5
3 7 6 2
n=3
n=4
n=6
n = 12
Figure 14.8. Example plane stress nite elements, characterized by their number of nodes n .
Differentiating the nite element displacement eld yields the strain-displacement relations: Ne e e Nn N2 1 0 0 . . . x 0 x x e e e Nn N2 N1 e e 0 ... 0 e(x , y ) = 0 (14.18) y y y u = B u . e e e e e e Nn Nn N1 N2 N2 N1 . . . y x y x y x This B = D N is called the strain-displacement matrix. It is dimensioned 3 2n . For example, if the element has 6 nodes, B is 3 12. The stresses are given in terms of strains and displacements by = E e = EBue , which is assumed to hold at all points of the element. 14.4.2. Element Energy To obtain nite element stiffness equations, the variation of the TPE functional is decomposed into contributions from individual elements: where Ue = and We =
e
= U e W e = 0.
e
(14.19)
e
1 2
h T e d
e
1 2
h eT Ee d
e
(14.20)
h uT b d
+
e
td h uT
(14.21)
Note that in 14.21 te has been taken equal to the complete boundary e of the element. This is a consequence of the fact that displacement boundary conditions are applied after assembly, to a free-free structure. Consequently it does not harm to assume that all boundary conditions are of stress type insofar as forming the element equations. 14.4.3. Element Stiffness Equations Inserting the relations u = Nue , e = Bue and = Ee into nodal displacements e =1 ue T Ke ue ue T fe . 2 1411
e
1412
h BT EB d
(14.23)
h NT b d
+
e
td h NT
(14.24)
In the second integral of 14.24 the matrix N is evaluated on the element boundary only. The calculation of the entries of Ke and fe for several elements of historical or practical interest is described in subsequent Chapters.
Notes and Bibliography The plane stress problem is well suited for introducing continuum nite elements, from both historical and technical standpoints. Some books use the Poisson equation for this purpose, but problems such as heat conduction cannot illustrate features such as vector-mixed boundary conditions and shear effects. The rst continuum structural nite elements were developed at Boeing in the early 1950s to model delta-wing skin panels [63,323]. A plane stress model was naturally chosen for the panels. The paper that gave the method its name [55] used the plane stress problem as application driver. The technical aspects of plane stress can be found in any book on elasticity. A particularly readable one is the excellent textbook by Fung [134], which is unfortunately out of print. References Referenced items have been moved to Appendix R.
1412
1413
Homework Exercises for Chapter 14 The Plane Stress Problem
Exercises
EXERCISE 14.1 [A+C:15] Suppose that the structural material is isotropic, with elastic modulus E and Poissons ratio . The in-plane stress-strain relations for plane stress (zz = x z = yz = 0) and plane strain (ezz = ex z = e yz = 0) as given in any textbook on elasticity, are
plane stress:
x x yy x y x x yy x y
plane strain:
0 0 1 2 1 E = (1 + )(1 2) 0 E = 1 2
1 0
1 0
ex x e yy 2ex y 1 0
, 0 0 1 ( 1 2) 2 ex x e yy 2ex y (E14.1) .
Show that the constitutive matrix of plane strain can be formally obtained by replacing E by a ctitious modulus E and by a ctitious Poissons ratio in the plane stress constitutive matrix. Find the expression of E and in terms of E and . You may also chose to answer this exercise by doing the inverse process: go from plane strain to plain stress by replacing a ctitious modulus and Poissons ratio in the plane strain constitutive matrix. This device permits reusing a plane stress FEM program to do plane strain, or vice-versa, as long as the material is isotropic. Partial answer to go from plane stress to plane strain: = /(1 ).
EXERCISE 14.2 [A:25] In the nite element formulation of near incompressible isotropic materials (as well
constants and instead of E and as plasticity and viscoelasticity) it is convenient to use the so-called Lame in the constitutive equations. Both and have the physical dimension of stress and are related to E and by E E , =G= . (E14.2) = (1 + )(1 2) 2(1 + ) Conversely E= (3 + 2) , + = . 2( + ) (E14.3)
Substitute (E14.3) into (E14.1) to express the two stress-strain matrices in terms of and . Then split the stress-strain matrix E of plane strain as (E14.4) E = E + E in which E and E contain only and , respectively, with E diagonal and E 33 = 0. This is the Lame or {, } splitting of the plane strain constitutive equations, which leads to the so-called B-bar formulation of near-incompressible nite elements.4 Express E and E also in terms of E and . = 2/( + 2) with For the plane stress case perform a similar splitting in which where E contains only 5 E 33 = 0, and E is a diagonal matrix function of and . Express E and E also in terms of E and .
4
Equation (E14.4) is sometimes referred to as the deviatoric+volumetric splitting of the stress-strain law, on account of its physical meaning in plane strain. That meaning is lost, however, for plane stress. see [288, pp. 254ff]. For the physical signicance of
1413
1414
EXERCISE 14.3 [A:20] Include thermoelastic effects in the plane stress constitutive eld equations, assuming
a thermally isotropic material with coefcient of linear expansion . Hint: start from the two-dimensional Hookes law including temperature: ex x = 1 (x x yy ) + E T, e yy = 1 ( yy x x ) + E T, 2ex y = x y / G , (E14.5) T in one vector
in which T = T (x , y ) and G = 1 E /(1 + ). Solve for stresses and collect effects of 2 of thermal stresses.
EXERCISE 14.4 [A:15] Derive the Cauchy stress-
to-traction equations 14.10 using force equilibrium along x and y and the geometric relations shown in Figure E14.1. (This is the wedge method in Mechanics of Materials.) Hint: tx ds = x x dy + x y d x , etc.
y x
x x
ty dy ds dx
x y = y x
yy
EXERCISE 14.5 [A:25=5+5+15] A plate is in linearly elastic plane stress. It is shown in courses in elasticity that the internal strain energy density stored per unit volume is
(x x ex x + yy e yy + x y ex y + yx e yx ) = 1 (x x ex x + yy e yy + 2x y ex y ). U= 1 2 2 (a) Show that (E14.6) can be written in terms of strains only as eT E e, U= 1 2 and hence justify 14.13. (b) Show that (E14.6) can be written in terms of stresses only as T C , U= 1 2 where C = E1 is the elastic compliance (strain-stress) matrix. (c)
(E14.6)
(E14.7)
(E14.8)
Suppose you want to write (E14.6) in terms of the extensional strains {ex x , e yy } and of the shear stress x y = yx . This is known as a mixed representation. Show that U=
1 2
ex x e yy x y
ex x e yy x y
(E14.9)
and explain how the entries Ai j of the matrix A that appears in (E14.9) can be calculated6 in terms of the elastic moduli E i j .
The process of computing A is an instance of partial inversion of matrix E. It is closely related to the Schur complement concept covered in Appendix P.
1414
1415
Exercises
Note the following Table list relations between commonly used moduli for isotropic linear elastic material. Here K is the bulk modulus whereas M is the P-wave modulus used in seismology.
(, ) K =
( E , )
( K , )
( K , ) 9K 3 K + 2 K 3
(, ) 1+ 3
( E , ) E 3(12) 2(1+)
( K , )
(K , E )
K 3 K 3 K 2 3 K 2(3 K +) 4 K+ 1 3
1415
Introduction to FEM
14
IFEM Ch 14 Slide 1
Introduction to FEM
y x
Inplane dimensions: in x,y plane
IFEM Ch 14 Slide 2
Introduction to FEM
Midplane
Plate
IFEM Ch 14 Slide 3
Introduction to FEM
IFEM Ch 14 Slide 4
Introduction to FEM
z
dx dy
pxx
pxy
dy dx
In-plane stresses
y
h
dx dy
xx
yy xy = yx
y x
h bx by
In-plane strains
dx dy h
In-plane displacements
dx dy h
e xx e xy = eyx
eyy
y x
ux
uy
IFEM Ch 14 Slide 5
Introduction to FEM
yy x x x y = y x
z x
y x
h
p yy px x px y
IFEM Ch 14 Slide 6
Introduction to FEM
^ t
IFEM Ch 14 Slide 7
Introduction to FEM
IFEM Ch 14 Slide 8
Introduction to FEM
displacements
ex x ( x , y ) e( x , y ) = e yy ( x , y ) 2ex y ( x , y ) x x ( x , y ) ( x , y ) = yy ( x , y ) x y ( x , y )
stresses
IFEM Ch 14 Slide 9
Introduction to FEM
e = Du
= Ee
DT + b = 0
IFEM Ch 14 Slide 10
Introduction to FEM
Prescribed displacements
^ u
Displacements
Body forces
u e=Du in
Kinematic
Strains
Stresses
Force BCs T n = ^ t or pT n = q ^ on t
IFEM Ch 14 Slide 11
Introduction to FEM
Prescribed displacements
^ u
Body forces
e=Du in =Ee in
Constitutive
= 0 in
Strains
Stresses
= 0 on t
IFEM Ch 14 Slide 12
Introduction to FEM
h T e d
1 2
h eT Ee d h uT td
t
W =
h uT b d
body forces
boundary tractions
IFEM Ch 14 Slide 13
Introduction to FEM
(a)
(b)
(c)
IFEM Ch 14 Slide 14
Introduction to FEM
3 4 6 1 2 1
3 5 2 4 10 1
4 9 12 11 5
3 7 6 2
n=3
n=4
n=6
n = 12
IFEM Ch 14 Slide 15
Introduction to FEM
= Ue W e
e
Ue = We =
1 2
h T e d h uT b d
e
= +
1 2
h eT E e d
e
h uT t d
e
IFEM Ch 14 Slide 16
Introduction to FEM
0 e N1
N2 0
0 N2e
... ...
Nne 0
0 e e u Nn
= N ue
IFEM Ch 14 Slide 17
Introduction to FEM
0
e N1
N2 x 0
0
e N2
Nne x 0 Nne y
0 Nne y e Nn x e u =
y e N1 x
e N2
y e N2 x
B ue
IFEM Ch 14 Slide 18
Introduction to FEM
1 2
u e Ke u e u e f e
Ke =
Consistent node force vector
h BT E B d
e
fe =
h NT b d
e
td h NT
e
IFEM Ch 14 Slide 19
Introduction to FEM
Interpolation Condition Ni takes on value 1 at node i, 0 at all other nodes Continuity (intra- and inter-element) and Completeness Conditions are covered later in the course (Chs. 18-19)
IFEM Ch 14 Slide 20
1416
0 0
Em 2 1
Em 1 2 1
Em 1 2 , star 1 2
Em 1 2 Em 1 2 Em 1 2 Em 1 2
0 0
Em 2 2
Check
Figure E14.2. Solution for Exercise 14.1. Plane strain to plane stress.
0 0
Em 2 2
Em , star 2
1
Em 1 1 2 2 Em 1 2 2 Em 1 2 2 Em 1 1 2 2
0 0
Em 2 2
Check
Figure E14.3. Solution for Exercise 14.1. Plane stress to plane strain.
1416
1417
It gives E = E and = . Credit is given for doing it either way. 1 1 2 + 2 0 E 2(1 + ) 0 + 2 0 0 2 0 0 0 0 2 0 0 1 +
Solutions to Exercises
E=
2 0 0
0 2 0
0 0 1
+ 1 1 0 1 1 0
1 1 0 0 0 0
1 1 0
0 0 0 = E + E .
(E14.10)
E (1 + )(1 2)
2 0 0 0 2 0 0 0 2 0 0 0 2 0 0 0 1 +
2 1 0 1 2 0 0 0 0 1 1 0 1 1 0 0 0 0 = E + E .
(E14.11)
E 2(1 + )
E 1 2
= (The second step above is actually unnecessary, one could go directly to the third expression.) Here 2 e constant; the inverse relation being = 2/(2 ). 2/( + 2) = E /(1 ) is a modied Lam
EXERCISE 14.3 A solution using Mathematica is shown in Figure E14.4. In this script gxy stands for 2ex y .
ClearAll[Em, ,,Gm,exx,eyy,gxy,sxx,syy,sxy,T]; Gm=Em/(2*(1+ )); s={sxx,syy,sxy}; e={exx,eyy,gxy}; eqs={exx==(sxx- *syy)/Em+*T,eyy==(syy- *sxx)/Em+*T,gxy==sxy/Gm}; s=Simplify[s/.Solve[eqs,s][[1]]]; Emat=Simplify[Table[Coefficient[s[[i]],e[[j]]],{i,1,3},{j,1,3}]]; Tmat=Simplify[Table[Coefficient[s[[i]],T],{i,1,3}]]; Print["Emat=",Emat//MatrixForm,", Tmat=",Tmat];
Emat=
Em 1+ 2 Em 1+ 2 Em 1+ 2 Em 1+ 2
0 0
Em 2+ 2
Tmat=
Em Em , ,0 1 + 1 +
Transcribing the answer: 0 ex x 1 E T, (E14.12) e yy 0 1 1 1 2ex y 0 2 The only difference with respect to the rst of E14.1 is the thermal stress vector, which vanishes if T = 0. This form may be found in any book on elasticity. = E 1 2
EXERCISE 14.4
x x yy x y
1 0
1 0
Equilibrium along x and y give tx ds = x x d x + yx dy and t y ds = x y d x + yy dy , respectively. Dividing through by ds and setting d x /ds = n x , dy /ds = n y , yx = x y , yields 14.10.
1417
1418
EXERCISE 14.5
The verication of (a) and (b) is immediate on expanding the quadratic forms. Item (c) is more difcult. A brute force solution using Mathematica for an arbitrary material matrix E is shown in Figure E14.5.
ClearAll[exx,eyy,gxy,sxx,syy,sxy,E11,E22,E33,E12,E13,E23]; Emat={{E11,E12,E13},{E12,E22,E23},{E13,E23,E33}}; s={sxx,syy,sxy}; e={exx,eyy,gxy}; m={exx,eyy,sxy}; eqs={sxx==E11*exx+E12*eyy+E13*gxy,syy==E12*exx+E22*eyy+E23*gxy, sxy==E13*exx+E23*eyy+E33*gxy}; sol=Simplify[Simplify[Solve[eqs,{sxx,syy,gxy}]]]; Print[sol]; U=Simplify[(e.Emat.e/2)/.sol[[1]]]; fac[i_,j_]:=If[i==j,1,1/2]; A=Table[fac[i,j]*Coefficient[U,m[[i]]*m[[j]]],{i,1,3},{j,1,3}]; Print["A=",A//MatrixForm];
sxx syy E11 exx E12 exx
E13 2 E11 E33 2 E33
sxy sxy
E E E2 11 33 13 2 E 33 A=
symm
E 12 E 33 2 E 13 E 23 4 E 33 2 E 22 E 33 E 23 2 E 33
(E14.13)
0
1 2 E 33
To do this by hand, one may start by establishing the following transformation: ex x e yy 2ex y = 1 0 E 13 / E 33 0 1 E 23 / E 33 0 0 1/ E 33 ex x e yy x y (E14.14)
or e = Tm, in which m is the mixed vector of strains and stresses required for this item. The last relation in (E14.14) follows on solving x y = E 13 ex x + E 23 e yy + E 33 (2ex y ) for 2ex y . Since the energy density U is invariant, 2U = eT Ee = mT TT E T m = mT A m. (E14.15) So A = TT E T, which would reproduce (E14.12).
1418
15
151
152
TABLE OF CONTENTS
Page
15.1. Introduction 15.2. Background 15.2.1. Parametric Representation of Functions . . . . . 15.2.2. Geometry . . . . . . . . . . . . . . . 15.2.3. Triangular Coordinates . . . . . . . . . . 15.2.4. Linear Interpolation . . . . . . . . . . . . 15.2.5. Coordinate Transformations . . . . . . . . 15.2.6. Partial Derivatives . . . . . . . . . . . . 15.2.7. *Homogeneous Polynomials in Triangular Coordinates 15.2.8. *Interesting Points and Lines . . . . . . . . . 15.3. The Turner Triangle 15.3.1. Displacement Interpolation . . . . . . . . . 15.3.2. Strain-Displacement Equations . . . . . . . . 15.3.3. Stress-Strain Equations . . . . . . . . . . 15.3.4. The Stiffness Matrix . . . . . . . . . . . 15.3.5. The Consistent Nodal Force Vector . . . . . . 15.3.6. Implementation . . . . . . . . . . . . . 15.3.7. *Consistency Verication . . . . . . . . . 15.3.8. *Checking Continuity . . . . . . . . . . . 15.3.9. *Checking Completeness . . . . . . . . . 15.3.10. *Tonti Matrix Diagram . . . . . . . . . . . 15.4. *Derivation Using Natural Strains and Stresses 15.4.1. *Natural Strains and Stresses . . . . . . . . 15.4.2. *Covariant Node Displacements . . . . . . . 15.4.3. *The Natural Stiffness Matrix . . . . . . . . 15.5. *The Veubeke Equilibrium Triangle 15.5.1. *Kinematic Relations . . . . . . . . . . . 15.5.2. *Stiffness Matrix . . . . . . . . . . . . 15.5.3. *Implementation . . . . . . . . . . . . . 15.5.4. *Spurious Kinematic Modes . . . . . . . . 15.6. *Shear Locking in Turner Triangles 15.6.1. *The Inplane Bending Test . . . . . . . . . 15.6.2. *Energy Ratios . . . . . . . . . . . . . 15.6.3. *Convergence as Mesh is Rened . . . . . . . 15. Notes and Bibliography . . . . . . . . . . . . . . . . . . 15. References. . . . . . . . . . . . . . . . . . . 15. Exercises . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . .
. . . .
. . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
153 153 153 154 154 155 155 156 157 157 158 158 158 158 159 159 1510 1511 1511 1512 1512 1512 1513 1514 1514 1514 1515 1515 1516 1517 1518 1518 1519 1519 1520 1521 1523
152
15.2
BACKGROUND
This Chapter derives element stiffness equations of three-node triangles constructed with linear displacements for the plane stress problem formulated in Chapter 14. These elements have six displacement degrees of freedom, which are placed at the connection nodes. There are two main versions that differ on where the connection nodes are located: 1. 2. The Turner triangle has connection nodes located at the corners. The Veubeke equilibrium triangle has connection nodes located at the side midpoints.
The triangle geometry is dened by the corner locations or geometric nodes in both cases. Of the two versions, the Turner triangle is by far the most practically important one in solid and structural mechanics.1 Thus most of the material in this Chapter is devoted to it. It enjoys several important properties: (i) It belongs to both the isoparametric and subparametric element families, which are introduced in the next Chapter.
(ii) It allows closed form derivations for the stiffness matrix and consistent force vector without need for numerical integration. (iii) It cannot be improved by the addition of internal degrees of freedom. Properties (ii) and (iii) are shared by the Veubeke equilibrium triangle. Since this model is rarely used in structural applications it is covered only as advanced material in 15.5. The Turner triangle is not a good performer for structural stress analysis. It is still used in problems that do not require high accuracy, as well as in non-structural applications such as thermal and electromagnetic analysis. One reason is that triangular meshes are easily generated over arbitrary two-dimensional domains using techniques such as Delaunay triangulation. 15.2. Background 15.2.1. Parametric Representation of Functions The concept of parametric representation of functions is crucial in modern FEM. Together with multidimensional numerical integration, it is a key enabling tool for developing elements in two and three space dimensions.2 Without these tools the developer would become lost in an algebraic maze as element geometry and shape functions get more complicated. The essentials of parametric representation can be illustrated through a simple example. Consider the following alternative representations of the unit-circle function, x 2 + y 2 = 1: (I) y = 1 x 2, (II) x = cos and y = sin . (15.1)
The direct representation (I) ts the conventional function notation, i.e., y = f (x ). Given a value of x , it returns one or more y . On the other hand, the parametric representation (II) is indirect: both x
1
The triangle was one of the two plane-stress continuum elements presented by Turner, Clough, Martin and Topp in their 1956 paper [323]. This publication is widely regarded as the start of the present FEM. The derivation was not done, however, with assumed displacements. See Notes and Bibliography at the end of this Chapter. Numerical integration is not useful for the triangular elements covered here, but essential in the more complicated iso-P models covered in Chapters 16ff.
153
154
and y are given in terms of one parameter, the angle . Elimination of through the trigonometric identity cos2 + sin2 = 1 recovers x 2 + y 2 = 1. But there are situations in which working with the parametric form throughout the development is more convenient. Continuum nite elements provide a striking illustration of this point. 15.2.2. Geometry The geometry of the 3-node triangle shown in Figure 15.1(a) is specied by the location of its three corner nodes on the {x , y } plane. Nodes are labelled 1, 2, 3 while traversing the sides in counterclockwise fashion. Their location is dened by their Cartesian coordinates: {xi , yi } for i = 1, 2, 3.
(a)
3 (x3 ,y3)
(b)
Area A > 0 2 (x2 ,y2)
The Turner triangle has six degrees of freedom, 1 1 (x 1 ,y1) dened by the six corner displacement compox nents { u xi , u yi }, for i = 1, 2, 3. The interpoz up, toward you lation of the internal displacements { u x , u y } from these six values is studied in 15.3, after Figure 15.1. The three-node, linear-displacement plane stress triangular element: (a) geometry; (b) area triangular coordinates are introduced. The and positive boundary traversal. triangle area can be obtained as 1 1 1 2 A = det x1 x2 x3 = (x2 y3 x3 y2 ) + (x3 y1 x1 y3 ) + (x1 y2 x2 y1 ). (15.2) y1 y2 y3 The area given by 15.2 is a signed quantity. It is positive if the corners are numbered in cyclic counterclockwise order (when looking down from the +z axis), as illustrated in Figure 15.1(b). This convention is followed in the sequel. 15.2.3. Triangular Coordinates Points of the triangle may also be located in terms of a parametric coordinate system: 1 , 2 , 3 . (15.3) In the literature these 3 parameters receive an astonishing number of names, as the list collected in Table 15.1 shows. In the sequel the name triangular coordinates will be used to emphasize the close association with this particular geometry. Equations i = constant (15.4) represent a set of straight lines parallel to the side opposite to the i th corner, as depicted in Figure 15.2. The equations of sides 23, 31 and 12 are 1 = 0, 2 = 0 and 3 = 0, respectively. The three corners have coordinates (1,0,0), (0,1,0) and (0,0,1). The three midpoints of the sides have coordinates ( 1 , 1 , 0), (0, 1 , 1 ) and ( 1 , 0, 1 ), the centroid has coordinates ( 1 , 1 , 1 ), and so on. The 2 2 2 2 2 2 3 3 3 coordinates are not independent because their sum is unity: 1 + 2 + 3 = 1. 154 (15.5)
155
3
1 = 0 2 = 0
15.2
3
2 = 1
BACKGROUND
3
/ / /
3 = 1
/ / /
2 1
/ / /
2 1
2
3 = 0
1 = 1
Table 15.1 Names of element parametric coordinates Name natural coordinates isoparametric coordinates shape function coordinates barycentric coordinates Mo bius coordinates triangular coordinates area (also written areal) coordinates Applicable to all elements isoparametric elements isoparametric elements simplices (triangles, tetrahedra, ...) triangles all triangles straight-sided triangles
Triangular coordinates normalized as per 1 + 2 + 3 = 1 are often qualied as homogeneous in the mathematical literature.
Remark 15.1. In pre-1970 FEM publications, triangular coordinates were often called area coordinates, and
occasionally areal coordinates. This comes from the following interpretation: i = A jk / A, where A jk is the area subtended by the subtriangle formed by the point P and corners j and k , in which j and k are 3-cyclic permutations of i . Historically this was the way coordinates were dened in 1960s papers. However this relation does not carry over to general isoparametric triangles with curved sides and thus it is not used here.
15.2.4. Linear Interpolation Consider a function f (x , y ) that varies linearly over the triangle domain. In terms of Cartesian coordinates it may be expressed as f ( x , y ) = a0 + a1 x + a2 y , (15.6)
where a0 , a1 and a2 are coefcients to be determined from three conditions. In nite element work such conditions are often the nodal values taken by f at the corners: f1, f2, f3. The expression in triangular coordinates makes direct use of those three values: 1 f (1 , 2 , 3 ) = f 1 1 + f 2 2 + f 3 3 = [ f 1 f 2 f 3 ] 2 3 Formula 15.8 is called a linear interpolant for f . 155 = [ 1 2 3 ] f1 f2 f3 . (15.8) (15.7)
156
15.2.5. Coordinate Transformations Quantities that are closely linked with the element geometry are best expressed in triangular coordinates. On the other hand, quantities such as displacements, strains and stresses are usually expressed in the Cartesian system {x , y }. Thus we need transformation equations through which it is possible to pass from one coordinate system to the other. Cartesian and triangular coordinates are linked by the relation 1 x y 1 x1 y1 1 x2 y2 1 x3 y3 1 2 3
(15.9)
The rst equation says that the sum of the three coordinates is one. The next two express x and y linearly as homogeneous forms in the triangular coordinates. These are obtained by applying the linear interpolant 15.8 to the Cartesian coordinates: x = x1 1 + x2 2 + x3 3 and y = y1 1 + y2 2 + y3 3 . Assuming A = 0, inversion of 15.9 yields 1 x . y (15.10) Here x jk = x j xk , y jk = y j yk , A is the triangle area given by 15.2 and A jk denotes the area subtended by corners j , k and the origin of the x y system. If this origin is taken at the centroid of the triangle, A23 = A31 = A12 = A /3. 1 = 2A 1 = 2A 15.2.6. Partial Derivatives From equations 15.9 and 15.10 we immediately obtain the following relations between partial derivatives: y x = xi , = yi , (15.11) i i 2A i = y jk , x 2A i = xk j . y (15.12) 1 2 3 x2 y3 x3 y2 x3 y1 x1 y3 x1 y2 x2 y1 y2 y3 y3 y1 y1 y2 x3 x2 x1 x3 x2 x1 1 x y 2 A23 2 A31 2 A12 y23 y31 y12 x32 x13 x21
In 15.12 j and k denote the 3-cyclic permutations of i . For example, if i = 2, then j = 3 and k = 1. The derivatives of a function f (1 , 2 , 3 ) with respect to x or y follow immediately from 15.12 and application of the chain rule: 1 f = x 2A 1 f = y 2A f y + 1 23 f x + 1 32 f y + 2 31 f x + 2 13 f y 3 12 f x 3 21
(15.13)
156
157
(a) 3
1 2 2 C 3
15.2 BACKGROUND
(b) 3
1 3
(c) RC 2
2
3
1
2 1
OC
3
f 1 f 2 f 3
(15.14)
With these mathematical ingredients in place we are now in a position to handle the derivation of straight-sided triangular elements, and in particular the Turner and Veubeke triangles.
15.2.7. *Homogeneous Polynomials in Triangular Coordinates Because 1 , 2 and 3 are not independent, polynomial functions in those variables are not unique. For example 3 21 + 2 33 and 1 + 42 are identical, since they differ by 3 3(1 + 2 + 3 )=0. To achieve uniqueness it is necessary to write the function as a homogeneous polynomial, as in the second form of this example. To reduce the general linear polynomial c000 + c100 1 + c010 2 + c001 3 to homogeneous form, subtract c000 (1 1 2 3 ), which is zero, to get P1 = (c100 c000 )1 + (c010 c000 )2 + (c001 c000 )3 .
2 2 2 To reduce the general quadratic polynomial c000 + c100 1 + c010 2 + c001 3 + c200 1 + c020 2 + c002 3 + c110 1 2 + c011 2 3 + c101 3 1 to homogeneous form, subtract (c000 + c100 1 + c010 2 + c001 3 )(1 1 2 3 ).
And so on. All polynomial expressions used in this book for triangles are expressed in homogeneous form. 15.2.8. *Interesting Points and Lines Some distinguished lines and points of a straight-sided triangle are briey described here for use in other developments as well as in Exercises. The triangle medians are three lines that join the corners to the midpoints of the opposite sides, as pictured in Figure 15.3(a). The midpoint opposite corner i is labeled Mi . The medians 1 M1 , 2 M2 and 3 M3 have equations 2 = 3 , 3 = 1 and 1 = 2 , respectively, in triangular , 1 , 1 }. Other names for the centroid are coordinates. They intersect at the centroid C of coordinates { 1 3 3 3 barycenter and center of gravity. If you make a real triangle out of cardboard, you can balance the triangle at this point. It can be shown that the centroid trisects the medians, that is to say, the distance from a corner to the centroid is twice the distance from the centroid to the opposite side of the triangle. The altitudes are three lines that connect each corner with their projections onto the opposing sides, as depicted in Figure 15.3(b). The projection of corner i is identied Hi , so the altitudes are 1 H1 , 2 H2 and 3 H3 . Locations Hi are called altitude feets. The altitudes intersect at the triangle orthocenter H . The lengths of those segments are the triangle heights. The triangular coordinates of Hi and H , as well as the altitude equations, are worked out in an Exercise.
157
158
Another interesting point is the center OC of the circumscribed circle, or circumcircle. This is the unique circle that passes through the three corners, as shown in Figure 15.3(c). It can be geometrically constructed by drawing the normal to each side at the midpoints. Those three lines, called the perpendicular side bisectors, intersect at OC . A famous theorem by Euler asserts that the centroid, the orthocenter and the circumcircle center fall on a straight line, called the Euler line. Furthermore, C lies between OC and H , and the distance OC H is three times the distance H C .
15.3. The Turner Triangle The simplest triangular element for plane stress (and in general, for 2D problems of variational index m = 1) is the three-node triangle with linear shape functions, with degrees of freedom located at the corners. The shape functions are simply the triangular coordinates. That is, Nie = i for i = 1, 2, 3. When applied to the plane stress problem, this element is called the Turner triangle. 15.3.1. Displacement Interpolation For the plane stress problem we select the linear interpolation 15.8 for the displacement components u x and u y at an arbitrary point P (1 , 2 , 3 ): u x = u x 1 1 + u x 2 2 + u x 3 3 , u y = u y 1 1 + u y 2 2 + u y 3 3 . (15.15)
The interpolation is illustrated in Figure 15.4. The two expressions in 15.15 can be combined in a matrix form that bets the expression (14.17) for an arbitrary plane stress element: ux1 u y1 ux 0 2 0 3 0 u x 2 = 1 = N ue , uy 0 1 0 2 0 3 u y 2 ux3 u y3 (15.16) where N is the matrix of shape functions. 15.3.2. Strain-Displacement Equations
u y3
3
P(1 , 2 , 3 )
u x by linear u y interpolation
P uy1
1
ux
ux1
Figure 15.4. Displacement interpolation over triangle.
The strains within the elements are obtained by differentiating the shape functions with respect to x and y . Using 15.14, 15.16 and the general form (14.18) we get ux1 u y23 0 y31 0 y12 0 y 1 1 u (15.17) e = D N ue = 0 x32 0 x13 0 x21 x 2 = B ue , u y2 2A x y x y x y 32 23 13 31 21 12 ux3 u y3 in which D denotes the symbolic strain-to-displacement differentiation operator given in (14.6), and B is the strain-displacement matrix. Note that the strains are constant over the element. This is the origin of the name constant strain triangle (CST) given it in many nite element publications. 158
15.3
The stress eld is related to the strain eld by the elastic constitutive equation in (14.5), which is repeated here for convenience: = x x yy x y = E 11 E 12 E 13 E 12 E 22 E 23 E 13 E 23 E 33 ex x e yy 2ex y = E e, (15.18)
where E i j are plane stress elastic moduli. The constitutive matrix E will be assumed to be constant over the element. Because the strains are constant, so are the stresses. 15.3.4. The Stiffness Matrix The element stiffness matrix is given by the general formula (14.23), which is repeated here Ke =
e
h BT EB d ,
(15.19)
where e is the triangle domain, and h the plate thickness that appears in the plane stress problem. Since B and E are constant, they can be taken out of the integral: Ke = BT EB
e
hd
(15.20)
If h is uniform over the element the remaining integral in 15.20 is simply h A, and we obtain the closed form y23 0 h y31 e T K = Ah B EB = 4A 0 y12 0 0 x32 0 x13 0 x21 x32 y23 x13 y31 x21 y12
E 11 E 12 E 13 E 12 E 22 E 23 E 13 E 23 E 33
y23 0 y31 0 y12 0 0 x32 0 x13 0 x21 x32 y23 x13 y31 x21 y12
(15.21) Exercise 15.1 deals with the case of a linearly varying plate thickness. 15.3.5. The Consistent Nodal Force Vector For simplicity we consider here only internal body forces3 dened by the vector eld b= bx by (15.22)
For consistent force computations corresponding to distributed boundary loads over a side, see Exercise 15.4.
159
1510
Trig3TurnerMembraneStiffness[ncoor_,Emat_,h_,numer_]:=Module[{ x1,x2,x3,y1,y2,y3,x21,x32,x13,y12,y23,y31,A,Be,Ke}, {{x1,y1},{x2,y2},{x3,y3}}=ncoor; A=Simplify[(x2*y3-x3*y2+(x3*y1-x1*y3)+(x1*y2-x2*y1))/2]; {x21,x32,x13,y12,y23,y31}={x2-x1,x3-x2,x1-x3,y1-y2,y2-y3,y3-y1}; Be={{y23,0,y31,0,y12,0},{0,x32,0,x13,0,x21}, {x32,y23,x13,y31,x21,y12}}/(2*A); If [numer, Be=N[Be]]; Ke=A*h*Transpose[Be].Emat.Be; Return[Ke]];
Figure 15.5. Implementation of Turner triangle stiffness matrix calculation as a Mathematica module.
which is specied per unit of volume. The consistent nodal force vector fe is given by the general formula (14.23) of the previous Chapter: 1 0 h 2 0 e 3 0 0 1 0 b d . 2 0 3
fe =
e
h NT b d
(15.23)
The simplest case is when the body force components 15.22 as well as the thickness h are constant over the element. Then we need the integrals 1 d
e
=
e
2 d
=
e
3 d
=1 A 3
(15.24)
by
bx
by
bx
This agrees with the simple element-by-element force-lumping procedure, which assigns one third of the total force along the {x , y } directions: Ahbx and Ahb y , to each corner.
Remark 15.2. The integrals 15.24 are particular cases of the general integration formula of monomials in triangular coordinates:
1 2A
i k 1 2 3 d
e
i ! j ! k! , (i + j + k + 2)!
i 0, j 0, k 0.
(15.26)
which can be derived through the Beta function. Here i , j , k are integer exponents. This formula only holds for triangles with straight sides, and thus does not apply for higher order elements with curved sides. Formulas 15.24 are obtained by setting exponents i = 1, j = k = 0 in 15.26, and permuting {i , j , k } cyclically.
1510
1511
Ke =
Figure 15.6. Test statements to exercise the module of Figure 15.5, and outputs.
15.3.6. Implementation The implementation of the Turner triangle in any programming language is very simple. A Mathematica module that returns Ke is shown in Figure 15.5. The module needs only 8 lines of code. It is invoked as Ke=Trig3TurnerMembraneStiffness[ncoor,Emat,h,numer]; The arguments are ncoor Emat h numer Element node coordinates, arranged as a list: { { x1,y1 },{ x2,y2 },{ x3,y3 } }. A two-dimensional list storing the 3 3 plane stress matrix of elastic moduli as { { E11,E12,E13 },{ E12,E22,E23 },{ E13,E23,E33 } }. Plate thickness, assumed uniform over the triangle. A logical ag: True to request oating-point computation, else False. (15.27)
This module is exercised by the statements listed at the top of Figure 15.6, which form a triangle with corner coordinates { { 0,0 },{ 3,1 },{ 2,2 } }, isotropic material matrix with E 11 = E 22 = 64, ) and unit thickness. The results are E 12 = 16, E 33 = 24, others zero, (that is, E = 60 and = 1 4 shown at the bottom of Figure 15.6. The computation of stiffness matrix eigenvalues is always a good programming test, since 3 eigenvalues must be exactly zero and the other 3 real and positive, as explained in Chapter 19. The last test statement draws the triangle (this plot was moved to the right of the numeric output to save space.)
15.3.7. *Consistency Verication It remains to check whether the interpolation 15.15 for element displacements meets the completeness and continuity criteria studied in Chapter 19 for nite element trial functions. Such consistency conditions are sufcient to insure convergence toward the exact solution of the mathematical model as the mesh is rened. The variational index for the plane stress problem is m = 1. According to the rules stated in 19.3, the trial functions should be 1-complete, C 0 continuous, and C 1 piecewise differentiable.
1511
1512
15.3.8. *Checking Continuity Along any triangle side, the variation of u x and u y is linear and uniquely determined by the value at the nodes on that side. For example, over side 12 of an individual triangle, which has equation 3 = 0: u x = u x 1 1 + u x 2 2 + u x 3 3 = u x 1 1 + u x 2 2 , u y = u y 1 1 + u y 2 2 + u y 3 3 = u y 1 1 + u y 2 2 .
The variation of u x and u y over side 1-2 depends only on the nodal values ux1, ux2 , u y1 and u y2.
(15.28)
An identical argument holds for that side when it belongs to an adjacent triangle, such as elements (e1) and (e2) shown in Figure 15.7. Since the node values on all elements that meet at a node are the same, u x and u y match along the side, and the trial function is C 0 interelement continuous. Because the functions are continuous inside the elements, it follows that the continuity requirement is met. 15.3.9. *Checking Completeness
(e1) 1 (e2)
The completeness condition for variational order m = 1 requires that the shape functions Ni = i be able to represent exactly any linear displacement eld: u x = 0 + 1 x + 2 y , u y = 0 + 1 x + 1 y . (15.29)
To check this we obtain the nodal values associated with the motion 15.29: u xi = 0 + 1 xi + 2 yi and u yi = 0 + 1 xi + 2 yi for i = 1, 2, 3. Replace these in 15.16 and see if 15.29 is recovered. Here are the detailed calculations for component u x : ux =
i
u xi i =
i
(0 + 1 xi + 2 yi )i =
i
(0 i + 1 xi i + 2 yi i ) (15.30)
= 0
i
i + 1
i
(xi i ) + 2
i
( yi i ) = 0 + 1 x + 2 y .
Component u y can be similarly veried. Consequently 15.16 satises the completeness requirement for the plane stress problem and in general, for any problem of variational index 1. Finally, a piecewise linear trial function is obviously C 1 piecewise differentiable and consequently has nite energy. Thus the two completeness requirements are satised. Stiffness 15.3.10. *Tonti Matrix Diagram u f
f = V B TE B u = K u
For further developments covered in more advanced courses, it is convenient to split the governing equations of the element. In the case of the Turner triangle they are, omitting element superscripts: e = Bu, = Ee, f = AT = V BT . (15.31)
Kinematic
Equilibrium
e=Bu
f=VB
Constitutive
Here V = h m A is the volume of the element, h m being the mean thickness. The equations 15.31 may be graphically represented with the diagram shown in Figure 15.8. This is a discrete Tonti diagram similar to those of Chapter 6.
=Ee
1512
1513
(a)
3 L1 = L32
(b)
(c)
d6
d5 d3 1 d2 d1
L2 = L13 2 L3 = L21 1 1
d4
Figure 15.10. Additional quantities appearing in natural strain and stress calculations: (a) side lengths, (b) side directions, (c) covariant node displacements.
15.4.
The foregoing derivation of the Turner triangle uses Cartesian strains and stresses, as well as {x , y } displacements. The only intrinsic quantities are the triangle coordinates. This advanced section examines the derivation of the element stiffness matrix through natural strains, natural stresses and covariant displacements. Although the procedure does not offer obvious shortcuts over the previous derivation, it becomes important in the construction of more complicated high performance elements. It also helps reading recent literature in assumed strain elements. 15.4.1. *Natural Strains and Stresses
32 = 1
2
(b) 13= 2
32 = 1
2
21= 3
1
21= 3
1
Figure 15.9. Geometry-intrinsic elds for the Turner triangle: (a) natural strains i , (b) natural stresses i .
Natural strains are extensional strains directed parallel to the triangle sides, as shown in Figure 15.9(a). Natural strains are denoted by 21 3 , 32 1 , and 13 2 . Similarly, natural stresses are normal stresses directed parallel to the triangle sides, as shown in Figure 15.9(b). Natural stresses are denoted by 21 3 , 32 1 , and 13 2 . Because both natural stresses and strains are constant over the triangle, no node value association is needed. The natural strains can be related to Cartesian strains by the following tensor transformation4 =
1 2 3 2 c1 2 = c2 2 c3
2 s1 2 s2 2 s3
s1 c1 s2 c2 s3 c3
ex x e yy 2ex y
1 = T e e.
(15.32)
Here c1 = x32 / L 1 , s1 = y32 / L 1 , c2 = x13 / L 2 , s2 = y13 / L 2 , c3 = x21 / L 3 , and s3 = y21 / L 3 , are sines and cosines of the side directions with respect to {x , y }, as illustrated in Figure 15.10(a,b). The inverse of this relation is e= ex x e yy 2ex y y31 y21 L 2 y12 y32 L 2 y23 y13 L 2 1 2 3 1 2 2 2 = x x L x x L x x L 31 21 12 32 23 13 1 2 3 4 A2 2 2 ( y31 x12 + x13 y21 ) L 2 1 ( y12 x 23 + x 21 y32 ) L 2 ( y23 x 31 + x 32 y13 ) L 3
1 2 3
= Te . (15.33)
1513
1514
Note that Te is constant over the triangle. From the invariance of the strain energy density T e = T it 1 follows that the stresses transform as = Te and = T e . That strain energy density may be expressed as eT Ee = U= 1 2
1 T En 2
T En = Te ETe .
(15.34)
Here En is a stress-strain matrix that relates natural stresses to natural strains as = En . It may be therefore called the natural constitutive matrix. 15.4.2. *Covariant Node Displacements Covariant node displacements di are directed along the side directions, as shown in Figure 15.10(c), which denes the notation used for them. They are related to the Cartesian node displacements by
d
1
d2 c2 d3 0 d= d4 = 0
d5 d6 0 0
s3 s2 0 0 0 0
0 0 c1 c3 0 0
0 0 s1 s3 0 0
0 0 0 0 c2 c1
0 ux1 0 u y1 0 u x 2 = Td u. 0 u y2 s2 ux3 s1 u y3
(15.35)
L y 3 31 u L y1 3 x13 ux2 0 1 u= u y2 = 2 A 0
x1
ux3 u y3
0 0
L 2 y21 L 2 x12 0 0 0 0
0 0 L 1 y12 L 1 x21 0 0
0 0 L 3 y32 L 3 x23 0 0
1
0 0 0 0 L 2 y23 L 2 x32
0 d1 0 d2 0 1 d3 = T d d. d4 0 L 1 y13 d5 L 1 x31 d6
2
(15.36)
The natural strains are evidently given by the relations (d4 d1 )/ L 3 . Collecting these in matrix form:
= (d6 d3 )/ L 1 ,
= (d2 d5 )/ L 2 and
d
1
1 2 3
0 0 1/ L 3
0 1/ L 2 0
1/ L 1 0 0
0 0 1/ L 3
0 1/ L 2 0
1/ L 1 0 0
d2 d3 = B d. d4
d5 d6
(15.37)
15.4.3. *The Natural Stiffness Matrix The natural stiffness matrix for constant thickness h is
T Ke n = ( Ah ) B En B , T En = Te E Te .
(15.38) (15.39)
(15.40)
1514
1515
(a) 3 (x3 ,y3) 5 6 2 (x2 ,y2) 4 1 (x 1 ,y1) x
(b) u y6 6
(c)
Figure 15.11. The Veubeke equilibrium triangle: (a) geometric denition; (b) degreeof-freedom conguration; (c) element patch showing how triangles are connected at the midpoints.
15.5.
The Veubeke equilibrium triangle5 differs from the Turner triangle in the degree-of-freedom conguration. As illustrated in Figure 15.11, those are moved to the midpoints {4, 5, 6} while the corner nodes {1, 2, 3} still dene the geometry of the element. In the FEM terminology introduced in Chapter 6, the geometric nodes {1, 2, 3} and the connection nodes {4, 5, 6} no longer coincide. The node displacement vector collects the freedoms shown in Figure 15.11(b): ue = [ u x 4 u y4 ux5 u y5 ux6 u y 6 ]T . (15.41)
The quickest way to formulate the stiffness matrix of this element is to relate 15.41 to the node displacements of the Turner triangle, renamed for convenience as ue T = [ ux1 15.5.1. *Kinematic Relations The node freedom vectors 15.41 and 15.42 are easily related since by linear interpolation along the sides one (u x 1 + u x 2 ), u y 4 = 1 (u y 1 + u y 2 ), etc. Expressing those links in matrix form gives obviously has u x 4 = 1 2 2 u y1 ux2 u y2 ux3 u y 3 ]T . (15.42)
u
x4
1 0 u y4 0 1 ux5 1 0 0 = u y5 2 0 0
ux6 u y6 1 0
1 0 1 0 0 0 1 0
0 1 0 1 0 0
0 0 1 0 1 0
0 1 0 1 0 ux4 1 0 1 0 1 u y 4 0 1 0 1 0 ux5 . 1 0 1 0 1 u y 5 ux3 ux6 1 0 1 0 1 0 u y3 u y6 0 1 0 1 0 1 (15.43) 1 ue , with TV T = T . The shape functions are TV
x1
1 u y1 0 ux2 1 = u y2 0
N4 = 1 + 2 3 ,
N5 = 1 + 2 + 3 ,
N6 = 1 2 + 3 .
(15.44)
Renaming the Turner triangle strain-displacement matrix of 15.17 as BT , the corresponding matrix that relates e = B ue in the Veubeke equilibrium triangle becomes B = BT TT V = 1 A y21 0 x12 0 x12 y21 y32 0 x23 0 x23 y32 y13 0 x31 0 x31 y13 (15.45)
The qualier equilibrium distinguishes this element from others created by Fraeijs de Veubeke, including the 6-node plane stress comforming triangle. See Notes and Bibliography for the original derivation from an equilibrium eld.
1515
1516
Trig3VeubekeMembraneStiffness[ncoor_,Emat_,h_,numer_]:=Module[{ x1,x2,x3,y1,y2,y3,x12,x23,x31,y21,y32,y13,A,Be,Te,Ke}, {{x1,y1},{x2,y2},{x3,y3}}=ncoor; A=Simplify[(x2*y3-x3*y2+(x3*y1-x1*y3)+(x1*y2-x2*y1))/2]; {x12,x23,x31,y21,y32,y13}={x1-x2,x2-x3,x3-x1,y2-y1,y3-y2,y1-y3}; Be={{y21,0,y32,0,y13,0}, {0,x12,0,x23,0,x31}, {x12,y21,x23,y32,x31,y13}}/A; If [numer,Be=N[Be]]; Ke=A*h*Transpose[Be].Emat.Be; Return[Ke]];
Figure 15.12. Implementation of Veubeke equilibrium triangle stiffness matrix as a Mathematica module.
15.5.2. *Stiffness Matrix The element stiffness matrix is given by the general formula (14.23). For constant plate thickness h one obtains the closed form
y
h Ke = A h BT E B = A
21
0 y32 0
y13 0
E 11 E 12 E 13 E 12 E 22 E 23 E 13 E 23 E 33 y21 0 y32 0 y13 0 0 x12 0 x23 0 x31 x12 y21 x23 y32 x31 y13 . (15.46)
The computation of consistent body forces is left as an Exercise. 15.5.3. *Implementation The implementation of the Veubeke equilibrium triangle as a Mathematica module that returns Ke is shown in Figure 15.12. It needs only 8 lines of code. It is invoked as Ke=Trig3VeubekeMembraneStiffness[ncoor,Emat,h,numer]; (15.47)
The arguments have the same meaning as those of the module Trig3TurnerMembraneStiffness described in 15.3.6.
ncoor={{0,0},{3,1},{2,2}}; Emat=8*{{8,2,0},{2,8,0},{0,0,3}}; Ke=Trig3VeubekeMembraneStiffness[ncoor,Emat,1,False]; Print["Ke=",Ke//MatrixForm]; Print["eigs of Ke=",Chop[Eigenvalues[N[Ke]]]];
140 60 4 28 136 88 60 300 12 84 72 216 4 12 44 20 40 8 28 84 20 44 8 40 136 72 40 8 176 80 88 216 8 40 80 176
Ke=
Figure 15.13. Test statements to exercise the module of Figure 15.12, and outputs.
1516
1517
4 7 9 5 7 9 5 8 13 10 5 6 3 6 2
Type I
8 1
Spurious mode:
Thickness h/2 4 3 6 2 3 12 7 11 2
7 10 5
3 6 2
7 9,10
3 6 2
Type II
8 1 4
8 1
8 1 8 5
Type III
9 1
Spurious mode:
9 6
Figure 15.14. Three macroelement assemblies fabricated with Veubeke equilibrium triangles to investigate spurious kinematic modes. Red-lled and white-lled circles mark geometric and connection nodes, respectively.
This module is exercised by the statements listed at the top of Figure 15.13, which form a triangle with corner coordinates { { 0,0 },{ 3,1 },{ 2,2 } }, isotropic material matrix with E 11 = E 22 = 64, E 12 = 16, E 33 = 24, others zero, and unit thickness. The results are shown at the bottom of Figure 15.13. This is the same triangle used to test module Trig3TurnerMembraneStiffness in 15.3.6. Note that the element is rank sufcient. 15.5.4. *Spurious Kinematic Modes Although an individual Veubeke equilibrium triangle is rank sufcient, assemblies are prone to the appearance of spurious mechanisms. That is, kinematic modes that produce no strain energy although they are not rigid body modes. These will be illustrated by studying the three macroelements pictured in Figure 15.14. For simplicity the macroelements are of rectangular shape, but the conclusions apply to more general geometries. Type I macroelement is built with two triangles. It has four geometric nodes: 14, ve connection nodes: 59, and 10 degrees of freedom. The eigenvalue analysis of the assembled stiffness K is given as an Exercise. It shows that K has 4 zero eigenvalues. Since there are 3 rigid body modes in 2D, one is spurious. It is easily shown that the spurious mode corresponds to the relative rotation of the two triangles with center node 9 as pivot, as pictured to the right of the macroelement. Type II macroelement is built with four crisscrossed triangles of thickness h /2 as illustrated in the Figure. It has four geometric nodes: 14, six connection nodes: 510, and 12 degrees of freedom. (Note that although 9 and 10 occupy the same location for this geometry, they should be considered as two separate nodes.) The eigenvalue analysis of the assembled stiffness K is given as an Exercise. It shows that K has 3 zero eigenvalues and therefore this macroelement has no spurious modes. Type III macroelement is of Union-Jack type and is built with 4 triangles. It has ve geometric nodes: 15, eight connection nodes: 613, and 16 degrees of freedom. The eigenvalue analysis of the assembled stiffness K is given as an Exercise. It shows that K has 4 zero eigenvalues and consequently one spurious mode. This correspond to the triangles rotating about the midpoints 69 as pivots, as pictured to the right of the macroelement. These examples show that this element, when used in a stiffness code, is prone to spurious pivot modes where sides of adjacent triangles rotate relatively from each other about the midpoint connector. This is a consequence
1517
M
y x 4 Type I: Crisscrossed 1
4 b = a/ 1 Thickness h/2 34
M
z a 3 2 4 1 3 2
Cross section
+
2 1 2
; ;
y b h
1518
of the element being nonconforming: full determination of linearly varying side displacements requires two nodes over that side, and there is only one. Even if a rank sufciently macroelement mesh unit such as Type II of Figure 15.14 can be constructed, there is no guarantee that spurious pivot modes will not occur when those mesh units are connected. For this reason this element is rarely used in DSM-based structural programs, but acquires importance in applications where ux conservation is important. 15.6.
A well known deciency of the 3-node Turner triangle is inability to follow rapidly varying stress elds. This is understandable since stresses within the element, for uniform material properties, are constant. But its 1D counterpart: the 2-node bar element, is nodally exact for displacements under some mild assumptions stated in Chapter 11, and correctly solves loaded-at-joints trusses with one element per member. On the other hand, the triangle can be arbitrarily way off under unhappy combinations of loads, geometry and meshing. What happens in going from 1D to 2D? New effects emerge, notably shear energy and inplane bending. These two can combine to produce shear locking: elongated triangles can become extraordinarily stiff under inplane bending because of spurious shear energy.6 The bad news for engineers is that wrong answers caused by locking are non-conservative: deections and stresses can be so grossly underestimated that safety margins are overwhelmed. To characterize shear locking quantitatively it is convenient to use macroelements in which triangles are combined to form a 4-node rectangle. This simplies repetition to form regular meshes. The rectangle response under in-plane bending is compared to that of a Bernoulli-Euler beam segment. It is well known that the latter is exact under constant moment. The response ratio of macroelement to beam is a good measure of triangle performance under bending. Such benchmarks are technically called higher order patch tests. Test results can be summarized by one number: the energy ratio, which gives a scalar measure of relative stiffness. 15.6.1. *The Inplane Bending Test The test is dened in Figure 15.15. A Bernoulli-Euler plane beam of thin rectangular cross-section of height b and thickness h is bent under applied end moments M . The beam is fabricated of isotropic material with elastic modulus E and Poissons ratio . Except for possible end effects the exact solution of the beam problem (from both the theory-of-elasticity and beam-theory standpoints) is a constant bending moment M (x ) = M along the span. The associated curvature is = M /( E Izz ) = 12 M /( Eb3 h ). The exact energy taken by a
6
The deterioration can be even more pronounced for its spatial counterpart: the 4-node tetrahedron element, because shear effects are even more important in three dimensions.
1518
1519
1 beam segment of length a is Ubeam = 1 M a = 6 M 2 a /( Eb3 h ) = 24 Eb3 h 2 a = 2 a = a is the relative rotation of two cross sections separated by a .
To study the bending performance of triangles the beam is modeled with one layer of identical rectangular macroelements dimensioned a b and made up of triangles, as illustrated in Figure 15.15. The rectangle aspect ratio is = a /b. All rectangles undergo the same deformations and thus it is enough to study a individual macroelement 1-2-3-4. Two types are considered here: Crisscrossed (CC). Formed by overlaying triangles 1-2-4, 3-4-2, 2-3-1 and 4-1-2, each with thickness h /2. Using 4 triangles instead of 2 makes the macroelement geometrically and physically symmetric since 2 triangles are attached to each corner. Union-Jack (UJ). Formed by placing a fth node at the center and dividing the rectangle into 4 triangles: 1-2-5, 2-3-5, 3-4-5, 4-1-5. By construction this element is also geometrically and physically symmetric. 15.6.2. *Energy Ratios The assembled macroelement stiffnesses are KCC and + KU J , of orders 8 8 and 10 10, respectively. For the latter the internal node 5 is statically condensed producing an 8 8 stiffness KU . To test performance we apply four alternating corner loads as shown in Figure 15.16. The resultant bending moment is M = Pb.
a/2 P 4 b = a/ P 1 a
a/2 3 P 2 P
Although triangles cannot copy curvatures pointwise,7 macroelement edges can rotate since constituent triangles can expand or contract. Because of symmetries, the rotations of sides 1-2 and 3-4 are a /2 and a /2, as illustrated in Figure 15.16. The corresponding corner x displacements are ba /4 whereas the y displacements are zero. Assemble these into a node displacement 8-vector u M . ba [ 1 uM = 1 4 0 1 0 1 0 1 0 ]T (15.48)
uT K u , which The internal energy taken by a macroelement of 8 8 stiffness K M under 15.48 is U M = 1 2 M M M 8 can be expressed as a function of E , , a , b, h and a . The ratio r M = U M / Ubeam is called the energy ratio. If r M > 1 the macroelement is stiffer than the beam because it take more energy to bend it to conform to the same edge rotations, and the 2D model is said to be overstiff. Results for zero Poissons ratio, computed with the script of Figure 15.17, are 3 rCC = 3 + 2 , 2 rU J = 3(1 + 2 )2 . 2 + 4 2 (15.49)
If for example = a /b = 10, which is an elongated rectangular shape of 10:1 aspect ratio, rCC = 153 and the crisscrossed macroelement is 153 times stiffer than the beam. For the Union-Jack conguration rU J = 10201/134 = 76.13; about twice better but still way overstiff. If = 1, rCC = 4.5 and rU J = 2: overstiff but not dramatically so. The effect of a nonzero Poissons ratio is studied in Exercise 15.10.
7 8
That is the reason why they can be so stiff under bending. The load P could be recovered via K M u M , but this value is not needed to compute energy ratios.
1519
1520
Figure 15.17. Script to compute energy ratios for the two macroelements of Figure 15.15.
15.6.3. *Convergence as Mesh is Rened Note that if = a /b 0, rCC 3 and rU J 1.5. So even if the beam of Figure 15.15 is divided into an innite number of macroelements along x the solution will not converge. It is necessary to subdivide also along the height. If 2n (n 1) identical macroelement layers are placed along the beam height while is kept xed, the energy ratio becomes r (2n) = 22n 1 + r (1) r (1) 1 = 1 + , 22n 22n (15.50)
where r (1) is the ratio 15.49 for one layer. If r (1) = 1, r (2n) = 1 for all n 1, so bending exactness is maintained as expected. If n = 1 (two layers), r (2) = (3 + r (1) )/4 and if n = 2 (four layers), r (4) = (7 + r (1) )/8. If n , r (2n) 1, but convergence can be slow. For example, suppose that = 1 (unit aspect ratio a = b) and that r (1) = rCC = 4.5. To get within 1% of the exact solution, 1 + 3.5/22n < 1.01. This is satisfed if n 5, meaning 10 layers of elements along y . If the beam span is 10 times the height, 1000 macroelements or 4000 triangles are needed for this simple problem, which is exactly solvable by one beam element. The stress accuracy of triangles is examined in Chapter 28. Notes and Bibliography As a plane stress structural element, the Turner triangle was rst developed in the 1956 paper by Turner et. al. [323]. The target application was modeling of delta wing skin panels. Arbitrary quadrilaterals were formed by assembling triangles as macroelements. Because of its geometric exibility, the element was soon adopted in aircraft structural analysis codes in the late 1950s. It moved to Civil Engineering applications through the research and teaching at Berkeley of Ray Clough, who gave the method its name in [55]. The derivation method of [323] would look unfamiliar to present FEM practicioners used to the displacement method. It was based on assumed stress modes. More precisely: the element, referred to a local Cartesian system {x , y }, is put under three constant stress states: x x , yy and x y , collected in array . Lumping the
1520
1521
15.
References
stress eld to the nodes gives the node forces: f = L. The strain eld computed from stresses is e = E1 . This is integrated to get a deformation-displacement eld, to which 3 rigid-body modes are added as integration constants. Evaluating at the nodes produces e = Au, and the stiffness matrix follows on eliminating and e: K = LEA. For constant thickness and material properties it happens that L = V AT and so K = V AT EA happily turned out to be symmetric. This A is the B of 15.17 times 2 A, so in the end the stiffness matrix (for constant plate thickness) turns out to be the same as 15.21. The derivation from assumed displacements evolved later. It is not clear who worked it out rst, although it is mentioned in [55,342]. The equivalence of the two forms, through energy principles, had been noted by Gallagher [136]. Early displacement derivations typically started from linear polynomials in Cartesian coordinates. For example Przemieniecki [261] begins with u x = c1 x + c2 y + c3 , u y = c4 x + c5 y + c6 . (15.51)
Here the ci play the role of generalized coordinates, which have to be eventually eliminated in favor of node displacements. The same approach is used by Clough in a widely disseminated 1965 article [57]. Even for this simple element the approach is unnecessarily complicated and leads to long hand computations. The elegant derivation in triangular coordinates was popularized by Argyris [12]. The idea of using piecewise linear interpolation over a triangular mesh actually precedes [323] by 13 years. As noted in Chapter 1, it appears in an article by Courant [70], where it is applied to a Poissons equation modeling St. Venants torsion. The idea did not inuence early work in FEM, however, since as noted above the derivation in [323] was not based on displacement interpolation. The Veubeke equilibrium triangle appears in [128, p. 170] and is further elaborated in [129, p. 176]. It is constructed there as an equilibrium element, that is, the stress eld inside the triangle is assumed to be x x = 1 , yy = 2 and x y = 3 , where {1 , 2 , 3 } are stress parameters. (A eld of constant stresses satises identically the plane-stress differential equilibrium equations for zero body forces.) Stress parameters can be uniquely expressed in terms of generalized edge loads, which turn out to be virtual-work conjugate to midside displacements.9 The direct displacement derivation given here as a Turner triangle mapping is new. As previously noted, this element is rarely used in structural mechanics because of the danger of spurious kinematic modes discussed in 15.5.4. It has importance, however, in some non-structural applications. The completeness check worked out in 15.4.2 is a specialization case of a general proof developed by Irons in the mid 1960s (see [190, 3.9] and references therein) for general isoparametric elements. The check works because the Turner triangle is isoparametric. What are here called triangular coordinates were introduced by Mo bius in his 1827 book [233].10 They are often called barycentric coordinates on account on the interpretation discussed in [71]. Other names are listed in Table 15.1. Triangles possess many fascinating geometric properties studied even before Euclid. An exhaustive development can be found, in the form of solved exercises, in [289]. It is unclear when the monomial integration formula 15.26 was rst derived. As an expression for integrands expressed in triangular coordinates it was rst stated in [88]. The natural strain derivation of 15.4 is patterned after that developed for the so-called ANDES (Assumed Natural Deviatoric Strain) elements [231]. For the Turner triangle it provides nothing new aside of fancy terminology. Energy ratios of the form used in 15.6 were introduced in [39] as a way to tune up the stiffness of Free-Formulation elements.
9
The initial step of assuming stresses exactly mimics that of [323] a decade earlier. What is fundamentally different in Fraeijs de Veubekes derivation is the use of energy theorems (in this case, PVW) to pass from generalized edge loads to mean edge displacements. The approach is characteristic of FEM Generation 2. He is better remembered for the Mo bius strip or Mo bius band, the rst one-sided 3D surface in mathematics.
10
1521
1522
1522
1523
Homework Exercises for Chapter 15 The Linear Plane Stress Triangle
Exercises
EXERCISE 15.1 [A:15] Assume that the 3-node plane stress triangle has variable thickness dened over the element by the linear interpolation formula
h (1 , 2 , 3 ) = h 1 1 + h 2 2 + h 3 3 ,
(E15.1)
where h 1 , h 2 and h 3 are the thicknesses at the corner nodes. Show that the element stiffness matrix is still given by 15.21 but with h replaced by the mean thickness h m = (h 1 + h 2 + h 3 )/3. Hint: use 15.20 and 15.26.
EXERCISE 15.2 [A:20] The exact integrals of triangle-coordinate monomials over a straight-sided triangle
are given by the formula 15.26, where A denotes the area of the triangle, and i , j and k are nonnegative integers. Tabulate the right-hand side for combinations of exponents i , j and k such that i + j + k 3, beginning with i = j = k = 0. Remember that 0! = 1. (Labor-saving hint: dont bother repeating exponent permutations; for example i = 2, j = 1, k = 0 and i = 1, j = 2, k = 0 are permutations of the same thing. Hence one needs to tabulate only cases in which i j k ).
EXERCISE 15.3 [A/C:20] Compute the consistent node force vector fe for body loads over a Turner triangle,
if the element thickness varies as per E15.1, bx = 0, and b y = b y 1 1 + b y 2 2 + b y 3 3 . Check that for h 1 = h 2 = h 3 = h and b y 1 = b y 2 = b y 3 = b y you recover 15.25. For area integrals use 15.26. Partial result: f y 1 = ( A /60)[b y 1 (6h 1 + 2h 2 + 2h 3 ) + b y 2 (2h 1 + 2h 2 + h 3 ) + b y 3 (2h 1 + h 2 + 2h 3 )]. Derive the formula for the consistent force vector fe of a Turner triangle of constant thickness h , if side 12 (3 = 0, 2 = 1 1 ), is subject to a linearly varying boundary force q = h t such that qx = qx 1 1 + qx 2 2 = qx 1 (1 2 ) + qx 2 2 , q y = q y 1 1 + q y 2 2 = q y 1 (1 2 ) + q y 2 2 . (E15.2)
y qy1
1
q y = q y1 (1 2 ) + q y2 2 qy2
2
q x2
This line boundary force q has dimension of force per unit of side length. Procedural Hint. Use the last term of the line integral (14.21), in which t is replaced by q/ h , and show that since the contribution of sides 2-3 and 3-1 to the line integral vanish, W = (u ) f =
e e T e
e
q x1 x
q x = q x1 (1 2 ) + q x2 2
u qd
=
0
uT q L 21 d 2 ,
(E15.3)
where L 21 is the length of side 12. Replace u x (2 ) = u x 1 (1 2 ) + u x 2 2 ; likewise for u y , qx and q y , integrate and identify with the inner product shown as the second term in (E15.3). Partial result: f x 1 = L 21 (2qx 1 +qx 2 )/6, f x 3 = f y 3 = 0. Note. The following Mathematica script solves this Exercise. If you decide to use it, explain the logic. ClearAll[ux1,uy1,ux2,uy2,ux3,uy3,z2,L12]; ux=ux1*(1-z2)+ux2*z2; uy=uy1*(1-z2)+uy2*z2; qx=qx1*(1-z2)+qx2*z2; qy=qy1*(1-z2)+qy2*z2; We=Simplify[L12*Integrate[qx*ux+qy*uy,{z2,0,1}]]; fe=Table[Coefficient[We,{ux1,uy1,ux2,uy2,ux3,uy3}[[i]]],{i,1,6}]; fe=Simplify[fe]; Print["fe=",fe];
1523
1524
EXERCISE 15.5 [C+N:15] Compute the entries of Ke for the following plane stress triangle:
This may be done by hand (it is a good exercise in matrix multiplication) or (more quickly) using the script of Figure 15.5. Partial result: K 11 = 18.75, K 66 = 118.75.
EXERCISE 15.6 [A+C:15] Show that the sum of the rows (and columns) 1, 3 and 5 of Ke as well as the sum
of rows (and columns) 2, 4 and 6 must vanish, and explain why. Check it with the foregoing script.
, y1 },{ x2 , y2 },{ x3 , y3 } }. A point P in of T 1 are { { x1 , y1 },{ x2 , y2 },{ x3 , y3 } } and those of T 2 are { { x1 T has Cartesian coordinates { x , y } and triangular coordinates { 1 , 2 , 3 }. A point P in T has Cartesian coordinates { x , y } and the same triangular coordinates. Show that { x , y } and { x , y } are connected by the afne transformation
EXERCISE 15.7 [A:10]. Consider two triangles T and T , both with positive area. The corner coordinates
1 x y
1 x1 y1
1 x2 y2
1 x3 y3
1 x1 y1
1 x2 y2
1 x3 y3
1 x y
(E15.5)
{1P , 2P , 3P }, as shown in Figure E15.2. Find the distances h P 1 , h P 2 and h P 3 of P to the three triangle sides, and the triangular coordinates of points P1 , P2 and P3 shown in the Figure (Pi is projection on the side opposite to corner i .) Show that h Pi = Pi h i = 2 Pi A / L k j , for i = 1, 2, 3, j = 2, 3, 1 and k = 3, 1, 2, in which L ji denotes the length of the side that joins corners i and j and h i is the distance from corner i to the opposite side, as illustrated in Figure E15.2. (Note: the distances {h P 1 , h P 2 , h P 3 } are called the trilinear coordinates of a point P with respect to the vertices of the triangle. They were introduced by Plu cker in 1835. They are essentially scaled versions of the triangular coordinates.)
h3
hP3
P 3 L 21
EXERCISE 15.9 [A:10]. Express the distances from the triangle centroid to the 3 sides in term of the triangle A / L 21 , 2 A / L 32 and 2 A / L 13 , where A is the area of the triangle assumed area and the side lengths. Answer: 2 3 3 3 positive and L ji is the length of side that joins corners i and j , cf. Figure E15.2, Hint: the area of each A. subtriangle subtended by the centroid and two corners is 1 3 EXERCISE 15.10 [A:20] Find the triangular coordinates of the altitude feet points H1 , H2 and H3 pictured in Figure 15.3. Once these are obtained, nd the equations of the altitudes in triangular coordinates, and the 2 2 + (L 2 coordinates of the orthocenter H . Answer for H3 : 1 = 1 13 L 32 )/(2 L 21 ), where L ji is the length of 2 side that joins corners i and j ; cf. Figure E15.2. EXERCISE 15.11 [C+D:20] Let p (1 , 2 , 3 ) represent a polynomial expression in the natural coordinates.
The integral p (1 , 2 , 3 ) d
e
(E15.6)
1524
1525
Exercises
over a straight-sided triangle can be computed symbolically by the following Mathematica module:
IntegrateOverTriangle[expr_,tcoord_,A_,max_]:=Module [{p,i,j,k,z1,z2,z3,c,s=0}, p=Expand[expr]; {z1,z2,z3}=tcoord; For [i=0,i<=max,i++, For [j=0,j<=max,j++, For [k=0,k<=max,k++, c=Coefficient[Coefficient[Coefficient[p,z1,i],z2,j],z3,k]; s+=2*c*(i!*j!*k!)/((i+j+k+2)!); ]]]; Return[Simplify[A*s]] ]; This is referenced as int=IntegrateOverTriangle[p,{ z1,z2,z3 },A,max]. Here p is the polynomial to be integrated, z1, z2 and z3 denote the symbols used for the triangular coordinates, A is the triangle area and max the highest exponent appearing in a triangular coordinate. The module name returns the integral. For example, if p=16+5*b*z2^2+z1^3+z2*z3*(z2+z3) the call int=IntegrateOverTriangle[p,{ z1,z2,z3 },A,3] returns int=A*(97+5*b)/6. Explain how the module works.
EXERCISE 15.12 [C+D:25] Explain the logic of the script listed in Figure 15.17. Then extend it to account for isotropic material with arbitrary Poissons ratio . Obtain the macroelement energy ratios as functions of and . Discuss whether the effect of a nonzero makes much of a difference if >> 1. EXERCISE 15.13 [A/C:25] Verify the conclusions of 15.5.4 as regards rank sufciency or deciency of the three Veubeke macroelement assemblies pictured in Figure 15.14. Carry out tests with rectangular macroelements dimensioned a b, constant thickness h , elastic modulus E and Poissons ratio 0. EXERCISE 15.14 [C+D:25] To nd whether shear is the guilty party in the poor performance of elongated triangles (as alledged in 15.6) run the script of Figure 15.17 with a zero shear modulus. This can be done by setting Emat=Em*{ { 1,0,0 },{ 0,1,0 },{ 0,0,0 } } in the third line. Discuss the result. Can Em be subsequently reduced to a smaller (ctitious) value so that r 1 for all aspect ratios ? Is this practical?
HomogenizedLinTrigCoorFunction[expr_,{ 1_, 2_, 3_}]:=Module[ {f=expr,rep 0,C0}, rep 0={ 1->0, 2->0, 3->0}; C0=Simplify[f/.rep 0]; f=Simplify[f-C0(1- 1- 2- 3)]; Return[f]]; HomogenizedQuadTrigCoorFunction[expr_,{ 1_, 2_, 3_}]:=Module[ {f,rep 0,C0,C1,C2,C3}, rep 0={ 1->0, 2->0, 3->0}; f=HomogenizedLinTrigCoorFunction[expr,{ 1, 2, 3}]; C1=Coefficient[f, 1]/.rep 0; C2=Coefficient[f, 2]/.rep 0; C3=Coefficient[f, 3]/.rep 0; {C1,C2,C3}=Simplify[{C1,C2,C3}]; f=Simplify[Expand[f-(C1* 1+C2* 2+C3* 3)(1- 1- 2- 3)]]; Return[f]];
Figure E15.3. Two Mathematica modules that homogenize linear and quadratic polynomials expressed in triaangular coordinates.
EXERCISE 15.15 [C:15] The two Mathematica modules listed in Figure E15.3 homogenize linear and
1525
1526
EXERCISE 15.16 [C+D:25] Access the le Trig3PlaneStress.nb from the course Web site by clicking
on the appropriate link in Chapter 15 Index. This is a Mathematica Notebook that does plane stress FEM analysis using the 3-node Turner triangle. Download the Notebook into your directory. Load into Mathematica. Execute the top 7 input cells (which are actually initialization cells) so the necessary modules are compiled. Each cell is preceded by a short comment cell which outlines the purpose of the modules it holds. Notes: (1) the plot-module cell may take a while to run through its tests; be patient; (2) to get rid of unsightly messages and silly beeps about similar names, initialize each cell twice. After you are satised everything works ne, run the cantilever beam problem, which is dened in the last input cell. After you get a feel of how this code operate, study the source. Prepare a hierarchical diagram of the modules,11 beginning with the main program of the last cell. Note which calls what, and briey explain the purpose of each module. Return this diagram as answer to the homework. You do not need to talk about the actual run and results; those will be discussed in Part III. Hint: a hierarchical diagram for Trig3PlaneStress.nb begins like Main program in Cell 8 - drives the FEM analysis GenerateNodes - generates node coordinates of regular mesh GenerateTriangles - generate element node lists of regular mesh ........
11
A hierarchical diagram is a list of modules and their purposes, with indentation to show dependence, similar to the table of contents of a book. For example, if module AAAA calls BBBB and CCCC, and BBBB calld DDDD, the hierarchical diagram may look like: AAAA - purpose of AAAA BBBB - purpose of BBBB DDDD - purpose of DDDD CCCC - purpose of CCCC
1526
1527
Hint on Exercise 15.3 (added October 19, 2011) If doing this Exercise by hand, you should process as follows. First, multiply NT by b:
Exercises
0 2 NT .b = 0
3 0
0 1 0 0 2 b y 1 1 + b y 2 2 + b y 3 3 0 3
to get a 6-vector. Entries 1,3 and 5 are zero. Entry 2 is (b y 1 1 + b y 2 2 + b y 3 3 )1 , and so on for entries 4 and 6. Next, scale this vector by h = h 1 1 + h 2 2 + h 3 3 . Entries 1,3 and 5 remain zero, whereas entries 2, 4 and 6 become cubic polynomials in the i . For example, the second entry is (h 1 1 + h 2 2 + h 3 3 ) (b y 1 1 + b y 2 2 + b y 3 3 )1 Expand these in term of cubic monomials. For example, the expanded second entry becomes
2 2 + 7 more terms h 1 b y 1 3 + h 1 b y 2 1 3 3 3 , 2 , 3 , Next, collect the i monomials that appear in entries 2, 4 and 6. The 10 possible monomials are 1 2 2 2 2 2 2 1 2 , 1 3 , 2 1 , 2 3 , 3 1 , 3 2 , and 1 2 3 . Move all monomial coefcients such as b y 1 h 1 , etc., outside the area integral, and apply the formula (15.26) to the monomial integrals. Three cases: 3 1 d
e
=
e
3 2 d
=
e
3 3 d
A 10 A 20
2 1 2 d
e
=
e
2 1 3 d
=
e
2 2 1 d
= ... =
1 2 3 =
e
A 60
Finally, collect the common factor A, collect the h factors of the b yi as in (E15.2) and you are done. Well, not quite. It is instructive to check your results for the special cases h 1 = h 2 = h 3 = h (constant thickness), and b y 1 = b y 2 = b y 3 = b y (constant body force). If both the thickness h and the body force b y are constant, the total force on the element, which is then b y h A, should divide equally in 3 for each node. This would agree with the element-by-element force lumping recipe of Section 7). If you are good in Mathematica, the result can be obtained in milliseconds, but you need to use the module listed under Exercise 15.11.
1527
Introduction to FEM
15
IFEM Ch 15 Slide 1
Introduction to FEM
Triangles are Still Popular Because of Geometric Versatility and Ease of Automated Mesh Generation
IFEM Ch 15 Slide 2
Introduction to FEM
(a)
3 (x3 ,y3)
(b)
3 Area A > 0
2 (x2 ,y2)
1 (x1 ,y1)
IFEM Ch 15 Slide 3
Introduction to FEM
IFEM Ch 15 Slide 4
Introduction to FEM
Triangular Coordinates
1
3
1 = 0 2 = 0
2
3
2 = 1
3
3
/ / /
3 = 1
/ / /
2 1
/ / /
2 1
2
3 = 0
1 = 1
1 + 2 + 3 = 1
IFEM Ch 15 Slide 5
Introduction to FEM
f ( x , y ) = a0 + a1 x + a2 y
Variation defined by 3 corner values Natural form
f1, f2, f3 1 f 3 ] 2 3
f ( 1 , 2 , 3 ) = f 1 1 + f 2 2 + f 3 3 = [ f 1 = [ 1 2 f1 3 ] f 2 f3
f2
IFEM Ch 15 Slide 6
Introduction to FEM
1 x y
1 x1 y1
1 x2 y2
1 x3 y3
IFEM Ch 15 Slide 7
Introduction to FEM
1 = 2A
Here A jk
x jk = x j xk yjk = yj yk denotes the area subtended by corners j, k and the origin of the x-y system
IFEM Ch 15 Slide 8
Introduction to FEM
i = 1,2,3
j = 2,3,1 k = 3,1,2
IFEM Ch 15 Slide 9
Introduction to FEM
f = f ( 1 , 2 , 3 )
f 1 = x 2A 1 f = y 2A f 1 x f = 2A y y23 x32 y31 x13 y12 x21 f y23 + 1 f x32 + 1 f y31 + 2 f x13 + 2 f y12 3 f x21 3 f 1 f 2 f 3
IFEM Ch 15 Slide 10
Introduction to FEM
uy3
3
P( 1 , 2 ,3 ) ux3 uy ux uy2 u x2
2
by linear interpolation
uy1
1
ux1
IFEM Ch 15 Slide 11
Introduction to FEM
ux uy
1 0
0 1
2 0
0 2
3 0
0 3
IFEM Ch 15 Slide 12
Introduction to FEM
Strain-Displacement Relations
ux1 u y 1 0 ux2 e x21 u y2 = B u y12 ux3 u y3
y23 1 0 e = D N ue = 2A x32
0 x32 y23
y31 0 x13
0 x13 y31
y12 0 x21
Stress-Strain Relations
E 11 x x = yy = E 12 x y E 13 E 12 E 22 E 23 ex x E 13 E 23 e yy = Ee E 33 2ex y
IFEM Ch 15 Slide 13
Introduction to FEM
h BT EB d
e
hd
e
0 1 y31 = 2 4A 0
y12 0
E 11 E 12 E 13
E 12 E 22 E 23
E 13 E 23 E 33
y23 0 x32
0 x32 y23
y31 0 x13
0 x13 y31
y12 0 x21
0 x21 y12
hd
e
IFEM Ch 15 Slide 14
Introduction to FEM
23
0 h y31 Ke = 4A 0
y12 0
E 11 E 12 E 13
E 12 E 22 E 23
E 13 E 23 E 33
y23 0 x32
0 x32 y23
y31 0 x13
0 x13 y31
y12 0 x21
0 x21 y12
IFEM Ch 15 Slide 15
Introduction to FEM
fe =
h ( Ne ) T b d
e
IFEM Ch 15 Slide 16
Introduction to FEM
1 d =
2 d =
3 d =
1 3
we get
bx by bx Ah fe = 3 by bx by
* These area integrals are instances of a general formula given on the next slide
IFEM Ch 15 Slide 17
Introduction to FEM
1 d =
2 d =
3 d =
1 3
(*)
where exponents i, j, k are nonnegative integers: i 0, j 0, k 0. To get (*) set i = 1, j = k = 0, then permute cyclically. The general formula is valid for triangles with straight sides and constant metric. It does not extend to curved-side triangles, a restriction not mentioned in FEM textbooks.
IFEM Ch 15 Slide 18
Introduction to FEM
q y = q y1 (1 2 ) + q y2 2 qy2
2
qx2
qy1
x
1
q x1
q x = q x1 (1 2 ) + q x2 2
IFEM Ch 15 Slide 19
Introduction to FEM
IFEM Ch 15 Slide 20
Introduction to FEM
IFEM Ch 15 Slide 21
1521
Homework Exercises for Chapter 15.
Solutions to Exercises
Solutions
EXERCISE 15.1 From (15.21):
Ke = BT EB
e
(h 1 1 + h 2 2 + h 3 3 ) d
(E15.6)
From (15.27): 1 d
e
=
e
2 d
=
e
3 d
A . 3
(E15.7)
Replacing we get Ke = Ah m BT EB, (E15.8) where h m = (h 1 + h 2 + h 3 )/3 is the mean thickness. This also happens to be the thickness at the centroid.
EXERCISE 15.2 Tabulation of the right-hand side of (15.27) for i + j + k 3:
i 0 1 2 1 3 2 1
j 0 0 0 1 0 1 1
k 0 0 0 0 0 0 1
that with i = 2, j = 1, k = 0 to 2 A /60; and that with i = j = k = 1 to A /60. The x forces vanish: f xi = 0, i = 1, 2, 3. For the y forces: f y1 =
EXERCISE 15.3 Use (15.27). The integral with monomial exponents i = 3, j = k = 0 evaluates to 6 A /60;
A b y 1 (6h 1 + 2h 2 + 2h 3 ) + b y 2 (2h 1 + 2h 2 + h 3 ) + b y 3 (2h 1 + h 2 + 2h 3 ) (E15.9) 60 f y 2 and f y 3 follow by 3-cyclic permutation. Verication for b y 1 = b y 2 = b y 3 = b y and h 1 = h 2 = h 3 = h gives h Ab y /3 at the three corners, which is the element-by-element lumping.
EXERCISE 15.4
(E15.10)
EXERCISE 15.5
6.25 3.125
12.5 6.25 6.25 6.25 12.5 15.625 75.0 37.5 62.5 37.5 75.0 43.75 62.5 43.75 68.75 31.25 87.5 28.125
(E15.11)
1521
1522
motion along x and consequently the element node forces obtained from fe = Ke ue must be exactly zero. These forces are the sum of columns 1, 3 and 5. A similar result is obtained for columns 2, 4 and 6 on switching x and y . Because the stiffness matrix is symmetric, the same result holds on replacing columns by rows. (The result extends to any mechanical nite element.)
EXERCISE 15.7 Not assigned. EXERCISE 15.8 Not assigned. EXERCISE 15.9 Not assigned. EXERCISE 15.10 Not assigned. EXERCISE 15.11 Not assigned EXERCISE 15.12 The answer should be a hierarchical diagram such as
Main program in Cell 8 - drives the FEM analysis GenerateNodes - generates node coordinates of regular mesh GenerateTriangles - generate element node lists of regular mesh GenerateEndAxialForces - generates end axial forces on cantilever GenerateEndMomentForces - generates end moment forces on cantilever GenerateEndShearForces - generates end-shear loads on cantilever Plot2DMesh - plots a 2D mesh LinearSolutionOfPlaneStressModel - drives solution of FEM problem AssembleMasterStiffOfPlaneStressModel - assembles master stiffness StiffnessOf3NodePlaneStressTriangle - forms element stiffness MergeElemIntoMasterStiff - merges element stiffness into master stiffness ModifyNodeForcesForDBC - modifies node forces for displacement BC ModifyMasterStiff - modifies master stiffness for displacement BC (Linear solution: done by Mathematica built-in Inverse function) StressesInPlaneStressModel - recovers element stresses ContourPlotNodeFuncOver2DMesh - Contourplots a node-defined function over 2D mesh PlotFunctionOverTriangle - plot function over triangle ContourPolyColor - picks polygon display color PlotFunctionOverQuadrilateral - like title says ContourPolyColor - picks polygon display color ContourPlotElemFuncOver2DMesh - Contourplots an element-defined function over 2D mesh PlotFunctionOverTriangle - plot function over triangle ContourPolyColor - picks polygon display color PlotFunctionOverQuadrilateral - like title says ContourPolyColor - picks polygon display color
1522
16
161
162
TABLE OF CONTENTS
Page
16.1. Introduction 16.2. Isoparametric Representation 16.2.1. Motivation . . . . . . . . . . . 16.2.2. Equalizing Geometry and Displacements . . 16.3. General Isoparametric Formulation 16.4. Triangular Elements 16.4.1. The Linear Triangle . . . . . . . . 16.4.2. The Quadratic Triangle . . . . . . . 16.4.3. *The Cubic Triangle . . . . . . . . 16.5. Quadrilateral Elements 16.5.1. Quadrilateral Coordinates and Iso-P Mappings 16.5.2. The Bilinear Quadrilateral . . . . . . 16.5.3. The Biquadratic Quadrilateral . . . . . 16.6. Completeness Properties of Iso-P Elements 16.6.1. *Completeness Analysis . . . . . . . 16.6.2. Completeness Checks . . . . . . . . 16.6.3. *Completeness for Higher Variational Index 16.7. Iso-P Elements in One and Three Dimensions 16. Notes and Bibliography . . . . . . . . . . . . . . . . 16. References . . . . . . . . . . . . . . . 16. Exercises . . . . . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
163 163 163 164 165 165 166 166 166 166 166 167 167 168 168 169 1611 1611 1611 1611 1612
162
16.2
ISOPARAMETRIC REPRESENTATION
The procedure used in Chapter 15 to formulate the stiffness equations of the linear triangle can be formally extended to quadrilateral elements as well as higher order triangles. But one quickly encounters technical difculties: 1. 2. The construction of shape functions that satisfy consistency requirements for higher order elements with curved boundaries becomes increasingly complicated. Integrals that appear in the expressions of the element stiffness matrix and consistent nodal force vector can no longer be evaluated in simple closed form.
These two obstacles can be overcome through the concepts of isoparametric elements and numerical quadrature, respectively. The combination of these two ideas transformed the eld of nite element methods in the late 1960s. Together they support a good portion of what is presently used in production nite element programs. In the present Chapter the concept of isoparametric representation is introduced for two dimensional elements. This representation is illustrated on specic elements. In the next Chapter these techniques, combined with numerical integration, are applied to quadrilateral elements. 16.2. Isoparametric Representation 16.2.1. Motivation The linear triangle presented in Chapter 15 is an isoparametric element although was not originally derived as such. The two key equations are (15.10), which denes the triangle geometry, and (15.16), which denes the primary variable, in this case the displacement eld. These equations are reproduced here for convenience: 1 x y = 1 x1 y1 1 x2 y2 1 x3 y3 1 2 3 , (16.1) (16.2)
e e e + u x 2 N2 + u x 3 N3 = u x 1 1 + u x 2 2 + u x 3 3 , u x = u x 1 N1 e e e u y = u y 1 N1 + u y 2 N2 + u y 3 N3 = u y 1 1 + u y 2 2 + u y 3 3 .
The interpretation of these equations is as follows. The triangular coordinates dene the element geometry via (16.1). The displacement expansion (16.2) is dened by the shape functions, which are in turn expressed in terms of the triangular coordinates. For the linear triangle, shape functions and triangular coordinates coalesce. These relations are diagrammed in Figure 16.1. Evidently geometry and displacements are not treated equally. If we proceed to higher order triangular elements while keeping straight sides, only the displacement expansion is rened whereas the geometry denition remains the same. 163
Triangular coordinates 1 , 2 , 3
Geometry 1, x, y
Displacement interpolation ux , uy
164
Geometry 1, x, y
Triangular coordinates 1 , 2 , 3
Elements built according to the foregoing prescription are called superparametric, a term that emphasizes that unequal treatment. 16.2.2. Equalizing Geometry and Displacements On rst inspection (16.2) and (16.1) do not look alike. Their inherent similarity can be displayed, however, if the second one is rewritten and adjoined to (16.1) to look as follows: 1 1 1 1 1 1 1 e x2 x3 1 x2 x 3 N1 x1 x x1 e . (16.3) y2 y3 2 = y1 y2 y3 N2 y = y1 e u x 1 u x 2 u y3 3 u x 1 u x 2 u y3 N3 ux uy u y1 u y2 u y3 u y1 u y2 u y3 This form emphasizes that geometry and displacements are given by the same parametric representation, as shown in Figure 16.2. The key idea is to use the shape functions to represent both the element geometry and the problem unknowns, which in structural mechanics are displacements. Hence the name isoparametric element (iso means equal), often abbreviated to iso-P element. This property may be generalized to arbitrary elements by replacing the term triangular coordinates by the more general one natural coordinates. This generalization is illustrated in Figure 16.3.
Geometry 1, x, y Shape functions Ni(e) Displacement interpolation ux , uy
Natural coordinates
Figure 16.3. Isoparametric representation of arbitrary two-dimensional elements: triangles or quadrilaterals. For 3D elements, expand the geometry list to {1, x , y , z } and the displacements to {u x , u y , u z }.
164
165
16.4
TRIANGULAR ELEMENTS
Under this generalization, natural coordinates (triangular coordinates for triangles, quadrilateral coordinates for quadrilaterals) appear as parameters that dene the shape functions. The shape functions connect the geometry with the displacements.
Remark 16.1. The terms isoparametric and superparametric were introduced by Irons and coworkers at
Swansea in 1966. See Notes and Bibliography at the end of this Chapter. There are also subparametric elements whose geometry is more rened than the displacement expansion.
16.3. General Isoparametric Formulation The generalization of (16.3) to an arbitrary two-dimensional element with n nodes is straightforward. Two set of relations, one for the element geometry and the other for the element displacements, are required. Both sets exhibit the same interpolation in terms of the shape functions. Geometric relations:
n n n
1=
i =1
Nie ,
x=
i =1
xi Nie ,
y=
i =1
yi Nie .
(16.4)
Displacement interpolation:
n n
ux =
i =1
u xi Nie ,
uy =
i =1
u yi Nie .
(16.5)
(16.6)
The rst three scalar equations in (16.6) express the geometry denition, and the last two the displacement expansion. Note that additional rows may be added to this matrix expression if more variables are interpolated by the same shape functions. For example, suppose that the thickness h and a temperature eld T are both interpolated from the n node values: 1 1 ... 1 1 e x 2 . . . x n N1 x x1 e N2 y2 . . . yn y y1 . . (16.7) u x = u x 1 u x 2 . . . u xn . . u y u y 1 u y 2 . . . u yn e h h1 h2 . . . hn Nn T1 T2 . . . Tn T Note that the column of shape functions does not change. To illustrate the use of the isoparametric concept, we take a look at specic 2D isoparametric elements that are commonly used in structural and non-structural applications. These are separated into triangles and quadrilaterals because different natural coordinates are used. 165
166
16.4. Triangular Elements 16.4.1. The Linear Triangle The three-noded linear triangle, studied in Chapter 15 and pictured in Figure 16.4, may be presented as an isoparametric element: 1 1 1 1 e x2 x 3 N1 x x1 e . (16.8) y2 y3 N2 y = y1 e ux1 ux2 ux3 N3 ux uy u y1 u y2 u y3 The shape functions are simply the triangular coordinates:
e N1 = 1 , e N2 = 2 , e N3 = 3 .
2 1
Figure 16.4. The 3-node linear triangle.
(16.9)
The linear triangle is the only triangular element that is both superparametric and isoparametric. 16.4.2. The Quadratic Triangle The six node triangle shown in Figure 16.5 is the next complete-polynomial member of the isoparametric triangle family. The isoparametric denition is e N1 1 1 1 1 1 1 1 Ne 2 e x x1 x2 x3 x4 x5 x6 N3 y = y1 y2 y3 y4 y5 y6 N e 4 ux1 ux2 ux3 ux4 ux5 ux6 ux e N5 uy u y1 u y2 u y3 u y4 u y5 u y6 e N6 (16.10) The shape functions are
e e e N1 = 1 (21 1), N2 = 2 (22 1), N3 = 3 (23 1), e e e N4 = 41 2 , N5 = 42 3 , N6 = 43 1 .
(a)
3 5 6 2 4
(b)
3 5 2 4
1
Figure 16.5. The 6-node quadratic triangle: (a) the superparametric version, with straight sides and midside nodes at midpoints; (b) the isoparametric version.
(16.11)
The element may have parabolically curved sides dened by the location of the midnodes 4, 5 and 6. The triangular coordinates for a curved triangle are no longer straight lines, but form a curvilinear system as can be observed in Figure 16.5(b).
16.4.3. *The Cubic Triangle The cubic triangle has ten nodes. This shape functions of this element are the subject of an Exercise in Chapter 18. The implementation is studied in Chapter 24.
166
16.5
QUADRILATERAL ELEMENTS
16.5.1. Quadrilateral Coordinates and Iso-P Mappings Before presenting examples of quadrilateral elements, we must introduce the appropriate =1 =1 natural coordinate system for that geometry. =1 The natural coordinates for a triangular =1 element are the triangular coordinates 1 , 2 and 3 . The natural coordinates for a =1 quadrilateral element are and , which are =1 =1 illustrated in Figure 16.6 for both straight sided and curved side quadrilaterals. These are called quadrilateral coordinates. Figure 16.6. Quadrilateral coordinates.
=1
These coordinates vary from 1 on one side to +1 at the other, taking the value zero over the quadrilateral medians. This particular variation range (instead of taking, say, 0 to 1) was chosen by Irons and coworkers to facilitate use of the standard Gauss integration formulas. Those formulas are discussed in the next Chapter.
Remark 16.2. In some FEM derivations it is convenient to visualize the quadrilateral coordinates plotted as Cartesian coordinates in the {, } plane. This is called the reference plane. All quadrilateral elements in the reference plane become a square of side 2, called the reference element, which extends over [1, 1], [1, 1]. The transformation between {, } and {x , y } dictated by the second and third equations of (16.4), is called the isoparametric mapping. A similar version exists for triangles. An important application of this mapping is discussed in 16.6; see Figure 16.9 there.
16.5.2. The Bilinear Quadrilateral The four-node quadrilateral shown in Figure 16.7 is the simplest member of the quadrilateral family. It is dened by 1 1 x x1 y = y1 ux1 ux uy u y1 1 x2 y2 ux2 u y2 1 x3 y3 ux3 u y3 1 e N1 x4 e N2 y4 e . N3 ux4 e N4 u y4
4 =1 =1 3 =1
(16.12)
=1
(16.13)
These functions vary linearly on quadrilateral coordinate lines = const and = const , but are not linear polynomials as in the case of the three-node triangle. 167
168
(a)
4
=1 7 9
(b)
4 6 =1
=1 7 6 =1 =1 5 2
8 =1 1 =1 5
8 =1 1
Figure 16.8. Two widely used higher order quadrilaterals: (a) the nine-node biquadratic quadrilateral; (b) the eight-node serendipity quadrilateral.
16.5.3. The Biquadratic Quadrilateral The nine-node quadrilateral shown in Figure 16.8(a) is the next complete member of the quadrilateral family. It has eight external nodes and one internal node. It is dened by 1 1 x x1 y = y1 ux1 ux uy u y1 1 x2 y2 ux2 u y2 1 x3 y3 ux3 u y3 1 x4 y4 ux4 u y4 1 x5 y5 ux5 u y5 1 x6 y6 ux6 u y6 1 x7 y7 ux7 u y7 1 x8 y8 ux8 u y8
e N1 1 e N2 x9 . . y9 . . ux9 u y9 Ne 9
(16.14)
This element is often referred to as the Lagrangian quadrilateral in the FEM literature, a term explained in the Notes and Bibliography. Its shape functions are
e = 1 (1 )(1 ) , N1 4 1 e N2 = 4 (1 + )(1 ) , e N5 = 1 (1 2 )(1 ), 2 1 e N6 = 2 (1 + )(1 2 ), e = (1 2 )(1 2 ) (16.15) N9
These functions vary quadratically along the coordinate lines = const and = const . The shape function associated with the internal node 9 is called a bubble function because of its geometric shape, which is pictured in 18.4.2. Figure 16.8(a) depicts a widely used eight-node variant called the serendipity quadrilateral. (A name that originated from circumstances surrounding the element discovery.) The internal node is eliminated by kinematic constraints as worked out in an Exercise of Chapter 18. 16.6. Completeness Properties of Iso-P Elements Some general conclusions as regards the range of applications of isoparametric elements can be obtained from a completeness analysis. More specically, whether the general prescription (16.6) that combines (16.4) and (16.5) satises the completeness criterion of nite element trial expansions. This is one of the conditions for convergence to the analytical solution. The requirement is treated generally in Chapter 19, and is stated here in recipe form. 168
169
16.6
16.6.1. *Completeness Analysis The plane stress problem has variational index m = 1. A set of shape functions is complete for this problem if they can represent exactly any linear displacement motions such as u x = 0 + 1 x + 2 y , To carry out the check, evaluate (16.16) at the nodes u xi = 0 + 1 xi + 2 yi u yi = 0 + 1 xi + 2 yi , i = 1, . . . n . (16.17) u y = 0 + 1 x + 2 y . (16.16)
Insert this into the displacement expansion (16.5) to see whether the linear displacement eld (16.16) is recovered. Here are the computations for the displacement component u x :
n
ux =
i =1
(0 + 1 xi + 2 yi ) Nie = 0
i
Nie + 1
i
xi Nie + 2
i
yi Nie = 0 + 1 x + 2 y . (16.18)
For the last step we have used the geometry denition relations (16.4), reproduced here for convenience:
n n n
1=
i =1
Nie ,
x=
i =1
xi Nie ,
y=
i =1
yi Nie .
(16.19)
A similar calculation may be made for u y . It appears that the isoparametric displacement expansion represents (16.18) for any element, and consequently meets the completeness requirement for variational order m = 1. The derivation carries without essential change to three dimensions.1 Can you detect a aw in this conclusion? The y in the ointment is the last replacement step of (16.18), which assumes that the geometry relations (16.19) are identically satised. Indeed they are for all the example elements presented in the previous sections. But if the new shape functions are constructed directly by the methods of Chapter 18, a posteriori checks of those identities are necessary.
16.6.2. Completeness Checks The rst check in (16.19) is easy: the sum of shape functions must be unity. This is also called the unit sum condition. It can be easily veried by hand for simple elements. Here are two examples.
Example 16.1. Check for the linear triangle: directly from the denition of triangular coordinates,
e e e N1 + N2 + N3 = 1 + 2 + 3 = 1.
(16.20)
This derivation is due to B. M. Irons. See for example [145, p. 75]. The property was known since the mid 1960s and contributed substantially to the rapid acceptance of iso-P elements.
169
1610
plane
xy plane
2 1 2
(e1)
(e1) 1 2 2 y (e2)
1 (e2)
(e2) 2
Figure 16.9. Good and bad isoparametric mappings of 4-node quadrilateral from the {, } reference plane onto the {x , y } physical plane.
+1 (1 + + + ) + 1 (1 + ) = 1 4 4
(16.21)
For more complicated elements see Exercises 16.2 and 16.3. The other two checks are less obvious. For specicity consider the 4-node bilinear quadrilateral. The geometry denition equations are
4 4
x=
i =1
xi Nie (, ),
y=
i =1
yi Nie (, ).
(16.22)
Given the corner coordinates, {xi , yi } and a point P (x , y ) one can try to solve for {, }. This solution requires nontrivial work because it involves two coupled quadratics, but can be done. Reinserting into (16.22) simply gives back x and y , and nothing is gained.2 The correct question to pose is: is the correct geometry of the quadrilateral preserved by the mapping from {, } to {x , y }? In particular, are the sides straight lines? Figure 16.9 illustrate these questions. Two side-two squares: (e1) and (e2), contiguous in the {, } reference plane, are mapped to quadrilaterals (e1) and (e2) in the {x , y } physical plane through (16.22). The common side 1-2 must remain a straight line to preclude interelement gaps or interpenetration. We are therefore lead to consider geometric compatibility upon mapping. But this is equivalent to the question of interelement displacement compatibility, which is stipulated as item (C) in 18.1. The statement the displacement along a side must be uniquely determined by nodal displacements on that side translates to the coordinates of a side must be uniquely determined by nodal coordinates on that side. Summarizing:
2
This tautology is actually a blessing, since nding explicit expressions for the natural coordinates in terms of x and y rapidly becomes impossible for higher order elements. See, for example, the complications that already arise for the bilinear quadrilateral in 23.3.
1610
16.
References
(16.23)
This subdivision of work signicantly reduces the labor involved in element testing.
16.6.3. *Completeness for Higher Variational Index The completeness conditions for variational index 2 are far more demanding because they involve quadratic motions. No simple isoparametric congurations satisfy those conditions. Consequently isoparametric formulations have limited importance in the nite element analysis of plate and shell bending.
16.7. Iso-P Elements in One and Three Dimensions The reader should not think that the concept of isoparametric representation is conned to twodimensional elements. It applies without conceptual changes to one and three dimensions as long as the variational index remains one.3 Three-dimensional solid elements are covered in an advanced course. The use of the isoparametric formulation to construct a 3-node bar element is the topic of Exercises 16.4 through 16.7.
Notes and Bibliography A detailed presentation of the isoparametric concept, with annotated references to the original 1960 papers may be found in the textbook [145]. This matrix representation for isoparametric elements used here was introduced in [66]. The term Lagrangian element in the mathematical FEM literature identies quadrilateral and hexahedra (brick) elements that include all polynomial terms i j (in 2D) or i j k (in 3D) with i n , j n and k n , as part of the shape function interpolation. Such elements have (n + 1)2 nodes in 2D and (n + 1)3 nodes in 3D, and the interpolation is said to be n -bicomplete. For example, if n = 2, the biquadratic quadrilateral with (2 + 1)2 = 9 nodes is Lagrangian and 2-bicomplete. (The qualier Lagrangian in this context refers to Lagranges interpolation formula, not to Lagrange multipliers.) References Referenced items have been moved to Appendix R
1611
1612
triangle (16.11) is exactly one regardless of natural coordinates values. Hint: show that the sum is expressable 2 S1 , where S1 = 1 + 2 + 3 . as 2 S1
EXERCISE 16.3 [A/C:15] Complete the table of shape functions (16.23) of the nine-node biquadratic quadri-
nodes and the midnode are identied as 1, 2 and 3, respectively. The natural coordinates of nodes 1, 2 and 3 are = 1, = 1 and = 0, respectively. The variation of the shape functions N1 ( ), N2 ( ) and N3 ( ) is sketched in Figure E16.1. These functions must be quadratic polynomials in :
e ( ) = a0 + a1 + a2 2 , N1 e N2 ( ) = b0 + b1 + b2 2 , e N3 ( ) = c0 + c1 + c2 2 .
(E16.1)
N1 ()
e
N2 ()
e
e N3 ()
1 =1
3 =0
2 1 =1 =1
3 =0
2 =1
1 =1
3 =0
2 =1
Figure E16.1. Isoparametric shape functions for 3-node bar element (sketch). Node 3 has been drawn at the 12 midpoint but it may be moved away from it, as in Exercises E16.5 and E16.6.
Determine the coefcients a0 , through c2 using the node value conditions depicted in Figure E16.1; for example e = 1, 0 and 0 for = 1, 0 and 1 at nodes 1, 3 and 2, respectively. Proceeding this way show that N1
e ( ) = 1 (1 ), N1 2 e N2 ( ) = 1 (1 + ), 2 e N3 ( ) = 1 2 .
(E16.2)
[A/C:15+10+15+5] A 3-node straight bar element is dened by 3 nodes: 1, 2 and 3, with axial coordinates x1 , x2 and x3 , respectively, as illustrated in Figure E16.2. The element has axial rigidity E A and length = x2 x1 . The axial displacement is u (x ). The 3 degrees of freedom are the axial node displacements u 1 , u 2 and u 3 . The isoparametric denition of the element is 1 x u = 1 x1 u1 1 x2 u2 1 x3 u3
e N1 e N2 e N3
(E16.3)
in which Nie ( ) are the shape functions (E16.2) of the previous Exercise. Node 3 lies between 1 and 2 but is . For convenience dene not necessarily at the midpoint x = 1 2 x1 = 0, x2 = , x3 = ( 1 + ) , 2 (E16.4)
1612
1613
axial rigidity EA x, u 1 (= 1) x1 = 0 3 (=0) x 3 = /2+
= L (e)
Figure E16.2. The 3-node bar element in its local system.
Exercises
2 (=1) x2 =
where 1 << 1 characterizes the location of node 3 with respect to the element center. If = 0 node 3 2 2 is located at the midpoint between 1 and 2. See Figure E16.2. (a) From (E16.4) and the second equation of (E16.3) get the Jacobian J = d x /d in terms of , and . << 1 then J > 0 over the whole element 1 1; (ii) if = 0, J = /2 Show that: (i) if 1 4 4 is constant over the element. Obtain the 1 3 strain-displacement matrix B relating e = du /d x = B ue , where ue is the column 3-vector of node displacements u 1 , u 2 and u 3 . The entries of B are functions of , and . Hint: B = d N/d x = J 1 d N/d , where N = [ N1 N2 N3 ] and J comes from item (a). Show that the element stiffness matrix is given by
1
(b)
(c)
Ke =
0
E A BT B d x =
1
E A BT B J d .
(E16.5)
Evaluate the rightmost integral for arbitrary but constant E A using the 2-point Gauss quadrature rule (E13.7). Specialize the result to = 0, for which you should get K 11 = K 22 = 7 E A /(3 ), K 33 = 16 E A /(3 ), K 12 = E A /(3 ) and K 13 = K 23 = 8 E A /(3 ), with eigenvalues {8 E A / , 2 E A / , 0}. Note: use of a CAS is recommended for this item to save time. (d) What is the minimum number of Gauss points needed to integrate Ke exactly if = 0?
EXERCISE 16.6 [A/C:20] This Exercise is a continuation of the foregoing one, and addresses the question of why Ke was computed by numerical integration in item (c). Why not use exact integration? The answer is that the exact stiffness for arbitrary is numerically useless. To see why, try the following script in Mathematica:
ClearAll[EA,L,alpha,xi]; (* Define J and B={{B1,B2,B3}} here *) Ke=Simplify[Integrate[EA*Transpose[B].B*J,{xi,-1,1}, Assumptions->alpha>0&&alpha<1/4&&EA>0&&L>0]]; Print["exact Ke=",Ke//MatrixForm]; Print["exact Ke for alpha=0",Simplify[Ke/.alpha->0]//MatrixForm]; Keseries=Normal[Series[Ke,{alpha,0,2}]]; Print["Ke series about alpha=0:",Keseries//MatrixForm]; Print["Ke for alpha=0",Simplify[Keseries/.alpha->0]//MatrixForm]; At the start of this script dene J and B with the results of items (a) and (b), respectively. Then run the script. The line Print["exact Ke for alpha=0",Simplify[Ke/.alpha->0]//MatrixForm] will trigger error messages. Comment on why the exact stiffness cannot be evaluated directly at = 0 (look at the printed expression before this one). A Taylor series expansion about = 0 circumvents these difculties but the 2-point Gauss integration rule gives the correct answer without the gyrations.
1613
1614
=L 1 (= 1) x1 = 0
load q
=R x, u 2 (=1) x2 =
3 (=0) x 3 = /2+
= L (e)
Figure E16.3. The 3-node bar element under a box axial load q .
EXERCISE 16.7 [A/C:20] Construct the consistent force vector for the 3-node bar element of the foregoing exercise, if the bar is loaded by a uniform axial force q (given per unit of x length) that extends from = L through = R , and is zero otherwise. Here 1 L < R 1. See Figure E16.3. Use
R
fe =
L
q NT J d ,
(E16.6)
with the J = d x /d found in Exercise 16.5(a) and analytical integration. The answer is quite complicated and nearly hopeless by hand. Specialize the result to = 0, L = 1 and R = 1.
1614
Introduction to FEM
Isoparametric Representation
16
IFEM Ch 16 Slide 1
Introduction to FEM
IFEM Ch 16 Slide 2
Introduction to FEM
IFEM Ch 16 Slide 3
Introduction to FEM
Before Isoparametric Concept was Discovered, FEM Developers Did "SuperParametric" Elems
Element shape functions refined, more nodes and DOFs added But element geometry was kept simple with straight sides
IFEM Ch 16 Slide 4
Introduction to FEM
Displacement Interpolation
u x = u x 1 N1 + u x 2 N2 + u x 3 N3 = u x 1 1 + u x 2 2 + u x 3 3
e u y = u y 1 N1 + u y 2 N2 + u y 3 N3e = u y 1 1 + u y 2 2 + u y 3 3 e e e e
IFEM Ch 16 Slide 5
Introduction to FEM
Displacement interpolation ux , u y
IFEM Ch 16 Slide 6
Introduction to FEM
IFEM Ch 16 Slide 7
Introduction to FEM
Natural coordinates
IFEM Ch 16 Slide 8
Introduction to FEM
1=
i =1
Nie
x=
i =1
y=
i =1
yi Nie
Displacement Interpolation
n
ux =
i =1
e u xi Ni
uy =
i =1
u yi Ni
IFEM Ch 16 Slide 9
Introduction to FEM
More Rows May be Added to Interpolate other Quantities from Node Values
1 1 x x1 y y1 ux = u x1 uy u y1 thickness h h h 1 T1 temperature T T ... 1 e N1 . . . xn e N2 . . . yn . . . . u xn . . . . . u yn . . . hn N e n . . . Tn
1 x2 y2 ux2 u y2 h2 T2
IFEM Ch 16 Slide 10
Introduction to FEM
2 1
1 1 x x1 y = y1 ux ux1 uy u y1 N1e = 1 ,
e
1 x2 y2 ux2 u y2
1 e x 3 N1 e y3 N2 e ux3 N3 u y3 N3e = 3
N2 = 2 ,
IFEM Ch 16 Slide 11
Introduction to FEM
1 1 x x1 y = y1 ux1 ux uy u y1
e
1 x2 y2 ux2 u y2
1 x3 y3 ux3 u y3
1 x4 y4 ux4 u y4
1 x5 y5 ux5 u y5
1 N e 2 x6 e N3 y6 e N4 ux6 Ne 5 u y6 e N6
1
Ne
N4e = 41 2 N5e = 42 3 N6 = 43 1
e
IFEM Ch 16 Slide 12
Introduction to FEM
8 9
IFEM Ch 16 Slide 13
Introduction to FEM
Quadrilateral Coordinates ,
=1 =1 =1 =1 =1 =1 =1 =1
IFEM Ch 16 Slide 14
Introduction to FEM
4
=1
=1
3
=1
1
1 1 x x1 y = y1 ux ux1 uy u y1
=1
1 N e x4 1e N2 y4 N3e ux4 N4e u y4
2
( 1 )( 1 ) N1 = 1 4 N2e = 1 ( 1 + )( 1 ) 4 N3 = 1 ( 1 + )( 1 + ) 4
e e
1 x2 y2 ux2 u y2
1 x3 y3 ux3 u y3
N4 = 1 ( 1 )( 1 + ) 4
IFEM Ch 16 Slide 15
Introduction to FEM
4 8
=1
=1 7
9
=1 5
6
=1
1
1 1 x x1 y = y1 ux ux1 uy u y1
2
1 x2 y2 ux2 u y2 1 x3 y3 ux3 u y3 1 x4 y4 ux4 u y4 1 x5 y5 ux5 u y5 1 x6 y6 ux6 u y6 1 x7 y7 ux7 u y7 1 x8 y8 ux8 u y8 e 1 N 1e x 9 N2 y9 : : : ux9 u y9 Ne
9
( 1 )( 1 ) N1e = 1 4 1 e N2 = 4 ( 1 + )( 1 )
...
N5e = 1 ( 1 2 )( 1 ) 2 N6e = 1 ( 1 + )( 1 2 ) 2
...
e N9 = ( 1 2 )( 1 2 )
IFEM Ch 16 Slide 16
Introduction to FEM
8 =1 1
IFEM Ch 16 Slide 17
1615
Solutions to Exercises
rectly over the element. If the function happens to be a displacement component such as u x or u y , the constant value corresponds to a rigid body motion, which must be represented exactly. To illustrate this point suppose that for an n -node element, c = u x 1 = u x 2 = . . . = u xn , which represents a rigid body motion u x = c (constant over the element). Then
n e e e + u x 2 N2 + . . . u xn Nn = u x = u x 1 N1 i =1 n
u xi Nie = c
i =1
Nie = c 1 = c.
(E16.7)
(E16.8)
e N5 e N6 e N7 e N8
e N9 = (1 2 )(1 2 ).
(E16.9)
Nie
i =1
= ,
2 2 i =5
Nie
= + 2 ,
2 2 2 2 i =1
Nie = 2 + 2 2 2 .
(E16.10)
Nie ,
whence
i =1
Nie = 1.
(E16.11)
N1 = 1, 0 and 0 at = 1, 0 and 1 (nodes 1, 3 and 2, respectively), yield a0 = 0, a2 = 1/2 and a2 = 1/2, whence N1 = (1/2) + (1/2) 2 = (1 )/2. A similar technique can be used for N2 and N3 . The complete set is given in (E16.2). +1 2 + 1 +1 2 + 1 2 = 1. Unit sum check: N1 + N2 + N3 = 1 2 2 2 2
This brute force technique for constructing shape functions works well for this 1D element, but leads to complicated algebra in 2D and 3D. A quicker and more elegant method that directly builds the functions as product of linear factors is explained in Chapter 18.
1615
1616
ClearAll[L,, ,EA]; Ne={- *(1- )/2, *(1+ )/2,1- ^2}; J=(L-4*L** )/2; B=Simplify[D[Ne, ]/J]; BTBJ=Transpose[{B}].{B}*J; w1=w2=1; Ke=Simplify[EA*((w1*BTBJ/. ->-Sqrt[1/3])+(w2*BTBJ/. ->Sqrt[1/3]))]; Print["Ke=",Ke//MatrixForm];
Figure E16.4. Mathematica script for item (c) of Exercise 16.5.
EXERCISE 16.5
(a)
+ 1) +
1 2
+ (1 2 ) ,
(E16.12)
we get J=
x =
1 2
2 .
(E16.13)
(In 1D, the Jacobian is a scalar and is the same as its determinant.) J is linear in . Consequently its max/min values over the element occur at the end nodes: 2) , J1 = J | =1 = ( 1 2 J2 = J | =1 = ( 1 + 2) 2 (E16.14)
<< 1 , and if so J > 0 inside the element. If = 0, Both J1 and J2 are obviously positive if 1 4 4 1 J = 2 is constant over the element. (b) The strain displacement matrix linking e = B ue is given by B= (c) d Ne d d Ne = = J 1 dx d d x
e e Nee N2 N1
(1 2
1 [ 2 )
1 2
1 2
2 ] (E16.15)
From Chapter 12 the element strain energy is (12.18). Replacing the e = B ue of item (b) gives def (ue )T 0 BT E B d x ue = 1 (ue )T Ke ue , whence Ue = 1 2 2 K =
e 0
dx d = B EB d x = B EB d 1
T T
BT E B J d .
1
(E16.16)
For the two-point Gauss rule the Mathematica script of Figure E16.4 gives Ke = If = 0 this reduces to Ke = EA 3 EA (3 16 2 ) 7 16 1 8(1 2) 7 1 8 1 8(1 2) 7 + 16 8 (1 + 2 ) 8(1 + 2 ) 16 1 7 8 8 8 16 (E16.17)
(E16.18)
(d)
If = 0, from item (a) J = 1 is constant whereas B is linear in . Because E A is constant, E A BT B J 2 is a quadratic polynomial in . This is exactly integrated by a Gauss rule with 2 or more points.
1616
1617
Solutions to Exercises
ClearAll[L,, ,EA]; Ne={- *(1- )/2, *(1+ )/2,1- ^2}; J=(L-4*L** )/2; B=Simplify[{D[Ne, ]/J}]; Print["B=",B]; Ke = Simplify[Integrate[EA*Transpose[B].B*J, { , -1, 1}, Assumptions -> EA>0 && L>0 && > 0 && < 1/2]]; Print["Ke exact:",Ke]; Print["Ke exact for =0:",(Ke/.->0)//MatrixForm]; Keseries=Normal[Series[Ke,{,0,2}]]; Print["Keseries=",Keseries//MatrixForm]; Print["Ke series for =0:", Simplify[Keseries/.->0]//MatrixForm];
Figure E16.5. Mathematica script for Exercise 16.6.
2 4
2
Log 1
Log 1 1 1
4
2
EA 1 EA 1
2 2
8 8
Log 1 4 16 L 3 Log 1 4 16 L 3
2 2 Log 1 32 L 3 EA Log 1 4 , 4 ,
2 8
Log 1
, 4 ,
Log 1
EA 8
Keseries
112 EA 2 15 L 16 EA 3L 7 EA 3L EA 3L 8 EA 3L 128 EA 2 5L EA 3L 7 EA 3L 8 EA 3L
16 EA 3L 16 EA 3L
256 EA 2 5L
Ke series for 0:
Figure E16.6. Results of running the script of Figure E16.5 under Mathematica 4.2.
EXERCISE 16.6 The script used for this item is shown in Figure E16.5. Results of running the script under
Mathematica 4.2 are given in Figure E16.6. The stiffness entries given by exact integration are typied by K 11 = ( E A /(32 3 ))(i 8 4i + 32 2 + 4i 2 (1 2)2 log(4 1) + (1 2)2 log(1 + 4)), K 12 = ( E A /(32 3 ))(8( + (4 2 1) log(1 4) + (1 4 2 ) log(1 + 4), etc. The entries are complex expressions because of the particular choice of path integration made by Mathematica to integrate rational functions in . Evaluation at = 0 fails because entries become 0/0.
1617
1618
These indeterminate limits can be resolved by expanding Ke in Taylor series about = 0, and then evaluating the series at = 0. This reproduces the result (E16.18). All these numerical difculties and gyrations are bypassed with 2-point Gauss quadrature.
ClearAll[L,, L, R]; Ne={- *(1- )/2, *(1+ )/2,1- ^2}; J=(L-4*L** )/2; fe=FullSimplify[Integrate[q*Ne*J,{ , L, R}]]; Print["fe:", fe]; Print["fe for full bar with =0:",Simplify[fe/.{ L->-1, R->1,->0}] ];
EXERCISE 16.7 The Mathematica script of Figure E16.7 gives the complicated result:
qL f = 24
e
(E16.19)
If = 0, L = 1 and R = 1 so the load extends over the whole bar, this expression simplies to fe = qL [1 6 1 4 ]T . (E16.20)
1618
Isoparametric Quadrilaterals
17
171
172
TABLE OF CONTENTS
Page
17.1. Introduction 17.2. Partial Derivative Computation 17.2.1. The Jacobian . . . . . . . 17.2.2. Shape Function Derivatives . . 17.2.3. Computing the Jacobian Matrix . 17.2.4. The Strain-Displacement Matrix 17.2.5. *A Shape Function Implementation 17.3. Numerical Integration by Gauss Rules 17.3.1. One Dimensional Rules . . . 17.3.2. Implementation of 1D Rules . . 17.3.3. Two Dimensional Rules . . . 17.3.4. Implementation of 2D Gauss Rules 17.4. The Stiffness Matrix 17.5. *Integration Variants 17.5.1. *Weighted Integration . . . . 17.5.2. *Selective Integration . . . . . 17. Notes and Bibliography . . . . . . . . . . . . 17. References . . . . . . . . . . . . 17. Exercises . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . . . .
. . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . . . .
173 173 173 174 174 175 175 176 176 177 178 178 179 1711 1711 1711 1712 1712 1713
172
17.2
In this Chapter the isoparametric representation of element geometry and shape functions discussed in the previous Chapter is used to construct quadrilateral elements for the plane stress problem. Formulas given in Chapter 14 for the stiffness matrix and consistent load vector of general plane stress elements are of course applicable to these elements. For a practical implementation, however, we must go through more specic steps: 1. 2. 3. Construction of shape functions. Computations of shape function derivatives to form the strain-displacement matrix. Numerical integration over the element by Gauss quadrature rules.
The rst topic was dealt in the previous Chapter in recipe form, and is systematically covered in the next one. Assuming the shape functions have been constructed (or readily found in the FEM literature) the second and third items are combined in an algorithm suitable for programming any isoparametric quadrilateral. The implementation of the algorithm in the form of element modules is partly explained in the Exercises of this Chapter, and covered more systematically in Chapter 23. We shall not deal with isoparametric triangles here to keep the exposition focused. Triangular coordinates, being linked by a constraint, require special handling techniques that would complicate and confuse the exposition. Chapter 24 discusses isoparametric triangular elements in detail. 17.2. Partial Derivative Computation Partial derivatives of shape functions with respect to the Cartesian coordinates x and y are required for the strain and stress calculations. Because shape functions are not directly functions of x and y but of the natural coordinates and , the determination of Cartesian partial derivatives is not trivial. The derivative calculation procedure is presented below for the case of an arbitrary isoparametric quadrilateral element with n nodes. 17.2.1. The Jacobian In quadrilateral element derivations we will need the Jacobian of two-dimensional transformations that connect the differentials of {x , y } to those of {, } and vice-versa. Using the chain rule: x x dx d d dx d x y dx = = JT = JT , = . y y d dy dy d d dy x y (17.1) Here J denotes the Jacobian matrix of (x , y ) with respect to (, ), whereas J1 is the Jacobian matrix of (, ) with respect to (x , y ): x y J= (x , y ) = = x y (, ) 1 (, ) x x J11 J12 = = , J1 = J21 J22 (x , y ) J y y J22 J12 , J21 J11
(17.2) where J = |J| = det(J) = J11 J22 J12 J21 . In FEM work J and J1 are called simply the Jacobian and inverse Jacobian, respectively; the fact that it is a matrix being understood. The scalar symbol 173
174
J is reserved for the determinant of J. In one dimension J and J coalesce. Jacobians play a crucial role in differential geometry. For the general denition of Jacobian matrix of a differential transformation, see Appendix D.
Remark 17.1. Observe that the matrices relating the differentials in (17.1) are the transposes of what we call J and J1 . The reason is that coordinate differentials transform as contravariant quantities: d x = ( x / ) d + ( x /) d , etc. But Jacobians are arranged as in (17.2) because of earlier use in covariant transformations: / x = (/ x )(/ ) + (/ x )(/), as in (17.5) below.
The reader is cautioned that notations vary among application areas. As quoted in Appendix D, one author puts it this way: When one does matrix calculus, one quickly nds that there are two kinds of people in this world: those who think the gradient is a row vector, and those who think it is a column vector.
Remark 17.2. To show that J and J1 are in fact inverses of each other we form their product:
J J=
x x
x x + x x y + y
y y
y x + x y y + y
x x x y
y x y y
1 0
0 , 1
(17.3)
where we have taken into account that x = x (, ), y = y (, ) and the fact that x and y are independent coordinates. This proof would collapse, however, if instead of {, } we had the triangular coordinates {1 , 2 , 3 } because rectangular matrices have no conventional inverses. This case requires special handling and is covered in Chapter 24.
17.2.2. Shape Function Derivatives The shape functions of a quadrilateral element are expressed in terms of the quadrilateral coordinates and introduced in 16.5.1. The derivatives with respect to x and y are given by the chain rule: Nie Nie Nie = + , x x x This can be put in matrix form as Ne
i i
(17.4)
x x N e = y y
(17.5)
where J1 is dened in (17.2). The computation of J is addressed in the next subsection. 17.2.3. Computing the Jacobian Matrix To compute the entries of J at any quadrilateral location we make use of the last two geometric relations in (16.4), which are repeated here for convenience:
n n
x=
i =1
xi Nie , 174
y=
i =1
yi Nie .
(17.6)
175
Figure 17.1. A shape function module for the 4-node bilinear quadrilateral.
Nie xi ,
y =
n i =1
Nie yi ,
x =
n i =1
Nie xi ,
y =
yi
i =1
Nie . y1 y2 . . . . yn
(17.7)
because the xi and yi do not depend on and . In matrix form: x J= J11 J12 J21 J22 = x Ne y 1 = PX = e y N1
e N2 e N2
... ...
e x Nn 1 x 2 e . . Nn . xn
(17.8)
Given a quadrilateral point of coordinates , we calculate the entries of J using (17.8). The inverse Jacobian J1 is then obtained by numerically inverting this 2 2 matrix.
Remark 17.3. The symbolic inversion of J for arbitrary , in general leads to extremely complicated
expressions unless the element has a particularly simple geometry, (for example rectangles as in Exercises 17.117.3). This was one of the difculties that motivated the use of Gaussian numerical quadrature, as discussed in 17.3 below.
17.2.4. The Strain-Displacement Matrix The strain-displacement matrix B that appears in the computation of the element stiffness matrix is given by the general expression (14.18), which is reproduced here for convenience: Ne e e Nn N2 1 0 0 . . . x 0 x x ex x e e e Nn N2 N1 e e 0 ... 0 (17.9) = 0 e = e yy y y y u = Bu . e e e e e e 2ex y Nn Nn N1 N2 N2 N1 . . . y x y x y x The nonzero entries of B are partials of the shape functions with respect to x and y . The calculation of those partials is done by computing J via (17.8), inverting and using the chain rule (17.5).
17.2.5. *A Shape Function Implementation
175
176
To make the foregoing discussion more specic, Figure 17.1 shows the shape function module for the 4-node bilinear quadrilateral. This is a code fragment that returns the value of the shape functions and their {x , y } derivatives at a given point of quadrilateral coordinates {, }. The module is invoked by saying { Nf,Nfx,Nfy,Jdet }=Quad4IsoPShapeFunDer[ncoor,qcoor] where the arguments are ncoor qcoor Nf Nfx Nfy Jdet Quadrilateral node coordinates arranged in two-dimensional list form: { { x1,y1 },{ x2,y2 },{ x3,y3 },{ x4,y4 } }. Quadrilateral coordinates { eta,xi } of the point. Value of shape functions, arranged as list { Nf1,Nf2,Nf3,Nf4 }. Value of x -derivatives of shape functions, arranged as list { Nfx1,Nfx2,Nfx3,Nfx4 }. Value of y -derivatives of shape functions, arranged as list { Nfy1,Nfy2,Nfy3,Nfy4 }. Jacobian determinant. (17.10)
Example 17.1. Consider a 4-node bilinear quadrilateral shaped as an axis-aligned 2:1 rectangle, with 2a and a as the x and y dimensions, respectively. The node coordinate array is ncoor={ { 0,0 },{ 2*a,0 },{ 2*a,a },{ 0,a } }. The shape functions and their {x , y } derivatives are to be evaluated at the rectangle center = = 0. The appropiate call is
{ Nf,Nfx,Nfy,Jdet }=Quad4IsoPShapeFunDer[ncoor,{ 0,0 }] This returns Nf={ 1/8,1/8,3/8,3/8 }, Nfx={ -1/(8*a),1/(8*a),3/(8*a),-3/(8*a) }, Nfy={ -1/(2*a),-1/(2*a),1/(2*a),1/(2*a) } and Jdet=a^2/2.
17.3. Numerical Integration by Gauss Rules The use of numerical integration is essential for practical evaluation of integrals over isoparametric element domains. The standard practice has been to use Gauss integration because such rules use a minimal number of sample points to achieve a desired level of accuracy. This economy is important for efcient element calculations, since we shall see that a matrix product is evaluated at each sample point. The fact that the location of the sample points in Gauss rules is usually given by non-rational numbers is of no concern in digital computation. 17.3.1. One Dimensional Rules The classical Gauss integration rules are dened by
1 1 p
= 1
Figure 17.2. The rst ve one-dimensional Gauss rules p = 1, 2, 3, 4 depicted over the line segment [1, +1]. Sample point locations are marked with black circles. The radii of these circles are proportional to the integration weights.
F ( ) d
i =1
wi F (i ).
(17.11)
Here p 1 is the number of Gauss integration points (also known as sample points), wi are the integration weights, and i are sample-point abcissae in the interval [1,1]. The use of the canonical 176
177
17.3 NUMERICAL INTEGRATION BY GAUSS RULES Table 17.1 - One-Dimensional Gauss Rules with 1 through 5 Sample Points Points 1 2 3 4 5 Rule
1 1 1
F ( ) d F ( 1 / 3 ) + F ( 1 / 3) 1 1 5 8 5 F ( ) d F ( 3 / 5 ) + F ( 0 ) + F ( 3/5) 9 9 9 1
1 1 1 1
F ( ) d 2 F (0)
F ( ) d w14 F (14 ) + w24 F (24 ) + w34 F (34 ) + w44 F (44 ) F ( ) d w15 F (15 ) + w25 F (25 ) + w35 F (35 ) + w45 F (45 ) + w55 F (55 )
For the 4-point rule, 34 = 24 = (3 2 6/5)/ 7, 44 = 14 = (3 + 2 6/5)/7, 1 5/6, and w24 = w34 = 1 +1 5/6. w14 = w44 = 1 2 6 2 6 For the 5-point rule, 55 = 15 = 1 5 + 2 10/7, 45 = 35 = 1 5 2 10/7, 35 = 0, 3 3 w15 = w55 = (322 13 70)/900, w25 = w45 = (322 + 13 70)/900 and w35 = 512/900.
interval [1,1] is no restriction, because an integral over another range, say from a to b, can be transformed to [1, +1] via a simple linear transformation of the independent variable, as shown in the Remark below. The rst ve one-dimensional Gauss rules, illustrated in Figure 17.2, are listed in Table 17.1. These integrate exactly polynomials in of orders up to 1, 3, 5, 7 and 9, respectively. In general a onedimensional Gauss rule with p points integrates exactly polynomials of order up to 2 p 1. This is called the degree of the formula.
Remark 17.4. A more general integral, such as F (x ) over [a , b] in which = b a > 0, is transformed a (1 ) + 1 b (1 + ) = 1 (a + b) + 1 , or to the canonical interval [1, 1] through the mapping x = 1 2 2 2 2 1 = (2/ )(x 2 (a + b)). The Jacobian of this mapping is J = d x /d = / . Thus
b 1 1
F (x ) d x =
a 1
F ( ) J d =
1
F ( ) 1 d . 2
(17.12)
Remark 17.5. Higher order Gauss rules are tabulated in standard manuals for numerical computation. For
example, the widely used Handbook of Mathematical Functions [1] lists (in Table 25.4) rules with up to 96 points. For p > 6 the abscissas and weights of sample points are not expressible as rational numbers or radicals, and can only be given as oating-point numbers.
17.3.2. Implementation of 1D Rules The Mathematica module shown in Figure 17.3 returns either exact or oating-point information for the rst ve unidimensional Gauss rules. To get information for the i th point of the p th rule, in which 1 i p and p = 1, 2, 3, 4, 5, call the module as { xii,wi }=LineGaussRuleInfo[{ p,numer },i] (17.13) Logical ag numer is True to get numerical (oating-point) information, or False to get exact information. The module returns the sample point abcissa i in xii and the weight wi in wi. If p is not in the implemented range 1 through 5, the module returns { Null,0 }. 177
178
Figure 17.3. A Mathematica module that returns the rst ve one-dimensional Gauss rules.
Example 17.2.
{ xi,w }=LineGaussRuleInfo[{ 3,False },2] returns xi=0 and w=8/9, whereas { xi,w }=LineGaussRuleInfo[{ 3,True },2] returns (to 16 places) xi=0. and w=0.888888888888889.
17.3.3. Two Dimensional Rules The simplest two-dimensional Gauss rules are called product rules. They are obtained by applying the one-dimensional rules to each independent variable in turn. To apply these rules we must rst reduce the integrand to the canonical form:
1 1 1 1
F (, ) d d =
1 1
1 1
F (, ) d .
(17.14)
F (, ) d d =
1 1
1 1
p1
p2
F (, ) d
i =1 j =1
wi w j F (i , j ).
(17.15)
where p1 and p2 are the number of Gauss points in the and directions, respectively. Usually the same number p = p1 = p2 is chosen if the shape functions are taken to be the same in the and directions. This is in fact the case for all quadrilateral elements presented here. The rst four two-dimensional Gauss product rules with p = p1 = p2 are illustrated in Figure 17.4. 17.3.4. Implementation of 2D Gauss Rules The Mathematica module listed in Figure 17.5 implements two-dimensional product Gauss rules having 1 through 5 points in each direction. The number of points in each direction may be the same or different. If the rule has the same number of points p in both directions the module is called in either of two ways: { { xii,etaj },wij }=QuadGaussRuleInfo[{ p, numer }, { i,j }] { { xii,etaj },wij }=QuadGaussRuleInfo[{ p, numer },k ] 178 (17.16)
179
p = 1 (1 x 1 rule)
17.4
p = 2 (2 x 2 rule)
p = 3 (3 x 3 rule)
p = 4 (4 x 4 rule)
Figure 17.4. The rst four two-dimensional Gauss product rules p = 1, 2, 3, 4 depicted over a straight-sided quadrilateral region. Sample points are marked with black circles. The areas of these circles are proportional to the integration weights.
The rst form is used to get information for point {i , j } of the p p rule, in which 1 i p and 1 j p . The second form species that point by a visiting counter k that runs from 1 through p 2 ; if so {i , j } are internally extracted1 as j=Floor[(k-1)/p]+1; i=k-p*(j-1). If the integration rule has p1 points in the direction and p2 points in the direction, the module may be called also in two ways: { { xii,etaj },wij }=QuadGaussRuleInfo[{ { p1,p2 }, numer },{ i,j }] { { xii,etaj },wij }=QuadGaussRuleInfo[{ { p1,p2 }, numer },k ] (17.17)
The meaning of the second argument is as follows. In the rst form i runs from 1 to p1 and j from 1 to p2 . In the second form k runs from 1 to p1 p2 ; if so i and j are extracted by j=Floor[(k-1)/p1]+1; i=k-p1*(i-1). In all four forms, logical ag numer is set to True if numerical information is desired and to False if exact information is desired. The module returns i and j in xii and etaj, respectively, and the weight product wi w j in wij. This code is used in the Exercises at the end of the chapter. If the inputs are not in range, the module returns { { Null,Null },0 }.
Example 17.3. { { xi,eta },w }=QuadGaussRuleInfo[{ 3,False },{ 2,3 }] returns xi=0, eta=Sqrt[3/5]
and w=40/81.
Example 17.4. { { xi,eta },w }=QuadGaussRuleInfo[{ 3,True },{ 2,3 }] returns (to 16-place precision)
Indices i and j are denoted by i1 and i2, respectively, inside the module.
179
1710
Figure 17.5. A Mathematica module that returns two-dimensional product Gauss rules.
17.4. The Stiffness Matrix The stiffness matrix of a general plane stress element is given by the expression (14.23), which is reproduced here: Ke =
e
h BT EB d
(17.18)
Of the terms that appear in (17.18) the strain-displacement matrix B has been discussed previously. The thickness h , if variable, may be interpolated via the shape functions. The stress-strain matrix E is usually constant in elastic problems, but we could in principle interpolate it as appropriate should it vary over the element. To integrate (17.18) numerically by a two-dimensional product Gauss rule, we have to reduce it to the canonical form (17.14), that is Ke =
1 1 1 1
F(, ) d d .
(17.19)
If and are the quadrilateral coordinates, everything in (17.19) already ts this form, except the element of area d e . To complete the reduction we need to express d e in terms of the differentials d and d . The desired relation is (see Remark below) d
e
y
y d
x d
C B
= d x d y = det J d d = J d d . (17.20)
de
A x
y d
(17.21)
x d
This matrix function can be numerically integrated over the domain 1 +1, 1 +1 by an appropriate Gauss product rule. 1710
1711
Remark 17.6. To geometrically justify the area transformation formula (17.20), consider the element of area
OACB depicted in Figure 17.6. The area of this differential parallelogram can be computed as dA = OB OA = x = y x y y x y x d d d d
(17.22)
d d = |J| d d = det J d d .
This formula can be extended to any number of dimensions, as shown in textbooks on differential geometry; for example [94,116,228]. 17.5.
*Integration Variants
Several deviations from the standard integration schemes described in the foregoing sections are found in the FEM literature. Two variations are described below and supplemented with motivation Exercises. 17.5.1. *Weighted Integration It is sometimes useful to form the element stiffness as a linear combination of stiffnesses produced by two different integration rules Such schemes are known as weighted integration methods. They are distinguished from the selective-integration schemes described in the next subsection in that the constitutive properties are not modied.
e For the 4-node bilinear element weighted integration is done by combining the stiffnesses Ke 11 and K22 produced by 11 and 22 Gauss product rules, respectively: e e Ke = (1 )K11 + K22 .
(17.23)
Here is a scalar in the range [0, 1]. If = 0 or = 1 one recovers the element integrated by the 11 or 22 rule, respectively.2
e The idea behind (17.23) is that Ke 11 is rank-decient and too soft whereas K22 is rank-sufcient but too stiff. A combination of too-soft and too-stiff hopefully balances the stiffness. An application of this idea to the mitigation of shear locking for modeling in-plane bending is the subject of Exercise E17.4.
17.5.2. *Selective Integration In the FEM literature the term selective integration is used to described a scheme for forming Ke as the sum of two or more matrices computed with different integration rules and different constitutive properties.3 We consider here the case of a two-way decomposition. Split the plane stress constitutive matrix E into two: E = EI + EII (17.24)
This is called a stress-strain splitting. Inserting (17.24) into (17.13) the expression of the stiffness matrix becomes Ke =
e
h BT EI B d
+
e
h BT EII B d
e = Ke I + KII .
(17.25)
For programming the combination (17.23) may be regarded as a 5-point integration rule with weights w1 = 4 (1) at the sample point at = = 0 and wi = (i = 2, 3, 4, 5) at the four sample points at = 1/ 3, = 1/ 3. This technique is also called selective reduced integration to reect the fact that one of the rules (the reduced rule) underintegrates the element.
1711
1712
If these two integrals were done through the same integration rule, the stiffness would be identical to that obtained by integrating h BT E B d e . The trick is to use two different rules: rule (I) for the rst integral and rule (II) for the second. In practice selective integration is mostly useful for the 4-node bilinear quadrilateral. For this element rules (I) and (II) are the 11 and 22 Gauss product rules, respectively. Exercises E17.57 investigate stress-strain splittings (17.24) that improve the in-plane bending performance of rectangular elements. Notes and Bibliography The 4-node quadrilateral has a checkered history. It was rst derived as a rectangular panel with edge reinforcements (not included here) by Argyris in his 1954 Aircraft Engineering series [8, p. 49 in the Butterworths reprint]. Argyris used bilinear displacement interpolation in Cartesian coordinates.4 After much ailing, a conforming generalization to arbitrary geometry was published in 1964 by Taig and Kerr [234] using quadrilateral-tted coordinates called {, } but running from 0 to 1. (Reference [234] cites an 1961 English Electric Aircraft internal report as original source but [145, p. 520] remarks that the work goes back to 1957.) Bruce Irons, who was aware of Taigs work while at Rolls Royce, changed the {, } range to [1, 1] to t Gauss quadrature tables. He proceeded to create the seminal isoparametric family as a far-reaching extension upon moving to Swansea [17,63,141145]. Gauss integration is also called Gauss-Legendre quadrature. Gauss presented these rules, derived from rst principles, in 1814; cf. Sec 4.11 of [111]. Legendres name is often adjoined because the abcissas of the 1D sample points turned out to be the zeros of Legendre polynomials. A systematic description is given in [226]. For references in multidimensional numerical integration, see Notes and Bibliography in Chapter 24. Selective and reduced integration in FEM developed in the early 1970s, and by now there is a huge literature. An excellent textbook source is [139]. References Referenced items have been moved to Appendix R.
This work is probably the rst derivation of a continuum-based nite element by assumed displacements. As noted in 1.7.1, Argyris was aware of the ongoing work in stiffness methods at Turners group in Boeing, but the plane stress models presented in [251] were derived by interelement ux assumptions. Argyris used the unit displacement theorem, displacing each DOF in turn by one. The resulting displacement pattern is what is now called a shape function.
1712
1713
Homework Exercises for Chapter 17 Isoparametric Quadrilaterals
Exercises
The Mathematica module Quad4IsoPMembraneStiffness listed in Figure E17.1 computes the element stiffness matrix of the 4-node bilinear quadrilateral. This module is useful as a tool for the Exercises that follow.
Quad4IsoPMembraneStiffness[ncoor_,Emat_,th_,options_]:= Module[{i,k,p=2,numer=False,h=th,qcoor,c,w,Nf, dNx,dNy,Jdet,Be,Ke=Table[0,{8},{8}]}, If [Length[options]==2, {numer,p}=options,{numer}=options]; If [p<1||p>4, Print["p out of range"]; Return[Null]]; For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}=Quad4IsoPShapeFunDer[ncoor,qcoor]; If [Length[th]==4, h=th.Nf]; c=w*Jdet*h; Be={Flatten[Table[{dNx[[i]], 0},{i,4}]], Flatten[Table[{0, dNy[[i]]},{i,4}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,4}]]}; Ke+=Simplify[c*Transpose[Be].(Emat.Be)]; ]; Return[Simplify[Ke]] ];
Figure E17.1. Mathematica module to compute the stiffness matrix of a 4-node bilinear quadrilateral in plane stress.
The module makes use of the shape function module Quad4IsoPShapeFunDer listed in Figure 17.1, and of the Gauss integration modules QuadGaussRuleInfo and (indirectly) LineGaussRuleInfo, listed in Figures 17.5 and 17.3, respectively. All modules are included in the web-posted Notebook Quad4Stiffness.nb.5 The module is invoked as Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,thick,options] The arguments are: ncoor Emat Quadrilateral node coordinates arranged in two-dimensional list form: { { x1,y1 },{ x2,y2 },{ x3,y3 },{ x4,y4 } }. A two-dimensional list storing the 3 3 plane stress matrix of elastic moduli: E= E 11 E 12 E 13 E 12 E 22 E 23 E 13 E 23 E 33 (E17.2) (E17.1)
arranged as { { E11,E12,E33 },{ E12,E22,E23 },{ E13,E23,E33 } }. Must be symmetric. If the material is isotropic with elastic modulus E and Poissons ratio , this matrix becomes E= E 1 2 1 0 1 0 0 0 1 ( 1 ) 2 (E17.3)
This Notebook does not include scripts for doing the Exercises below, although it has some text statements at the bottom of the cell. You will need to enter the Exercise scripts yourself.
1713
1714
thick
The plate thickness specied either as a four-entry list: { h1,h2,h3,h4 } or as a scalar: h. The rst form is used to specify an element of variable thickness, in which case the entries are the four corner thicknesses and h is interpolated bilinearly. The second form species uniform thickness.
options
Processing options. This list may contain two items: { numer,p } or one: { numer }. numer is a logical ag with value True or False. If True, the computations are done in oating point arithmetic. For symbolic or exact arithmetic work set numer to False.6 p species the Gauss product rule to have p points in each direction. p may be 1 through 4. For rank sufciency, p must be 2 or higher. If p is 1 the element will be rank decient by two.7 If omitted p = 2 is assumed.
The module returns Ke as an 8 8 symmetric matrix pertaining to the following arrangement of nodal displacements: (E17.4) ue = [ u x 1 u y 1 u x 2 u y 2 u x 3 u y 3 u x 4 u y 4 ]T .
y 4 b = a/ 1
Uniform thickness h = 1 Isotropic material with elastic modulus E and Poisson's ratio
a 2 x
For the following three exercises we consider the specialization of the general 4-node bilinear quadrilateral to a rectangular element dimensioned a and b in the x and y directions, respectively, as depicted in Figure E17.2. The element has uniform unit thickness h . The material is isotropic with elastic modulus E and Poissons ratio and consequently E reduces to (E17.3). The stiffness matrix of this element can be expressed in closed form.8 For convenience dene = a /b (rectangle aspect ratio), 1 = (1 + ) , 2 = (1 3) , 3 = 2 + (1 ) 2 , 4 = 2 2 + (1 ), 5 = (1 ) 2 4, 6 = (1 ) 2 1, 7 = 4 2 (1 ) and 8 = 2 (1 ). Then the stiffness matrix in closed form is
Eh e K = 2 24 (1 )
43
31 44
25 32 43
32 48 31 44
23 31 46 32 43
31 24 32 27 31 44
46 32 23 31 25 32 43
symm
32 27 31 24 . 32 48 31 44
(E17.5)
The reason for this option is speed. A symbolic or exact computation can take orders of magnitude more time than a oating-point evaluation. This becomes more pronounced as elements get more complicated. The rank of an element stiffness is discussed in Chapter 19. This closed form can be obtained by either exact integration, or numerical integration with a 2 2 or higher Gauss rule.
7 8
1714
1715
Exercises
EXERCISE 17.1 [C:20] Exercise the Mathematica module of Figure E17.1 with the following script:
ClearAll[Em,nu,a,b,h]; Em=48; h=1; a=4; b=2; nu=0; ncoor={{0,0},{a,0},{a,b},{0,b}}; Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; For [p=1, p<=4, p++, Ke= Quad4IsoPMembraneStiffness[ncoor,Emat,h,{True,p}]; Print["Gauss integration rule: ",p," x ",p]; Print["Ke=",Chop[Ke]//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]]]] ]; Verify that for integration rules p=2,3,4 the stiffness matrix does not change and has three zero eigenvalues, which correspond to the three two-dimensional rigid body modes. On the other hand, for p = 1 the stiffness matrix is different and displays ve zero eigenvalues, which is physically incorrect. (This phenomenon is analyzed further in Chapter 19.) Question: why does the stiffness matrix stays exactly the same for p 2? Hint: take a look at the entries of the integrand h BT EB J ;for a rectangular geometry are those polynomials in and , or rational functions? If the former, of what polynomial order in and are the entries?
EXERCISE 17.2 [C:20] Check the rectangular element stiffness closed form given in (E17.5). This may be
done by hand (takes a while) or (quicker) running the script of Figure E17.3, which calls the Mathematica module of Figure E17.1.
ClearAll[Em,,a,b,h,]; b=a/; ncoor={{0,0},{a,0},{a,b},{0,b}}; Emat=Em/(1-^2)*{{1,,0},{,1,0},{0,0,(1-)/2}}; Ke= Quad4IsoPMembraneStiffness[ncoor,Emat,h,{False,2}]; scaledKe=Simplify[Ke*(24*(1-^2)*/(Em*h))]; Print["Ke=",Em*h/(24**(1-^2)),"*\n",scaledKe//MatrixForm];
Figure E17.3. Script suggested for Exercise E17.2.
The scaling introduced in the last two lines is for matrix visualization convenience. Verify (E17.5) by printout inspection and report any typos to instructor.
EXERCISE 17.3 [A/C:25=5+10+10] A Bernoulli-Euler plane beam of thin rectangular cross-section with span L , height b and thickness h (normal to the plane of the gure) is bent under end moments M as illustrated in Figure E17.4. The beam is fabricated of isotropic material with elastic modulus E and Poissons ratio . The exact solution of the beam problem (from both the theory-of-elasticity and beam-theory standpoints) is a constant bending moment M along the span. Consequently the beam deforms with uniform curvature 1 hb3 is the cross-section second moment of inertia about z . = M /( E Iz ), in which Iz = 12
The beam is modeled with one layer of identical 4-node iso-P bilinear quadrilaterals through its height. These are rectangles with horizontal dimension a ; in the Figure a = L /4. The aspect ratio b/a is denoted by . By analogy with the exact solution, all rectangles in the nite element model will undergo the same deformation. We can therefore isolate a typical element as illustrated in Figure E17.4. The exact displacement eld for the beam segment referred to the {x , y } axes placed at the element center as shown in the bottom of Figure E17.4, are u x = x y , uy = 1 (x 2 + y 2 ), 2 (E17.6)
1715
1716
M
z
y b h
Cross section
y 4 b=a 1 a
Figure E17.4. Pure bending of Bernoulli-Euler plane beam of thin rectangular cross section, for Exercises 17.37. The beam is modeled by one layer of 4-node iso-P bilinear quadrilaterals through its height.
3 x 2
where is the deformed beam curvature M / E I . The stiffness equations of the typical rectangular element are given by the close form expression (E17.5). The purpose of this Exercise is to compare the in-plane bending response of the 4-node iso-P bilinear rectangle to that of a Bernoulli-Euler beam element (which would be exact for this conguration). The quadrilateral element will be called x-bending exact if it reproduces the beam solution for all { , }. This comparison is distributed into three items. (a) Check that (E17.6), as a plane stress 2D elasticity solution, is in full agreement with Bernoulli-Euler beam theory. This can be done by computing the strains ex x = u x / x , e yy = u y / y and 2ex y = u y / x + u x / y . Then get the stresses x x , yy and x y through the plane stress constitutive matrix (E17.3) of an isotropic material. Verify that both yy and x y vanish for any , and that x x = E y = M y / Iz , which agrees with equation (13.4) in Chapter 13. (ubeam )T Ke ubeam absorbed by the 4-node element under nodal Compute the strain energy Uquad = 1 2 displacements ubeam constructed by evaluating (E17.6) at the nodes 1,2,3,4. To simplify this calculation, it is convenient to decompose that vector as follows:
x + ubeam = 1 ab [ 1 0 1 0 1 0 1 0 ]T ubeam = ubeam 4 y
(b)
(E17.7)
(E17.8)
This energy can be easily computed by Mathematica by using the rst 4 lines of the script of the previous x is formed Exercise, except that here ncoor={ { -a,-b },{ a,-b },{ a,b },{ -a,b } }/2. If vector ubeam in u as a one-dimensional list, Uquad=Simplify[u.Ke.u/2]. This should come out as a function of M , E , , h , a and because = M /( E Iz ) = 12 M /( Eha 3 3 ). (c) From Mechanics of Materials, or equation (13.7) of Chapter 13, the strain energy absorbed by the M a = M 2 a /(2 E Iz ) = beam segment of length a under a constant bending moment M is Ubeam = 1 2
1716
1717
Exercises
6 M 2 /( Eha 2 3 ). Form the energy ratio r = Uquad / Ubeam and show that it is a function of the rectangle aspect ratio = b/a and of Poissons ratio only: 1 + 2/ 2 . (E17.9) (2/ 2 )(1 2 ) This happens to be the ratio of the 2D model solution to the exact (beam) solution. Hence r = 1 means that we get the exact answer, that is the 2D model is x -bending exact. If r > 1 the 2D model is overstiff, . Moreover if and if r < 1 the 2D model is overexible. Evidently r > 1 for all if 0 1 2 b << a , r >> 1; for example if a = 10b and = 0, r 50 and the 2D model gives only about 2% of the correct solution. This phenomenon is referred to in the FEM literature as shear locking, because overstiffness is due to the bending motion triggering spurious shear energy in the element. Remedies to shear locking at the element level are studied in advanced FEM courses. Draw conclusions as to the adequacy or inadequacy of the 2D model to capture inplane bending effects, and comment on how you might improve results by modifying the discretization of Figure E17.4.9 r = r ( , ) =
EXERCISE 17.4 [A+C:20] A naive remedy to shear locking can be attempted with the weighted integration
e methodology outlined in 17.6.1. Let Ke 11 and K22 denote the element stiffnesses produced by 11 and 22 Gauss product rules, respectively. Take e e Ke = (1 )K11 + K22
(E17.10)
where is adjusted so that shear locking is reduced or eliminated. It is not difcult to nd if the element is rectangular and isotropic. For the denition of x-bending exact please read the previous Exercise. Inserting Ke into the test introduced there verify that r= Whence show that if (1 + 2 2 ) . (2/ 2 )(1 2 ) (E17.11)
2/ 2 (1 2 ) , (E17.12) 1 + 2/ 2 then r 1 for all { , } and the element is x -bending exact. A problem with this idea is that it does not make it y -bending exact because r ( ) = r (1/ ) if = 1. Moreover the device is not easily extended to non-rectangular geometries or non-isotropic material. =
EXERCISE 17.5 [A+C:35] (Advanced) To understand this Exercise please begin by reading Exercise 17.3, and the concept of shear locking. The material is again assumed isotropic with elastic modules E and Poissons ratio . The 4-node rectangular element will be said to be bending exact if r = 1 for any { , } if the bending test described in Exercise 17.3 is done in both x and y directions. A bending-exact element is completely shear-lock-free.
The selective integration scheme outlined in 17.6.2 is more effective than weighted integration (covered in the previous exercise) to fully eliminate shear locking. Let the integration rules (I) and (II) be the 11 and 22 product rules, respectively. However the latter is generalized so the sample points are located at {, }, {, }, { , } and { , }, with weight 1.10 Consider the stress-strain splitting 0 1 0 1 0 E E E 0 = + (E17.13) E= 1 0 1 0 = EI + EII , 1 2 0 0 1 1 2 1 2 1 0 0 0 0 0 2 2
9
Note that even if we make a 0 and = b/a by taking an innite number of rectangular elements along x , the energy ratio r remains greater than one if > 0 since r 1/(1 2 ). Thus the 2D model would not generally converge to the correct solution if we keep one layer through the height. For a rectangular geometry these sample points lie on the diagonals. In the case of the standard 2-point Gauss product rule = 1/ 3.
10
1717
1718
e 2 the resulting element stiffness Ke I + KII is bending exact for any {, }. As a corollary show that that if = , which corresponds to the splitting
E E= 1 2
then = 1/ 3 and rule (II) becomes the standard 22 Gauss product rule. What are two computationally convenient settings for ?
EXERCISE 17.6 [A+C:35] (Advanced) A variation on the previous exercise on selective integration to make
1 0 1 0 0 0 1 2
E = 1 2
2 0 2 0 0 0 1 2
E + 1 2
1 2 0 1 2 0 0 0 0
= EI + EII ,
(E17.15)
the isotropic rectangular 4-node element bending exact. Integration rule (I) is not changed. However rule (II) has four sample points located at {0, }, { , 0}, {0, } and { , 0} each with weight 1.11 Show that if one selects the stress-strain splitting (E17.13) and = 2(1 2 ) 3(1 ) (E17.16)
e the resulting element stiffness Ke I + KII is bending exact for any {, }. Discuss which choices of reduce to 1/ 3 and 2/3, respectively.
EXERCISE 17.7 [A+C:40] (Advanced, research paper level, requires a CAS to be tractable) Extend Exercise
The rules for the selective integration scheme are as described in Exercise 17.5. The appropriate stress-strain splitting is E = EI + EII = in which is arbitrary and 1 1 = 3 2 E 1 |E| = , 2 2 3 C11 11 ( E 22 E 33 E 23 ) 1 2 = 3 2 E 1 |E| = , 2 2 3 C22 22 ( E 11 E 33 E 13 ) E 11 1 E 12 E 13 E 12 E 22 2 E 23 E 13 E 23 E 33 + E 11 (1 1 ) E 12 (1 ) 0 E 12 (1 ) E 22 (1 2 ) 0 0 0 0 (E17.18)
2 2 2 E 22 E 13 E 33 E 12 , |E| = det(E) = E 11 E 22 E 33 + 2 E 12 E 13 E 23 E 11 E 23
(E17.19) Show that the resulting rectangular element is bending exact for any E and = 0. (In practice one would select = 1/ 3.)
2 C11 = E 11 ( E 22 E 33 E 13 )/|E|,
2 C22 = E 22 ( E 11 E 33 E 13 )/|E|.
11
This is called a 4-point median rule, since the four points are located on the quadrilateral medians.
1718
Introduction to FEM
Isoparametric Quadrilaterals
17
IFEM Ch 17 Slide 1
Introduction to FEM
Isoparametric Quadrilaterals
Implementation Steps for Element Stiffness Matrix: 1. Construct Shape Functions in Quad Coordinates (Chapter 18 is devoted to this topic) 2. Compute x-y Derivatives of Shape Functions and Build Strain-Displacement Matrix B 3. Integrate h B TE B over element
IFEM Ch 17 Slide 2
Introduction to FEM
Shape functions are written in terms of and But Cartesian partials (with respect to x, y ) are required to get strains & stresses
IFEM Ch 17 Slide 3
Introduction to FEM
= J T
dx dy
in which
x J= ( x , y ) = x ( , )
y = y
J1 =
( , ) x = (x , y) y
x y
IFEM Ch 17 Slide 4
Introduction to FEM
Ni Nie Nie = + y y x x
y y
IFEM Ch 17 Slide 5
Introduction to FEM
( , ) x = ( x , y) y
IFEM Ch 17 Slide 6
Introduction to FEM
x=
i =1
xi Nie
n i =1 n
y=
y = y =
i =1 n i =1 n i =1
yi Nie
N yi i ,
Nie yi .
e
x = x =
Ni e , xi
Nie xi , i =1
x y
IFEM Ch 17 Slide 7
Introduction to FEM
Form J and invert to get J1 and J = det J Apply the chain rule to get the x , y partials of the S.F.s
IFEM Ch 17 Slide 8
Introduction to FEM
0 N1 y N1 x
e
N2e x 0
e N2 y
0 N2 y N2 x
e
e Nn x
Nn u e = B ue y e Nn x
e
0 N ne y
IFEM Ch 17 Slide 9
Introduction to FEM
IFEM Ch 17 Slide 10
Introduction to FEM
F ( ) d =
i =1
wi F ( i )
One point Two points Three points For 4 and 5 points see Notes
IFEM Ch 17 Slide 11
Introduction to FEM
IFEM Ch 17 Slide 12
Introduction to FEM
IFEM Ch 17 Slide 13
Introduction to FEM
F ( , ) d d =
1 1
1 1
F ( , ) d .
Gauss integration rules with p 1 points in the direction and p 2 points in the direction:
1 1 1 1
F ( , ) d d =
1 1
1 1
p1
p2
F ( , ) d
i =1 j =1
wi w j F ( i , j )
Usually p1 = p 2
IFEM Ch 17 Slide 14
Introduction to FEM
p = 3 (3 x 3 rule)
p = 4 (4 x 4 rule)
IFEM Ch 17 Slide 15
Introduction to FEM
Works for any combination of p1 = 1,2,3,4,5 and p 2 = 1,2,3,4,5 Calls 1D Gauss rule module LineGaussRuleInfo twice
IFEM Ch 17 Slide 16
Introduction to FEM
C B
de
A x
y d
O
x d
x x y x y = OB OA = d d d d = y = |J|d d = J d d .
x y
d d
IFEM Ch 17 Slide 17
Introduction to FEM
h BT EB d
K
where
1 1
1 1
F( , ) d d
= d x d y = det J d d F( , ) = h BT E B det J
F( , ) d d =
1 1
1 1
p1
p2
F( , ) d
i =1 j =1
wi w j F ( i , j )
IFEM Ch 17 Slide 18
Introduction to FEM
IFEM Ch 17 Slide 19
Introduction to FEM
y 4 b = a/
3 2 x
IFEM Ch 17 Slide 20
1719
Solutions to Exercises
6. 6. 18. 6. 6. 6. 18. 6.
1719
1720
The Ke given by the 1 1 Gauss rule has a rank deciency of two because it has ve zero eigenvalues instead of three. This behavior is explained in Chapter 19. The 2 2, 3 3 and 4 4 rules produce the same stiffness matrix. This matrix has three zero eigenvalues, which correspond to the three independent rigid body modes in two dimensions. The reason for the repeating stiffness matrices is that the integrand h BT EB J is at most quadratic in and because h and E are constant, B is linear in and , and for a rectangle J is constant over the element. A 2-point product Gauss rule is exact for up to cubic polynomials in the and directions, so it does quadratics exactly.
EXERCISE 17.2 The verication can be done in several ways: (1) doing it all by hand, (2) using the suggested
Mathematica script of Figure E17.3 and visually comparing to (E17.5) entry by entry, or (3) doing a fully automatic verication. The script shown in the top cell of Figure E17.7 takes the latter approach. (Any of the 3 ways gets credit, but the last one is quicker.)
ClearAll[Em, ,a,b, ,h,1,2,3,4,5,6,7,8]; 1=(1+ )* ; 2=(1-3* )* ; 3=2+(1- )* ^2; 4=2* ^2+(1- ); 5=(1- )* ^2-4; 6=(1- )* ^2-1; 7=4* ^2-(1- ); 8= ^2-(1- ); b=a/ ; kfac=Em*h/(24* *(1- ^2)); Kr=kfac*{{43, 31, 25,-32,-23,-31,-46, 32}, {0, 44, 32, 48,-31,-24,-32,-27}, {0,0, 43,-31,-46,-32,-23, 31}, {0,0,0, 44, 32,-27, 31,-24}, {0,0,0,0, 43, 31, 25,-32}, {0,0,0,0,0, 44, 32, 48}, {0,0,0,0,0,0, 43,-31}, {0,0,0,0,0,0,0, 44}}; For[i=2,i<=8,i++,For[j=1,j<=i-1,j++,Kr[[i,j]]=Kr[[j,i]]]]; Emat=Simplify[Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}]; ncoor={{0,0},{a,0},{a,b},{0,b}}; Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,h,{False,2}]; dK=Simplify[Kr-Ke]; Print["This should be the null matrix:", dK//MatrixForm]; 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
The code of Figure E17.7 builds the alleged exact stiffness (E17.5) in Kr (the 2 For loops symmetrize that matrix), then invokes Quad4IsoPMembraneStiffness with symbolic inputs placing the returned stiffness in Ke. The difference Ke-Kr is printed upon simplication. If the two matrices are identical for any symbolic input the difference should be the null matrix of order 8, which can be easily inspected. As shown in the bottom cell of Figure E17.7, the matrices match.
EXERCISE 17.3
The verication (a) is immediate. The script shown in Figure E17.8 does (b), computes the energy ratio r for (c), and plots it for Poissons ratios = 0, 1 , 1 . The plots show that r never exceeds 1. 4 2
1720
1721
Solutions to Exercises
ClearAll[Em, ,a,b,h,Iz,M]; b= *a; Iz=h*b^3/12; kappa=M/(Em*Iz); ncoor={{-a/2,-b/2},{a/2,-b/2},{a/2,b/2},{-a/2,b/2}}; Emat=Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}; Ke= Quad4IsoPMembraneStiffness[ncoor,{Emat,0,0},{h},{False,2}]; Ke=Simplify[Ke]; u=kappa*a*b*{-1,0,1,0,-1,0,1,0}/4; Uquad=Simplify[u.Ke.u/2]; Ubeam=Simplify[M*kappa*a/2]; Print["Uquad=",Uquad, ", Ubeam=",Ubeam]; r=Simplify[Ubeam/Uquad]; Print["r=Ubeam/Uquad=",r]; Plot[{r/. ->0,r/. ->1/4,r/. ->1/2},{ ,0.1,10}];
3 M2 1 2 2 a2 Em h 5 1 2 6 M2 a2 Em h 3
Uquad
Ubeam
r Ubeam Uquad
1 0.8 0.6 0.4 0.2 2
2 2 1 2 1 2 2
10
EXERCISE 17.4 Not assigned. EXERCISE 17.5 Not assigned. EXERCISE 17.6 Not assigned. EXERCISE 17.7 Not assigned.
1721
18
181
182
TABLE OF CONTENTS
Page
18.1. Requirements 18.2. Direct Fabrication of Shape Functions 18.3. Triangular Element Shape Functions 18.3.1. The Three-Node Linear Triangle . . . . 18.3.2. The Six-Node Quadratic Triangle . . . 18.4. Quadrilateral Element Shape Functions 18.4.1. The Four-Node Bilinear Quadrilateral . . 18.4.2. The Nine-Node Biquadratic Quadrilateral 18.4.3. The Eight-Node Serendipity Quadrilateral 18.5. Does the Magic Wand Always Work? 18.5.1. Hierarchical Corrections . . . . . . 18.5.2. Transition Element Example . . . . . 18.6. *Mathematica Modules to Plot Shape Functions 18. Notes and Bibliography . . . . . . . . . . . . . . . 18. References . . . . . . . . . . . . . . . 18. Exercises . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
183 183 184 184 185 186 186 187 189 1810 1810 1811 1812 1814 1814 1815
182
18.2
This Chapter explains, through a series of examples, how isoparametric shape functions can be directly constructed by geometric considerations. For a problem of variational index 1, the isoparametric shape function Nie associated with node i of element e must satisfy the following conditions: (A) Interpolation condition. Takes a unit value at node i , and is zero at all other nodes. (B) Local support condition. Vanishes over any element boundary (a side in 2D, a face in 3D) that does not include node i . (C) Interelement compatibility condition. Satises C 0 continuity between adjacent elements over any element boundary that includes node i . (D) Completeness condition. The interpolation is able to represent exactly any displacement eld which is a linear polynomial in x and y ; in particular, a constant value. Requirement (A) follows directly by interpolation from node values. Conditions (B), (C) and (D) are consequences of the convergence requirements discussed further in the next Chapter.1 For the moment these three conditions may be viewed as recipes. One can readily verify that all isoparametric shape function sets listed in Chapter 16 satisfy the rst two conditions from construction. Direct verication of condition (C) is also straightforward for those examples. A statement equivalent to (C) is that the value of the shape function over a side (in 2D) or face (in 3D) common to two elements must uniquely depend only on its nodal values on that side or face. Completeness is a property of all element isoparametric shape functions taken together, rather than of an individual one. If the element satises (B) and (C), in view of the discussion in 16.6 it is sufcient to check that the sum of shape functions is identically one. 18.2. Direct Fabrication of Shape Functions Contrary to the what the title of this Chapter implies, the isoparametric shape functions listed in Chapter 16 did not come out of a magicians hat. They can be derived systematically by a judicious inspection process. By inspection it is meant that the geometric visualization of shape functions plays a crucial role. The method is based on the following observation. In all examples given so far the isoparametric shape functions are given as products of fairly simple polynomial expressions in the natural coordinates. This is no accident but a direct consequence of the denition of natural coordinates. All shape functions of Chapter 16 can be expressed as the product of m factors: Nie = ci L 1 L 2 . . . L m , where L j = 0, j = 1, . . . m . (18.2) are the homogeneous equation of lines or curves expressed as linear functions in the natural coordinates, and ci is a normalization coefcient.
1
(18.1)
Convergence means that the discrete FEM solution approaches the exact analytical solution as the mesh is rened.
183
184
(a)
(b) 3
(c)
1 = 0
3 2 1 1
Figure 18.1. The three-node linear triangle: (a) element geometry; (b) equation of side opposite corner 1; (c) perspective view of the shape function N1 = 1 .
For two-dimensional isoparametric elements, the ingredients in (18.1) are chosen according to the following ve rules. R1 Select the L j as the minimal number of lines or curves linear in the natural coordinates that cross all nodes except the i th node. (A sui generis cross the dots game.) Primary choices in 2D are the element sides and medians. R2 Set coefcient ci so that Nie has the value 1 at the i th node. R3 Check that Nie vanishes over all element sides that do not contain node i . R4 Check the polynomial order over each side that contains node i . If the order is n , there must be exactly n + 1 nodes on the side for compatibility to hold. R5 If local support (R3) and interelement compatibility (R4) are satised, check that the sum of shape functions is identically one. The examples that follow show these rules in action for two-dimensional elements. Essentially the same technique is applicable to one- and three-dimensional elements. 18.3. Triangular Element Shape Functions This section illustrates the use of (18.1) in the construction of shape functions for the linear and the quadratic triangle. The cubic triangle is dealt with in Exercise 18.1. 18.3.1. The Three-Node Linear Triangle Figure 18.1 shows the three-node linear triangle that was studied in detail in Chapter 15. The three shape functions are simply the triangular coordinates: Ni = i , for i = 1, 2, 3. Although this result follows directly from the linear interpolation formula of 15.2.4, it can be also quickly derived from the present methodology as follows. The equation of the triangle side opposite to node i is L j -k = i = 0, where j and k are the cyclic permutations of i . Here symbol L j -k denotes the left hand side of the homogeneous equation of the natural coordinate line that passes through node points j and k . See Figure 18.1(b) for i = 1, j = 2 and k = 3. Hence the obvious guess is Nie
guess
ci L i .
(18.3)
184
185
18.3
(a)
(b)
5 2 4
1 = 0
(c)
1 = 0
6
1 = 1/2
5 6 2 4 4 1
5 2
2 = 0
Figure 18.2. The six-node quadratic triangle: (a) element geometry; (b) lines e e (in red) whose product yields N1 ; (c) lines (in red) whose product yields N4 .
This satises conditions (A) and (B) except the unit value at node i ; this holds if ci = 1. The local support condition (B) follows from construction: the value of i is zero over side j k . Interelement compatibility follows from R4: the variation of i along the 2 sides meeting at node i is linear and that there are two nodes on each side; cf. 15.4.2. Completeness follows since e e e e + N2 + N3 = 1 + 2 + 3 = 1. Figure 18.1(c) depicts N1 = 1 , drawn normal to the element N1 in perspective view. 18.3.2. The Six-Node Quadratic Triangle The geometry of the six-node quadratic triangle is shown in Figure 18.2(a). Inspection reveals two types of nodes: corners (1, 2 and 3) and midside nodes (4, 5 and 6). Consequently we can expect two types of associated shape functions. We select nodes 1 and 4 as representative cases. For both cases we try the product of two linear functions in the triangular coordinates because we expect the shape functions to be quadratic. These functions are illustrated in Figures 18.2(b,c) for corner node 1 and midside node 4, respectively. For corner node 1, inspection of Figure 18.2(b) suggests trying
e N1 guess
c1 L 2-3 L 4-6 ,
(18.4)
e will vanish over 2-5-3 and 4-6. This makes the function Why is (18.4) expected to work? Clearly N1 zero at nodes 2 through 6, as is obvious upon inspection of Figure 18.2(b), while being nonzero at node 1. This value can be adjusted to be unity if c1 is appropriately chosen. The equations of the lines that appear in (18.4) are
1 = 0,
L 4- 6 :
1 2
= 0.
(18.5) (18.6)
e = c1 1 (1 1 ), N1 2
e To nd c1 , evaluate N1 (1 , 2 , 3 ) at node 1. The triangular coordinates of this node are 1 = 1, e (1, 0, 0) = c1 1 1 = 1 whence 2 = 3 = 0. We require that it takes a unit value there: N1 2 c1 = 2 and nally e N1 = 21 (1 1 ) = 1 (21 1), (18.7) 2
185
186
3
6 1 5 4 2
3 1 4
6 5 2
N1 = 1(21 1)
N4e = 4 1 2
e e Figure 18.3. Perspective view of shape functions N1 and N4 for the quadratic triangle. The plot is done over a straight side triangle for programming simplicity.
as listed in 16.5.2. Figure 18.3 shows a perspective view. The other two corner shape functions follow by cyclic permutations of the corner index. For midside node 4, inspection of Figure 18.2(c) suggests trying
e N4 guess
c4 L 2-3 L 1-3
(18.8)
Evidently (18.8) satises requirements (A) and (B) if c4 is appropriately normalized. The equation e (1 , 2 , 3 ) = c4 1 2 . of sides L 2-3 and L 1-3 are 1 = 0 and 2 = 0, respectively. Therefore N4 , To nd c4 , evaluate this function at node 4, the triangular coordinates of which are 1 = 2 = 1 2 1 1 e 1 1 3 = 0. We require that it takes a unit value there: N4 ( 2 , 2 , 0) = c4 2 2 = 1. Hence c4 = 4, which gives e = 41 2 (18.9) N4 as listed in 16.5.2. Figure 18.3 shows a perspective view of this shape function. The other two midside shape functions follow by cyclic permutations of the node indices. It remains to carry out the interelement continuity check. Consider node 1. The boundaries containing node 1 and common to adjacent elements are 12 and 13. Over each one the variation e of N1 is quadratic in 1 . Therefore the polynomial order over each side is 2. Because there are three nodes on each boundary, the compatibility condition (C) of 18.1 is veried. A similar check can be carried out for midside node shape functions. Exercise 16.1 veried that the sum of the Ni is unity. Therefore the element is complete. 18.4. Quadrilateral Element Shape Functions Three quadrilateral elements, with 4, 9 and 8 nodes, respectively, which are commonly used in computational mechanics serve as examples to illustrate the construction of shape functions. Elements with more nodes, such as the bicubic quadrilateral, are not treated as they are rarely used. 18.4.1. The Four-Node Bilinear Quadrilateral The element geometry and natural coordinates are shown in Figure 18.4(a). Only one type of node (corner) and associated shape function is present. Consider node 1 as typical. Inspection of 186
187
18.4
(a)
4
=1
(b)
4
(c)
3 =1 1 4 3
1 2
1 2 2
Figure 18.4. The four-node bilinear quadrilateral: (a) element geometry; (b) sides (in red) e that do not contain corner 1; (c) perspective view of the shape function N1 .
c1 L 2-3 L 3-4
(18.10)
This plainly vanishes over nodes 2, 3 and 4, and can be normalized to unity at node 1 by adjusting c1 . By construction it vanishes over the sides 23 and 34 that do not belong to 1. The equation of side 2-3 is = 1, or 1 = 0. The equation of side 3-4 is = 1, or 1 = 0. Replacing in (18.10) yields e N1 (, ) = c1 ( 1)( 1) = c1 (1 )(1 ). (18.11) To nd c1 , evaluate at node 1, the natural coordinates of which are = = 1:
e N1 (1, 1) = c1 2 2 = 4c1 = 1.
(18.12)
Hence c1 =
1 4
(18.13)
as listed in 16.6.2. Figure 18.4(c) shows a perspective view. For the other three nodes the procedure is the same, traversing the element cyclically. It can be veried that the general expression of the shape functions for this element is (1 + i )(1 + i ). Nie = 1 4 (18.14)
e The continuity check proceeds as follows, using N1 as example. Node 1 belongs to interelement e is a linear function of . To see boundaries 12 and 13. Over side 12, = 1 is constant and N1 e is a linear function of . this, replace = 1 in (18.13). Over side 13, = 1 is constant and N1 Consequently the polynomial variation order is 1 over both sides. Because there are two nodes on each side the compatibility condition is satised. The sum of the shape functions is one, as shown in (16.21); thus the element is complete.
187
188
=1 =0 4 7 9 5 2 =1 3 6 =0 =1
3 4 8 1 7 9 6
8 1
5 2 =1
=0 4 = 1 8 1
7 9 5
3 4 6 =1 = 1 8 1 2 = 1 7 9 5
3 6 =1
Figure 18.5. The nine-node biquadratic quadrilateral: (a) element geometry; (b,c,d): lines e e e , N5 and N9 , respectively. (in red) whose product makes up the shape functions N1
(a)
8
4 7 3 9 6 5
(b)
8
4 7 3 9 6 5 2
e N5
2
e N1
=
5
1 ( 4
1)( 1)
1 8
=1 (1 2 )( 1) 2
4 7 9 3
(c)
(d)
8 4 7 1
2 6 3
6 5 2
N9e = (1 2 )(1 2 )
Figure 18.6. Perspective view of the shape functions for nodes 1, 5 and 9 of the nine-node biquadratic quadrilateral.
188
189
18.4
3 4 8 1 5 2 7 4 6 1 8
=1 7 3 + = 1 4 6 =1 5 2 1 = 1 8
=1 7 3 6
=1
5 2
Figure 18.7. The eight-node serendipity quadrilateral: (a) element geometry; (b,c): e e and N5 , respectively. lines (in red) whose product make up the shape functions N1
18.4.2. The Nine-Node Biquadratic Quadrilateral The element geometry is shown in Figure 18.5(a). This element has three types of shape functions, which are associated with corner nodes, midside nodes and center node, respectively. The lines whose product is used to construct three types of shape functions are illustrated in Figure 18.5(b,c,d) for nodes 1, 5 and 9, respectively. The technique has been sufciently illustrated in previous examples. Here we summarize the calculations for nodes 1, 5 and 9, which are taken as representatives of the three types:
e = c1 L 2-3 L 3-4 L 5-7 L 6-8 = c1 ( 1)( 1) . N1 e = c5 L 2-3 L 1-4 L 6-8 L 3-4 = c5 ( 1)( + 1)( 1) = c5 (1 2 )(1 ). N5
(18.15) (18.16)
and we obtain the shape functions listed in 16.6.3. Perspective views are shown in Figure 18.6. The remaining Ni s are constructed through a similar procedure. Verication of the interelement continuity condition is immediate: the polynomial variation order of Nie over any side that belongs to node i is two and there are three nodes on each side. Exercise 16.2 checks that the sum of shape function is unity. Thus the element is complete. 18.4.3. The Eight-Node Serendipity Quadrilateral This is an eight-node quadrilateral element that results when the center node 9 of the biquadratic quadrilateral is eliminated by kinematic constraints. The geometry and node conguration is shown in Figure 18.7(a). This element was widely used in commercial codes during the 70s and 80s but it is gradually being phased out in favor of the 9-node quadrilateral. 189
1810
(a)
4 5 1
(b)
(c)
4 3 6
(d)
4 7 2 1 5 2 3 6
1 4 2
1 5
Figure 18.8. Node congurations for which the magic recipe does not work.
The 8-node quadrilateral has two types of shape functions, which are associated with corner nodes and midside nodes. Lines whose products yields the shape functions for nodes 1 and 5 are shown in Figure 18.7(b,c). Here are the calculations for shape functions of nodes 1 and 5, which are taken again as representative cases.
e = c1 L 2-3 L 3-4 L 5-8 = c1 ( 1)( 1)(1 + + ) = c1 (1 )(1 )(1 + + ), (18.19) N1 e = c5 L 2-3 L 3-4 L 4-1 = c5 ( 1)( + 1)( 1) = c5 (1 2 )(1 ). N5
(18.20) (18.21)
The other shape functions follow by appropriate permutation of nodal indices. The interelement continuity and completeness verication are similar to that carried out for the nine-node element, and are relegated to exercises. 18.5. Does the Magic Wand Always Work? The cross the dots recipe (18.1)-(18.2) is not foolproof. It fails for certain node congurations although it is a reasonable way to start. It runs into difculties, for instance, in the problem posed in Exercise 18.6, which deals with the 5-node quadrilateral depicted in Figure 18.8(a). If for node 1 one tries the product of side 23, side 34, and the diagonal 254, the shape function is easily e = 1 (1 )(1 )( + ). This satises conditions (A) and (B). However, worked out to be N1 8 it violates (C) along sides 12 and 41, because it varies quadratically over them with only two nodes per side. 18.5.1. Hierarchical Corrections A more robust technique relies on a correction approach, which employs a combination of terms such as (18.1). For example, a combination of two patterns, one with m factors and one with n factors, is c c d d d (18.22) Nie = ci L c 1 L 2 . . . L m + di L 1 L 2 . . . L n , Here two normalization coefcients: ci and di , appear. In practice trying forms such as (18.22) from scratch becomes cumbersome. The development is best done hierarchically. The rst term is 1810
1811
taken to be that of a lower order element, called the parent element, for which the one-shot approach works. The second term is then a corrective shape function that vanishes at the nodes of the parent element. If this is insufcient one more corrective term is added, and so on. The technique is best explained through examples. Exercise 18.6 illustrates the procedure for the element of Figure 18.8(a). The next subsection works out the element of Figure 18.8(b). 18.5.2. Transition Element Example The hierarchical correction technique is useful for transition elements, which have corner nodes but midnodes only over certain sides. Three examples are pictured in Figure 18.8(b,c,d). Shape functions that work can be derived with one, two and three hierarchical corrections, respectively.
e for the 4-node transition triangle shown in As an example, let us construct the shape function N1 Figure 18.8(b). Candidate lines for the recipe (18.1) are obviously the side 23: 1 = 0, and the median 34: 1 = 2 . Accordingly we try e N1 guess
c1 1 (1 2 ),
N1 (1, 0, 0) = 1 = c1 .
(18.23)
e = 1 (1 2 ) satises conditions (A) and (B) but fails compatibility: over side This function N1 e 2 13 of equation 2 = 0, because N1 (1 , 0, 3 ) = 1 . This varies quadratically but there are only 2 nodes on that side. Thus (18.23) is no good. e = 1 . To proceed hierarchically we start from the shape function for the 3-node linear triangle: N1 This will not vanish at node 4, so apply a correction that vanishes at all nodes but 4. From knowledge of the quadratic triangle midpoint functions, that is obviously 1 2 times a coefcient to be determined. The new guess is e N1 guess
1 + c1 1 2 .
1 2
(18.24)
1 + c1 4 = 0, whence
(18.25)
This is easily checked to satisfy compatibility on all sides. The verication of completeness is left to Exercise 18.8.
e = 1 (1 22 ), (18.25) can be constructed as the normalized product of lines Note that since N1 1 = 0 and 2 = /. The latter passes through 4 and is parallel to 13. As part of the opening moves in the shape function game this would be a lucky guess indeed. If one goes to a more complicated element no obvious factorization is possible.
1811
1812
PlotTriangleShapeFunction[xytrig_,f_,Nsub_,aspect_]:=Module[ {Ni,line3D={},poly3D={},zc1,zc2,zc3,xyf1,xyf2,xyf3, xc,yc, x1,x2,x3,y1,y2,y3,z1,z2,z3,iz1,iz2,iz3,d}, {{x1,y1,z1},{x2,y2,z2},{x3,y3,z3}}=Take[xytrig,3]; xc={x1,x2,x3}; yc={y1,y2,y3}; Ni=Nsub*3; Do [ Do [iz3=Ni-iz1-iz2; If [iz3<=0, Continue[]]; d=0; If [Mod[iz1+2,3]==0&&Mod[iz2-1,3]==0, d= 1]; If [Mod[iz1-2,3]==0&&Mod[iz2+1,3]==0, d=-1]; If [d==0, Continue[]]; zc1=N[{iz1+d+d,iz2-d,iz3-d}/Ni]; zc2=N[{iz1-d,iz2+d+d,iz3-d}/Ni]; zc3=N[{iz1-d,iz2-d,iz3+d+d}/Ni]; xyf1={xc.zc1,yc.zc1,f[zc1[[1]],zc1[[2]],zc1[[3]]]}; xyf2={xc.zc2,yc.zc2,f[zc2[[1]],zc2[[2]],zc2[[3]]]}; xyf3={xc.zc3,yc.zc3,f[zc3[[1]],zc3[[2]],zc3[[3]]]}; AppendTo[poly3D,Polygon[{xyf1,xyf2,xyf3}]]; AppendTo[line3D,Line[{xyf1,xyf2,xyf3,xyf1}]], {iz2,1,Ni-iz1}],{iz1,1,Ni}]; Show[ Graphics3D[RGBColor[1,0,0]],Graphics3D[poly3D], Graphics3D[Thickness[.002]],Graphics3D[line3D], Graphics3D[RGBColor[0,0,0]],Graphics3D[Thickness[.005]], Graphics3D[Line[xytrig]],PlotRange->All, BoxRatios->{1,1,aspect},Boxed->False] ]; ClearAll[f1,f4]; xyc1={0,0,0}; xyc2={3,0,0}; xyc3={Sqrt[3],3/2,0}; xytrig=N[{xyc1,xyc2,xyc3,xyc1}]; Nsub=16; f1[zeta1_,zeta2_,zeta3_]:=zeta1*(2*zeta1-1); f4[zeta1_,zeta2_,zeta3_]:=4*zeta1*zeta2; PlotTriangleShapeFunction[xytrig,f1,Nsub,1/2]; PlotTriangleShapeFunction[xytrig,f4,Nsub,1/2.5];
18.6.
A Mathematica module called PlotTriangleShape Functions, listed in Cell 18.1, has been developed to draw perspective plots of shape functions Ni (1 , 2 , 3 ) over a triangular region. The region is assumed to have straight sides to simplify the logic. The test statements that follow the module produce the shape function plots shown in Figure 18.3 for the 6-node quadratic triangle. Argument Nsub controls the plot resolution while aspect controls the x yz box aspect ratio. The remaining arguments are self explanatory. Another Mathematica module called PlotQuadrilateralShape Functions, listed in Cell 18.2, has been developed to produce perspective plots of shape functions Ni (, ) over a quadrilateral region. The region is assumed to have straight sides to simplify the logic. The test statements that follow the module produce
1812
1813
18.6
PlotQuadrilateralShapeFunction[xyquad_,f_,Nsub_,aspect_]:=Module[ {Ne,Nev,line3D={},poly3D={},xyf1,xyf2,xyf3,i,j,n,ixi,ieta, xi,eta,x1,x2,x3,x4,y1,y2,y3,y4,z1,z2,z3,z4,xc,yc}, {{x1,y1,z1},{x2,y2,z2},{x3,y3,z3},{x4,y4,z4}}=Take[xyquad,4]; xc={x1,x2,x3,x4}; yc={y1,y2,y3,y4}; Ne[xi_,eta_]:=N[{(1-xi)*(1-eta),(1+xi)*(1-eta), (1+xi)*(1+eta),(1-xi)*(1+eta)}/4]; n=Nsub; Do [ Do [ ixi=(2*i-n-1)/n; ieta=(2*j-n-1)/n; {xi,eta}=N[{ixi-1/n,ieta-1/n}]; Nev=Ne[xi,eta]; xyf1={xc.Nev,yc.Nev,f[xi,eta]}; {xi,eta}=N[{ixi+1/n,ieta-1/n}]; Nev=Ne[xi,eta]; xyf2={xc.Nev,yc.Nev,f[xi,eta]}; {xi,eta}=N[{ixi+1/n,ieta+1/n}]; Nev=Ne[xi,eta]; xyf3={xc.Nev,yc.Nev,f[xi,eta]}; {xi,eta}=N[{ixi-1/n,ieta+1/n}]; Nev=Ne[xi,eta]; xyf4={xc.Nev,yc.Nev,f[xi,eta]}; AppendTo[poly3D,Polygon[{xyf1,xyf2,xyf3,xyf4}]]; AppendTo[line3D,Line[{xyf1,xyf2,xyf3,xyf4,xyf1}]], {i,1,Nsub}],{j,1,Nsub}]; Show[ Graphics3D[RGBColor[1,0,0]],Graphics3D[poly3D], Graphics3D[Thickness[.002]],Graphics3D[line3D], Graphics3D[RGBColor[0,0,0]],Graphics3D[Thickness[.005]], Graphics3D[Line[xyquad]], PlotRange->All, BoxRatios->{1,1,aspect},Boxed->False] ]; ClearAll[f1,f5,f9]; xyc1={0,0,0}; xyc2={3,0,0}; xyc3={3,3,0}; xyc4={0,3,0}; xyquad=N[{xyc1,xyc2,xyc3,xyc4,xyc1}]; Nsub=16; f1[xi_,eta_]:=(1/2)*(xi-1)*(eta-1)*xi*eta; f5[xi_,eta_]:=(1/2)*(1-xi^2)*eta*(eta-1); f9[xi_,eta_]:=(1-xi^2)*(1-eta^2); PlotQuadrilateralShapeFunction[xyquad,f1,Nsub,1/2]; PlotQuadrilateralShapeFunction[xyquad,f5,Nsub,1/2.5]; PlotQuadrilateralShapeFunction[xyquad,f9,Nsub,1/3];
the shape function plots shown in Figure 18.6(a,b,d) for the 9-node biquadratic quadrilateral. Argument Nsub controls the plot resolution while aspect controls the x yz box aspect ratio. The remaining arguments are self explanatory.
1813
1814
Notes and Bibliography The name shape functions for interpolation functions directly expressed in terms of physical coordinates (the node displacements in the case of isoparametric elements) was coined by Irons. The earliest published reference seems to be the paper [18]. This was presented in 1965 at the rst Wright-Patterson conference, the rst all-FEM meeting that strongly inuenced the development of computational mechanics in Generation 2. The key connection to numerical integration was presented in [143], although it is mentioned in prior internal reports. A comprehensive exposition is given in the textbook by Irons and Ahmad [147]. The quick way of developing shape functions presented here was used in the writers 1966 thesis [67] for triangular elements. The qualier magic arose from the timing for covering this Chapter in a Fall Semester course: the lecture falls near Halloween. References Referenced items have been moved to Appendix R.
1814
1815
Homework Exercises for Chapter 18 Shape Function Magic
Exercises
EXERCISE 18.1 [A/C:10+10] The complete cubic triangle for plane stress has 10 nodes located as shown in Figure E18.1, with their triangular coordinates listed in parentheses.
3(0,0,1) 7(0,1/3,2/3) 8(1/3,0,2/3) 9(2/3,0,1/3) 8 6(0,2/3,1/3) 9 0(1/3,1/3,1/3) 5(1/3,2/3,0) 4(2/3,1/3,0) 1(1,0,0) 2(0,1,0) 4 1 0
3 7 6 2 5
Figure E18.1. Ten-node cubic triangle for Exercise 18.1. The left picture shows the superparametric element whereas the right one shows the isoparametric version with curved sides.
N1e
N4e
N0
e e e Figure E18.2. Perspective plots of the shape functions N1 , N4 and N0 for the 10-node cubic triangle.
(a)
e e e Construct the cubic shape functions N1 , N4 and N0 for nodes 1, 4, and 0 (the interior node is labeled as zero, not 10) using the line-product technique. [Hint: each shape function is the product of 3 and only 3 lines.] Perspective plots of those 3 functions are shown in Figure E18.2.
(b)
Construct the missing 7 shape functions by appropriate node number permutations, and verify that the sum of the 10 functions is identically one. For the unit sum check use the fact that 1 + 2 + 3 = 1.
e EXERCISE 18.2 [A:15] Find an alternative shape function N1 for corner node 1 of the 9-node quadrilateral
of Figure 18.5(a) by using the diagonal lines 58 and 294 in addition to the sides 23 and 34. Show that the resulting shape function violates the compatibility condition (C) stated in 18.1.
EXERCISE 18.3 [A/C:15] Complete the above exercise for all nine nodes. Add the shape functions (use a
lateral discussed in 18.4.3 satisfy the interelement compatibility condition (C) stated in 18.1. Obtain all 8 shape functions and verify that their sum is unity.
e e EXERCISE 18.5 [C:15] Plot the shape functions N1 and N5 of the eight-node serendipity quadrilateral studied
1815
1816
4 5 1 2
Figure E18.3. Five node quadrilateral element for Exercise 18.6.
N1
N5
EXERCISE 18.6 [A:15]. A ve node quadrilateral element has the nodal conguration shown in Figure E18.3.
e e and N5 are shown in that Figure.2 Find ve shape functions Nie , i = 1, 2, 3, 4, 5 that Perspective views of N1 satisfy compatibility, and also verify that their sum is unity.
Hint: develop N5 (, ) rst for the 5-node quad using the line-product method; then the corner shape functions i + N5 , i (, ) (i = 1, 2, 3, 4) for the 4-node quad (already given in the Notes); nally combine Ni = N N determining so that all Ni vanish at node 5. Check that N1 + N2 + N3 + N4 + N5 = 1 identically.
EXERCISE 18.7 [A:15]. An eight-node brick nite ele 8 5 7 4 1 6 3
ment for three dimensional analysis has three isoparametric natural coordinates called , and . These coordinates vary from 1 at one face to +1 at the opposite face, as sketched in Figure E18.4. Construct the (trilinear) shape function for node 1 (follow the node numbering of the gure). The equations of the brick faces are: 1485 : = 1 1265 : = 1 1234 : = 1 2376 : = +1 4378 : = +1 5678 : = +1
x z
y
Figure E18.4. Eight-node isoparametric brick element for Exercise 18.7.
EXERCISE 18.8 [A:15]. Consider the 4-node transition triangular element of Figure 18.8(b). The shape
function for node 1, N1 = 1 21 2 was derived in 18.5.2 by the correction method. Show that the others are N2 = 2 21 2 , N3 = 3 and N4 = 41 2 . Check that compatibility and completeness are veried.
EXERCISE 18.9 [A:15]. Construct the six shape functions for the 6-node transition quadrilateral element of Figure 18.8(c). Hint: for the corner nodes, use two corrections to the shape functions of the 4-node bilinear (1 )(1 ) 1 (1 2 )(1 ). quadrilateral. Check compatibility and completeness. Partial result: N1 = 1 4 4 EXERCISE 18.10 [A:20]. Consider a 5-node transition triangle in which midnode 6 on side 13 is missing. e = 1 21 2 22 3 . Can this be expressed as a line product like (18.1)? Show that N1
e e Although this N1 resembles the N1 of the 4-node quadrilateral depicted in Figure 18.4, they are not the same. That in e Figure E18.3 must vanish at node 5 ( = = 0). On the other hand, the N1 of Figure 18.4 takes the value 1 4 there.
1816
1817
4 4 3
Exercises
Set CL1
Side 2-4 maps to this parabola; part of triangle 2-3-4 turns "inside out"
4 4
3 1 4 4 2
Figure E18.5. Mapping of reference triangles under sets (E18.1) and (E18.2). Triangles are slightly separated at the diagonal 24 for visualization convenience.
EXERCISE 18.11 [A:30]. The three-node linear triangle is known to be a poor performer for stress analysis. In an effort to improve it, Dr. I. M. Clueless proposes two sets of quadratic shape functions:
CL1: CL2:
2 N1 = 1 ,
2 N2 = 2 ,
2 N3 = 3 . 2 N3 = 3 + 2 1 2 .
(E18.1) (E18.2)
2 + 22 3 , N1 = 1
2 N2 = 2 + 23 1 ,
Dr. C. writes a learned paper claiming that both sets satisfy the interpolation condition, that set CL1 will work because it is conforming and that set CL2 will work because N1 + N2 + N3 = 1. He provides no numerical examples. You get the paper for review. Show that the claims are false, and both sets are worthless. Hint: study 16.6 and Figure E18.5.
EXERCISE 18.12 [A:25]. Another way of constructing shape functions for incomplete elements is through
kinematic multifreedom constraints (MFCs) applied to a parent element that contains the one to be derived. Suppose that the 9-node biquadratic quadrilateral is chosen as parent, with shape functions called NiP , i = 1, . . . 9 given in 18.4.2. To construct the shape functions of the 8-node serentipity quadrilateral, the motions of node 9 are expressed in terms of the motions of the corner and midside nodes by the interpolation formulas u x 9 = (u x 1 + u x 2 + u x 3 + u x 4 ) + (u x 5 + u x 6 + u x 7 + u x 8 ), u y 9 = (u y 1 + u y 2 + u y 3 + u y 4 ) + (u y 5 + u y 6 + u y 7 + u y 8 ), (E18.3)
where and are scalars to be determined. (In the terminology of Chapter 9, u x 9 and u y 9 are slaves while boundary DOFs are masters.) Show that the shape functions of the 8-node quadrilateral are then Ni = NiP + N9P for i = 1, . . . 4 and Ni = NiP + N9P for i = 5, . . . 8. Furthermore, show that and can be determined by two conditions: 1. 2. The unit sum condition:
8 i =1
Ni = 1, leads to 4 + 4 = 1.
Solve these two equations for and , and verify that the serendipity shape functions given in 18.4.3 result.
EXERCISE 18.13 [A:25] Construct the 16 shape functions of the bicubic quadrilateral.
1817
Introduction to FEM
18
IFEM Ch 18 Slide 1
Introduction to FEM
IFEM Ch 18 Slide 2
Introduction to FEM
See Sec 18.1 for more detailed statement of (A) through (D). Implications of the last two requirements as regards convergence are discussed in Chapter 19.
IFEM Ch 18 Slide 3
Introduction to FEM
IFEM Ch 18 Slide 4
Introduction to FEM
Nie
guess
= ci L1 L2 . . . Lm
where L k = 0 are equations of "lines" expressed in natural coordinates, that cross all nodes except i
IFEM Ch 18 Slide 5
Introduction to FEM
1 = 0
2
2 1 1
e guess
cL = cL2-3
IFEM Ch 18 Slide 6
Introduction to FEM
N1 = 1
3 1
IFEM Ch 18 Slide 7
Introduction to FEM
1 = 0
5 2
6 4 1
5 2
1 = 1/2
1
N1
guess
c1 L2-3 L4-6
IFEM Ch 18 Slide 8
Introduction to FEM
1 = 0
5 2
6 4 1
5 2
6 4 1
2 = 0
e N1
guess
c1 L2-3 L4-6
IFEM Ch 18 Slide 9
Introduction to FEM
3 6 1 5 4 2 2 4 3 1 6 5
N1 = 1 (21 1)
N4e = 41 2
IFEM Ch 18 Slide 10
Introduction to FEM
e N1
guess
c1 L2-3 L3-4
IFEM Ch 18 Slide 11
Introduction to FEM
N1
=1 4 (1 )(1 )
IFEM Ch 18 Slide 12
Introduction to FEM
5 2
e N1
guess
IFEM Ch 18 Slide 13
Introduction to FEM
N9
IFEM Ch 18 Slide 14
Introduction to FEM
3 6
N1 = 1 ( 1)( 1) 4
(c) 5 1 8 2 6 3 9 7 4 1
N5e
(d) 8
1 (1 2
) ( 1)
2
4 7 9 3
6 5 2
(1 2 ) ( 1) N5 = 1 2
(back view)
N9 = (1 2 )(1 2 )
IFEM Ch 18 Slide 15
Introduction to FEM
N1
IFEM Ch 18 Slide 16
Introduction to FEM
4 5 1 2
e
(Exercise 18.6)
N1
N5e
Method also needs modifications in transition elements. One example is covered in the next two slides.
IFEM Ch 18 Slide 17
Introduction to FEM
1 4
e
For N1 try the magic wand: product of side 2-3 ( 1 = 0) and median 3-4 ( 1 = 2 ):
N1
guess
c1 1 ( 1 2 )
N1 (1, 0, 0) = 1 = c1
No good: fails compatibility over side 1-2
IFEM Ch 18 Slide 18
Introduction to FEM
1 2 4 Next, try the shape function of the linear 3-node triangle plus a correction:
N1
guess
1 + c1 1 2
Coefficient c 1 is determined by requiring this shape function e 1 1 1 vanish at midside node 4: N1 ( 2 , 2 , 0) = 1 + c 1 4 = 0, 2 whence c 1 = 2 and
N1 = 1 21 2
works
IFEM Ch 18 Slide 19
1818
N1e
8 9
3 7 0 5 6 2 4
N4e
8 9
3 7 0 5 6 2
e N0 8
3 7 0 6 2 5
4 4 1 1 Figure E18.6. Lines used for direct construction of shape functions of the 10-node cubic triangle.
EXERCISE 18.1
(a)
The shape functions for nodes 1, 4 and 0 of the 10-node cubic triangle can be obtained using the lines marked in red in Figure E18.6. The process is as follows.
e (1 , 2 , 3 ) = c1 1 (1 1 )(1 2 ) N1 3 3 e (1, 0, 0) = c1 1 N1 e = 9 ( N1 2 1 1 2 1 = 2 c = 1, 3 3 9 1 1 )(1 2 )= 1 (31 3 3 2 1
(E18.4)
e N4 (1 , 2 , 3 ) = c4 1 2 (1 1 ) 3 e 2 1 N4 ( 3 , 3 , 0) = c4 e N4 2 3
1 3
1 3
= =
1 3
2 c 27 4
= 1, 1)
(E18.5)
27 ( 2 1 2 1
1 3
1 ) 3
9 (31 2 1 2
e N0 (1 , 2 , 3 ) e 1 1 1 N0 (3, 3, 3) e N0
= c0 1 2 3 = c10
1 3
1 c 27 10
= 1,
(E18.6)
= 271 2 3 .
e N3 = 9 ( 1 )(3 2 ), 2 3 3 3 3 e N5 = e N7 = e N9 = 27 ( 2 1 2 2 27 ( 2 2 3 3 27 ( 2 3 1 1
1 ), 3 1 ), 3 1 ), 3
1 ), 3 1 ), 3 1 ). 3
1 3
(E18.7)
Here factors 9/2 and 27/2 may be partially absorbed to in the factors to make 1 (b)
31 1, etc.
The verication that the sum is unity is done with the Mathematica script shown in Figure E18.7. Notice the substitution enforcing 1 + 2 + 3 = 1.
Nf={ 1*(3* 1-1)*(3* 1-2)/2, 2*(3* 2-1)*(3* 2-2)/2, 3*(3* 3-1)*(3* 3-2)/2, 9* 1* 2*(3* 1-1)/2, 9* 1* 2*(3* 2-1)/2, 9* 2* 3*(3* 2-1)/2, 9* 2* 3*(3* 3-1)/2, 9* 3* 1*(3* 3-1)/2, 9* 3* 1*(3* 1-1)/2, 27* 1* 2* 3}; S=Simplify[Sum[Nf[[i]],{i,10}]/.{ 3->1- 1- 2}]; Print[S];
1
1818
1819
EXERCISE 18.2
e N1 (, ) = c( 1)( 1)( + )( + + 1).
Solutions to Exercises
(E18.8)
Evaluation at node 1 ( = = 1) gives 8c = 1, c = 1 . This satises conditions (A) and (B). But along side 8 12 ( = 1), for example, N e is a cubic in :
e N1 (, 1) = 1 ( 1)( 1). 4
(E18.9)
A cubic is determined by 4 node values but along side 12 there are only 3 nodes (1, 5, and 2); hence the interelement compatibility condition is violated.
EXERCISE 18.3 Yes, the nine shape functions do add up to unity.
e e e = 1 (1 + )(1 + )(1 ), N4 = 1 (1 )(1 + )(1 + ), N5 = 1 (1 2 )(1 ), + ), N3 4 4 2 1 1 1 e e e N6 = 2 (1 2 )(1 ), N7 = 2 (1 2 )(1 + ), N8 = 2 (1 2 )(1 + ). All shape functions vary quadratically over the sides = 1, = , and there are 3 nodes on each side. Hence the serendipity quadrilateral satises interelement compatibility. The unit sum verication is straightforward: e e EXERCISE 18.4 The shape functions are: N1 = 1 (1 )(1 )(1 + + ), N2 = 1 (1 + )(1 )(1 4 4
Nf={-(1/4)*(1- )*(1-)*(1+ +), -(1/4)*(1+ )*(1-)*(1- +), -(1/4)*(1+ )*(1+)*(1- -), -(1/4)*(1- )*(1+)*(1+ -), (1/2)*(1- ^2)*(1-), (1/2)*(1-^2)*(1+ ), (1/2)*(1- ^2)*(1+), (1/2)*(1-^2)*(1- )}; S=Simplify[Sum[Nf[[i]],{i,8}]]; Print[S];
1
i + c5 N5 , where N i , i = 1, 2, 3, 4 which also appears in Eq. (15.17) as N9 of the 9-node quad. Take Ni = N are the shape functions (16.15) of the four-node bilinear quadrilateral. These functions are not zero at node 5, hence the correction by a multiple of the bubble function. Evaluation at node 5 ( = = 0) shows that i N5 /4, i = 1, 2, 3, 4. For example, c5 = 1/4. The corrected corner shape functions are Ni = N N1 (, ) = 1 (1 )(1 ) 1 (1 2 )(1 2 ). 4 4 (E18.10)
EXERCISE 18.6 The shape function for the internal node 5 is the bubble function N5 = (1 2 )(1 2 ),
These four corner shape functions vary linearly over all sides because the bubble function N5 vanishes over the 4 sides. Hence interelement continuity is maintained. 1 + N 2 + N 3 + N 4 4 1 N5 + N5 = N 1 + N 2 + N 3 + N 4 = 1, Unit sum check: N1 + N2 + N3 + N4 + N5 = N 4 since it is known that the shape functions Ni of the 4-node quad add up to one.
EXERCISE 18.7 The trilinear shape function for node 1 must be of the form
e N1 = c( 1)( 1)( 1).
(E18.11)
(E18.12)
1819
1820
for
e . N2
e = c1 1 (2 1/2) whence c1 = 2 so N1 = 1 21 2 . Likewise As noted in 18.3.2, this is a lucky guess. The correction method that follows is more systematic.
guess
e e e = 41 2 , N3 = 3 , N1 = 1 + c1 N4 , N2 = 2 + c2 N4 . Correction method covered in 18.3.2: N4 1 e e Making N1 = 0 and N2 = 0 at node 4 (coordinates 1 = 2 = 2 and 3 = 0 gives c1 = c2 = 2, so nally e N1 = 1 21 2 , e N1 = 2 21 2 , e N3 = 3 , e N4 = 41 2 .
guess
guess
(E18.13)
e e e e + N2 + N3 + N4 = 1 + 2 + 3 + (2 2 + 4)1 2 = 1 + 0 = 1. Unit sum check: N1 e e . Over side 142 (3 = 0), N1 varies quadratically and there are 3 nodes to take Compatibility check for N1 e care of that variation. Over side 13 (2 = 0) N1 = 1 varies linearly and there are two nodes to take care of e e e that variation. A similar verication for N2 , N3 and N4 shows that interelement compatibility is met. Since e e e e the unit sum condition N1 + N2 + N3 + N4 = 1 is met (see verication above), the element is 1-complete.
EXERCISE 18.9 For nodes 5 and 6 the shape functions can be obtained by the line product method:
e e (, ) = 1 (1 2 )(1 ) and N6 (, ) = 1 (1 2 )(1 + ). For node 1 take the shape function of N5 2 2 the 4-node bilinear quad corrected by a multiple of N5 : e (, ) N1
guess
1 (1 4
)(1 ) + c5 N5 .
(E18.14)
(There is no need to correct by c6 N6 because N6 vanishes over side 1-2). Requiring this to vanish at 5: + c5 = 0, whence c5 = 1 and3 N1 ( = 0, = 1) gives 1 2 2
e N1 (, ) = 1 (1 )(1 ) 1 (1 2 )(1 ) = 1 (1 )(1 ). 4 4 4
(E18.15)
ClearAll[ ,,a1,a2,a3,a4,b1,b2,b3,b4]; a1=a2=b2=b3=-1/2; a3=a4=b1=b4=0; Nbegin={N10,N20,N30,N40,N5,N6}={(1- )*(1-)/4,(1+ )*(1-)/4, (1+ )*(1+)/4,(1- )*(1+)/4,(1- ^2)*(1-)/2,(1+ )*(1-^2)/2}; Ncorr={a1*N5+b1*N6,a2*N5+b2*N6,a3*N5+b3*N6,a4*N5+b4*N6,0,0}; Nf=Nbegin+Ncorr; Print["Nf=",Simplify[Nf]]; Print[Nf/.{ ->-1,->-1}]; Print[Nf/.{ -> 1,->-1}]; Print[Nf/.{ -> 1,-> 1}]; Print[Nf/.{ ->-1,-> 1}]; Print[Nf/.{ -> 0,->-1}]; Print[Nf/.{ -> 1,-> 0}]; S=Simplify[Sum[Nf[[i]],{i,6}]]; Print[S]; Nf = { 1 (1 + ) (1 + ) , {1, 0, 0, 0, 0, 0} {0, 1, 0, 0, 0, 0} {0, 0, 1, 0, 0, 0} {0, 0, 0, 1, 0, 0} {0, 0, 0, 0, 1, 0} {0, 0, 0, 0, 0, 1} 1
1 (1 + ) (1 + ) (1 + ), 4 4 1 1 (1 + ) (1 + ), (1 + ) (1 + ), 1 (1 + ) (1 + ), 1 (1 + ) (1 + ) } 4 2 2 4
1820
1821
Proceeding similarly for the other nodes we get
e N2 = 1 (1 + )(1 )(1 + ), 4 e N3 = 1 (1 + )(1 + ), 4
Solutions to Exercises
e N4 = 1 (1 + )(1 + ), 4
e e N5 = 1 (1 2 )(1 ), N6 = 1 (1 2 )(1 + ). 2 2
(E18.16)
e e e e e e + N2 + N3 + N4 + N5 + N6 = 1, so the shape functions are 1-complete. The verication of The sum N1 compatibility is easy. An implementation of the foregoing operations using Mathematica, including a check of the interpolation condition (A), is displayed in Figure E18.9.
EXERCISE 18.10 Not assigned. EXERCISE 18.11 Both sets satisfy the interpolation property (A), as is easily veried.
Set CL1 satises the local support and compatibility conditions (B,C), although the shape functions are quadratic. For example the variation of N1 along side 1-2 is fully determined by the values at 1 and 2, because 2 2 2 2 has zero tangent at 2. But the set does not meet the unit-sum condition: 1 + 2 + 2 =0 the parabola 1 except at corners; for example at the centroid the sum is 1/3. Consequently this set violates completeness and is therefore useless. The mapping depicted in Figure E18.5 shows that the mapped triangles are violently distorted although the common diagonal 2-4 conforms after mapping.
2 2 2 + 22 3 + 2 + 23 1 + 3 + 21 2 = Set CL2 has the opposite deciency. The shape function sum is 1 2 2 (1 + 2 + 3 ) = 1 = 1. But it grossly violates the local support condition (B). For example N1 over side 2-3, of equation 1 = 0, is 22 3 = 0. This deciency is clearly indicated in as the mapping depicted in Figure E18.5 indicates. This set violates both completeness and compatibility, and is doubly useless.
1821
19
191
192
TABLE OF CONTENTS
Page
19.1. Overview 19.2. The Variational Index 19.3. Consistency Requirements 19.3.1. Completeness . . . . . . . 19.3.2. Compatibility . . . . . . . . 19.3.3. Matching and Non-Matching Meshes 19.4. Stability 19.4.1. Rank Sufciency . . . . . . . 19.4.2. Jacobian Positiveness . . . . . 19. Notes and Bibliography . . . . . . . . . . . . . 19. References . . . . . . . . . . . . 19. Exercises . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
193 193 194 194 194 196 197 198 199 1911 1911 1912
192
Chapters 11 through 18 have discussed, in piecemeal fashion, requirements for shape functions of isoparametric elements. These are motivated by convergence: as the mesh is rened, the FEM solution should approach the analytical solution of the mathematical model.1 This attribute is obviously necessary to instill condence in FEM results from the standpoint of mathematics. This Chapter provides unied information on convergence requirements. These requirements can be grouped into three: Completeness. The elements must have enough approximation power to capture the analytical solution in the limit of a mesh renement process. This intuitive statement is rendered more precise below. Compatibility. The shape functions should provide displacement continuity between elements. Physically these insure that no material gaps appear as the elements deform. As the mesh is rened, such gaps would multiply and may absorb or release spurious energy. Stability. The system of nite element equations must satify certain well posedness conditions that preclude nonphysical zero-energy modes in elements, as well as the absence of excessive element distortion. Completeness and compatibility are two aspects of the so-called consistency condition between the discrete and mathematical models. A nite element model that passes both completeness and continuity requirements is called consistent. This is the FEM analog of the famous Lax-Wendroff theorem,2 which says that consistency and stability imply convergence.
Remark 19.1. A deeper mathematical analysis done in more advanced courses shows that completeness is
necessary for convergence whereas failure of the other requirements does not necessarily precludes it. There are, for example, FEM models in common use that do not satisfy compatibility. Furthermore, numerically unstable models may be used (with caution) in situations where that property is advantageous, as in the modeling of local singularities. Nonetheless, the satisfaction of the three criteria guarantees convergence and may therefore be regarded as a safe choice for the beginner user.
19.2. The Variational Index For the mathematical statement of the completeness and continuity conditions, the variational index alluded to in previous sections plays a fundamental role. The FEM is based on the direct discretization of an energy functional [u ], where u (displacements for the elements considered in this book) is the primary variable, or (equivalently) the function to be varied. Let m be the highest spatial derivative order of u that appears in . This m is called the variational index.
Of course FEM convergence does not guarantee the correctness of the mathematical model in capturing the physics. As discussed in Chapter 1, model verication against experiments is a different and far more difcult problem. Proven originally for classical nite difference discretizations in uid mechanics. More precisely, it states that a numerical scheme for the scalar conservation law, du /dt + d f /d x = 0 converges to a unique (weak) solution, if it is consistent, stable and conservative. There is no equivalent theorem for systems of conservation laws.
193
194
[u ] =
0
1 2
u E Au qu
dx.
(19.1)
The highest derivative of the displacement u (x ) is u = du /d x , which is rst order in the space coordinate x . Consequently m = 1. This is also the case on the plane stress problem studied in Chapter 14, because the strains are expressed in terms of rst order derivatives of the displacements.
Example 19.2. In the plane beam problem discussed in Chapter 12,
L
[v ] =
0
1 2
v E I v qv d x.
(19.2)
The highest derivative of the transverse displacement is the curvature = v = d 2 v/d x 2 , which is of second order in the space coordinate x . Consequently m = 2.
19.3. Consistency Requirements Using the foregoing denition of variational index, we can proceed to state the two key requirements for nite element shape functions. 19.3.1. Completeness The element shape functions must represent exactly all polynomial terms of order m in the Cartesian coordinates. A set of shape functions that satises this condition is called m -complete. Note that this requirement applies at the element level and involves all shape functions of the element.
Example 19.3. Suppose a displacement-based element is for a plane stress problem, in which m = 1. Then 1-completeness requires that the linear displacement eld
u x = 0 + 1 x + 2 y ,
u y = 0 + 1 x + 2 y
(19.3)
be exactly represented for any value of the coefcients. This is done by evaluating (19.3) at the nodes to form a displacement vector ue and then checking that u = Ne ue recovers exactly (19.3). Section 16.6 presents the details of this calculation for an arbitrary isoparametric plane stress element. That analysis shows that completeness is satised if the sum of the shape functions is unity and the element is compatible.
Example 19.4. For the plane beam problem, in which m = 2, the quadratic transverse displacement
v = 0 + 1 x + 2 x 2
(19.4)
must be exactly represented over the element. This is easily veried in for the 2-node beam element developed in Chapter 13, because the assumed transverse displacement is a complete cubic polynomial in x . A complete cubic contains the quadratic (19.4) as special case.
194
195
19.3
CONSISTENCY REQUIREMENTS
(a)
(b)
(c)
2-node bars
Figure 19.1. An element patch is the set of all elements attached to a patch node, labeled i . (a) illustrates a patch of triangles; (b) a mixture of triangles and quadrilaterals; (c) a mixture of triangles, quadrilaterals, and bars.
19.3.2. Compatibility To state this requirement succintly, it is convenient to introduce the concept of element patch, or simply patch. This is the set of all elements attached to a given node, called the patch node. The denition is illustrated in Figure 19.1, which shows three different kind of patches attached to patch node i in a plane stress problem. The patch of Figure 19.1(a) contains only one type of element: 3-node linear triangles. The patch of Figure 19.1(b) mixes two plane stress element types: 3-node linear triangles and 4-node bilinear quadrilaterals. The patch of Figure 19.1(c) combines three element types: 3-node linear triangles, 4-node bilinear quadrilaterals, and 2-node bars. We dene a nite element patch trial function as the union of shape functions activated by setting a degree of freedom at the patch node to unity, while all other freedoms are zero. A patch trial function propagates only over the patch, and is zero beyond it. This property follows from the local-support requirement stated in 18.1: a shape function for node i should vanish on all sides or faces that do not include i . With the help of these denitions we can enunciate the compatibility requirement as follows. Patch trial functions must be C (m 1) continuous between interconnected elements, and C m piecewise differentiable inside each element. If the variational index is m = 1, the patch trial functions must be C 0 continuous between elements, and C 1 inside elements. A set of shape functions that satises the rst requirement is called conforming. A conforming expansion that satises the second requirement is said to be of nite energy. Note that this condition applies at two levels: individual element, and element patch. An element endowed with conforming shape functions is said to be conforming. A conforming element that satises the nite energy requirement is said to be compatible.3
3
The FEM literature is a bit fuzzy as regards these terms. It seems better to leave the qualier conforming to denote interelement compatibility; informally an element that gets along with its neighbors. The qualier compatible is used in the stricter sense of conforming while possessing sufcient internal smoothness.
195
196
(c)
(a)
(b)
3-node bars
Figure 19.2. Examples of 2D non-matching meshes. Interelement boundaries that fail matching conditions are shown offset for visualization convenience. In (a,b,c) some nodes do not match. In (d,e,f) nodes and DOFs match but some sides do not, leading to violations of C 0 continuity.
Figures 19.1(b,c) illustrates the fact that one needs to check the possible connection of matching elements of different types and possibly different dimensionality. 19.3.3. Matching and Non-Matching Meshes As stated, compatibility refers to the complete nite element mesh because mesh trial functions are a combination of patch trial functions, which in turn are the union of element shape functions. This generality poses some logistical difculties because the condition is necessarily mesh dependent. Compatibility can be checked at the element level by restricting attention to matching meshes. A matching mesh is one in which adjacent elements share sides, nodes and degrees of freedom, as in the patches shown in Figure 19.1. For a matching mesh it is sufcient to restrict consideration rst to a pair of adjacent elements, and then to the side shared by these elements. Suppose that the variation of a shape function along that side is controlled by k nodal values. Then a polynomial variation of order up to k 1 in the natural coordinate(s) can be specied uniquely over the side. This is sufcient to verify interelement compatibility for m = 1, implying C 0 continuity, if the shape functions are polynomials. This simplied criterion is the one used in previous Chapters. Specic 2D examples were given in Chapters 15 through 18.
Remark 19.2. If the variational index is m = 2 and the problem is multidimensional, as in the case of
plates and shells, the check is far more involved and trickier because continuity of normal derivatives along a side is involved. This practically important scenario is examined in advanced FEM treatments. The case of non-polynomial shape functions is, on the other hand, of little practical interest.
196
197 A mesh that does not satisfy the matching criteria stated above is called a nonmatching mesh. Several two-dimensional examples are shown in Figure 19.2. As can be seen there is a wide range of possibilities: nonmatching nodes, matching nodes but different element types, etc. Figure 19.3 depicts a threedimensional example, in which case even more variety can be expected. Nonmatching meshes are the rule rather than the exception in contact and impact problems (which, being geometrically nonlinear, are outside the scope of this book). See Figure 19.4 illustrates what happens in a problem of slipping contact.
19.4
STABILITY
Mesh of tetrahedra
Common surface
Mesh of bricks
Figure 19.3. Example of a 3D non-matching mesh. Top portion discretized with tetrahedra, lower portion with bricks. Nodes and boundaryquad edges and DOFs match, but element types are different, leading to violation of C 0 continuity.
Initial shape
Deformed shape
In multiphysics simulations nonmatching meshes are common, since they are often prepared separately for the different physical components, as illustrated in Figure 19.5.
Fluid
Structure
Figure 19.5. Nonmatching meshes are common in multiphysics problems, as in this example of uid-structure interaction (FSI). Two-dimensional model to simulate ow around a thin plate. If the meshes are independenly prepared node locations will not generally match.
197
198
19.4. Stability Stability may be informally characterized as ensuring that the nite element model enjoys the same solution uniqueness properties of the analytical solution of the mathematical model. For example, if the only motions that produce zero internal energy in the mathematical model are rigid body motions, the nite element model must inherit that property. Since FEM can handle arbitrary assemblies of elements, including individual elements, this property is required to hold at the element level. In the present outline we are concerned with stability at the element level. Stability is not a property of shape functions per se but of the implementation of the element as well as its geometrical denition. It involves two subordinate requirements: rank sufciency, and Jacobian positiveness. Of these, rank sufciency is the most important one. 19.4.1. Rank Sufciency The element stiffness matrix must not possess any zero-energy kinematic mode other than rigid body modes. This can be mathematically expressed as follows. Let n F be the number of element degrees of freedom, and n R be the number of independent rigid body modes. Let r denote the rank of Ke . The element is called rank sufcient if r = n F n R and rank decient if r < n F n R . In the latter case, the rank deciency is dened by d = (n F n R ) r (19.5)
If an isoparametric element is numerically integrated, let n G be the number of Gauss points, while n E denotes the order of the stress-strain matrix E. Two additional assumptions are made: (i) The element shape functions satisfy completeness in the sense that the rigid body modes are exactly captured by them.
(ii) Matrix E is of full rank. Then each Gauss point adds n E to the rank of Ke , up to a maximum of n F n R . Hence the rank of Ke will be r = min(n F n R , n E n G ) (19.6) To attain rank sufciency, n E n G must equal or exceed n F n R : n E nG n F n R from which the appropriate Gauss integration rule can be selected. In the plane stress problem, n E = 3 because E is a 3 3 matrix of elastic moduli; see equation (14.5)2 . Also n R = 3. Consequently r = min(n F 3, 3n G ) and 3n G n F 3.
Remark 19.3. The fact that each Gauss point adds n E n G to the rank can be proven considering the following property. Let B be a n E n F rectangular real matrix with rank r B n E , and E an n E n E positive-denite (p.d.) symmetric matrix. Then the rank of BT E B is r B . Proof: let u = 0 be a non-null n F -vector. If BT E B u = 0 then 0 = uT BT E B u = ||E1/2 B u||. Therefore B u = 0. Identify now B and E with the strain-displacement and stress-strain (constitutive) matrix, respectively. In the plane stress case n E = 3, n F = 2n > 3 is the number of element freedoms. Thus B has rank 3 and a fortiori BT E B must also have rank 3 since E is p.d. At each Gauss point i a contribution of wi BT E B, which has rank 3 if wi > 0, is added to Ke . By a theorem of linear algebra, the rank of Ke increases by 3 until it reaches n F n R .
(19.7)
198
199
19.4
STABILITY
Table 19.1 Rank-sufcient Gauss Rules for Some Plane Stress Elements Element 3-node triangle 6-node triangle 10-node triangle 4-node quadrilateral 8-node quadrilateral 9-node quadrilateral 16-node quadrilateral
n 3 6 10 4 8 9 16
nF 6 12 20 8 16 18 32
nF 3 3 9 17 5 13 15 29
Min n G 1 3 6 2 5 5 10
Recommended rule centroid 3-point rules 6-point rule 2x2 3x3 3x3 4x4
Figure 19.6. Effect of displacing node 4 of the four-node bilinear quadrilateral shown on the leftmost picture, to the right.
rank of 12 n R = 12 3 = 9, n G 3. A 3-point Gauss rule, such as the midpoint rule dened in 24.2, makes the element rank sufcient.
Example 19.5. Consider a plane stress 6-node quadratic triangle. Then n F = 2 6 = 12. To attain the proper
the proper rank of 18 n R = 18 3 = 15, n G 5. The 2 2 product Gauss rule is insufcient because n G = 4. Hence a 3 3 rule, which yields n G = 9, is required to attain rank sufciency.
Example 19.6. Consider a plane stress 9-node biquadratic quadrilateral. Then n F = 2 9 = 18. To attain
Table 19.1 collects rank-sufcient Gauss integration rules for some widely used plane stress elements with n nodes and n F = 2n freedoms. 19.4.2. Jacobian Positiveness The geometry of the element should be such that the determinant J = det J of the Jacobian matrix dened4 in 17.2, is positive everywhere. As illustrated in Equation (17.20), J characterizes the local metric of the element natural coordinates.
4
This denition applies to quadrilateral elements. The Jacobian determinant of an arbitrary triangular element is dened in 24.2.
199
1910
3 7 4 9 8 1 5 2 3 7 4 9 8 1 5 2 8 1 5 2 6 4 9 7 6 8 1 5 2 6 4 9 7 6
3 7 4 9 8 1 3 7 4 9 8 1 5=2 6 5 2 6
Figure 19.7. Effect of moving midpoint 5 of a 9-node biquadratic quadrilateral tangentially toward corner 2.
For a three-node triangle J is constant and in fact equal to 2 A. The requirement J > 0 is equivalent to saying that corner nodes must be positioned and numbered so that a positive area A > 0 results. This is called a convexity condition. It is easily checked by a nite element program. But for 2D elements with more than 3 nodes distortions may render portions of the element metric negative. This is illustrated in Figure 19.6 for a 4-node quadrilateral in which node 4 is gradually moved to the right. The quadrilateral gradually morphs from a convex gure into a nonconvex one. The center gure is a triangle; note that the metric near node 4 is badly distorted (in fact J = 0 there) rendering the element unacceptable. This clearly contradicts the erroneous advice of some FE books, which state that quadrilaterals can be reduced to triangles as special cases, thereby rendering triangular elements unnecessary. For higher order elements proper location of corner nodes is not enough. The non-corner nodes (midside, interior, etc.) must be placed sufciently close to their natural locations (midpoints, centroids, etc.) to avoid violent local distortions. The effect of midpoint motions in quadratic elements is illustrated in Figures 19.7 and 19.8. Figure 19.7 depicts the effect of moving midside node 5 tangentially in a 9-node quadrilateral element while keeping all other 8 nodes xed. When the location of 5 reaches the quarter-point of side 1-2, the metric at corner 2 becomes singular in the sense that J = 0 there. Although this is disastrous in ordinary FE work, it has applications in the construction of special crack elements for linear fracture mechanics. 1910
1911
19.
References
3 6
3 5
6 4
6 4
1 2 1 3 6 5 3 4 2
2 4 5
1 3 6
2 1
1 4
4
Figure 19.8. Effect of displacing midpoints 4, 5 and 6 of an equilateral 6-node triangle along the midpoint normals. Motion is inwards in rst two top frames, outwards in the last four. In the lower leftmost picture nodes 1 through 6 lie on a circle.
Displacing midside nodes normally to the sides is comparatively more forgiving, as illustrated in Figure 19.8. This depicts a 6-node equilateral triangle in which midside nodes 4, 5 and 6 are moved inwards and outwards along the normals to the midpoint location. As shown in the lower left picture, the element may be even morphed into a parabolic circle (meaning that nodes 1 through 6 lie on a circle) without the metric breaking down.
Notes and Bibliography The literature on the mathematics of nite element methods has grown exponentially since the monograph of Strang and Fix [227]. This is very readable but out of print. A more up-to-date exposition is the textbook by Szabo and Babuska [236]. The subjects collected in this Chapter tend to be dispersed in recent monographs and obscured by overuse of functional analysis. References Referenced items have been moved to Appendix R.
1911
1912
EXERCISE 19.2 [A:20] The isoparametric denition of the straight 3-node bar element in its local system x is 1 x v = 1 x 1 u 1 1 x 2 u 2 1 x 3 u 3
e N1 ( ) e ( ) N2 e ( ) N3
(E19.1)
Here is the isoparametric coordinate that takes the values 1, 1 and 0 at nodes 1, 2 and 3, respectively, while e e e , N2 and N3 are the shape functions found in Exercise 16.3 and listed in (E16.2). N1 2 = L , x 3 = 1 L + L . Here L is the bar length and a parameter that For simplicity, take x 1 = 0, x 2 characterizes how far node 3 is away from the midpoint location x = 1 L . Show that the minimum s 2 (minimal in absolute value sense) for which J = d x /d vanishes at a point in the element are 1/4 (the quarter-points). Interpret this result as a singularity by showing that the axial strain becomes innite at a an end point. (This result has application in fracture mechanics modeling.)
EXERCISE 19.3 [A:15] Consider one dimensional bar-like elements with n nodes and 1 degree of freedom per node so n F = n . The correct number of rigid body modes is 1. Each Gauss integration point adds 1 to the rank; that is N E = 1. By applying (19.7), nd the minimal rank-preserving Gauss integration rules with p points in the longitudinal direction if the number of node points is n = 2, 3 or 4. EXERCISE 19.4 [A:20] Consider three dimensional solid brick elements with n nodes and 3 degrees of freedom per node so n F = 3n . The correct number of rigid body modes is 6. Each Gauss integration point adds 6 to the rank; that is, N E = 6. By applying (19.7), nd the minimal rank-preserving Gauss integration rules with p points in each direction (that is, 111, 222, etc) if the number of node points is n = 8, 20, 27, or 64. Partial answer: for n = 27 the minimal rank preserving rule is 3 3 3. EXERCISE 19.5 [A/C:35] (Requires use of a CAS help to be tractable). Repeat Exercise 19.2 for a 9-node
plane stress element. The element is initially a perfect square, nodes 5,6,7,8 are at the midpoint of the sides 12, 23, 34 and 41, respectively, and 9 at the center of the square. Displace 5 tangentially towards 2 until the Jacobian determinant at 2 vanishes. This result is important in the construction of singular elements for fracture mechanics.
EXERCISE 19.6 [A/C:35] Repeat Exercise 19.5 but moving node 5 along the normal to the side. Discuss the range of motion for which det J > 0 within the element. EXERCISE 19.7 [A:20] Discuss whether the deVeubeke triangle presented in Chapter 15 satises completeness and interelement-compatbility requirements.
1912
Introduction to FEM
19
IFEM Ch 19 Slide 1
Introduction to FEM
IFEM Ch 19 Slide 2
Introduction to FEM
IFEM Ch 19 Slide 3
Introduction to FEM
[u ] =
0
1 2
u E Au qu
dx
m=1
Beam
L
[v ] =
0
1 2
v E I v qv d x
m=2
IFEM Ch 19 Slide 4
Introduction to FEM
Element Patches
A patch is the set of all elements attached to a given node:
bars
A finite element patch trial function is the union of shape functions activated by setting a degree of freedom at that node to unity, while all other freedoms are zero. A patch trial function "propagates" only over the patch, and is zero beyond it.
IFEM Ch 19 Slide 5
Introduction to FEM
Compatibility
The patch trial functions must be C (m-1) continuous between m elements, and C piecewise differentiable inside each element
IFEM Ch 19 Slide 6
Introduction to FEM
Compatibility
The patch trial functions must be C 0 continuous between elements, and C 1 piecewise differentiable inside each element
IFEM Ch 19 Slide 7
Introduction to FEM
j i i
j j i
bar
IFEM Ch 19 Slide 8
Introduction to FEM
Side Continuity Check for Plane Stress Elements with Polynomial Shape Functions in Natural Coordinates
Let k be the number of nodes on a side:
side being checked
k=2
k=3
k=4
The variation of each element shape function along the side must be of polynomial order k 1 If more, continuity is violated If less, nodal configuration is wrong (too many nodes)
IFEM Ch 19 Slide 9
Introduction to FEM
IFEM Ch 19 Slide 10
Introduction to FEM
Mesh of tetrahedra
Common surface
Mesh of bricks
IFEM Ch 19 Slide 11
Introduction to FEM
;;;;;;;; ;;;;;;;;;
IFEM Ch 19 Slide 12
Introduction to FEM
Fluid
Structure
IFEM Ch 19 Slide 13
Introduction to FEM
Stability
Rank Sufficiency
The discrete model must possess the same solution uniqueness attributes of the mathematical model For displacement finite elements: the rigid body modes (RBMs) must be preserved no zero-energy modes other than RBMs Can be tested by looking at the rank of the stiffness matrix
IFEM Ch 19 Slide 14
Introduction to FEM
Rank Sufficiency
The element stiffness matrix must not possess any zero-energy kinematic modes other than rigid body modes This can be checked by verifing that the element stiffness matrix has the correct rank: correct rank = # of element DOF # of RBMs
A stiffness matrix that has correct rank (a.k.a. proper rank) is called rank sufficient and by extension, the element
IFEM Ch 19 Slide 15
IFEM Ch 19 Slide 16
Introduction to FEM
IFEM Ch 19 Slide 17
Introduction to FEM
nF = 2 n
nR = 3
nE = 3
IFEM Ch 19 Slide 18
Introduction to FEM
IFEM Ch 19 Slide 19
Introduction to FEM
"Triangle"
IFEM Ch 19 Slide 20
Introduction to FEM
4 9 8 2
4 9 8 2
4 9 8 2
1 3
1 3
3 7
4 9 8
4 9 8
4 9 8
5 2
5=2
IFEM Ch 19 Slide 21
Introduction to FEM
6 6 4 4 1 3 6 6 5 2 1 3 5 3 2 1 6 4 2 1 4 5 6 5 6 5
1 4
IFEM Ch 19 Slide 22
1913
Solutions to Exercises
EXERCISE 19.1
Element sides do not match in congurations (d,e,f). Furthermore in (d,e) the element shape functions do not match at interelement boundaries: linear on one side and quadratic on the other in (d); quadratic on one side and cubic on the other in (e). In conguration (f) element shape functions match since the three elements are 9-node biquadratics, but corners are paired with midnodes and midnodes with corners. Three examples of nonmatching meshes are shown in Figure E19.1.
(a) (b) (c)
Figure E19.1. Nonmatching meshes. Elements are drawn slightly offset from each other to facilitate visualization of nodal congurations.
EXERCISE 19.2 Inserting the given values into x = x 1 N1 + x 2 N2 + x 3 N3 (overbars omitted for clarity) and (1 4 ) L . The condition J = 0 gives = 1/(4 ). differentiating with respect to yields J = d x /d = 1 2 Now is within the element if 1 1, and is minimized in absolute value for = 1, which correspond to the element end points. Hence if is within the interval [1/4, 1/4], J 0 over the element. This is called the quarter point rule in the FEM literature. If J = 0 at a point in the element, the axial strain becomes innite there because x x = du /d x = (du /d )(d /d x ) = J 1 (du /d ).
Interpretation: if midpoint 3 is moved to a quarter point, a coordinate mapping singularity develops at the closest end node. Physically, the strain becomes innite and the bar material cracks there. This feature is taken advantage of in the development of special FEM models for linear fracture mechanics.
EXERCISE 19.3 Rank deciency d = (n F n R ) n E n G = n 1 + p 0. Hence p n 1. EXERCISE 19.4 Rank deciency d = (n F n R ) n E n G = 3n 6 6 p 3 0. Hence p 3 (3n 6)/6.
For n = 8 (8-node trilinear brick), p 3 18/6 = 3; p 2 and a 2 2 2 product rule is required. For n = 20 (20-node brick) , p 3 54/6 = 9, so p 3 and a 3 3 3 product rule is required. For n = 27 (27-node triquadratic brick), p 3 75/6 = 25/2, so p 3 and a 3 3 3 product rule is required. For n = 64 (64-node tricubic brick), p 3 186/6 = 31, so p 4 and a 4 4 4 product rule is required. Answering in terms of number of Gauss points (n G ) instead of p is also acceptable, although the wording takes a bit longer. For example: For n = 8 (8-node trilinear brick), n G (n F n R )/ n E = 18/6 = 3. A 1 1 1 rule has n G = 1 and does not satisfy the inequality n G 3. A 2 2 2 rule has n G = 8 and satises it.
1913
1914
EXERCISE 19.5 Not assigned. EXERCISE 19.6 Not assigned. EXERCISE 19.7 Nor assigned.
1914
20
201
202
TABLE OF CONTENTS
Page
20.1. The Plane Bar Element 20.1.1. Stiffness Matrix . . . . . . . . 20.1.2. Stiffness Module . . . . . . . . . 20.1.3. Testing the Plane Bar Module . . . . 20.2. The Space Bar Element 20.2.1. Stiffness Matrix . . . . . . . . . 20.2.2. Stiffness Module . . . . . . . . 20.2.3. Testing the Space Bar Module . . . . 20.3. The Plane Beam-Column Element 20.3.1. Stiffness Matrix . . . . . . . . 20.3.2. Stiffness Module . . . . . . . . . 20.3.3. Testing the Plane Beam-Column Module 20.4. *Plane Beam With Offset Nodes 20.4.1. Plate Reinforced With Edge Beams . . 20.4.2. Rigid Link Transformation . . . . . 20.4.3. Direct Fabrication of Offset Beam Stiffness 20.5. Layered Beam Congurations 20.5.1. Layered Beam With No Interlayer Slip . 20.5.2. Beam Stacks Allowing Interlayer Slip . . 20.6. The Space Beam Element 20.6.1. Stiffness Matrix . . . . . . . . 20.6.2. Stiffness Module . . . . . . . . . 20. Notes and Bibliography . . . . . . . . . . . . . . 20. Exercises . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
203 203 203 204 205 206 206 207 208 208 209 209 2011 2011 2012 2013 2014 2015 2017 2018 2018 2020 2020 2021
202
203
20.1
This Chapter begins Part III of the course. This Part deals with the computer implementation of the Finite Element Method for static analysis. It is organized in bottom up fashion. It begins with simple topics, such as programming of bar and beam elements, and gradually builds up toward more complex models and calculations. Specic examples of this Chapter illustrate the programming of one-dimensional elements: bars and beams, using Mathematica as implementation language. 20.1. The Plane Bar Element The two-node, prismatic, two-dimensional bar element was studied in Chapters 2-3 for modeling plane trusses. It is reproduced in Figure 20.1 for conveniency. It has y two nodes and four degrees of freedom. The element y node displacements and conjugate forces are ux1 u ue = y 1 , ux2 u y2 fx1 f fe = y 1 . fx2 f y2
x
=L
2 (x 2 , y2 ) E, A constant
1 (x 1 , y1 )
(20.1)
x
Figure 20.1. Plane bar element.
The element geometry is described by the coordinates {xi , yi }, i = 1, 2 of the two end nodes. For stiffness computations, the only material and fabrication properties required are the modulus of elasticity E = E e and the cross section area A = Ae , respectively. Both are taken to be constant over the element. 20.1.1. Stiffness Matrix The element stiffness matrix in global {x , y } coordinates is given by the explicit expression derived in 3.1: 2 c sc c2 sc x21 x21 x21 y21 x21 x21 x21 y21 E A sc s 2 sc s 2 E A x21 y21 y21 y21 x21 y21 y21 y21 Ke = 2 = 3 . (20.2) 2 c sc c sc x21 x21 x21 y21 x21 x21 x21 y21 x21 y21 y21 y21 x21 y21 y21 y21 sc s 2 sc s 2
2 2 + y21 , Here c = cos = x21 / , s = sin = y21 / , in which x21 = x2 x1 , y21 = y2 y1 , = x21 and is the angle formed by x and x , measured from x positive counterclockwise (see Figure 20.1). The second expression in (20.2) is preferable in a computer algebra system because it enhances simplication possibilities when doing symbolic work, and is the one actually implemented in the module described below.
20.1.2. Stiffness Module The computation of the stiffness matrix Ke of the two-node, prismatic plane bar element is done by Mathematica module PlaneBar2Stiffness. This is listed in Figure 20.2. The module is invoked as Ke = PlaneBar2Stiffness[ncoor, Em, A, options] (20.3) 203
204
PlaneBar2Stiffness[ncoor_,Em_,A_,options_]:= Module[ {x1,x2,y1,y2,x21,y21,EA,numer,L,LL,LLL,Ke}, {{x1,y1},{x2,y2}}=ncoor; {x21,y21}={x2-x1,y2-y1}; EA=Em*A; {numer}=options; LL=x21^2+y21^2; L=Sqrt[LL]; If [numer,{x21,y21,EA,LL,L}=N[{x21,y21,EA,LL,L}]]; If [!numer, L=PowerExpand[L]]; LLL=Simplify[LL*L]; Ke=(Em*A/LLL)*{{ x21*x21, x21*y21,-x21*x21,-x21*y21}, { y21*x21, y21*y21,-y21*x21,-y21*y21}, {-x21*x21,-x21*y21, x21*x21, x21*y21}, {-y21*x21,-y21*y21, y21*x21, y21*y21}}; Return[Ke]];
Figure 20.2. Mathematica stiffness module for a two-node, prismatic plane bar element.
The arguments are ncoor Em A options Node coordinates of element arranged as { { x1,y1 },{ x2,y2 } }. Elastic modulus. Cross section area. A list of processing options. For this element is has only one entry: { numer }. This is a logical ag with the value True or False. If True the computations are carried out in oating-point arithmetic. If False symbolic processing is assumed.
20.1.3. Testing the Plane Bar Module The modules are tested by the scripts listed in Figures 20.3 and 20.4. The script shown on the top of Figure 20.3 tests a numerically dened element with end nodes located at (0, 0) and (30, 40), with E = 1000, A = 5, and numer set to True. Executing the script produces the results listed in the bottom of that gure. 204
205
20.2
ClearAll[A,Em,L]; ncoor={{0,0},{L,0}}; Ke= PlaneBar2Stiffness[ncoor,Em,A,{False}]; kfac=Em*A/L; Ke=Simplify[Ke/kfac]; Print["Symbolic Elem Stiff Matrix: "]; Print[kfac," ",Ke//MatrixForm]; Print["Eigenvalues of Ke=",kfac,"*",Eigenvalues[Ke]]; Symbolic Elem Stiff Matrix: 1 0 1 0 0 0 0 0 A Em L 1 0 1 0 0 0 0 0 Eigenvalues of Ke = A Em {0, 0, 0, 2} L
Figure 20.4. Test of plane bar stiffness module with symbolic inputs.
On return from PlaneBar2Stiffness, the stiffness matrix returned in Ke is printed. Its four eigenvalues are computed and printed. As expected three eigenvalues, which correspond to the three independent rigid body motions of the element, are zero. The remaining eigenvalue is positive and equal to E A / . The symmetry of Ke is checked by printing (Ke )T Ke upon simplication and chopping. The script of Figure 20.4 tests a symbolically dened bar element with end nodes located at (0, 0) and ( L , 0), which is aligned with the x axis. Properties E and A are kept symbolic. Executing the script shown in the top of Figure 20.4 produces the results shown in the bottom of that gure. One thing to be noticed is the use of the stiffness scaling factor E A / , called kfac in the script. This is a symbolic quantity that can be extracted as factor of matrix Ke . The effect is to clean up matrix and vector output, as can be observed in the printed results. 20.2. The Space Bar Element To show how the previous implementation extends easily to three dimensions, this section describes the implementation of the space bar element. The two-node, prismatic, space bar element is pictured in Figure 20.5. The element has two nodes and six degrees of freedom. The element node displacements and conjugate forces are arranged as ux1 fx1 u y1 f y1 u f z1 z1 e e u = , f = . ux2 fx2 u y2 f y2 u z2 f z2 (20.4)
y z 1 (x1 ,y1 ,z 1 ) E, A constant
y = Le x z Global system
Figure 20.5. The space (3D) bar element.
2 (x 2 ,y 2 ,z 2 ) x
205
206
SpaceBar2Stiffness[ncoor_,Em_,A_,options_]:=Module[ {x1,x2,y1,y2,z1,z2,x21,y21,z21,EA,numer,L,LL,LLL,Ke}, {{x1,y1,z1},{x2,y2,z2}}=ncoor;{x21,y21,z21}={x2-x1,y2-y1,z2-z1}; EA=Em*A; {numer}=options; LL=x21^2+y21^2+z21^2; L=Sqrt[LL]; If [numer,{x21,y21,z21,EA,LL,L}=N[{x21,y21,z21,EA,LL,L}]]; If [!numer, L=PowerExpand[L]]; LLL=Simplify[LL*L]; Ke=(Em*A/LLL)* {{ x21*x21, x21*y21, x21*z21,-x21*x21,-x21*y21,-x21*z21}, { y21*x21, y21*y21, y21*z21,-y21*x21,-y21*y21,-y21*z21}, { z21*x21, z21*y21, z21*z21,-z21*x21,-z21*y21,-z21*z21}, {-x21*x21,-x21*y21,-x21*z21, x21*x21, x21*y21, x21*z21}, {-y21*x21,-y21*y21,-y21*z21, y21*x21, y21*y21, y21*z21}, {-z21*x21,-z21*y21,-z21*z21, z21*x21, z21*y21, z21*z21}}; Return[Ke]; ];
Figure 20.6. Module to form the stiffness of the space (3D) bar element.
The element geometry is described by the coordinates {xi , yi , z i }, i = 1, 2 of the two end nodes. As in the case of the plane bar, the two properties required for the stiffness computations are the modulus of elasticity E and the cross section area A. Both are assumed to be constant over the element. 20.2.1. Stiffness Matrix For the space bar element, introduce the notation x21 = x2 x1 , y21 = y2 y1 , z 21 = z 2 z 1 and
2 2 2 = x21 + y21 + z 21 . It can be shown1 that the element stiffness matrix in global coordinates is given by
x21 y21 y21 y21 y21 z 21 x21 y21 y21 y21 y21 z 21
x21 x21 x21 y21 x21 z 21 x21 x21 x21 y21 x21 z 21
x21 y21 y21 y21 y21 z 21 x21 y21 y21 y21 y21 z 21
(20.5)
This matrix expression in terms of coordinate differences is useful in symbolic work, because it enhances simplication possibilities. 20.2.2. Stiffness Module The computation of the stiffness matrix Ke of the two-node, prismatic space bar element, is done by Mathematica module SpaceBar2Stiffness. This is listed in Figure 20.6. The module is invoked as Ke = SpaceBar2Stiffness[ncoor, Em, A, options] (20.6) The arguments are
1
206
207
20.2
ClearAll[A,Em]; ncoor={{0,0,0},{2,3,6}}; Em=343; A=10; Ke= SpaceBar2Stiffness[ncoor,Em,A,{True}]; Print["Numerical Elem Stiff Matrix: "]; Print[Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[Ke]]]; Numerical Elem Stiff Matrix: 40. 60. 120. 40. 60. 60. 90. 180. 60. 90. 120. 180. 360. 120. 180. 40. 60. 120. 40. 60. 60. 90. 180. 60. 90. 120. 180. 360. 120. 180. Eigenvalues of Ke = {980., 0, 0, 0, 0, 0} 120. 180. 360. 120. 180. 360.
Figure 20.7. Testing the space bar stiffness module with numerical inputs.
ncoor Em A options
Node coordinates of element arranged as { { x1,y1,z1 },{ x2,y2,z2 } }. Elastic modulus. Cross section area. A list of processing options. For this element is has only one entry: { numer }. This is a logical ag with the value True or False. If True the computations are carried out in oating-point arithmetic. If False symbolic processing is assumed.
20.2.3. Testing the Space Bar Module The modules are tested by the scripts listed in Figures 20.7 and 20.8. As these are similar to previous tests done on the plane bar they need not be described in detail. 207
208
x
y
y1 u 1 u x1
(a) z1
u x2 y2 u 2
z2
y x zz
(b)
2 (x 2 , y2 )
y
1 (x 1 , y1 )
=L
E, A, I constant
Figure 20.9. Plane beam-column element: (a) in its local system; (b) in the global system.
The script of Figure 20.7 tests a numerically dened space bar with end nodes located at (0, 0, 0) and (30, 40, 0), with E = 1000, A = 5 and numer set to True. Executing the script produces the results listed in the bottom of that Figure. The script of Figure 20.8 tests a symbolically dened bar element with end nodes located at (0, 0, 0) and ( L , 2 L , 2 L )/3, which has length L and is not aligned with the x axis. The element properties E and A are kept symbolic. Executing the script produces the results shown in the bottom of that Figure. Note the use of a stiffness factor kfac of E A /(9 ) to get cleaner printouts. 20.3. The Plane Beam-Column Element Beam-column elements model structural members that resist both axial and bending actions. This is the case in skeletal structures such as frameworks which are common in steel and reinforcedconcrete building construction. A plane beam-column element is a combination of a plane bar (such as that considered in 20.1), and a plane beam. We consider a beam-column element in its local system (x , y ) as shown in Figure 20.9(a), and then in the global system (x , y ) as shown in Figure 20.9(b). The six degrees of freedom and conjugate node forces of the elements are: u x1 fx1 ux1 fx1 u fy 1 u y1 f y1 y1 e m m = e = z1 , f u ue = z 1 , fe = z 1 . (20.7) z1 , x2 x2 u u ux2 fx2 u y2 u y2 u y2 f y2 z 2 m z2 z 2 m z2 The rotation angles and the nodal moments m are the same in the local and the global systems because they are about the z axis, which does not change in passing from local to global. The element geometry is described by the coordinates {xi , yi }, i = 1, 2 of the two end nodes. The element length is = L e . Properties involved in the stiffness calculations are: the modulus of elasticity E , the cross section area A and the moment of inertia I = Izz about the neutral axis. All properties are taken to be constant over the element.
208
20.3
To obtain the plane beam-column stiffness in the local system we simply add the stiffness matrices derived in Chapters 11 and 12, respectively, to get 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 12 6 0 12 6 EI 2 E A e 0 0 0 0 0 6 2 2 4 = K (20.8) + 3 0 0 0 1 0 0 12 6 0 0 symm 4 2 symm 0 The two matrices on the right of (20.8) come from the bar stiffness (12.22) and the BernoulliEuler bending stiffness (13.20), respectively. Before adding them, rows and columns have been rearranged in accordance with the nodal freedoms (20.7). The displacement transformation matrix between local and global systems is u x1 c s 0 0 0 0 ux1 s c 0 0 0 0 u y 1 u y1 0 0 1 0 0 0 z 1 e = z1 = u = T ue , ux2 0 0 0 c s 0 ux2 u y2 u y2 0 0 0 s c 0 z 2 z 2 0 0 0 0 0 1
(20.9)
where c = cos = (x2 x1 )/ , s = sin = ( y2 y1 )/ , and is the angle between x and x , measured positive-counterclockwise from x ; see Figure 20.9. The stiffness matrix in the global system is obtained through the congruent transformation e T. Ke = T T K (20.10) Explicit expressions of the entries of Ke are messy. Unlike the bar, it is better to let the program do the transformation. 20.3.2. Stiffness Module The computation of the stiffness matrix Ke of the two-node, prismatic plane beam-column element is done by Mathematica module PlaneBeamColumn2Stiffness. This is listed in Figure 20.10. The module is invoked as Ke = PlaneBeamColumn2Stiffness[ncoor, Em, { A,Izz }, options] (20.11)
The arguments are ncoor Node coordinates of element arranged as { { x1,y1 },{ x2,y2 } }. Em Elastic modulus. A Cross section area. Izz Moment of inertia of cross section area respect to axis z . options A list of processing options. For this element is has only one entry: { numer }. This is a logical ag with the value True or False. If True the computations are carried out in oating-point arithmetic. If False symbolic processing is assumed. The module returns the 6 6 element stiffness matrix as function value. 209
2010
PlaneBeamColumn2Stiffness[ncoor_,Em_,{A_,Izz_},options_]:= Module[ {x1,x2,y1,y2,x21,y21,EA,EI,numer,L,LL,LLL,Te,Kebar,Ke}, {{x1,y1},{x2,y2}}=ncoor; {x21,y21}={x2-x1,y2-y1}; EA=Em*A; EI=Em*Izz; {numer}=options; LL=Simplify[x21^2+y21^2]; L=Sqrt[LL]; If [numer,{x21,y21,EA,EI,LL,L}=N[{x21,y21,EA,EI,LL,L}]]; If [!numer, L=PowerExpand[L]]; LLL=Simplify[LL*L]; Kebar= (EA/L)*{ { 1,0,0,-1,0,0},{0,0,0,0,0,0},{0,0,0,0,0,0}, {-1,0,0, 1,0,0},{0,0,0,0,0,0},{0,0,0,0,0,0}} + (2*EI/LLL)*{ { 0,0,0,0,0,0},{0, 6, 3*L,0,-6, 3*L},{0,3*L,2*LL,0,-3*L, LL}, { 0,0,0,0,0,0},{0,-6,-3*L,0, 6,-3*L},{0,3*L, LL,0,-3*L,2*LL}}; Te={{x21,y21,0,0,0,0}/L,{-y21,x21,0,0,0,0}/L,{0,0,1,0,0,0}, {0,0,0,x21,y21,0}/L,{0,0,0,-y21,x21,0}/L,{0,0,0,0,0,1}}; Ke=Transpose[Te].Kebar.Te; Return[Ke] ];
Figure 20.10. Mathematica module to form the stiffness matrix of a two-node, prismatic plane beam-column element.
ClearAll[L,Em,A,Izz]; ncoor={{0,0},{3,4}}; Em=100; A=125; Izz=250; Ke= PlaneBeamColumn2Stiffness[ncoor,Em,{A,Izz},{True}]; Print["Numerical Elem Stiff Matrix: "]; Print[Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[Ke]]]; Numerical Elem Stiff Matrix: 2436. 48. 4800. 48. 2464. 3600. 4800. 3600. 20000. 2436. 48. 4800. 48. 2464. 3600. 4800. 3600. 10000. 2436. 48. 4800. 2436. 48. 4800. 48. 2464. 3600. 48. 2464. 3600. 4800. 3600. 10000. 4800. 3600. 20000.
20.3.3. Testing the Plane Beam-Column Module The beam-column stiffness are tested by the scripts shown in Figures 20.11 and 20.12. The script at the top of Figure 20.11 tests a numerically dened element of length = 5 with end nodes located at (0, 0) and (3, 4), respectively, with E = 100, A = 125 and Izz = 250. The output is shown at the bottom of that gure. The stiffness matrix returned in Ke is printed. Its six eigenvalues are computed and printed. As expected three eigenvalues, which correspond to the three independent rigid body motions of the element, are zero. The remaining three eigenvalues are positive. The script at the top of Figure 20.12 tests a plane beam-column of length L with end nodes at (0, 0) and (3 L /5, 4 L /5). The properties E , A and Izz are kept in symbolic form. The output is shown at the bottom of that gure. The printed matrix looks complicated because bar and beam coupling 2010
2011
occurs when the element is not aligned with the global axes. The eigenvalues are obtained in closed symbolic form, and their simplicity provides a good check that the transformation matrix (20.9) is orthogonal. Three eigenvalues are exactly zero; one is associated with the axial (bar) stiffness and two with the exural (beam) stiffness.
ClearAll[L,Em,A,Izz]; ncoor={{0,0},{3*L/5,4*L/5}}; Ke= PlaneBeamColumn2Stiffness[ncoor,Em,{A,Izz},{False}]; Print["Symbolic Elem Stiff Matrix:"]; kfac=Em; Ke=Simplify[Ke/kfac]; Print[kfac," ",Ke//MatrixForm]; Print["Eigenvalues of Ke=",kfac,"*",Eigenvalues[Ke]]; Symbolic Elem Stiff Matrix:
3 ( 64 Izz + 3 A L2 ) 25 L3 12 ( 12 Izz +A L2 ) 25 L3 Izz 24 5 L2 12 ( 12 Izz + A L2 ) 25 L3 4 ( 27 Izz + 4 A L2 ) 25 L3 18 Izz 5 L2
12
24 Izz 5 L2
4 ( 27
Em
12
18 Izz 5 L2 2 Izz L
12 ( 12 Izz + A L2 ) 25 L3 24 Izz 5 L2
18 Izz 5 L2 4 Izz L
20.4.
20.4.1. Plate Reinforced With Edge Beams Consider a plate reinforced with edge beams, as shown in Figure 20.13(a). The conventional placement of the nodes is at the plate midsurface and beam longitudinal (centroidal) axis. But those element centered locations do not coincide. To assemble the structure it is necessary to refer both the plate and beam stiffness equations to common locations, because such equations are only written at nodes. We assume that those connection nodes, or simply connectors, will be placed at the plate midsurface, as sketched in Figure 20.13(b). With that choice there is no need to change the plate equations. The beam connectors have been moved, however, from their original centroidal positions. For the beam these connectors are also known as offset nodes. Structural congurations such as that of Figure 20.13(a) are common in aerospace, civil and mechanical engineering when shells or plates are reinforced with eccentric stiffeners. The process of moving the beam stiffness equation to the offset nodes is called offsetting. It relies on setting up multifreedom constraints (MFC) between centered and offset node freedoms, and applying the master-slave congruential transformation introduced in Chapter 8. For simplicity we discuss only this process assuming that the beam of Figure 20.13(b) is a plane beam whose freedoms are to be moved upwards by a distance d , which is positive if going upward from beam centroid. Freedoms at connection and centroidal nodes are declared to be master and slaves, respectively. They are labeled as shown in Figure 20.13(c,d). The original stiffness equations referred to centroidal (slave) freedoms are
2011
2012
(a)
plate
(b)
plate d edge beam
edge beams
d slave-to-master rigid-link offset distance for beam beam centroidal node slave node connection node master node master nodes rigid links centroidal (slave) nodes
yc , ym 1m
d
_ _
(c)
2m
d _
1c
2c
xm _ xc
z1m
1m d
z1c
y1m u u y1c u
(d)
x1m
z2m
y2m u u x2m
m y2c u
E, A, Izzc constant
Le
1c
u x1c
z2c
2c
u x2c
Figure 20.13. Plane beam with nodes offset for a rigid-link connection to plate.
A E Le
0 0 A 0 0 12 Izzc 6 Izzc 0 12 Izzc 6 Izzc ( L e )2 ( L e )2 ( L e )2 ( L e )2 4 Izzc 0 6 Izzc 2 Izzc Le Le ( L e )2 A 0 0 12 Izzc 6 Izzc ( L e )2 ( L e )2 4 Izzc symm Le
f x 1s x 1s u u fy 1s y 1s m z 1s z1s , = x 2s f x 2s u u y 2s fy 2s
z 2s m z 2s
or
e e Ke c uc = fc ,
(20.12)
in which A is the beam cross section area while Izzc denotes the section moment of inertia with respect to the centroidal axis z c . 20.4.2. Rigid Link Transformation Kinematic constraints between master and centroidal (slave) freedoms are obtained assuming that they are connected by rigid links as pictured in Figure 20.13(c,d). This gives the centroidal(slave)-to-master transformation u 1 0 d 0 0 0u x 1c x 1m y 1c 0 1 0 0 0 0 u y 1m u z1c 0 0 1 0 0 0 z1m e = or ue (20.13) s = Tsm um . u x 2c 0 0 0 1 0 d u x 2m u y 2c u y 2m 0 0 0 0 1 0 z 2c z 2m 0 0 0 0 0 1
1 The inverse transformation: Tmc = T cm is obtained on replacing d with d , as is physically obvious. The T T T e e Ke modied stiffness equations are obtained by the congruential transformation: Tcm c Tcm = Tcm fc = fm , which yields
2012
2013
(20.14)
m } pictured in Figure 20.13(c). Note that the modied equations are still referred to the local system {x m , y Prior to assembly they should be transformed to the global system {x , y } prior to assembly. The foregoing transformation procedure has a aw: for standard plate elements it will introduce compatibility errors at the interface between plate and beam. This may cause the beam stiffness to be signicantly underestimated. See the textbook by Cook et. al. [49] for an explanation, and references therein. The following subsections describes a different scheme that builds Ke m directly and cures that incompatibility. 20.4.3. Direct Fabrication of Offset Beam Stiffness This approach directly interpolates displacements and strains from master nodes placed at distance d from the beam longitudinal (centroidal) axis, as pictured in Figure 20.14. As usual the isoparametric coordinate along the beam element varies from 1 at node 1 through +1 at node 2. The following cross section geometric properties are dened for use below:
A=
Ae
d A,
Sz =
Ae
y d A = A d,
Izzc =
Ae
2 y c d A,
Izzm =
Ae
y 2 d A = Izzc + A d 2 ,
(20.15)
The inplane displacements are expressed in term of the master freedoms at nodes 1m and 2m . Using the Bernoulli-Euler model gives
u
u xm u ym = Nux 1 0 Nuy 1 y x Nuy 1
z1 y N x N z 1
Nux 2 0
Nuy 2 y x Nuy 2
z2 y N x N z 2
y 1m u z1m u x 2m u y 2m z 2m
x 1m
(20.16)
(1 )/2, Nux 2 = 1 (1 + )/2, Nuy 1 = 1 (1 )2 (2 + ), N z 1 = 1 (1 )2 (1 + ), where Nux 1 = 1 2 2 4 8 1 1 2 2 Nuy 2 = 4 (1 + ) (2 ), N z 2 = 8 (1 + ) (1 ) are the usual bar and beam shape functions, but here referred to the offset axis x m . and the strain energy U e = The axial strain is ex x = u x / x
1 2 Ve 2 E ex =A. Carrying x d V where d V = A d x
2013
2014
ym
z1m
y2m u u x2m
xm d zc
Beam cross section _
yc
Neutral axis Cross section centroid Symmetry plane
1m
2m xc
=1 _
E, A, Izzc constant
= 1
Le
Figure 20.14. Plane beam fabricated directly from offset master node freedoms.
out the integral and differentiating twice with respect to the degrees of freedom yields the stiffness matrix
0 A d A 0 Ad 6 ( Izzc + A d 2 ) 6 ( Izzc + A d 2 ) 12 ( Izzc + A d 2 ) 12 ( Izzc + A d 2 ) 0 e e 2 e 2 L Le (L ) (L ) 6 ( Izzc + A d 2 ) 6 ( Izzc + A d 2 ) 2 2 4 ( Izzc + A d ) Ad 2 ( Izzc + A d ) Le Le 0 Ad A 0 A d 2 2 2 2 6 ( Izzc + A d ) 12 ( Izzc + A d ) 12 ( Izzc + A d ) 6 ( Izzc + A d ) 0 Le Le ( L e )2 ( L e )2 2 + A d ) 6 ( Izzc + A d 2 ) 6 ( I zzc Ad 2 ( Izzc + A d 2 ) A d 4 ( Izzc + A d 2 ) Le Le 1 0 d 1 0 d 2 2 2 2 + d 2) 6 (r G + d 2) + d 2) 6 (r G + d 2) 12 (r G 12 (r G 0 0 e e 2 e 2 L Le (L ) (L ) 2 2 2 2 + d ) + d ) 6 ( r 6 ( r 2 2 G G 4 (r G + d 2) d 2 (r G + d 2) E A d e e L L = e L 1 0 d 1 0 1 d 2 2 2 2 2 2 2 2 + d ) 6 ( r + d ) + d ) 6 ( r + d ) 12 ( r 12 ( r 0 G G G G 0 Le Le ( L e )2 ( L e )2 2 2 2 + d 2) + d ) 6 (r G 6 ( r 2 2 G d 2 (r G + d 2) d 4 (r G + d 2) Le Le (20.17) 2 = Izzc / A is the squared radius of gyration of the cross section about z . In the second form, r G
Comparing the rst form of Ke in (20.17) with (20.14) shows that the bending terms are signicantly different if d = 0. These differences underscore the limitations of the rigid link assumption. 20.5.
A 0 A d E e K = e L A 0
Another application of rigid link constraints is to modeling of layered beams, also called composite beams as well as beam stacks. These are beam-columns fabricated with beam layers that are linked to operate collectively as a beam member. In this section we study how to form the stiffness equations of beam stacks under the following assumptions: 1. 2. The overall cross section of the beam member is rectangular and prismatic (that is, the cross section is constant along the longitudinal direction). Both the beam stack and each of its constituent layers are prismatic.
2014
2015
3.
The layers are of homogeneous isotropic material. Layer material, however, may vary from layer to layer.
The key modeling assumption is: is interlayer slip allosed or not? The two cases are studied next. 20.5.1. Layered Beam With No Interlayer Slip The main modeling constraint here is: if all layers are of the same material, the stiffness equations should reduce to those of a homogenous beam. To discuss how to meet this requirement it is convenient to introduce a beam template that separates the stiffness matrix into basic and higher order components. Consider a homogeneous, isotropic prismatic beam column element with elastic modulus E , cross section area A and cross section second moment of inertia Ix xc with respect to its neutral (centroidal) axis. The template form of the stiffness matrix in the local system is
K b1 0 0 e e = Ke K b + Kh = K b1
0 0
0 0 K b1 0 0 0 0 0 K b2 0 0 K b1 0 0 0 0 K b2 0
0 0 0 0 0 0 0 0 K b2 + h 0 0 0 0 0 0 0 K b2 0
0 0 K h3 K h4 K h4 K h5 0 0 K h3 K h4 K h4 K h5
0 0 0 0 0 0
0 0 K h3 K h4 K h4 K h5 (20.18) 0 0 K h3 K h4 K h4 K h5
in which K b1 = E A / L e , K b2 = E Izzc / L e , K h 3 = 12 E Izzc /( L e )3 , K h 4 = 6 E Izzc /( L e )2 and K h 5 = 3 E Izzc / L e . Here h is a free parameter that scales the higher order stiffness Kh . If h = 1 we recover the standard beam column stiffness (20.8). For a rectangular cross section of height H and width h , A = H h and Izzc = H 3 h /12, and the template (20.18) becomes
H 0 0 E h e = K e L H
0 0
0 0 H 0 0 0 1 0 12 H3 0 0 0 H 0 0 0 1 H3 0 0 12
0 0 0 0 3 1 0 12 H3 + h E H h 0 0 4( L e )3 0 0 1 0 12 H3
0 0 0 0 0 0 e e 0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2 (20.19) 0 0 0 0 0 0 e e
0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2
Next, cut the foregoing beam into two identical layers of height Hk = H /2, where k = 1, 2 is used as layer index. See Figure 20.15(b). The layers have area Ak = Hk h = H h /2 and self inertia Ix xk = Hk3 h /12 = H 3 h /96. The layer stiffness matrices in template form are
H k 0 Eh 0 e K k = Le Hk
0 0
0 0 Hk 0 0 0 1 Hk3 0 0 12 0 0 Hk 0 0 0 1 Hk3 0 0 12
0 0 0 0 3 1 0 12 Hk3 + hk E Hk h 0 0 4( L e )3 0 0 1 0 12 Hk3
0 0 0 0 0 0 e e 0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2 , 0 0 0 0 0 0 e e
0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2
k = 1, 2.
(20.20)
Beacuse the layers are identical it is reasonable to assume the same higher order free parameter for both layers, that is, h 1 = h 2 = h . The offset distances from each layer to the centroid of the full beam to the centroid of each layer are d1 = H /4 and d2 = H /4. The rigid-link transformation matrices for (20.20) are the same as those found in the previous Section:
1 0 H /4 0 0 1 0 0 1 T1 = 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 , 1 0 H /4 0 1 0 0 0 1
1 0 H /4 0 0 1 0 0 1 T2 = 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 1 0 0
0 0 0 . H /4 0 1
(20.21)
2015
2016
E, A, Izzc constant 1
1
d1=0
(a) 1 layer
= Le
2
h
d2= H/4 d1=H/4
2 1
H/2 H/2
(b) 2 layers
= Le
1
3 2 1
h
d3= H/3 d1=H/3 d2=0
3 2 1
(c) 3 layers
= Le
H 0 0 E h e = K e L H
0 0
0 0 H 0 0 0 1 3 0 0 12 H 0 0 H 0 0 0 1 0 12 H3 0
0 0 0 0 3 1 0 12 H3 + h E H h 0 0 16( L e )3 0 0 1 0 12 H3
0 0 0 0 0 0 e e 0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2 . (20.22) 0 0 0 0 0 0 e e
0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2
This becomes identical to (20.19) if we set h = 4. Carrying out the same exercise for three identical layers of height H /3, as shown in Figure 20.15(c), yields
H 0 0 E h e = K e L H
0 0
0 0 H 0 0 0 1 3 0 0 12 H 0 0 H 0 0 0 1 H3 0 0 12
0 0 0 0 3 1 0 12 H3 + h E H h 0 0 36( L e )3 0 0 1 0 12 H3
0 0 0 0 0 0 e e 0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2 , (20.23) 0 0 0 0 0 0 e e
0 4 2 L 0 4 2 L 0 2 L e ( L e )2 0 2 L e ( L e )2
which becomes identical to (20.19) if we set h = 9. It is not difcult to show that if the beam is divided into N 2 layers of height H / N , the correct beam stiffness is recovered if we take h = N 2 . If is not difcult to prove the following generalization. Suppose that the beam is cut into N layers of heights N N Hk = k H , k = 1, . . . N that satisfy 1 Hk = H or 1 k = 1. To get the correct stiffness of the layered beam take (20.24) hk = 1/k2 . For example, suppose that the but is divided into 3 layers of thicknesses H1 = H3 = H /4 and H2 = H /2. )2 = 16 and h 2 = 1/( 1 )2 = 4. Then pick h 1 = h 3 = 1/( 1 4 2 What is the interpretation of this boost? A spectral analysis of the combined stiffness shows that taking hk = 1 lowers the rigidity associated with the antisymmetric bending mode of the element. But this mode is associated with shear-slippage between layers. Boosting hk as found above compensates exactly for this rigidity decay.
2016
2017
20.5.2. Beam Stacks Allowing Interlayer Slip
_ y z
L = 80 cm
tf =2 cm
Cross section
_ y
_ x
c= 8 cm tf = 2 cm
z
b = 9 cm
There are beam fabrications where layers can slip longitudinally past each other. One important example is the sandwich beam illustrated in Figure 20.16. The beam is divided into three layers: 2 metal sheet facings and a honeycomb core. The core stiffness can be neglected since its effective elastic modulus is very low compared to the facings modulus E f . In addition, the facings are not longitudinally bonded since they are separated by the weaker core. To form the beam stiffness by the rigid link method it is sufcient to form the faces self-stiffness, which are identical, and the rigid-link transformation matrices:
0 Ef 0 e Kk = e L A f 0
0
Af
(20.25) / 12, d = ( c + t )/ 2 and d = ( c + t f )/2. where, in the notation of Figure 20.16, A f = bt f , Ix x f = bt 3 1 f 2 f e T T e e The stiffness of the sandwich beam is K = T1 K bold1 T1 + T2 K bold2 T2 into which the numerical values given in Figure 20.16 may be inserted. There is no need to use here the template form and of adjusting the higher order stiffness.
0 0 A f 0 0 12 Izz f 12 Izz f 6 Izz f 6 Izz f 0 e 2 Le Le ( L e )2 (L ) 6 Izz f 6I f 4 Izz f d zz 2 Izz f Le Le 0 0 Af 0 0 12 I 6I f 12 Izz f 6I f ezz2f zz 0 zz Le Le (L ) ( L e )2 6 Izz f 6I f 2 Izz f 0 zz 4 Izz f Le Le
1 0 0 1 0 0 , Tk = 0 0 0 0 0 0
df 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 df 0 1
, k = 1, 2.
2017
2018
20.6. The Space Beam Element A second example in 3D is the general beam element shown in Figure 20.17. The element is prismatic and has two end nodes: 1 and 2, placed at the centroid of the end cross sections. These dene the local x axis as directed from 1 to 2. For simplicity the cross section will Orientation node be assumed to be doubly symmetric, as is the defining plane x,y case in commercial I and double-T proles. The principal moments of inertia are dened by these symmetries. The local y and z axes are aligned with the symmetry lines of the y cross section forming a RH system with x . Consequently the principal moments of inertia are I yy and Izz , the bars being omitted z for convenience. 1 (x ,y ,z ) The global coordinate system is {x , y , z }. To dene the orientation of { y , z } with respect to the global system, a third orientation node 3, which must not be colinear with 12, is introduced. See Figure 20.17. Axis y lies in the 123 plane and z is normal to 123.
1 1 1
y z x
Six global DOF are dened at each node i : the 3 translations u xi , u yi , u zi and the 3 rotations xi , yi , zi . 20.6.1. Stiffness Matrix The element global node displacements and conjugate forces are arranged as ue = [ u x 1 fe = [ f x 1 u y1 f y1 u z1 f z1 x 1 mx1 y1 m y1 z 1 m z1 ux2 fx2 u y2 f y2 u z2 f z2 x 2 y2 z 2 ]T , m y2 m z 2 ]T . (20.26)
mx2
The beam material is characterized by the elastic modulus E and the shear modulus G (the latter appears in the torsional stiffness). Four cross section properties are needed: the cross section area A, the moment of inertia J that characterizes torsional rigidity,2 and the two principal moments of and z , respectively. The length of the element is denoted inertia I yy and Izz taken with respect to y by L . The Bernoulli-Euler model is used; thus the effect of tranverse shear on the beam stiffness is neglected. To simplify the following expressions, dene the following rigidity combinations by symbols: b b 3 2 b 3 R a = E A/ L , R t = G J / L , R b y 3 = E I yy / L , R y 2 = E I yy / L , R y = E I yy / L , R z 3 = E I zz / L , b 2 b a t Rz 2 = E I zz / L , R z = E I zz / L . Note that R is the axial rigidity, R the torsional rigidity, while
2
For circular and annular cross sections, J is the polar moment of inertia of the cross section wrt x . For other sections J has dimensions of (length)4 but must be calculated according to St. Venants theory of torsion, or approximate theories.
2018
2019
the R b s are bending rigities scaled by the length in various ways. Then the 12 12 local stiffness matrix can be written as3
Cf. page 79 of Pzremieniecki [204]. The presentation in this book includes transverse shear effects as per Timoshenkos beam theory. The form (20.27) results from neglecting those effects.
2019
2020
Ra 0 b 0 12 Rz 3 0 0 0 0 0 0 b e = 0 a 6 Rz 2 K R 0 0 12 R b z3 0 0 0 0 0 0 b 0 6 Rz 2
0 0 0 0 Ra b 0 0 0 6 Rz 2 0 b 12 R b 0 6 R 0 0 y3 y2 0 Rt 0 0 0 b 6 R b 0 4 R 0 0 y y2 b 0 0 0 4 Rz 0 0 0 0 0 Ra b 0 0 0 6 Rz 0 2 b b 12 R y 3 0 6 R y2 0 0 0 Rt 0 0 0 b 6 R b 0 2 R 0 0 y y2 b 0 0 0 2 Rz 0
0 0 0 0 0 b b 12 Rz 3 0 0 0 6 Rz 2 b b 0 12 R y 3 0 6 R y 2 0 0 0 Rt 0 0 b b 0 6 R y2 0 2 Ry 0 b b 6 R z 0 0 0 2 R z 2 0 0 0 0 0 b b 12 Rz 0 0 0 6 R z 3 2 0 12 R b 0 6 Rb 0 y3 y2 0 0 Rt 0 0 0 6 Rb 0 4 Rb 0 y y2 b b 6 R z 0 0 0 4 Rz 2
(20.27)
The transformation to the global system is the subject of Exercise 20.8. 20.6.2. Stiffness Module The computation of the stiffness matrix Ke of the two-node, prismatic space beam-column element is done by Mathematica module SpaceBeamColumn2Stiffness. This is listed in Figure 20.18. The module is invoked as Ke = SpaceBeamColumn2Stiffness[ncoor, { Em,Gm }, { A,Izz,Iyy,Jxx }, options] (20.28) The arguments are ncoor Node coordinates of element arranged as { { x1,y1,z1 },{ x2,y2,z2 },{ x3,y3,z3 } }, in which { x3,y3,z3 } species an orientation node 3 that denes the local frame. See 20.4.1. Elastic modulus. Shear modulus. Cross section area. Moment of inertia of cross section area respect to axis z . Moment of inertia of cross section area respect to axis y . Inertia with respect to x that appears in torsional rigidity G J . A list of processing options. For this element is has only one entry: { numer }. This is a logical ag with the value True or False. If True the computations are carried out in oating-point arithmetic. If False symbolic processing is assumed.
The module returns the 12 12 element stiffness matrix as function value. The implementation logic and testing of this element is the subject of Exercises 20.8 and 20.9.
Notes and Bibliography All elements implemented here are formulated in most books dealing with matrix structural analysis. Przemieniecki [204] has been recommended in Chapter 1 on account of being inexpensive. The implementation and testing procedures are rarely covered. The use of rigid links for offsetting degrees of freedom is briey covered in 7.8 of the textbook [49].
2020
2021
Homework Exercises for Chapter 20 Implementation of One-Dimensional Elements
Exercises
EXERCISE 20.1 [C:15] Download the plane bar stiffness module and their testers and verify the test results reported here. Comment on whether the stiffness matrix Ke has the correct rank of 1. EXERCISE 20.2 [C:15] Download the space bar stiffness module and their testers and verify the test results reported here. Comment on whether the computed stiffness matrix Ke has the correct rank of 1. EXERCISE 20.3 [C:15] Download the plane beam-column stiffness module and their testers and verify the test results reported here. Comment on whether the computed stiffness matrix Ke has the correct rank of 3. EXERCISE 20.4 [A+C:30] Explain why the space bar element has rank 1 although it has 6 degrees of freedom
and 6 rigid body modes. (According to the formula given in Chapter 19, the correct rank should be 6 6 = 0.)
EXERCISE 20.5 [C:25] Implement the plane bar, plane beam-column and space bar stiffness element module in a lower level programming language and check them by writing a short test driver. [Do not bother about the mass modules.] Your choices are C, Fortran 77 or Fortran 90. (C++ is overkill for this kind of software). EXERCISE 20.6 [A:25] Explain why the eigenvalues of Ke of any the elements given here do not change if
Exercise 16.5 and transform the local stiffness to global coordinates via a 3 9 transformation matrix. Test the element and verify that it has two nonzero eigenvalues. e stored in Kebar is correct (it has been trranscribed from [204]). Instead, focus the local stiffness matrix K on how the local to global transformation is built and applied.
EXERCISE 20.9 [C:25] Test the space beam element of Figure 20.18 using the scripts given in Figures E20.1 and E20.2, and report results. Comment on whether the element exhibits the correct rank of 6.
ClearAll[L,Em,Gm,A,Izz,Iyy,Jxx]; ncoor={{0,0,0},{1,8,4}}; Em=54; Gm=30; A=18; Izz=36; Iyy=72; Jxx=27; Ke= SpaceBeamColumn2Stiffness[ncoor,{Em,Gm},{A,Izz,Iyy,Jxx},{True}]; Print["Numerical Elem Stiff Matrix: "]; Print[SetPrecision[Ke,4]//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[Ke]]];
EXERCISE 20.8 [D+A:25] Explain the logic of the space beam module listed in Figure 20.18. Assume that
Figure E20.1. Script for numeric testing of the space beam module of Figure 20.18.
ClearAll[L,Em,Gm,A,Izz,Iyy,Jxx]; ncoor={{0,0,0},{2*L,2*L,L}/3}; Ke=SpaceBeamColumn2Stiffness[ncoor,{Em,Gm},{A,Izz,Iyy,Jxx},{False}]; kfac=Em; Ke=Simplify[Ke/kfac]; Print["Numerical Elem Stiff Matrix: "]; Print[kfac," ",Ke//MatrixForm]; Print["Eigenvalues of Ke=",kfac,"*",Eigenvalues[Ke]];
Figure E20.2. Script for symbolic testing of the space beam module of Figure 20.18.
2021
Introduction to FEM
20
IFEM Ch 20 Slide 1
Introduction to FEM
y y
1 (x 1 , y1 )
=L
2 (x 2 , y2 ) E, A constant
u u e = y1 ux2 u y2
f x1 f y1 fe = fx2 f y2
IFEM Ch 20 Slide 2
Introduction to FEM
K =
(Chapter 3)
x x x21 y21 21 21 EA y21 y21 x21 y21 = 3 x21 x21 x21 y21 x21 y21 y21 y21
Reason for the last form: symbolic computation. The length is irrational function of the node coordinates, and segregation helps simplification.
IFEM Ch 20 Slide 3
Introduction to FEM
IFEM Ch 20 Slide 4
Introduction to FEM
IFEM Ch 20 Slide 5
Introduction to FEM
IFEM Ch 20 Slide 6
Introduction to FEM
u x2 z1 y2 u 2
z2
y1 u 1
u x1
u e
x
=L
1
E, A, Izz constant
fx1 u x1 fy 1 u y1 m z1 z 1 e f = = u u x2 x2 u u y2 y2 z 2 m z2
_e
EA =
0 0 0 0 0
1 0 0 1
0 0 0 0 0
symm
0 0 0 EI 0 + 3 0 0 symm 0
0 12
0 6 4 2
0 0 0 12 0 6 0 0 12
0 6 2 2 0 6 4 2
bar contribution
IFEM Ch 20 Slide 7
Introduction to FEM
y y
1 (x 1 , y1 )
ue
u e
c u x1 u y 1 s z 1 0 = ux2 = 0 u y2 0 0 z 2
s 0 c 0 0 1 0 0 0 0 0 0
0 0 0 c s 0
T
_e =T K T
IFEM Ch 20 Slide 8
Introduction to FEM
IFEM Ch 20 Slide 9
Introduction to FEM
ClearA ll[L,E m,A,Iz z]; ncoor={{0,0},{3,4}}; Em=100; A=125; Izz=250; Ke= PlaneBeamColumn2Stiffness[ncoor,Em,{A,Izz},{True}]; Print["Numerical Elem Stiff Matrix: "]; Print[ Ke//Ma trixFo rm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[Ke]]]; Numerical Elem Stiff Matrix: 2436. 48. 4800. 48. 2464. 3600. 4800. 3600. 20000. 2436. 48. 4800. 48. 2464. 3600. 4800. 3600. 10000. 2436. 48. 4800. 2436. 48. 4800. 48. 2464. 3600. 48. 2464. 3600. 4800. 3600. 10000. 4800. 3600. 20000.
IFEM Ch 20 Slide 10
Introduction to FEM
12
24 Izz 5 L2
4 ( 27
Em
3 ( 64 12
Izz + 3 A L2 ) 25 L3
( 12 Izz + A L2 ) 25 L3 24 Izz 5 L2
18 Izz 5 L2 2 Izz L
12 ( 12 Izz + A L2 ) 25 L3 24 Izz 5 L2
18 Izz 5 L2 4 Izz L
IFEM Ch 20 Slide 11
Introduction to FEM
2 (x 2 ,y 2 ,z 2 )
= Le
x z Global system
ue
ux1 u y1 u z1 = ux2 u y2 u z2
fx1 f y1 f z1 fx2 f y2 f z2
IFEM Ch 20 Slide 12
Introduction to FEM
x21 x21 x21 y21 A E e x21 z 21 K = 3 x21 x21 x21 y21 x21 z 21
x21 y21 y21 y21 y21 z 21 x21 y21 y21 y21 y21 z 21
x21 x21 x21 y21 x21 z 21 x21 x21 x21 y21 x21 z 21
x21 y21 y21 y21 y21 z 21 x21 y21 y21 y21 y21 z 21
IFEM Ch 20 Slide 13
Introduction to FEM
IFEM Ch 20 Slide 14
Introduction to FEM
IFEM Ch 20 Slide 15
Introduction to FEM
IFEM Ch 20 Slide 16
Introduction to FEM
y z x
IFEM Ch 20 Slide 17
2016
Homework Exercises for Chapter 20 Implementation of One-Dimensional Elements Solutions Note: Several Sections and Exercises are new. Solutions below are skimpy to be eshed out in the future.
EXERCISE 20.1 Not assigned. EXERCISE 20.2 Not assigned. EXERCISE 20.3 Not assigned. EXERCISE 20.4 Not assigned. EXERCISE 20.5 Not assigned.
assumed from the HW assignment text). Such matrices have the property TT T = I, or TT = T1 .
EXERCISE 20.6 A transformation matrix T between two global Cartesian systems is orthogonal (this can be
If K is a stiffness in the old system, the transformed stiffness is given by TT KT = T1 KT. But the latter is a similarity transformation, which preserves the eigenvalues of K. Useful reference on web: http://mathworld.wolfram.com/Eigenvalue.html
EXERCISE 20.7 Not assigned.
e matrix in local coordinates is a standard result described in many FEM matrix. The formation of the K books, for example, [200]. In the module, that matrix is called Kebar. The construction of the local-to-global displacement transformation matrix T, called Te in the code, is outlined next. Building Te requires computation of the direction cosines of the three local axes: {x , y , z }, with respect to the three global axes {x , y , z }. Axis x is dened as passing through the element end nodes, going from 1 to 2. Thus the direction cosines txx,txy,txz can be obtained by taking the coordinate differences and dividing by the element length L. Nodes 1, 2 and 3 together dene the {x , y } plane. (Node 3 is usually given explicitly in argument ncoor to the module; but if omitted it is built by adding 1 to the y coordinate of the 12 midpoint.) The vector v30 joining the midpoint 0 of 12 to 3 is in that plane. Taking the cross product of x and v30 , and normalizing to unit length gives the direction cosines of z , which are called tzx,tzy,tzz. Finally, taking the cross product of z and x yields the direction cosines of y , which are called tyx,tyy,tyz. No normalization is needed in the last operation since the cross product of two orthogonal unit vectors is another unit vector. Why does Te consist of 4 identical diagonal blocks? Because the 3 nodal displacements and 3 nodal (innitesimal) rotations at each beam end node transform exactly by the same 3 3 direction cosine matrix.
EXERCISE 20.9 Not assigned.
EXERCISE 20.8 This exercise focuses on the local-to-global transformation of the 3D beam element stiffness
2016
21
211
212
TABLE OF CONTENTS
Page
21.1. Introduction 21.2. Analysis Stages 21.3. Analysis Support Modules 21.3.1. Assembling the Master Stiffness . . . . . . 21.3.2. Dening Boundary Conditions . . . . . . 21.3.3. Modifying the Master Stiffness Equations . . . 21.3.4. Displacement Solution and Reaction Recovery . 21.3.5. Flattening and Partitioning Node-Freedom Vectors 21.3.6. Internal Force Recovery . . . . . . . . 21.3.7. The Solution Driver . . . . . . . . . . 21.4. Utility Print Modules 21.5. Utility Graphic Modules 21.5.1. Plot Module Calls . . . . . . . . . . 21.5.2. Plot View Specication . . . . . . . . . 21.6. Example 1: Bridge Plane Truss Example 21.7. Example 2: An Orbiting Truss Structure 21. Notes and Bibliography . . . . . . . . . . . . . . . . . 21. Exercises . . . . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . .
. . . .
. . . . . . . . . .
. . . . . . . . . .
213 213 213 214 215 216 218 219 2110 2111 2112 2113 2113 2115 2115 2117 2119 2120
212
21.3
This Chapter presents a complete FEM program for analysis of space trusses. Why not start with plane trusses? Three reasons. First, plane truss code already appeared in Chapter 4, although most components were tailored to the example truss of Chapters 23. Second, the difference between 2D and 3D implementation logic for truss analysis is insignicant. Finally, space trusses are more interesting in engineering applications, particularly for orbiting structures in aerospace. The overall organization of the space truss analysis program is diagramed in Figure 21.1 The description is done in bottom up fashion. That means the element level modules are presented rst, followed by midlevel modules, ending with the driver program. This means traversing the diagram of Figure 21.1 left to right and bottom to top. The program includes some simple minded graphics, including animation. The graphic modules are provided in the posted Notebook but not described in detail. Data structures are explained along the way as they arise. 21.2. Analysis Stages The analysis of a structure by the Direct Stiffness Method involves three major stages: preprocessing or model denition, processing, and postprocessing. This is true for toy programs such as the one presented here, through huge commercial codes. Of course the stages here are very short. The preprocessing portion of the space truss analysis is done by a driver script, which directly sets the data structures for the problem at hand. The processing stage involves three steps: Assembly of the master stiffness matrix, with a subordinate element stiffness module. Modication of master stiffness matrix and node force vector for displacement boundary conditions. Solution of the modied equations for displacements. For the program presented here the built in Mathematica function LinearSolve is used.
Assembler
Element Stiffness
Element Library
Figure 21.1. Overall organization of space truss analysis program.
Upon executing the processing steps, the displacements are available. The following postprocessing steps follow. Recovery of forces including reactions, done through a Ku matrix multiplication. Computation of internal (axial) forces and stresses in truss members. Plotting deected shapes and member stress levels. 213
214
Figure 21.2. Master stiffness assembly module for a space truss. The element stiffness module SpaceBar2Stiffness, already discussed in Chapter 20, is listed for convenience.
21.3. Analysis Support Modules We begin by listing here modules that support processing steps. These are put into separate cells for display and testing convenience. 21.3.1. Assembling the Master Stiffness Module SpaceTrussMasterStiffness, listed in Figure 21.2, assembles the master stiffness matrix of a space truss. It uses the element stiffness formation module SpaceBar2Stiffness discussed in the previous Chapter. That module is also listed in Figure 21.2 for convenience of the reader. The assembler is invoked by K = SpaceTrussMasterStiffness[nodxyz,elenod,elemat,elefab,prcopt] The arguments are nodxyz elenod Nodal coordinates placed in a node-by-node list { { x1,y1,z1 },{ x2,y2,z2 }, . . . { xn,yn,zn } }, where n is the total number of nodes of the truss. Element end nodes placed in an element-by-element list: { { i1,j1 }, { i2,j2 }, . . . { ie,je } }, where e is the total number of elements of the truss. 214 (21.1)
215
21.3
ClearAll[nodxyz,elemat,elefab,eleopt]; nodxyz={{0,0,0},{10,0,0},{10,10,0}}; elenod= {{1,2},{2,3},{1,3}}; elemat= Table[100,{3}]; elefab= {1,1/2,2*Sqrt[2]}; prcopt= {False}; K=SpaceTrussMasterStiffness[nodxyz,elenod,elemat,elefab,prcopt]; Print["Master Stiffness of Example Truss in 3D:\n",K//MatrixForm]; Print["eigs of K:",Chop[Eigenvalues[N[K]]]]; Master Stiffness of Example Truss in 3D: 20 10 0 10 0 0 10 10 0 10 10 0 0 0 0 10 10 0 0 0 0 0 0 0 0 0 0 10 0 0 10 0 0 0 0 0 0 0 0 0 5 0 0 5 0 0 0 0 0 0 0 0 0 0 10 10 0 0 0 0 10 10 0 10 10 0 0 5 0 10 15 0 0 0 0 0 0 0 0 0 0 eigs of K: {45.3577, 16.7403, 7.902, 0, 0, 0, 0, 0, 0}
elemat
Element material properties. The only such property required for this analysis is the elastic modulus E of each element. These are put in an element-by-element list: { E1, E2, . . . Ee }, where e is the total number of elements of the truss. Element fabrication properties. The only such property required for this analysis is the cross section area A of each element. These are put in an element-by-element list: { A1, A2, . . . Ae }, where e is the total number of elements of the truss. Processing option list. Only one option is required in the assembler and so prcopt is simply { numer }. Here numer is a logical ag set to { True } to tell the assembler to carry out element stiffness computations in oating-point arithmetic. Else set to { False } to keep computations in exact arithmetic or symbolic form.
elefab
prcopt
The module returns the assembled stiffness, stored as a full 3n 3n matrix, as function value. Details of the assembly process are discussed in Chapter 25 for more general scenarios. Here we note that the module uses the freedom-pointer-table technique described in 3.4 for merging each element stiffness matrix into the master stiffness. The assembler is tested by the script shown in the top cell of Figure 21.3. The script denes the example truss of Chapters 23 as a 3D structure with its three members placed in the {x , y } plane. See Figure 21.4. The axial rigidity values E A = 100, 50 and 200 2 for elements 1, 2 and 3, respectively, have to be untangled because E is placed in elemat whereas A goes to elefab. To split E A we take E = 100 for the three elements. Thus elemat = { 100,100,100 } = Table[100,{ 3 }] whereas elefab = { 1,1/2,2*Sqrt[2] }. Running the assembler in exact arithmetic gives the 9 9 master stiffness shown in the bottom cell of Figure 21.3. Taking its eigenvalues gives 6 zeros, which is the expected number in three dimensions. 21.3.2. Dening Boundary Conditions The modication process described here refers to the application of displacement boundary condi215
216
tions on the master stiffness equations. These are assumed to be single-freedom constraints, either homogeneous such as u x 3 = 0, or nonhomogeneous such as u z 6 = 0.72. Boundary condition data in FEM programs is usually specied in two levels: nodes at the rst level, and freedoms assigned to that node at the second level. (The reason is that nodes are highly visible to casual users, whereas direct access to freedom numbers is difcult.) This space truss program is no exemption. This data is organized into two lists: node freedom tags and node freedom values. Their conguration is best specied through an example. Consider again the example truss in 3D shown in Figure 21.4, which has 3 nodes and 9 freedoms. The node freedom tag list, internally called nodtag, is nodtag = { { 1,1,1 },{ 0,1,1 },{ 0,0,1 } } (21.2)
fy3 = 1 3
;;; ;;;;
u y2 = u z2 = 0
uz3 = 0 fx3 = 2
; ;;;; ;
y 1
(3)
(1)
Figure 21.4. The example truss in three dimensions, used as module tester.
Each rst-level entry of this list pertains to a node. The second level is associated with freedoms: displacements in the x , y and z directions. Freedom activity is marked by tag 0 or 1. A 1-tag means that the displacement is prescribed, whereas a 0-tag indicates that the force is known. Thus { 1,1,1 } for node 1 means that the node is xed in the three directions. The node freedom value list, internally called nodval, gives the prescribed value of the force or the displacement. For the example truss it is nodval = { { 0,0,0 },{ 0,0,0 },{ 2,1,0 } } (21.3)
For node 1, the tag entry is { 1,1,1 } and the value entry is { 0,0,0 }. This says that u x 1 = u y 1 = u z 1 = 0. For node 2 it says that f x 2 = 0 and u y 2 = u z 2 = 0. For node 3 it says that f x 3 = 2, f y 3 = 1 and u z 3 = 0. The entries of nodval can be integers, oating point numbers, or symbols, whereas those in nodtag can only be 0 or 1.1 21.3.3. Modifying the Master Stiffness Equations The modication of the master stiffness equations K u = f for displacement BCs produces the u= modied system K f. This is done by the two modules listed in Figure 21.5. These modules are not restricted to space trusses, and may in fact be used for more general problems. The stiffness modier is invoked by Kmod = ModifiedMasterStiffness[nodtag, K] The arguments are: nodtag K
1
A node by node list of freedom tags, as dened in the previous subsection. The master stiffness matrix K produced by the assembler module.
Other tag values may be implemented in more complicated programs to mark multifreedom constraints, for example.
216
; ; ;
(21.4)
z u x1= u y1 = u z1 = 0
;;;
2
(2)
217
21.3
ModifiedMasterStiffness[nodtag_,K_] := Module[ {i,j,k,n=Length[K],pdof,np,Kmod=K}, pdof=PrescDisplacementDOFTags[nodtag]; np=Length[pdof]; For [k=1,k<=np,k++, i=pdof[[k]]; For [j=1,j<=n,j++, Kmod[[i,j]]=Kmod[[j,i]]=0]; Kmod[[i,i]]=1]; Return[Kmod]]; ModifiedNodeForces[nodtag_,nodval_,K_,f_]:= Module[ {i,j,k,n=Length[K],pdof,pval,np,d,c,fmod=f}, pdof=PrescDisplacementDOFTags[nodtag]; np=Length[pdof]; pval=PrescDisplacementDOFValues[nodtag,nodval]; c=Table[1,{n}]; For [k=1,k<=np,k++, i=pdof[[k]]; c[[i]]=0]; For [k=1,k<=np,k++, i=pdof[[k]]; d=pval[[k]]; fmod[[i]]=d; If [d==0, Continue[]]; For [j=1,j<=n,j++, fmod[[j]]-=K[[i,j]]*c[[j]]*d]; ]; Return[fmod]];
Figure 21.5. Modules to modify the master stiffness matrix and node force vector to apply the displacement boundary conditions.
The modied stiffness matrix, which has the same order as K, is returned as function value. The force modier is invoked by fmod = ModifiedNodeForces[pdof, pval, K, f] The arguments are: nodtag nodval K f The node freedom tag list dened in the previous subsection. The node freedom value list dened in the previous subsection. The master stiffness matrix K produced by the assembler module (before modication). This is only used if at least one of the displacement BCs is non-homogeneous. The force vector before application of the displacement BCs. (21.5)
The modied force vector, which has the same order as f, is returned as function value. The modules are tested by the script listed in the top cell of Figure 21.6. It uses symbolic master stiffness equations of order 6. The test illustrates a not well known feature of Mathematica: use of Array function to generate subscripted symbolic arrays of one and two dimensions. The results, shown in the bottom cell of Figure 21.6, should be self explanatory.
Remark 21.1. On entry, the modication modules of Figure 21.5 build auxiliary lists pdof and pval to simplify the modication logic. pdof is a list of the prescribed degrees of freedom identied by their equation number in the master stiffness equations. For example, if freedoms 4, 7, 9 and 15 are specied, pdof = { 4,7,9,15 }. These indices are stored in ascending order. pval is a list of the prescribed displacement values listed in pdof. These lists are constructed by the modules listed in Figure 21.7. The calls are pdof = PrescribedDOFTags[nodtag] and pval = PrescribedDOFValues[nodtag,nodval]. Remark 21.2. The logic of ModifiedMasterStiffness is straightforward. Construct pdof, then clear appropriate rows and columns of K and place ones on the diagonal. Note the use of the Mathematica function Length to control loops: np=Length[pdof] sets np to the number of prescribed freedoms. Similarly
217
218
Master Stiffness:
Master Force Vector: { f[1], f[2], f[3], f[4], f[5], f[6] } v1 v2 f[3] v1 K[1, 3] v2 K[2, 3] v4 K[4, 3] Modified Force Vector: v4 f[5] v1 K[1, 5] v2 K[2, 5] v4 K[4, 5] f[6] v1 K[1, 6] v2 K[2, 6] v4 K[4, 6]
n=Length[K] sets n to the order of the master stiffness matrix K, which is used to bound the row and column clearing loop. These statements may be placed in the list that declares local variables.
Remark 21.3. ModifiedNodalForces has more complicated logic because it accounts for nonhomogeneous
BCs. On entry it constructs pdof and pval. If nonzero values appear in pval, the original entries of f are modied as described in 4.1.2, and the end result is the effective force vector. Force vector entries corresponding to the prescribed displacement values are replaced by the latter in accordance with the prescription (4.13). If there are nonhomomogeneous BCs it is important that the stiffness matrix provided as third argument be the master stiffness before modication by ModifiedStiffnessMatrix. This is because stiffness coefcients that are cleared by ModifiedStiffnessMatrix are needed for modifying the force vector.
21.3.4. Displacement Solution and Reaction Recovery u= and The linear system K f, where K f are the modied stiffness and force matrices, respectively, is solved for displacements by a built-in linear algebraic solver. In Mathematica LinearSolve is available for this purpose: u = LinearSolve[Kmod, fmod] (21.6) At this point postprocessing begins. The node forces including reactions are obtained from f = K u. This can be done simply as a matrix product: f = K.u 218 (21.7)
219
21.3
PrescDisplacementDOFTags[nodtag_]:= Module [ {j,n,numnod=Length[nodtag],pdof={},k=0,m}, For [n=1,n<=numnod,n++, m=Length[nodtag[[n]]]; For [j=1,j<=m,j++, If [nodtag[[n,j]]>0, AppendTo[pdof,k+j]]; ]; k+=m; ]; Return[pdof]]; PrescDisplacementDOFValues[nodtag_,nodval_]:= Module [ {j,n,numnod=Length[nodtag],pval={},k=0,m}, For [n=1,n<=numnod,n++, m=Length[nodtag[[n]]]; For [j=1,j<=m,j++, If [nodtag[[n,j]]>0, AppendTo[pval,nodval[[n,j]]]]; ]; k+=m; ]; Return[pval]];
Figure 21.7. Modules to build auxiliary lists pdof and pval from node-by-node BC data.
where K is the original master stiffness matrix before modication, and u the displacement vector computed by LinearSolve. 21.3.5. Flattening and Partitioning Node-Freedom Vectors In the analysis process one often needs displacement and force vectors in two different list formats. For example, the computed node displacement vector produced by (21.6) for the example truss in 3D is u = { 0,0,0,0,0,0,0.4,-0.2,0 } (21.8) Following the terminology of Mathematica this will be called the at form of the displacement vector. For postprocessing purposes (especially printing and plotting) it is convenient to rearrange to the node by node form noddis = { { 0,0,0 },{ 0,0,0 },{ 0.4,-0.2,0 } } (21.9)
This will be called the node-partitioned form of the displacement vector. Similar dual formats exist for the node force vector. In at form this is called f and in node-partitioned form nodfor.
FlatNodePartVector[nv_]:=Flatten[nv]; NodePartFlatVector[nfc_,v_]:= Module [ {i,k,m,n,nv={},numnod}, If [Length[nfc]==0, nv=Partition[v,nfc]]; If [Length[nfc]>0, numnod=Length[nfc]; m=0; nv=Table[0,{numnod}]; For [n=1,n<=numnod,n++, k=nfc[[n]]; nv[[n]]=Table[v[[m+i]],{i,1,k}]; m+=k]]; Return[nv]];
The utility modules listed in Figure 21.8 can be used to pass from one format to the other. To atten the node-partitioned form of a vector, say nv, say v = FlatNodePartVector[nv] 219 (21.10)
2110
Figure 21.9. Modules to compute internal forces and stresses in a space truss.
where nfc is the number of freedoms per node. For space trusses this is 3 so appropriate conversion calls are noddis = NodePartFlatVector[3,u] and nodfor = NodePartFlatVector[3,f].
FlatNodePartVector can be directly done by the built-in function Flatten whereas NodePartFlatVector for a xed number of freedoms per node can be done by Partition. The reason for the wrappers is to guide the conversion of Mathematica code to a lower level language such as C, where such built-in list functions are missing.
Remark 21.5. The additional code in NodePartFlatVector caters to the case where the number of freedoms can vary from node to node, in which case nfc is a list (not a number) called the node freedom count, hence the abbreviation. That facility is useful in more advanced courses. Remark 21.4.
21.3.6. Internal Force Recovery The calculation of internal forces and stresses in a space truss involves computing axial forces in the bar elements. The modules that do those calculations given the displacement solution are listed in Figure 21.9. Module SpaceTrussIntForces computes the internal forces (axial forces) in all truss members. It is invoked by elefor = SpaceTrussIntForces[nodxyz,elenod,elemat, elefab,noddis,prcopt] (21.12) 2110
2111
21.3
ClearAll[nodxyz,elenod,elemat,elefab,noddis]; nodxyz={{0,0,0},{10,0,0},{10,10,0}}; elenod={{1,2},{2,3},{1,3}}; elemat= Table[100,{3}]; elefab= {1,1/2,2*Sqrt[2]}; noddis={{0,0,0}, {0,0,0}, {4/10,-2/10,0}}; prcopt={False}; elefor=SpaceTrussIntForces[nodxyz,elenod,elemat,elefab,noddis,prcopt]; Print["Int Forces of Example Truss:",elefor]; Print["Stresses:",SpaceTrussStresses[elefab,elefor,prcopt]]; Int Forces of Example Truss: { 0, 1, 2*Sqrt[2] } Stresses: { 0, 2, 1 }
Five of the arguments: nodxyz, elenod, elemat, elefab and prcopt, are the same used in the call (21.1) to the stiffness assembler. The additional argument, noddis, contains the computed node displacements arranged in node-partitioned form noddis = { { ux1,uy1,uz1 },{ ux2,uy2,uz2 }, . . . { uxn,uyn,uzn } } (21.13)
This form can be obtained from the computed displacement solution through the utility module (21.11). As function value SpaceTrussIntForces returns a list of element axial forces { p1, p2 . . . pe } (21.14)
SpaceTrussIntForces makes use of SpaceBar2IntForce, which computes the internal force in an individual bar element. This is invoked as SpaceBar2IntForce p = SpaceBar2IntForces[ncoor,Em,A,ue,options] (21.15)
Arguments ncoor, Em, A and options are the same as in the call to SpaceBar2Stiffness described in 20.2.2. The additional argument, ue, contains the at list of the six element node displacements in the global system arranged as { ux1,uy1,ux1,ux2,ux2,uz2 }. The recovery equation is the subject of Exercise 21.4. The last module in Figure 21.9 computes the member stresses simply by dividing the internal forces by the cross section areas. It is invoked as elesig = SpaceTrussStresses[elefab,elefor,prcopt] (21.16)
Here elefab and prcopt are as before, and elefor contains the element forces computed by SpaceTrussIntForces. The element axial stresses are returned as function value. The statements of the top cell of Figure 21.9 exercise the internal force recovery for the example truss in 3D, requesting exact calculiations. Array p is printed in the bottom cell. The axial forces of 0,, 1 and 2 2 agree with those determined in Chapter 3. 21.3.7. The Solution Driver It is convenient to package the sequence of operations desribed in the previous subsections, namely assembly, modication, solution, force and stress recovery, into one module called the solution driver. This is listed in Figure 21.11. It is invoked by saying { noddis,nodfor,elefor,elesig }= SpaceTrussSolution[nodxyz,elenod, elemat,elefab,nodtag,nodval,prcopt] 2111 (21.17)
2112
All arguments: nodxyz, elenod, elemat, elefab, nodtag, nodval and prcopt, have been described in previous subsections. The module returns four lists: noddis nodfor elefor elesig Computed node displacement in node partitioned format. Recovered node forces including reactions in node partitioned format. Element internal forces. Element stresses.
Note that the listing of SpaceTrussSolution in Figure 21.11 has two commented out eigenvalue computations, one for the master stiffness K and one for the modied stiffness Kmod. Decommenting those commands comes in handy when setting up and running a new problem if errors are detected.
SpaceTrussSolution[nodxyz_,elenod_,elemat_,elefab_,nodtag_,nodval_, prcopt_]:= Module[{K,Kmod,f,fmod,u,noddis,nodfor,elefor,elesig}, K=SpaceTrussMasterStiffness[nodxyz,elenod,elemat,elefab,prcopt]; (* Print["eigs of K=",Chop[Eigenvalues[N[K]]]]; *) Kmod=ModifiedMasterStiffness[nodtag,K]; f=FlatNodePartVector[nodval]; fmod=ModifiedNodeForces[nodtag,nodval,K,f]; (* Print["eigs of Kmod=",Chop[Eigenvalues[N[Kmod]]]]; *) u=LinearSolve[Kmod,fmod]; u=Chop[u]; f=Chop[K.u, 10.0^(-8)]; nodfor=NodePartFlatVector[3,f]; noddis=NodePartFlatVector[3,u]; elefor=Chop[SpaceTrussIntForces[nodxyz,elenod,elemat,elefab, noddis,prcopt]]; elesig=SpaceTrussStresses[elefab,elefor,prcopt]; Return[{noddis,nodfor,elefor,elesig}]; ];
Figure 21.11. The analysis driver module.
21.4.
Utility print modules are used to display input and output data in tabular form. The following six modules are provided in Cell 6 of the SpaceTruss.nb notebook. To print the node coordinates in nodxyz: PrintSpaceTrussNodeCoordinates[nodxyz,title,digits] (21.18)
To print the element nodes in elenod, element materials in elemat and element fabrications in elefab: PrintSpaceTrussElementData[elenod,elemat,elefab,title,digits] To print the freedom activity data in nodtag and nodval: PrintSpaceTrussFreedomActivity[nodtag,nodval,title,digits] To print the node displacements in noddis (congured in node-partitioned form): PrintSpaceTrussNodeDisplacements[noddis,title,digits] To print the node forces in nodfor (congured in node-partitioned form): PrintSpaceTrussNodeForces[nodfor,title,digits] (21.22) (21.21) (21.20) (21.19)
2112
2113
To print the element internal forces in elefor and element stresses in elesig: PrintSpaceTrussElemForcesAndStresses[elefor,elesig,title,digits] (21.23)
In all cases, title is an optional character string to be printed as a title before the table; for example "Node coordinates of bridge truss". To eliminate the title, specify "" (two quote marks together). The last argument of the print modules: digits, is optional. If set to { d,f } it species that oating point numbers are to be printed with room for at least d digits, with f digits after the decimal point. If digits is specied as a void list: { }, a preset default is used for d and f. 21.5.
Graphic modules that support preprocessing are placed in Cells 4 and 5 of the SpaceTruss.nb notebook. These display unlabeled elements, elements and nodes with labels, deformed shapes and element stress levels. 21.5.1. Plot Module Calls To plot elements only: PlotSpaceTrussElements[nodxyz,elenod,title,{ view,aspect,{ } }] To plot element and nodes with optional labeling: PlotSpaceTrussElementsAndNodes[nodxyz,elenod,title,{ view,aspect,labels }] (21.25) To plot deformed shape of the truss under computed node displacements: PlotSpaceTrussDeformedShape[nodxyz,elenod,noddis,amplif,box,title, { view,aspect,colors }] To plot element axial stress levels using a coloring scheme: PlotSpaceTrussStresses[nodxyz,elenod,elesig,sigfac,box,title, { view,aspect,{ } }] (21.27) (21.26) (21.24)
In the foregoing nodxyz, elenod, noddis, noddfor elefor and elesig have been described above. The other arguments are as follows. view A list congured as a list of two 3D vectors: { { Vhat1,Vhat2,Vhat3 },{ W1,W2,W3 } }. Vector , with W with global components { W1,W2,W3 } species the view direction whereas vector V global components { V1,V2,V3 }, species the up direction for the plot view, as discussed in 21.5.2. If a void list is provided for the argument, the default is { { 0,1,0 },{ 0,0,1 } }; this means that view direction is along the z axis whereas the up direction is the y axis. Vertical-to-horizontal aspect ratio of the plot as it appears on a Notebook cell. Three possibilities. If set to 1, the Mathematica default Aspect->Automatic is chosen. If set to zero, an aspect ratio is computed by the plot module as appropriate. If set to a positive number, the aspect ratio is set to that number. Only used in PlotSpaceTrussElementsAndNodes. A list with the following conguration: { { nlabels,frn,fex,fey }, { elabels,fre },{ fntfam,fntsiz,fntwgt,fntslt } }. nlabels frn A logical ag. Set to True to get node labels in plot. Radius of circle drawn around each node expressed as percentage of plot size.
aspect
labels
2113
2114
V = ys
pl an e
Sc
re
en
U = xs
y O x z
eye point, aka camera point, observer point, view reference point
W = zs
View direction
Global coordinate system (FEM) World coordinate system (graphics) Mathematica cell
Horizontal eccentricity in points of node label from node location. Vertical eccentricity in points of node label from node location. A logical ag. Set to True to get element labels in plot. Radius of circle drawn around each element number expressed as percentage of plot size. from node location. Font family used for labels, for example "Times" Size in points of font used for labels; usually 10 through 14. Font weight used for element labels. Typical settings are "Plain" or Bold. Node labels are always drawn in boldface. Font slant used for element labels. Typical settings are "Plain", "Italics" or "Slanted". Node labels are always drawn in Plain.
The displacement amplication factor to be used by PlotSpaceTrussDeformedShape. Usually a value much larger than one (say 100 or 1000) is necessary to visualize displacements in actual structures. Becomes a list if the call is to draw several shapes (for example undeformed and deformed). For example setting amplif to { 0,100 } will draw two shapes: the undeformed conguration and one with magnication of 100. If more than one shape is to be drawn the colors specication comes in handy. A list of points, specied by their {x , y , z } global coordinates, that forms a box that encloses the plot. Used in PlotSpaceTrussDeformedShape and PlotSpaceTrussStresses. The box is converted to a frame by the view projector. This is useful for various purposes, one being to do realistic animations by drawing a sequence of deformed shapes moving inside this box. Denes element colors to be used by PlotSpaceTrussDeformedShape, specied as lower case character string. Legal ones are "black", "red", "blue", "green" and white. If the call is to draw several shapes (for example undeformed and deformed), this argument can be a list, such as { "black","red" }, in which case the colors are in one to one correspondence with the amplication values in amplif. If no color is specied, black is assumed. A stress scaling factor for PlotSpaceTrussStresses. Normally set to 1.
box
colors
sigfac
Because of the confusing way Mathematica handles plots, (some features do scale with plot size while others, such as font sizes, do not), some interactive experimentation with dimension specs seems inevitable.
2114
2115
21.5.2. Plot View Specication
21.6
Plotting 3D objects, such as the space trusses considered here, involves mapping the coordinates given in the FEM global system {x , y , z } into screen coordinates {xs , ys , z s } in which z s = 0. Objects are rendered using screen coordinates. Construction of this mapping is based on the view specication, which appears as argument of all plotting routines described in the foregoing subsection. The viewing ingredients are shown in Figure 21.12. In computer graphics, the 3D space spanned by the FEM global system {x , y , z } is called the world space for obvious reasons. The screen coordinates {xs , ys , z s } are dened by two vectors, which in computer graphics are typically identied as W and V: the view direction and up direction, respectively. The view direction is the line dened by joining the eye position at C with the origin O of {x , y , z }. The screen plane passes through O and is normal to W. Screen coordinates xs and ys are in the screen plane and going along the horizontal and vertical directions, respectively. In computer graphics the xs and ys directions are called U and V, respectively. When the plot is rendered in a Mathematica cell, U xs goes horizontally from left to right. Axes {u xs , V ys , W z s } form a RHS Cartesian coordinate system. Mappings from screen to pixel coordinates are handled by the plotting system, and need not be discussed here. In the plot modules used here, the eye point C is assumed to be at innity.2 Thus only the view direction W, as specied by three direction numbers, is used. For example, the specication { 1,1,1 } says that W is the trisector of the {x , y , z } octant. To dene the up direction V ys one has to enter a second , which must not be parallel to W. Since V is not necessarily normal to W, V is indication vector: V T (V Wn )Wn , where Wn is W normalized to length one. For constructed by orthogonalization: V = V example if V and and W are specied by view argument { { 0,1,0 },{ 2,2,1 } }, then V = [0, 1, 0] ([0, 1, 0]T [2/3, 2/3, 1/3)[2/3, 2/3, 1/3] = [0, 1, 0] (2/3)[2/3, 2/3, 1/3] = [4/9, 5/9, 2/9]. Note that VT W = 0.
21.6. Example 1: Bridge Plane Truss Example This example deals with the analysis of the 6-bay bridge truss problem dened in Figure 21.13. This truss has 12 nodes and 17 elements. It is contained in the {x , y } plane and can only move in that plane. It is xed at node 1 and on rollers at node 12. The driver is listed in Figure 21.14. Preprocessing statements appear on top, with light green background. These dene the problem through specication of the following data structures.3 NodeCoordinates ElemNodes ElemMaterials Same conguration as nodxyz Same conguration as elenod Same conguration as elemat
ElemFabrications Same conguration as elefab. This list is built up from four repeating cross sectional areas: Abot, Atop, Abat and Adia, for the areas of bottom longerons, top longerons, battens and diagonals, respectively.
2
Graphics where the eye point C is at a nite distance produce perspective plots. The Graphics3D system of Mathematica allows perpective plotting. However the plots described here use only the 2D graphics subset. Note the use of longer mnemonic names in the problem driver. For example NodeCoordinates instead of nodxyz. This simplies the preparation of problem solving assignments since driver scripts are more self-documenting. It also helps grading returned assignments.
2115
2116
10
10 16 10 span: 6 bays @ 10 = 60
10
(b) y
(7)
4
(14)
(9)
6
(15)
(10)
(11)
10
(12)
; ;
(3)
(5)
Figure 21.13. Six-bay bridge plane truss used as example problem: (a) truss structure showing supports and applied loads; (b) nite element idealization as pin-jointed truss.
NodeDOFTags
Same conguration as nodtag. Initialized to { 0,0,1 } for all nodes on creation so as to x all z displacements. Then the support conditions in the {x , y } plane are specied at supported nodes. For example, NodeDOFTags[[1]] = { 1,1,1 } says that the three node displacement components u x 1 , u y 1 and u z 1 of node 1 are specied. Same conguration as nodval. Initialized to { 0,0,0 } on creation for all nodes. Then the value of nonzero applied loads is set at nodes 3, 5, 7, 9 and 11. For example NodeDOFValues[[7]] = { 0,-16,0 } species f x 7 = 0, f y 7 = 16 and u z 7 = 0.
NodeDOFValues
The input data structures can be shown in tabular form for convenient inspection using print utility modules. Printed tables are shown on the left of Figure 21.15. Running the solution module returns computed displacements, node forces including reactions, internal forces and member stress. These are printed with utility modules. These results are shown on the right of Figure 21.15. Output plot results are collected in Figure 21.16.
2116
; ;
11
(6)
x (13) (1) 3
(19)
(21) (17)
12
2117
21.7
NodeCoordinates={{0,0,0},{10,5,0},{10,0,0},{20,8,0},{20,0,0},{30,9,0}, {30,0,0},{40,8,0},{40,0,0},{50,5,0},{50,0,0},{60,0,0}}; ElemNodes={{1,3},{3,5},{5,7},{7,9},{9,11},{11,12}, {1,2},{2,4},{4,6},{6,8},{8,10},{10,12}, {2,3},{4,5},{6,7},{8,9},{10,11}, {2,5},{4,7},{7,8},{9,10}}; PrintSpaceTrussNodeCoordinates[NodeCoordinates,"Node coordinates:",{}]; numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; Em=1000; Abot=2; Atop=10; Abat=3; Adia=1; ElemMaterials= Table[Em,{numele}]; ElemFabrications={Abot,Abot,Abot,Abot,Abot,Abot,Atop,Atop,Atop,Atop, Atop,Atop,Abat,Abat,Abat,Abat,Abat,Adia,Adia,Adia,Adia}; PrintSpaceTrussElementData[ElemNodes,ElemMaterials,ElemFabrications, "Element data:",{}]; ProcessOptions= {True}; view={{0,1,0},{0,0,1}}; labels={{True,0.06,-1.5,1.5},{True,0.12},{"Times",11,"Roman"}}; PlotSpaceTrussElementsAndNodes[NodeCoordinates,ElemNodes, "bridge mesh",{view,-1,labels}]; NodeDOFTags= Table[{0,0,1},{numnod}]; NodeDOFValues=Table[{0,0,0},{numnod}]; NodeDOFValues[[3]]={0,-10,0}; NodeDOFValues[[5]]= {0,-10,0}; NodeDOFValues[[7]]={0,-16,0}; NodeDOFValues[[9]]={0,-10,0}; NodeDOFValues[[11]]={0,-10,0}; NodeDOFTags[[1]]= {1,1,1}; (* fixed node 1 *) NodeDOFTags[[numnod]]={0,1,1}; (* hroller @ node 12 *) PrintSpaceTrussFreedomActivity[NodeDOFTags,NodeDOFValues, "DOF Activity:",{}]; {NodeDisplacements,NodeForces,ElemForces,ElemStresses}= SpaceTrussSolution[ NodeCoordinates,ElemNodes,ElemMaterials, ElemFabrications,NodeDOFTags,NodeDOFValues,ProcessOptions ]; PrintSpaceTrussNodeDisplacements[NodeDisplacements, "Computed node displacements:",{}]; PrintSpaceTrussNodeForces[NodeForces, "Node forces including reactions:",{}]; PrintSpaceTrussElemForcesAndStresses[ElemForces,ElemStresses, "Int Forces and Stresses:",{}]; view={{0,1,0},{0,0,1}}; box={{0,-4,0},{60,-4,0},{60,10,0},{0,10,0}}; PlotSpaceTrussDeformedShape[NodeCoordinates,ElemNodes,NodeDisplacements, {0,1},box,"deformed shape (unit magnif)",{view,-1,{"black","blue"}}]; PlotSpaceTrussStresses[NodeCoordinates,ElemNodes,ElemStresses,1,box, "axial stresses in truss members",{view,0,labels}];
Figure 21.14. Driver script for analysis of the 6-bay plane bridge truss. Preprocessing statements in light green background. Processing and postprocessing statements in light blue.
21.7. Example 2: An Orbiting Truss Structure To be included in the nal version of the Chapter.
2117
2118
y coor 0.000000 5.000000 0.000000 8.000000 0.000000 9.000000 0.000000 8.000000 0.000000 5.000000 0.000000 0.000000 modulus 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 1000.00 z tag 1 1 1 1 1 1 1 1 1 1 1 1
z coor 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 area 2.00 2.00 2.00 2.00 2.00 2.00 10.00 10.00 10.00 10.00 10.00 10.00 3.00 3.00 3.00 3.00 3.00 1.00 1.00 1.00 1.00 y value 0 0 10 0 10 0 16 0 10 0 10 0 z value 0 0 0 0 0 0 0 0 0 0 0 0
z displ 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000
Node forces including reactions : node x force y force z force 1 0.0000 28.0000 0.0000 2 0.0000 0.0000 0.0000 3 0.0000 10.0000 0.0000 4 0.0000 0.0000 0.0000 5 0.0000 10.0000 0.0000 6 0.0000 0.0000 0.0000 7 0.0000 16.0000 0.0000 8 0.0000 0.0000 0.0000 9 0.0000 10.0000 0.0000 10 0.0000 0.0000 0.0000 11 0.0000 10.0000 0.0000 12 0.0000 28.0000 0.0000 Int Forces and Stresses : elem axial force axial stress 1 56.0000 28.0000 2 56.0000 28.0000 3 57.5000 28.7500 4 57.5000 28.7500 5 56.0000 28.0000 6 56.0000 28.0000 7 62.6100 6.2610 8 60.0300 6.0030 9 60.3000 6.0300 10 60.3000 6.0300 11 60.0300 6.0030 12 62.6100 6.2610 13 10.0000 3.3330 14 9.2500 3.0830 15 12.0000 4.0000 16 9.2500 3.0830 17 10.0000 3.3330 18 1.6770 1.6770 19 3.2020 3.2020 20 3.2020 3.2020 21 1.6770 1.6770
x value 0 0 0 0 0 0 0 0 0 0 0 0
Figure 21.15. Bridge truss example: tabular printed output. On the left: node, element and freedom data. On the right: computed displacements, node forces, internal forces and member stresses.
bridge mesh
deformed shape
Figure 21.16. Bridge truss example: graphic output collected in one gure.
2118
2119
Notes and Bibliography
The dominant philosophy in FEM implementation is to construct general purpose programs that can solve a wide range of problems. For example, static and dynamic response of arbitrary structures with linear or nonlinear behavior. This path was naturally taken once the Direct Stiffness Method became widely accepted in the mid 1960s. It is reected in the current crop of commercial FEM programs. Their source code by now has reached into millions of lines. These codes do have a place in undergraduate engineering education, starting at the junior level. At this level students should be taught rudiments of modeling and how to use those black box programs as tools. This exposure provides also basic knowledge for capstone senior projects that require nite element analysis. At the graduate level, however, students should understand what goes on behind the scene. But access to innards of commercial programs is precluded (and even if it were, it would be difcult to follow given their complexity). The philosophy followed here is to use special purpose codes written in a high level language. These may be collectively called grey level codes. A high level language such as Mathematica conceals utility operations such as matrix products, linear solvers and graphics, but permits the application code logic to be seen and studied. As a result a complete FEM program is tiny (typically a few hundreds lines), it can be built and debugged in a few hours, and may be understood as a whole by one person. On the down side of course these toy programs can do only very limited problems, but for instructional use simplicity outweights generality.
2119
2120
EXERCISE 21.1 [D:10] The logic of SpaceTrussMasterStiffness cannot be used for structures other than space trusses. Justify this assertion. EXERCISE 21.2 [D:10] The logic of ModifiedMasterStiffness and ModifiedNodeForces is not re-
stricted to space trusses, but can be used for any FEM program that stores K and f as full arrays. Justify this assertion.
EXERCISE 21.3 [D:20] The logic of PrescDisplacementDOFTags and PrescDisplacementDOFValues
is not restricted to a xed number of DOF per node. Justify this assertion.
EXERCISE 21.4 [A:15] Show that the longitudinal elongation of a space bar can be computed directly from
in which x21 = x2 x1 , u x 21 = u x 2 u x 1 , etc, and is the bar length. Hence justify the formula used in module SpaceBar2IntForce listed in Figure 21.9 to recover the axial force p = ( E A / )d .
EXERCISE 21.5 [C:25] Analyze the structure shown in Figure E21.1. This is a pin-jointed truss model of a
200-in-high (5m) transmission tower originally proposed by Fox and Schmit in 1964 [98] as a test for early automated-synthesis codes based on FEM. It became a standard benchmark for structural optimization. The truss has 10 joints (nodes) and 25 members (elements). The truss geometry and node numbering are dened in Figure E21.1(a). Joints 1 and 2 at the top of the tower lie on the {x , z } plane. The truss (but not the loads) is symmetric about the { y , z } and {x , z } planes. Figure E21.1(b) gives the element numbers.
(a)
Coordinates: node 2 ( 37.5,0,200) node 1 (37.5,0,200) 75 in
z 1
(b)
1 (1) 2
100 in (8) (9) (5) (4) (10) (13) 6 (20) (22) (14) (21) (6) (7) (3) (2) (12) 3
6
75 in
3 5 7 y
4 5
(23) (15) (24) (16)
10
200 in
10
100 in
7 (11)
(17)
9
200 in
x 9
Figure E21.1. 25-member space truss model of a transmission tower. (a): Geometry denition and node numbers; (b) element numbers. For member properties and loads see Tables E21.1 and E21.2.
2120
2121
Table E21.1 Element 1 2 3 4 5 6 7 8 9 Cross section areas of transmission tower members Element 10 11 12 13 14 15 16 17 18 A (sq in) 0.010 0.010 0.014 0.014 0.980 0.980 0.980 0.980 1.760 Element 19 20 21 22 23 24 25 A (sq in) 1.760 1.760 1.760 2.440 2.440 2.440 2.440
Exercises
A (sq in) 0.033 2.015 2.015 2.015 2.015 2.823 2.823 2.823 2.823
Applied load case for transmission tower x -load (lb) 1000 0 500 500 y -load (lb) 10000 10000 0 0 z -load (lb) 5000 5000 0 0
Applied forces at all other nodes are zero. Own-weight loads not considered.
The members are aluminum tubes with the cross sections listed in Table E21.1.4 The modulus of elasticity is E = 107 psi for all members. The specic weight is 0.1 lb/in3 . The applied load case to be studied is given in Table E21.2. Analyze the transmission tower using the program provided in the SpaceTruss.nb Notebook (downloadable from Chapter 21 Index). Results to report: driver program cell, node displacements and element stresses. (More details on HW assignment sheet.) Note: as a quick check on model preparation, the total weight of the tower should be 555.18 lb. A Fix for Version 6. Cell 0 added to Notebook SpaceTruss.nb on November 1, 2008 so that plots will display correctly under Mathematica Version 6.0 and later versions. If plots dont show up correctly please notify instructor.
Data taken from an optimal design reported by Venkayya, Khot and Reddy in 1968 [258].
2121
Introduction to FEM
21
IFEM Ch 21 Slide 1
Introduction to FEM
The Three Basic Stages of a FEM Program Based on the Direct Stiffness Method
IFEM Ch 21 Slide 2
Introduction to FEM
Assembler
Element Stiffness
Element Library
IFEM Ch 21 Slide 3
Introduction to FEM
Assembler
Element Stiffness
Element Library
IFEM Ch 21 Slide 4
Introduction to FEM
IFEM Ch 21 Slide 5
Introduction to FEM
IFEM Ch 21 Slide 6
Introduction to FEM
(3)
;;;; ; ;;
y 1
(1)
z u x1= u y1 = u z1 = 0
IFEM Ch 21 Slide 7
;; ;;
uz3 = 0 fx3 = 2
u y2 = u z2 = 0 fx2 = 0
Introduction to FEM
BC Application
IFEM Ch 21 Slide 8
Introduction to FEM
Restriction: single freedom constraints only. However, logic in ModifiedNodeForces accounts for nonzero prescribed displacements.
IFEM Ch 21 Slide 9
Test BC Applicator
Introduction to FEM
ClearAll[K,f,v1,v2,v4]; Km=Array[K,{6,6}]; Print["Master Stiffness: ",Km//MatrixForm]; nodtag={{1,1},{0,1},{0,0}}; nodval={{v1,v2},{0,v4},{0,0}}; Kmod=ModifiedMasterStiffness[nodtag,Km]; Print["Modified Master Stiffness:",Kmod//MatrixForm]; fm=Array[f,{6}]; Print["Master Force Vector:",fm]; fmod=ModifiedNodeForces[nodtag,nodval,Km,fm]; Print["Modified Force Vector:",fmod//MatrixForm]; K[1, 2] K[1, 3] K[1, 4] K[1, 5] K[1, 6] K[2, 2] K[2, 3] K[2, 4] K[2, 5] K[2, 6] K[3, 2] K[3, 3] K[3, 4] K[3, 5] K[3, 6] Master Stiffness: K[4, 2] K[4, 3] K[4, 4] K[4, 5] K[4, 6] K[5, 2] K[5, 3] K[5, 4] K[5, 5] K[5, 6] K[6, 2] K[6, 3] K[6, 4] K[6, 5] K[6, 6] 1 0 0 0 0 0 0 1 0 0 0 0 0 0 K[3, 3] 0 K[3, 5] K[3, 6] Modified Master Stiffness: 0 0 0 1 0 0 0 0 K[5, 3] 0 K[5, 5] K[5, 6] 0 0 K[6, 3] 0 K[6, 5] K[6, 6] Master Force Vector: { f[1], f[2], f[3], f[4], f[5], f[6] } v1 v2 f[3] v1 K[1, 3] v2 K[2, 3] v4 K[4, 3] Modified Force Vector: v4 f[5] v1 K[1, 5] v2 K[2, 5] v4 K[4, 5] f[6] v1 K[1, 6] v2 K[2, 6] v4 K[4, 6] K[1, 1] K[2, 1] K[3, 1] K[4, 1] K[5, 1] K[6, 1]
IFEM Ch 21 Slide 10
Introduction to FEM
IFEM Ch 21 Slide 11
Introduction to FEM
Element Library
IFEM Ch 21 Slide 12
Introduction to FEM
SpaceTrussIntForces[nodxyz_,elenod_,elemat_,elefab_, noddis_,prcopt_]:= Module[{ numnod=Length[nodxyz], numele=Length[elenod],e,ni,nj,ncoor,Em,A,options,ue,p}, p=Table[0,{numele}]; For [e=1, e<=numele, e++, {ni,nj}=elenod[[e]]; ncoor={nodxyz[[ni]],nodxyz[[nj]]}; ue=Flatten[{ noddis[[ni]],noddis[[nj]] }]; Em=elemat[[e]]; A=elefab[[e]]; options=prcopt; p[[e]]=SpaceBar2IntForce[ncoor,Em,A,ue,options] ]; Return[p]];
IFEM Ch 21 Slide 13
Introduction to FEM
SpaceBar2IntForce[ncoor_,Em_,A_,ue_,options_]:= Module[ {x1,x2,y1,y2,z1,z2,x21,y21,z21,EA,numer,LL,pe}, {{x1,y1,z1},{x2,y2,z2}}=ncoor;{x21,y21,z21}={x2-x1,y2-y1,z2-z1}; EA=Em*A; {numer}=options; LL=x21^2+y21^2+z21^2; If [numer,{x21,y21,z21,EA,LL}=N[{x21,y21,z21,EA,LL}]]; pe=(EA/LL)*(x21*(ue[[4]]-ue[[1]])+y21*(ue[[5]]-ue[[2]])+ +z21*(ue[[6]]-ue[[3]]));
IFEM Ch 21 Slide 14
Introduction to FEM
ClearAll[nodxyz,elenod,elemat,elefab,noddis]; nodxyz={{0,0,0},{10,0,0},{10,10,0}}; elenod={{1,2},{2,3},{1,3}}; elemat= Table[100,{3}]; elefab= {1,1/2,2*Sqrt[2]}; noddis={{0,0,0}, {0,0,0}, {4/10,-2/10,0}}; prcopt={False}; elefor=SpaceTrussIntForces[nodxyz,elenod,elemat,elefab,noddis,prcopt]; Print["Int Forces of Example Truss:",elefor]; Print["Stresses:",SpaceTrussStresses[elefab,elefor,prcopt]]; Int Forces of Example Truss: { 0, 1, 2*Sqrt[2] } Stresses: { 0, 2, 1 }
This script also tests module SpaceTrussStresses, not shown in these slides as it is very simple
IFEM Ch 21 Slide 15
Introduction to FEM
Analysis Driver
IFEM Ch 21 Slide 16
Introduction to FEM
IFEM Ch 21 Slide 17
Introduction to FEM
IFEM Ch 21 Slide 18
Introduction to FEM
10
10
16
10
10
span: 6 bays @ 10 = 60
(b) y
(7)
2 3
(8)
4
(14)
(9)
6
(15)
(10)
(11)
10
(12)
; ;
(1)
(2)
(3)
(5)
IFEM Ch 21 Slide 19
; ;
11
(6)
(13) (18)
(19)
(21) (17)
12
Introduction to FEM
NodeCoordinates={{0,0,0},{10,5,0},{10,0,0},{20,8,0},{20,0,0},{30,9,0}, {30,0,0},{40,8,0},{40,0,0},{50,5,0},{50,0,0},{60,0,0}}; ElemNodes={{1,3},{3,5},{5,7},{7,9},{9,11},{11,12}, {1,2},{2,4},{4,6},{6,8},{8,10},{10,12}, {2,3},{4,5},{6,7},{8,9},{10,11}, {2,5},{4,7},{7,8},{9,10}}; PrintSpaceTrussNodeCoordinates[NodeCoordinates,"Node coordinates:",{}]; numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; Em=1000; Abot=2; Atop=10; Abat=3; Adia=1; ElemMaterials= Table[Em,{numele}]; ElemFabrications={Abot,Abot,Abot,Abot,Abot,Abot,Atop,Atop,Atop,Atop, Atop,Atop,Abat,Abat,Abat,Abat,Abat,Adia,Adia,Adia,Adia}; PrintSpaceTrussElementData[ElemNodes,ElemMaterials,ElemFabrications, "Element data:",{}]; ProcessOptions= {True}; (* Plot statements omitted - interface being changed *)
NodeDOFTags= Table[{0,0,1},{numnod}]; NodeDOFValues=Table[{0,0,0},{numnod}]; NodeDOFValues[[3]]={0,-10,0}; NodeDOFValues[[5]]= {0,-10,0}; NodeDOFValues[[7]]={0,-16,0}; NodeDOFValues[[9]]={0,-10,0}; NodeDOFValues[[11]]={0,-10,0}; NodeDOFTags[[1]]= {1,1,1}; (* fixed node 1 *) NodeDOFTags[[numnod]]={0,1,1}; (* hroller @ node 12 *) PrintSpaceTrussFreedomActivity[NodeDOFTags,NodeDOFValues, "DOF Activity:",{}];
IFEM Ch 21 Slide 20
Introduction to FEM
z tag 1 1 1 1 1 1 1 1 1 1 1 1
x value 0 0 0 0 0 0 0 0 0 0 0 0
y value 0 0 10 0 10 0 16 0 10 0 10 0
z value 0 0 0 0 0 0 0 0 0 0 0 0
IFEM Ch 21 Slide 21
Introduction to FEM
IFEM Ch 21 Slide 22
Introduction to FEM
{NodeDisplacements,NodeForces,ElemForces,ElemStresses}= SpaceTrussSolution[ NodeCoordinates,ElemNodes,ElemMaterials, ElemFabrications, NodeDOFTags, NodeDOFValues,ProcessOptions ]; PrintSpaceTrussNodeDisplacements[NodeDisplacements, "Computed node displacements:",{}]; PrintSpaceTrussNodeForces[NodeForces, "Node forces including reactions:",{}]; PrintSpaceTrussElemForcesAndStresses[ElemForces,ElemStresses, "Int Forces and Stresses:",{}]; (* Plot statements omitted - interface being changed *)
IFEM Ch 21 Slide 23
Introduction to FEM
Node forces including reactions : node x force y force z force 1 0.0000 28.0000 0.0000 2 0.0000 0.0000 0.0000 3 0.0000 10.0000 0.0000 4 0.0000 0.0000 0.0000 5 0.0000 10.0000 0.0000 6 0.0000 0.0000 0.0000 7 0.0000 16.0000 0.0000 8 0.0000 0.0000 0.0000 9 0.0000 10.0000 0.0000 10 0.0000 0.0000 0.0000 11 0.0000 10.0000 0.0000 12 0.0000 28.0000 0.0000
IFEM Ch 21 Slide 24
Introduction to FEM
IFEM Ch 21 Slide 25
Introduction to FEM
1 (1) 2
(6) (7) (3) (2) (12) 3
4 5
(14) (23) (15) (24)
6
75 in
3 5 7
4 10
7 (11)
(21)
(17)
(16)
10
200 in
y
100 in
9 8
9
Coordinates: node 2 ( 37.5,0,200) node 1 (37.5,0,200) 200 in
IFEM Ch 21 Slide 26
2122
Homework Exercises for Chapter 21: FEM Program for Space Trusses Solutions
EXERCISE 21.1 Not assigned EXERCISE 21.2 No assumptions are made in these modules about K and f other than they are stored as
a full two-dimensional array K and full vector f, respectively. The DOF activity data nodtag and DOF specied values nodval are provided in a form that depends on DOF nodal conguration, but this is converted by PrescDisplamentDOFTags and PrescDisplamentDOFValue to at arrays that are independent of that conguration. Consequently they can be used for any FEM program that stores K and f as indicated.
EXERCISE 21.3 Not assigned EXERCISE 21.4 Not assigned EXERCISE 21.5 The Mathematica analysis is shown in Figures E21.2 through E21.7. These were extracted from input and output cells and reformatted to t into Illustrator EPS.
Note: as a check on the model, the weight of the truss was computed to be 555.184 lbs. This computation is optional (only recommended in the HW assignment).
NodeCoordinates={{-37.5,0,200},{37.5,0,200},{-37.5,37.5,100}, {37.5,37.5,100},{37.5,-37.5,100},{-37.5,-37.5,100}, {-100,100,0},{100,100,0},{100,-100,0},{-100,-100,0}}; ElemNodes={{1,2},{1,4},{2,3},{1,5},{2,6},{2,4}, {2,5},{1,3},{1,6},{3,6},{4,5},{3,4}, {5,6},{3,10},{6,7},{4,9},{5,8}, {4,7},{3,8},{5,10},{6,9},{6,10},{3,7},{5,9},{4,8}}; PrintSpaceTrussNodeCoordinates[NodeCoordinates,"Node coordinates:",{}]; numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; Em=10.0^7; A1=0.033; A2=2.015; A3=2.015; A4=2.015; A5=2.015; A6=2.823; A7=2.823; A8=2.823; A9=2.823; A10=0.01; A11=0.01; A12=0.014; A13=0.014; A14=0.98; A15=0.98; A16=0.98; A17=0.98; A18=1.76; A19=1.76; A20=1.76; A21=1.76; A22=2.44; A23=2.44; A24=2.44; A25=2.44; ElemMaterials= Table[Em,{numele}]; ElemFabrications={A1,A2,A3,A4,A5,A6,A7,A8,A9,A10,A11,A12,A13,A14,A15, A16,A17,A18,A19,A20,A21,A22,A23,A24,A25}; PrintSpaceTrussElementData[ElemNodes,ElemMaterials,ElemFabrications, "Element data:",{6,3}]; ProcessOptions= {True}; (*view and labels used below were suggested to students by email *) view={{0,0,1},{1,-3,1}}; labels={{True,0.014,-1.5,1.5},{True,0.020},{"Times",12,"Roman"}}; PlotSpaceTrussElementsAndNodes[NodeCoordinates,ElemNodes, "tower mesh in perspective",{view,-1,labels}]; NodeDOFTags= Table[{0,0,0},{numnod}]; NodeDOFValues=Table[{0,0,0},{numnod}]; NodeDOFValues[[1]]={1000,10000,-5000}; NodeDOFValues[[2]]={ 0,10000,-5000}; NodeDOFValues[[3]]={ 500, 0, 0}; NodeDOFValues[[6]]={ 500, 0, 0}; NodeDOFTags[[7]]=NodeDOFTags[[8]]= NodeDOFTags[[9]]= NodeDOFTags[[10]]={1,1,1}; PrintSpaceTrussFreedomActivity[NodeDOFTags,NodeDOFValues, "DOF Activity:",{}];
2122
2123
Solutions to Exercises
Node coordinates: node x coor 1 37.500000 2 37.500000 3 37.500000 4 37.500000 5 37.500000 6 37.500000 7 100.000000 8 100.000000 9 100.000000 10 100.000000 Element data: elem nodes 1 { 1, 2} 2 { 1, 4} 3 { 2, 3} 4 { 1, 5} 5 { 2, 6} 6 { 2, 4} 7 { 2, 5} 8 { 1, 3} 9 { 1, 6} 10 { 3, 6} 11 { 4, 5} 12 { 3, 4} 13 { 5, 6} 14 { 3, 10} 15 { 6, 7} 16 { 4, 9} 17 { 5, 8} 18 { 4, 7} 19 { 3, 8} 20 { 5, 10} 21 { 6, 9} 22 { 6, 10} 23 { 3, 7} 24 { 5, 9} 25 { 4, 8}
y coor 0.000000 0.000000 37.500000 37.500000 37.500000 37.500000 100.000000 100.000000 100.000000 100.000000 modulus 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107 1.000 x 107
z coor 200.000000 200.000000 100.000000 100.000000 100.000000 100.000000 0.000000 0.000000 0.000000 0.000000 area 0.033 2.015 2.015 2.015 2.015 2.823 2.823 2.823 2.823 0.010 0.010 0.014 0.014 0.980 0.980 0.980 0.980 1.760 1.760 1.760 1.760 2.440 2.440 2.440 2.440 DOF Activity: node x tag y tag 1 0 0 2 0 0 3 0 0 4 0 0 5 0 0 6 0 0 7 1 1 8 1 1 9 1 1 10 1 1 z tag 0 0 0 0 0 0 1 1 1 1 x value 1000 0 500 0 0 500 0 0 0 0 y value 10000 10000 0 0 0 0 0 0 0 0 z value 5000 5000 0 0 0 0 0 0 0 0
Figure E21.3. Transmission tower: printed output of element, data and freedom activity (output from Mathematica relocated within gure).
tower mesh in perspective
1 1
8 9 3 6 15 147 22 20 10 13 23 18 5 4
3 2 7 12 5
4 11 19 17 25
21
16 24
10 9
Figure E21.4. Transmission tower: FEM model plot showing node and element numbers.
2123
2124
{NodeDisplacements,NodeForces,ElemForces,ElemStresses}= SpaceTrussSolution[ NodeCoordinates,ElemNodes,ElemMaterials, ElemFabrications,NodeDOFTags,NodeDOFValues,ProcessOptions ]; PrintSpaceTrussNodeDisplacements[N[NodeDisplacements], "Computed node displacements:",{}] PrintSpaceTrussNodeForces[N[NodeForces], "Node forces including reactions:",{6,2}]; PrintSpaceTrussElemForcesAndStresses[N[ElemForces],N[ElemStresses], "Int Forces and Stresses:",{6,2}]; view={{0,0,1},{2,-3,1}}; box={{-100,100,0},{100,100,0},{100,-100,0},{-100,-100,0}, {-100,100,200},{100,100,200},{100,-100,200},{-100,-100,200}}; PlotSpaceTrussDeformedShape[NodeCoordinates,ElemNodes,NodeDisplacements, {0,250},box,"deformed shape (mag x250)",{view,-1,{"black","red"}}]; PlotSpaceTrussStresses[NodeCoordinates,ElemNodes,ElemStresses,1,box, "axial stresses in truss members",{view,0,labels}];
Computed node displacements: node x displ y displ z displ 1 0.008515 0.349956 0.022128 2 0.031916 0.349956 0.032242 3 0.011530 0.009770 0.108526 4 0.004039 0.008781 0.115393 5 0.000448 0.005089 0.070508 6 0.007042 0.004100 0.077375 7 0.000000 0.000000 0.000000 8 0.000000 0.000000 0.000000 9 0.000000 0.000000 0.000000 10 0.000000 0.000000 0.000000 Node forces including reactions: node x force y force z force 1 1000.00 10000.00 5000.00 2 0.00 10000.00 5000.00 3 500.00 0.00 0.00 4 0.00 0.00 0.00 5 0.00 0.00 0.00 6 500.00 0.00 0.00 7 9907.89 6262.79 11750.00 8 10907.90 7326.28 13250.00 9 5665.14 2673.72 6750.00 10 6665.14 3737.21 8250.00
Int Forces and Stresses: elem axial force axial stress 1 102.96 3120.07 2 5995.74 2975.55 3 5125.72 2543.78 4 4076.53 2023.09 5 4946.56 2454.87 6 12715.30 4504.18 7 7521.91 2664.51 8 12003.30 4251.96 9 8233.91 2916.72 10 7.56 755.95 11 4.92 492.25 12 29.06 2075.88 13 12.31 879.30 14 3427.31 3497.25 15 2610.77 2664.05 16 3731.60 3807.75 17 2306.47 2353.54 18 6192.99 3518.74 19 6343.94 3604.51 20 3644.32 2070.64 21 3493.37 1984.87 22 10850.80 4447.07 23 13042.60 5345.34 24 9184.31 3764.06 25 14709.20 6028.34
Figure E21.6. Transmission tower: computed node displacements, node forces, element forces and stresses. (Output from Mathematica relocated within gure.)
deformed shape mag x250
Figure E21.7. Transmission tower: plots of deformed shape (left) and member stress level (right).
2124
22
221
222
TABLE OF CONTENTS
Page
22.1. Introduction 22.2. Analysis Stages 22.3. Analysis Support Modules 22.3.1. Assembling the Master Stiffness . . . 22.3.2. Modifying the Master Stiffness Equations 22.3.3. Internal Force Recovery . . . . . . 22.3.4. Graphic Modules . . . . . . . 22.4. A Bridge Truss Example 22. Exercises . . . . . . . . . . . . . .
. . . . . . .
. . . . . .
. . . . . . . .
. . . . .
222
22.3
This Chapter presents a complete FEM program for analysis of plane trusses, programmed in Mathematica. The program includes some simple minded graphics, including animation. Exercises 22.2-22.4 discuss a complete FEM program for frame analysis for homework assignments. The description is done in bottom up fashion. That means the basic modules are presented, then the driver program. Graphic modules are provided in posted Notebooks but not explained. 22.2. Analysis Stages As in all FEM programs, the analysis of a structure by the Direct Stiffness Method involves three major stages: (I) preprocessing or model denition, (II) processing, and (III) postprocessing. The preprocessing portion of the plane truss analysis is done by the driver program, which directly sets the data structures. I.1 I.2 II.1 II.2 II.3 Model denition by direct setting of the data structures. Plot of the FEM mesh, including nodes and element labels. Assembly of the master stiffness matrix, with a subordinate element stiffness module. Modication of master stiffness matrix and node force vector for displacement boundary conditions. Solution of the modied equations for displacements. For the programs presented here the built in Mathematica function LinearSolve is used.
Upon executing these three processing steps, the displacements are available The following postprocessing steps may follow: III.1 III.2 III.3 Recovery of forces including reactions, done through a Ku matrix multiplication. Computation of internal (axial) forces in truss members. Plotting deected shapes and member stress levels.
These steps will be demonstrated in class from a laptop computer. 22.3. Analysis Support Modules We begin by listing here the modules that support various analysis steps, and which are put into separate cells for testing convenience. 22.3.1. Assembling the Master Stiffness The function PlaneTrussMasterStiffness, listed in Figure 22.1, assembles the master stiffness matrix of a plane truss. It uses the element stiffness formation module PlaneBar2Stiffness described in the previous Chapter. The statements at the end of the cell test this module by forming and printing K of the example truss. The arguments of PlaneTrussMasterStiffness are 223
224
PlaneTrussMasterStiffness[nodcoor_,elenod_, elemat_,elefab_,eleopt_]:=Module[ {numele=Length[elenod],numnod=Length[nodcoor], e,eNL,eftab,ni,nj,i,j,ncoor,mprop,fprop,opt,Ke,K}, K=Table[0,{2*numnod},{2*numnod}]; For [e=1, e<=numele, e++, eNL=elenod[[e]]; {ni,nj}=eNL; eftab={2*ni-1,2*ni,2*nj-1,2*nj}; ncoor={nodcoor[[ni]],nodcoor[[nj]]}; mprop=elemat[[e]]; fprop=elefab[[e]]; opt=eleopt; Ke=PlaneBar2Stiffness[ncoor,mprop,fprop,opt]; neldof=Length[Ke]; For [i=1, i<=neldof, i++, ii=eftab[[i]]; For [j=i, j<=neldof, j++, jj=eftab[[j]]; K[[jj,ii]]=K[[ii,jj]]+=Ke[[i,j]] ]; ]; ]; Return[K]; ]; PlaneBar2Stiffness[ncoor_,mprop_,fprop_,opt_]:= Module[ {x1,x2,y1,y2,x21,y21,Em,Gm,rho,alpha,A,numer,L,LL,LLL,Ke}, {{x1,y1},{x2,y2}}=ncoor; {x21,y21}={x2-x1,y2-y1}; {Em,Gm,rho,alpha}=mprop; {A}=fprop; {numer}=opt; If [numer,{x21,y21,Em,A}=N[{x21,y21,Em,A}]]; LL=x21^2+y21^2; L=PowerExpand[Sqrt[LL]]; LLL=Simplify[LL*L]; Ke=(Em*A/LLL)*{{ x21*x21, x21*y21,-x21*x21,-x21*y21}, { y21*x21, y21*y21,-y21*x21,-y21*y21}, {-x21*x21,-x21*y21, x21*x21, x21*y21}, {-y21*x21,-y21*y21, y21*x21, y21*y21}}; Return[Ke] ]; nodcoor={{0,0},{10,0},{10,10}}; elenod= {{1,2},{2,3},{1,3}}; elemat= Table[{100,0,0,0},{3}]; elefab= {{1},{1/2},{2*Sqrt[2]}}; eleopt= {True}; K=PlaneTrussMasterStiffness[nodcoor,elenod, elemat,elefab,eleopt]; Print["Master Stiffness of Example Truss:"]; Print[K//MatrixForm];
Figure 22.1. Master stiffness assembly module, with test statements in red.
nodcoor
Nodal coordinates arranged as a two-dimensional list: { { x1,y1 },{ x2,y2 }, . . . { xn,yn } }, where n is the total number of nodes. Element end nodes arranged as a two-dimensional list: { { i1,j1 }, { i2,j2 }, . . . { ie,je } }, where e is the total number of elements. Element material properties arranged as a two-dimensional list: { { Em1,Gm1,rho1,alpha1 }, . . . { Eme,Gme,rhoe,alphae } }, where e is the total number of elements. Only the elastic modulus Em is used in this program. For the other properties zeros may be stored as placeholders.
elenod
elemat
224
225
22.3
ModifiedMasterStiffness[pdof_,K_] := Module[ {i,j,k,n=Length[K],np=Length[pdof],Kmod}, Kmod=K; For [k=1,k<=np,k++, i=pdof[[k]]; For [j=1,j<=n,j++, Kmod[[i,j]]=Kmod[[j,i]]=0]; Kmod[[i,i]]=1 ]; Return[Kmod] ]; ModifiedNodeForces[pdof_,f_] := Module[ {i,k,np=Length[pdof],fmod}, fmod=f; For [k=1,k<=np,k++, i=pdof[[k]]; fmod[[i]]=0]; Return[fmod] ]; K=Array[Kij,{6,6}]; Print["Assembled Master Stiffness:"];Print[K//MatrixForm]; K=ModifiedMasterStiffness[{1,2,4},K]; Print["Master Stiffness Modified For Displacement B.C.:"]; Print[K//MatrixForm]; f=Array[fi,{6}]; Print["Node Force Vector:"]; Print[f]; f=ModifiedNodeForces[{1,2,4},f]; Print["Node Force Vector Modified For Displacement B.C.:"]; Print[f];
Figure 22.2. Modifying the master stiffness and node force vector for displacement boundary conditions, with test statements in red.
elefab
Element fabrication properties arranged as a two-dimensional list: { { A1 }, . . . { Ae } }, where e is the total number of elements, and A the cross section area. Element processing option: set to { True } to tell PlaneBar2Stiffness to carry out element stiffness computations in oating-point arithmetic. Else set to { False } to keep computations in exact arithmetic or symbolic form.
eleopt
The assembler uses the freedom-pointer-table technique described in 3.4 for merging the element stiffness matrix into the master stiffness. The module returns the master stiffness matrix K in list K, which is stored as a full matrix. The statements at the end of Figure 22.1 test this module by forming and printing the master stiffness matrix of the example truss. These statements are executed when the cell is initialized. 22.3.2. Modifying the Master Stiffness Equations Following the assembly process the master stiffness equations Ku = f must be modied to account for displacement boundary conditions. This is done through the computer-oriented equation modication process described in 3.4.2. Modules that perform this operation are listed in Figure 22.2, along with test statements. Module ModifiedMasterStiffness carries out this process for the master stiffness matrix K, whereas ModifiedNodalForces does this for the nodal force vector f. The logic of ModifiedNodalForces is considerably simplied by assuming that all prescribed displacements are zero, that is, the BCs are homogeneous. This is the case in the implementation shown here. Module ModifiedMasterStiffness receives two arguments: 225
226
pdof
A list of the prescribed degrees of freedom identied by their global number. For the example truss of Chapters 2-3 this list would have three entries: {1, 2, 4}, which are the freedom numbers of u x 1 , u y 1 and u y 2 in u. The master stiffness matrix K produced by the assembler module described in the previous subsection.
The module clears appropriate rows and columns of K, places ones on the diagonal, and returns the thus modied K as function value. Note the use of the Mathematica function Length to control loops: np=Length[pdof] sets np to the number of prescribed freedoms. Similarly n=Length[K] sets n to the order of the master stiffness matrix K, which is used to bound the row and column clearing loop. These statements may be placed in the list that declares local variables. Module ModifiedNodalForces has a very similar structure and logic and need not be described in detail. It is important to note, however, that for homogeneous BCs the two module are independent of each other and may be called in any order. On the other hand, if there were nonzero prescribed displacements the force modication must be done before the stiffness modication. This is because stiffness coefcients that are cleared in the latter are needed for modifying the force vector. The test statements at the bottom of Figure 22.2 are chosen to illustrate another feature of Mathematica: the use of the Array function to generate subscripted symbolic arrays of one and two dimensions. The test output should be self explanatory and is not shown here. Both the force vector and its modied form are printed as row vectors to save space. 22.3.3. Internal Force Recovery Module PlaneTrussIntForces listed in Figure 22.3 computes the internal forces (axial forces) in all truss members. The rst ve arguments are the same as for the assembler routine described previously. The last argument, u, contains the computed node displacements arranged as a at, one dimensional list: { ux1, uy1 . . . uxn, uyn } (22.1) PlaneTrussIntForces makes use of PlaneBar2IntForce, which computes the internal force in an individual member. PlaneBar2IntForce is similar in argument sequence and logic to PlaneBar2Stiffness of Figure 22.1. The rst four arguments are identical. The last argument, ue, contains the list of the four element node displacements in the global system. The logic of the recovery module is straightforward and follows the method outlined in 3.2. The statements at the bottom of Figure 22.3 test the internal force recovery for the example truss of Chapters 2-3, a and should return forces of 0,, 1 and 2 2 for members 1, 2 and 3, respectively. 22.3.4. Graphic Modules Graphic modules that support preprocessing are placed in Cells 4A, 4B and 4C of the Mathematica notebook. These plot unlabeled elements, elements and nodes with labels, and boundary conditions. Graphic modules that support postprocessing are placed in Cells 5A and 5B of the Notebook. These plot deformed shapes and axial stress levels in color. These modules are not listed since they are still undergoing modications at the time of this writing. One unresolved problem is to nd a way for absolute placement of supported nodes for correct deected-shape animations. 226
227
22.4
PlaneTrussIntForces[nodcoor_,elenod_,elemat_,elefab_, eleopt_,u_]:= Module[{numele=Length[elenod], numnod=Length[nodcoor],e,eNL,eftab,ni,nj,i, ncoor,mprop,fprop,opt,ue,p}, p=Table[0,{numele}]; ue=Table[0,{4}]; For [e=1, e<=numele, e++, eNL=elenod[[e]]; {ni,nj}=eNL; eftab={2*ni-1,2*ni,2*nj-1,2*nj}; ncoor={nodcoor[[ni]],nodcoor[[nj]]}; mprop=elemat[[e]]; fprop=elefab[[e]]; opt=eleopt; For [i=1,i<=4,i++, ii=eftab[[i]]; ue[[i]]=u[[ii]]]; p[[e]]=PlaneBar2IntForce[ncoor,mprop,fprop,opt,ue] ]; Return[p] ]; PlaneBar2IntForce[ncoor_,mprop_,fprop_,opt_,ue_]:= Module[ {x1,x2,y1,y2,x21,y21,Em,Gm,rho,alpha,A,numer,LL,pe}, {{x1,y1},{x2,y2}}=ncoor; {x21,y21}={x2-x1,y2-y1}; {Em,Gm,rho,alpha}=mprop; {A}=fprop; {numer}=opt; (*If [numer,{x21,y21,Em,A}=N[{x21,y21,Em,A}]];*) LL=x21^2+y21^2; pe=Em*A*(x21*(ue[[3]]-ue[[1]])+y21*(ue[[4]]-ue[[2]]))/LL; Return[pe] ]; nodcoor={{0,0},{10,0},{10,10}}; elenod= {{1,2},{2,3},{1,3}}; elemat= Table[{100,0,0,0},{3}]; elefab= {{1},{1/2},{2*Sqrt[2]}}; eleopt= {True}; u={0,0,0,0,0.4,-0.2}; p=PlaneTrussIntForces[nodcoor,elenod,elemat,elefab,eleopt,u]; Print["Int Forces of Example Truss:"]; Print[p];
Figure 22.3. Calculation of truss internal forces, with test statements in red.
22.4. A Bridge Truss Example The driver program in Cell 6 denes and runs the analysis of the 6-bay bridge truss problem dened in Figure 22.4. This truss has 12 nodes and 17 elements. It is xed at node 1 and on rollers at node 12. The driver is listed in Figures 22.5 and 22.6. It begins by dening the problem through specication of the following data structures: NodeCoordinates Same conguration as nodcoor ElemNodeLists Same conguration as elenod ElemMaterials Same conguration as elemat ElemFabrication Same conguration as elefab. This list is built up from four repeating cross sectional areas: Abot, Atop, Abat and Adia, for the areas of bottom longerons, top longerons, battens and diagonals, respectively. ProcessOptions Same conguration as eleopt FreedomValue. This is a two-dimensional list that species freedom values, node by node. It is initialized to zero on creation, then the value of nonzero applied loads is set at nodes 3, 5, 7, 9 and 11. For example FreedomValue[[7]] = { 0,-16 } species f x 7 = 0 and f y 7 = 16. FreedomTag. This is a two-dimensional list that species, for each nodal freedom, whether the value 227
228
(a)
Elastic modulus E = 1000 Cross section areas of bottom longerons: 2, top longerons: 10, battens: 3, diagonals: 1
10
10
16
10
10
span: 6 bays @ 10 = 60
(b) y
(7)
;; ;;
(13) (18)
(19)
(20)
(21) (17)
(1)
(2)
(3)
(4)
(5)
Figure 22.4. Six-bay bridge truss used as example problem: (a) truss structure showing supports and applied loads; (b) nite element idealization as pin-jointed truss.
of the force (tag 0) or displacement (tag 1) is prescribed. It is initialized to zero on creation, then the support tags at nodes 1 (xed) and 12 (horizontal roller) are set. For example, FreedomTag[[1]] = { 1,1 } says that both node displacement components u x 1 and u y 1 of node 1 are specied. Processing commands are listed in Figure 22.6. The master stiffness matrix is assembled by the module listed in Figure 22.1. The stiffness matrix is placed in K. The applied force vector stored as a one-dimensional list, is placed in f, which results from the application of built-in function Flatten to Freedom Value. The prescribed degree-of-freedom array pdof is constructed by scanning FreedomTag for nonzero values. For this problem pdof={ 1,2,23 }. The displacement boundary conditions are applied by the modules of Figure 22.2, which return the modied master stiffness Kmod and the modied node force vector fmod. Note that the modied stiffness matrix is stored into Kmod rather than K to save the original form of the master stiffness for the recovery of reaction forces later. The complete displacement vector is obtained by the matrix calculation u=LinearSolve[Kmod,fmod] which takes advantage of the built-in linear solver provided by Mathematica. The remaining calculations recover the node vector including reactions by the matrix-vector multiply f = K.u (recall that K contains the unmodied master stiffness matrix). The member internal forces p are obtained through the module listed in Figure 22.3. The program prints u, f and p as row vectors to conserve space. Running the program of Figures 22.56 produces the output shown in Figure 22.7. Output plot results are collected in Figure 22.8. 228 (22.2)
;; ;;
(12)
(8)
4
(14)
(9)
6
(15)
(10)
(11)
(16)
10 11
(6)
12
229
22.4
ClearAll[]; NodeCoordinates={{0,0},{10,5},{10,0},{20,8},{20,0},{30,9}, {30,0},{40,8},{40,0},{50,5},{50,0},{60,0}}; ElemNodeLists= {{1,3},{3,5},{5,7},{7,9},{9,11},{11,12}, {1,2},{2,4},{4,6},{6,8},{8,10},{10,12}, {2,3},{4,5},{6,7},{8,9},{10,11}, {2,5},{4,7},{7,8},{9,10}}; numnod=Length[NodeCoordinates]; numele=Length[ElemNodeLists]; numdof=2*numnod; ElemMaterial= Table[{1000,0,0,0},{numele}]; Abot=2; Atop=10; Abat=3; Adia=1; ElemFabrication=Join[Table[{Abot},{6}],Table[{Atop},{6}], Table[{Abat},{5}],Table[{Adia},{4}]]; ProcessOptions= {True}; aspect=0; PlotLineElements[NodeCoordinates,ElemNodeLists,aspect, "test mesh"]; PlotLineElementsAndNodes[NodeCoordinates,ElemNodeLists,aspect, "test mesh with elem & node labels",{True,0.12},{True,0.05}]; FreedomTag=FreedomValue=Table[{0,0},{numnod}]; FreedomValue[[3]]={0,-10}; FreedomValue[[5]]={0,-10}; FreedomValue[[7]]={0,-16}; FreedomValue[[9]]={0,-10}; FreedomValue[[11]]={0,-10}; Print["Applied node forces="]; Print[FreedomValue]; FreedomTag[[1]]= {1,1}; (* fixed node 1 *) FreedomTag[[numnod]]={0,1}; (* hroller @ node 12 *)
f=Flatten[FreedomValue]; K=PlaneTrussMasterStiffness[NodeCoordinates, ElemNodeLists,ElemMaterial,ElemFabrication,ProcessOptions]; pdof={}; For[n=1,n<=numnod,n++, For[j=1,j<=2,j++, If[FreedomTag[[n,j]]>0, AppendTo[pdof,2*(n-1)+j]]]]; Kmod=ModifiedMasterStiffness[pdof,K]; fmod=ModifiedNodeForces [pdof,f]; u=LinearSolve[Kmod,fmod]; u=Chop[u]; Print["Computed Nodal Displacements:"]; Print[u]; f=Simplify[K.u]; f=Chop[f]; Print["External Node Forces Including Reactions:"]; Print[f]; p=PlaneTrussIntForces[NodeCoordinates,ElemNodeLists, ElemMaterial,ElemFabrication,eleopt,u]; p=Chop[p]; sigma=Table[p[[i]]/ElemFabrication[[i,1]],{i,1,numele}]; Print["Internal Member Forces:"]; Print[p]; PlotTrussDeformedShape[NodeCoordinates,ElemNodeLists,u, 1.0,aspect,"Deformed shape"]; PlotAxialStressLevel[NodeCoordinates,ElemNodeLists,sigma, 1.0,aspect,"Axial stress level"];
Figure 22.6. Driver for analysis of the bridge truss: processing and postprocessing.
229
2210
Applied node forces 0, 0 , 0, 0 , 0, 10 , 0, 0 , 0, 10 , 0, 0 , 0, 16 , 0, 0 , 0, 10 , 0, 0 , 0, 10 , 0, 0 Computed Nodal Displacements: 0, 0, 0.809536, 1.7756, 0.28, 1.79226, 0.899001, 2.29193, 0.56, 2.3166, 0.8475, 2.38594, 0.8475, 2.42194, 0.795999, 2.29193, 1.135, 2.3166, 0.885464, 1.7756, 1.415, 1.79226, 1.695, 0 External Node Forces Including Reactions: 0, 28., 0, 0, 0, 10., 0, 0, 0, 10., 0, 0, 0, 16., 0, 0, 0, 10., 0, 0, 0, 10., 0, 28. Internal Member Forces: 56., 56., 57.5, 57.5, 56., 56., 62.6099, 60.0318, 60.2993, 60.2993, 60.0318, 62.6099, 10., 9.25, 12., 9.25, 10., 1.67705, 3.20156, 3.20156, 1.67705
test mesh
Deformed shape
2210
2211
Homework Exercises for Chapter 22 FEM Programs for Plane Trusses and Frames
EXERCISE 22.1
Exercises
Placeholder.
EXERCISE 22.2 [C:25] Using the PlaneTruss.nb Notebook posted on the web site as guide, complete the PlaneFrame.nb Notebook that implements the analysis of an arbitrary plane frame using the plane beam stiffness presented in Chapter 21. To begin this homework, download the PlaneFrame.nb Notebook le from the web site.
The modication involves selected Cells of the Notebook, as described below. For additional details refer to the Notebook; some of the modications involve only partially lled Modules. Cell 1: Assembler. The element stiffness routine is the beam-column stiffness presented in Chapter 21. This module, called PlaneBeamColumn2Stiffness, is included in Cell 1 of the PlaneFrame.nb notebook linked from the Chapter 22 index.1 In modifying the assembler module, remember that there are three degrees of freedom per node: u xi , u yi and i , not just two. The incomplete assembler is shown in Figure E22.1. The test statements are shown in red after the module. The lower cell shows the test output produced by a correctly completed module. Cell 2: BC Applicator. No modications are necessary. The two modules should work correctly for this problem since they dont assume anything about freedoms per nodes. The same test statements can be kept. Cell 3: Internal Force Recovery. Both modules require modications because the beam has 3 internal forces: (i) the axial force (which is recovered exactly as for bars), (ii) the bending moment m i = E I i at end node i , and (iii) the bending moment m j = E I j at end node j .2 Furthermore the element displacement vector has six degrees of freedom, not just four. Test the modules on a simple beam problem. The incomplete internal force module is shown in Figure E22.2. The test statements are shown in red after the module. The lower cell shows the test output produced by a correctly completed module. Cell 4-5: Graphic Modules. These are now provided ready to use, and should not be touched. Cell 6: Driver Program: use this for Exercise 22.3. Do not touch for this one. As solution to this Exercise return a listing of the completed Cells 1 and 3, along with the output of the test statements for those cells.
EXERCISE 22.3
[C:25] Use the program developed in the previous Exercise to analyze the plane frame shown in Figure E22.3. The frame is xed3 at A, B and C . It is loaded by a downward point load P at G and by a horizontal point P at D . All members have the same cross section a a for simplicity, and the material is the same. load 1 2
1
If you want to extract an individual cell from a Notebook to work on a separate le (a good idea for working on groups) select the cell, then pick SaveSelectionAs -> Plain Text from the Edit menu, give it a le name in the pop-up dialogue box, and save it. Two end moments are required because the beam element used here has linearly varying curvatures and hence moments. To recover the end moments refer to the pertinent equations in Chapter 13. The steps are as follows. For element e y j in the local element system x (e ) , y (e) . Complete these with rotations recover the transverse displacements u yi and u i and j (which do not need to be transformed) to form the 4 1 beam local node displacement vector. Then apply the e) curvature-displacement relation (13.13) at = 1 and = 1 to get the two end curvatures i(e) and ( j , respectively.
(e ) to get the bending moments. Finally multiply those curvatures by E (e) Izz
For a plane frame, a xed condition, also known as clamped condition, means that the x , y displacements and the rotation about z are zero.
2211
2212
Figure E22.1. The incomplete assembler module for Exercise 22.2, with test statements in red. Module PlaneBeamColumn2Stiffness, which goes in the upper portion of the cell is omitted to save space; that module was listed in Figure 21.9. Output cell results are produced by a correct module.
The SI physical units to be used are: mm for lengths, N for forces, and MPa=N/mm2 for elastic moduli. For the calculations use the following numerical data: L = 10,000 mm (10 m), H = 6,000 (6 m), a = 500 mm (0.5 m), P = 4,800 N, E = 35,000 MPa (high strength concrete). The member cross section area is A = a 2 , and the exural moment of inertia about the neutral axis is Izz = a 4 /12. The recommended nite element discretization of two elements per member is shown in Figure E22.4. As solution to this exercise list the driver program you used and the displacement and internal force outputs. The results of primary interest are: 1. 2. 3. The horizontal displacement at D , and the vertical displacement at G (mm). The axial forces (N) in columns AD , B E and C F , with appropriate sign4 . The maximum bending moment (N.mm) over the oor members D E and E F , and the maximum bending moment in the columns AD , B E and C F .5
Provide deformed shape plot (but not the animation) and the frame stress level plots as part of the homework
4 5
Plus for tension, minus for compression The bending moment varies linearly over each element. It should be continuous at all joints except E .
2212
2213
PlaneFrameIntForces[nodcoor_,elenod_,elemat_,elefab_, eleopt_,u_]:= Module[{numele=Length[elenod], numnod=Length[nodcoor],e,eNL,eftab,ni,nj,i, ncoor,mprop,fprop,opt,ue,p}, p=Table[0,{numele}]; ue=Table[0,{6}]; For [e=1, e<=numele, e++, eNL=elenod[[e]]; {ni,nj}=eNL; ncoor={nodcoor[[ni]],nodcoor[[nj]]}; mprop=elemat[[e]]; fprop=elefab[[e]]; opt=eleopt; eftab={3*ni-2,3*ni-1,3*ni,3*nj-2,3*nj-1,3*nj}; For [i=1,i<=6,i++, ii=eftab[[i]]; ue[[i]]=u[[ii]]]; p[[e]]=PlaneBeamColumn2IntForces[ncoor,mprop,fprop,opt,ue] ]; Return[p] ]; PlaneBeamColumn2IntForces[ncoor_,mprop_,fprop_,opt_,ue_]:= Module[{x1,x2,y1,y2,x21,y21,Em,Gm,rho,alpha,A,Izz,num,LL,L, dvy,cv1,cv2,pe=Table[0,{3}]}, {{x1,y1},{x2,y2}}=ncoor; {x21,y21}={x2-x1,y2-y1}; {Em,Gm,rho,alpha}=mprop; {A,Izz}=fprop; {num}=opt; If [num,{x21,y21,Em,A,Izz}=N[{x21,y21,Em,A,Izz}]]; (* missing statements for Exercise 22.2 *) Return[pe] ]; ClearAll[L,Em,A1,A2,Izz1,Izz2,Izz3,uz1,uz2,uz2,uz3]; nodcoor={{0,0},{L,0},{L,L}}; elenod= {{1,2},{2,3},{1,3}}; elemat= Table[{Em,0,0,0},{3}]; elefab= {{A1,Izz1},{A2,Izz2},{A3,Izz3}}; eleopt= {False}; u={0,uy1,0, 0,uy2,0, 0,uy3,0}; p=PlaneFrameIntForces[nodcoor,elenod,elemat,elefab,eleopt,u]; Print["Int Forces of Example Frame:"]; Print[p];
Int Forces of Example Frame: 0, 6 Em Izz1 uy1 uy2 6 Em Izz1 uy1 uy2 A2 Em uy2 uy3 , , , 0, 0 , L2 L2 L uy1 uy3 3 Em Izz3 uy1 uy3 3 Em Izz3 uy1 uy3 , , 2L 2 L2 2 L2
Exercises
A3 Em
Figure E22.2. Figure E22.2. Incomplete element internal force recovery module for Exercise 22.2. Test statements in red. Results in output cell are those produced by a correct module.
results. Note: the Notebook on the web contains some of the actual plots produced by the complete Notebook, to be used as targets. Partial answers for this exercise: Largest vertical displacement: -0.232 mm () at node 4 Largest negative bending moment: 6.8 106 N.mm, at node 5 of element (4) Axial forces: 2651 N over (3) and (4)
EXERCISE 22.4 [D:20] Explain why the solution given by the FEM model of Figure E22.3 is exact for the Bernoulli-Euler bending model; that is, cannot be improved by subdividing each element into more elements.
2213
2214
L /2 P/2
D G
y
E H F H cross section of all members:
a a
x L
P P/2
3
(2) (3) (4)
5
(9)
(5)
(6)
7
(7)
4 2
(1)
6 10
(10)
8
(8)
11
Figure E22.4. Recommended FEM discretization for the plane frame of the previous gure.
2214
Introduction to FEM
22
IFEM Ch 22 Slide 1
Introduction to FEM
The Three Basic Stages of a FEM Program Based on the Direct Stiffness Method
Preprocessing : defining the FEM model Processing :
setting up the stiffness equations and solving for displacements
IFEM Ch 22 Slide 2
Introduction to FEM
Assembler
BC Applicator
Element Stiffness
Presented in Chapter 21
IFEM Ch 22 Slide 3
Introduction to FEM
IFEM Ch 22 Slide 4
Introduction to FEM
IFEM Ch 22 Slide 5
Introduction to FEM
Displacement BC Applicator
ModifiedMasterStiffness[pdof_,K_] := Module[ {i,j,k,n=Length[K],np=Length[pdof],Kmod}, Kmod=K; For [k=1,k<=np,k++, i=pdof[[k]]; For [j=1,j<=n,j++, Kmod[[i,j]]=Kmod[[j,i]]=0]; Kmod[[i,i]]=1 ]; Return[Kmod] ]; ModifiedNodeForces[pdof_,f_] := Module[ {i,k,np=Length[pdof],fmod}, fmod=f; For [k=1,k<=np,k++, i=pdof[[k]]; fmod[[i]]=0]; Return[fmod] ]; K=Array[Kij,{6,6}]; Print["Assembled Master Stiffness:"];Print[K//MatrixForm]; K=ModifiedMasterStiffness[{1,2,4},K]; Print["Master Stiffness Modified For Displacement B.C.:"]; Print[K//MatrixForm]; f=Array[fi,{6}]; Print["Node Force Vector:"]; Print[f]; f=ModifiedNodeForces[{1,2,4},f]; Print["Node Force Vector Modified For Displacement B.C.:"]; Print[f];
Restriction: prescribed displacements must be zero. Else the code for ModifiedNodeForces is more complicated.
IFEM Ch 22 Slide 6
Introduction to FEM
IFEM Ch 22 Slide 7
Introduction to FEM
IFEM Ch 22 Slide 8
Introduction to FEM
10
10
16
10
10
span: 6 bays @ 10 = 60
y
(7)
2 3
(8)
4
(14)
(9)
6
(15)
(10)
(11)
10
(12)
; ;
(1)
(2)
(3)
(5)
IFEM Ch 22 Slide 9
; ;
11
(6)
(13) (18)
(19)
(21) (17)
12
Introduction to FEM
IFEM Ch 22 Slide 10
Introduction to FEM
IFEM Ch 22 Slide 11
Introduction to FEM
FreedomTag=FreedomValue=Table[{0,0},{numnod}]; FreedomValue[[3]]={0,-10}; FreedomValue[[5]]={0,-10}; FreedomValue[[7]]={0,-16}; FreedomValue[[9]]={0,-10}; FreedomValue[[11]]={0,-10}; Print["Applied node forces="]; Print[FreedomValue]; FreedomTag[[1]]= {1,1}; (* fixed node 1 *) FreedomTag[[numnod]]={0,1}; (* hroller @ node 12 *)
IFEM Ch 22 Slide 12
Introduction to FEM
f=Flatten[FreedomValue]; K=PlaneTrussMasterStiffness[NodeCoordinates, ElemNodeLists,ElemMaterial,ElemFabrication,ProcessOptions]; pdof={}; For[n=1,n<=numnod,n++, For[j=1,j<=2,j++, If[FreedomTag[[n,j]]>0, AppendTo[pdof,2*(n-1)+j]]]]; Kmod=ModifiedMasterStiffness[pdof,K]; fmod=ModifiedNodeForces [pdof,f]; u=LinearSolve[Kmod,fmod]; u=Chop[u]; Print["Computed Nodal Displacements:"]; Print[u];
IFEM Ch 22 Slide 13
Introduction to FEM
f=Simplify[K.u]; f=Chop[f]; Print["External Node Forces Including Reactions:"]; Print[f]; p=PlaneTrussIntForces[NodeCoordinates,ElemNodeLists, ElemMaterial,ElemFabrication,eleopt,u]; p=Chop[p]; sigma=Table[p[[i]]/ElemFabrication[[i,1]],{i,1,numele}]; Print["Internal Member Forces:"]; Print[p]; PlotTrussDeformedShape[NodeCoordinates,ElemNodeLists,u, 1.0,aspect,"Deformed shape"]; PlotAxialStressLevel[NodeCoordinates,ElemNodeLists,sigma, 1.0,aspect,"Axial stress level"];
IFEM Ch 22 Slide 14
Introduction to FEM
IFEM Ch 22 Slide 15
Introduction to FEM
IFEM Ch 22 Slide 16
Introduction to FEM
Complete a plane frame assembler module Complete an internal force module for beam-column Test completed code with statements provided in posted Notebook
IFEM Ch 22 Slide 17
Introduction to FEM
Homework Assignment - Ex 22.3 Complete a Plane Frame Program to Analyze this Portal Frame Structure:
P
L /2 P/2
D G
y
E H F H cross section of all members:
a a
x L
IFEM Ch 22 Slide 18
Introduction to FEM
P P/2
3
(2) (3) (4)
5
(9)
(5)
(6)
7
(7)
4 2
(1)
6 10
(10)
8
(8)
11
IFEM Ch 22 Slide 19
23
231
232
TABLE OF CONTENTS
Page
23.1. Introduction 23.2. Bilinear Quadrilateral Stiffness Matrix 23.2.1. Gauss Quadrature Rule Information . 23.2.2. Shape Function Evaluation . . . 23.2.3. Element Stiffness . . . . . . . 23.3. Test of Bilinear Quadrilateral 23.3.1. Test of Rectangular Geometry . . 23.3.2. Test of Trapezoidal Geometry . . . 23.4. *Consistent Node Forces for Body Force Field 23.5. *Recovery of Corner Stresses 23.6. *Quadrilateral Coordinates of Given Point 23. Notes and Bibliography . . . . . . . . . . . . . 23. References . . . . . . . . . . . . . 23. Exercises . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . .
233 233 233 235 235 237 237 238 2310 2310 2312 2312 2313 2314
232
23.2
This Chapter illustrates, through a specic example, the computer implementation of isoparametric quadrilateral elements for the plane stress problem. Triangles, which present some programming quirks, are covered in the next Chapter. The programming example is that of the four-node bilinear quadrilateral. It covers the computation of the element stiffness matrix, the consistent node force vector for a body forces, and stress recovery at selected points. The organization of the computations is typical of isoparametric-element modules in any number of space dimensions. 23.2. Bilinear Quadrilateral Stiffness Matrix We consider here the implementation of the 4-node bilinear quadrilateral for plane stress, depicted in Figure 23.1. The element stiffness matrix of simple one-dimensional elements, such as the ones discussed in Chapters 20 22, can be easily packaged in a simple module. For multidimensional elements, however, it is convenient to break up the implementation into application dependent and application independent modules, as owcharted in Figure 23.2. The application independent modules can be reused in other FEM applications, for example to construct thermal, uid or electromagnetic elements.
4 (x 4 , y 4 ) =1 1 (x 1 , y 1 ) =1 =1 3 (x 3 , y 3 ) =1
2 (x 2 , y 2 )
For the bilinear quadrilateral stiffness computations, the separation of Figure 23.2 is done by dividing the work into three modules: Quad4IsoPMembraneStiffness. Computes the element stiffness matrix Ke of a four-node isoparametric quadrilateral element in plane stress. QuadGuassRuleInfo. Returns two-dimensional Gauss quadrature formula of product type. Quad4IsoPShapeFunDer. Evaluates the shape functions of a four-node isoparametric quadrilateraland their x/y derivatives, at a specic point. These modules are described in further detail in the following subsections, in a bottom up fashion. 23.2.1. Gauss Quadrature Rule Information Recall from 17.3 that Gauss quadrature rules for isoparametric quadrilateral elements have the canonical form
1 1 1 1
F(, ) d d =
1 1
1 1
. F(, ) d =
p1
p2
wi w j F(i , j ).
i =1 j =1
(23.1)
Here F = h BT EB J is the matrix to be integrated, whereas p1 and p2 are the number of Gauss points in the and directions, respectively. Often, but not always, the same number p = p1 = p2 is chosen in both directions. A formula with p1 = p2 is called an isotropic integration rule because directions and are treated alike. 233
234
QuadGaussRuleInfo is an application independent module that implements the two-dimensional product Gauss rules with 1 through 5 points in each direction. The number of points in each direction may be the same or different. Usage of this module was described in detail in 17.3.4. For the readers convenience it is listed, along with its subordinate module LineGaussRuleInfo, in Figure 23.3. This module is classied as application independent since it can reused for any quadrilateral element.
APPLICATION INDEPENDENT
Figure 23.2. Separation of element stiffness modules into application-dependent and application-independent levels.
QuadGaussRuleInfo[{rule_,numer_},point_]:= Module[ { ,,p1,p2,i,j,w1,w2,m,info={{Null,Null},0}}, If [Length[rule]==2, {p1,p2}=rule, p1=p2=rule]; If [p1<0, Return[QuadNonProductGaussRuleInfo[ {-p1,numer},point]]]; If [Length[point]==2, {i,j}=point, m=point; j=Floor[(m-1)/p1]+1; i=m-p1*(j-1) ]; { ,w1}= LineGaussRuleInfo[{p1,numer},i]; {,w2}= LineGaussRuleInfo[{p2,numer},j]; info={{ ,},w1*w2}; If [numer, Return[N[info]], Return[Simplify[info]]]; ]; LineGaussRuleInfo[{rule_,numer_},point_]:= Module[ {g2={-1,1}/Sqrt[3],w3={5/9,8/9,5/9}, g3={-Sqrt[3/5],0,Sqrt[3/5]}, w4={(1/2)-Sqrt[5/6]/6, (1/2)+Sqrt[5/6]/6, (1/2)+Sqrt[5/6]/6, (1/2)-Sqrt[5/6]/6}, g4={-Sqrt[(3+2*Sqrt[6/5])/7],-Sqrt[(3-2*Sqrt[6/5])/7], Sqrt[(3-2*Sqrt[6/5])/7], Sqrt[(3+2*Sqrt[6/5])/7]}, g5={-Sqrt[5+2*Sqrt[10/7]],-Sqrt[5-2*Sqrt[10/7]],0, Sqrt[5-2*Sqrt[10/7]], Sqrt[5+2*Sqrt[10/7]]}/3, w5={322-13*Sqrt[70],322+13*Sqrt[70],512, 322+13*Sqrt[70],322-13*Sqrt[70]}/900, i=point,p=rule,info={{Null,Null},0}}, If [p==1, info={0,2}]; If [p==2, info={g2[[i]],1}]; If [p==3, info={g3[[i]],w3[[i]]}]; If [p==4, info={g4[[i]],w4[[i]]}]; If [p==5, info={g5[[i]],w5[[i]]}]; If [numer, Return[N[info]], Return[Simplify[info]]]; ];
Figure 23.3. Module to get Gauss-product quadrature information for a quadrilateral.
234
235
23.2
Quad4IsoPShapeFunDer[ncoor_,qcoor_]:= Module[ {Nf,dNx,dNy,dN ,dN,i,J11,J12,J21,J22,Jdet, ,,x,y}, { ,}=qcoor; Nf={(1- )*(1-),(1+ )*(1-),(1+ )*(1+),(1- )*(1+)}/4; dN ={-(1-), (1-),(1+),-(1+)}/4; dN= {-(1- ),-(1+ ),(1+ ), (1- )}/4; x=Table[ncoor[[i,1]],{i,4}]; y=Table[ncoor[[i,2]],{i,4}]; J11=dN .x; J12=dN .y; J21=dN.x; J22=dN.y; Jdet=Simplify[J11*J22-J12*J21]; dNx= ( J22*dN -J12*dN)/Jdet; dNx=Simplify[dNx]; dNy= (-J21*dN +J11*dN)/Jdet; dNy=Simplify[dNy]; Return[{Nf,dNx,dNy,Jdet}] ];
Figure 23.4. Shape function module for 4-node bilinear quadrilateral.
23.2.2. Shape Function Evaluation Quad4IsoPShapeFunDer is an application independent module that computes the shape functions Nie , i = 1, 2, 3, 4 and its x - y partial derivatives at the sample integration points. The logic, listed in Figure 23.4, is straightforward and follows closely the description of Chapter 17. The arguments of the module are the {x , y } quadrilateral corner coordinates, which are passed in ncoor, and the two quadrilateral coordinates {, }, which are passed in qcoor. The former have the same conguration as described for the element stiffness module below. The quadrilateral coordinates dene the element location at which the shape functions and their derivatives are to be evaluated. For the stiffness formation these are Gauss points, but for strain and stress computations these may be other points, such as corner nodes. Quad4IsoPShapeFunDer returns the two-level list { Nf,Nx,Ny,Jdet }, in which the rst three are 4-entry lists. List Nf collects the shape function values, Nx the shape function x -derivatives, Ny the shape function y -derivatives, and Jdet is the Jacobian determinant called J in Chapters 17. 23.2.3. Element Stiffness Module Quad4IsoPMembraneStiffness computes the stiffness matrix of a four-noded isoparametric quadrilateral element in plane stress. The module conguration is typical of isoparametric elements in any number of dimensions. It follows closely the procedure outlined in Chapter 17. The module logic is listed in Figure 23.5. The statements at the bottom of the module box (not shown in that Figure) test it for specic congurations. The module is invoked as Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,th,options] The arguments are: ncoor Quadrilateral node coordinates arranged in two-dimensional list form: { { x1,y1 },{ x2,y2 },{ x3,y3 },{ x4,y4 } }. 235 (23.2)
236
Quad4IsoPMembraneStiffness[ncoor_,Emat_,th_,options_]:= Module[{i,k,p=2,numer=False,h=th,qcoor,c,w,Nf, dNx,dNy,Jdet,Be,Ke=Table[0,{8},{8}]}, If [Length[options]==2, {numer,p}=options,{numer}=options]; If [p<1||p>4, Print["p out of range"]; Return[Null]]; For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}=Quad4IsoPShapeFunDer[ncoor,qcoor]; If [Length[th]==4, h=th.Nf]; c=w*Jdet*h; Be={Flatten[Table[{dNx[[i]], 0},{i,4}]], Flatten[Table[{0, dNy[[i]]},{i,4}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,4}]]}; Ke+=Simplify[c*Transpose[Be].(Emat.Be)]; ]; Return[Simplify[Ke]] ];
Figure 23.5. Element stiffness formation module for 4-node bilinear quadrilateral.
Emat
A two-dimensional list storing the 3 3 plane stress matrix of elastic moduli: E= E 11 E 12 E 13 E 12 E 22 E 23 E 13 E 23 E 33 (23.3)
arranged as { { E11,E12,E33 },{ E12,E22,E23 },{ E13,E23,E33 } }. This matrix must be symmetric. If the material is isotropic with elastic modulus E and Poissons ratio , it reduces to E E= 1 2 th 1 0 1 0 0 0 1 ( 1 ) 2 (23.4)
The plate thickness specied either as a four-entry list: { h1,h2,h3,h4 } or as a scalar: h. The rst form is used to specify an element of variable thickness, in which case the entries are the four corner thicknesses and h is interpolated bilinearly. The second form species uniform thickness.
options
Processing options. This list may contain two items: { numer,p } or one: { numer }. numer is a logical ag with value True or False. If True, the computations are done in oating point arithmetic. For symbolic or exact arithmetic work set numer to False.1 p species the Gauss product rule to have p points in each direction. p may be 1 through 4. For rank sufciency, p must be 2 or higher. If p is 1 the element will be rank decient by two.2 If omitted p = 2 is assumed.
The reason for this option is speed. A symbolic or exact computation can take orders of magnitude more time than a oating-point evaluation. This becomes more pronounced as elements get more complicated. The rank of an element stiffness is discussed in Chapter 19.
236
237
23.3
(a)
a
(b)
a
2a
2a
The module returns Ke as an 8 8 symmetric matrix pertaining to the following arrangement of nodal displacements: ue = [ u x 1 u y1 ux2 u y2 ux3 u y3 ux4 u y 4 ]T . (23.5)
23.3. Test of Bilinear Quadrilateral The stiffness module is tested on the two quadrilateral geometries shown in Figure 23.6. Both elements have unit thickness and isotropic material. The left one is a rectangle of base 2a and height a . The right one is a right trapezoid with base 2a , top width a and height a . The two geometries will be used to illustrate the effect of the numerical integration rule. 23.3.1. Test of Rectangular Geometry The script listed in Figure 23.7 computes and displays the stiffness of the rectangular element shown in Figure 23.6(a). This is a rectangle of base 2a and height a . The plate has unit thickness and isotropic material with E = 96 and = 1/3, giving the stress-strain constitutive matrix E= 108 36 0 36 108 0 0 0 36 (23.6)
(23.7)
Note that the rectangle dimension a does not appear in (23.7). This is a general property: the stiffness matrix of plane stress elements is independent of in-plane dimension scalings. This follows from the fact that entries of the strain-displacement matrix B have dimensions 1/ L , where L denotes a 237
238
ClearAll[Em,nu,a,b,e,h,p,numer]; h=1; Em=96; nu=1/3; (* isotropic material *) Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; ncoor={{0,0},{2*a,0},{2*a,a},{0,a}}; (* 2:1 rectangular geometry *) p=2;(* 2 x 2 Gauss rule *)numer=False;(* exact symbolic arithmetic *) Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,h,{numer,p}]; Ke=Simplify[Chop[Ke]]; Print["Ke=",Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]];
Figure 23.7. Driver for stiffness calculation of rectangular element of Figure 23.6(a) for 2 2 Gauss rule.
characteristic inplane length. Consequently entries of BT B have dimension 1/ L 2 . Integration over the element area cancels out L 2 . Using a higher order Gauss integration rule, such as 3 3 and 4 4, reproduces exactly (23.7). This is a property characteristic of the rectangular geometry, since in that case the entries of B vary linearly in and , and J is constant. Therefore the integrand h BT E B J is at most quadratic in and , and 2 Gauss points in each direction sufce to compute the integral exactly. Using a 1 1 rule yields a rank-deciency matrix, a result illustrated in detail in 23.2.2. The stiffness matrix (23.7) has the eigenvalues [ 223.64 90 78 46.3603 42 0 0 0] (23.8)
This veries that Ke has the correct rank of ve (8 total DOFs minus 3 rigid body modes). 23.3.2. Test of Trapezoidal Geometry
ClearAll[Em,nu,h,a,p]; h=1; Em=48*63*13*107; nu=1/3; Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; ncoor={{0,0},{2*a,0},{a,a},{0,a}}; For [p=1,p<=4,p++, Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,h,{True,p}]; Ke=Rationalize[Ke,0.0000001]; Print["Ke=",Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]] ];
Figure 23.8. Driver for stiffness calculation of trapezoidal element of Figure 23.6(b) for four Gauss integration rules.
The trapezoidal element geometry of Figure 23.6(b) is used to illustrate the effect of changing the p p Gauss integration rule. Unlike the rectangular case, the element stiffness keeps changing as p is varied from 1 to 4. The element is rank sufcient, however, for p 2 in agreement with the analysis of Chapter 19. The computations are driven with the script shown in Figure 23.8. The value of p is changed in a loop. The ag numer is set to True to use oating-point computation for speed (see Remark 23.1). The computed entries of Ke are transformed to the nearest rational number (exact integers in this case) using the built-in function Rationalize. The strange value of E = 48 63 13 107 = 4206384, 238
239
in conjunction with = 1/3, makes all entries of Ke exact integers when computed with the rst 4 Gauss rules. This device facilitates visual comparison between the computed stiffness matrices: 1840293 1051596 262899 262899 1840293 1051596 262899 262899
1051596 262899 262899 Ke 11 = 1840293 1051596 3417687 262899 1314495 1051596 3417687 262899 1314495 262899 1051596 525798 262899 262899 1051596 525798 1314495 525798 1051596 262899 1314495 525798 1051596 1051596 262899 262899 1840293 1051596 262899 262899 3417687 262899 1314495 1051596 3417687 262899 1314495 262899 262899 1051596 525798 262899 262899 1051596 525798 262899 1314495 525798 1051596 262899 1314495 525798 1051596 1092042 3761478 303345 970704 970704 2730105 182007 2002077 1093326 3764046 304629 968136 968136 2724969 179439 2007213 1093365 3764124 304668 968058 968058 2724813 179361 2007369 485352 303345 1274049 485352 182007 182007 606690 606690 489632 304629 1278329 484068 190567 179439 598130 609258 489762 304668 1278459 484029 190827 179361 597870 609336 303345 970704 485352 1395387 182007 2002077 606690 364014 304629 968136 484068 1397955 179439 2007213 609258 358878 304668 968058 484029 1398033 179361 2007369 609336 358722 1395387 970704 182007 182007 2730105 1213380 1152711 424683 1386827 968136 190567 179439 2747225 1218516 1169831 429819 1386567 968058 190827 179361 2747745 1218672 1170351 429975 970704 2730105 182007 2002077 1213380 4792851 424683 60669 968136 2724969 179439 2007213 1218516 4803123 429819 70941 968058 2724813 179361 2007369 1218672 4803435 429975 71253 182007 182007 606690 606690 1152711 424683 1941408 364014 190567 179439 598130 609258 1169831 429819 1958528 358878 190827 179361 597870 609336 1170351 429975 1959048 358722 182007 2002077 606690 364014 424683 60669 364014 2426760 179439 2007213 609258 358878 429819 70941 358878 2437032 179361 2007369 609336 358722 429975 71253 358722 2437344 (23.9)
Ke 22
2062746 1092042 485352 303345 = 1395387 970704 182007 182007 2067026 1093326 489632 304629 = 1386827 968136 190567 179439 2067156 1093365 489762 304668 = 1386567 968058 190827 179361
(23.10)
Ke 33
(23.11)
Ke 44
(23.12)
As can be seen entries change substantially in going from p = 1 to p = 2, then more slowly. The eigenvalues of these matrices are:
Rule 11 22 33 44 Eigenvalues (scaled by 106 ) of Ke 8.77276 8.90944 8.91237 8.91246 3.68059 4.09769 4.11571 4.11627 2.26900 3.18565 3.19925 3.19966 0 2.64521 2.66438 2.66496 0 1.54678 1.56155 1.56199 0 0 0 0 0 0 0 0 0 0 0 0
(23.13)
The stiffness matrix computed by the one-point rule is rank decient by two. The eigenvalues do not change appreciably after p = 2. Because the nonzero eigenvalues measure the internal energy taken up by the element in deformation eigenmodes, it can be seen that raising the order of the integration makes the element stiffer. 239
2310
Quad4IsoPMembraneBodyForces[ncoor_,rho_,th_,options_,bfor_]:= Module[{i,k,p=2,numer=False,h=th, bx,by,bx1,by1,bx2,by2,bx3,by3,bx4,by4,bxc,byc,qcoor, c,w,Nf,dNx,dNy,Jdet,B,qctab,fe=Table[0,{8}]}, If [Length[options]==2, {numer,p}=options, {numer}=options]; If [Length[bfor]==2,{bx,by}=bfor;bx1=bx2=bx3=bx4=bx;by1=by2=by3=by4=by]; If [Length[bfor]==4,{{bx1,by1},{bx2,by2},{bx3,by3},{bx4,by4}}=bfor]; If [p<1||p>4, Print["p out of range"]; Return[Null]]; bxc={bx1,bx2,bx3,bx4}; byc={by1,by2,by3,by4}; For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}=Quad4IsoPShapeFunDer[ncoor,qcoor]; bx=Nf.bxc; by=Nf.byc; If [Length[th]==4, h=th.Nf]; c=w*Jdet*h; bk=Flatten[Table[{Nf[[i]]*bx,Nf[[i]]*by},{i,4}]]; fe+=c*bk; ]; Return[fe] ];
Figure 23.9. Module for computation of consistent node forces from a given body force eld.
Remark 23.1.
The formation of the trapezoidal element stiffness using oating-point computation by setting numer=True took 0.017, 0.083, 0.15 and 0.25 seconds for p = 1, 2, 3, 4, respectively, on a Mac G4/867. Changing numer=False to do exact computation increases the formation time to 0.033, 1.7, 4.4 and 44.6 seconds, respectively. (The unusually large value for p = 4 is due to the time spent in the simplication of the highly complex exact expressions produced by the Gauss quadrature rule.) This underscores the speed advantage of using oating-point arithmetic when exact symbolic and algebraic calculations are not required. 23.4.
The module Quad4IsoPMembraneBodyForces listed in Figure 23.9 computes the consistent force associated with a body force eld b = {bx , b y } given over a 4-node iso-P quadrilateral in plane stress. The eld is specied per unit of volume in componentwise form. For example if the element is subjected to a gravity acceleration eld (self-weight) in the y direction, bx = 0 and b y = g , where is the mass density. The arguments of the module are are exactly the same as for Quad4IsoPMembraneStiffness except for the following differences. mprop bfor Not used; retained as placeholder. Body forces per unit volume. Specied as a two-item one-dimensional list: { bx,by }, or as a four-entry two-dimensional list: { bx1,by1 },{ bx2,by2 }, { bx3,by3 },{ bx4,by4 }. In the rst form the body force eld is taken to be constant over the element. The second form assumes body forces to vary over the element and specied by values at the four corners, from which the eld is interpolated bilinearly.
The module returns fe as an 8 1 one dimensional array arranged { fx1,fy1,fx2,fy2,fx3,fy3, fx4,fy4 } to represent the vector fe = [ f x 1 f y1 fx2 f y2 fx3 f y3 fx4 f y 4 ]T . (23.14)
2310
2311
23.5
Quad4IsoPMembraneStresses[ncoor_,Emat_,th_,options_,udis_]:= Module[{i,k,numer=False,qcoor,Nf, dNx,dNy,Jdet,Be,qctab,ue=udis,sige=Table[0,{4},{3}]}, qctab={{-1,-1},{1,-1},{1,1},{-1,1}}; numer=options[[1]]; If [Length[udis]==4, ue=Flatten[udis]]; For [k=1, k<=Length[sige], k++, qcoor=qctab[[k]]; If [numer, qcoor=N[qcoor]]; {Nf,dNx,dNy,Jdet}=Quad4IsoPShapeFunDer[ncoor,qcoor]; Be={ Flatten[Table[{dNx[[i]], 0},{i,4}]], Flatten[Table[{0, dNy[[i]]},{i,4}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,4}]]}; sige[[k]]=Emat.(Be.ue); ]; Return[sige] ];
Figure 23.10. Module for calculation of corner stresses.
23.5.
Akthough the subject of stress recovery is treated in further detail in a later chapter, for completeness a stress computation module called Quad4IsoPMembraneStresses for the 4-node quad is listed in Figure 23.10. The arguments of the module are are exactly the same as for Quad4IsoPMembraneStiffness except for the following differences. fprop udis Not used; retained as placeholder. The 8 corner displacements components. these may be specied as a 8-entry onedimensional list form: { ux1,uy1, ux2,uy2, ux3,uy3, ux4,uy4 }, or as a 4-entry two-dimensional list: { ux1,uy1 },{ ux2,uy2 },{ ux3,uy3 },{ ux4,uy4 }.
The module returns the corner stresses stored in a 4-entry, two-dimensional list: { { sigxx1,sigyy1,sigxy1 },{ sigxx2,sigyy2,sigxy2 }, { sigxx3,sigyy3,sigxy3 }, { sigxx4,sigyy4,sigxy4 } } to represent the stress array e = x x 1 yy 1 x y 1 x x 2 yy 2 x y 2 x x 3 yy 3 x y 3 x x 4 yy 4 x y 4 (23.15)
The stresses are directly evaluated at the corner points without invoking any smoothing procedure. A more elaborated recovery scheme is presented in a later Chapter.
2311
2312
23.6.
The following inverse problem arises in some applications. Given a 4-node quadrilateral, dened by the Cartesian coordinates {xi , yi } of its corners, and an arbitrary point P (x P , y P ), nd the quadrilateral coordinates P , P of P . In answering this question it is understood that the quadrilateral coordinates can be extended outside the element, as illustrated in Figure 23.11. The governing equations are x P = x1 N1 + x2 N2 + x3 N3 + x4 N4 and y P = y1 N1 + y2 N2 + y3 N3 + (1 P )(1 P ), etc. These y4 N4 , where N1 = 1 4 bilinear equations are to be solved for { P , P }. Elimination of say, P , leads to a quadratic equation in P : a 2 P + b P + c = 0. It can be shown that b2 4ac so there are two real roots: 1 and 2 . These can be back substituted to get 1 and 2 . Of the two solutions: {1 , 1 } and {2 , 2 } the one closest to = 0, = 0 is to be taken.
=1
4
=1
=1
P(?,?)
2 1
=1
Figure 23.11. Quadrilateral coordinates can be extended outside the element to answer the problem posed in 23.6. The six yellow-lled circles identify the four corners plus the intersections of the opposite sides. This six-point set denes the so-called complete quadrilateral, which is important in projective geometry. The evolute of the coordinate lines is a parabola.
Although seemingly straightforward, the process is prone to numerical instabilities. For example, if the quadrilateral becomes a rectangle or parallelogram, the quadratic equations degenerate to linear, and one of the roots takes off to . In oating point arithmetic severe cancellation can occur in the other root. A robust numerical algorithm, which works stably for any geometry, is obtained by eliminating and in turn, getting min 3 + b + c = 0 with the stable formula. = b /( b + b2 4ac), the minimum-modulus root of a 2 P P P forming the other quadratic equation, and computing its minimum-modulus root the same way. In addition, x P and y P are referred to the quadrilateral center as coordinate origin. The resulting algorithm can be presented as follows. Given {x1 , y1 , . . . x4 , y4 } and {x P , y P }, compute
xb = x1 x2 + x3 x4 , xce = x1 x2 x3 + x4 , x0 =
1 4 (x1
yb = y1 y2 + y3 y4 , yce = y1 y2 y3 + y4 , y0 =
1 4 ( y1
xcx = x1 + x2 x3 x4 , A=
1 2 (( x 3
ycx = y1 + y2 y3 y4 ,
x1 )( y4 y2 ) (x4 x2 )( y3 y1 )), y P 0 = y P y0 ,
+ y2 + y3 + y4 ), 2c
b = A x P 0 yb + y P 0 xb , ,
2 2J c b b 1
P =
One common application is to nd whether P is inside the quadrilateral: if both P and P are in the range [1, 1] the point is inside, else outside. This occurs, for example, in relating experimental data from given sensor locations4 to an existing FEM mesh. A Mathematica module that implements (23.16) is listed in Figure 23.12.
3 4
See Section 5.6 of [204]. While at Boeing in 1969 the writer had to solve a collocation problem of this nature, although in three dimensions. Pressure data measured at a wind tunnel had to be transported to an independently constructed FEM quadrilateral mesh modeling the wing skin.
2312
2313
23.
References
QuadCoordinatesOfPoint[{{x1_,y1_},{x2_,y2_},{x3_,y3_}, {x4_,y4_}},{x_,y_}]:= Module[{A,J0,J1,J2, xb=x1-x2+x3-x4,yb=y1-y2+y3-y4,xc =x1+x2-x3-x4,yc =y1+y2-y3-y4, xc=x1-x2-x3+x4,yc=y1-y2-y3+y4,b ,b,c ,c, x0=(x1+x2+x3+x4)/4,y0=(y1+y2+y3+y4)/4,dx,dy, ,}, J0=(x3-x1)*(y4-y2)-(x4-x2)*(y3-y1); A=J0/2; J1=(x3-x4)*(y1-y2)-(x1-x2)*(y3-y4); J2=(x2-x3)*(y1-y4)-(x1-x4)*(y2-y3); dx=x-x0; dy=y-y0; b =A-dx*yb+dy*xb; b=-A-dx*yb+dy*xb; c = dx*yc -dy*xc ; c=dx*yc-dy*xc; =2*c /(-Sqrt[b ^2-2*J1*c ]-b ); =2*c/( Sqrt[b^2+2*J2*c]-b); Return[{ ,}]];
Figure 23.12. A Mathematica module that implements the algorithm (23.16).
Notes and Bibliography For an outline of the history of the 4-node quadrilateral, see Notes and Bibliography in Chapter 17. The element is called the Taig quadrilateral in the early FEM literature, recognizing his developer [238]. This paper actually uses the exactly integrated stiffness matrix. Gauss numerical integration for quadrilaterals was advocated by Irons [144,148], who changed the range of the quadrilateral coordinates to [1, +1] to t tabulated Gauss rules. References Referenced items moved to Appendix R.
2313
2314
Quad5IsoPMembraneStiffness[ncoor_,Emat_,th_,options_]:= Module[{i,j,k,p=2,numer=False,h=th,qcoor,c,w,Nf, dNx,dNy,Jdet,B,Ke=Table[0,{10},{10}]}, If [Length[options]==2, {numer,p}=options, {numer}=options]; If [p<1||p>4, Print["p out of range"]; Return[Null]]; For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}=Quad5IsoPShapeFunDer[ncoor,qcoor]; If [Length[th]>0, h=th.Nf]; c=w*Jdet*h; B={ Flatten[Table[{dNx[[i]], 0},{i,5}]], Flatten[Table[{0, dNy[[i]]},{i,5}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,5}]]}; Ke+=Simplify[c*Transpose[B].(Emat.B)]; ]; Return[Ke]; ];
Figure E23.1. Stiffness module for the 5-node bilinear+bubble iso-P quadrilateral.
Quad5IsoPShapeFunDer[ncoor_,qcoor_]:= Module[ {Nf,dNx,dNy,dN ,dN,Nb,dNb ,dNb,J11,J12,J21,J22,Jdet, ,,x,y}, { ,}=qcoor; Nb=(1- ^2)*(1-^2); (* Nb: node-5 "bubble" function *) dNb =2* (^2-1); dNb=2**( ^2-1); Nf= { ((1- )*(1-)-Nb)/4,((1+ )*(1-)-Nb)/4, ((1+ )*(1+)-Nb)/4,((1- )*(1+)-Nb)/4, Nb}; dN ={-(1-+dNb )/4, (1--dNb )/4, (1+-dNb )/4,-(1++dNb )/4, dNb }; dN={-(1- +dNb)/4,-(1+ +dNb)/4, (1+ -dNb)/4, (1- -dNb)/4, dNb}; x=Table[ncoor[[i,1]],{i,5}]; y=Table[ncoor[[i,2]],{i,5}]; J11=dN .x; J12=dN .y; J21=dN.x; J22=dN.y; Jdet=Simplify[J11*J22-J12*J21]; dNx= ( J22*dN -J12*dN)/Jdet; dNx=Simplify[dNx]; dNy= (-J21*dN +J11*dN)/Jdet; dNy=Simplify[dNy]; Return[{Nf,dNx,dNy,Jdet}] ];
Figure E23.2. The shape function module for the 5-node bilinear+bubble iso-P quadrilateral.
Test Quad5IsoPMembraneStiffness for the 2:1 rectangular element studied in 23.3.1, with node 5 placed at the element center. Use Gauss rules 1 1, 2 2 and 3 3. Take E = 9630 = 2880 in lieu of E = 96 to
2314
2315
Exercises
Quad5IsoPMembraneCondStiffness[Ke5_]:= Module[{i,j,k,n,c,Ke=Ke5,Kc=Table[0,{8},{8}]}, For [n=10,n>=9,n--, For [i=1,i<=n-1,i++, c=Ke[[i,n]]/Ke[[n,n]]; For [j=1,j<=i,j++, Ke[[j,i]]=Ke[[i,j]]=Ke[[i,j]]-c*Ke[[n,j]]; ]]]; For [i=1,i<=8,i++, For [j=1,j<=8,j++, Kc[[i,j]]=Ke[[i,j]]]]; Return[Kc] ];
Figure E23.3. A mystery module for Exercise 23.2.
get exact integer entries in Ke for all Gauss rules while keeping = 1/3 and h = 1. Report on which rules give rank sufciency. Partial result: K 22 = 3380 and 3588 for the 2 2 and 3 3 rules, respectively.
EXERCISE 23.2 [D:10] Module Quad5IsoPMembraneCondStiffness in Figure E23.3 is designed to re-
ceive, as only argument, the 10 10 stiffness Ke computed by Quad5IsoPMembraneStiffness, and returns a smaller (8 8) stiffness matrix. State what the function of the module is but do not describe programming details. Repeat Exercise 17.3 for the problem illustrated in Figure E17.4, but with the 5-node bilinear+bubble iso-P quadrilateral as the 2D element that models the plane beam. Skip item (a). Use the modules of Figures E23.13 to do the following. Form the 10 10 stiffness matrix Ke5 using Quad5IsoPMembraneStiffness with p = 2 and numer=False. Insert this Ke5 into Quad5IsoPMembraneCondStiffness, which returns a 8 8 stiffness Ke. Stick this Ke into equations (E17.6) and (E17.7) to get Uquad . Show that the energy ratio is r= 2 (1 + ) 2 + 2 (1 ) Uquad = . Ubeam ( 1 + 2 )2 (E23.1)
EXERCISE 23.3 [C:20]
Compare this to the energy ratio (E17.8) for = 1/10 and = 0 to conclude that shear locking has not been eliminated, or even mitigated, by the injection of the bubble shape functions associated with the interior node.5
EXERCISE 23.4 [C:25] Implement the 9-node biquadratic quadrilateral element for plane stress to get its
18 18 stiffness matrix. Follow the style of Figures 23.34 or E23.12. (The Gauss quadrature module may be reused without change.) Test it for the 2:1 rectangular element studied in 23.3.1, with nodes 58 placed at the side midpoints, and node 9 at the element center. For the elastic modulus take E = 963911557 = 15855840 instead of E = 96, along with = 1/3 and h = 1, so as to get exact integer entries in Ke . Use both 2 2 and 3 3 Gauss integration rules and show that the 2 2 rule produces a rank deciency of 3 in the stiffness. (If the computation with num=False takes too long on a slow PC, set num=True and Rationalize entries as in Figure 23.8.) Partial result: K 11 = 5395390 and 6474468 for the 2 2 and 3 3 rules, respectively.
EXERCISE 23.5 [C:25] An element is said to be distortion insensitive when the discrete solution does not
appreciably change when the mesh is geometrically distorted while keeping the same number of elements, nodes and degrees of freedom. It is distortion sensitive otherwise. A distortion sensitivity test often found in the FEM literature for plane stress quadrilateral elements is pictured in Figure E23.4.
5
Even the addition of an innite number of bubble functions to the 4-node iso-P quadrilateral will not cure shear locking. This bubble futility has been known since the late 1960s. But memories are short. Bubbles have been recently revived by some FEM authors for other application contexts, such as multiscale modeling.
2315
2316
(a)
(b)
(c)
The cantilever beam of span a , height b and narrow rectangular cross section of thickness h depicted in Figure E23.4 is under an applied end moment M . If the material is isotropic with elastic modulus E and Poisson ratio = 0 the end vertical deection given by the Bernoulli-Euler beam theory is vbeam = Ma 2 /(2 E Izz ), where Izz = hb3 /12. This is also the exact solution given by elasticity theory if the surface tractions over the free end section match the beam stress distribution.6 The problem is discretized with two 4-node isoP bilinear quadrilaterals as illustrated in Figure E23.4(b), which show appropiate displacement and force boundary conditions. The mesh distortion is parametrized by the distance e, which denes the slope of interface 3-4. If e = 0 there is no distortion. Obtain the nite element solution for a = 10, b = 2, h = E = M = 1 and e = 0, 1, 2, 3, 5 and record the end deection vquad as the average of the vertical displacements u y 5 and u y 6 . Dene the ratio r (e) = vquad /vbeam and plot g (e) = r (e)/ r (0) as function of e. This function g (e) characterizes the distortion sensitivity. Show that g (e) < 1 as e increases and thus the mesh stiffness further as a result of the distortion. Conclude that the 4-node bilinear element is distortion sensitive.
EXERCISE 23.6 [C:25] Repeat the steps of Exercise 23.5 for the mesh depicted in Figure E23.4(c). The cantilever beam is modeled with two 9-node biquadratic quadrilaterals integrated by the 33 Gauss product rule. It is important to keep the side nodes at the midpoints of the sides, and the center node at the crossing of a . Thus not the medians (that is, the 9-node elements are superparametric). Show that r = 1 for any e < 1 2 only this element is exact for the regular mesh, but it is also distortion insensitive.
This statement would not be true if = 0 since the xed-displacement BC at the cantilever root would preclude the lateral expansion or contraction of the cross section. However, the support condition shown in the models (b) and (c) allow such changes so the results are extendible to nonzero .
;;
b A
y x a
3
M
B
z
Cross section
b h
Figure E23.4. Two-element cantilever model for assessing distortion sensitivity, for Exercise E23.5.
;; ; ; ;; ;; ; ;;
e
4 5 6 7
6 10 11 13 14 12 15
1 2
e
8
2316
2317
Exercises
EXERCISE 23.7 [C:25] Implement the 8-node Serendipity quadrilateral element for plane stress to get its
16 16 stiffness matrix. Call the module Quad8IsoPMembraneStiffness; the subordinate shape-function and Gauss-quadrature-info modules should be called Quad8IsoPShapeFunDer and QuadGaussRuleInfo, respectively. Follow the style of Figures 23.34 for argument sequence and coding schematics. (The Gauss quadrature module may be reused without change.) Test it for the 2:1 rectangular element studied in 23.3.1, with nodes 5, 6, 7, and 8 placed at midpoints of sides 12, 23, 34, and 41, respectively. For elastic modulus take E = 963911557 = 15855840 along with = 1/3 and h = 1. The elastic modulus matrix E that is passed as second argument should be E= 17837820 5945940 0 5945940 17837820 0 0 0 5945940 . (E23.2)
Use both 2 2 and 3 3 Gauss integration rules and show that the 2 2 rule produces a rank deciency of 1 in the stiffness. (If the computation with num=False takes too long on a slow PC, set num=True and Rationalize entries as in Figure 23.8.) Partial results: K 11 = 11561550 and 12024012 for the 2 2 and 3 3 rules, respectively, whereas K 13 = 4954950 and 5021016 for the 2 2 and 3 3 rules, respectively.
2317
Introduction to FEM
23
IFEM Ch 23 Slide 1
Introduction to FEM
2 (x 2 , y 2 )
IFEM Ch 23 Slide 2
Introduction to FEM
APPLICATION INDEPENDENT
IFEM Ch 23 Slide 3
Introduction to FEM
IFEM Ch 23 Slide 4
Introduction to FEM
IFEM Ch 23 Slide 5
Introduction to FEM
IFEM Ch 23 Slide 6
Introduction to FEM
4 a
Rectangle
Right Trapezoid
IFEM Ch 23 Slide 7
Introduction to FEM
ClearAll[Em,nu,a,b,e,h,p,numer]; h=1; Em=96; nu=1/3; (* isotropic material *) Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; ncoor={{0,0},{2*a,0},{2*a,a},{0,a}}; (* 2:1 rectangular geometry *) p=2;(* 2 x 2 Gauss rule *)numer=False;(* exact symbolic arithmetic *) Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,h,{numer,p}]; Ke=Simplify[Chop[Ke]]; Print["Ke=",Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]];
Uniform thickness h = 1, isotropic material with E = 96 and = 1/3. Rectangle dimension a cancels out in forming stiffness.
IFEM Ch 23 Slide 8
Introduction to FEM
Ke
IFEM Ch 23 Slide 9
Introduction to FEM
Strange value of E = 48 x 63 x 13 x 107 = 4206384 is to get exact entries in the stiffness matrix computed by Gauss rules p = 1,2,3,4.
IFEM Ch 23 Slide 10
Introduction to FEM
2 x 2 rule
e K22
485352 303345 1395387 970704 182007 182007 303345 970704 970704 2730105 182007 2002077 1274049 485352 182007 182007 606690 606690 485352 1395387 182007 2002077 606690 364014 182007 182007 2730105 1213380 1152711 424683 182007 2002077 1213380 4792851 424683 60669 606690 606690 1152711 424683 1941408 364014 606690 364014 424683 60669 364014 2426760 489632 304629 1386827 968136 190567 179439 304629 968136 968136 2724969 179439 2007213 1278329 484068 190567 179439 598130 609258 484068 1397955 179439 2007213 609258 358878 190567 179439 2747225 1218516 1169831 429819 179439 2007213 1218516 4803123 429819 70941 598130 609258 1169831 429819 1958528 358878 609258 358878 429819 70941 358878 2437032 489762 304668 1386567 968058 190827 179361 304668 968058 968058 2724813 179361 2007369 1278459 484029 190827 179361 597870 609336 484029 1398033 179361 2007369 609336 358722 190827 179361 2747745 1218672 1170351 429975 179361 2007369 1218672 4803435 429975 71253 597870 609336 1170351 429975 1959048 358722 609336 358722 429975 71253 358722 2437344
3 x 3 rule
e K33
4 x 4 rule
e K4 4
IFEM Ch 23 Slide 11
Introduction to FEM
Rule 11 22 33 44
Eigenvalues (scaled by 106 ) of Ke 8.77276 8.90944 8.91237 8.91246 3.68059 4.09769 4.11571 4.11627 2.26900 3.18565 3.19925 3.19966 0 2.64521 2.66438 2.66496 0 1.54678 1.56155 1.56199 0 0 0 0 0 0 0 0 0 0 0 0
IFEM Ch 23 Slide 12
2318
EXERCISE 23.1 The script to run a 2:1 rectangular geometry with three Gauss rules is shown in Figure E23.5.
ClearAll[Em,nu,a,b,e,h,p,num]; h=1; Em=96*30; nu=1/3; Print["Em=",Em]; (* isotropic material *) Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; ncoor={{0,0},{2*a,0},{2*a,a},{0,a},{a,a/2}}; (* 2:1 rectangular geometry *) For [p=1,p<=3,p++, Ke=Quad5IsoPMembraneStiffness[ncoor,{Emat,0,0},{h},{False,p}]; Ke=Simplify[Ke]; Print["Ke=",Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]] ];
Figure E23.5. Driver to get stiffness of 5-node plane stress quadrilateral for 3 integration rules.
945 540 135 0 945 540 135 0 0 0 1755 0 1485 540 1755 0 1485 0 0 540 135 0 945 540 135 0 945 540 0 0 0 1485 540 1755 0 1485 540 1755 0 0 0 945 540 135 0 0 0 945 540 135 Ke = 0 1485 540 1755 0 1485 0 0 540 1755 135 0 945 540 135 0 945 540 0 0 0 1485 540 1755 0 1485 540 1755 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
(E23.3)
The eigenvalues are: [ 6709.19 2700 1390.81 0 0 0 0 0 0 0 ]. This shows a rank deciency of four.7 The stiffness matrix given by the 2 2 rule is
1820 1020 380 0 1020 3380 0 1940 380 0 1820 1020 0 1940 1020 3380 110 0 70 60 Ke = 0 1030 60 130 110 0 70 60 0 1030 60 130
70 60 110 0 60 130 0 1030 110 0 70 60 0 1030 60 130 1820 1020 380 0 1020 3380 0 1940 380 0 1820 1020 0 1940 1020 3380 2240 960 2240 960 2240 960 2240 960 960 4160 960 4160 960 4160 960 4160
(E23.4)
The eigenvalues are: [ 21033. 11692.7 6709.19 2700 1847.31 1390.81 1026.96 0 0 0 ] The stiffness is rank sufcient.
7 e Note that the contribution of the bubble shape function N5 = (1 2 )(1 2 ) is not captured by the 1 1 rule because e all derivatives of N5 at the element center, which is the Gauss sample point, vanish. As a result the last two rows and columns of Ke , which are associated with the displacements of the interior node 5, are null.
2318
2319
The stiffness matrix given by the 3 3 rule is
Solutions to Exercises
1932 1020 492 0 1020 3588 0 2148 492 0 1932 1020 0 2148 1020 3588 42 60 222 0 e K = 78 0 822 60 222 0 42 60 0 822 60 78
42 60 222 0 60 78 0 822 222 0 42 60 0 822 60 78 1932 1020 492 0 1020 3588 0 2148 492 0 1932 1020 0 2148 1020 3588 2688 960 2688 960 2688 960 2688 960 960 4992 960 4992 960 4992 960 4992
(E23.5)
Eigenvalues: [ 25152.9 13840.7 6709.19 2700. 1939.33 1390.81 1067.14 0 0 0 ]. This stiffness is exact since the next (4 4) rule gives the same answer.
EXERCISE 23.2 Module Quad5IsoPMembraneCondStiffness eliminates the two degrees of freedom: u x 5 and u y 5 associated with the internal node 5, using static condensation (Chapter 10), and returns the 8 8 stiffness associated with the 4 external nodes. This can be done because 5 is an internal node, which cannot be connected to another element. EXERCISE 23.3 Not assigned EXERCISE 23.4 The module that implements the shape functions of the 9-node iso-P quadrilateral is listed
in Figure E23.6.
Quad9IsoPShapeFunDer[ncoor_,qcoor_]:= Module[ {Nf,dNx,dNy,dN,dN,J11,J12,J21,J22,Jdet,,,x,y}, {,}=qcoor; Nf= {(1-)**(1-)*/4, -(1+)**(1-)*/4, (1+)**(1+)*/4, -(1-)**(1+)*/4, -(1-^2)*(1-)*/2, (1+)**(1-^2)/2, (1-^2)*(1+)*/2, -(1-)**(1-^2)/2, (1-^2)*(1-^2)}; dN={(1-2*)**(1-)/4,-(1+2*)**(1-)/4, (1+2*)**(1+)/4,-(1-2*)**(1+)/4, **(1-), (1/2+)*(1-^2), -**(1+),-(1/2-)*(1-^2), 2**(^2-1)}; dN={ *(1-)*(1-2*)/4,-*(1+)*(1-2*)/4, *(1+)*(1+2*)/4,-*(1-)*(1+2*)/4, -(1/2-)*(1-^2), -*(1+)*, (1/2+)*(1-^2), *(1-)*, 2*(^2-1)*}; x=Table[ncoor[[i,1]],{i,9}]; y=Table[ncoor[[i,2]],{i,9}]; J11=dN.x; J21=dN.y; J12=dN.x; J22=dN.y; Jdet=Simplify[J11*J22-J12*J21]; dNx= ( J22*dN-J21*dN)/Jdet; dNx=Simplify[dNx]; dNy= (-J12*dN+J11*dN)/Jdet; dNy=Simplify[dNy]; Return[{Nf,dNx,dNy,Jdet}] ];
Figure E23.6. Shape function module for 9-node plane stress quadrilateral.
2319
2320
The module that implements the element stiffness calculation for the 9-node iso-P plane stress quadrilateral is shown in Figure E23.7.
Quad9IsoPMembraneStiffness[ncoor_,mprop_,fprop_,options_]:= Module[{i,j,k,p=3,numer=False,Emat,th=1,h,qcoor,c,w,Nf, dNx,dNy,Jdet,B,Ke=Table[0,{18},{18}]}, Emat=mprop[[1]]; If [Length[options]==2, {numer,p}=options, {numer}=options]; If [Length[fprop]>0, th=fprop[[1]]]; If [p<1||p>4, Print["p out of range"]; Return[Null]]; For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}=Quad9IsoPShapeFunDer[ncoor,qcoor]; If [Length[th]==0, h=th, h=th.Nf]; c=w*Jdet*h; B={ Flatten[Table[{dNx[[i]], 0},{i,9}]], Flatten[Table[{0, dNy[[i]]},{i,9}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,9}]]}; Ke+=Simplify[c*Transpose[B].(Emat.B)]; ]; Return[Ke]; ];
Figure E23.7. Stiffness module for 9-node plane stress quadrilateral.
The quadrature module QuadGaussRuleInfo listed in Figure 23.3 can be used without change. The script to run a 2:1 rectangular geometry for the 2 2 and 3 3 Gauss rules is listed in Figure E23.8.
ClearAll[Em,nu,a,b,e,h,p,num]; h=1; Em=96*39*11*55*7; nu=1/3; Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; ncoor={{0,0},{2*a,0},{2*a,a},{0,a},{a,0},{2*a,a/2},{a,a}, {0,a/2},{a,a/2}}; (* 2:1 rectangular geometry *) For [p=2, p<=3, p++, (* p x p Gauss rule *) num=True; (* float arithm for speed *) Ke=Quad9IsoPMembraneStiffness[ncoor,{Emat,rho},{h},{num,p}]; Ke=Rationalize[Chop[Ke,.000001]]; Print["Ke=",Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]]];
Figure E23.8. Driver to produce stiffness matrix of 9-node plane stress quadrilateral for two integration rules.
The elastic module is taken to be E = 963911557 to get exact integers for all rules. Only portion of the computed 18 18 matrices are listed below to save space. The upper 6 6 of Ke computed by the 2 2 rule is
The complete Ke matrix has 6 zero eigenvalues and thus a rank deciency of 3.
2320
2321
The upper 6 6 of Ke computed by the 3 3 rule is
Solutions to Exercises
231231 330330 330330 429429 165165 0 0 1354353 6474468 2972970 2972970 12024012 (E23.7) The complete Ke matrix has three zero eigenvalues and is thus rank sufcient. It is also exact; higher degree Gauss rules reproduce the same matrix. 2972970 2972970 12024012 528528 0 e upper 66 of K = 0 2642640 231231 330330 330330 429429 0 2642640 2972970 12024012 0 1354353
EXERCISE 23.5 Not assigned EXERCISE 23.6 Not assigned EXERCISE 23.7 The module that implements the element stiffness calculation for the 8-node iso-P plane
6474468
stress (serendipity) quadrilateral is shown in Figure E23.9. The shape function module is listed in Figure E23.10. The quadrature module QuadGaussRuleInfo listed in Figure 23.3 can be used without change. The script to run a 2:1 rectangular geometry for the 2 2 and 3 3 Gauss rules is listed in Figure E23.11. The elastic module is taken to be E = 963911557 to get exact integers for all rules. Only portion of the computed 18 18 matrices are listed below to save space. The upper 6 6 of Ke computed by the 2 2 rule is
5780775 2312310
The complete Ke matrix has 4 zero eigenvalues and thus a rank deciency of 1. The upper 6 6 of Ke computed by the 3 3 rule is 2312310 5615610 9876867 5021016 0 e . upper 66 of K = 0 11660649 5318313 5615610 2312310 22330308 (E23.9) The complete Ke matrix has three zero eigenvalues and is thus rank sufcient. It is also exact; higher degree Gauss rules reproduce the same matrix.
12024012
2321
2322
Quad8IsoPMembraneStiffness[ncoor_,mprop_,fprop_,options_]:= Module[{i,j,k,kk,p=3,numer=False,Emat,th=1,h,qcoor,c,w,Nf, dNx,dNy,Jdet,B,Ke=Table[0,{16},{16}]}, Emat=mprop[[1]]; If [Length[options]==2, {numer,p}=options, {numer}=options]; If [Length[fprop]>0, th=fprop[[1]]]; Print["p=",p]; If [(p<1||p>4)&&p!=-5&&p!=-8, Print["p out of range"]; Return[Null]]; kk= If [p>0,p^2,Abs[p]]; For [k=1, k<=kk, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}=Quad8IsoPShapeFunDer[ncoor,qcoor]; If [Length[th]==0, h=th, h=th.Nf]; c=w*Jdet*h; B={ Flatten[Table[{dNx[[i]], 0},{i,8}]], Flatten[Table[{0, dNy[[i]]},{i,8}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,8}]]}; Ke+=Simplify[c*Transpose[B].(Emat.B)]; ]; Return[Ke]; ];
Figure E23.10. Shape function module for 8-node plane stress quadrilateral.
ClearAll[Em,nu,a,b,e,h,p,num]; h=1; Em=96*39*11*55*7; nu=1/3; (* isotropic material *) Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; ncoor={{0,0},{2*a,0},{2*a,a},{0,a},{a,0},{2*a,a/2},{a,a}, {0,a/2}}; (* 2:1 rectangular geometry *) For [i=1,i<=2,i++, p={2,3}[[i]]; num=False; Ke=Quad8IsoPMembraneStiffness[ncoor,{Emat,0,0},{h},{num,p}]; Ke=Simplify[Chop[Ke]]; Print["Ke=",Ke//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]]; ];
Figure E23.11.
Driver to produce stiffness matrix of 8-node plane stress quadrilateral for two integration rules.
2322
24
241
242
TABLE OF CONTENTS
Page
24.1. Introduction 24.2. Gauss Quadrature for Triangles 24.2.1. Requirements for Gauss Rules . 24.2.2. Superparametric Triangles . . 24.2.3. Arbitrary Iso-P Triangles . . 24.2.4. Implementation . . . . . . 24.3. Partial Derivative Computation 24.3.1. Triangle Coordinate Partials . 24.3.2. Solving the Jacobian System . . 24.4. The Quadratic Triangle 24.4.1. Shape Function Module . . . 24.4.2. Stiffness Module . . . . . . 24.4.3. Test on Straight-Sided Triangle 24.4.4. Test on Highly Distorted Triangle 24.5. *The Cubic Triangle 24.5.1. *Shape Function Module . . 24.5.2. *Stiffness Module . . . . . 24.5.3. *Test Element . . . . . . 24. Notes and Bibliography . . . . . . . . . . . . 24. References . . . . . . . . . . . 24. Exercises . . . . . . . . . . . .
. . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
243 243 243 244 245 246 246 247 248 249 249 2411 2412 2412 2414 2414 2416 2417 2418 2419 2420
242
This Chapter continues with the computer implementation of two-dimensional nite elements. It covers the programming of isoparametric triangular elements for the plane stress problem. Triangular elements bring two sui generis implementation quirks with respect to quadrilateral elements: (1) The numerical integration rules for triangles are not product of one-dimensional Gauss rules, as in the case of quadrilaterals. They are instead specialized to the triangle geometry. (2) The computation of x - y partial derivatives and the element-of-area scaling by the Jacobian determinant must account for the fact that the triangular coordinates 1 , 2 and 3 do not form an independent set. We deal with these issues in the next two sections. 24.2. Gauss Quadrature for Triangles The numerical integration schemes for quadrilaterals introduced in 17.3 and implemented in 23.2 are built as tensor products of two one-dimensional Gauss formulas. On the other hand, Gauss rules for triangles are not derivable from one-dimensional rules, and must be constructed especially for the triangular geometry. 24.2.1. Requirements for Gauss Rules Gauss quadrature rules for triangles must possess triangular symmetry in the following sense:
If the sample point (1 , 2 , 3 ) is present in a Gauss integration rule with weight w, then all other points obtainable by permuting the three triangular coordinates arbitrarily must appear in that rule, and have the same weight.
(24.1)
This constraint guarantees that the result of the quadrature process will not depend on element node numbering.1 If 1 , 2 , and 3 are different, (24.1) forces six equal-weight sample points to be present in the rule, because 3! = 6. If two triangular coordinates are equal, the six points coalesce to three, and (24.1) forces three equal-weight sample points to be present. Finally, if the three coordinates are equal (which can only happen for the centroid 1 = 2 = 3 = 1/3), the six points coalesce to one.2 Additional requirements for a Gauss rule to be numerically acceptable are:
All sample points must be inside the triangle (or on the triangle boundary) and all weights must be positive.
(24.2)
This is called a positivity condition. It insures that the element internal energy evaluated by numerical quadrature is nonnegative denite.
1 2
It would disconcerting to users, to say the least, to have the FEM solution depend on how nodes are numbered. It follows that the number of sample points in triangle Gauss quadrature rules that satisfy (24.1) must be of the form 6i + 3 j + k , where i and j are nonnegative integers and k is 0 or 1. Consequently there are no rules with 2, 5 or 8 points.
243
244
0.33333
0.33333
0.33333 0.33333
0.10995
0.12594
0.22338
0.13239 0.22500
0.13239
0.10995
0.22338
0.10995
0.12594
0.13239
0.12594
Figure 24.1. Location of sample points (dark circles) of ve Gauss quadrature rules for straight sided (superparametric) 6-node triangles. Weight written to 5 places near each sample point; sample-point circle areas are proportional to weight.
A rule is said to be of degree n if it integrates exactly all polynomials in the triangular coordinates of order n or less when the Jacobian determinant is constant, and there is at least one polynomial of order n + 1 that is not exactly integrated by the rule.
Remark 24.1. The positivity requirement (24.2) is automatically satised in quadrilaterals by using Gauss product
rules, since the points are always inside while weights are positive. Consequently it was not necessary to call attention to it. On the other hand, for triangles there are Gauss rules with as few as 4 points that violate positivity.
24.2.2. Superparametric Triangles We rst consider superparametric straight-sided triangles geometry dened by the three corner nodes. Over such triangles the Jacobian determinant dened below is constant. The ve simplest Gauss rules that satisfy the requirements (24.1) and (24.2) have 1, 3, 3, 6 and 7 points, respectively. The two rules with 3 points differ in the location of the sample points. The ve rules are depicted in Figure 24.1 over 6-node straight-sided triangles; for such triangles to be superparametric the side nodes must be located at the midpoint of the sides. One point rule. The simplest Gauss rule for a triangle has one sample point located at the centroid. For a straight sided triangle, 1 F (1 , 2 , 3 ) d F ( 1 , 1 , 1 ), (24.3) 3 3 3 A e where A is the triangle area A=
e
1 2
1 det x1 y1
1 x2 y2
1 x3 y3
1 2
This rule is illustrated in Figure 24.1(a). It has degree 1, meaning that it integrates exactly up to linear polynomials in {1 , 2 , 3 }. For example, F = 4 1 + 22 3 is exactly integrated by (24.3). 244
245
(a) rule=1
1.0000
(c) rule=3
0.33333 0.33333 0.33333
0.33333
0.33333
(d) rule=6
0.10995 0.22338
(e) rule=7
0.12594 0.13239
0.12594
Figure 24.2. Location of sample points (dark circles) of ve Gauss quadrature rules for curved sided 6-node triangles. Weight written to 5 places near each sample point; sample-point circle areas are proportional to weight.
Three Point Rules. The next two rules in order of simplicity contain three sample points: 1 A F (1 , 2 , 3 ) d
e
1 F( 2 , 1, 1) + 1 F( 1 , 2, 1) + 1 F( 1 , 1 , 2 ). 3 3 6 6 3 6 3 6 3 6 6 3
(24.5)
1 F (1 , 2 , 3 ) d 1 F( 1 , 1 , 0) + 1 F (0, 1 , 1) + 1 F( 1 , 0, 1 ). (24.6) 3 2 2 3 2 2 3 2 2 A e These are depicted in Figures 24.1(b,c). Both rules are of degree 2; that is, they integrate exactly up to quadratic polynomials in the triangular coordinates. For example, the function F = 6 + 1 + 33 + 2 2 2 3 + 31 3 is integrated exactly by either rule. Formula (24.6) is called the midpoint rule. Six and Seven Point Rules. There is a 4-point rule of degree 3, but it has a negative weight and so violates (24.2). There are no symmetric rules with 5 points. The next useful rules have six and seven points. There is a 6-point rule of degree 4 and a 7-point rule of degree 5, which integrate exactly up to quartic and quintic polynomials in {1 , 2 , 3 }, respectively. The 7-point rule includes the centroid as sample point. The abcissas and weights are expressable as rational combinations of square roots of integers and fractions. The expressions are listed in the Mathematica implementation discussed in 24.2.4. The sample point congurations are depicted in Figure 24.1(d,e). 24.2.3. Arbitrary Iso-P Triangles If the triangle has variable metric, as in the curved sided 6-node triangle geometries shown in Figure 24.2, the foregoing formulas need adjustment because the element of area d becomes a function of position. Consider the more general case of an isoparametric element with n nodes and shape functions Ni . In 24.3 it is shown that the differential area element is given by 1 1 1 n n n Ni Ni Ni x x xi i i 1 i =1 2 i =1 3 det (24.7) d = J d 1 d 2 d 3 , J = 1 i = 1 2 n n n Ni Ni Ni yi yi yi 1 i =1 2 i =1 3 i =1 245
246
Here J is the Jacobian determinant, which plays the same role as J in the isoparametric quadrilaterals. If the metric is simply dened by the 3 corners, as in Figure 24.1, the geometry shape functions are N1 = 1 , N2 = 2 and N3 = 3 . Then the foregoing determinant reduces to that of (24.4), and J = A everywhere. But for general (curved) geometries J = J (1 , 2 , 3 ), and the triangle area A cannot be factored out of the integration rules. For example the one point rule becomes F (1 , 2 , 3 ) d
e
J(1 , 1 , 1 ) F( 1 , 1 , 1 ). 3 3 3 3 3 3
(24.8)
(24.9) These can be expressed more compactly by saying that the Gauss integration rule is applied to J F . 24.2.4. Implementation The ve rules pictured in Figures 24.1 and 24.2 are implemented in the module TrigGaussRuleInfo listed in Figure 24.3. The module is invoked as { { zeta1,zeta2,zeta3 },w } = TrigGaussRuleInfo[{ rule,numer },point] (24.10)
The module has three arguments: rule, numer and i. The rst two are grouped in a two-item list. Argument rule, which can be 1, 3, 3, 6 or 7, denes the integration formula as follows. Abs[rule] is the number of sample points. Of the two 3-point choices, if rule is 3 the midpoint rule is picked, else if +3 the 3-interior point rule is chosen. Logical ag numer is set to True or False to request oating-point or exact information, respectively Argument point is the index of the sample point, which may range from 1 through Abs[rule]. The module returns the list {{1 , 2 , 3 }, w}, where 1 , 2 , 3 are the triangular coordinates of the sample point, and w is the integration weight. For example, TrigGaussRuleInfo[{ 3,False },1] returns { { 2/3,1/6,1/6 },1/3 }. If rule is not implemented, the module returns { { Null,Null,Null },0 }. 246
The calculation of Cartesian partial derivatives is illustrated in this section for the 6-node triangle shown in Figure 24.4. The results are applicable, however, to iso-P triangles with any number of nodes. The element geometry is dened by the corner coordinates {xi , yi }, with i = 1, 2, . . . 6. Corners are numbered 1,2,3 in counterclockwise sense. Side nodes are numbered 4,5,6 opposite to corners 3,1,2, respectively. Side nodes may be arbitrarily located within positive Jacobian constraints as discussed in 19.4.2. The triangular coordinates are as usual denoted by 1 , 2 and 3 , which satisfy 1 + 2 + 3 = 1. The quadratic displacement eld {u x (1 , 2 , 3 ), u y (1 , 2 , 3 )} is dened by the 12 node displacements {u xi , u yi }, i = 1, 2, . . . , 6, as per the iso-P quadratic interpolation formula (16.1011). That formula is repeated here for convenience: 1 1 x x 1 y = y1 ux ux1 uy u y1 1 x2 y2 ux2 u y2 1 x3 y3 ux3 u y3 1 x4 y4 ux4 u y4 1 x5 y5 ux5 u y5
3
6 4 1
5 2
1 x6 y6 ux6 u y6
e N1 e N2 e N3 e N4 e N5 e N6
(24.11)
in which the shape functions and their natural derivatives are e 1 (21 1) N1 41 1 0 0 e (2 1) N2 0 42 1 0 NT NT e 2 2 NT N 3 (23 1) 0 0 43 1 = , , = = = NT = 3 , . e 41 2 1 N4 42 2 41 3 0 e 42 N5 42 3 0 43 e 43 N6 43 1 0 41 (24.12) 24.3.1. Triangle Coordinate Partials In this and following sections the superscript e of shape functions will be omitted for brevity. The bulk of the shape function logic is concerned with the computation of the partial derivatives of the shape functions (24.12) with respect to x and y at any point in the element. For this purpose consider a generic scalar function w(1 , 2 , 3 ) that is quadratically interpolated over the triangle by w = w1 N1 + w2 N2 + w3 N3 + w4 N4 + w5 N5 + w6 N6 = [ w1 w2 w3 w4 w5 w6 ] NT . (24.13)
Symbol w may stand for 1, x , y , u x or u y , which are interpolated in the iso-P representation (24.11), or other element-varying quantities such as thickness, temperature, etc. Taking partials of (24.13) with respect to x and y and applying the chain rule twice yields w = x w = y wi Ni = x Ni wi = y wi wi Ni 1 Ni 1 247 Ni 2 Ni 1 + + x 2 x 3 Ni 2 Ni 1 + + y 2 y 3 3 x 3 y , (24.14) ,
248
where all sums are understood to run over i = 1, . . . 6. In matrix form: Ni wi 1 2 3 w 1 x x x x wi Ni . = 2 w 1 2 3 y y y y Ni wi 3 Transposing both sides of (24.15) while exchanging sides yields 1 1 x y 2 2 Ni Ni Ni wi w w = w i i x 1 2 3 x y 3 3 x y Now make w 1, x , y and stack the results row-wise: Ni Ni 1 1 1 1 Ni 1 2 3 x y y x x x N N N xi i xi i x2 y2 = xi i x y 1 2 3 y y 3 3 N N N yi i yi i yi i x y x y 1 2 3
(24.15)
w . y
(24.16)
. (24.17)
But x / x = y / y = 1 and 1/ x = 1/ y = x / y = y / x = 0 because x and y are independent coordinates. It is shown in Remark 24.2 below that, if Ni = 1, the entries of the rst row of the coefcient matrix are equal to a constant C . These entries can be scaled to unity because the rst row of the right-hand side is null. Consequently we arrive at a system of linear equations of order 3 with two right-hand sides: 1 1 1 1 1 x y 0 0 Ni Ni x i Ni 2 2 x x i i 1 2 3 x = (24.18) 1 0 . y N N N 0 1 3 3 yi i yi i yi i 1 2 3 x y 24.3.2. Solving the Jacobian System By analogy with quadrilateral elements, the coefcient matrix of (24.18) will be called the Jacobian matrix and denoted by J. Its determinant scaled by one half is equal to the Jacobian J = 1 det J used 2 in the expression of the area element introduced in 24.2.3. For compactness (24.18) is rewritten 1 1 y 1 1 1 x 0 0 2 2 J P = Jx 1 Jx 2 Jx 3 x = (24.19) 1 0 . y 0 1 Jy 1 Jy 2 Jy 3 3 3 x y If J = 0, solving this system gives 1 1 y x 1 Jy 23 Jx 32 2 2 (24.20) = Jy 31 Jx 13 = P, x y 2J J J y 12 x 21 3 3 x y 248
Ni Ni Ni Jy 23 + Jy 31 + Jy 12 , 1 2 3 Ni Ni Ni Jx 32 + Jx 13 + Jx 21 . 1 2 3
(24.21)
(24.22)
in which the natural derivatives Ni / j can be read off (24.12). Using the 3 2 P matrix dened in (24.20) yields nally the compact form Ni x Ni y = Ni 1 Ni 2 Ni 3 P. (24.23)
Remark 24.2. Here is the proof that each rst row entry of the 3 3 matrix in (24.17) is a numerical constant, say C . Suppose the shape functions are polynomials of order n in the triangular coordinates, and let Z = 1 + 2 + 3 . The completeness identity is
S=
Ni = 1 = c1 Z + c2 Z 2 + . . . cn Z n ,
c1 + c2 + . . . + cn = 1.
(24.24)
where the ci are element dependent scalar coefcients. Differentiating S with respect to the i s and setting Z = 1 yields Ni = c1 + 2c2 Z + c3 Z 3 + . . . (n 1) Z n1 = c1 + 2c2 + 3c3 + . . . + cn 1 3 = 1 + c2 + 2c3 + . . . + (n 2)cn , (24.25) which proves the assertion. For the 3-node linear triangle, S = Z and C = 1. For the 6-node quadratic triangle, S = 2 Z 2 Z and C = 3. For the 10-node cubic triangle, S = 9 Z 3 /2 9 Z 2 /2 + Z and C = 11/2. Because the rst equation in (24.18) is homogeneous, the C s can be scaled to unity. C= Ni = 1 Ni = 2
24.4. The Quadratic Triangle 24.4.1. Shape Function Module We specialize now the results of 24.3 to obtain the stiffness matrix of the 6-node quadratic triangle in plane stress. Taking the dot products of the natural-coordinate partials (24.12) with the node coordinates we obtain the entries of the Jacobian matrix of (24.19):
Jx 1 = x1 (41 1) + 4(x4 2 + x6 3 ), Jx 2 = x2 (42 1) + 4(x5 3 + x4 1 ), Jx 3 = x3 (43 1) + 4(x6 1 + x5 2 ), Jy 1 = y1 (41 1) + 4( y4 2 + y6 3 ), Jy 2 = y2 (42 1) + 4( y5 3 + y4 1 ), Jy 3 = y3 (43 1) + 4( y6 1 + y5 2 ), (24.26)
249
2410
From these J can be constructed, and shape function partials Ni / x and Ni / y explicitly obtained from (24.22). Somewhat simpler expressions, however, result by using the following hierarchical side node coordinates: x4 = x4 1 (x + x2 ), 2 1 y4 = y4 1 ( y + y2 ), 2 1 x5 = x5 1 (x + x3 ), 2 2 y5 = y5 1 ( y + y3 ), 2 2 x6 = x6 1 (x + x1 ), 2 3 y6 = y6 1 ( y + y1 ). 2 3 (24.27)
Geometrically these represent the deviations from midpoint positions; thus for a superparametric element x4 = x5 = x6 = y4 = y5 = y6 = 0. The Jacobian coefcients become Jx 21 = x21 + 4( x4 (1 2 ) + ( x5 x6 )3 ), Jx 13 = x13 + 4( x6 (3 1 ) + ( x4 x5 )2 ), Jy 23 = y23 + 4( y5 (3 2 ) + ( y4 y6 )1 ), (Note that if all midpoint deviations vanish, Jx ji 1 det J = 1 ( J J Jy 12 Jx 13 ) and 2 2 x 21 y 31 P= 1 2J Jx 32 = x32 + 4( x5 (2 3 ) + ( x6 x4 )1 ), Jy 12 = y12 + 4( y4 (2 1 ) + ( y6 y5 )3 ), Jy 31 = y31 + 4( y6 (1 3 ) + ( y5 y4 )2 ). (24.28) = x ji and Jy ji = y ji .) From this one gets J = x32 + 4( x5 (2 3 ) + ( x6 x4 )1 ) x13 + 4( x6 (3 1 ) + ( x4 x5 )2 ) . x21 + 4( x4 (1 2 ) + ( x5 x6 )3 ) (24.29)
and the Cartesian derivatives of the shape functions are (41 1) Jy 23 (42 1) Jy 31 1 NT (43 1) Jy 12 = , x 2 J 4(2 Jy 23 + 1 Jy 31 ) 4(3 Jy 31 + 2 Jy 12 ) 4(1 Jy 12 + 3 Jy 23 ) (41 1) Jx 32 (42 1) Jx 13 1 NT (43 1) Jx 21 = . y 2 J 4(2 Jx 32 + 1 Jx 13 ) 4(3 Jx 13 + 2 Jx 21 ) 4(1 Jx 21 + 3 Jx 32 ) 2410
(24.30)
2411
Figure 24.6. Stiffness matrix module for 6-node plane stress triangle.
A Mathematica shape function module Trig6IsoPShapeFunDer is shown in Figure 24.5. It receives two arguments: ncoor and tcoor. The rst one is the list of {xi , yi } coordinates of the six nodes. The second is the list of three triangular coordinates { 1 , 2 , 3 } of the location at which the shape functions and their Cartesian derivatives are to be computed. The module returns { Nf,dNx,dNy,Jdet } as module value. Here Nf collects the shape function values, dNx and dNy the x and y shape function derivatives, respectively, and Jdet is the determinant of matrix J, equal to 2 J in the notation used here. 24.4.2. Stiffness Module The numerically integrated stiffness matrix is
p
Ke =
e
h BT EB d
i =1
wi F(1i , 2i , 3i ),
where
F(1 , 2 , 3 ) = h BT EB J .
(24.31)
Here p denotes the number of sample points of the Gauss rule being used, wi is the integration weight for the i th sample point, 1i , 2i , 3i are the sample point triangular coordinates and J = 1 det J. This 2 data is provided by TrigGaussRuleInfo. For the 6-node triangle (24.31) is implemented in module Trig6IsoPMembraneStiffness, listed in Figure 24.6. The module is invoked as Ke = Trig6IsoPMembraneStiffness[ncoor,Emat,th,options] The arguments are: ncoor Emat The list of node coordinates arranged as { { x1,y1 },{ x2,y2 }, ... The plane stress elasticity matrix E= E 11 E 12 E 13 E 12 E 22 E 23 E 13 E 23 E 33 (24.33) { x6,y6 } }. (24.32)
arranged as { { E11,E12,E33 },{ E12,E22,E23 },{ E13,E23,E33 } }. th Plate thickness specied as either a scalar h or a six-entry list: { h1,h2,h3,h4,h5,h6 }. 2411
2412
The one-entry form species uniform thickness h. The six-entry form is used to specify an element of variable thickness, in which case the entries are the six node thicknesses and h is interpolated quadratically. options Processing options list. May contain two items: { numer,rule } or one: { numer }. numer is a logical ag. If True, the computations are forced to proceed in oating-point arithmetic. For symbolic or exact arithmetic work set numer to False. rule species the triangle Gauss rule as described in 24.2.4; rule may be 1, 3, 3, 6 or 7. For the 6-node element the three point rules are sufcient to get the correct rank. If omitted rule = 3 is assumed. The module returns Ke as an 12 12 symmetric matrix pertaining to the following arrangement of nodal displacements: ue = [ u x 1 u y 1 u x 2 u y 2 u x 3 u y 3 u x 4 u y 4 u x 5 u y 5 u x 6 u y 6 ]T . 24.4.3. Test on Straight-Sided Triangle The stiffness module of Figure 24.6 is tested on two triangle geometries, one with straight sides and constant metric and one with curved sides and highly variable metric. The straight sided triangle geometry, shown in Figure 24.7, has the corner nodes placed at (0, 0), (6, 2) and (4, 4) with side nodes 4,5,6 at the midpoints of the sides. The element has unit plate thickness. The material is isotropic with E = 288 and = 1/3. The element is tested with the script shown in Figure 24.8. The stiffness matrix Ke is computed by the threeinterior-point Gauss rule, specied as p=3.
3 (4,4) 5 6 2 (6,2) 4 1 (0,0) Figure 24.7. Straight sided 6-node triangle test element.
(24.34)
The computed Ke for integration rules with 3 or more points are identical since those rules are exact for this element if the metric is constant, which is the case here. That stiffness is
54 27 18 0 0 9 72 0 0 0 0 36 27 18 0 0 9 72 0 54 0 18 9 36 0 72 0 216 108 54 36 72 0 18 108 216 36 90 0 72 9 54 36 162 81 0 0 36 36 90 81 378 0 0 0 72 0 0 0 576 216 72 0 72 0 0 216 864 0 216 144 216 144 0 72 0 144 360 144 360 72 288 36 0 0 0 36 432 288 144 0 0 36 144 288 720 0 0 216 144 216 144 0 72 576 216 144 0 0 0 0 36 144 0 360 0 144 0 360 36 72 432 288 288 216 144 864 0 0 576 144 216 36 144 0 0 36 144 288 720 0 144 216 864
(24.35)
The eigenvalues are: [ 1971.66 1416.75 694.82 545.72 367.7 175.23 157.68 57.54 12.899 0 0 0 ] (24.36) The 3 zero eigenvalues pertain to the three independent rigid-body modes. The 9 other ones are positive. Consequently the computed Ke has the correct rank of 9. 2412
2413
24.4.4. Test on Highly Distorted Triangle A highly distorted test geometry places the 3 corners at the vertices of an equilateral triangle: {1/2, 0}, {1/2, 0}, {0, 3/2} whereas the 3 side nodes are located }. The at {0, 1/(2 3)}, {1/2, 1/ 3} and {1/2, 1/ 3 result is that the six nodes lie on a circle of radius 1/ 3, as depicted in Figure 24.9. The element has unit thickness. The material is isotropic with E = 504 and = 0. The stiffness Ke is evaluated for four rank-sufcient rules: 3,-3,6,7, using the script of Figure 24.10.
3 ( 0,
6 (1/2, 1/ 3 )
) 3/2
5 (1/2, 1/ 3 )
1 (1/2,0)
2 (1/2,0)
4 ( 0, 1/(2 3) )
Figure 24.9. Test curved sided quadratic triangle, with the 6 nodes lying on a circle.
ClearAll[Em,,h]; h=1; Em=7*72; =0; h=1; {x1,y1}={-1,0}/2; {x2,y2}={1,0}/2; {x3,y3}={0,Sqrt[3]}/2; {x4,y4}={0,-1/Sqrt[3]}/2; {x5,y5}={1/2,1/Sqrt[3]}; {x6,y6}={-1/2,1/Sqrt[3]}; ncoor= {{x1,y1},{x2,y2},{x3,y3},{x4,y4},{x5,y5},{x6,y6}}; Emat=Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}; For [i=2,i<=5,i++, p={1,-3,3,6,7}[[i]]; Ke=Trig6IsoPMembraneStiffness[ncoor,Emat,h,{True,p}]; Ke=Chop[Simplify[Ke]]; Print["Ke=",SetPrecision[Ke,4]//MatrixForm]; Print["Eigenvalues of Ke=",Chop[Eigenvalues[N[Ke]],.0000001]] ];
Figure 24.10. Script to form Ke for the triangle of Figure 24.9, using four integration rules.
For rule=3 the result (printed to 4 places because of the SetPrecision statement in script) is
344.7 75.00 91.80 21.00 86.60 24.00 124.7 72.00 20.78 36.00 20.78 36.00 75.00 258.1 21.00 84.87 18.00 90.07 96.00 0 36.00 20.78 132.0 103.9 91.80 21.00 344.7 75.00 86.60 24.00 124.7 72.00 20.78 36.00 20.78 36.00 21.00 84.87 75.00 258.1 18.00 90.07 96.00 0 132.0 103.9 36.00 20.78 86.60 18.00 86.60 18.00 214.8 0 41.57 0 41.57 144.0 41.57 144.0 24.00 90.07 24.00 90.07 0 388.0 0 41.57 24.00 83.14 24.00 83.14 124.7 96.00 124.7 96.00 41.57 0 374.1 0 83.14 72.00 83.14 72.00 72.00 0 72.00 0 0 41.57 0 374.1 72.00 166.3 72.00 166.3 20.78 36.00 20.78 132.0 41.57 24.00 83.14 72.00 374.1 0 207.8 0 36.00 20.78 36.00 103.9 144.0 83.14 72.00 166.3 0 374.1 0 41.57 20.78 132.0 20.78 36.00 41.57 24.00 83.14 72.00 207.8 0 374.1 0
36.00 103.9 36.00 20.78 144.0 83.14 72.00 166.3 0 41.57 0 374.1 (24.37)
2413
2414
For rule=-3:
566.4 139.0 129.9 21.00 79.67 8.000 364.9 104.0 205.5 36.00 205.5 28.00
139.0 405.9 21.00 62.93 50.00 113.2 64.00 129.3 36.00 164.0 196.0 288.7
129.9 21.00 566.4 139.0 79.67 8.000 364.9 104.0 205.5 28.00 205.5 36.00
21.00 62.93 139.0 405.9 50.00 113.2 64.00 129.3 196.0 288.7 36.00 164.0
79.67 50.00 79.67 50.00 325.6 0 143.2 0 170.9 176.0 170.9 176.0
8.000 113.2 8.000 113.2 0 646.6 0 226.3 8.000 323.3 8.000 323.3
364.9 64.00 364.9 64.00 143.2 0 632.8 0 120.1 104.0 120.1 104.0
205.5 36.00 205.5 196.0 170.9 8.000 120.1 104.0 521.9 64.00 60.04 0
36.00 164.0 28.00 288.7 176.0 323.3 104.0 0 64.00 595.8 0 180.1
205.5 196.0 205.5 36.00 170.9 8.000 120.1 104.0 60.04 0 521.9 64.00
28.00 288.7 36.00 164.0 176.0 323.3 104.0 0 0 180.1 64.00 595.8 (24.38) 40.61 341.0 29.10 156.6 175.4 398.5 117.2 4.884 0 207.9 69.71 683.3 (24.39)
117.2 182.7 117.2 182.7 0 207.0 0 562.6 117.2 4.884 117.2 4.884
190.2 29.10 273.8 208.6 216.3 7.407 140.2 117.2 602.8 69.71 62.78 0
29.10 156.6 40.61 341.0 175.4 398.5 117.2 4.884 69.71 683.3 0 207.9
273.8 208.6 190.2 29.10 216.3 7.407 140.2 117.2 62.78 0 602.8 69.71
Since the metric of this element is highly distorted near its boundary, the stiffness matrix entries and eigenvalues change signicantly as the integration formulas are advanced from 3 to 6 and 7 points. However as can be seen the matrix remains rank-sufcient.
24.5.
The 10-node cubic triangle, depicted in Figure 24.11, is rarely used as such in applications because of the difculty of combining it with other elements. Nevertheless the derivation of the element modules is instructive as this triangle has other and more productive uses as a generator of more practical elements with drilling rotational degrees of freedom at corners for modeling shells. Such transformations are studied in advanced FEM courses. The geometry of the triangle is dened by the coordinates of the ten nodes. A notational warning: the interior node is labeled as 0 instead of 10 (cf. Figure 24.8) to avoid confusion with notation such as x12 = x1 x2 for coordinate differences.
2414
2415
24.5.1. *Shape Function Module
The shape functions obtained in Exercise 18.1 are N1 = 1 (31 1)(31 2), N2 = 1 (32 1)(32 2), 2 1 2 2 1 9 9 ( 3 1 ) , N7 = 9 (33 1), N3 = 2 3 (33 1)(33 2), N4 = 2 1 2 (31 1), N5 = 2 1 2 (32 1), N6 = 9 2 3 2 2 2 2 3 9 9 N8 = 2 3 1 (33 1), N9 = 2 3 1 (31 1) and N0 = 271 2 3 . Their natural derivatives are
NT 9 = 2 2
0
2 2 22 +32 9
NT 9 = 2 3
(24.41)
As in the case of the 6-node triangle it is convenient to introduce the deviations from thirdpoints and centroid: x4 = x4 1 1 1 ( 2 x + x ) , x = x ( x + 2 x ) , x = x (2x2 +x3 ), 1 2 5 5 1 2 6 6 3 3 3 1 1 x7 = x7 3 (x2 +2x3 ), x8 = x8 3 (2x3 +x1 ), x9 = x9 1 (x3 +2x1 ), x0 = x0 1 (x1 +x2 +x3 ), y4 = y4 1 (2 y1 + y2 ), 3 3 3 1 y5 = y5 3 ( y1 +2 y2 ), y6 = y6 1 ( 2 y + y ) , y 2 3 7 = y7 3 1 1 1 ( y2 +2 y3 ), y8 = y8 3 (2 y3 + y1 ), y9 = y9 3 ( y3 +2 y1 ), 3 and y0 = y0 1 ( y1 + y2 + y3 ). 3
8 9 4 0 5
7 6 2
Using (24.22) and (24.41), the shape function partial derivatives can be worked out to be
2 Jy 23 ( 2 21 + 31 /2) 9 2 2 Jy 31 ( 9 22 + 32 /2) 2 2 Jy 12 ( 9 23 + 33 /2) Jy 31 1 (31 1) + Jy 23 2 (61 1) T N 9 Jy 23 2 (32 1) + Jy 31 1 (62 1) , = x 4J Jy 12 2 (32 1) + Jy 31 3 (62 1) Jy 31 3 (33 1) + Jy 12 2 (63 1) Jy 23 3 (33 1) + Jy 12 1 (63 1) J (3 1) + J (6 1) y 12 1 1 y 23 3 1 6( Jy 12 1 2 + Jy 31 1 3 + Jy 23 2 3 )
2 Jx 32 ( 2 21 + 31 /2) 9 2 2 Jx 13 ( 9 22 + 32 /2) 2 2 Jx 21 ( 9 23 + 33 /2) Jx 13 1 (31 1) + Jx 32 2 (61 1) T N 9 Jx 32 2 (32 1) + Jx 13 1 (62 1) . = y 4J Jx 21 2 (32 1) + Jx 13 3 (62 1) Jx 13 3 (33 1) + Jx 21 2 (63 1) Jx 32 3 (33 1) + Jx 21 1 (63 1) J (3 1) + J (6 1) x 21 1 1 x 32 3 1 6( Jx 21 1 2 + Jx 13 1 3 + Jx 32 2 3 ) (24.42)
where the expressions of the Jacobian coefcients are Jx 21 = x21 + Jx 32 = x32 + Jx 13 = x13 +
9 2
x6 3 (62 1)
+
9 2
+
9 2
x8 1 (63 1) +
x6 2 (132 ) +
x9 1 (131 +63 )3 + 6 x0 2 (3 1 ) ,
2415
2416
y5 (2 (132 +61 )1 ) +
y6 3 (62 1)
+
9 2
+
9 2
y8 1 (63 1) +
y9 1 (131 +63 )3 + 6 y0 2 (3 1 ) .
( Jx 21 Jy 31 Jy 12 Jx 13 ). The shape function module Trig10IsoPShapeFunDer The Jacobian determinant is J = 1 2 that implements these expressions is listed in Figure 24.12. This has the same arguments as Trig6IsoPShapeFunDer. As there Jdet denotes 2 J .
2416
2417
24.5.2. *Stiffness Module Module Trig10IsoPMembraneStiffness, listed in Figure 24.13, implements the computation of the element stiffness matrix of the 10-node cubic plane stress triangle. The module is invoked as Ke = Trig10IsoPMembraneStiffness[ncoor,Emat,th,options] (24.45)
this has the same arguments of the quadratic triangle module invoked in (24.32), with the following changes. The node coordinate list ncoor contains 10 entries: { { x1,y1 },{ x2,y2 },{ x3,y3 }, . . .,{ x9,y9 },{ x0,y0 } }. If the plate thickness varies, th is a list of 10 entries: { h1,h2,h3,h4,. . .,h9,h0 }. The triangle Gauss rule specied in options as { numer,rule } should be 6 or 7 to produce a rank sufcient stiffness. If omitted rule = 6 is assumed. The module returns Ke as an 20 20 symmetric matrix pertaining to the following arrangement of nodal displacements: (24.46) ue = [ u x 1 u y 1 u x 2 u y 2 u x 3 u y 3 u x 4 u y 4 . . . u x 9 u y 9 u x 0 u y 0 ] T .
Remark 24.3. For symbolic work with this element the 7-point rule should be preferred because the exact
expressions of the abcissas and weigths at sample points are simpler than for the 6-point rule, as can be observed in Figure 24.3. This speeds up algebraic simplication. For numerical work the 6-point rule is slightly faster. 24.5.3. *Test Element The stiffness module is tested on the superparametric triangle geometry shown in Figure 24.14, which has been already used for the quadratic triangle. The corner nodes are placed at (0, 0), (6, 2) and (4, 4). The 6 side nodes are located at the thirdpoints of the sides and the interior node at the centroid. The plate has unit thickness. The material is isotropic with E = 1920 and = 0. The script of Figure 24.15 computes Ke using the 7-point Gauss rule and exact arithmetic.
1 (0,0) 9 5 4 3 (4,4) 7 8 0 6 2 (6,2)
The returned stiffness matrix using either 6- or 7-point integration is the same, since for a superparametric element the integrand is quartic in the triangular coordinates. For the given combination of inputs the entries are exact integers:
2417
2418
102 42 42 21 21 315 333 171 153 306 42 42 63 105 351 369 135 117 42 1224 408 210 42 252 180 234 306 42 408 1224 126 294 108 36 378 450 63 210 126 1122 306 99 27 99 27 105 42 294 306 1938 27 171 27 171 351 252 108 99 27 5265 1215 1539 243 369 180 36 27 171 1215 6885 729 891 135 234 378 99 27 1539 729 5265 1215 117 306 450 27 171 243 891 1215 6885 9 1602 990 819 171 81 81 405 405 27 306 2286 459 1179 81 405 405 2025 9 828 468 1611 315 81 81 81 81 27 180 1116 999 2223 81 405 81 405 225 108 36 72 144 810 324 810 324 387 36 108 540 684 324 1134 324 1134 504 108 36 171 99 4050 1620 810 324 828 36 108 189 531 1620 5670 324 1134 0 0 0 0 0 0 486 486 4860 1944 0 0 0 0 0 0 486 2430 1944 6804 9 27 27 9 306 828 2286 468 459 1611 1179 315 81 81 405 81 405 81 2025 81 1215 3483 6885 1701 1701 5265 4779 1215 0 810 162 0 0 162 162 0 0 486 972 486 9 99 63 144 180 0 0 27 225 387 504 828 0 0 180 108 36 108 36 0 0 1116 36 108 36 108 0 0 999 72 540 171 189 0 0 2223 144 684 99 531 0 0 81 810 324 4050 1620 486 486 405 324 1134 1620 5670 486 2430 81 810 324 810 324 4860 1944 405 324 1134 324 1134 1944 6804 729 162 0 162 0 972 0 4779 0 162 0 162 0 972 1215 810 0 162 0 486 486 6885 0 810 0 162 486 2430 0 5265 1215 1296 486 4860 1944 810 1215 6885 486 2592 1944 6804 0 1296 486 5265 1215 972 0 162 486 2592 1215 6885 0 972 486 4860 1944 972 0 12636 2916 2430 1944 6804 0 972 2916 16524 (24.47)
27 9 1602 990 819 171 81 81 405 405 5265 1215 3483 729 162 0 162 0 972 0 The eigenvalues are
[ 26397. 16597. 14937. 12285. 8900.7 7626.2 5417.8 4088.8 3466.8 3046.4 1751.3 1721.4 797.70 551.82 313.22 254.00 28.019 0 0 0 ]
(24.48)
The 3 zero eigenvalues pertain to the three independent rigid-body modes in two dimensions. The 17 other eigenvalues are positive. Consequently the computed Ke has the correct rank of 17.
2418
2419
24. References
ClearAll[Em,,a,b,e,h]; Em=1920; =0; h=1; ncoor={{0,0},{6,2},{4,4}}; x4=(2*x1+x2)/3; x5=(x1+2*x2)/3; y4=(2*y1+y2)/3; y5=(y1+2*y2)/3; x6=(2*x2+x3)/3; x7=(x2+2*x3)/3; y6=(2*y2+y3)/3; y7=(y2+2*y3)/3; x8=(2*x3+x1)/3; x9=(x3+2*x1)/3; y8=(2*y3+y1)/3; y9=(y3+2*y1)/3; x0=(x1+x2+x3)/3; y0=(y1+y2+y3)/3; ncoor= {{x1,y1},{x2,y2},{x3,y3},{x4,y4},{x5,y5},{x6,y6},{x7,y7}, {x8,y8},{x9,y9},{x0,y0}}; Emat=Em/(1-^2)*{{1,,0},{,1,0},{0,0,(1-)/2}}; Ke=Trig10IsoPMembraneStiffness[ncoor,Emat,h,{False,7}]; Ke=Simplify[Ke]; Print[Ke//MatrixForm]; ev=Chop[Eigenvalues[N[Ke]]]; Print["eigs of Ke=",ev];
Notes and Bibliography The 3-node, 6-node and 10-node plane stress triangular elements are generated by complete polynomials in twodimensions. In order of historical appearance: 1. The three-node linear triangle, also known as Constant Strain Triangle (CST) and Turner triangle, was developed as triangular skin panel by Turner, Clough and Martin in 195153 [46,47] using interelement ux assumptions, and published in 1956 [251]. It is not clear when the assumed-displacement derivation, which yields the same stiffness matrix, was done rst. The displacement derivation is mentioned in passing by Clough in [38] and worked out in the theses of Melosh [174] and Wilson [264]. The six-node quadratic triangle, also known as Linear Strain Triangle (LST) and Veubeke triangle, was developed by B. M. Fraeijs de Veubeke in 196263 [277]; published 1965 [99]. The ten-node cubic triangle, also known as Quadratic Strain Triangle (QST), was developed by the writer in 1965; published 1966 [65]. Shape functions for the cubic triangle were presented there but used for plate bending instead of plane stress.
2. 3.
A version of the cubic triangle with freedoms migrated to corners and recombined to produce a drilling rotation at corners, was used in static and dynamic shell analysis in Carrs thesis under Ray Clough [35,42]. The drillingfreedom idea was independently exploited for rectangular and quadrilateral elements, respectively, in the theses of Abu-Ghazaleh [2] and Willam [263], both under Alex Scordelis. A variant of the Willam quadrilateral, developed by Bo Almroth at Lockheed, has survived in the nonlinear shell analysis code STAGS as element 410 [205]. Numerical integration came into FEM by the mid 1960s. Five triangle integration rules were tabulated in the writers thesis [65, pp. 3839]. These were gathered from three sources: two papers by Hammer and Stroud [121,122] and the 1964 Handbook of Mathematical Functions [1, 25.4]. They were adapted to FEM by converting Cartesian abscissas to triangle coordinates. The table has been reproduced in Zienkiewicz book since the second edition [274, Table 8.2] and, with corrections and additions, in the monograph of Strang and Fix [224, p. 184]. The monograph by Stroud [227] contains a comprehensive collection of quadrature formulas for multiple integrals. That book gathers most of the formulas known by 1970, as well as references until that year. (Only a small fraction of Strouds tabulated rules, however, are suitable for FEM work.) The collection has been periodically kept up to date by Cools [4951], who also maintains a dedicated web site: http://www.cs.kuleuven.ac.be/~nines/research/ecf/ecf.html This site provides rule information in 16- and 32-digit accuracy for many geometries and dimensionalities as well as a linked index card of references to source publications. References Referenced items moved to Appendix R.
2419
2420
function module for the 4-node transition iso-P triangular element with only one side node: 4, which is located between 1 and 2. See Figure E24.1. The shape functions are N1 = 1 21 2 , N2 = 2 21 2 , N3 = 3 and N4 = 41 2 . Use the three interior point integration rule=3. Test the element for the geometry of the triangle depicted in Figure 24.7, removing nodes 5 and 6, and with E = 2880, = 1/3 and h = 1. Report results for the stiffness matrix Ke and its 8 eigenvalues. Note: Notebook Trig6Stiffness.nb for the 6-node triangle, posted on the index of Chapter 24, may be used as template in support of this Exercise. Partial results: K 11 = 1980, K 18 = 1440.
4
EXERCISE 24.2 [A/C:5+20] As in the foregoing Exercise, but now write the module for a ve-node triangular transition element that lacks midnode 6 opposite corner 2. Begin by deriving the ve shape functions. EXERCISE 24.3 [A+C:25] Consider the superparametric straight-sided 6-node triangle where side nodes are located at the midpoints. By setting x4 = 1 (x1 + x2 ), x5 = 1 (x2 + x3 ), x3 = 1 (x3 + x1 ), y4 = 1 ( y1 + y2 ), 2 2 2 2 1 1 y5 = 2 ( y2 + y3 ), y3 = 2 ( y3 + y1 ) in (24.26), deduce that
J=
1 +
2 +
3 . (E24.1)
This contradicts publications that, by mistakingly assuming that the results for the linear triangle (Chapter 15) can be extended by analogy, take 1 1 1 J = x1 x2 x3 (E24.2) y1 y2 y3 Show, however, that y23 y32 1 2 J = 2 A = det J = x3 y12 + x1 y23 + x2 y31 , P= (E24.3) y31 x13 2J y x21 12 are the same for both (E24.1) and (E24.2). Thus the mistake has no effect on the computation of derivatives.
EXERCISE 24.4 [A/C:15+15] Consider the superparametric straight-sided 6-node triangle where side nodes are
at the midpoints of the sides and the thickness h is constant. Using the 3-midpoint quadrature rule show that the element stiffness can be expressed in a closed form obtained in 1966 [65]:
T T T Ke = 1 Ah B1 EB1 + B2 EB2 + B3 EB3 3
(E24.4)
in which A is the triangle area and B1 = 1 2A 1 2A 1 2A y32 0 y31 0 y12 0 2 y23 0 2 y32 0 2 y23 0 0 x23 0 x13 0 x21 0 2x32 0 2x23 0 2x32 x23 y32 x13 y31 x21 y12 2x32 2 y23 2x23 2 y32 2x32 2 y23 y23 0 y13 0 y12 0 2 y31 0 2 y31 0 2 y13 0 0 x32 0 x31 0 x21 0 2x13 0 2x13 0 2x31 x32 y23 x31 y13 x21 y12 2x13 2 y31 2x13 2 y31 2x31 2 y13 y23 0 y31 0 y21 0 2 y21 0 2 y12 0 2 y12 0 0 x32 0 x13 0 x12 0 2x12 0 2x21 0 2x21 x32 y23 x13 y31 x12 y21 2x12 2 y21 2x21 2 y12 2x21 2 y12 (E24.5)
B2 =
B3 =
2420
2421
With this form Ke can be computed in approximately 1000 oating-point operations.
24. References
Using next the 3-interior-point quadrature rule, show that the element stiffness can be expressed again as (E24.4) but with B1 = 1 6A 1 6A 1 6A 5 y23 0 y13 0 y21 0 2 y21 + 6 y31 0 2 y32 0 6 y12 + 2 y13 0 0 5x32 0 x31 0 x12 0 2x12 + 6x13 0 2x23 0 6x21 + 2x31 5x32 5 y23 x31 y13 x12 y21 2x12 + 6x13 2 y21 + 6 y31 2x23 2 y32 6x21 + 2x31 6 y12 + 2 y13 y32 0 5 y31 0 y21 0 2 y21 + 6 y23 0 6 y12 + 2 y32 0 2 y13 0 0 x23 0 5x13 0 x12 0 2x12 + 6x32 0 6x21 + 2x23 0 2x31 x23 y32 5x13 5 y31 x12 y21 2x12 + 6x32 2 y21 + 6 y23 6x21 + 2x23 6 y12 + 2 y32 2x31 2 y13
B2 =
y32 0 y13 0 5 y12 0 2 y21 0 6 y31 + 2 y32 0 2 y13 + 6 y23 0 0 x23 0 x31 0 5x21 0 2x12 0 6x13 + 2x23 0 2x31 + 6x32 x23 y32 x31 y13 5x21 5 y12 2x12 2 y21 6x13 + 2x23 6 y31 + 2 y32 2x31 + 6x32 2 y13 + 6 y23 (E24.6) The fact that two very different expressions yield the same Ke explains why sometimes authors rediscover the same element derived with different methods. B3 = Yet another set that produces the correct stiffness is B1 = 1 6A 1 6A 1 6A y23 0 y31 0 y21 0 2 y21 0 2 y12 0 2 y12 0 0 x32 0 x13 0 x12 0 2x12 0 2x21 0 2x21 x32 y23 x13 y31 x12 y21 2x12 2 y21 2x21 2 y12 2x21 2 y12 y32 0 y31 0 y12 0 2 y23 0 2 y32 0 2 y23 0 0 x23 0 x13 0 x21 0 2x32 0 2x23 0 2x32 x23 y32 x13 y31 x21 y12 2x32 2 y23 2x23 2 y32 2x32 2 y23 y23 0 y13 0 y12 0 2 y31 0 2 y31 0 2 y13 0 0 x32 0 x31 0 x21 0 2x13 0 2x13 0 2x31 x32 y23 x31 y13 x21 y12 2x13 2 y31 2x13 2 y31 2x31 2 y13 (E24.7)
B2 =
B3 =
EXERCISE 24.5 [A/C:40] (Research paper level) Characterize the most general form of the Bi (i = 1, 2, 3)
matrices that produce the same stiffness matrix Ke in (E24.4). (Entails solving an algebraic Riccati equation.)
EXERCISE 24.6 [A/C:25]. Derive the 4-node transition triangle by forming the 6-node stiffness and applying
MFCs to eliminate 5 and 6. Prove that this technique only works if sides 13 and 23 are straight with nodes 5 and 6 initially at the midpoint of those sides.
2421
Introduction to FEM
24
IFEM Ch 24 Slide 1
Introduction to FEM
q q
Special Gauss quadrature rules needed Computation of Jacobian and shape function x-y derivatives complicated by having 3 natural coordinates
IFEM Ch 24 Slide 2
Introduction to FEM
F( 1 , 2 , 3 ) d F( 1 , 1 , 1) 3 3 3
e
2
1 1 2 1 1 1 2 1 1 1 2 F( 1 , 2 , 3 ) d 1 3 F( 3 , 6 , 6 ) + 3 F( 6 , 3 , 6 ) + 3 F( 6 , 6 , 3 )
IFEM Ch 24 Slide 3
Introduction to FEM
0.33333
0.33333
0.33333 0.33333
0.10995
0.12594
0.22338
0.13239 0.22500
0.13239
0.10995
0.22338
0.10995
0.12594
0.13239
0.12594
IFEM Ch 24 Slide 4
Introduction to FEM
1
n
Ni xi 2 i =1
n i =1
xi
i =1 n i =1
yi
Ni 2
Ni yi 3
Ni 3
IFEM Ch 24 Slide 5
Introduction to FEM
Midpoint rule
F( 1 , 2 , 3 ) d
1 3
1 1 J( 1 , 1 , 0) F( 2 ,2,0) 2 2
1 1 1 1 1 1 1 1 1 +1 3 J( 0, 2 , 2 ) F( 0 , 2 , 2 ) + 3 J( 2 , 0, 2 ) F( 2 , 0 , 2 )
etc. This can be compactly expressed by saying that the integration rule is applied to J F - pictures on next slide
IFEM Ch 24 Slide 6
Introduction to FEM
The 5 Simplest Gauss Rules Drawn over Arbitrary (Curved Side) Triangles
(number annotated near sample point is the weight)
(a) rule=1
1.0000
(b) rule=3
0.33333
(c) rule=3
0.33333 0.33333 0.33333
0.33333
0.33333
(d) rule=6
0.10995 0.22338
(e) rule=7
0.12594 0.13239
0.12594
IFEM Ch 24 Slide 7
Introduction to FEM
IFEM Ch 24 Slide 8
Introduction to FEM
= defines Gauss rule (1, 3, -3, 6 and 7 implemented) = True or False to get numeric or exact info, resp. = index of Gauss point, ranges from 1 through Abs[rule] abscissa of sample point and weight
IFEM Ch 24 Slide 9
Introduction to FEM
1 x2 y2 u x2 u y2
1 x3 y3 u x3 u y3
1 x4 y4 u x4 u y4
1 x5 y5 u x5 u y5
N 1 1 N2 x6 N3 y6 N 4 u x6 N5 u y6 N6
N4 = 41 2 , N5 = 42 3 , N6 = 43 1 .
IFEM Ch 24 Slide 10
Introduction to FEM
w = [ w1
w2
w3
w4
w5
where w = w( 1 , 2, 3 ) can be any quantity interpolated quadratically over the triangle. Then
w = x w = y
Ni = x Ni wi = y wi
wi wi
Ni 1 Ni 1
Ni 2 Ni 1 + + x 2 x 3 Ni 2 Ni 1 + + y 2 y 3
3 x 3 y
IFEM Ch 24 Slide 11
Introduction to FEM
Ni wi
2
Ni wi
3
1 x 2 x 3 x
1 y 2 y 3 y
= w x w y
IFEM Ch 24 Slide 12
Introduction to FEM
0 = 1 0
IFEM Ch 24 Slide 13
Introduction to FEM
IFEM Ch 24 Slide 14
Introduction to FEM
Plug these in the chain rule to get the x-y partial derivatives of the shape functions, and use these to form the strain-displacement matrix B
IFEM Ch 24 Slide 15
Introduction to FEM
ncoor = x-y node coordinates tcoor = {1 , 2 , 3 } of point at which S.F.s are to be evaluated returns shape functions, x-y derivatives and Jacobian determinant
IFEM Ch 24 Slide 16
Introduction to FEM
IFEM Ch 24 Slide 17
Introduction to FEM
3 ( 0,
) 3/2 5 (1/2, 1/ 3 )
Mathematica test script for left element (superparametric triangle) with E = 288, =1/3 and h = 1
ClearAll[Em, ,a,b,e,h]; h=1; Em=288; =1/3; ncoor={{0,0},{6,2},{4,4},{3,1},{5,3},{2,2}}; Emat=Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}; Print["Emat=",Emat//MatrixForm] Ke=Trig6IsoPMembraneStiffness[ncoor,Emat,h,{False,3}]; Ke=Simplify[Ke]; Print[Chop[Ke]//MatrixForm]; Print["eigs of Ke=",Chop[Eigenvalues[N[Ke]]]];
IFEM Ch 24 Slide 18
Introduction to FEM
54 27 18 0 0 9 72 0 54 0 18 9 36 0 72 27 18 0 216 108 54 36 72 0 0 18 108 216 36 90 0 72 0 9 54 36 162 81 0 0 36 36 90 81 378 0 0 9 72 0 72 0 0 0 576 216 0 72 0 72 0 0 216 864 0 0 216 144 216 144 0 72 0 0 144 360 144 360 72 288 0 36 0 0 0 36 432 288 36 144 0 0 36 144 288 720 0 0 216 144 216 144 0 72 576 216 144 0 0 0 0 36 144 0 360 0 144 0 360 36 72 432 288 288 216 144 864 0 0 576 144 216 36 144 0 0 36 144 288 720 0 144 216 864
IFEM Ch 24 Slide 19
Introduction to FEM
IFEM Ch 24 Slide 20
2422
EXERCISE 24.1
Module Trig4IsoPShapeFunDer, listed in Figure IFEM:IsoTri:g:TrigFourShapeFunctionModule, implements the shape functions of the 4-node transition triangle.
Trig4IsoPShapeFunDer[xycoor_,tcoor_]:= Module[ {1,2,3,x1,x2,x3,x4,y1,y2,y3,y4, Jx1,Jx2,Jx3,Jy1,Jy2,Jy3,Jx21,Jx32,Jx13,Jy12,Jy23,Jy31, Nf,dNx,dNy,Jdet}, {1,2,3}=tcoor; {{x1,y1},{x2,y2},{x3,y3},{x4,y4}}=xycoor; Nf={1-2*1*2,2-2*1*2,3,4*1*2}; Jx1=x1*(1-2*2)-2*x2*2+4*x4*2; Jx2=x2*(1-2*1)-2*x1*1+4*x4*1; Jx3=x3; Jy1=y1*(1-2*2)-2*y2*2+4*y4*2; Jy2=y2*(1-2*1)-2*y1*1+4*y4*1; Jy3=y3; Jx21=Jx2-Jx1; Jx32=Jx3-Jx2; Jx13=Jx1-Jx3; Jy12=Jy1-Jy2; Jy23=Jy2-Jy3; Jy31=Jy3-Jy1; Jdet=Jx21*Jy31-Jy12*Jx13; dNx={Jy23-2*Jy31*1-2*Jy23*2, Jy31-2*Jy31*1-2*Jy23*2, Jy12,4*(Jy31*1+Jy23*2)}/Jdet; dNy={Jx32-2*Jx13*1-2*Jx32*2, Jx13-2*Jx13*1-2*Jx32*2, Jx21,4*(Jx13*1+Jx32*2)}/Jdet; Return[{Nf,dNx,dNy,Jdet}] ];
Module Trig4IsoPMembraneStiffness, listed in Figure E24.3, implements the element stiffness calculation for the 4-node iso-P plane stress transition triangle.
Trig4IsoPMembraneStiffness[ncoor_,mprop_,fprop_,opt_]:= Module[{i,k,l,p=3,numer=False,Emat,th={fprop},h,tcoor,w,c, Nf,dNx,dNy,Jdet,Be,Ke=Table[0,{8},{8}]}, Emat=mprop[[1]]; If [Length[fprop]>0, th=fprop[[1]]]; If [Length[opt]>0, numer=opt[[1]]]; If [Length[opt]>1, p= opt[[2]]]; If [p!=1&&p!=3&&p!=-3&&p!=6&&p!=7, Print["Illegal p"];Return[Null]]; For [k=1, k<=Abs[p], k++, {tcoor,w}= TrigGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}= Trig4IsoPShapeFunDer[ncoor,tcoor]; If [Length[th]==0, h=th, h=th.Nf]; c=w*Jdet*h/2; Be={Flatten[Table[{dNx[[i]], 0},{i,4}]], Flatten[Table[{0, dNy[[i]]},{i,4}]], Flatten[Table[{dNy[[i]],dNx[[i]]},{i,4}]]}; Ke+=c*Transpose[Be].(Emat.Be); ]; Return[Ke] ];
Figure E24.3. Stiffness module for 4-node plane stress transition triangle.
The Gauss integration rule module TrigGaussRuleInfo listed in Figure 24.3 can be used without any change. The test statements listed in Figure E24.4 process the stiffness matrix of the test element.
2422
2423
Solutions to Exercises
ClearAll[Em,nu,a,b,e,h]; h=1; Em=2880; nu=1/3; ncoor={{0,0},{6,2},{4,4},{3,1}}; Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; Ke=Trig4IsoPMembraneStiffness[ncoor,{Emat,0,0},{h},{False,3}]; Ke=Simplify[Ke]; Print[Chop[Ke]//MatrixForm//MatrixForm]; Print["eigs of Ke=",Chop[Eigenvalues[N[Ke]]]];
Figure E24.4. Test statements to compute the stiffness of 4-node transition test triangle.
The computed element stiffness matrix using the 3-interior-point quadrature rule (rule=3) is 1980 630 1260 630 180 00 0 180 Ke = 1080 810 810 1440 2880 1440 1440 2880 Its eigenvalues are [ 14681.3 6503.39 2157.51 1070.91 786.93 0 0 0]. (E24.9)
810 2880 1440 1440 1440 2880 540 720 360 180 360 720 . 810 2160 1080 3780 1080 5040 1080 5760 2160 5040 2160 8640
(E24.8)
The presence of 3 zero eigenvalues conrms that the stiffness matrix (E24.8) is rank sufcient. rank sufcient. The same results are given by quadrature rules with 6 and 7 points, since the metric of the test triangle is constant.
EXERCISE 24.2
Module Trig5IsoPShapeFunDer, listed in Figure E24.2, implements the shape functions of the 5-node transition triangle.
Trig5IsoPShapeFunDer[xycoor_,tcoor_]:= Module[ { 1, 2, 3,x1,x2,x3,x4,x5,y1,y2,y3,y4,y5, Jx1,Jx2,Jx3,Jy1,Jy2,Jy3,Jx21,Jx32,Jx13,Jy12,Jy23,Jy31, Nf,dNx,dNy,Jdet}, { 1, 2, 3}=tcoor; {{x1,y1},{x2,y2},{x3,y3},{x4,y4},{x5,y5}}=xycoor; Nf={ 1-2* 1* 2, 2-2* 1* 2-2* 2* 3, 3-2* 2* 3,4* 1* 2,4* 2* 3}; Jx1=x1-2*x1* 2-2*x2* 2+4*x4* 2; Jx2=x2-2*x1* 1-2*x2* 1+4*x4* 1-2*x2* 3-2*x3* 3+4*x5* 3; Jx3=x3-2*x2* 2-2*x3* 2+4*x5* 2; Jy1=y1-2*y1* 2-2*y2* 2+4*y4* 2; Jy2=y2-2*y1* 1-2*y2* 1+4*y4* 1-2*y2* 3-2*y3* 3+4*y5* 3; Jy3=y3-2*y2* 2-2*y3* 2+4*y5* 2; Jx21=Jx2-Jx1; Jx32=Jx3-Jx2; Jx13=Jx1-Jx3; Jy12=Jy1-Jy2; Jy23=Jy2-Jy3; Jy31=Jy3-Jy1; Jdet=Jx21*Jy31-Jy12*Jx13; dNx={Jy23-2*Jy31* 1-2*Jy23* 2, -2*(Jy12+Jy23)* 2+ Jy31*(1-2* 1-2* 3), Jy12-2*Jy12* 2-2*Jy31* 3, 4*(Jy31* 1+Jy23* 2), 4*(Jy12* 2+Jy31* 3)}/Jdet; dNy={Jx32-2*Jx13* 1-2*Jx32* 2, -2*(Jx21+Jx32)* 2+ Jx13*(1-2* 1-2* 3), Jx21-2*Jx21* 2-2*Jx13* 3, 4*(Jx13* 1+Jx32* 2), 4*(Jx21* 2+Jx13* 3)}/Jdet; Return[{Nf,dNx,dNy,Jdet}] ];
2423
2424
Figure E24.6. Stiffness module for 5-node plane stress transition triangle.
Module Trig5IsoPMembraneStiffness, listed in Figure E24.6, implements the element stiffness calculation for the 5-node iso-P plane stress transition triangle. The Gauss integration rule module TrigGaussRuleInfo listed in Figure 24.3 can be used without any change. The test statements listed in Figure E24.7 process the stiffness matrix of the test element.
ClearAll[Em,nu,a,b,e,h]; h=1; Em=2880; nu=1/3; ncoor={{0,0},{6,2},{4,4},{3,1},{5,3}}; Emat=Em/(1-nu^2)*{{1,nu,0},{nu,1,0},{0,0,(1-nu)/2}}; Print["Emat=",Emat//MatrixForm]; Ke=Trig5IsoPMembraneStiffness[ncoor,{Emat,0,0},{h},{False,3}]; Ke=Simplify[Ke]; Print[Chop[Ke]//MatrixForm//MatrixForm]; Print["eigs of Ke=",Chop[Eigenvalues[N[Ke]]]];;
Figure E24.7. Test statements to compute the stiffness of 5-node transition test triangle.
The computed element stiffness matrix using the 3-interior-point quadrature rule (rule=3) is 630 1260 0 180 810 1080 1440 2880 720 0 0 720 Its eigenvalues are
1440 810 540 360 3060 1710 2160 1440 2880 1440
810 1080 360 900 1710 4500 1440 3600 1440 2880
(E24.10)
(E24.11)
The presence of 3 zero eigenvalues conrms that the stiffness matrix (E24.10) is rank sufcient. The same results are given by quadrature rules with 6 and 7 points, since the metric of the test triangle is constant.
EXERCISE 24.3 Not assigned EXERCISE 24.4 Not assigned EXERCISE 24.5 Not assigned
2424
25
251
252
TABLE OF CONTENTS
Page
25.1. Introduction 25.2. Simplications 25.3. Simplied Assemblers 25.3.1. A Plane Truss Example Structure . 25.3.2. Implementation . . . . . . 25.4. MET Assemblers 25.4.1. A Plane Stress Assembler . . . 25.4.2. Implementation . . . . . . 25.5. MET-VFC Assemblers 25.5.1. Node Freedom Arrangement . . 25.5.2. Node Freedom Signature . . . 25.5.3. The Node Freedom Allocation Table 25.5.4. The Node Freedom Map Table . 25.5.5. The Element Freedom Signature . 25.5.6. The Element Freedom Table . . 25.5.7. A Plane Trussed Frame Structure . 25.5.8. Implementation . . . . . . 25.6. *Handling MultiFreedom Constraints 25. Notes and Bibliography . . . . . . . . . . . . 25. Exercises . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . . . . . . . . . . . . . . . . . .
253 253 254 254 256 257 257 259 2510 2510 2511 2511 2512 2512 2513 2514 2517 2519 2520 2521
252
25.2
SIMPLIFICATIONS
Chapters 20, 23 and 24 dealt with element level operations. Sandwiched between element processing and solution there is the assembly process that constructs the master stiffness equations. Assembler examples for special models were given as recipes in the complete programs of Chapters 21 and 22. In the present chapter assembly will be studied with more generality. The position of the assembler in a DSM-based code for static analysis is sketched in Figure 25.1. In most codes the assembler is implemented as a element library loop driver. This means that instead of forming all elements rst and then assembling, the assembler constructs one element at a time in a loop, and immediately merges it into the master equations. This is the merge loop.
Model definition data: geometry element connectivity material fabrication freedom activity
Assembler
Equation Solver
Some equation solvers apply BCs merge e and solve simultaneously loop K
Element Stiffness Matrices
ELEMENT LIBRARY
Nodal displacements
To postprocessor
Figure 25.1. Role of assembler in FEM program.
Assembly is the most complicated stage of a production nite element program in terms of data ow. The complexity is not due to mathematical operations, which merely involve matrix addition, but interfacing with a large element library. Forming an element requires access to geometry, connectivity, material, and fabrication data. (In nonlinear analysis, to the state as well.) Merge requires access to freedom activity data, as well as knowledge of the sparse matrix format in which K is stored. As illustrated in Figure 25.1, the assembler sits at the crossroads of this data exchange. The coverage of the assembly process for a general FEM implementation is beyond the scope of an introductory course. Instead this Chapter takes advantage of assumptions that lead to coding simplications. This allows the basic aspects to be covered without excessive delay. 25.2. Simplications The assembly process is considerably simplied if the FEM implementation has these properties: All elements are of the same type. For example: all elements are 2-node plane bars. The number and conguration of degrees of freedom at each node is the same. There are no gaps in the node numbering sequence. There are no multifreedom constraints treated by master-slave or Lagrange multiplier methods. The master stiffness matrix is stored as a full symmetric matrix. 253
254
(1) (3) 2 (3,4) (4) 4 (7,8) (2) (5) 3 (5,6)
(a)
E = 3000 and A = 2 for all bars 1 3 (1) (4) (3) 4 4 4 (5)
(b) 1 (1,2) y
2 (2) 3
x
1 (1,2)
assembly
2 (3,4) 3 (5,6)
4 (7,8)
Figure 25.2. Left: Example plane truss structure. (a): model denition; (b) disconnection assembly process. Numbers in parentheses written after node numbers are global DOF numbers.
If the rst four conditions are met the implementation is simpler because the element freedom table described below can be constructed on the y from the element node numbers. The last condition simplies the indexing to access entries of K. 25.3. Simplied Assemblers In this section all simplifying assumptions listed in 25.2 are assumed to hold. This allows us to focus on local-to-global DOF mapping. The process is illustrated on a plane truss structure. 25.3.1. A Plane Truss Example Structure The plane truss shown in Figure 25.2(a) will be used to illustrate the details of the assembly process. The structure has 5 elements, 4 nodes and 8 degrees of freedom. The disconnection-to-assembly process is pictured in Figure 25.2(b). Begin by clearing all entries of the 8 8 master stiffness matrix K to zero, so that we effectively start with the null matrix: 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 4 (25.1) K= 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 8 The numbers written after each row of K are the global DOF numbers. Element (1) joins nodes 1 and 2. The global DOFs of those nodes are 2 1 1 = 1, 2 1 = 1, 2 2 1 = 3 and 2 2 = 4. See Figure 25.2(b). Those four numbers are collected into an array called the element freedom table, or EFT for short. The element stiffness matrix K(1) is listed on 254
255
25.3
SIMPLIFIED ASSEMBLERS
the left below with the EFT entries annotated after the matrix rows. On the right is K upon merging the element stiffness: 1500 0 1500 0 0 1500 0 0 0 1500 0 0 0 0 0 0
1 2 3 4
1500 0 1500 0 0 0 0 0
0 1500 0 0 0 1500 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
1 2 3 4
(25.2)
Element (2) joins nodes 2 and 3. The global DOFs of those nodes are 2 2 1 = 3, 2 2 = 4, 2 3 1 = 5 and 2 3 = 6; thus the EFT is { 3,4,5,6 }. Matrices K(2) and K upon merge are 1500 0 1500 0 0 1500 0 0 0 1500 0 0 0 0 0 0
3 4 5 6
1500 0 1500 0 0 0 0 0
0 0 0 0 0 1500 0 0 0 1500 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
3 4 5 6
(25.3)
Element (3) joins nodes 1 and 4. Its EFT is { 1,2,7,8 }. Matrices K(3) and K upon merge are 768 576 768 576 576 432 576 432 768 576 768 576 576 432 576 432
1 2 7 8
0 0 0 0 0 1500 0 0 0 1500 0 0 0 0 0 0
Element (4) joins nodes 2 and 4. Its EFT is { 3,4,7,8 }. Matrices K(4) 0 0 0 0 0 2000 0 2000 0 0 0 0 0 2000 0 2000
3 4 7 8
1 576 432 2 0 0 0 0 576 7 8 432 (25.4) and K upon merge are 0 0 0 0 0 0 0 0 768 576 0 0 0 0 768 576 0 0 0 0 0 0 0 0 768 576 0 0 0 0 768 576 576 432 0 3 2000 4 0 0 576 7 8 2432 (25.5)
576 1500 0 0 432 0 0 0 0 3000 0 1500 0 0 2000 0 0 1500 0 1500 0 0 0 0 576 0 0 0 432 0 2000 0 255
256
Finally, element (5) joins nodes 3 and 4. Its EFT is { 5,6,7,8 }. Matrices K(5) and K upon merge are 2268 576 1500 0 0 0 768 576 0 0 0 0 576 432 576 432 3000 0 1500 0 0 0 768 576 768 576 5 1500 0 0 0 2000 0 0 0 2000 576 432 576 432 6 0 0 1500 0 2268 576 768 576 5 768 576 768 576 7 0 0 0 0 576 432 576 432 6 576 432 576 432 8 0 7 768 576 0 0 768 576 1536 0 8 576 432 0 2000 576 432 0 2864 (25.6) Since all elements have been processed, (25.6) is the master stiffness before application of boundary conditions.
PlaneTrussMasterStiffness[nodxyz_,elenod_,elemat_,elefab_, eleopt_]:=Module[{numele=Length[elenod],numnod=Length[nodxyz], e,ni,nj,eft,i,j,ii,jj,ncoor,Em,A,options,Ke,K}, K=Table[0,{2*numnod},{2*numnod}]; For [e=1, e<=numele, e++, {ni,nj}=elenod[[e]]; eft={2*ni-1,2*ni,2*nj-1,2*nj}; ncoor={nodxyz[[ni]],nodxyz[[nj]]}; Em=elemat[[e]]; A=elefab[[e]]; options=eleopt; Ke=PlaneBar2Stiffness[ncoor,Em,A,options]; For [i=1, i<=4, i++, ii=eft[[i]]; For [j=i, j<=4, j++, jj=eft[[j]]; K[[jj,ii]]=K[[ii,jj]]+=Ke[[i,j]] ]; ]; ]; Return[K] ];
256
25.4
MET ASSEMBLERS
Figure 25.3 shows a a Mathematica implementation of the assembly process just described. This assembler calls the element stiffness module PlaneBar2Stiffness of Figure 20.2. The assembler is invoked by K = SpaceTrussMasterStiffness[nodxyz,elenod,elemat,elefab,prcopt] (25.7)
The ve arguments: nodxyz, elenod, elemat, elefab, and prcopt have the same function as those described in 21.1.3 for the SpaceTrussMasterStiffness assembler. In fact, comparing the code in Figure 25.3 to that of Figure 21.1, the similarities are obvious. Running the script listed in the top of Figure 25.4 produces the output shown in the bottom of that gure. The master stiffness (25.6) is reproduced. The eigenvalue analysis veries that the assembled stiffness has the correct rank of 8 3 = 5.
4 (7,8) 5(9,10)
25.4. MET Assemblers The next complication occurs when elements of different types are to be assembled, while the number and conguration of degrees of freedom at each node remains the same. This scenario is common in special-purpose programs for analysis of specic problems: plane stress, plate bending, solids. This will be called a multiple-element-type assembler, or MET assembler for short. The only incremental change with respect to the simplest assemblers is that an array of element types, denoted here by eletyp, has to be provided.
y
4
5 in bar (3) quad (2) 1 in 1 bar (4) 1in 5 in (3) (1)
5
(2)
trig (1) 6 in
1(1,2)
(4)
2(3,4)
3(5,6)
assembly
4 (7,8) 5(9,10) 3
4 in
The assembler calls the appropriate element stiffness module according to type, and builds the local to global DOF mapping accordingly. 25.4.1. A Plane Stress Assembler This kind of assembler will be illustrated using the module PlaneStressMasterStiffness. As its name indicates, this is suitable for use in plane stress analysis programs. We make the following assumptions: 1 2 All nodes in the FEM mesh have 2 DOFs, namely the {u x , u y } displacements. There are no node gaps or MFCs. The master stiffness is stored as a full matrix. Element types can be: 2-node bars, 3-node linear triangles, ot 4-node bilinear quadrilaterals. These elements can be freely intermixed. Element types are identied with character strings "Bar2", "Trig3" and "Quad4", respectively. 257
258
As noted above, the chief modication over the simplest assembler is that a different stiffness module is invoked as per type. Returned stiffness matrices are generally of different order; in our case 4 4, 6 6 and 8 8 for the bar, triangle and quadrilateral, respectively. But the construction of the EFT is immediate, since node n maps to global freedoms 2n 1 and 2n . The technique is illustrated with the 4-element, 5-node plane stress structure shown in Figure 25.5. It consists of one triangle, one quadrilateral, and two bars. The assembly process goes as follows. Element (1) is a 3-node triangle with nodes 3, 5 and 4, whence the EFT is { 5,6,9,10,7,8 }. The element stiffness is 500.0 0 500.0 600.0 0 600.0 0 1333.3 400.0 1333.3 400.0 0 500 . 0 400 . 0 2420 . 0 1000 . 0 1920 . 0 600 . 0 = 600.0 1333.3 1000.0 2053.3 400.0 720.0 0 400.0 1920.0 400.0 1920.0 0 600.0 0 600.0 720.0 0 720.0
5 6 9 10 7 8
K(1)
(25.8)
Element (2) is a 4-node quad with nodes 2, 3, 4 and 1, whence the EFT is { 3,4,5,6,7,8,1,2 }. The element stiffness computed with a 2 2 Gauss rule is 420.27 3 850.95 4 164.05 5 549.81 6 K(2) 668.76 7 600.15 8 412.54 1 2000.9 2 (25.9) Element (3) is a 2-node bar with nodes 1 and 4, whence the EFT is { 1,2,7,8 }. The element stiffness is 0 0 0 0 1 0 4000.0 0 4000.0 2 (25.10) K(3) = 0 0 0 0 7 0 4000.0 0 4000.0 8 2076.4 395.55 735.28 679.11 = 331.78 136.71 1009.3 420.27 395.55 2703.1 479.11 660.61 136.71 1191.5 220.27 850.95 735.28 479.11 2067.1 215.82 386.36 427.34 1718.1 164.05 679.11 660.61 215.82 852.12 627.34 358.30 164.05 549.81 331.78 136.71 386.36 627.34 610.92 178.13 665.50 668.76 136.71 1191.5 427.34 358.30 178.13 1433.4 468.76 600.15 1009.3 220.27 1718.1 164.05 665.50 468.76 3393.0 412.54 Element (4) is a 2-node bar with nodes 1 and 2, whence the EFT is { 1,2,3,4 }. The element stiffness is 7071.1 7071.1 7071.1 7071.1 1 7071.1 7071.1 7071.1 7071.1 2 (25.11) K(4) = 7071.1 7071.1 7071.1 7071.1 3 7071.1 7071.1 7071.1 7071.1 4 Upon assembly, the master stiffness of the plane stress structure, printed with one digit after the 258
259
25.4
MET ASSEMBLERS
PlaneStressMasterStiffness[nodxyz_,eletyp_,elenod_, elemat_,elefab_,prcopt_]:=Module[{numele=Length[elenod], numnod=Length[nodxyz],ncoor,type,e,enl,neldof, i,n,ii,jj,eftab,Emat,th,numer,Ke,K}, K=Table[0,{2*numnod},{2*numnod}]; numer=prcopt[[1]]; For [e=1,e<=numele,e++, type=eletyp[[e]]; If [!MemberQ[{"Bar2","Trig3","Quad4"},type], Print["Illegal type", " of element e=",e," Assembly interrupted"]; Return[K]]; enl=elenod[[e]]; n=Length[enl]; eftab=Flatten[Table[{2*enl[[i]]-1,2*enl[[i]]},{i,1,n}]]; ncoor=Table[nodxyz[[enl[[i]]]],{i,n}]; If [type=="Bar2", Em=elemat[[e]]; A=elefab[[e]]; Ke=PlaneBar2Stiffness[ncoor,Em,A,{numer}] ]; If [type=="Trig3", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Trig3IsoPMembraneStiffness[ncoor,Emat,th,{numer}] ]; If [type=="Quad4", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,th,{numer,2}] ]; neldof=Length[Ke]; For [i=1,i<=neldof,i++, ii=eftab[[i]]; For [j=i,j<=neldof,j++, jj=eftab[[j]]; K[[jj,ii]]=K[[ii,jj]]+=Ke[[i,j]] ]; ]; ]; Return[K]; ];
decimal point, is 10464.0 6658.5 8080.4 6658.5 13072.0 7491.3 8080.4 7491.3 9147.5 7291.3 7922.0 6675.5 1718.1 164.1 735.3 164.1 549.8 679.1 665.5 668.8 331.8 468.8 4600.2 136.7
0 0 0 0
7291.3 1718.1 164.1 665.5 468.8 0 7922.0 164.1 549.8 668.8 4600.2 0 6675.5 735.3 679.1 331.8 136.7 0 9774.1 479.1 660.6 136.7 1191.5 0 479.1 2567.1 215.8 386.4 1027.3 500.0 660.6 215.8 2185.5 1027.3 358.3 400.0 136.7 386.4 1027.3 2530.9 178.1 1920.0 1191.5 1027.3 358.3 178.1 6153.4 600.0 0 0 500.0 400.0 1920.0 600.0 2420.0 0 0 600.0 1333.3 400.0 720.0 1000.0
The eigenvalues of K are [ 32883. 10517.7 5439.33 3914.7 3228.99 2253.06 2131.03 0 0 0 ] which displays the correct rank. 25.4.2. Implementation An implementation of the MET plane stress assembler as a Mathematica module called PlaneStressMasterStiffness is shown in Figure 25.6. The assembler is invoked by K = PlaneStressMasterStiffness[nodxyz,eletyp,elenod,elemat,elefab,prcopt] (25.14) 259 (25.13)
2510
The only additional argument is eletyp, which is a list of element types. The script listed in the top of Figure 25.7 runs module PlaneStressMasterStiffness with the inputs appropriate to the problem dened in Figure 25.5. The output shown in the bottom of the gure reproduces the master stiffness matrix (25.12) and the eigenvalues (25.13). .
Em=10000; =1/4; h=3/10; A=2; Emat=Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}; nodxyz= {{0,1},{1,0},{5,0},{0,6},{5,6}}; elenod= {{3,5,4},{2,3,4,1},{1,4},{1,2}}; eletyp= {"Trig3","Quad4","Bar2","Bar2"}; elemat= {Emat,Emat,Em,Em}; elefab= {h,h,A,A}; prcopt={True}; K=PlaneStressMasterStiffness[nodxyz,eletyp,elenod,elemat,elefab,prcopt]; Print["Master Stiffness Matrix of Plane Stress Structure:"]; Print[SetPrecision[Chop[K],5]//MatrixForm]; Print["Eigs of K:",Chop[Eigenvalues[N[K]]]]; Master Stiffness Matrix of Plane Stress Structure: 10464. 6658.5 8080.4 7291.3 1718.1 164.05 665.50 468.76 0 0 6658.5 13072. 7491.3 7922.0 164.05 549.81 668.76 4600.2 0 0 8080.4 7491.3 9147.5 6675.5 735.28 679.11 331.78 136.71 0 0 7291.3 7922.0 6675.5 9774.1 479.11 660.61 136.71 1191.5 0 0 1718.1 164.05 735.28 479.11 2567.1 215.82 386.36 1027.3 500.00 600.00 164.05 549.81 679.11 660.61 215.82 2185.5 1027.3 358.30 400.00 1333.3 665.50 668.76 331.78 136.71 386.36 1027.3 2530.9 178.13 1920.0 400.00 468.76 4600.2 136.71 1191.5 1027.3 358.30 178.13 6153.4 600.00 720.00 0 0 0 0 500.00 400.00 1920.0 600.00 2420.0 1000.0 0 0 0 0 600.00 1333.3 400.00 720.00 1000.0 2053.3
Figure 25.7. Script for assembling the plane stress model of Figure 25.5 and output results.
25.5. MET-VFC Assemblers The next complication beyond multiple element types is a major one: allowing nodes to have different freedom congurations. An assembler that handles this feature will be called a MET-VFC assembler, where VFC is an acronym for Variable Freedom Conguration. A MET-VFC assembler gets closer to what is actually implemented in production FEM programs. A assembler of this kind can handle orientation nodes as well as node gaps automatically. Only two advanced attributes remain: allowing treatment of MFCs by Lagrange multipliers, and handling a sparse matrix storage scheme. The former can be done by an extension of the concept of element. The latter requires major programming modications, however, and is not considered in this Chapter. The implementation of a MET-VFC assembler requires the denition of additional data structures pertaining to freedoms, at both node and element levels. These are explained in the following subsections before giving a concrete application example. 2510
25.5
MET-VFC ASSEMBLERS
A key decision made by the implementor of a FEM program for structural analysis is: what freedoms will be allocated to nodes, and how are they arranged? While many answers are possible, we focus here on the most common arrangement for a linear three-dimensional FEM program.1 At each node n three displacements {u xn , u yn , u zn } and three innitesimal rotations {xn , yn , zn } are chosen as freedoms and ordered as follows: u xn , u yn , u zn , xn , yn , zn (25.15)
This is a Node Freedom Arrangement or NFA. Once the decision is made on a NFA, the position of a freedom never changes.2 Thus if (25.15) is adopted, position #2 is forever associated to u yn . The length of the Node Freedom Arrangement is called the NFA length and often denoted (as a variable) by nfalen. For the common choice (25.15) of 3D structural codes, nfalen is 6. 25.5.2. Node Freedom Signature Having picked a NFA such as (25.15) does not mean that all such freedoms need to be present at a node. Take for example a model, such as a space truss, that only has translational degrees of freedom. Then only {u xn , u yn , u zn } will be used, and it becomes unnecessary to carry rotations in the master equations. There are also cases where allocations may vary from node to node. To handle such scenarios in general terms a Node Freedom Signature or NFS, is introduced. The NFS is a sequence of zero-one integers. If the jth entry is one, it means that the jth freedom in the NFA is allocated; whereas if zero that freedom is not in use. For example, suppose that the underlying NFA is (25.15) and that node 5 uses the three freedoms {u x 5 , u y 5 , z 5 }. Then its NFS is { 1,1,0,0,0,1 } (25.16)
If a node has no allocated freedoms (e.g, an orientation node), or has never been dened, its NFS contains only zeros. It is convenient to decimally pack signatures into integers to save storage because allocating a full integer to hold just 0 or 1 is wasteful. The packed NFS (25.16) would be 110001. This technique requires utilities for packing and unpacking. Mathematica functions that provide those services are listed in Figure 25.8. All of them use built-in functions. A brief description follows. p = PackNodeFreedomSignature[s] Packs the NFS list s into integer p. s = UnpackNodeFreedomSignature[p,m] Unpacks the NFS p into a list s of length m, where m is the NFA length. (The second argument is necessary in case the NFS has leading zeros.) k = NodeFreedomCount[p]
1
This is the scheme used by most commercial codes. In a geometrically nonlinear FEM code, however, nite rotation measures must be used. Consequently the innitesimal node rotations {x , y , z } must be replaced by something else. NFA positions #7 and beyond are available for additional freedom types, such as Lagrange multipliers, temperatures, pressures, uxes, etc. It is also possible to reserve more NFA positions for structural freedoms.
2511
2512
Example 25.1. PackNodeFreedomSignature[{ 1,1,0,0,0,1 }] returns 110001. The inverse is UnpackNodeFreedomSignature[110001,6], which returns { 1,1,0,0,0,1 }. NodeFreedomCount[110001] returns 3.
25.5.3. The Node Freedom Allocation Table The Node Freedom Allocation Table, or NFAT, is a node by node list of packed node freedom signatures. In Mathematica the list containing this table is internally identied as nodfat. The conguration of the NFAT for the plane stress example structure of Figure 25.5 is nodfat = { 110000,110000,110000,110000,110000 } = Table[110000,{ 5 }]. (25.17) This says that only two freedoms: {u x , u y }, are used at each of the ve nodes. A zero entry in the NFAT ags a node with no allocated freedoms. This is either an orientation node, or an undened one. The latter case happens when there is a node numbering gap, which is a common occurence when certain mesh generators are used. In the case of a MET-VFC assembler such gaps are not considered errors. 25.5.4. The Node Freedom Map Table The Node Freedom Map Table, or NFMT, is an array with one entry per node. Suppose that node n has k 0 allocated freedoms. These have global equation numbers i + j , j = 1, . . . , k . This i is called the base equation index: it represent the global equation number before the rst equation to which node n contributes. Obviously i = 0 if n = 1. Base equation indices for all nodes are recorded in the NFMT.3 In Mathematica code the table is internally identied as nodfmt. Figure 25.9 lists a module that constructs the NFMT given the NFAT. It is invoked as nodfmt = NodeFreedomMapTable[nodfat] (25.18)
The only argument is the NFAT. The module builds the NFMT by simple incrementation, and returns it as function value.
Example 25.2. The NFAT for the plane truss-frame structure of Figure 25.11 is nodfat = { 110001,110000,
110001,000000,110001 }. The node freedom counts are { 3,2,3,0,3 }. The call nodfmt = NodeFreedomMapTable[nodfat]
(25.19)
returns { 0,3,5,8,8 } in nodfmt. This can be easily veried visually: 0+3=3, 0+3+2=5, etc.
Figure 25.9 also lists a function TotalFreedomCount that returns the total number of freedoms in the master equations, given the NFAT as argument.
3
The map qualier comes from the use of this array in computing element-to-global equation mapping.
2512
2513
25.5
MET-VFC ASSEMBLERS
NodeFreedomMapTable[nodfat_]:=Module[{numnod=Length[nodfat], i,nodfmt}, nodfmt=Table[0,{numnod}]; For [i=1,i<=numnod-1,i++, nodfmt[[i+1]]=nodfmt[[i]]+ DigitCount[nodfat[[i]],10,1] ]; Return[nodfmt]]; TotalFreedomCount[nodfat_]:=Sum[DigitCount[nodfat[[i]],10,1], {i,Length[nodfat]}];
Figure 25.9. Modules to construct the NFMT from the NFAT, and to compute the total number of freedoms.
ElementFreedomTable[enl_,efs_,nodfat_,nodfmt_,m_]:=Module[ {nelnod=Length[enl],eft,i,j,k=0,ix,n,s,es,sx}, eft=Table[0,{Sum[DigitCount[efs[[i]],10,1],{i,1,nelnod}]}]; For [i=1,i<=nelnod,i++, n=enl[[i]]; s=IntegerDigits[nodfat[[n]],10,m]; ix=0; sx=Table[0,{m}]; Do [If[s[[j]]>0,sx[[j]]=++ix],{j,1,m}]; es=IntegerDigits[efs[[i]],10,m]; For [j=1,j<=m,j++, If [es[[j]]>0, k++; If [s[[j]]>0, eft[[k]]=nodfmt[[n]]+sx[[j]] ]]]; ]; Return[eft]];
Figure 25.10. Module to construct the Element Freedom Table for a MET-VFC assembler.
25.5.5. The Element Freedom Signature The Element Freedom Signature or EFS is a data structure that shares similarities with the NFAT, but provides freedom data at the element rather than global level. More specically, given an element, it tells to which degrees of freedom it constributes. The EFS is best described through an example. Suppose that in a general FEM program all dened structural nodes have the signature 111111, meaning the arrangement (25.15). The program includes 2-node space bar elements, which contribute only to translational degrees of freedom {u x , u y , u z }. The EFS of any such element will be efs = { 111000,111000 } (25.20)
For a 2-node space beam element, which contributes to all six nodal freedoms, the EFS will be efs = { 111111,111111 } For a 3-node space beam element in which the third node is an orientation node: efs = { 111111,111111,000000 } (25.22) (25.21)
This information, along with the NFAT and NFMT, is used to build Element Freedom Tables. 2513
2514
25.5.6. The Element Freedom Table The Element Freedom Table or EFT has been encountered in all previous assembler examples. It is a one dimensional list of length equal to the number of element DOF. If the ith element DOF maps to the kth global DOF, then the ith entry of EFT contains k. This allows to write the merge loop compactly. In the simpler assemblers discussed in previous sections, the EFT can be built on the y simply from element node numbers. For a MET-VFC assembler that is no longer the case. To take care of the VFC feature, the construction of the EFT is best done by a separate module. A Mathematica implementation is shown in Figure 25.10. Discussion of the logic, which is not trivial, is relegated to an Exercise, and we simply describe here the interface. The module is invoked as eft = ElementFreedomTable[enl,efs,nodfat,nodfmt,m] The arguments are enl efs nodfat nodfmt m The element node list. The Element Freedom Signature (EFS) list. The Node Freedom Allocation Table (NFAT) described in 25.5.3 The Node Freedom Map Table (NFMT) described in 25.5.4 The NFA length, often 6. (25.23)
The module returns the Element Freedom Table as function value. Examples of use of this module are provided in the plane trussed frame example below.
Remark 25.1. The EFT constructed by ElementFreedomTable is guaranteed to contain only positive entries
if every freedom declared in the EFS matches a globally allocated freedom in the NFAT. But it is possible for the returned EFT to contain zero entries. This can only happen if an element freedom does not match a globally allocated one. For example suppose that a 2-node space beam element with the EFS (25.21) is placed into a program that does not accept rotational freedoms and thus has a NFS of 111000 at all structural nodes. Then six of the EFT entries, namely those pertaining to the rotational freedoms, would be zero. The occurrence of a zero entry in a EFT normally ags a logic or input data error. If detected, the assembler should print an appropriate error message and abort. The module of Figure 25.10 does not make that decision because it lacks certain information, such as the element number, that should be placed into the message.
25.5.7. A Plane Trussed Frame Structure To illustrate the workings of a MET-VFC assembler we will follow the assembly process of the structure pictured in Figure 25.11(a). The nite element discretization, element disconnection and assembly process are illustrated in Figure 25.11(b,c,d). Although the structure is chosen to be plane to facilitate visualization, it will be considered within the context of a general purpose 3D program with the freedom arrangement (25.15) at each node. The structure is a trussed frame. It uses two element types: plane (Bernoulli-Euler) beam-columns and plane bars. Geometric, material and fabrication data are given in Figure 25.11(a). The FEM idealization has 4 nodes and 5 elements. Nodes numbers are 1, 2, 3 and 5 as shown in Figure 25.11(b). Node 4 is purposedly left out to illustrate handling of numbering gaps. There are 11 DOFs, three 2514
2515
E=30000 MPa, A=0.02 m 2 , Izz =0.0004 m4 y E=200000 MPa A=0.003 m 2
25.5
MET-VFC ASSEMBLERS
(b)
(a)
3m
1 Beam-column 3 Beam-column 5
FEM idealization
Bar
x
E=200000 MPa A=0.001 m2 4m 4m
Bar
Bar
disassembly
(2)
2 (node 4: undefined)
(c)
1(1,2,3)
(d)
5(9,10,11) 1(1,2,3) 3(6,7,8) 5(9,10,11)
assembly
(5) 2(4,5)
Figure 25.11. Trussed frame structure to illustrate a MET-VFC assembler: (a) original structure showing dimensions, material and fabrication properties; (b) nite element idealization with bars and beam column elements; (c) conceptual disassembly; (d) assembly. Numbers written in parentheses after a node number in (c,d) are the global freedom (equation) numbers allocated to that node.
at nodes 1, 3 and 5, and two at node 2. They are ordered as Global DOF #: DOF: Node #: 1 ux1 1 2 u y1 1 3 z 1 1 4 ux2 2 5 u y2 2 6 ux3 3 7 u y3 3 8 z 3 3 9 ux5 5 10 u y5 5 11 z 5 5
(25.24)
The NFAT and NFMT can be constructed by inspection of (25.24) to be nodfat = { 110001,110000,110001,000000,110001 } nodfmt = { 0,3,5,8,8 } The element freedom data structures can be also constructed by inspection: Elem (1) (2) (3) (4) (5) Type Beam-column Beam-column Bar Bar Bar Nodes { 1,3 } { 3,5 } { 1,2 } { 2,3 } { 2,5 } EFS { 110001,110001 } { 110001,110001 } { 110000,110000 } { 110000,110000 } { 110000,110000 } EFT { 1,2,3,6,7,8 } { 6,7,8,9,10,11 } { 1,2,4,5 } { 4,5,6,7 } { 4,5,9,10 } (25.25)
(25.26)
Next we list the element stiffness matrices, computed with the modules discussed in Chapter 20. The EFT entries are annotated as usual. 2515
2516
Element (1): This is a plane beam-column element with stiffness 150. 0. 0. 150. 0. 0. 0. 22.5 45. 0. 22.5 45. 0. 45. 120. 0. 45. 60. (1) K = 0. 0. 150. 0. 0. 150. 0. 22.5 45. 0. 22.5 45. 0. 45. 60. 0. 45. 120.
1 2 3 6 7 8
(25.27)
Element (2): This is a plane beam-column with element stiffness identical to the previous one 150. 0. 0. 150. 0. 0. 6 0. 22.5 45. 0. 22.5 45. 7 0. 45. 120. 0. 45. 60. 8 (2) K = (25.28) 0. 0. 150. 0. 0. 9 150. 0. 22.5 45. 0. 22.5 45. 10 0. 45. 60. 0. 45. 120. 11 Element (3): This is a plane bar element with stiffness 25.6 19.2 25.6 19.2 19.2 14.4 K(3) = 25.6 19.2 25.6 19.2 14.4 19.2 19.2 14.4 19.2 14.4
4 5 6 7 1 2 4 5
(25.29)
Element (4): This is a plane bar element with stiffness 0 0 0 0 0 200. 0 200. K(4) = 0 0 0 0 0 200. 0 200. Element (5): This is a plane bar element with stiffness 25.6 19.2 25.6 14.4 19.2 19.2 K(5) = 25.6 19.2 25.6 19.2 14.4 19.2
(25.30)
4 5 9 10
(25.31)
Upon merging the 5 elements the master stiffness matrix becomes 175.6 19.2 0 25.6 19.2 150. 0 0 0 22.5 45. 19.2 36.9 45. 19.2 14.4 0 45. 120. 0 0 0 45. 60. 0 51.2 0 0 0 0 25.6 19.2 0 0 228.8 0 200. 0 19.2 14.4 K = 150. 0 0 0 0 300. 0 0 0 22 . 5 45 . 0 200 . 0 245 . 0 0 45. 60. 0 0 0 0 240. 0 0 0 25.6 19.2 150. 0 0 0 0 0 19.2 14.4 0 22.5 45. 0 0 0 0 0 0 45. 60. 2516
0 0 1 0 0 2 0 0 3 19.2 0 4 14.4 0 5 0 0 6 22.5 45. 7 45. 60. 8 19.2 0 9 36.9 45. 10 45. 120. 11 (25.32)
2517
25.5
MET-VFC ASSEMBLERS
in which global freedom numbers are annotated for convenience. Since all elements have been processed, (25.32) is the master stiffness matrix. It eigenvalues are [ 460.456 445.431 306.321 188.661 146.761 82.7415 74.181 25.4476 0 0 0 ] This has the correct rank of 11 3 = 8.
Remark 25.2. For storage as a skyline matrix (Chapter 26) the template for (25.32) would look like
(25.33)
175.6 K=
symm
19.2 36.9
150. 0 0 0 0 300.
25.6 19.2 19.2 14.4 150. 0 0 22.5 0 45. 175.6 19.2 36.9 45. 120. (25.34) (25.35)
45. 60. 0
The diagonal location pointers of (25.34) are dened by the list DLT = { 0,1,3,6,10,15,21,27,34,40,47,52 }
Examination of the template (25.34) reveals that some additional zero entries could be removed from the template; for example K 13 . The fact that those entries are zero is, however, fortuitous. It comes from the fact that some elements such as the beams are aligned along x , which decouples axial and bending stiffnesses.
25.5.8. Implementation Figure 25.12 lists the Mathematica implementation of a MET-VFC assembler capable of doing the trussed frame structure of Figure 25.11. The assembler module is invoked as K = PlaneTrussedFrameMasterStiffness[nodxyz,eletyp,elenod, elemat,elefab,nodfat,prcopt] The only new argument with respect to the MET assembler of 25.4.2 is nodfat The Node Freedom Arrangement Table (NFAT). The module returns the master stiffness matrix as function value. PlaneTrussedFrameMasterStiffness uses ve other modules: the element stiffness modules PlaneBar2Stiffness and PlaneBeamColumn2Stiffness of Chapter 20, the NFMT constructor NodeFreedomMapTable of Figure 25.9, the total-DOF-counter TotalFreedomCount of Figure 25.9, and the EFT constructor ElementFreedomTable of Figure 25.10. The element fabrication list elefab has minor modications. A plane beam-column element requires two properties: { A,Izz }, which are the cross section area and the moment of inertia about the local z axis. A bar element requires only the cross section area: A. For the example trussed frame structure elefab is { { 0.02,0.004 },{ 0.02,0.004 },0.001,0.003,0.001 } in accordance with 2517 (25.36)
2518
PlaneTrussedFrameMasterStiffness[nodxyz_,eletyp_, elenod_,elemat_,elefab_,nodfat_,prcopt_]:=Module[ {numele=Length[elenod],numnod=Length[nodxyz],numdof,nodfmt,e,enl, eftab,n,ni,nj,i,j,k,m,ncoor,Em,A,Izz,options,Ke,K}, nodfmt=NodeFreedomMapTable[nodfat]; numdof=TotalFreedomCount[nodfat]; K=Table[0,{numdof},{numdof}]; For [e=1, e<=numele, e++, enl=elenod[[e]]; If [eletyp[[e]]=="Bar2", {ni,nj}=enl; ncoor={nodxyz[[ni]],nodxyz[[nj]]}; Em=elemat[[e]]; A=elefab[[e]]; options=prcopt; eftab=ElementFreedomTable[enl,{110000,110000},nodfat,nodfmt,6]; Ke=PlaneBar2Stiffness[ncoor,Em,A,options] ]; If [eletyp[[e]]=="BeamCol2", {ni,nj}=enl; ncoor={nodxyz[[ni]],nodxyz[[nj]]}; eftab=ElementFreedomTable[enl,{110001,110001},nodfat,nodfmt,6]; Em=elemat[[e]]; {A,Izz}=elefab[[e]]; options=prcopt; Ke=PlaneBeamColumn2Stiffness[ncoor,Em,{A,Izz},options] ]; If [MemberQ[eftab,0], Print["Zero entry in eftab for element ",e]; Print["Assembly process aborted"]; Return[K]]; neldof=Length[eftab]; For [i=1, i<=neldof, i++, ii=eftab[[i]]; For [j=i, j<=neldof, j++, jj=eftab[[j]]; K[[jj,ii]]=K[[ii,jj]]+=Ke[[i,j]] ]; ]; ]; Return[K]];
Figure 25.12. A MET-VFC assembler written for the plane trussed frame structure.
nodxyz={{-4,3},{0,0},{0,3},0,{4,3}}; eletyp= {"BeamCol2","BeamCol2","Bar2","Bar2","Bar2"}; elenod= {{1,3},{3,5},{1,2},{2,3},{2,5}}; elemat= Join[Table[30000,{2}],Table[200000,{3}]]; elefab= {{0.02,0.004},{0.02,0.004},0.001,0.003,0.001}; prcopt= {True}; nodfat={110001,110000,110001,000000,110001}; K=PlaneTrussedFrameMasterStiffness[nodxyz,eletyp, elenod,elemat,elefab,nodfat,prcopt]; K=Chop[K]; Print["Master Stiffness of Example Trussed Frame:"]; Print[K//MatrixForm]; Print["Eigs of K=",Chop[Eigenvalues[N[K]]]]; Master Stiffness of Example Trussed Frame: 175.6 19.6 0 25.6 19.2 150. 19.2 36.9 45. 19.2 14.4 0 0 45. 120. 0 0 0 25.6 19.2 0 51.2 0 0 19.2 14.4 0 0 228.8 0 150. 0 0 0 0 300. 0 22.5 45. 0 200. 0 0 45. 60. 0 0 0 0 0 0 25.6 19.2 150. 0 0 0 19.2 14.4 0 0 0 0 0 0 0
0 0 0 0 0 0 25.6 19.2 19.2 14.4 150. 0 0 22.5 0 45. 175.6 19.2 19.2 36.9 0 45.
Figure 25.13. Script to test the assembler of Figure 25.12 with the structure of Figure 25.11.
2518
2519
(a)
disassembly
(2) 3(6,7,8) 5(9,10,11) 1(1,2,3)
2 (node 4:undefined)
(c)
1(1,2,3)
(1)
(d) MFC
3(6,7,8)
5(9,10,11)
assembly
(3) (4) 2(4,5) (5) 2(4,5)
Figure 25.14. Finite element discretization, disassembly and assembly of trussed frame example structure with MFC u y 1 = u y 5 .
the data in Figure 25.11. The element material property list elemat is modied on the account that the elastic moduli for the beam columns (made of reinforced concrete) and bars made of (steel) are different. Running the script listed in the top of Figure 25.13 produces the output shown in the bottom of that gure. As can be observed this agrees with (25.32) and (25.33).
25.6.
To see the effect of imposing an MFC through the Lagrange multiplier method on the conguration of the master stiffness matrix, suppose that the trussed frame example structure of the previous section is subjected to the constraint that nodes 1 and 5 must move vertically by the same amount. That is, u y1 = u y5 or u y 1 u y 5 = 0. (25.37)
For assembly purposes (25.37) may be viewed as a ctitious element4 labeled as (6). See Figure 25.14. The degrees of freedom of the assembled structure increase by one to 12. They are ordered as Global DOF #: DOF: Node #: 1 ux1 1 2 u y1 1 3 z 1 1 4 ux2 2 5 u y2 2 6 ux3 3 7 u y3 3 8 z 3 3 9 ux5 5 10 u y5 5 11 z 5 5 12 (6) none
(25.38)
The assembly of the rst ve elements proceeds as explained before, and produces the same master stiffness as (25.34), except for an extra zero row and column. Processing the MFC element (6) yields the 12 12
4
This device should not be confused with penalty elements, which have stiffness matrices. The effect of adding a Lagrange multiplier element is to append rows and columns to the master stiffness.
2519
2520
bordered stiffness 175.6 19.2 0 25.6 19.2 36.9 45. 19.2 0 45. 120. 0 25.6 19.2 0 51 . 2 19.2 14.4 0 0 0 0 0 150. K= 0 22.5 45. 0 0 45 . 60 . 0 0 0 0 25.6 0 0 0 19.2 0 0 0 0 0 1. 0 0
0 0 22.5 45. 45. 60. 0 0 200. 0 0 0 245. 0 0 240. 0 0 22.5 45. 45. 60. 0 0
0 0 0 0 0 1. 0 0 0 19.2 0 0 14.4 0 0 0 0 0 22.5 45. 0 45. 60. 0 19.2 0 0 36.9 45. 1. 45. 120. 0 1. 0 0
(25.39)
in which the coefcients 1 and 1 associated with the MFC (25.37) end up in the last row and column of K. There are several ways to incorporate multiplier adjunction into an automatic assembly procedure. The most elegant ones associate the ctitious element with a special freedom signature and a reserved position in the NFA. Being of advanced nature such schemes are beyond the scope of this Chapter. Notes and Bibliography The DSM assembly process for the simplest case of 25.3 is explained in any nite element text. Few texts cover, however, the complications that arise in more general scenarios. Especially when VFCs are allowed. Assembler implementation avors have uctuated since the DSM became widely accepted as standard. Variants have been strongly inuenced by limits on random access memory (RAM). Those limitations forced the use of out-of-core blocked equation solvers, meaning that heavy use was made of disk auxiliary storage to store and retrieve the master stiffness matrix in blocks. Only a limited number of blocks could reside on RAM. Thus a straightforward element-by-element assembly loop (as in the assemblers presented here) was likely to miss the target on the receiving end of the merge, forcing blocks to be read in, modied and saved. On large problems this swapping was likely to trash the system with heavy I/O, bringing processing to a crawl. One solution favored in programs of the 196585 period was to process all elements without assembling, saving matrices on disk. The assembler then cycled over stiffness blocks and read in the contributing elements. With smart asynchronous buffering and tuned-up direct access I/O such schemes were able to achieved reasonable efciency. However, system dependent logic quickly becomes a maintenance nightmare. A second way out emerged by 1970: the frontal solvers referenced in Chapter 11. A frontal solver carries out assembly, BC application and solution concurrently. Element contributions are processed in a special order that traverses the FEM mesh as a wavefront. Application of displacement BCs and factorization can trail the wave once no more elements are detected as contributing to a given equation. As can be expected of trying to do too much at once, frontal solvers can be extremely sensitive to changes. One tiny alteration in the element library over which the solver sits, and the whole thing may crumble like a house of cards. The availability of large amounts of RAM (even on PCs and laptops) since the mid 90s, has had a happy consequence: interweaved assembly and solver implementations, as well as convoluted matrix blocking, are no longer needed. The assembler can be modularly separated from the solver. As a result even the most complex assembler presented here ts in one page of text. Of course it is too late for the large scale FEM codes that got caught in the limited-RAM survival game decades ago. Changing their assemblers and solvers incrementally is virtually impossible. The gurus that wrote those thousands of lines of spaghetti Fortran are long gone. The only practical way out is rewrite the whole shebang from scratch. In a commercial environment such investment-busting decisions are unlikely.
2520
2521
Homework Exercises for Chapter 25 The Assembly Process
Exercises
EXERCISE 25.1 [D:10] Suppose you want to add a six-node plane stress quadratic triangle to the MET
assembler of 25.4. Sketch how you would modify the module of Figure 25.6 for this to happen.
EXERCISE 25.2 [C:10] Exercise the module ElementFreedomTable listed in Figure 25.10 on the trussed
return zero entries in the EFT? If yes, give a specic example of how this can happen. Hint: read the Chapter carefully.
EXERCISE 25.4 [A/C:30] The trussed frame structure of Figure 25.4 is reinforced with two triangular steel
plates attached as shown in Figure EE25.1(a). The plate thickness is 1.6 mm= 0.0016 m; the material is isotropic with E = 240000 MPa and = 1/3. Each reinforcing plate is modeled with a single plane stress 3-node linear triangle. The triangles are numbered (6) and (7), as illustrated in Figure E25.1(c). Compute the master stiffness matrix K of the structure.5
y (a)
Plate properties: E =240000 MPa, =1/3 h =1.6 mm = 0.0016 m, x Other dimensions & properties same as in the trussed frame of Fig. 25.11 FEM idealization
(b)
1 Beam-column 3 Beam-column 5
Bar Plate Bar Plate Bar
disassembly (2)
2 (node 4:undefined)
(c)
1(1,2,3)
(d)
5(9,10,11) assembly 1(1,2,3) 3(6,7,8) 5(9,10,11)
(5) 2(4,5)
This exercise may be done through Mathematica. For this download Notebook ExampleAssemblers.nb from this Chapter index, and complete Cell 4 by writing the assembler.6 The plate element identier is "Trig3". The driver script to run the assembler is also provided in Cell 4 (blue text).
5
This structure would violate the compatibility requirements stated in Chapter 19 unless the beams are allowed to deect laterally independently of the plates. This is the fabrication actually sketched in Figure E25.1(a). Cells 13 contain the assemblers presented in 25.3, 25.4 and 25.5, respectively, which may be used as guides. The stiffness modules for the three element types used in this structure are available in Cells 2 and 3 and may be reused for this Exercise.
2521
2522
When reusing the assembler of Cell 3 as a guide, please do not remove the internal Print commands that show element information (red text). Those come in handy for debugging. Please keep that printout in the returned homework to help the grader. Another debugging hint: check that the master stiffness (25.32) is obtained if the plate thickness, called hplate in the driver script, is temporarily set to zero. Target:
337.6 19.2 19.2 90.9 0 45. 25.6 91.2 91.2 14.4 K = 312. 72. 72. 76.5 0 45. 0 0
0 0 0 0
(E25.1)
EXERCISE 25.5 [A:30] 25.5 does not explain how to construct the NFAT from the input data. (In the trussed frame example script, nodfat was set up by inspection, which is OK only for small problems.) Explain how this table could be constructed automatically if the EFS of each element in the model is known. Note: the logic is far from trivial.
2522
Introduction to FEM
25
IFEM Ch 25 Slide 1
Introduction to FEM
Assembler
Equation Solver
merge loop
Some equation solvers apply BCs and solve simultaneously Nodal displacements ELEMENT LIBRARY To postprocessor
IFEM Ch 25 Slide 2
Introduction to FEM
There are no multifreedom constraints (MFCs) The master stiffness matrix is stored as a full symmetric matrix Not addressed in Chapter
IFEM Ch 25 Slide 3
Introduction to FEM
MET Assembler
Allows multiple element types
MET-VFC Assembler
Allows multiple element types & variable freedom configurations at nodes (in particular, gaps in node numbers)
IFEM Ch 25 Slide 4
Introduction to FEM
y
2
assembly
x
1 (1,2) 2 (3,4) 3 (5,6)
4 (7,8)
IFEM Ch 25 Slide 5
Introduction to FEM
and merge
1500 0 1500 0 0 0 0 0 0 1500 0 0 0 1500 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 2 3 4
IFEM Ch 25 Slide 6
Introduction to FEM
and merge
and merge
2268 576 1500 0 0 0 768 576 576 1500 432 0 0 3000 0 0 0 1500 0 0 576 0 432 0 0 0 0 0 0 1500 0 0 0 1500 0 0 0 0 0 0 0 0 0 0 0 0 0 0 768 576 0 0 0 0 768 576 576 432 0 0 0 0 576 432
1 2
7 8
IFEM Ch 25 Slide 7
Introduction to FEM
and merge
576 1500 0 0 432 0 0 0 0 3000 0 1500 0 0 2000 0 0 1500 0 1500 0 0 0 0 576 0 0 0 432 0 2000 0 0 0 0 0 0 0 0 0 768 576 0 0 0 0 768 576 576 432 0 2000 0 0 576 2432
3 4
7 8
and merge
576 1500 0 0 432 0 0 0 0 3000 0 1500 0 0 2000 0 0 1500 0 2268 0 0 0 576 576 0 0 768 432 0 2000 576 0 0 0 0 576 432 576 432 768 576 0 0 768 576 1536 0
IFEM Ch 25 Slide 8
Introduction to FEM
K=
IFEM Ch 25 Slide 9
Introduction to FEM
IFEM Ch 25 Slide 10
Introduction to FEM
IFEM Ch 25 Slide 11
Introduction to FEM
Useful for problems such as this plane stress example. Three element types: bar, triangle & quadrilateral, but all nodes have 2 DOFs (u x , u y ) and no numbering gaps are allowed.
1(1,2)
bar (4)
quad (2)
2(3,4) 4 (7,8)
3(5,6)
assembly
5(9,10)
For implementation details see Notes. Here we go directly to the next level of assembler (most complicated type considered in Chapter)
IFEM Ch 25 Slide 12
Introduction to FEM
MET-VFC Assembler ( allows Multiple Element Types & Variable Freedom Configuration)
Allows element type mixing in one FEM model Nodes may have different freedom configurations identified by a signature Additional data structures needed For the MET part: Element Type List For the VFC part: Node Freedom Arrangement Node Freedom Signature Node Freedom Allocation table Node Freedom Map table Element Freedom Signature
Detailed definitions in Notes. Here most are introduced through an application example
IFEM Ch 25 Slide 13
Introduction to FEM
x
4m 4m
Two element types: Beam-column & bar Nodes 1, 3 and 5 have 3 DOFs each Node 2 has 2 DOF Node 4 is not defined (numbering gap)
FEM idealization
1
BeamBeamcolumn (1) 3 column (2) 5 Bar (4) Bar (3) Bar (5)
2 (node 4: undefined)
IFEM Ch 25 Slide 14
Introduction to FEM
Bar
Bar
assembly
1(1,2,3) 3(6,7,8) 5(9,10,11)
2(4,5)
IFEM Ch 25 Slide 15
Introduction to FEM
Some Definitions
Node Freedom Arrangement (NFA): u x , u y , u z , x , y , z (standard in general-purpose 3D FEM codes) position never changes: ux always at #1, u y always at #2, etc Node Freedom Signature (NFS): a sequence of six zeros and ones packed into an integer: 1 freedom at that NFA position is allocated, 0 freedom at that NFA position is not used 110001: means ux , uy , z allocated but uz , x , y not used A zero NFS means node is undefined or an orientation node.
IFEM Ch 25 Slide 16
Introduction to FEM
More Definitions
The lists of the NFS for all nodes is the Node Freedom Allocation Table or NFAT (program name: nodfat) Adding node freedom counts taken from the NFAT one builds the Node Freedom Map Table or NFMT (program name: nodfmt). The n-th entry of NFMT points to the global DOF number before the first global DOF for node n (0 if n=1) The Element Freedom Signature or EFS is a list of freedoms contributed to by the element, in node-by-node packed integer form
IFEM Ch 25 Slide 17
Introduction to FEM
FEM idealization
1
BeamBeamcolumn (1) 3 column (2) 5 Bar (4) Bar (3) Bar (5)
NFAT { 110001, 110000,110001,000000,110001} DOF count { 3, 2, 3, 0, 3} NFMT { 0, 3, 5, 8, 8} EFS for beam-columns: {110001,110001} EFS for bars: {110000,110000} From this info the Element Freedom Table (EFT) of each element may be constructed on the fly by the assembler (next slides)
IFEM Ch 25 Slide 18
Introduction to FEM
FEM idealization
1
BeamBeamcolumn (1) 3 column (2) 5 Bar (4) Bar (3) Bar (5)
Elem Type Nodes EFS EFT (1) Beam-column {1,3} {110001,110001} {1,2,3,6,7,8} (2) Beam-column {3,5} {110001,110001} {6,7,8,9,10,11} (3) Bar {1,2} {110000,110000} {1,2,4,5} (4) Bar {2,3} {110000,110000} {4,5,6,7} (5) Bar {2,5} {110000,110000} {4,5,9,10}
IFEM Ch 25 Slide 19
Introduction to FEM
(1)
150. 0. 0. 150. 0. 0. 0. 22.5 45. 0. 22.5 45. 0. 45. 120. 0. 45. 60. = 0. 0. 150. 0. 0. 150. 0. 22.5 45. 0. 22.5 45. 0. 45. 60. 0. 45. 120.
1 2 3 6 7 8
EFT
Beam-column (2)
150. 0. 0. 150. 0. 0. 0. 22.5 45. 0. 22.5 45. (2) 0. 45. 120. 0. 45. 60. K = 0. 0. 150. 0. 0. 150. 0. 22.5 45. 0. 22.5 45. 0. 45. 60. 0. 45. 120. 25.6 19.2 25.6 19.2 19.2 14.4 19.2 14.4 = 25.6 19.2 25.6 19.2 19.2 14.4 19.2 14.4
1 2 4 5
6 7 8 9 10 11
Bar (3)
K
(3)
IFEM Ch 25 Slide 20
Introduction to FEM
0 0 0 200. = 0 0 0 200.
0 0 0 200. 0 0 0 200.
4 5 6 7 4 5 9 10
EFT
Bar (5)
25.6 19.2 25.6 19.2 14.4 19.2 14.4 19.2 (5) K = 25.6 19.2 25.6 19.2 19.2 14.4 19.2 14.4
0 0 22.5 45. 45. 60. 0 0 200. 0 0 0 245. 0 0 240. 0 0 22.5 45. 45. 60.
0 0 0 0 0 0 19.2 0 14.4 0 0 0 22.5 45. 45. 60. 19.2 0 36.9 45. 45. 120.
1 2 3 4 5 6 7 8 9 10 11
IFEM Ch 25 Slide 21
Introduction to FEM
y
1 Beam-column 3 Beam-column 5
Bar Plate Bar
x
disassembly
2 (node 4:undefined)
assembly 2(4,5)
IFEM Ch 25 Slide 22
2523
Homework Exercises for Chapter 25 - Solutions
EXERCISE 25.1 Not assigned. EXERCISE 25.2 Not assigned.
Solutions to Exercises
EXERCISE 25.3 On entry to ElementFreedomTable, space is allocated to the Element Freedom Table that will be built in eft, by counting the number of ones in the EFS passed as efs. For example if EFS is { 110001,110001 } as for the plane beam-column, the six ones indicate that the element has six DOFs; thus the eft is allocated as eft=Table[0,{ 6 }], producing { 0,0,0,0,0,0 }. The module then cycles over the nelnod element nodes, a count found by taking the length of the element node list enl. The NFS of the global node is unpacked into s; for example if the global node NFS is 111001 it unpacks to s={ 1,1,1,0,0,1 }. A freedom increment list sx is built by saying ix=0; Do[If[s[[j]]>0,sx[[j]]=++ix],{ j,1,m }]. For the example s, this produces sx={ 1,2,3,0,0,4 }. The corresponding EFS is unpacked, and compared freedom by freedom with the NFS, on a loop over { j,1,m }. Three possibilities exist:
(i) (ii)
Both element and node freedom are active (in use) The element freedom is active but the node freedom is not
(iii) The element freedom is inactive. In cases (i)(ii) the eft index k is incremented by one. If (i) the k entry is set to the global equation number, whereas if (ii) it is left as zero. In case (iii) the loop does nothing and j is incremented to test the next freedom. Once the two loops: over the element nodes on i and over element freedoms on j, are done, the eft is returned to the calling program as function value.
PlaneReinforcedTrussedFrameMasterStiffness[nodxyz_,eletyp_, elenod_,elemat_,elefab_,nodfat_,prcopt_]:=Module[ {numele=Length[elenod],numnod=Length[nodxyz],numdof,nodfmt,e,enl, type,eftab,n,ni,nj,nk,i,j,ii,jj,k,m,ncoor,Em,A,Izz,th,options,Ke,K}, nodfmt=NodeFreedomMapTable[nodfat]; numdof=TotalFreedomCount[nodfat]; K=Table[0,{numdof},{numdof}]; For [e=1, e<=numele, e++, enl=elenod[[e]]; type=eletyp[[e]]; If [type=="Bar2", {ni,nj}=enl; ncoor={nodxyz[[ni]],nodxyz[[nj]]}; Em=elemat[[e]]; A=elefab[[e]]; options=prcopt; eftab=ElementFreedomTable[enl,{110000,110000},nodfat,nodfmt,6]; Ke=PlaneBar2Stiffness[ncoor,Em,A,options] ]; If [type=="BeamCol2", {ni,nj}=enl; ncoor={nodxyz[[ni]],nodxyz[[nj]]}; eftab=ElementFreedomTable[enl,{110001,110001},nodfat,nodfmt,6]; Em=elemat[[e]]; {A,Izz}=elefab[[e]]; options=prcopt; Ke=PlaneBeamColumn2Stiffness[ncoor,Em,{A,Izz},options] ]; If [type=="Trig3", {ni,nj,nk}=enl; ncoor={nodxyz[[ni]],nodxyz[[nj]],nodxyz[[nk]]}; eftab=ElementFreedomTable[enl,{110000,110000,110000},nodfat,nodfmt,6]; Emat=elemat[[e]]; th=elefab[[e]]; options=prcopt; Ke=Trig3IsoPMembraneStiffness[ncoor,Emat,th,options]]; If [MemberQ[eftab,0], Print["Zero entry in eftab for element ",e]; Print["Assembly process aborted"]; Return[K]]; Print["e=",e," type=",type," enl=", enl," eftab=",eftab]; Print["Ke=",Ke//MatrixForm]; neldof=Length[eftab]; For [i=1, i<=neldof, i++, ii=eftab[[i]]; For [j=i, j<=neldof, j++, jj=eftab[[j]]; K[[jj,ii]]=K[[ii,jj]]+=Ke[[i,j]] ]; ]; ]; Return[K]];
2523
2524
Can the returned Element Freedom Table contain zeros? Yes. This scenario is explained in Remark 25.1 (page 2514), which also gives an example. It happens in the case (ii) above. As discussed in the Remark, a zero EFT entry should be normally viewed as a fatal error, and the assembly process terminated. This is in fact done in the assembler listed in Figure 25.12 by the If [MemberQ[eft,0] ... statement.
EXERCISE 25.4
Figure E25.2shows an assembler module that solves this problem. It understands the three element types (bar, beam column and 3-node triangle) used in the problem of Figure E25.1. Running that assembler with the sample script produces the results shown in Figure E25.3. The upper portion of the printout, which simply echoes the element stiffnesses of the trussed frame problem of 25.5.7, is not shown to save space.
e=6 type=Trig3 enl={1, 2, 3} eftab={1, 2, 4, 5, 6, 7} 162. 0. 0. 72. 162. 72. 0. 54. 72. 0. 72. 54. 0. 72. 96. 0. 96. 72. Ke= 72. 0. 0. 288. 72. 288. 162. 72. 96. 72. 258. 144. 72. 54. 72. 288. 144. 342. e=7 type=Trig3 enl={5, 3, 2} eftab={9, 10, 6, 7, 4, 5}
162. 0. 162. 72. 0. 72. 0. 54. 72. 54. 72. 0. 162. 72. 258. 144. 96. 72. Ke= 72. 54. 144. 342. 72. 288. 0. 72. 96. 72. 96. 0. 72. 0. 72. 288. 0. 288. Master Stiffness of Plate-Reinforced Trussed Frame: 337.6 19.2 0 25.6 91.2 312. 72. 0 0 0 0 19.2 90.9 45. 91.2 14.4 72. 76.5 45. 0 0 0 0 45. 120. 0 0 0 45. 60. 0 0 0 25.6 91.2 0 243.2 0 192. 0 0 25.6 91.2 0 91.2 14.4 0 0 804.8 0 776. 0 91.2 14.4 0 312. 72. 0 192. 0 816. 0 0 312. 72. 0 72. 76.5 45. 0 776. 0 929. 0 72. 76.5 45. 0 45. 60. 0 0 0 0 240. 0 45. 60. 0 0 0 25.6 91.2 312. 72. 0 337.6 19.2 0 0 0 0 91.2 14.4 72. 76.5 45. 19.2 90.9 45. 0 0 0 0 0 0 45. 60. 0 45. 120.
Figure E25.3. Results produced by running the assembler of Figure E25.2on the structure of Figure E25.1.
2524
26
261
262
TABLE OF CONTENTS
Page
26.1. Motivation for Sparse Solvers 26.1.1. The Curse of Fullness . . . . . . 26.1.2. The Advantages of Sparsity . . . . . 26.2. Sparse Solution of Stiffness Equations 26.2.1. Skyline Storage Format . . . . . . 26.2.2. Factorization . . . . . . . . . . 26.2.3. Solution . . . . . . . . . . . 26.2.4. Treating MFCs with Lagrange Multipliers 26.3. A SkySolver Implementation 26.3.1. Skymatrix Representation . . . . . 26.3.2. *Skymatrix Factorization . . . . . . 26.3.3. *Solving for One or Multiple RHS . . 26.3.4. *Matrix-Vector Multiply . . . . . . 26.3.5. *Printing and Mapping . . . . . . 26.3.6. *Reconstruction of SkyMatrix from Factors 26.3.7. *Miscellaneous Utilities . . . . . . 26. Exercises . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . .
. . . . . . . . . . . .
. . . .
. . . . . . . . . . . .
. . . .
263 263 264 265 265 266 266 266 267 267 268 2611 2613 2614 2615 2616 2620
262
26.1
In the Direct Stiffness Method (DSM) of nite element analysis, the element stiffness matrices and consistent nodal force vectors are immediately assembled to form the master stiffness matrix and master force vector, respectively, by the process called merge. The assembly process is described in Chapter 25. For simplicity the description that follows assumes that no MultiFreedom Constraints (MFCs) are present. The end result of the assembly process are the master stiffness equations Ku = f (26.1)
where K is the master stiffness matrix, f the vector of node forces and u the vector or node displacements. Upon imposing the displacement boundary conditions, the system (26.1) is solved for the unknown node displacements. The solution concludes the main phase of DSM computations. In practical applications the order of the stiffness system (26.1) can be quite large. Systems of order 1000 to 10000 are routinely solved in commercial software. Larger ones (say up to 100000 equations) are not uncommon and even millions of equations are being solved on suoercomputers. Presently the record is about 50 million equations on parallel computers.1 In linear FEM analysis the cost of solving this system of equations rapidly overwhelms other computational phases. Much attention has therefore given to matrix processing techniques that economize storage and solution time by taking advantage of the special structure of the stiffness matrix. The master force vector is stored as a conventional one-dimensional array of length equal to the number N of degrees of freedom. This storage arrangement presents no particular difculties even for very large problem sizes.2 Handling the master stiffness matrix, however, presents computational difculties. 26.1.1. The Curse of Fullness If K is stored and processed as if it were a full matrix, the storage and processing time resources rapidly becomes prohibitive as N increases. This is illustrated in Table 26.1, which summarizes the storage and factor-time requirements for orders N = 104 , 105 and 106 .3 As regards memory needs, a full square matrix stored without taking advantage of symmetry, requires storage for N 2 entries. If each entry is an 8-byte, double precision oating-point number, the required storage is 8 N 2 bytes. Thus, a matrix of order N = 104 would require 8 108 bytes or 800 MegaBytes (MB) for storage. For large N the solution of (26.1) is dominated by the factorization of K, an operation discussed in 26.2. This operation requires approximately N 3 /6 oating point operation units. [A oating-point operation unit is conventionally dened as a (multiply,add) pair plus associated indexing and data movement operations.] Now a fast workstation can typically do 107 of these operations per second,
1 2
For uid equations solved by uid-voulume methods the number is over 100 million. A force of displacement vector of, say, 1M equations uses 8MB for double precision storage. In these days of GB RAMs, that is a modest amount. The factor times given in that table reect 1998 computer technology. To update to 2003, divide times by 10 to 20.
263
264
Table 26.1 Storage & Solution Time for a Fully-Stored Stiffness Matrix Matrix order N 104 105 106 Storage (double prec) Factor op.units (FLOPS) 1012 /6 1015 /6 1018 /6 Factor time workstation (or fast PC) 3 hrs 4 mos 300 yrs Factor time supercomputer
800 MB 80 GB 8 TB
Table 26.2 Storage & Solution Time for a Skyline Stored Stiffness Matrix Assuming B = N Matrix order N 104 105 106 Storage (double prec) Factor op.units (FLOPS) 108 /2 1010 /2 1012 /2 Factor time workstation (or fast PC) 5 sec 8 min 15 hrs Factor time supercomputer
8 MB 240 MB 8 GB
whereas a supercomputer may be able to sustain 109 or more. These times assume that the entire matrix is kept in RAM; for otherwise the elapsed time may increase by factors of 10 or more due to I/O transfer operations. The elaspsed timed estimated given in Table 26.1 illustrate that for present computer resources, orders above 104 would pose signicant computational difculties. 26.1.2. The Advantages of Sparsity Fortunately a very high percentage of the entries of the master stiffness matrix K are zero. Such matrices are call sparse. There are clever programming techniques that take advantage of sparsity that t certain patterns. Although a comprehensive coverage of such techniques is beyond the scope of this course, we shall concentrate on a particular form of sparse scheme that is widely use in FEM codes: skyline storage. This scheme is simple to understand, manage and implement, while cutting storage and processing times by orders of magnitude as the problems get larger. The skyline storage format is a generalization of its widely used predecessor called the band storage scheme. A matrix stored in accordance with the skyline format will be called a skymatrix for short. Only symmetric skymatrices will bve considered here, since the stiffness matrices in linear FEM are symmetric. If a skymatrix of order N can be stored in S memory locations, the ratio B = S / N is called the mean bandwidth. If the entries are, as usual, 8-byte double-precision oating-point numbers, the N B2 storage requirement is 8 N B bytes. The factorization of a skymatrix requires approximately 1 2 oating-point operation units. In two-dimensional problems B is of the order of N . Under this assumption, storage requirements and estimated factorization times for N = 104 , N = 105 and 264
265
26.2
N = 106 are reworked in Table 26.2. It is seen that by going from full to skyline storage signicant reductions in computer resources have been achieved. For example, now N = 104 is easy on a workstation and trivial on a supercomputer. Even a million equations do not look far-fetched on a supercomputer as long as enough memory is available.4 In preparation for assembling K as a skymatrix one has to set up several auxiliary arrays related to nodes and elements. These auxiliary arrays are described in the previous Chapter. Knowledge of that material is useful for understanding the following description. 26.2. Sparse Solution of Stiffness Equations 26.2.1. Skyline Storage Format The skyline storage arrangement for K is best illustrated through a simple example. Consider the 6 6 stiffness matrix K 11 0 K 13 0 0 K 16 K 22 0 K 24 0 0 K 33 K 34 0 0 K= (26.2) 0 K 46 K 44 K 55 K 56 symm K 66 Since the matrix is symmetric only one half, the upper triangle in the above display, need to be shown. Next we dene the envelope of K as follows. From each diagonal entry move up the corresponding column until the last nonzero entry is found. The envelope separates that entry from the rest of the upper triangle. The remaining zero entries are conventionally removed: K= K 11 K 22 K 13 0 K 33 K 24 K 34 K 44 K 55 symm K 16 0 0 K 46 K 56 K 66
(26.3)
What is left constitute the skyline prole of skyline template of the matrix. A sparse matrix that can be protably stored in this form is called a skymatrix for brevity. Notice that the skyline prole may include zero entries. During the factorization step discussed below these zero entries will in general become nonzero, a phenomenon that receives the name ll-in.
4
On a PC or laptop with a 32-bit processor, there is a RAM hard barrier because of hardware addressing limitations. That is typically 2GB. As PCs migrate to 64-bit processors over the next 10 years, the barrier disappears. For example the high-end Mac workstation can presently be expanded up to 16GB RAM. The new limits are primarily dictated by power comsumption, circuitry and cooling considerations. A distributed (Beowulf) network is a practical solution to go beyond the individual machine limits.
265
266
The key observation is that only the entries in the skyline template need to be stored, because ll-in in the factorization process will not occur outside the envelope. To store these entries it is convenient to use a one-dimensional skyline array: s: [ K 11 , K 22 , K 13 , 0, K 33 , K 24 , K 34 , K 44 , K 55 , K 16 , 0, 0, K 46 , K 56 , K 66 ] (26.4)
This array is complemented by a ( N + 1) integer array p that contains addresses of diagonal locations. The array has N + 1 entries. The (i + 1)th entry of p has the location of the i th diagonal entry of K in s. For the example matrix: p: [ 0, 1, 2, 5, 8, 9, 15 ] (26.5)
In the previous Chapter, this array was called the Global Skyline Diagonal Location Table, or GSDLT. Equations for which the displacement component is prescribed are identied by a negative diagonal location value. For example if u 3 and u 5 are prescribed displacement components in the test example, then p : [ 0, 1, 2, 5, 8, 9, 15 ] (26.6)
Remark 26.1. In Fortran it is convenient to dimension the diagonal location array as p(0:n) so that indexing begins at zero. In C this is the standard indexing.
26.2.2. Factorization The stiffness equations (26.1) are solved by a direct method that involves two basic phases: factorization and solution. In the rst stage, the skyline-stored symmetric stiffness matrix is factored as K = LDU = LDLT = UT DU, (26.7)
where L is a unit lower triangular matrix, D is a nonsingular diagonal matrix, and U and L are the transpose of each other. The original matrix is overwritten by the entries of D1 and U; details may be followed in the program implementation. No pivoting is used in the factorization process. This factorization is carried out by Mathematica module SymmSkyMatrixFactor, which is described later in this Chapter. 26.2.3. Solution Once K has been factored, the solution u for a given right hand side f is obtained by carrying out three stages: Forward reduction : Diagonal scaling : Back substitution : Lz = f, Dy = z, Uu = y, (26.8) (26.9) (26.10)
where y and z are intermediate vectors. These stages are carried out by Mathematica modules SymmSkyMatrixVectorSolve, which is described later. 266
267
26.3
A SKYSOLVER IMPLEMENTATION
26.2.4. Treating MFCs with Lagrange Multipliers In Mathematica implementations of FEM, MultiFreedom Constraints (MFCs) are treated with Lagrange multipliers. There is one multiplier for each constraint. The multipliers are placed at the end of the solution vector. Specically, let the nummul>0 MFCs be represented in matrix form as Cu = g, where C and g are given, and let the nummul multipliers be collected in a vector . The multiplier-augmented master stiffness equations are u f K CT = (26.11) C 0 g or Ax = b. (26.12) where the symmetric matrix A, called a stiffness-bordered matrix, is of order numdof+nummul. The stiffness bordered matrix is also stored in skyline form, and the previous solution procedure applies, as long as the skyline array is properly constructed as described in the previous Chapter. The main difference with respect to the no-MFC case is that, because of the conguration (26.11), A can no longer be positive denite. In principle pivoting should be used during the factorization of A to forestall possible numerical instabilities. Pivoting can have a detrimental effect on solution efciency because entries can move outside of the skyline template. However, by placing the at the end such difculties will not be encountered if K is positive denite, and the constraints are linearly independent (that is, C has full rank). Thus pivoting is not necessary. 26.3. A SkySolver Implementation The remaining sections of this revised Chapter describe a recent implementation of the skyline solver and related routines in Mathematica. This has been based on similar Fortran codes used since 1967. 26.3.1. Skymatrix Representation In what follows the computer representation in Mathematica of a symmetric skymatrix will be generally denoted by the symbol S. Such a representation consists of a list of two numeric objects: S = { p, s } (26.13)
Here p=GSDLT is the Global Skyline Diagonal Location Table introduced in 11.6, and s is the array of skymatrix entries, arranged as described in the previous section. This array usually consists of oating-point numbers, but it may also contain exact integers or factions, or even symbolic entries. For example, suppose that the numerical entries of the 6 6 skymatrix (26.10) are actually 11 13 16 22 0 24 0 33 34 0 K= (26.14) 44 46 55 56 symm 66 267
268
Its Mathematica representation, using the symbols (26.13) is p= { 0,1,2,5,8,9,15 }; s= { 11,22,13,0,33,24,34,44,55,16,0,0,46,56,66 }; S= { p, s }; or more directly S={ { 0,1,2,5,8,9,15 },{ 11,22,13,0,33,24,34,44,55,16,0,0,46,56,66 } }; (26.16)
(26.15)
[The remaining sections on details of skyline processing logic, marked with a *, will not be covered in class. They are intended for a more advanced course.]
268
269
26.3.2. *Skymatrix Factorization Module SymmSkyMatrixFactor, listed in Cell 26.1, factors a symmetric skymatrix into the product LDU where L is the transpose of U. No pivoting is used. The module is invoked as { Sf,fail } = SymmSkyMatrixFactor[S,tol] The input arguments are S tol The skymatrix to be factored, stored as the two-object list { p,s }; see previous subsection. Tolerance for singularity test. The appropriate value of tol depends on the kind of skymatrix entries stored in s. If the skymatrix entries are oating-point numbers handled by default in double precision arithmetic, tol should be set to 8 or 10 the machine precision in that kind of arithmetic. The factorization aborts if, when processing the j-th row, d j tol r j , where d j is the computed j th diagonal entry of D, and r j is the Euclidean norm of the j th skymatrix row. If the skymatrix entries are exact (integers, fractions or symbols), tol should be set to zero. In this case exact singularity is detectable, and the factorization aborts only on that condition. The outputs are: Sf If fail is zero on exit, Sf is the computed factorization of S. It is a two-object list { p, du
269
2610
1 2 3 4 5
1.0000 1.0000
1 2 3 4 5 1 + 2 + 3 + + 4 + 5 + + + eigs={3.9563, 2.20906, 1., 0.661739, 0.172909} Assumed x={{1., 3., -4.}, {2., 3., 3.}, {3., 3., -2.}, {4., 3., 1.}, {5., 3., 0}} b=Ax={{1., 3., -4.}, {5., 6., 1.}, {13., 12., -1.}, {9., 6., 1.}, {22., 15., -1.}} {0.0666667 Second, {{{0, 1, 2, 4, 5, 8}, {1., 1., 1., 1., 1., 1., 1., 1.}}, 0}} F={{0, 1, 2, 4, 5, 8}, {1., 1., 1., 1., 1., 1., 1., 1.}} fail=0 Factor: Col 1 Col 2 Col 3 Col 4 Col 5 Row 1 1.0000 Row 2 1.0000 Row 3 1.0000 1.0000 Row 4 1.0000 Row 5 1.0000 1.0000 1.0000 Computed x={{1., 3., -4.}, {2., 3., 3.}, {3., 3., -2.}, {4., 3., 1.}, {5., 3., 0.}}
}, where du stores the entries of D1 in the diagonal locations, and of U in its strict upper triangle. fail A singularity detection indicator. A zero value indicates that no singularity was detected. If fail returns j>0, the factorization was aborted at the j-th row. In this case Sf returns the aborted factorization with stored in d j .
2610
2611
Cell 26.4 Solving for a Single RHS SymmSkyMatrixVectorSolve[S_,b_]:= Module[ {p,a,n,i,j,k,m,ii,jj,bi,x}, {p,a}=S; n=Length[p]-1; x=b; If [n!=Length[x], Print["Inconsistent matrix dimensions in", " SymmSkyMatrixVectorSolve"]; Return[Null]]; Do [ii=p[[i+1]];If [ii>=0, Continue[]]; ii=-ii; k=i-ii+Abs[p[[i]]]+1; bi=x[[i]]; If [bi==0, Continue[]]; Do [jj=p[[j+1]], If [jj<0, Continue[]]; m=j-i; If [m<0, x[[j]]-=a[[ii+m]]*bi; Break[]]; ij=jj-m; If [ij>Abs[p[[j]]], x[[j]]-=a[[ij]]*bi], {j,k,n}], {i,1,n}]; Do [ii=p[[i+1]]; If [ii<0, x[[i]]=0; Continue[]]; imi=Abs[p[[i]]]; m=ii-imi-1; x[[i]]-=Take[a,{imi+1,imi+m}].Take[x,{i-m,i-1}], {i,1,n}]; Do [ii=Abs[p[[i+1]]]; x[[i]]*=a[[ii]], {i,1,n}]; Do [ii=p[[i+1]]; If [ii<0, x[[i]]=b[[i]]; Continue[]]; m=ii-Abs[p[[i]]]-1; Do [ x[[i-j]]-=a[[ii-j]]*x[[i]], {j,1,m}], {i,n,1,-1}]; Return[x] ];
A test of SymmSkyMatrixFactor on the matrix (26.14) is shown in Cells 26.2 and 26.3. The modules that print and produce skyline maps used in the test program are described later in this Chapter. 26.3.3. *Solving for One or Multiple RHS Module SymmSkyMatrixVectorSolve, listed in Cell 26.4, solves the linear system Ax = b for x, following the factorization of the symmetric skymatrix A by SymmSkyMatrixFactor. The module is invoked as x = SymmSkyMatrixVectorSolve[Sf,b] The input arguments are Sf b The outputs are: x The computed solution vector, stored as a single-level (one-dimensional) list. Prescribed solution components return the value of the entry in b. The factored matrix returned by SymmSkyMatrixFactor. The right-hand side vector to be solved for, stored as a single-level (one dimensional) list. If the i-th entry of x is prescribed, the known value must be supplied in this vector.
Sometimes it is necessary to solve linear systems for multiple (m > 1) right hand sides. One way to do that is to call SymmSkyMatrixVectorSolve repeatedly. Alternatively, if m right hand sides are collected as columns of a rectangular matrix B, module SymmSkyMatrixColBlockSolve may be invoked as
2611
2612
Cell 26.5 Solving for a Block of Righ Hand Sides SymmSkyMatrixColBlockSolve[S_,b_]:= Module[ {p,a,n,nrhs,i,j,k,m,r,ii,jj,bi,x}, {p,a}=S; n=Length[p]-1; x=b; If [n!=Dimensions[x][[1]], Print["Inconsistent matrix dimensions in", " SymmSkyMatrixBlockColSolve"]; Return[Null]]; nrhs = Dimensions[x][[2]]; Do [ii=p[[i+1]];If [ii>=0, Continue[]]; ii=-ii; k=i-ii+Abs[p[[i]]]+1; Do [bi=x[[i,r]]; If [bi==0, Continue[]]; Do [jj=p[[j+1]], If [jj<0, Continue[]]; m=j-i; If [m<0,x[[j,r]]-=a[[ii+m]]*bi; Break[]]; ij=jj-m; If [ij>Abs[p[[j]]], x[[j,r]]-=a[[ij]]*bi], {j,k,n}], {r,1,nrhs}], {i,1,n}]; Do [ii=p[[i+1]]; If [ii<0, Do[x[[i,r]]=0,{r,1,nrhs}];Continue[]]; imi=Abs[p[[i]]]; m=ii-imi-1; Do [ Do [ x[[i,r]]-=a[[imi+j]]*x[[i-m+j-1,r]], {j,1,m}], {r,1,nrhs}], {i,1,n}]; Do [ii=Abs[p[[i+1]]]; Do[x[[i,r]]*=a[[ii]], {r,1,nrhs}], {i,1,n}]; Do [ii=p[[i+1]]; If [ii<0, Do[x[[i,r]]=b[[i,r]],{r,1,nrhs}];Continue[]]; m=ii-Abs[p[[i]]]-1; Do [ Do [ x[[i-j,r]]-=a[[ii-j]]*x[[i,r]], {j,1,m}], {r,1,nrhs}], {i,n,1,-1}]; Return[x] ]; SymmSkyMatrixRowBlockSolve[S_,b_]:= Module[ {p,a,n,nrhs,i,j,k,m,r,ii,jj,bi,x}, {p,a}=S; n=Length[p]-1; x=b; If [n!=Dimensions[x][[2]], Print["Inconsistent matrix dimensions in", " SymmSkyMatrixBlockRowSolve"]; Return[Null]]; nrhs = Dimensions[x][[1]]; Do [ii=p[[i+1]];If [ii>=0, Continue[]]; ii=-ii; k=i-ii+Abs[p[[i]]]+1; Do [bi=x[[r,i]]; If [bi==0, Continue[]]; Do [jj=p[[j+1]], If [jj<0, Continue[]]; m=j-i; If [m<0,x[[j,r]]-=a[[ii+m]]*bi; Break[]]; ij=jj-m; If [ij>Abs[p[[j]]], x[[r,j]]-=a[[ij]]*bi], {j,k,n}], {r,1,nrhs}], {i,1,n}]; Do [ii=p[[i+1]]; If [ii<0, Do[x[[r,i]]=0,{r,1,nrhs}];Continue[]]; imi=Abs[p[[i]]]; m=ii-imi-1; Do [ Do [ x[[r,i]]-=a[[imi+j]]*x[[r,i-m+j-1]], {j,1,m}], {r,1,nrhs}], {i,1,n}]; Do [ii=Abs[p[[i+1]]]; Do[x[[r,i]]*=a[[ii]], {r,1,nrhs}], {i,1,n}]; Do [ii=p[[i+1]]; If [ii<0, Do[x[[r,i]]=b[[r,i]],{r,1,nrhs}];Continue[]]; m=ii-Abs[p[[i]]]-1; Do [ Do [ x[[r,i-j]]-=a[[ii-j]]*x[[r,i]], {j,1,m}], {r,1,nrhs}], {i,n,1,-1}]; Return[x] ];
2612
2613
Cell 26.6 Multiplying Skymatrix by Individual Vector SymmSkyMatrixVectorMultiply[S_,x_]:= Module[ {p,a,n,i,j,k,m,ii,b}, {p,a}=S; n=Length[p]-1; If [n!=Length[x], Print["Inconsistent matrix dimensions in", " SymmSkyMatrixVectorMultiply"]; Return[Null]]; b=Table[a[[ Abs[p[[i+1]]] ]]*x[[i]], {i,1,n}]; Do [ii=Abs[p[[i+1]]]; m=ii-Abs[p[[i]]]-1; If [m<=0,Continue[]]; b[[i]]+=Take[a,{ii-m,ii-1}].Take[x,{i-m,i-1}]; Do [b[[i-k]]+=a[[ii-k]]*x[[i]],{k,1,m}], {i,1,n}]; Return[b] ]; (* ClearAll[n]; n=10; SeedRandom[314159]; p=Table[0,{n+1}]; Do[p[[i+1]]=p[[i]]+ Max[1,Min[i,Round[Random[]*i]]],{i,1,n}]; a=Table[1.,{i,1,p[[n+1]]}]; Print["Mean Band=",N[p[[n+1]]/n]]; S={p,a}; Sr=SymmSkyMatrixLDUReconstruct[S]; Print["Reconstructed SkyMatrix:"]; SymmSkyMatrixLowerTrianglePrint[Sr]; SymmSkyMatrixLowerTriangleMap[Sr]; x=Table[1.,{i,1,n}]; b=SymmSkyMatrixVectorMultiply[Sr,x]; Print["b=Ax=",b];*)
X = SymmSkyMatrixVectorSolve[Sf,B] to provide the solution X of SX = B. This module is listed in Cell 26.5. The input arguments and function returns have the same function as those described for SymmSkyMatrixVectorSolve. The main difference is that B and X are matrices (two-dimensional lists) with the righ-hand side and solution vectors as columns. There is a similar module SymmSkyMatrixRowBlockSolve, notlisted here, which solves for multiple right hand sides stored as rows of a matrix. 26.3.4. *Matrix-Vector Multiply For various applications it is necessary to form the matrix-vector product b = Sx where S is a symmetric skymatrix and x is given. This is done by module SymmSkyMatrixVectorMultiply, which is listed in Cell 26.6. Its arguments are the skymatrix S and the vector x. The function returns Sx in b. Module SymmSkyMatrixColBlockMultiply implements the multiplication by a block of vectors stored as columns of a rectangular matrix X: B = SX (26.18) (26.17)
2613
2614
Cell 26.7 Multiplying Skymatrix by Vector Block SymmSkyMatrixColBlockMultiply[S_,x_]:= Module[ {p,a,n,nrhs,i,j,k,m,r,ii,aij,b}, {p,a}=S; n=Length[p]-1; If [n!=Dimensions[x][[1]], Print["Inconsistent matrix dimensions in", " SymmSkyMatrixColBlockMultiply"]; Return[Null]]; nrhs = Dimensions[x][[2]]; b=Table[0,{n},{nrhs}]; Do [ii=Abs[p[[i+1]]]; m=ii-Abs[p[[i]]]-1; Do [b[[i,r]]=a[[ii]]*x[[i,r]], {r,1,nrhs}]; Do [j=i-k; aij=a[[ii-k]]; If [aij==0, Continue[]]; Do [b[[i,r]]+=aij*x[[j,r]]; b[[j,r]]+=aij*x[[i,r]], {r,1,nrhs}], {k,1,m}], {i,1,n}]; Return[b] ]; SymmSkyMatrixRowBlockMultiply[S_,x_]:= Module[ {p,a,n,nrhs,i,j,k,m,r,ii,aij,b}, {p,a}=S; n=Length[p]-1; If [n!=Dimensions[x][[2]], Print["Inconsistent matrix dimensions in", " SymmSkyMatrixRowBlockMultiply"]; Return[Null]]; nrhs = Dimensions[x][[1]]; b=Table[0,{nrhs},{n}]; Do [ii=Abs[p[[i+1]]]; m=ii-Abs[p[[i]]]-1; Do [b[[r,i]]=a[[ii]]*x[[r,i]], {r,1,nrhs}]; Do [j=i-k; aij=a[[ii-k]]; If [aij==0, Continue[]]; Do [b[[r,i]]+=aij*x[[r,j]]; b[[r,j]]+=aij*x[[r,i]], {r,1,nrhs}], {k,1,m}], {i,1,n}]; Return[b] ];
This module is listed in Cell 26.7. Its arguments are the skymatrix S and the rectangular matrix X. The function returns SX in B. There is a similar module SymmSkyMatrixRowBlockMultiply, also listed in Cell 26.7, which postmultiplies a vector block stored as rows. 26.3.5. *Printing and Mapping Module SymmSkyMatrixUpperTrianglePrint, listed in Cell 26.8, prints a symmetric skymatrix in upper triangle form. Is is invoked as SymmSkyMatrixUpperTrianglePrint[S] where S is the skymatrix to be printed. For an example of use see Cells 262-3. The print format resembles the conguration depicted in Section 26.1. This kind of print is useful for program
2614
2615
development and debugging although of course it should not be attempted with a very large matrix.5 There is a similar module called SymmSkyMatrixLowerTrianglePrint, which displays the skymatrix entries in lower triangular form. This module is also listed in Cell 26.8. Sometimes one is not interested in the actual values of the skymatrix entries but only on how the skyline template looks like. Such displays, called maps, can be done with just one symbol per entry. Module SymmSkyMatrixUpperTriangleMap, listed in Cell 26.9, produces a map of its argument. It is invoked as SymmSkyMatrixUpperTriangleMap[S] The entries within the skyline template are displayed by symbols +, - and 0, depending on whether the value is positive, negative or zero, respectively. Entries outside the skyline template are blank. As in the case of the print module, there is module SymmSkyMatrixLowerTriangleMap which is also listed in Cell 26.9. 26.3.6. *Reconstruction of SkyMatrix from Factors In testing factorization and solving modules it is convenient to have modules that perform the inverse process of the factorization. More specically, suppose that U, D (or D1 ) are given, and the problem is to reconstruct the skymatrix that have them as factors: S = LDU,
T
or
S = LD1 U
(26.19)
in which L = U . Modules SymmSkyMatrixLDUReconstruction and SymmSkyMatrixLDinvUReconstruction perform those operations. These modules are listed in Cell 26.10. Their argument is a factored form of S: U and D in the rst case, and U and D1 in the second case.
Computer oriented readers may notice that the code for the printing routine is substantially more complex than those of the computational modules. This is primarily due to the inadequacies of Mathematica in handling tabular format output. The corresponding Fortran or C implementations would be simpler because those languages provide much better control over low-level display.
2615
2616
Cell 26.8 Skymatrix Printing SymmSkyMatrixLowerTrianglePrint[S_]:= Module[ {p,a,cycle,i,ii,ij,it,j,jj,j1,j2,jref,jbeg,jend,jt,kcmax,kc,kr,m,n,c,t}, {p,a}=S; n=Dimensions[p][[1]]-1; kcmax=5; jref=0; Label[cycle]; Print[" "]; jbeg=jref+1; jend=Min[jref+kcmax,n]; kc=jend-jref; t=Table[" ",{n-jref+1},{kc+1}]; Do [If [p[[j+1]]>0,c=" ",c="*"]; t[[1,j-jref+1]]=StringJoin[c,"Col",ToString[PaddedForm[j,3]]], {j,jbeg,jend}]; it=1; Do [ii=Abs[p[[i+1]]]; m=ii-Abs[p[[i]]]-1; j1=Max[i-m,jbeg];j2=Min[i,jend]; kr=j2-j1+1; If [kr<=0, Continue[]]; If [p[[i+1]]>0,c=" ",c="*"]; it++; t[[it,1]]=StringJoin[c,"Row",ToString[PaddedForm[i,3]]]; jt=j1-jbeg+2; ij=j1+ii-i; Do[t[[it,jt++]]=PaddedForm[a[[ij++]]//FortranForm,{7,4}],{j,1,kr}], {i,jbeg,n}]; Print[TableForm[Take[t,it],TableAlignments->{Right,Right}, TableDirections->{Column,Row},TableSpacing->{0,2}]]; jref=jend; If[jref<n,Goto[cycle]]; ]; SymmSkyMatrixUpperTrianglePrint[S_]:= Module[ {p,a,cycle,i,ij,it,j,j1,j2,jref,jbeg,jend,kcmax,k,kc,m,n,c,t}, {p,a}=S; n=Dimensions[p][[1]]-1; kcmax=5; jref=0; Label[cycle]; Print[" "]; jbeg=jref+1; jend=Min[jref+kcmax,n]; kc=jend-jref; t=Table[" ",{jend+1},{kc+1}]; Do [If [p[[j+1]]>0,c=" ",c="*"]; t[[1,j-jref+1]]=StringJoin[c,"Col",ToString[PaddedForm[j,3]]], {j,jbeg,jend}]; it=1; Do [it++; If [p[[i+1]]>0,c=" ",c="*"]; t[[it,1]]=StringJoin[c,"Row",ToString[PaddedForm[i,3]]]; j=jref; Do [j++; If [j<i, Continue[]]; ij=Abs[p[[j+1]]]+i-j; If [ij<=Abs[p[[j]]], Continue[]]; t[[it,k+1]]=PaddedForm[a[[ij]]//FortranForm,{7,4}], {k,1,kc}], {i,1,jend}]; Print[TableForm[Take[t,it],TableAlignments->{Right,Right}, TableDirections->{Column,Row},TableSpacing->{0,2}]]; jref=jend; If[jref<n,Goto[cycle]]; ]; Sr={{0, 1, 3, 6}, {1., 2., 7., 4., 23., 97.}}; SymmSkyMatrixLowerTrianglePrint[Sr];SymmSkyMatrixUpperTrianglePrint[Sr];
2616
2617
SymmSkyMatrixLowerTriangleMap[S_]:=Module[ {p,a,cycle,i,ii,ij,it,itop,j,jj,j1,j2,jref,jbeg,jend,jt,kcmax,kc,kr,m,n,c,t}, {p,a}=S; n=Dimensions[p][[1]]-1; kcmax=40; jref=0; Label[cycle]; Print[" "]; jbeg=jref+1; jend=Min[jref+kcmax,n]; kc=jend-jref; itop=2; If[jend>9,itop=3]; If[jend>99,itop=4]; If[jend>999,itop=5]; t=Table[" ",{n-jref+itop},{kc+1}]; it=0; If [itop>=5, it++; Do [m=Floor[j/1000]; If[m>0,t[[it,j-jref+1]]=ToString[Mod[m,10]]], {j,jbeg,jend}]]; If [itop>=4, it++; Do [m=Floor[j/100]; If[m>0,t[[it,j-jref+1]]=ToString[Mod[m,10]]], {j,jbeg,jend}]]; If [itop>=3, it++; Do [m=Floor[j/10]; If[m>0,t[[it,j-jref+1]]=ToString[Mod[m,10]]], {j,jbeg,jend}]]; it++; Do[t[[it,j-jref+1]]=ToString[Mod[j,10]],{j,jbeg,jend}]; it++; Do[If[p[[j+1]]<0,t[[it,j-jref+1]]="*"],{j,jbeg,jend}]; Do [ii=Abs[p[[i+1]]]; m=ii-Abs[p[[i]]]-1; j1=Max[i-m,jbeg];j2=Min[i,jend]; kr=j2-j1+1; If [kr<=0, Continue[]]; If [p[[i+1]]>0,c=" ",c="*"]; it++; t[[it,1]]=StringJoin[ToString[PaddedForm[i,2]],c]; jt=j1-jbeg+2; ij=j1+ii-i; Do [ c=" 0"; If[a[[ij]]>0,c=" +"]; If[a[[ij++]]<0,c=" -"]; t[[it,jt++]]=c, {j,1,kr}], {i,jbeg,n}]; Print[TableForm[Take[t,it],TableAlignments->{Right,Right}, TableDirections->{Column,Row},TableSpacing->{0,0}]]; jref=jend; If[jref<n,Goto[cycle]]; ]; SymmSkyMatrixUpperTriangleMap[S_]:=Module[ {p,a,cycle,i,ij,it,itop,j,j1,j2,jref,jbeg,jend,kcmax,k,kc,m,n,c,t}, {p,a}=S; n=Dimensions[p][[1]]-1; kcmax=40; jref=0; Label[cycle]; Print[" "]; jbeg=jref+1; jend=Min[jref+kcmax,n]; kc=jend-jref; itop=2; If[jend>9,itop=3]; If[jend>99,itop=4]; If[jend>999,itop=5]; t=Table[" ",{jend+itop},{kc+1}]; it=0; If [itop>=5, it++; Do [m=Floor[j/1000]; If[m>0,t[[it,j-jref+1]]=ToString[Mod[m,10]]], {j,jbeg,jend}]]; If [itop>=4, it++; Do [m=Floor[j/100]; If[m>0,t[[it,j-jref+1]]=ToString[Mod[m,10]]], {j,jbeg,jend}]]; If [itop>=3, it++; Do [m=Floor[j/10]; If[m>0,t[[it,j-jref+1]]=ToString[Mod[m,10]]], {j,jbeg,jend}]]; it++; Do[t[[it,j-jref+1]]=ToString[Mod[j,10]],{j,jbeg,jend}]; it++; Do[If[p[[j+1]]<0,t[[it,j-jref+1]]="*"],{j,jbeg,jend}]; Do [it++; If [p[[i+1]]>0,c=" ",c="*"]; t[[it,1]]=StringJoin[ToString[PaddedForm[i,2]],c]; j=jref; Do [j++; If [j<i, Continue[]]; ij=Abs[p[[j+1]]]+i-j; If [ij<=Abs[p[[j]]], Continue[]]; c=" 0"; If[a[[ij]]>0,c=" +"]; If[a[[ij++]]<0,c=" -"]; t[[it,k+1]]=c, {k,1,kc}], {i,1,jend}]; Print[TableForm[Take[t,it],TableAlignments->{Right,Right}, TableDirections->{Column,Row},TableSpacing->{0,0}]]; jref=jend; If[jref<n,Goto[cycle]]; ];
2617
2618
Cell 26.10 Skymatrix Reconstruction from Factors SymmSkyMatrixLDUReconstruct[S_]:= Module[ {p,ldu,a,v,n,i,ii,ij,j,jj,jk,jmj,k,m}, {p,ldu}=S; a=ldu; n=Length[p]-1; v=Table[0,{n}]; Do [jmj=Abs[p[[j]]]; jj=p[[j+1]]; If [jj<0, Continue[]]; jk=jj-jmj; v[[jk]]=ldu[[jj]]; Do [ij=jmj+k; i=j+ij-jj; ii=p[[i+1]]; If [ii<0, v[[k]]=0; Continue[]]; If [i!=j, v[[k]]=ldu[[ij]]*ldu[[ii]]]; m=Min[ii-Abs[p[[i]]],k]; a[[ij]]= v[[k]]; a[[ij]]+=Take[ldu,{ii-m+1,ii-1}].Take[v,{k-m+1,k-1}], {k,1,jk}], {j,1,n}]; Return[{p,a}]; ]; SymmSkyMatrixLDinvUReconstruct[S_]:= Module[ {p,ldu,a,v,n,i,ii,ij,j,jj,jk,jmj,k,m}, {p,ldu}=S; a=ldu; n=Length[p]-1; v=Table[0,{n}]; Do [jmj=Abs[p[[j]]]; jj=p[[j+1]]; If [jj<0, Continue[]]; jk=jj-jmj; v[[jk]]=1/ldu[[jj]]; Do [ij=jmj+k; i=j+ij-jj; ii=p[[i+1]]; If [ii<0, v[[k]]=0; Continue[]]; If [i!=j, v[[k]]=ldu[[ij]]/ldu[[ii]]]; m=Min[ii-Abs[p[[i]]],k]; a[[ij]]= v[[k]]; a[[ij]]+=Take[ldu,{ii-m+1,ii-1}].Take[v,{k-m+1,k-1}], {k,1,jk}], {j,1,n}]; Return[{p,a}]; ]; p={0,1,2,5,8,9,15}; s={11,22,13,0,33,24,34,44,55,16,0,0,46,56,66}; S={p,s}; Sr=SymmSkyMatrixLDinvUReconstruct[S]; Print[Sr//InputForm]; Print[SymmSkyMatrixFactor[Sr,0]];
26.3.7. *Miscellaneous Utilities Finally, Cell 26.11 lists three miscellaneous modules. The most useful one is probably SymmSkyMatrixConvertToFull, which converts its skymatrix argument to a fully stored symmetric matrix. This is useful for things like a quick and dirty computation of eigenvalues: Print[Eigenvalues[SymmSkyMatrixConvertToFull[S]]]; because Mathematica built-in eigensolvers require that the matrix be supplied in full storage form.
2618
2619
26.3
A SKYSOLVER IMPLEMENTATION
SymmSkyMatrixConvertToFull[S_]:= Module[ {p,a,aa,n,j,jj,jmj,k}, {p,a}=S; n=Length[p]-1; aa=Table[0,{n},{n}]; Do [jmj=Abs[p[[j]]]; jj=Abs[p[[j+1]]]; aa[[j,j]]=a[[jj]]; Do [aa[[j,j-k]]=aa[[j-k,j]]=a[[jj-k]],{k,1,jj-jmj-1}], {j,1,n}]; Return[aa]; ]; SymmSkyMatrixConvertUnitUpperTriangleToFull[S_]:= Module[ {p,ldu,aa,n,j,jj,jmj,k}, {p,ldu}=S; n=Length[p]-1; aa=Table[0,{n},{n}]; Do [jmj=Abs[p[[j]]]; jj=Abs[p[[j+1]]]; aa[[j,j]]=1; Do [aa[[j-k,j]]=ldu[[jj-k]],{k,1,jj-jmj-1}], {j,1,n}]; Return[aa]; ]; SymmSkyMatrixConvertDiagonalToFull[S_]:= Module[ {p,ldu,aa,n,i,j,jj,jmj,k}, {p,ldu}=S; n=Length[p]-1; aa=Table[0,{n},{n}]; Do [jj=Abs[p[[j+1]]]; aa[[j,j]]=ldu[[jj]], {j,1,n}]; Return[aa]; ];
2619
2620
u 1, f1
(1)
u 2, f2
(2)
u 3, f3
(3)
u 4, f4
(4)
u 5, f5
EXERCISE 26.1 [A/C:10+10+15] Consider the 4-element assembly of bar elements shown in Figure 26.1.
The only degree of freedom at each node is a translation along x . The element stiffness matrix of each element is 1 1 (E26.1) K(e) = 1 1 (a) (b) (c) Assemble the 5 5 master stiffness matrix K showing it as a full symmetric matrix. Hint: the diagonal entries are 1, 2, 2, 2, 1. Show K stored as a skyline matrix using a representation like illustrated in (26.15). Hint p = { 0, 1, 3, 5, 7, 9}. Perform the symmetric factorization K = LDLT of (26.7), where K is stored as a full matrix to simplify hand work.6 Show that the entries of D are 1, 1, 1, 1 and 0, which mean that K is singular. Why?
You can do this with Mathematica using the function LUDecomposition, but hand work is as quick.
2620
Introduction to FEM
Introduction to FEM
26
IFEM Ch 26 Slide 1
Introduction to FEM
Assembler
Equation Solver
IFEM Ch 26 Slide 2
Introduction to FEM
time numbers last adjusted in 1998 to get current times divide by 10-20
IFEM Ch 26 Slide 3
Introduction to FEM
NF = 50
(13)
17 18 19 20
(1)
2 3 7
(5) (6)
8
(9)
12 13
(2) (3)
4 9
(7) (8)
10
K=
(4)
5
(12) (16)
15
IFEM Ch 26 Slide 4
Introduction to FEM
time numbers last adjusted in 1998 to get current times divide by 10-20
IFEM Ch 26 Slide 5
Introduction to FEM
IFEM Ch 26 Slide 6
Introduction to FEM
Skyline "template"
symm
Mathematica representation p = { 0, 1, 2, 5, 8, 15}; s = {11, 22, 13, 0, 33, 24, 34, 44, 55, 16, 0, 0, 46, 66}; S = { p, s};
IFEM Ch 26 Slide 7
Introduction to FEM
IFEM Ch 26 Slide 8
Introduction to FEM
IFEM Ch 26 Slide 9
Introduction to FEM
IFEM Ch 26 Slide 10
Introduction to FEM
24 34 44
symm
IFEM Ch 26 Slide 11
Introduction to FEM
24 34 44
symm
IFEM Ch 26 Slide 12
27
271
272
TABLE OF CONTENTS
Page
27.1. Introduction 27.2. Analysis Stages 27.3. Model Denition 27.3.1. Benchmark Problems . . . . 27.3.2. Node Coordinates . . . . . 27.3.3. Element Type . . . . . . 27.3.4. Element Connectivity . . . . 27.3.5. Material Properties . . . . 27.3.6. Fabrication Properties . . . . 27.3.7. Node Freedom Tags . . . . 27.3.8. Node Freedom Values . . . . 27.3.9. Processing Options . . . . 27.3.10. Model Display Utility . . . . 27.3.11. Model Denition Print Utilities 27.3.12. Model Denition Script Samples 27.4. Processing 27.4.1. Processing Tasks . . . . . 27.5. Postprocessing 27.5.1. Result Print Utilities . . . . 27.5.2. Displacement Field Contour Plots 27.5.3. Stress Field Contour Plots . . . 27.5.4. Animation . . . . . . . 27.6. A Complete Problem Script Cell 27. Notes and Bibliography . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . .
273 273 273 274 274 276 276 278 278 279 279 2710 2710 2710 2710 2712 2712 2714 2714 2715 2715 2716 2716 2718
272
27.3
MODEL DEFINITION
This Chapter describes a complete nite element program for analysis of plane stress problems. Unlike the previous chapters the description is top down, i.e. starts from the main driver down to more specic modules. The program can support questions given in the take-home nal exam, if they pertain to the analysis of given plane stress problems. Consequently this Chapter serves as an informal users manual. 27.2. Analysis Stages As in all DSM-based FEM programs, the analysis of plane stress problems involves three major stages: (I) preprocessing or model denition, (II) processing, and (III) postprocessing. The preprocessing portion of the plane stress analysis is done by the rst part of the problem script, driver program, already encountered in Chapters 21-22. The script directly sets the problem data structures. Preprocessing tasks include: I.1 I.2 Model denition by direct setting of the data structures. Plot of the FEM mesh for verication. At the minimum this involves producing a mesh picture that shows nodes and element labels. Assembly of the master stiffness equations Ku = f. The plane stress assembler is of multiple element type (MET). This kind of assembler was discussed in 27.4. Element types include various plane stress Iso-P models as well as bars. = Application of displacement BC by a modication method that produces Ku f. The same modules described in 21.3.3 are used, since those are application problem independent. Solution of the modied equations for node displacements u. The built-in Mathematica function LinearSolve is used for this task.
II.2 II.3
Upon executing the processing steps, the nodal displacement solution is available. The postprocessing stage embodies three tasks: III.1 Recovery of node forces including reactions through built-in matrix multiplication f = Ku. III.2 Recovery of plate stresses and bar forces (if bars are present). The former are subject to interelement averaging (Chapter 28) to get nodal stresses. III.3 Print and plotting of results. 27.3. Model Denition The model-denition data may be broken down into three sets, which are listed below by order of appearance: Geometry data: node coordinates Model denition Element data: type, connectivity, material and fabrication Degree of freedom (DOF) activity data: force and displacement BCs (27.1) The element data is broken down into four subsets: type, connnectivity, material and fabrication, each of which has its own data structure. The degree of freedom data is broken into two subsets: 273
274
Table 27.1. Plane Stress Model Denition Data Structures Long name NodeCoordinates ElemTypes ElemNodes ElemMaterials ElemFabrications NodeDOFTags NodeDOFValues ProcessOptions Short name nodxyz elenod elenod elemat elefab nodtag nodval prcopt Dimensions numnod numele numele numele numele numnod numnod <var> x 2 x x x x x <var> <var> <var> 2 2 Description Node coordinates in global system Element type identiers Element node lists Element material properties Element fabrication properties Node freedom tags marking BC type Node freedom specied values Processing specications
Notation: numnod: number of nodes (no numbering gaps allowed, each node has two ) displacement DOFs; numele: number of elements; <var> variable dimension. Long names are used in user-written problem scripts. Short names are used in programmed modules. Dimensions refer to the rst two level Dimensions of the Mathematica list that implements the data structure. These give a guide as to implementation in a low level language such as C.
tags and values. In addition there are miscellaneous process options, such as the symbolic versus numeric processing. These options are conveniently collected in a separate data set. Accordingly, the model-denition input to the plane stress FEM program consists of eight data structures, which are called NodeCoordinates, ElemTypes, ElemNodes, ElemMaterials, ElemFabrications, NodeDOFTags, NodeDOFValues and ProcessOptions. These are summarized in Table 27.1. The conguration of these data structures are described in the following subsections with reference to the benchmark problems and discretizations shown in Figures 27.1 and 27.2. 27.3.1. Benchmark Problems Figure 27.1(a) illustrates a rectangular steel plate in plane stress under uniform uniaxial loading in the y (vertical) direction. Note that the load q is specied as force per unit area (kips per square inch); thus q has not been integrated through the thickness h . The exact analytical solution of the problem is1 yy = q , x x = x y = 0, u y = qy / E , u x = u y = q x / E . This problem should be solved exactly by any nite element mesh as long as the model is consistent and stable. In particular, the two one-quadrilateral-element models shown in 27.1(b,c). A similar but more complicated problem is shown in Figure 27.2: a rectangular steel plate dimensioned and loaded as that of Figure 27.1(a) but now with a central circular hole. This problem is dened in Figure 27.2(a). A FEM solution is to be obtained using the two quadrilateral element models (with 4-node and 9-nodes, respectively) depicted in Figure 27.2(b,c). The main result sought is the stress concentration factor on the hole boundary, and comparison of this computed factor with the exact analytical value.
1
The displacement solution u y = qy / E and u x = u y assumes that the plate centerlines do not translate or rotate, a condition enfoirced in the FEM discretizations shown in Figure 27.1(b,c).
274
275
(a)
A
y q = 10 ksi
B C
;;
x
75 kips
B 1
(b) 75 kips
C 3
; ; ;
12 in H
10 in
Figure 27.1. Rectangular plate under uniform uniaxial loading, and two oneelement FEM discretizations of its upper right quadrant.
27.3.2. Node Coordinates The geometry data is specied through NodeCoordinates. This is a list of node coordinates congured as NodeCoordinates = { { x1 , y1 },{ x2 , y2 }, . . . { x N , y N } } (27.2)
where N is the number of nodes. Coordinate values should be normally be oating point numbers;2 use the N function to insure that property if necessary. Nodes must be numbered consecutively and no gaps are permitted.
Example 27.1. For Model (I) of Figure 27.1(b):
NodeCoordinates=N[{ { 0,6 },{ 0,3 },{ 0,0 },{ 5/2,6 },{ 5/2,3 },{ 5/2,0 },{ 5,6 },{ 5,3 },{ 5,0 } }];
Example 27.3. For Model (I) of Figure 27.2(a), using a bit of coordinate generation:
s={1,0.70,0.48,0.30,0.16,0.07,0.0}; xy1={0,6}; xy7={0,1}; xy8={2.5,6}; xy14={Cos[3*Pi/8],Sin[3*Pi/8]}; xy8={2.5,6}; xy21={Cos[Pi/4],Sin[Pi/4]}; xy15={5,6}; xy22={5,2}; xy28={Cos[Pi/8],Sin[Pi/8]}; xy29={5,0}; xy35={1,0}; NodeCoordinates=Table[{0,0},{35}]; Do[NodeCoordinates[[n]]=N[s[[n]] *xy1+(1-s[[n]]) *xy7], {n,1,7}]; Do[NodeCoordinates[[n]]=N[s[[n-7]] *xy8+(1-s[[n-7]]) *xy14],{n,8,14}]; Do[NodeCoordinates[[n]]=N[s[[n-14]]*xy15+(1-s[[n-14]])*xy21],{n,15,21}];
2
Unless one is doing a symbolic or exact-arithmetic analysis. Those are rare at the level of a full FEM analysis.
;; ; ;; ;; ; ;;; ; ;; ;;
D J 2 4 D
275
276
(a)
A
y q = 10 ksi
B C
12 in H
10 in
Figure 27.2. Plate with a circular hole and two FEM discretizations of its upper right quadrant. Only a few element numbers are shown to reduce clutter. Note: the meshes generated with the example scripts given later differ slightly from those shown above. Compare, for example, mesh in (b) above with that in Figure 27.3.
Do[NodeCoordinates[[n]]=N[s[[n-21]]*xy22+(1-s[[n-21]])*xy28],{n,22,28}]; Do[NodeCoordinates[[n]]=N[s[[n-28]]*xy29+(1-s[[n-28]])*xy35],{n,29,35}]; The result of this generation is that some of the interior nodes are not in the same positions as sketched in Figure 27.2(b), but this slight change hardly affects the results.
27.3.3. Element Type The element type is a label that species the type of model to be used. These labels are placed into an element type list: ElemTypes = { type(1) , type(2) , . . . type Ne } (27.3)
Here typee is the type identier of the e-th element specied as a character string. Ne is the number of elements; no element numbering gaps are allowed. Legal type identiers are listed in Table 27.2.
Example 27.4. For Model (I) in Figure 27.2(a):
ElemTypes=Table["Quad9",{ numele }]; Here numele is a variable that contains the number of elements. This can be extracted, for example, as numele=Length[ElemNodes], where ElemNodes is dened below, if ElemNodes is dened rst as is often the case.
; ; ; ; ; ; ; ; ; ; ; ;
K D K D
; ; ; ; ; ; ;
37.5 kips
(b)
37.5 kips
B
1
C 15
7
1
2 9 3
2
10
8
17
16
4 5 12
11 18
22 23 24 25
19 6 13 20 7 26 J 14 21 27 28 35 34 33
32
31
30
29
; ; ; ; ; ; ;
(c)
25 kips
25 kips
100 kips
8
B
1
15
2 3 10
16
22 4 5 11 17
18 12 19 6 13 24 25 20 7 26 14 27 21 28 35 34 33 31 32
23
30 29
276
277
27.3 MODEL DEFINITION Table 27.2. Element Type Identiers Implemented in Plane Stress Program Identier "Bar2" "Bar3" "Trig3" "Trig6" "Trig6.-3" "Trig10" "Quad4" "Quad4.1" "Quad8" "Quad8.2" "Quad9" "Quad9.2" Nodes 2 3 3 6 6 10 4 4 8 8 9 9 Model for bar bar plate plate plate plate plate plate plate plate plate plate Description 2-node bar element 3-node bar element; may be curved 3-node linear triangle 6-node quadratic triangle (3-interior point Gauss rule) 6-node quadratic triangle (midpoint Gauss rule) 10-node cubic triangle (7 point Gauss rule) RS 4-node iso-P bilinear quad (2 2 Gauss rule) RD 4-node iso-P bilinear quad (1-point Gauss rule) RS 8-node iso-P serendipity quad (3 3 Gauss rule) RD 8-node iso-P serendipity quad (2 2 Gauss rule) RS 9-node iso-P biquadratic quad (3 3 Gauss rule) RD 9-node iso-P biquadratic quad (2 2 Gauss rule)
27.3.4. Element Connectivity Element connectivity information species how the elements are connected.3 This information is stored in ElemNodes, which is a list of element nodelists: ElemNodes = { { enl(1) }, { enl(2) }, . . . { enl Ne } } (27.4)
Here enle denotes the lists of nodes of the element e (as given by global node numbers) and Ne is the total number of elements. Element boundaries must be traversed counterclockwise (CCW) but you can start at any corner. Numbering elements with midnodes requires more care: begin listing corners CCW, followed by midpoints also CCW (rst midpoint is the one that follows rst corner when traversing CCW). If element has thirdpoints, as in the case of the 10-node triangle, begin listing corners CCW, followed by thirdpoints CCW (rst thirdpoint is the one that follows rst corner). When elements have an interior node, as in the 9-node quadrilateral or 10-node triangle, that node goes last.
Example 27.6. For Model (I) of Figure 27.1(b), which has only one 4-node quadrilateral:
ElemNodes={ { 1,2,4,3 } };
Example 27.7. For Model (II) of Figure 27.1(c), which has only one 9-node quadrilateral:
ElemNodes={ { 1,3,9,7,2,6,8,4,5 } };
Example 27.8. For Model (I) of Figure 27.2(b), numbering the elements from top to bottom and from left to right: ElemNodes=Table[{0,0,0,0},{24}]; ElemNodes[[1]]={1,2,9,8};
3
277
278
right: ElemNodes=Table[{0,0,0,0,0,0,0,0,0},{6}]; ElemNodes[[1]]={1,3,17,15,2,10,16,8,9}; Do [ElemNodes[[e]]=ElemNodes[[e-1]]+{2,2,2,2,2,2,2,2,2},{e,2,3}]; ElemNodes[[4]]=ElemNodes[[3]]+{10,10,10,10,10,10,10,10,10}; Do [ElemNodes[[e]]=ElemNodes[[e-1]]+{2,2,2,2,2,2,2,2,2},{e,5,6}]; Since this particular mesh only has 6 elements, it would be indeed faster to write down the six nodelists.
27.3.5. Material Properties Data structure ElemMaterials is a list that provides the constitutive properties of the elements: ElemMaterials = { mprop(1) , mprop(2) , . . . mprop Ne } (27.5)
For a plate element, mprop is the stress-strain matrix of elastic moduli (also known as elasticity matrix) arranged as { { E11,E12,E33 },{ E12,E22,E23 },{ E13,E23,E33 } }. Note that although this matrix is symmetric, it must be specied as a full 3 3 matrix. For a bar element, mprop is simply the longitudinal elastic modulus. A common case in practice is that (i) all elements are plates, (ii) the plate material is uniform and isotropic. An isotropic elastic material is specied by the elastic modulus E and Poissons ratio . Then this list can be generated by a single Table instruction upon building the elastic ity matrix, as in the example below.
Example 27.10. For all FEM discretizations in Figures 27.1 and 27.2 all elements are plates of the same
isotropic material. Suppose that values of the elastic modulus E and Poissons ratio are stored in Em and nu, respectively, which are typically declared at the beginning of the problem script. Let numele give the number of elements. Then the material data is compactly declared by saying Emat=Em/(1-nu^2)*{ { 1,nu,0 },{ nu,1,0 },{ 0,0,(1-nu)/2 } }; ElemMaterials=Table[Emat,{ numele }];
27.3.6. Fabrication Properties Data structure ElemFabrications is a list that provides the fabrication properties of the elements: ElemFabrications = { fprop(1) , fprop(2) , . . . fprop Ne } 278 (27.6)
279
For a plate element, fprop is the thickness h of the plate, assumed constant.4 For a bar element, fprop is the cross section area. If all elements are plates with the same thickness, this list can be easily generated by a Table instruction as in the example below.
Example 27.11. For all FEM discretizations in Figures 27.1 and 27.2 all elements are plates with the same thickness h , which is stored in variable th. This is typically declared at the start of the problem script. As before, numele has the number of elements. Then the fabrication data is compactly declared by saying
ElemFabrications=Table[th,{ numele }]
27.3.7. Node Freedom Tags Data structure NodeDOFTags is a list that labels each node DOF as to whether the load or the displacement is specied. The conguration of this list is similar to that of NodeCoordinates: NodeDOFTags={ { tagx 1 , tag y 1 },{ tagx 2 , tag y 2 }, . . . { tagx N , tag y N } } The tag value is 0 if the force is specied and 1 if the displacement is specied. When there are a lot of nodes, often the quickest way to specify this list is to create with a Table command that initializes it to all zeros. Then displacement BCs are inserted appropriately, as in the example below.
Example 27.12. For Model (I) in Figure 27.2(a):
(27.7)
numnod=Length[NodeCoordinates]; NodeDOFTags=Table[{0,0},{numnod}]; (* create and initialize to zero *) Do[NodeDOFTags[[n]]={1,0},{n,1,7}]; (* vroller @ nodes 1 through 7 *) Do[NodeDOFTags[[n]]={0,1},{n,29,35}]; (* hroller @ nodes 29 through 35 *) This scheme works well because typically the number of supported nodes is small compared to the total number.
27.3.8. Node Freedom Values Data structure NodeDOFValues is a list with the same node by node conguration as NodeDOFTags: NodeDOFValues={ { valuex 1 , value y 1 },{ valuex 2 , value y 2 }, . . . { valuex N , value y N } } (27.8) Here value is the specied value of the applied node force component if the corresponding tag is zero, and of the prescribed displacement component if the tag is one. Often most of the entries of (27.8) are zero. If so a quick way to build it is to create it with a Table command that initializes it to zero. Then nonzero values are inserted as in the example below.
It is possible also to specify a variable thickness by making fprop a list that contains the thicknesses at the nodes. Since the variable thickness case is comparatively rare, it will not be described here.
279
2710
Example 27.13. For the model (I) in Figure 27.2(a) only 3 values (for the y forces on nodes 1, 8 and 15) will
be nonzero: numnod=Length[NodeCoordinates]; NodeDOFValues=Table[{0,0},{numnod}]; (* create and initialize to zero *) NodeDOFValues[[1]]=NodeDOFValues[[15]]={0,37.5}; NodeDOFValues[[8]]={0,75}; (* y nodal loads *)
27.3.9. Processing Options Array ProcessOptions is a list of general processing options that presently contains only the numer logical ag. This is normally be set to True to specify numeric computations: ProcessOptions={ True };
27.3.10. Model Display Utility Only one graphic display utility is presently provided to show the mesh. Nodes and elements of Model (I) of Figure 27.2(a) may be plotted by saying aspect=6/5; Plot2DElementsAndNodes[NodeCoordinates, ElemNodes,aspect, "Plate with circular hole - 4-node quad model",True,True]; Here aspect is the plot frame aspect ratio ( y dimension over x dimension). The 4th argument is a plot title textstring. The last two True argument values specify that node labels and element labels, respectively, be shown. The output of the mesh plot command is shown in Figure 27.3. 27.3.11. Model Denition Print Utilities Several print utilities are provided in the plane stress program to print out model denition data in tabular form. They are invoked as follows. To print the node coordinates: To print the element types and nodes: PrintPlaneStressElementTypeNodes[ElemTypes,EleNodes,title,digits]; To print the element materials and fabrications: PrintPlaneStressElementMatFab[ElemMaterials,ElemFabrications,title,digits]; To print freedom activity data: PrintPlaneStressFreedomActivity[NodeDOFTags,NodeDOFValues,title,digits]; In all cases, title is an optional character string to be printed as a title before the table; for example "Node coordinates". To eliminate the title, specify "" (two quote marks together). The last argument of the print modules: digits, is optional. If set to { d,f } it species that oating point numbers are to be printed with room for at least d digits, with f digits after the decimal point. If digits is specied as a void list: { }, a preset default is used for d and f.
One element mesh - 4 node quad
1 8 15
1 2 2 3 3 4 4 5 6 7 12 11 10 19 10 9 9 8 17
16
13
14 18 15 23 24 19 21 31 20 30 29 22
5 13 11 16 20 6 14 12 17 25 21 26 18 27 28 22 24 23 35 34 33 32
PrintPlaneStressNodeCoordinates[NodeCoordinates,title,digits];
2710
27.3
MODEL DEFINITION
As capstone examples, Figures 27.4 and Figures 27.5 list the preprocessing (model denition) parts of the problem scripts for Model (I) and (II), respectively, of Figure 27.1(b,c).
ClearAll[Em, ,th]; Em=10000; =.25; th=3; aspect=6/5; Nsub=4; Emat=Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}; (* Define FEM model *)
NodeCoordinates=N[{{0,6},{0,0},{5,6},{5,0}}]; PrintPlaneStressNodeCoordinates[NodeCoordinates,"",{6,4}]; ElemNodes= {{1,2,4,3}}; numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; ElemTypes= Table["Quad4",{numele}]; PrintPlaneStressElementTypeNodes[ElemTypes,ElemNodes,"",{}]; ElemMaterials= Table[Emat, {numele}]; ElemFabrications=Table[th, {numele}]; PrintPlaneStressElementMatFab[ElemMaterials,ElemFabrications,"",{}]; NodeDOFValues=NodeDOFTags=Table[{0,0},{numnod}]; NodeDOFValues[[1]]=NodeDOFValues[[3]]={0,75}; (* nodal loads *) NodeDOFTags[[1]]={1,0}; (* vroller @ node 1 *) NodeDOFTags[[2]]={1,1}; (* fixed node 2 *) NodeDOFTags[[4]]={0,1}; (* hroller @ node 4 *) PrintPlaneStressFreedomActivity[NodeDOFTags,NodeDOFValues,"",{}]; ProcessOptions={True}; Plot2DElementsAndNodes[NodeCoordinates,ElemNodes,aspect, "One element mesh - 4-node quad",True,True];
NodeCoordinates=N[{{0,6},{0,3},{0,0},{5/2,6},{5/2,3}, {5/2,0},{5,6},{5,3},{5,0}}]; PrintPlaneStressNodeCoordinates[NodeCoordinates,"",{6,4}]; ElemNodes= {{1,3,9,7,2,6,8,4,5}}; numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; ElemTypes= Table["Quad9",{numele}]; PrintPlaneStressElementTypeNodes[ElemTypes,ElemNodes,"",{}]; ElemMaterials= Table[Emat, {numele}]; ElemFabrications=Table[th, {numele}]; PrintPlaneStressElementMatFab[ElemMaterials,ElemFabrications,"",{}]; NodeDOFValues=NodeDOFTags=Table[{0,0},{numnod}]; NodeDOFValues[[1]]=NodeDOFValues[[7]]={0,25}; NodeDOFValues[[4]]={0,100}; (* nodal loads *) NodeDOFTags[[1]]=NodeDOFTags[[2]]={1,0}; (* vroller @ nodes 1,2 *) NodeDOFTags[[3]]={1,1}; (* fixed node 3 *) NodeDOFTags[[6]]=NodeDOFTags[[9]]={0,1}; (* hroller @ nodes 6,9 *) PrintPlaneStressFreedomActivity[NodeDOFTags,NodeDOFValues,"",{}]; ProcessOptions={True}; Plot2DElementsAndNodes[NodeCoordinates,ElemNodes,aspect, "One element mesh - 9-node quad",True,True];
2711
2712
PlaneStressSolution[nodxyz_,eletyp_,elenod_,elemat_,elefab_, nodtag_,nodval_,prcopt_]:= Module[{K,Kmod,f,fmod,u,numer=True, noddis,nodfor,nodpnc,nodsig,barele,barfor}, If [Length[prcopt]>=1, numer=prcopt[[1]]]; K=PlaneStressMasterStiffness[nodxyz,eletyp,elenod,elemat,elefab,prcopt]; If [K==Null,Return[Table[Null,{6}]]]; Kmod=ModifiedMasterStiffness[nodtag,K]; f=FlatNodePartVector[nodval]; fmod=ModifiedNodeForces[nodtag,nodval,K,f]; u=LinearSolve[Kmod,fmod]; If [numer,u=Chop[u]]; f=K.u; If [numer,f=Chop[f]]; nodfor=NodePartFlatVector[2,f]; noddis=NodePartFlatVector[2,u]; {nodpnc,nodsig}=PlaneStressPlateStresses[nodxyz,eletyp,elenod,elemat, elefab,noddis,prcopt]; {barele,barfor}=PlaneStressBarForces[nodxyz,eletyp,elenod,elemat, elefab,noddis,prcopt]; ClearAll[K,Kmod]; Return[{noddis,nodfor,nodpnc,nodsig,barele,barfor}]; ];
Figure 27.6. Module to drive the analysis of the plane stress problem.
27.4. Processing Once the model denition is complete, the plane stress analysis is carried out by calling module LinearSolutionOfPlaneStressModel listed in Figure 27.6. This module is invoked from the problem driver as
{NodeDisplacements,NodeForces,NodePlateCounts,NodePlateStresses, ElemBarNumbers,ElemBarForces}= PlaneStressSolution[NodeCoordinates, ElemTypes,ElemNodes,ElemMaterials,ElemFabrications, NodeDOFTags,NodeDOFValues,ProcessOptions];
The module arguments: NodeCoordinates, ElemTypes, ElemNodes , ElemMaterials, ElemFabrications, NodeDOFTags, NodeDOFValues and ProcessOptions are the data structures described in the previous section. The module returns the following: NodeDisplacements Computed node displacements, in node-partitioned form. NodeForces NodePlateCounts Recovered node forces including reactions, in node-partitioned form. For each node, number of plate elements attached to that node. A zero count means that no plate elements are attached to that node. A list of bar elements if any specied, else an empty list. A list of bar internal forces if any bar elements were specied, else an empty list.
NodePlateStresses Averaged stresses at plate nodes with a nonzero NodePlateCounts. ElemBarNumbers ElemBarForces
27.4.1. Processing Tasks PlaneStressSolution carries out the following tasks. It assembles the free-free master stiffness matrix K by calling the MET assembler PlaneStressMasterStiffness. This module is listed in Figure 27.7. A study
2712
2713
27.4 PROCESSING
PlaneStressMasterStiffness[nodxyz_,eletyp_,elenod_,elemat_, elefab_,prcopt_]:=Module[{numele=Length[elenod], numnod=Length[nodxyz],ncoor,type,e,enl,neldof,OKtyp,OKenl, i,j,n,ii,jj,eft,Emat,th,numer,Ke,K}, OKtyp={"Bar2","Bar3","Quad4","Quad4.1","Quad8","Quad8.2","Quad9", "Quad9.2","Trig3","Trig6","Trig6.-3","Trig10","Trig10.6"}; OKenl= {2,3,4,4,8,8,9,9,3,6,6,10,10}; K=Table[0,{2*numnod},{2*numnod}]; numer=prcopt[[1]]; For [e=1,e<=numele,e++, type=eletyp[[e]]; If [!MemberQ[OKtyp,type], Print["Illegal type:",type, " element e=",e," Assembly aborted"]; Return[Null] ]; enl=elenod[[e]]; n=Length[enl]; {{j}}=Position[OKtyp,type]; If [OKenl[[j]]!=n, Print ["Wrong node list length, element=",e, " Assembly aborted"]; Return[Null] ]; eft=Flatten[Table[{2*enl[[i]]-1,2*enl[[i]]},{i,1,n}]]; ncoor=Table[nodxyz[[enl[[i]]]],{i,1,n}]; If [type=="Bar2", Em=elemat[[e]]; A=elefab[[e]]; Ke=PlaneBar2Stiffness[ncoor,Em,A,{numer}] ]; If [type=="Bar3", Em=elemat[[e]]; A=elefab[[e]]; Ke=PlaneBar3Stiffness[ncoor,Em,A,{numer}] ]; If [type=="Quad4", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,th,{numer,2}] ]; If [type=="Quad4.1", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad4IsoPMembraneStiffness[ncoor,Emat,th,{numer,1}] ]; If [type=="Quad8", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad8IsoPMembraneStiffness[ncoor,Emat,th,{numer,3}] ]; If [type=="Quad8.2", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad8IsoPMembraneStiffness[ncoor,Emat,th,{numer,2}] ]; If [type=="Quad9", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad9IsoPMembraneStiffness[ncoor,Emat,th,{numer,3}] ]; If [type=="Quad9.2", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Quad9IsoPMembraneStiffness[ncoor,Emat,th,{numer,2}] ]; If [type=="Trig3", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Trig3IsoPMembraneStiffness[ncoor,Emat,th,{numer}] ]; If [type=="Trig6", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Trig6IsoPMembraneStiffness[ncoor,Emat,th,{numer,3}] ]; If [type=="Trig6.-3", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Trig6IsoPMembraneStiffness[ncoor,Emat,th,{numer,-3}] ]; If [type=="Trig10", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Trig10IsoPMembraneStiffness[ncoor,Emat,th,{numer,7}] ]; If [type=="Trig10.6", Emat=elemat[[e]]; th=elefab[[e]]; Ke=Trig10IsoPMembraneStiffness[ncoor,Emat,th,{numer,6}] ]; neldof=Length[Ke]; For [i=1,i<=neldof,i++, ii=eft[[i]]; For [j=i,j<=neldof,j++, jj=eft[[j]]; K[[jj,ii]]=K[[ii,jj]]+=Ke[[i,j]] ]; ]; ]; Return[K]; ];
of its code reveals that it handle the multiple element types listed in Table 27.2. The modules that compute the element stiffness matrices have been studied in previous Chapters and need not be listed here. The displacement BCs are applied by ModifiedMasterStiffness and ModifiedNodeForces. These are the same modules used in Chapter 21 for the space truss program, and thus need not be described further. The unknown node displacements u are obtained through the built in LinearSolve function, as u=LinearSolve[Kmod,fmod]. This function is of course restricted to small systems, typically less than 200 equations (it gets extremely slow for something bigger) but it has the advantages of simplicity. The node
2713
2714
Figure 27.8. Module that recovers averaged nodal stresses at plate nodes.
forces including reactions are recovered by the matrix multiplication f = K.u, where K is the unmodied master stiffness. Finally, plate stresses and bar internal forces are recovered by the modules PlaneStressPlateStresses and PlaneStressBarForces, respectively. The former is listed in Figure 27.8. This computation is actually part of the postprocessing stage. It is not described here since stress recovery is treated in more detail in a subsequent Chapter. The bar force recovery module is not described here as it has not been used in assigned problems so far.
27.5. Postprocessing As noted above, module PlaneStressSolution carries out preprocessing tasks: recover node forces, plate stresses and bar forces. But those are not under control of the user. Here we describe result printing and plotting activities that can be specied in the problem script. 2714
2715
27.5.1. Result Print Utilities
27.5 POSTPROCESSING
Several utilities are provided in the plane stress program to print solution data in tabular form. They are invoked as follows. To print computed node displacements: PrintPlaneStressNodeDisplacements[NodeDisplacements,title,digits]; To print receoverd node forces including reactions: PrintPlaneStressNodeForces[NodeForces,title,digits]; To print plate node stresses: PrintPlaneStressPlateNodeStresses[NodePlateCounts,NodePlateStresses,title,digits]; To print node displacements, node forces and node plate stresses in one table: PrintPlaneStressSolution[NodeDisplacements,NodeForces, NodePlateCounts,NodePlateStresses,title,digits]; No utility is provided to print bar forces, as problems involving plates and bars had not been assigned. In all utilities listed above, title is an optional character string to be printed as a title before the table; for example "Node displacements for plate with a hole". To eliminate the title, specify "" (two quote marks together). The last argument of the print modules: digits, is optional. If set to { d,f } it species that oating point numbers are to be printed with room for at least d digits, with f digits after the decimal point. If digits is specied as a void list: { }, a preset default is used for d and f. 27.5.2. Displacement Field Contour Plots Contour plots of displacement components u x and u y (interpolated over elements from the computed node displacements) may be produced. Displacement magnitudes are shown using a internally set color scheme based on hue interpolation, in which white means zero. Plots can be obtained using a script typied by ux=Table[NodeDisplacements[[n,1]],{n,numnod}]; uy=Table[NodeDisplacements[[n,2]],{n,numnod}]; {uxmax,uymax}=Abs[{Max[ux],Max[uy]}]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes,ux, uxmax,Nsub,aspect,"Displacement component ux"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes,uy, uymax,Nsub,aspect,"Displacement component uy"]; The third argument of ContourPlotNodeFuncOver2DMesh is the function to be plotted, specied at nodes. A function maximum (in absolute value) is supplied as fourth argument. The reason for supplying this from the outside is that in many cases it is convenient to alter the actual maximum for zooming or animation purposes. As for the other arguments, Nsub is the number of element subdivisions in each direction when breaking down the element area into plot polygons. Typically Nsub is set to 4 at the start of the script and is the same for all plots of a script. Plot smoothness in terms of color grading increases with Nsub, but plot time grows as Nsub-squared. So an appropriate tradeoff is to use a high Nsub, say 8, for coarse meshes containing few elements whereas for ner meshes a value of 4 or 2 may work ne. The aspect argument species the ratio between the y (vertical) and x (horizontal) dimensions of the plot frame, and is usaully dened at the script start as a symbol so it is the same for all plots. The last argument is a plot title.
2715
2716
Nodal stress sig- xy
Figure 27.9. Stress component contour plots for rectangular plate with a circular central hole, Model (I) of Figure 27.2(b).
27.5.3. Stress Field Contour Plots Contour plots of stress components x x , yy and x y (interpolated over elements from the computed node displacements) may be produced. Stress magnitudes are shown using a internally set color scheme based on hue interpolation, in which white means zero. Plots can be obtained using a script typied by sxx=Table[NodePlateStresses[[n,1]],{n,numnod}]; syy=Table[NodePlateStresses[[n,2]],{n,numnod}]; sxy=Table[NodePlateStresses[[n,3]],{n,numnod}]; {sxxmax,syymax,sxymax}=Abs[{Max[sxx],Max[syy],Max[sxy]}]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, sxx,sxxmax,Nsub,aspect,"Nodal stress sig-xx"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, syy,syymax,Nsub,aspect,"Nodal stress sig-yy"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, sxy,sxymax,Nsub,aspect,"Nodal stress sig-xy"]; For a description of ContourPlotNodeFuncOver2DMesh arguments, see the previous subsection. As an example, stress component contour plots for Model (I) of the rectangular plate with a circular central hole are shown in Figure 27.9.
Remark 27.1. Sometimes it is useful to show contour plots of principal stresses, Von Mises stresses, maximum shears, etc. To do that, the appropriate function should be constructed rst from the Cartesian components available in NodePlateStresses, and then the plot utility called.
27.5.4. Animation Occasionally it is useful to animate results such as displacements or stress elds when a load changes as a function of a time-like parameter t . This can be done by performing a sequence of analyses in a For loop. Such sequence produces a series of plot frames which may be animated by doubly clicking on one of them. The speed of the animation may be controlled by pressing on the righmost buttons at the bottom of the Mathematica window. The second button from the left, if pressed, changes the display sequence to back and forth motion.
2716
2717
27.6
ClearAll[Em, ,th,aspect,Nsub]; Em=10000; =.25; th=3; aspect=6/5; Nsub=4; Emat=Em/(1- ^2)*{{1, ,0},{ ,1,0},{0,0,(1- )/2}}; (* Define FEM model *)
s={1,0.70,0.48,0.30,0.16,0.07,0.0}; xy1={0,6}; xy7={0,1}; xy8={2.5,6}; xy14={Cos[3*Pi/8],Sin[3*Pi/8]}; xy8={2.5,6}; xy21={Cos[Pi/4],Sin[Pi/4]}; xy15={5,6}; xy22={5,2}; xy28={Cos[Pi/8],Sin[Pi/8]}; xy29={5,0}; xy35={1,0}; NodeCoordinates=Table[{0,0},{35}]; Do[NodeCoordinates[[n]]=N[s[[n]] *xy1+(1-s[[n]]) *xy7],{n,1,7}]; Do[NodeCoordinates[[n]]=N[s[[n-7]] *xy8+(1-s[[n-7]]) *xy14],{n,8,14}]; Do[NodeCoordinates[[n]]=N[s[[n-14]]*xy15+(1-s[[n-14]])*xy21],{n,15,21}]; Do[NodeCoordinates[[n]]=N[s[[n-21]]*xy22+(1-s[[n-21]])*xy28],{n,22,28}]; Do[NodeCoordinates[[n]]=N[s[[n-28]]*xy29+(1-s[[n-28]])*xy35],{n,29,35}]; PrintPlaneStressNodeCoordinates[NodeCoordinates,"",{6,4}]; ElemNodes=Table[{0,0,0,0},{24}]; ElemNodes[[1]]={1,2,9,8}; Do [ElemNodes[[e]]=ElemNodes[[e-1]]+{1,1,1,1},{e,2,6}]; ElemNodes[[7]]=ElemNodes[[6]]+{2,2,2,2}; Do [ElemNodes[[e]]=ElemNodes[[e-1]]+{1,1,1,1},{e,8,12}]; ElemNodes[[13]]=ElemNodes[[12]]+{2,2,2,2}; Do [ElemNodes[[e]]=ElemNodes[[e-1]]+{1,1,1,1},{e,14,18}]; ElemNodes[[19]]=ElemNodes[[18]]+{2,2,2,2}; Do [ElemNodes[[e]]=ElemNodes[[e-1]]+{1,1,1,1},{e,20,24}]; numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; ElemTypes= Table["Quad4",{numele}]; PrintPlaneStressElementTypeNodes[ElemTypes,ElemNodes,"",{}]; ElemMaterials= Table[Emat, {numele}]; ElemFabrications=Table[th, {numele}]; (*PrintPlaneStressElementMatFab[ElemMaterials,ElemFabrications,"",{}];*) NodeDOFValues=NodeDOFTags=Table[{0,0},{numnod}]; NodeDOFValues[[1]]=NodeDOFValues[[15]]={0,37.5}; NodeDOFValues[[8]]={0,75}; (* nodal loads *) Do[NodeDOFTags[[n]]={1,0},{n,1,7}]; (* vroller @ nodes 1-7 *) Do[NodeDOFTags[[n]]={0,1},{n,29,35}]; (* hroller @ node 4 *) PrintPlaneStressFreedomActivity[NodeDOFTags,NodeDOFValues,"",{}]; ProcessOptions={True}; Plot2DElementsAndNodes[NodeCoordinates,ElemNodes,aspect, "One element mesh - 4-node quad",True,True];
Figure 27.10. Preprocessing (model denition) script for problem of Figure 27.2(b).
27.6. A Complete Problem Script Cell A complete problem script cell (which is Cell 13 in the plane stress Notebook placed in the web index of this Chapter) is listed in Figures 27.10 through 27.12. This driver cell does Model (I) of the plate with hole problem of Figure 27.2(b), which uses 4-node quadrilateral elements. The script is divided into 3 parts for convenience. Figure 27.10 lists the model denition script followed by a mesh plot command. Figure 27.11 shows the call to PlaneStressSolution analysis driver and the call to get printout of node displacements, forces and stresses. Finally, Figure 27.12 shows commands to produce contour plots of displacements (skipped) and stresses. Other driver cell examples may be studied in the PlaneStress.nb Notebook posted on the course web site. It can be observed that the processing and postprocessing scripts are largely the same. 2717
2718
Figure 27.11. Processing script and solution print for problem of Figure 27.2(b).
(*
(* ux=Table[NodeDisplacements[[n,1]],{n,numnod}]; uy=Table[NodeDisplacements[[n,2]],{n,numnod}]; {uxmax,uymax}=Abs[{Max[ux],Max[uy]}]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes,ux, uxmax,Nsub,aspect,"Displacement component ux"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes,uy, uymax,Nsub,aspect,"Displacement component uy"]; *) (* Plot Averaged Nodal Stresses Distribution *)
sxx=Table[NodePlateStresses[[n,1]],{n,numnod}]; syy=Table[NodePlateStresses[[n,2]],{n,numnod}]; sxy=Table[NodePlateStresses[[n,3]],{n,numnod}]; {sxxmax,syymax,sxymax}={Max[Abs[sxx]],Max[Abs[syy]],Max[Abs[sxy]]}; Print["sxxmax,syymax,sxymax=",{sxxmax,syymax,sxymax}]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, sxx,sxxmax,Nsub,aspect,"Nodal stress sig-xx"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, syy,syymax,Nsub,aspect,"Nodal stress sig-yy"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, sxy,sxymax,Nsub,aspect,"Nodal stress sig-xy"];
Figure 27.12. Result plotting script for problem of Figure 27.2(b). Note that displacement contour plots have been skipped by commenting out the code.
What changes is the model denition script portion, which often benets from ad-hoc node and element generation constructs.
Notes and Bibliography Few FEM books show a complete program. More common is the display of snipets of code. These are left dangling chapter after chapter, with no attempt at coherent interfacing. This historical problem comes from early reliance on low-level languages such as Fortran. Even the simplest program may run to several thousand code lines. At 50 lines/page that becomes difcult to display snugly in a textbook while providing a running commentary. Another ages-old problem is plotting. Languages such as C or Fortran do not include plotting libraries for the simple reason that low-level universal plotting standards never existed. The situation changed when widely used high-level languages like Matlab or Mathematica appeared. The language engine provides the necessary t to available computer hardware, concealing system dependent details. Thus plotting scripts become transportable.
2718
Introduction to FEM
27
IFEM Ch 27 Slide 1
Introduction to FEM
Preprocessing : defining the FEM model Processing : setting up the stiffness equations and solving for displacements
IFEM Ch 27 Slide 2
Introduction to FEM
Assembler
BC Application
Element Stiffnesses
Element Library
IFEM Ch 27 Slide 3
Introduction to FEM
IFEM Ch 27 Slide 4
Introduction to FEM
y q = 10 ksi
B C
;
x
75 kips
B 1
(b) 75 kips
C 3
; ;
10 in
IFEM Ch 27 Slide 5
;; ;; ;; ; ;; ;; ;;
J 3
12 in H
J 2
4 D
; ; ;
B 1 2 5
C 7 8
9 D
Introduction to FEM
Benchmark Problem: Plate with Central Circular Hole used in final exam and part of today's demo
(a)
A
y q = 10 ksi
B C
12 in H
10 in
; ; ; ; ; ; ; ; ; ; ;
Model (I): 35 nodes, 70 DOFs, 24 bilinear quads Model (II): 35 nodes, 70 DOFs, 6 biquadratic quads
; ; ; ; ; ;
x
37.5 kips
(b)
37.5 kips
B
1
C 15
7
1
2 9 3
2
10
8
17
16
4 5 12
11 18
22 23 24 25
19 6 13 20 7 26 J 14 21 27 28 35 34 33
32
31
30
29
; ; ; ; ; ;
B
1 2 3 4 5
(c)
25 kips
25 kips
100 kips
8
15
1
10
16
22 11 17
18 12 19 6 13 24 25 20 7 26 14 27 21 28 35 34 33 31 32
23
30 29
IFEM Ch 27 Slide 6
Introduction to FEM
y q = 10 ksi
B C
;
x
75 kips
B 1
75 kips
C 3
12 in H
10 in
IFEM Ch 27 Slide 7
; ;;; ; ;
J 2 4 D
Introduction to FEM
12 in H
10 in
IFEM Ch 27 Slide 8
; ;;; ; ; ;; ;;
J 3
; ; ;
Introduction to FEM
; ;
75 kips
1
4 D
; ;;;
J 2
; ;
IFEM Ch 27 Slide 9
Introduction to FEM
; ;;; ; ; ;
J 3 9 D
; ; ;
IFEM Ch 27 Slide 10
Introduction to FEM
; ;
75 kips
1
4 D
; ;;;
J 2
; ;
IFEM Ch 27 Slide 11
Introduction to FEM
; ;;; ; ; ;
J 3 9 D
; ; ;
IFEM Ch 27 Slide 12
Introduction to FEM
; ;
75 kips
B 1
75 kips
C 3
NodeCoordinates=N[{{0,6},{0,0},{5,6},{5,0}}]; PrintPlaneStressNodeCoordinates[NodeCoordinates,"",{6,4}]; ElemNodes= {{1,2,4,3}}; J 2 numnod=Length[NodeCoordinates]; numele=Length[ElemNodes]; ElemTypes= Table["Quad4",{numele}]; PrintPlaneStressElementTypeNodes[ElemTypes,ElemNodes,"",{}]; ElemMaterials= Table[Emat, {numele}]; ElemFabrications=Table[th, {numele}]; PrintPlaneStressElementMatFab[ElemMaterials,ElemFabrications,"",{}]; NodeDOFValues=NodeDOFTags=Table[{0,0},{numnod}]; NodeDOFValues[[1]]=NodeDOFValues[[3]]={0,75}; (* nodal loads *) NodeDOFTags[[1]]={1,0}; (* vroller @ node 1 *) NodeDOFTags[[2]]={1,1}; (* fixed node 2 *) NodeDOFTags[[4]]={0,1}; (* hroller @ node 4 *) PrintPlaneStressFreedomActivity[NodeDOFTags,NodeDOFValues,"",{}]; ProcessOptions={True}; Plot2DElementsAndNodes[NodeCoordinates,ElemNodes,aspect, "One element mesh - 4-node quad",True,True];
IFEM Ch 27 Slide 13
; ;;; ; ;
4 D
Introduction to FEM
1 2 2 9 8 10 3 4 4 5 6 7 12 11 10 19 9 17
16
5 1
13
14 18 15 23 24 19 21 31 20 30 29 22
5 13 11 16 20 6 14 12 17 25 21 26 18 27 28 22 24 23 35 34 33 32
IFEM Ch 27 Slide 14
Introduction to FEM
; ;
J
75 kips
C 3
B 1
(*
IFEM Ch 27 Slide 15
; ;;; ; ;
D
Introduction to FEM
(*
IFEM Ch 27 Slide 16
; ;; ; ;
D
sxx=Table[NodePlateStresses[[n,1]],{n,numnod}]; syy=Table[NodePlateStresses[[n,2]],{n,numnod}]; sxy=Table[NodePlateStresses[[n,3]],{n,numnod}]; {sxxmax,syymax,sxymax}=Abs[{Max[sxx],Max[syy],Max[sxy]}]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, sxx,sxxmax,Nsub,aspect,"Nodal stress sig-xx"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, syy,syymax,Nsub,aspect,"Nodal stress sig-yy"]; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, sxy,sxymax,Nsub,aspect,"Nodal stress sig-xy"];
;;
J
75 kips
B 1
75 kips
C 3
Introduction to FEM
; ;
75 kips
B 1
75 kips
C 3
Computed Solution: node x-displ 1 0.0000 2 0.0000 3 0.0013 4 0.0013 y-displ 0.0060 0.0000 0.0060 0.0000 x-force 0.0000 0.0000 0.0000 0.0000 y-force 75.0000 75.0000 75.0000 75.0000
sigma-xx sigma-yy sigma-xy 0.0000 0.0000 10.0000 0.0000 0.0000 10.0000 0.0000 0.0000 10.0000 0.0000 0.0000 10.0000
IFEM Ch 27 Slide 17
; ;; ; ;
D
Introduction to FEM
IFEM Ch 27 Slide 18
Introduction to FEM
IFEM Ch 27 Slide 19
Stress Recovery
28
281
282
TABLE OF CONTENTS
Page
Introduction Calculation of Element Strains and Stresses Direct Stress Evaluation at Nodes Extrapolation from Gauss Points Interelement Averaging
282
28.2
In this lecture we study the recovery of stress values for two-dimensional plane-stress elements.1 This analysis step is sometimes called postprocessing because it happens after the main processing step the calculation of nodal displacements is completed. Stress calculations are of interest because in structural analysis and design the stresses are often more important to the engineer than displacements. In the stiffness method of solution discussed in this course, the stresses are obtained from the computed displacements, and are thus derived quantities. The accuracy of derived quantities is generally lower than that of primary quantities (the displacements), an informal statement that may be mathematically justied in the theory of nite element methods. For example, if the accuracy level of displacements is 1% that of the stresses may be typically 10% to 20%, and even lower at boundaries. It is therefore of interest to develop techniques that enhance the accuracy of the computed stresses. The goal is to squeeze as much accuracy from the computed displacements while keeping the computational effort reasonable. These procedures receive the generic name stress recovery techniques in the nite element literature. In the following sections we cover the simplest stress recovery techniques that have been found most useful in practice. 28.2. Calculation of Element Strains and Stresses In elastic materials, stresses are directly related to strains e at each point through the elastic constitutive equations = Ee. It follows that the stress computation procedure begins with strain computations, and that the accuracy of stresses depends on that of strains. Strains, however, are seldom saved or printed. In the following we focus our attention on two-dimensional isoparametric elements, as the computation of strains, stresses and axial forces in bar elements is strightforward. Suppose that we have solved the master stiffness equations Ku = f, (28.1)
for the node displacements u. To calculate strains and stresses we perform a loop over all dened elements. Let e be the element index of a specic two-dimensional isoparametric element encountered during this loop, and u(e) the vector of computed element node displacements. Recall from 15.3 that the strains at any point in the element may be related to these displacements as e = Bu(e) , (28.2)
where B is the strain-displacement matrix (14.18) assembled with the x and y derivatives of the element shape functions evaluated at the point where we are calculating strains. The corresponding stresses are given by = Ee = EBu (28.3)
1
This Chapter needs rewriting to show the use of Mathematica for stress computation. To be done in the future.
283
284
Natural Coordinates of Bilinear Quadrilateral Nodes 3 + 3 + 3 3 3 3 +3 + 3 Gauss node 1 2 3 4 1/3 +1/3 +1/3 1/ 3 1/3 1/3 +1/3 +1/ 3 1 +1 +1 1 1 1 +1 +1
1 1 +1 1 +1 +1 1 +1
Gauss nodes, and coordinates and are dened in 28.4 and Fig. 28.1
In the applications it is of interest to evaluate and report these stresses at the element nodal points located on the corners and possibly midpoints of the element. These are called element nodal point stresses. It is important to realize that the stresses computed at the same nodal point from adjacent elements will not generally be the same, since stresses are not required to be continuous in displacementassumed nite elements. This suggests some form of stress averaging can be used to improve the stress accuracy, and indeed this is part of the stress recovery technique further discussed in 28.5. The results from this averaging procedure are called nodal point stresses. For the moment let us see how we can proceed to compute element nodal stresses. Two approaches are followed in practice: 1. Evaluate directly at the element node locations by substituting the natural coordinates of the nodal points as arguments to the shape function modules. These modules return qx and q y and direct application of (28.2)-(28.4) yields the strains and stresses at the nodes. Evaluate at the Gauss integration points used in the element stiffness integration rule and then extrapolate to the element node points.
2.
Empirical evidence indicates that the second approach generally delivers better stress values for quadrilateral elements whose geometry departs substantially from the rectangular shape. This is backed up by superconvergence results in nite element approximation theory. For rectangular elements there is no difference. For isoparametric triangles both techniques deliver similar results (identical if the elements are straight sided with midside nodes at midpoints) and so the advantages of the second one are marginal. Both approaches are covered in the sequel. 28.3. Direct Stress Evaluation at Nodes This approach is straightforward and need not be discussed in detail. 284
285
28.4
(a) 4
(e) 1
Figure 28.1. Extrapolation from 4-node quad Gauss points: (a) 2 2 rule, (b) Gauss element (e )
28.4. Extrapolation from Gauss Points This will again be explained for the four-node bilinear quadrilateral. The normal Gauss integration rule for element stiffness evaluation is 2 2, as illustrated in Figure 28.1. The stresses are calculated at the Gauss points, which are identied as 1 , 2 , 3 and 4 in Figure 28.1. Point i is closest to node i so it is seen that Gauss point numbering essentially follows element node numbering in the counterclockwise sense. The natural coordinates of these points are listed in Table 28.1. The stresses are evaluated at these Gauss points by passing these natural coordinates to the shape function subroutine. Then each stress component is carried to the corner nodes 1 through 4 through a bilinear extrapolation based on the computed values at 1 through 4 . To understand the extrapolation procedure more clearly it is convenient to consider the region bounded by the Gauss points as an internal element or Gauss element. This interpretation is depicted in Figure 28.1(b). The Gauss element, denoted by (e ), is also a four-node quadrilateral. Its quadrilateral (natural) coordinates are denoted by and . These are linked to and by the simple relations = / 3, = / 3, = 3, = 3. (28.4) Any scalar quantity w whose values wi at the Gauss element corners are known can be interpolated through the usual bilinear shape functions now expressed in terms of and : (e ) N1 (e ) N2 , (28.5) w( , ) = [ w1 w2 w3 w4 ] (e ) N
(e ) N4 3
(28.6)
285
286
(a) 7 4 8 1 7' 4' 8' 1' 9 9' 5' 5 6' 6 2' 2 1 8 3' 3 4
(b) 4'
7 7' 3'
(c)
3 3' 5 2'
6' 6 2' 2 1
6 1' 4 2
Figure 28.2. Gauss elements for higher order quadrilaterals and triangles: (a) 9-node element with 3 3 Gauss rule, (b) 8-node element with 3 3 Gauss rule, (c) 6-node element with 3-interior point rule.
To extrapolate w to corner 1, say, we replace its and coordinates, namely = = 3, into the above formula. Doing that for the four corners we obtain 1 + 1 3 1 1 1 3 1 w1 w1 2 2 2 2 1 1 1 1 2 1 2 3 w2 w2 2 1 + 2 3 (28.7) = 1 1 1 w3 w3 2 1+ 2 3 1 1 2 3 2 w4 w4 1 1 1 3 1 1+ 1 3
2 2 2 2
Note that the sum of the coefcients in each row is one, as it should be. For stresses we apply this formula taking w to be each of the three stress components, x x , yy and x y , in turn. Extrapolation in Higher Order Elements For eight-node and nine-node isoparametric quadrilaterals the usual Gauss integration rule is 3 3, and the Gauss elements are nine-noded quadrilaterals that look as in Figure 28.2(a) and (b) above. For six-node triangles the usual quadrature is the 3-point rule with internal sampling points, and the Gauss element is a three-node triangle as shown in Figure 28.2(c). 28.5. Interelement Averaging The stresses computed in element-by-element fashion as discussed above, whether by direct evaluation at the nodes or by extrapolation, will generally exhibit jumps between elements. For printing and plotting purposes it is usually convenient to smooth out those jumps by computing averaged nodal stresses. This averaging may be done in two ways: (I) Unweighted averaging: assign same weight to all elements that meet at a node;
(II) Weighted averaging: the weight assigned to element contributions depends on the stress component and the element geometry and possibly the element type. Several weighted average schemes have been proposed in the nite element literature, but they do require additional programming. 286
Introduction to FEM
Stress Recovery
28
IFEM Ch 28 Slide 1
Introduction to FEM
Assembler
BC Application
Element Stiffnesses
Element Library
IFEM Ch 28 Slide 2
Introduction to FEM
Stress Recovery
Processing phase has solved for node displacements from the (modified) master stiffness equations
Ku=f
Postprocessing phase now starts to get derived quantities. Among them are internal forces and stresses.
The process of computing stresses from node displacements is called stress recovery.
IFEM Ch 28 Slide 3
Introduction to FEM
General Comments
Stresses recovered from low order elements (e.g. 3-node triangles and 4-node quads) often display large interelement jumps. In-plane bending situations are particularly troublesome Jumps can be eliminated by interelement averaging at nodes This usually improves the stress quality at interior nodes, but may not be effective at boundary nodes. Stress recovery over quadrilateral elements can be improved by extrapolation from Gauss sample points
IFEM Ch 28 Slide 4
Introduction to FEM
IFEM Ch 28 Slide 5
Introduction to FEM
IFEM Ch 28 Slide 6
Introduction to FEM
Gauss Elements
(a) 4
(e) 1
IFEM Ch 28 Slide 7
Introduction to FEM
Table 28.1
Corner node 1 2 3 4 1 +1 +1 1
1 1 +1 +1
Gauss nodes, and coordinates and are dened in 28.4 and Fig. 28.1
IFEM Ch 28 Slide 8
Introduction to FEM
1 3 1 + 2 1 1 w2 2 = 1 w3 1 2 3 w4 1 2 w
1 1 1 3 2 2 1+ 1 3 1 2 2 1 1 2 1+ 2 3 1 1 3 1 2 2
1 w1 2 1 1 2 3 w2 w 1 3 2 1 w4 1+ 2 3
IFEM Ch 28 Slide 9
Introduction to FEM
(b) 4'
7 7' 3'
(c)
3 3' 5 2'
6' 6 2' 2 1
6 1' 4 2
IFEM Ch 28 Slide 10
Thermomechanical Eects
30
301
302
TABLE OF CONTENTS
Page
30.1. Thermomechanical Behavior 30.1.1. Thermomechanical Stiffness Relations 30.1.2. Globalization . . . . . . . . 30.1.3. Merge . . . . . . . . . . . 30.1.4. Solution . . . . . . . . . 30.1.5. Postprocessing . . . . . . . . 30.1.6. Worked-Out Example 1 . . . . 30.1.7. Worked-Out Example 2 . . . . . 30.2. Initial Force Effects 30.3. Pseudo Thermal Inputs 30. Notes and Bibliography . . . . . . . . . . . . . 30. References . . . . . . . . . . . . . 30. Exercises . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . .
303 304 305 305 306 306 306 307 308 309 309 309 3010
302
303
30.1
THERMOMECHANICAL BEHAVIOR
The assumptions invoked in Chapters 2-3 for the example truss result in zero external forces under zero displacements. This is implicit in the linear-homogeneous expression of the master stiffness equation f = Ku. If u vanishes, so does f. This behavior does not apply, however, if there are initial force effects.1 If those effects are present, there can be displacements without external forces, and internal forces without displacements. A common source of initial force effects are temperature changes. Imagine that a plane truss structure is unloaded (that is, not subjected to external forces) and is held at a uniform reference temperature. External displacements are measured from this environment, which is technically called a reference state. Now suppose that the temperature of some members changes with respect to the reference temperature while the applied external forces remain zero. Because the length of members changes on account of thermal expansion or contraction, the joints will displace. If the structure is statically indeterminate those displacements will induce strains and stresses and thus internal forces. These are distinguished from mechanical effects by the qualier thermal. For many structures, particularly in aerospace and mechanical engineering, such effects have to be considered in the analysis and design. There are other physical sources of initial force effects, such as moisture (hygrosteric) effects,2 member prestress, residual stresses, or lack of t. For linear structural models all such sources may be algebraically treated in the same way as thermal effects. The treatment results in an initial force vector that has to be added to the applied mechanical forces. This subject is outlined in 30.3 from a general perspective. However, to describe the main features of the matrix analysis procedure it is sufcient to consider the case of temperature changes. In this Section we go over the analysis of a plane truss structure whose members undergo temperature changes from a reference state. It is assumed that the disconnection and localization steps of the DSM have been carried out. Therefore we begin with the derivation of the matrix stiffness equations of a generic truss member. 30.1. Thermomechanical Behavior Consider the generic plane-truss member shown in Figure 30.1. The member is prismatic and uniform. The temperature T is also uniform. To reduce clutter the member identication subscript will be omitted in the following development until the globalization and assembly steps. We introduce the concept of reference temperature Tr e f . This is conventionally chosen to be the temperature throughout the structure at which the displacements, strains and stresses are zero if no mechanical forces are applied. In structures such as buildings and bridges Tr e f is often taken to be the mean temperature during the construction period. Those zero displacements, strains and stresses, together with Tr e f , dene the thermomechanical reference state for the structure. The member temperature variation from that reference state is T = T Tr e f . This may be positive or negative. If the member is disassembled or disconnected, under this variation the member length
1
Called initial stress or initial strain effects by many authors. The different names reect what is viewed as the physical source of initial force effects at the continuum mechanics level. These are important in composite materials and geomechanics.
303
304
is free to change from L to L + dT . If the thermoelastic constitutive behavior is linear3 then dT is proportional to L and T : dT = L T. (30.1) Here is the coefcient of thermal expansion, which has physical units of one over temperature. This coefcient will be assumed to be uniform over the generic member. It may, however, vary from member to member. (a) fyj , uyj f yi , u yi y The thermal strain is dened as eT = dT / L = T. (30.2)
f xi , u xi
(e) i
fx j , ux j
j
ks = E A / L
Now suppose that the member is also subject to mechanical forces, more precisely the applied axial force F shown in Figure 30.1. The member axial stress is = F / A. In response to this stress the length changes by d M . The mechanical strain is e M = d M / L . The total strain e = d / L = (d M + dT )/ L is the sum of the mechanical and the thermal strains: e = e M + eT = + T E (30.3)
(b)
F L
L + d M + dT d = d M + dT
This superposition of deformations is the basic assumption made in the thermomechanical analysis. It is physically obvious for an unconstrained member such as that depicted in Figure 30.1.
Figure 30.1. Generic truss member subjected to mechanical and thermal effects: (a) idealization as bar, (b) idealization as equivalent linear spring.
At the other extreme, suppose that the member is completely blocked against axial elongation; that is, d = 0 but T = 0. Then e = 0 and e M = eT . If > 0 and T > 0 the blocked member goes in compression because = Ee M = EeT = E T < 0. This thermal stress is further discussed in Remark 30.2.
F = fxi
p = p M + pT
F = fxj
An assumption justied if the temperature changes are small enough so that is approximately constant through the range of interest, and no material phase change effects occur.
304
30.1
THERMOMECHANICAL BEHAVIOR
Because e = d / L and d = u xj u xi , (30.3) can be developed as xi u xj u = + T, L E To pass to internal forces (30.4) is multiplied through by E A: (30.4)
EA (u xj u xi ) = A + E A T = p M + pT = p = F . (30.5) L Here p M = A denotes the mechanical axial force, and pT = E A T , which has the dimension of a force, is called (not surprisingly) the internal thermal force. The sum p = p M + pT is called the effective internal force. The last relation in (30.5), F = p = p M + pT follows from free-body member equilibrium; see Figure 30.2. Passing to matrix form: u xi EA u (30.6) F= [ 1 0 1 0 ] yi . u yi L u yj Noting that F = fx j = fxi while fyi = fy j = 0, we can relate joint forces to joint displacements as f xi F fyi 0 f = F =
fy j
xj
fM xi fM yi + EA fM x j fM y j
1 1 0 EA 0 T = 1 1 L 0 0
0 0 0 0
1 0 u xi yi 0 0u . xj 1 0u u yj 0 0
(30.7)
is the same member stiffness matrix derived in 2.6.3. The new ingredient that appears is Here K the vector 1 0 (30.9) fT = E A T , 1 0 This is called the vector of thermal joint forces in local coordinates. It is an instance of an initial force vector at the element level.
= 0. Then from joint (node) motions so that u fM + fT = 0 or f M = fT . It follows that fT contains the negated joint forces (internal forces) that develop in a heated or cooled bar if joint motions are precluded. Because for most materials > 0, rising the temperature of a blocked bar: T > 0, produces an internal compressive thermal force pT = AT = E A T , in accordance with the expected physics. The quantity T = E T is the thermal stress. This stress can cause buckling or cracking in severely heated structural members that are not allowed to expand or contract. This motivates the use of expansion joints in pavements, buildings and rails, and roller supports in long bridges.
Remark 30.1. A useful physical interpretation of (30.8) is as follows. Suppose that the member is precluded
305
306
30.1.2. Globalization At this point we restore the member superscript so that the member stiffness equations (30.7) are rewritten as e e eu e = fM + fT . (30.10) K Use of the transformation rules developed in 3.1 to change displacements and forces to the global system {x , y } yields e K e ue = f e (30.11) M + fT , where Te is the displacement transformation matrix (3.1), and the transformed quantities are Ke = T e
T
e Te , K
e fe M = T
T e
f,
e fe T = T
T e fT .
(30.12)
These globalized member equations are used to assemble the free-free master stiffness equations by a member merging process. 30.1.3. Merge The merge process is based on the same assembly rules stated in 3.1.3 with only one difference: thermal forces are added to the right hand side. The member by member merge is carried out much as described as in 3.1.4, the main difference being that the thermal force vectors fe T are also merged into a master thermal force vector. Force merge can be done by augmentation-and add (for hand work) or via freedom pointers (for computer work). Illustrative examples are provided below. Upon completion of the assembly process we arrive at the free-free master stiffness equations Ku = f M + fT = f. 30.1.4. Solution The master system (30.13) has formally the same conguration as the master stiffness equations (2.3). The only difference is that the effective joint force vector f contains a superposition of mechanical and thermal forces. Displacement boundary conditions can be applied by reduction or modication of these equations, simply by using effective joint forces in the descriptions of 3.2.1, 3.4.1 and 30.1. Processing the reduced or modied system by a linear equation solver yields the displacement solution u. 30.1.5. Postprocessing The postprocessing steps described in 3.4 require some modications because the derived quantities of interest to the structural engineer are mechanical reaction forces and internal forces. Effective forces by themselves are of little use in design. Mechanical joint forces including reactions are recovered from (30.14) f M = Ku fT To recover mechanical internal forces in member e, compute p e by the procedure outlined in 3.4.2, and subtract the thermal component:
e e e e pe M = p E A
(30.13)
T e.
(30.15)
e This equation comes from solving (30.5) for p M . The mechanical axial stress is e = p e M/A .
306
307
30.1.6. Worked-Out Example 1 The rst worked out problem is dened in Figure 30.3. Two truss members are connected in series as shown and xed at the ends. Properties E = 1000, A = 5 and = 0.0005 are common to both members. The member lengths are 4 and 6. A mechanical load P = 90 acts on the roller node. The temperature of member (1) increases by T (1) = 25 while that of member (2) drops by T (2) = 10 . Find the stress in both members.
To reduce clutter note that all y motions are suppressed so only the x freedoms are kept: u x 1 = u 1 , u x 2 = u 2 and u x 3 = u 3 . The corresponding node forces are denoted by f x 1 = f 1 , f x 2 = f 2 and f x 3 = f 3 . The thermal force vectors, stripped to their x x components, are
(1) fT = (1) fT 1 (1) fT 2
2) 1 150 ( = , f T = 1 150
2000
No globalization is needed because the equations are already in the global system, and thus we can get rid of the localization marker symbols: f f , u u . Assembling by any method yields 1000 3 3 0 3 5 2 0 2 2 u1 u2 u3 = f M1 f M2 f M3 + 150 150 + 60 60 = f M1 f M2 f M3 + 150 210 60 . (30.18)
The displacement boundary conditions are u 1 = u 3 = 0. The mechanical force boundary condition is f M 2 = 90. On removing the rst and third equations, the reduced system is 5000 u 2 = f M 2 + 210 = 90 + 210 = 300, which yields u 2 = 300/5000 = +0.06. The mechanical internal forces in the members are recovered from E (1) A(1) (u 2 u 1 ) E (1)A(1) (1) T (1) = 3000 0.06 12000 0.0005 25 = 60, L (1) E (2) A(2) 2) (u 3 u 2 ) E (2)A(2) (2) T (2) = 2000 (0.06) 12000 0.0005 (10) = 72, p( M = L (2) (30.19) (1) (2) whence the stresses are = 60/12 = 5 and = 72/12 = 6. Member (1) is in tension and member (2) in compression.
1) p( M =
30.1.7. Worked-Out Example 2 The second example concerns the example truss of Chapters 2-3. The truss is mecanically unloaded, that is, f M x 2 = f M x 3 = f M y 3 = 0. However the temperature of members (1) (2) and (3) changes by T , T and 3 T , respectively, with respect to Tr e f . The thermal expansion coefcient of all three members is assumed to be . We will perform the analysis keeping and T as variables.
307
; ; ;; ;; ; ; ;
(1) (2)
x // x
y // y
P = 90
(1)
=4
L =6
(2)
(2) fT 2 (2) fT 3
1 60 = . 1 60 (30.16)
1 1 1 1
2) u ( 2 (2) u 3
308
The thermal forces for each member in global coordinates are obtained by using (30.10) and the third of (30.12):
1) (1) (1) (1) A f( T = E
(30.20)
Merging the contribution of these 3 members gives the master thermal force vector
0 + 0 200 100 + 0 + 0 fT = T 0 50 + 0
100 + 0 200
0 + 0 + 200 0 + 50 + 200
200 = T 100 50
200 250
300
(30.21)
The master stiffness matrix K does not change. Consequently the master stiffness equations are
20 10 10 0
200 100 T 50
200 250
300
(30.22)
in which f M x 1 , f M y 1 and f M y 2 are the unknown mechanical reaction forces, and the known forces and displacements have been marked. Since the prescribed displacements are zero, the reduced system is simply 10 0 0 10 0 10 0 10 15 ux2 ux3 u y3 = 0 0 0 + T 100 200 250 = T 100 200 250 . (30.23)
Solving (30.23) gives u x 2 = u x 3 = u y 3 = 10 T . Completing u with the prescribed zero displacements and premultiplying by K gives the complete effective force vector:
20 10 10 f = Ku = 0
10 10 0 10 10 0 10 0 0 10 10 0 0 10 0 0 0 10 0 0 5 0 5 0 10 10 0 0 10 10 10 10 10 0 5 10 15 10
200 100 T = T 50 .
200 250
300
(30.24)
308
309
All mechanical joint forces, including reactions, vanish, and so do the internal mechanical forces. This is a consequence of the example frame being statically determinate.4 Such structures do not develop thermal stresses under any combination of temperature changes.
30.2. Initial Force Effects As previously noted, a wide spectrum of mechanical and non-mechanical effects can be acommodated under the umbrella of the initial force concept. The stiffness equations at the local (member) level are e e e eu e = fM + fI = f, (30.26) K and at the global (assembled structure) level: Ku = f M + f I = f. (30.27)
In these equations subscripts M and I identify mechanical and initial node forces, respectively. The sum of the two: f at the local member level and f at the global structure level, are called effective forces. A physical interpretation of (30.26) can be obtained by considering that the structure is blocked against all motions: u = 0. Then f M = f I , and the undeformed structure experiences mechanical forces. These translate into internal forces and stresses. Engineers also call these prestresses. Local effects that lead to initial forces at the member level are: temperature changes (studied in 4.2, in which f I fT ), moisture diffusion, residual stresses, lack of t in fabrication, and in-member prestressing. Global effects include prescribed nonzero joint displacements (studied in 4.1) and multimember prestressing (for example, by cable pretensioning of concrete structures). As can be seen there is a wide variety of physical effects, whether natural or articial, that lead to nonzero initial forces. The good news is that once the member equations IFEM:DSMAdd:eqn:ExampleTwoMechForces are formulated, the remaining DSM steps (globalization, merge and solution) are identical. This nice property extends to the general Finite Element Method. 30.3. Pseudo Thermal Inputs Some commercial FEM programs do not have a way to handle directly effects such as moisture, lack of t, or prestress. But all of them can handle temperature variation inputs. Since in linear analysis all such effects can be treated as initial forces, it is possible (at least for bar elements) to model them as ctitious thermomechanical effects, by inputting phony temperature changes. The following example indicate that this is done for a bar element. Suppose that a prestress force FP is present in a bar. The total elongation is d = d M + d P where d P = FP L /( E A) is due to prestress. Equate to a thermal elongation: dT = TP L and solve for TP = FP /( E A). This is input to the program as a ctitious temperature change. If in addition there is a real temperature change T one would of course specify T + TP . If this device is used, care should be exercised in interpreting results for internal forces and stresses given by the program. The trick is not necessary for personal or open-source codes over which you have full control.
4
For the denition of static determinacy, see any textbook on Mechanics of Materials; e.g. [20,201].
309
3010
Notes and Bibliography The additional DSM topics treated in this Chapter are covered in virtually all books on Matrix Structural Analysis, such as the often quoted one by Przemieniecki [205]. Several recent FEM books ignore these topics as too elementary. The physics of thermomechanics and the analysis of thermal stresses is covered adequatedly in textbooks such as Boley and Wiener [33], or manuals such as the widely used Roarks [212]. s For the separate problems of heat conduction and heat transfer, the book by Ozi ik [188] provides a comprehensive classic treatment. There is a vast literature on prestressed structures; search under prestress in http://www3.addall.com. The concepts of static determinacy and its counterpart: static indeterminacy, are important in skeletal structures such as trusses and frameworks. The pertinent design tradeoff is: insensitivity to initial force effects versus redundant safety. A discussion of this topic is beyond the scope of the book. Once going past skeletal structural systems, however, indeterminacy is the rule. References Referenced items have been moved to Appendix R.
3010
3011
Homework Exercises for Chapter 30 Thermomechanical Effects
Exercises
EXERCISE 30.1 [N:20] Use the same data of Exercise 3.7, except that P = 0 and consequently there are no applied mechanical forces. Both members have the same dilatation coefcient = 106 1/ F. Find the crown displacements u x 2 and u y 2 and the member stresses (1) and (2) if the temperature of member (1) rises by T = 120 F above Tr e f , whereas member (2) stays at Tr e f .
Shortcut: the element stiffnesses and master stiffness matrix are the same as in Exercise 3.7, so if that Exercise has been previously assigned no stiffness recomputations are necessary.
EXERCISE 30.2 [A:15] Consider the generic truss member of 2.4, reproduced in Figure E30.1 for conve-
nience.
_
y
_
x j
The disconnected member was supposed to have length L , but because of lack of quality control it was fabricated with length L + , where is called the lack of t. Determine the initial force vector f I to be used in (30.26). Hint: nd the mechanical forces that would compensate for and restore the desired length.
EXERCISE 30.3 [A:10] Show that the lack of t of the foregoing exercise can be viewed as equivalent to a prestress force of ( E A / L ) . EXERCISE 30.4 [A:20] Show that prescribed nonzero displacements can, albeit somewhat articially, be placed under the umbrella of initial force effects. Work this out for the example of 30.1.1. Hint: split node displacements into u = u H + u N , where u N (the nonhomogeneous part) carries the nonzero displacement values. EXERCISE 30.5 [A:40]. (Research paper level). Prove that any statically determinate truss structure is free
of thermal stresses.
3011
31
311
312
TABLE OF CONTENTS
Page
31.1. Introduction 31.2. Semidiscrete Equations of Motion 31.2.1. Vibrations as Equilibrium Disturbance 31.2.2. Undamped Free Vibrations . . . . 31.2.3. The Vibration Eigenproblem . . . 31.2.4. Eigensystem Properties . . . . . 31.3. Solving The Vibration Eigenproblem 31.3.1. Determinant Roots . . . . . . 31.3.2. Reduction to the Standard Eigenproblem 31.3.3. Unsymmetric Reduction . . . . . 31.3.4. Symmetry Preserving Reduction . . 31. Notes and Bibliography . . . . . . . . . . . . . 31. References. . . . . . . . . . . . . . 31. Exercises . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
313 313 314 315 316 316 317 317 317 317 318 318 319 3110
312
31.2
The development in previous chapters pertain to static analysis, in which all quantities are independent of time. This kind of analysis applies also to quasi-static scenarios, where the state varies with time but does so slowly that inertial and damping effects can be ignored. For example one may imagine situations such as a roof progressively burdened by falling snow before collapse, the lling of a dam, or the construction of a tunnel. Or foundation settlements: think of the Pisa tower before leaning stopped. The quasi-static assumption is commonly used in design even for loads that vary in a faster time scale. For example, vehicles travelling over a bridge or wind effects on buildings.1 By contrast dynamic analysis is appropriate when the variation of displacements with time is so rapid that inertial effects cannot be ignored. There are numerous practical examples: earthquakes, rocket launches, vehicle crashes, explosive forming, air blasts, underground explosions, rotating machinery, airplane utter. The structural accelerations, which are second derivatives with respect to time, must be kept in the governing equations. Damping effects, which are associated with velocities (the rst temporal derivatives of displacements), may be also included. However, passive damping effects are often neglected as they tend to take energy out of a system and thus reduce the response amplitude. Dynamic analysis may be performed in the time domain or the frequency domain. The latter is restricted in scope in that it applies to linear structural models, or to linearized uctuations about an equilibrium state. The frequency domain embodies naturally the analysis of free vibrations, which is the focus of the present Chapter.
Remark 31.1. Mathematically, a dynamical system consists of a phase space together with an evolution law.
(J.C. Yoccoz). A major goal of the theory is to understand the long term behaviour of the system.
31.2. Semidiscrete Equations of Motion The essence of structural analysis is mastering forces. In the development of FEM, this was understood by the pioneers of the rst generation, as narrated in 1.7.1. With the victory of the Direct Stiffness Method (DSM) by 1970, displacements came to the foreground as primary computational variables because they scale well into complicated systems. To understand dynamic analysis, that dual role must be kept in mind. Displacements become even more important as computational variables. After all, velocities and accelerations are temporal derivatives of displacements. There is no easy way to do the job with forces only, since dynamics is about motion. On the other hand, the fundamental governing equations of structural dynamics are force balance statements. They are elaborate versions of Newtonian mechanics. This Newtonian viewpoint is illustrated in Table 31.1 for several modeling scenarios that span statics, dynamics and vibrations. For notational simplicity it is assumed that the structure has been discretized in space, for example by the FEM. The right column shows the vector form of the governing equations as force balance statements. The table denes nomenclature.
1
The quasi-static assumption can be done during design if dynamic effects can be accounted for through appropiate safety factors. For many types of structures (e.g., buildings, bridges, offshore towers) these are specied in building codes. This saves time when dynamic effects are inherently nondeterministic, as in trafc, winds or wave effects.
313
314
Table 31.1. Discrete Structural Mechanics Expressed as Force Balance Statements Case Problem type I General nonlinear dynamics Governing force balance equations , u , t ) = f(u, u , t) p(u, u
internal exter nal
II III
p(u) = f(u)
internal exter nal
(t ) + C u (t ) + K u(t ) = f(t ) Mu
iner tial damping elastic exter nal
Ku =
elastic
f
exter nal
VI Dynamic perturbations
(t ) + C u (t ) + K u(t ) = f p (t ) Mu
iner tial damping elastic periodic
(t ) + C u (t ) + K u(t ) = 0 Mu
iner tial damping elastic
( t ) + K u (t ) = 0 Mu
iner tial elastic
Symbol u is array of total displacement DOFs; d in case VI is a linearized perturbation of u. = d u/dt , u = d 2 u/dt 2 , etc. Symbol t denotes time. Superposed dots abbreviate time derivatives: u The history u = u(t ) is called the response of the system. This term is extendible to nonlinear statics. Initial force effects f I may be accommodated in forced cases by taking f = f I when u = 0.
When the model is time dependent, the relations shown in the right column of Table 31.1 are called semidiscrete equations of motion. The qualier semidiscrete says that the time dimension has not been discretized: t is still a continuous variable. This legalizes the use of time differentiation, abbreviated by superposed dots, to bring in velocities and accelerations. This table may be scanned top down by starting with the most general case I: nonlinear structural dynamics, branching down to more restricted but specic forms. Along the way one nds in case V an old friend: the DSM master equations K u = f for linear elastostatics, treated in previous Chapters. The last case IX: undamped free vibrations, is that treated in this and next two Chapters. Some brief comments are made as regards damped and forced vibrations. 31.2.1. Vibrations as Equilibrium Disturbance An elastic structure is placed in motion through some short-term disturbance, for example an impulse. Remove the disturbance. If wave propagation effects are ignored and the structure remains 314
315
31.2
elastic, it will keep on oscillating in a combination of time-periodic patterns called vibration modes. Associated with each vibration mode is a characteristic time called vibration period. The inverse of a period, normalized by appropriate scaling factors, is called a vibration frequency. The structure is said to be vibrating, or more precisely undergoing free vibrations. In the absence of damping mechanisms an elastic structure will vibrate forever. The presence of even minute amounts of viscous damping, however, will cause a gradual decrease in the amplitude of the oscillations. These will eventually cease.2 If the disturbances are sufciently small to warrant linearization, this scenario ts case VI of Table 31.1, therein labeled dynamic perturbations. Its main application is the investigation of dynamic stability of equilibrium congurations. If the perturbation d(t ) is unbounded under some initial conditions, that equilibrium conguration3 is said to be dynamically unstable. The analysis of case VI does not belong to an introductory course because it requires advanced mathematical tools. Moreover it often involve nondeterministic (stochastic) effects. Cases VII through IX are more tractable in an introductory course. In these, uctuations are linearized about an undeformed and unstressed state dened by u = 0. Thus d (the perturbed displacement) becomes simply u (the total displacement). Matrices M, C and K are called the mass, damping and stiffness matrices, respectively. These matrices are independent of u since they are evaluated at the undeformed state u = 0. Two scenarios are of interest in practice: 1. Forced Vibrations. The system is subjected to a time dependent force f(t ). The response u(t ) (t ) + C u (t ) + K u(t ) = f(t ) of case IV. is determined from the linear dynamics equation: M u Of particular interest in resonance studies in when f(t ) is periodic in time, which is case VII. Free Vibrations. The external force is zero for t > 0. The response u(t ) is determined from initial conditions. If damping is viscous and light, the undamped model gives conservative answers and is much easier to handle numerically. Consequently the model of case IX is that generally adopted during design studies.
2.
31.2.2. Undamped Free Vibrations From the foregoing discussion it follows that case IX: undamped free vibrations is of paramount importance in design. The governing equation is (t ) + K u(t ) = 0. Mu (31.1)
This expresses a force balance4 in the following sense: in the absence of external loads the internal . The only ingredient beyond the elastic forces K u balance the negative of the inertial forces Mu by now familiar K is the mass matrix M. The size of these matrices will be denoted by n f , the number of degrees of freedom upon application of support conditions.
2
Mathematically a damped oscillation also goes on forever. Eventually, however, the motion amplitude reaches a molecular scale level at which a macroscopic idealization does not apply. At such point the oscillations in the physical structure can be considered to have ceased. Usually obtained through a nonlinear static analysis. This kind of study, called dynamic stability analysis, is covered under Nonlinear Finite Element Methods. Where is f = ma ? To pass to internal forces change the sign of f : f int + ma = ku + ma = 0. Replace by matrices and vectors and you have (31.1).
315
316
Equation (31.1) is linear and homogeneous. Its general solution is a linear combination of exponentials. Under matrix deniteness conditions discussed later the exponentials can be expressed as a combination of trigonometric functions: sines and cosines of argument t . A compact representation of such functions is obtained by using the exponential form e j t , where j = 1: u(t ) =
i
vi e j i t .
(31.2)
Here i is the i th circular frequency, expressed in radians per second, and vi = 0 the corresponding vibration mode shape, which is independent of t . 31.2.3. The Vibration Eigenproblem Replacing u(t ) = v e j t in (31.1) segregates the time dependence to the exponential: (2 M + K) v e j t = 0. Since e j t is not identically zero, it can be dropped leaving the algebraic condition: (2 M + K) v = 0. (31.3) Because v cannot be the null vector, this equation is an algebraic eigenvalue problem in 2 . The eigenvalues i = i2 are the roots of the characteristic polynomial be indexed by i : det(K i2 M) = 0. Dropping the index i this eigenproblem is usually written as K v = 2 Mv. (31.5) (31.4)
If M and K satisfy some mild conditions, solutions of (31.5) are denoted by i and vi . This are called the vibration frequencies or eigenfrequencies, and the it vibration modes or eigenmodes, respectively. The set of all i is called the frequency spectrum or simply spectrum. . 31.2.4. Eigensystem Properties Both stiffness K and mass M are symmetric matrices. In addition M is nonnegative. Nothing more can be assumed in general. For example, if K incorporates Lagrangian multipliers from the treatment of a MFC, as explained in Chapter 10, it will be indenite. If M is positive denite, the following properties hold. 1. There are n f squared vibration frequencies i2 , which are roots of the characteristic polynomial (31.4). These are not necessarily distinct. A root of (31.6) that appears m times is said to have multiplicity m .5 All roots i2 of (31.6) are real. The corresponding eigenmodes vi have real entries. If K is nonnegative, i2 0 and the frequencies i = + i2 are also real and nonnegative. Furthermore, if K is positive denite, all i2 > 0 and consequently + i > 0.
2. 3.
If M is nonnegative, care must be exercised; this case is discussed in an Exercise. If M is indenite (which should never happen in structures) all of the foregoing properties are lost.
5
For example, a free-free (fully unsupported) structure has n R zero frequencies, where n R is the number of rigid body modes.
316
317
31.3
Example 31.1. This illustrates the weird things that can happen if M is indenite. Consider
1 , 2
M=
0 1
1 , 1+
(31.6)
1 1 2 1
(1 ) . (1 + + )
(31.7)
[4 4 + (1 + )2 ] . (31.8) 4 2 These are complex if the radicand is negative. But that is not all. If 0 one eigenvalue goes to . If = 0, A = M1 K is a 2 2 Jordan block and one eigenvector is lost.
2 1 ,2 =
2 + +
31.3. Solving The Vibration Eigenproblem In what follows we often denote i = i2 to agree more closely with the conventional notation for the algebraic eigenproblem. 31.3.1. Determinant Roots Mathematically the i2 are the roots of the characteristic equation (31.4). The simple minded approach is to expand the determinant to get the characteristic polynomial P (i2 ) and get their roots: (31.9) det(K i2 M) = P (i2 ) = 0. This approach is deprecated by numerical analysts. It seems as welcome as anthrax. Indeed for numerical oating point computations of large systems it risks numerical overow; moreover the roots of the characteristic polynomial can be very ill-conditioned with respect to coefcients. For small systems and using either exact or symbolic computation there is nothing wrong with this if the roots can be expressed exactly in terms of the coefcients, as in the above example. 31.3.2. Reduction to the Standard Eigenproblem The standard algebraic eigenproblem has the form Ax = x. (31.10)
Most library routines included in packages such as Matlab and Mathematica are designed to solve this eigenproblem. If A is symmetric the eigenvalues i are real; moreover there exist a complete system of eigenvectors xi . If these are normalied to length one: ||xi ||2 = 1 they satisfy the orthonormality conditions xiT x j = i j = 1 0 if i = j , if i = j xiT Ax j = i , (31.11)
where i j is the Kronecker delta. If the xi are collected as columns of a matrix X, the foregoing conditions can be expressed as XT X = I and XT KX = = diagi . 317
318
31.3.3. Unsymmetric Reduction If M is nonsingular, a simple way to reduce Kv = 2 Mv to standard form is to premultiply both sides by M1 whence M1 Kv = 2 v Ax = x, with A = M1 K, = 2 , x = v. (31.12)
The fastest way to form A is by solving MA = K for A. One nice feature of (31.12) is that the eigenvectors need not be backtransformed, as happens in symmetry-preserving methods. As in the case of the characteristic polynomial, this is deprecated by numerical analysts, also not so vehemently. Their objection is that A is not generally symmetric even if K and M are. So Ax = x has to be submitted to an unsymmetric eigensolver. Thus risks contaminating the spectrum with complex numbers. Plus, it is slower. The writers experience is that (31.12) works perfectly ne for small systems. If tiny imaginary components appear, they are set to zero and life goes on. 31.3.4. Symmetry Preserving Reduction It is possible to retain symmetry by proceeding as follows. Decompose the mass matrix as M = LLT (31.13)
This is the Cholesky decomposition, which can be carried out to completion if M is positive denite. Then (31.14) A = L1 KLT . The demonstraion is in one of the Exercises. The symmetric eigenproblem can be handled by standard library routines, which give back all the eigenvalues and eigenvectors. The square root of the eigenvalues give the vibration frequencies and the vibration modes are recovered from the relation Lvi = xi , which can be handled by standard library routines.
Notes and Bibliography The literature on dynamics and vibrations of structures is quite large. It is sufcient to cite here titles that incorporate modern analysis methods: Clough and Penzien [45], Geradin and Rixen [112], Meirovich [174,175] and Wilson [272]. Several books in matrix methods and FEM books contain at least an introductory treatment of dynamics. Citable textbooks include Bathe [15], Cook, Malkus and Plesha [50], Hughes [142]. Despite their age, Przemieniecki [205] remains a useful source of mass matrices, and Pestel and Leckie [194] contains a catalog of transfer matrices (an early 1960 method suitable for small computers). As regards books on linear algebra matrix theory and matrix calculus see the Bibliography cited in Appendix A. The most elegant coverage is that of Strang [229]. Two comprehensive references on matrix computations in general are Golub and VanLoan [115] and Stewart [225]. The former is more up to date as regard recent literature. Bellman [24] contains more advanced material. Stewart and Sun [226] cover the sensitivity analysis of standard and generalized eigenproblems. There are comprehensive books that treat the algebraic eigenproblem. Wilkinsons masterpiece [265] is dated in several subjects, particularly the generalized eigenproblem and the treatment of large eigenproblems. But it is still unsurpassed as the bible of backward error analysis. More up to date in methods is Parlett [192], which is however restricted to the symmetric eigenproblem.
318
319
31.
References
As regards source code for matrix computations, the Handbook compilation of Algol 60 procedures by Wilkinson and Reisch [266] is elegant and still useful as template for other languages. Half of the handbook deals with eigenvalue problems. By contrast, the description of Fortran EISPACK code [110] suffers from the inherent ugliness and unreadability of Fortran IV. And of course there is Numerical Recipes in various avors. To borrow from the immortal words of Winston Churchill, never have so few wasted the time of so many. References Referenced items moved to Appendix R.
319
3110
2 1 M= 0 0
1 4 1 0
0 1 4 1
0 0 , 1 2
1 1 0 0 1 2 1 0 K= . 0 1 2 1 0 0 1 1
(E31.1)
Solve the vibration eigenproblem and show the natural frequencies and associated vibration modes. Normalize the latter so that VT MV = I (mass normalized eigenvectors). 1 /2. Using Matlab or Mathematica, solve the eigenproblem for varing from 0to4 in 0.5 increments. Discuss what happens to the frequencies and vibration modes as goes to 2 and beyond. Explain.
EXERCISE 31.3 [D:20]. Eigenvectors can be scaled by arbitrary nonzero factors. Discuss 4 ways in which EXERCISE 31.2 [A:25]. In (E31.1) replace the (4,4) mass entry by 2 and the (4,4) stiffness entry by
the eigenvectors vi of Kvi = i2 Mvi can be normalized, and what assumptions are necessary in each case.
3110
32
321
322
TABLE OF CONTENTS
Page
32.1. Introduction 32.2. Mass Matrix Construction 32.2.1. Direct Mass Lumping . . . 32.2.2. Variational Mass Lumping . . 32.2.3. Template Mass Lumping . . 32.2.4. Mass Matrix Properties . . . 32.2.5. Rank and Numerical Integration 32.3. Globalization 32.4. Mass Matrix Examples: Bars and Beams 32.4.1. The 3-Node Bar . . . . . . 32.4.2. The Bernoulli-Euler Plane Beam 32.4.3. The Plane Beam-Column . . . 32.4.4. *The Timoshenko Plane Beam . 32.4.5. *Spar and Shaft Elements . . . 32.5. Mass Matrix Examples: Plane Stress 32.5.1. The Plane Stress Linear Triangle 32.5.2. Four-Node Bilinear Quadrilateral 32.6. Mass Diagonalization Methods 32.6.1. HRZ Lumping . . . . . . 32.6.2. Lobatto Lumping . . . . . 32. Notes and Bibliography . . . . . . . . . . . 32. References. . . . . . . . . . . . 32. Exercises . . . . . . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . .
. . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
323 323 323 324 324 325 326 326 328 328 328 3210 3211 3212 3212 3212 3214 3215 3215 3215 3216 3218 3219
322
32.2
To do dynamic and vibration nite element analysis, you need at least a mass matrix to pair with the stiffness matrix. This Chapter provides a quick introduction to standard methods for computing this matrix. As a general rule, the construction of the master mass matrix M largely parallels that of the master stiffness matrix K. Mass matrices for individual elements are formed in local coordinates, transformed to global, and merged into the master mass matrix following exactly the same techniques used for K. In practical terms, the assemblers for K and M can be made identical. This procedural uniformity is one of the great assets of the Direct Stiffness Method. A notable difference with the stiffness matrix is the possibility of using a diagonal mass matrix based on direct lumping. A master diagonal mass matrix can be stored simply as a vector. If all entries are nonnegative, it is easily inverted, since the inverse of a diagonal matrix is also diagonal. Obviously a lumped mass matrix entails signicant computational advantages for calculations that involve M1 . This is balanced by some negative aspects that are examined in some detail later. 32.2. Mass Matrix Construction The master mass matrix is built up from element contributions, and we start at that level. The construction of the mass matrix of individual elements can be carried out through several methods. These can be categorized into three groups: direct mass lumping, variational mass lumping, and template mass lumping. The last group is more general in that includes all others. Variants of the rst two techniques are by now standard in the FEM literature, and implemented in all general purpose codes. Consequently this Chapter covers the most widely used methods, focusing on techniques that produce diagonally lumped and consistent mass matrices. The next Chapter covers the template approach to produce customized mass matrices. 32.2.1. Direct Mass Lumping The total mass of element e is directly apportioned to nodal freedoms, ignoring any cross coupling. The goal is to build a diagonally lumped mass matrix or DLMM, denoted here by Me L. As the simplest example, consider a 2-node prismatic bar element with length , cross section area A, and mass density , which can only move in the axial direction x , as depicted in Figure 32.1. The total mass of the element is M e = A . This is divided into two equal parts and assigned to each end node to produce
1 Me L = 2 A
Total mass A
massless connector
Figure 32.1. Direct mass lumping for 2-node prismatic bar element.
1 0
0 =1 A I2 , 2 1
(32.1)
in which I2 denotes the 2 2 identity matrix. As shown in the gure, we have replaced the bar with a dumbbell. This process conserves the translational kinetic energy or, equivalently, the linear momentum. To e = v [ 1 1 ]T . The kinetic show this for the bar example, take the constant x -velocity vector u 323
324
e = 1 e )T Me (u A v2 = 1 M e v 2 . Thus the linear momentum energy of the element is T e = 1 Lu 2 2 2 p e = T e /v = M e v is preserved. When applied to simple elements that can rotate, however, the direct lumping process may not necessarily preserve angular momentum. A key motivation for direct lumping is that, as noted in 32.1, a diagonal mass matrix may offer computational and storage advantages in certain simulations, notably explicit time integration. Furthermore, direct lumping covers naturally the case where concentrated (point) masses are natural part of model building. For example, in aircraft engineering it is common to idealize nonstructural masses (fuel, cargo, engines, etc.) as concentrated at given locations.1 32.2.2. Variational Mass Lumping A second class of mass matrix construction methods are based on a variational formulation. This is done by taking the kinetic energy as part of the governing functional. The kinetic energy of an element of mass density that occupies the domain e and moves with velocity eld ve is Te =
1 2
(ve )T ve d
e
(32.2)
Following the FEM philosophy, the element velocity eld is interpolated by shape functions: ve = e , where u e are node DOF velocities and Ne Ne vu v a shape function matrix. Inserting into (32.3) and moving the node velocities out of the integral gives e )T Te = 1 (u 2
T e (Ne v ) Nv d
e = u
def 1 e T ) Me (u 2
e, u
(32.3)
(32.4)
e If the same shape functions used in the derivation of the stiffness matrix are chosen, that is, Ne v =N , e 2 (32.4) is called the consistent mass matrix or CMM. It is denoted here by MC .
For the 2-node prismatic bar element moving along x , the stiffness shape functions of Chapter 12 are Ni = 1 (x xi )/ = 1 and N j = (x xi )/ = . With d x = d , the consistent mass is easily obtained as
e MC =
A (Ne )T Ne d x = A
0 0
[1
A ] d = 1 6
2 1
1 . 2
(32.5)
It can be veried that this mass matrix preserves linear momentum along x .
1 2
Such concentrated masses in general have rotational freedoms. Rotational inertia lumping is then part of the process. A better name would be stiffness-consistent. The shorter sobricket has the unfortunately implication that other choices are inconsistent, which is far from the truth. In fact, the consistent mass is not necessarily the best one, a topic elaborated in the next Chapter. However the name is by now ingrained in the FEM literature.
324
32.2
A generalization of the two foregoing methods consists of expressing the mass as a linear combination of k component mass matrices: Me =
k i =1
i Mie .
(32.6)
Appropriate constraints on the free parameters i are placed to enforce matrix properties discussed in 32.2.4. Variants result according to how the component matrices Mi are chosen, and how the parameters i are determined. The best known scheme of this nature results on taking a weighted average of the consistent and diagonally-lumped mass matrices:
e e Me LC = (1 )MC + M L , def
(32.7)
in which is a free scalar parameter. This is called the LC (lumped-consistent) weighted mass matrix. If = 0 and = 1 this combination reduces to the consistent and lumped mass matrix, respectively. For the 2-node prismatic bar we get
1 Me LC = (1 ) 6 A
2 1
1 + 1 A 2 2
1 0
0 =1 A 6 1
2+ 1 . 1 2+
(32.8)
It is known (since the early 1970s) that the best choice with respect to minimizing low frequency dispersion is = /. This is proven in the next Chapter. The most general method of this class uses nite element templates to fully parametrize the element mass matrix. For the prismatic 2-node bar element one would start with the 3-parameter template Me = A 11 12 12 , 22 (32.9)
which includes the symmetry constraint from the start. Invariance requires 22 = 11 , which cuts the free parameters to two. Conservation of linear momentum requires 11 + 12 + 12 + 22 = 211 + 212 = 1, or 12 = / 11 . Taking = 611 2 reduces (32.9) to (32.8). Consequently for the 2-node bar LC-weighting and templates are the same thing, because only one free parameter is left upon imposing essential constraints. This is not the case for more complicated elements. 32.2.4. Mass Matrix Properties Mass matrices must satisfy certain conditions that can be used for verication and debugging. They are: (1) matrix symmetry, (2) physical symmetries, (3) conservation and (4) positivity. Matrix Symmetry. This means (Me )T = Me , which is easy to check. For a variationally derived mass matrix this follows directly from the denition (32.4), while for a DLMM is automatic. Physical Symmetries. Element symmetries must be reected in the mass matrix. For example, the CMM or DLMM of a prismatic bar element must be symmetric about the antidiagonal: M11 = M22 . To see this, ip the end nodes: the element remains the same and so does the mass matrix. 325
326
Conservation. At a minimum, total element mass must be preserved.3 This is easily veried by applying a uniform translational velocity and checking that linear momentum is conserved. Higher order conditions, such as conservation of angular momentu, are optional and not always desirable. e )T Me u e = 0, (u e 0. That Positivity. For any nonzero velocity eld dened by the node values u is, Me must be nonnegative. Unlike the previous three conditions, this constraint is nonlinear in the mass matrix entries. It can be checked in two ways: through the eigenvalues of Me , or the sequence of principal minors. The second technique is more practical if the entries of Me are symbolic.
Remark 32.1. A more demanding form of the positivity constraint is to require that Me be positive denite:
e > 0 for any u e = 0. This is more physically reassuring because one half of that quadratic form e ) T Me u (u e . In a continuum T can vanish only for is the kinetic energy associated with the velocity eld dened by u e makes life easier in some situations, particularly zero velocities. But allowing T e = 0 for some nonzero u for elements with rotational or Lagrange multiplier freedoms. e for which T e = 0 form the null space of Me . Because of the conservation requirement, a rigid velocity The u e e eld (the time derivative u R of a rigid body mode u R ) cannot be in the mass matrix null space, since it would imply zero mass. This scenario is dual to that of the element stiffness matrix. For the latter, Ke ue R = 0, since must be in the null space of the stiffness matrix. a rigid body motion produces no strain energy. Thus ue R
The computation of Me by the variational formulation (32.4) is often done using Gauss numerical quadrature. Each Gauss points adds n D to the rank, where n D is the row dimension of the shape function matrix Ne , up to a maximum of n e F . For most elements n D is the same as element spatial dimensionality; that is, n D = 1, 2 and 3 for 1, 2 and 3 dimensions, respectively. This property can be used to pick the minimum Gauss integration rule that makes Me positive denite. 32.3. Globalization Like their stiffness counterparts, mass matrices are often developed in a local or element frame. Should globalization be necessary before merge, a congruent transformation is applied: e Te Me = (Te )T M
e
(32.10)
is the element mass referred to the local frame whereas Te is the local-to-global displaceHere M ment transformation matrix. Matrix Te is in principle that used for the stiffness globalization. Some procedural differences, however, must be noted. For stiffness matrices Te is often rectangular if the local stiffness has lower dimensionality. For example, the bar and spar elements formulated of
3
We are taking about classical mechanics here; in relativistic mechanics mass and energy can be exchanged.
326
327
32.3
GLOBALIZATION
Chapter 6 have 2 2 local stiffnesses. Globalization to 2D and 3D involves application of 2 4 and 2 6 transformation matrices, respectively. This works ne because the local element has zero stiffness in some directions. If the associated freedoms are explicitly kept in the local stiffness, as in Chapters 23, those rows and columns are zero and have no effect on the global stiffness. In contrast to stiffnesses, translational masses never vanish. One way to understand this is to think of an element moving in a translational rigid body motion u R with acceleration u R . According to e e R , where M is the translational mass. This cannot be zero. Newtons second law, f R = M u The conclusion is: all translational masses must be retained in the local mass matrix. The 2-node prismatic bar moving in the {x , y } plane furnishes a simple illustration. With the freedoms arranged as ue = [ u x 1 u y 1 u x 1 u y 2 ]T , the local mass matrix constructed by consistent and diagonalized lumping are 2 0 1 0 1 0 0 0 e 0 2 0 1 0 1 0 0 1 1 C e M =1 A (32.11) , M L = 2 A 0 0 1 0 = 2 A I4 , 6 1 0 2 0 0 1 0 2 0 0 0 1
e e C respectively. Globalize via (32.10) using the transformation matrix (3.2). The result is MC =M e and Me L = M L . We say that these mass matrices repeat. Verication for the DLMM is easy because e e A (Te )T I4 Te = / A (Te )T Te = / A I4 . For the CMM, Te is orthogonal: (Te )T M LT = / however, repetition is not obvious. It is best shown by temporarily rearranging the element DOF so that instead of [ u x 1 u y 1 u x 1 u y 2 ] the x and y components are grouped: [ u x 1 u x 2 u y 1 u y 2 ]. e C Rearranging M and Te accordingly yields
1 , c = cos , s = sin . 2 (32.12) . Carrying out the transformation in block form gives in which = x , x (cs cs )M 0 e M (c2 + s 2 )M C . = =M 2 2 (cs cs )M (c + s )M 0 M (32.13) e C A matrix that can be put in a block diagonal form built up of identical submatrices, such as M are in (32.12) is called repeating block diagonal or RBD. Note that the contents and order of M irrelevant to the result (32.13). Hence the following generalization follows. If upon rearranging the e is two-block RBD, and (ii) Te takes the block form shown above, the local and element DOF: (i) M global matrices will coalesce. For (ii) to hold, it is sufcient that all nodal DOF be translational and be referred to the same coordinate system. The same conclusion holds for 3D; this is the subject of Exercise 32.5. This repetition rule can be summarized as follows:
e MC =
0 e M cI2 s I2 e C M = , T = s I2 cI2 , 0 M
= A with M 6
2 1
cI2 s I2 s I2 cI2
0 M 0 M
cI2 s I2 s I2 cI2
A RBD local mass matrix globalizes to the same matrix if all element DOFs are translational and all of them are referred to the same global system.
(32.14)
This property should be taken advantage of to skip superuous local-to-global transformations. Frequently such operation costs more than forming the local mass matrix. 327
328
What if the (32.14) fails on actual computation? Then something (mass matrix or transformation) is wrong and must be xed. As example, suppose that one tries to parrot the bar stiffness derivation process by starting with the 1D bar mass (32.1). A rectangular 2 4 transformation matrix Te is built by taking rows 1 and 3 of (3.2). Then the globalization (32.10) is carried out. The resulting , x ). The Me L is found to violate (32.14) because entries depend on the orientation angle = ( x e reason for this mistake is that M L must account for the inertia in the y direction, as in the second of (32.11), to start with.
Remark 32.2. The repetition rule (32.14) can be expected to fail in the following scenarios:
1. 2.
The element has non-translational freedoms. (Occasionally the rule may work, but that is unlikely.) The mass blocks are different in content and/or size. This occurs if different models are used in different directions. Examples are furnished by beam-column, element with curved sides or faces, and shell elements. Nodes are referred to different coordinate frames in the global system. This can happen if certain nodes are referred to special frames to facilitate the application of boundary conditions.
3.
32.4. Mass Matrix Examples: Bars and Beams The diagonally lumped and consistent mass matrices for the 2-node bar element were explicitly given in (32.1) and (32.5), and an optimal combination is investigated in the next Chapter. In this section the DLMM and CMM of other simple elements are worked out. More complicated ones are relegated to Exercises. The overbar of Me is omitted for brevity unless a distinction between local and global mass matrices is required. 32.4.1. The 3-Node Bar The element is prismatic with length , area A, and uniform mass density . Midnode 3 is at the center. The DOFs are arranged ue = [ u 1 u 2 u 3 ]T . Using the shape function in the isoparametric coordinate presented in Exercise 16.2 we get the CMM
e MC = A 1 1
(Ne )T Ne (/ ) d =
A 30
4 1 2
1 4 2
2 2 . 16
(32.15)
To produce a DLMM, the total mass of the element is divided into 3 parts: A , A , and (1 2) A , which are assigned to nodes 1, 2 and 3, respectively. Total mass A x For reasons discussed later the best choice is = /, as A A A depicted in Figure 32.2. Consequently / of the total mass goes to the midpoint, and what is left to the corners, giving 3 2 1
massless connector 1 0 0 Figure 32.2. Direct mass lumping for = (32.16) 0 1 0 . 3-node bar element. 0 0 4 The /:/:/ allocation happens to be Simpsons rule for integration. This meshes in with the interpretation of diagonal mass lumping as a Lobatto integration rule, a topic discussed in 32.6.
Me L
1 A 6
Both (32.15) and (32.16) can be used as building blocks for expanding the element to 2D or 3D space. The repetition rule (32.14) holds. 328
329
32.4
Beam2BEConsMass[Le_,_,A_,{numer_,p_}]:= Module[{i,k,Ne,NeT,,w,fac,Me=Table[0,{4},{4}]}, Ne={{2*(1-)^2*(2+), (1-)^2*(1+)*Le, 2*(1+)^2*(2-),-(1+)^2*(1-)*Le}}/8; NeT=Transpose[Ne]; fac=*A*Le/2; If [p==0, Me=fac*Integrate[NeT.Ne,{,-1,1}]; Return[Me]]; For [k=1, k<=p, k++, {xi,w}= LineGaussRuleInfo[{p,numer},k]; Me+= w*fac*(NeT/.->xi).(Ne/.->xi); ]; If[!numer,Me=Simplify[Me]]; Return[Me] ]; ClearAll[,A,Le,]; mfac=(*A*Le)/420; MeC=Simplify[Beam2BEConsMass[Le,,A,{False,0}]/mfac]; For [p=1,p<=5,p++, Print["p=",p]; Me=Simplify[Beam2BEConsMass[Le,,A,{False,p}]/mfac]; Print["Me=",mfac,"*",Me//MatrixForm, " vs exact=",mfac,"*",MeC//MatrixForm]; Print["eigs scaled ME=",Chop[Eigenvalues[N[Me/.Le->1]]]]]; uRot={-Le/2,1,Le/2,1}*; TRot=Simplify[(1/2)*uRot.MeC.uRot*mfac]; TRotex=Simplify[(Le/2)*Integrate[(1/2)**A*(*Le*/2)^2,{,-1,1}]]; Print["TRot=",TRot," should match ",TRotex];
Figure 32.3. Module to form the CMM of a prismatic 2-node Bernoulli-Euler plane beam element. Integration is done analytically if p=0, and numerically if p > 0 using a p-point Gauss rule.
32.4.2. The Bernoulli-Euler Plane Beam The stiffness of this element was derived in Chapter 13. The 2-node plane beam element has length , cross section area A and uniform mass density . Only the translational inertia due to v( x )2 d x the lateral motion of the beam is considered in computing the kinetic energy T = 1 2 0 of the element, whereas the rotational inertia is ignored. With the freedoms arranged as ue = [ v1 1 v2 2 ]T , use of the cubic shape functions (13.12) gives the CMM 156 22 54 13 1 A 22 e 4 2 13 3 2 C M = A (/ )(Ne )T Ne d = (32.17) . 54 13 156 22 420 1 4 2 13 3 2 22 in which / is the Jacobian J = d x /d . This result may be veried using the Mathematica module Beam2BEConsMatrix listed in Figure 32.3. The arguments are self-explanatory except for p. The module computes the integral (32.17) analytically if p=0; else using a p -point 1D Gauss rule (extracted from LineGaussRuleInfo, described in Chapter 17) if 1 p 5. Beam2BEConsMatrix is run for p varying from 0 through 5 by the statements following the module. The mass matrices obtained with integration rules of 1, 2 and 3 points are 16 4 16 4 86 13 22 5 444 62 156 38 2 4 2 2 4 13 2 2 5 62 11 2 38 9 2 , c , c c1 2 3 16 4 16 4 22 5 86 13 156 38 444 62 2 4 2 4 5 2 13 2 2 38 9 2 62 11 2 (32.18) in which c1 = A /64, c2 = A /216 and c3 = A /1200. The eigenvalue analysis shows that all three are singular, with rank 1, 2 and 3, respectively. The result for 4 and 5 points agrees with 329
3210
(32.17), which has full rank. The purpose of this example is to illustrate the rank property quoted in 32.2.5: each Gauss point adds one to the rank (up to 4) since the problem is one-dimensional. The matrix (32.17) conserves linear and angular momentum; the latter property being checked by the last 3 statements of Figure 32.3. So do the reduced-integration mass matrices if p>1. To get a diagonally lumped mass matrix is trickier. ObviTotal mass A x ously the translational nodal masses must be the same as that of a bar: / A . See Figure 32.4. But there is no consensus A 3 A 3 on rotational masses. To accommodate these variations, it is A A convenient to leave the latter parametrized as follows 2 1 / 0 0 0 Figure 32.4. Direct mass lumping for 22 e 0 0 0 L = A M , 0. (32.19) node Bernoulli-Euler plane beam element. 0 0 / 0 0 0 0 2 Here is a nonnegative parameter, typically between 0 and 1/50. The choice of has been argued in the FEM literature over several decades, but the whole discussion is largely futile. Matching the angular momentum of the beam element gyrating about its midpoint gives = 1/24. This violates the positivity condition stated in 32.2.4. It follows that the best possible as opposed to possible best is zero. This choice gives, however, a singular mass matrix, which is undesirable in scenarios where a mass-inverse appears.
Remark 32.3. This result can be readily understood physically. As shown in 32.3.2, the / A translational end node masses grossly overestimate (by a factor of 3 in fact) the angular momentum of the element. Hence adding any rotational lumped mass only makes things worse.
32.4.3. The Plane Beam-Column To use the foregoing results for dynamics of a plane frame structure, such as a multistory building, the 2-node bar and plane beam elements must be combined to form a plane beam-column element with six degrees of freedom in the local system. The element is then rotated into its global position. The stiffness computation process was covered in Chapter 20. Figure 32.5, which is largely a reproduction of Figure 20.6, shows this element in its local and global congurations. In this case the global and local mass matrices are not identical because of the presence of rotational DOFs; furthermore the models in the longitudinal x and lateral y directions are different. Consequently the distinction between local and global masses must be carefully kept. e C The local consistent mass matrix M is easily obtained by augmenting (32.5) and (32.17) with zeros rows and columns to ll up missing DOFs, and adding. The local-to-global transformation matrix Te is that given in Chapter 20 and reproduced here for convenience. The two matrices are 0 0 0 c s 0 140 0 0 70 0 0 0 54 13 0 0 0 s c 0 0 156 22 2 2 A 0 22 e 4 0 13 3 0 1 0 0 0 0 e MC = , T = 0 0 140 0 0 0 0 c s 0 0 420 70 0 54 13 0 156 22 0 0 0 s c 0 0 0 0 0 0 1 0 13 3 2 0 22 4 2 (32.20) 3210
3211
y
(a)
u x1
u x2
z2
y
(b)
z1
uy1 1
u y2
y 1 x
constant , A, I
Figure 32.5. The 2-node plane beam-column element: (a) referred to its local system {x , y }; (b) referred to the global system {x , y }.
where c = cos , s = sin , and = (x , x ), positive counterclockwise, see Figure 32.5(b). The globalized CMM is 1488c 8s 22 s 62+8c 8s 13 s 8s 628c 13 c 8s 148+8c 22 c 2 A 22 s 22 c 4 13 s 13 c 3 2 e e T e e MC = (T ) MC T = 8s 13 s 1488c 8s 22 s 420 62+8c 8s 628c 13 c 8s 148+8c 22 c 13 s 13 c 3 2 22 s 22 c 4 2 (32.21) in which c = cos 2 and s = sin 2 . The global and local matrices differ for arbitrary . It e e C and MC have the same eigenvalues, since Te is orthogonal. may be veried, however, that M
32.4.4. *The Timoshenko Plane Beam The Timoshenko plane beam model for static analysis was presented as advanced material in Chapter 13. This model is more important for dynamics and vibration than Bernoulli-Euler, and indispensable for short transient and wave propagation analysis. (As remarked in Notes and Bibliography of Chapter 13, the Bernoulli-Euler beam has innite phase velocity, because the equation of motion is parabolic, and thus useless for simulating wave propagation.) The Timoshenko beam incorporates two renements over the Bernoulli-Euler model: 1. For both statics and dynamics: plane sections remain plane but not necessarily normal to the deected midsurface. See Figure 32.6. This assumption allows the averaged shear distortion to be included in both strain and kinetic energies. In dynamics: the rotary inertia is included in the kinetic energy.
y, v
i i
Deformed cross section
j j v' j
v'i
vj v(x) j
x, u
vi i
2.
Figure 32.6. Kinematic assumptions of the Timoshenko plane beam element. (A reproduction of Figure 13.14 for the reader convenience.)
According to the second assumption, the kinetic energy of the Timoshenko beam element is given by T =
1 2 0
(x )2 d x . A v( x )2 + I R
(32.22)
3211
3212
Here I R is the second moment of inertia to be used in the computation of the rotary inertia and = v + is the cross-section rotation angle shown in Figure 32.6; = V /(G As ) being the section-averaged shear distortion. The element DOF are ordered ue = [ v1 1 v1 2 ]T . The lateral displacement interpolation is
e e e e v( ) = v1 Nv 1 ( ) + v1 Nv 1 ( ) + v2 Nv 2 ( ) + v2 Nv 2 ( ),
2x
1,
(32.23)
in which the cubic interpolation functions (13.12) are used. A complication over Bernoulli-Euler is that the rotational freedoms are 1 and 2 but the interpolation (32.23) is in terms of the neutral surface end slopes: v1 = (d v/d x )1 = 1 and v2 = (d v/d x )2 = 2 . From the analysis of 13.7 we can derive the relation
v1 v2 = 1 1+ 1+ 2 2 2 1+ 2
v1 1 v . 2 2
(32.24)
where as in (13.22) the dimensionless parameter = 12 E I /(G As 2 ) characterizes the ratio of bending and shear rigidities. The end slopes of (32.24) are replaced into (32.23), the interpolation for obtained, and v and inserted into the kinetic energy (32.22). After lengthy algebra the CMM emerges as the sum of two contributions: e e e = MC (32.25) MC T + MC R , where MC T and MC R accounts for the translational and rotary inertia, respectively:
13
e MC T =
A 2 (1 + )
35
7 + 10 +1 3
2 2
9 3 + 10 70 13 3 2 ( 420 + 40 13 7 + 10 35
+1 6
1 + 24
2 2 2
2 2 2 2
) )
2 2
+1 3
symmetric
e MC R =
IR (1 + )2
6 5
1 ( 10 2 ( 15 + 1 6
1 2
)
1 3 2
6 5 )
2 1 ( 10 + 6 5 1 2
)
1 6 2
1 ( 30 +
symmetric
2
1 6 1 ( 10 2 ( 15 +1 6
+
1 2 1 3
)
2
)
2
(32.26)
Caveat: the I in = 12 E I /(G As ) is the second moment of inertia that enters in the elastic exural elastic rigidity dened in (13.5). If the beam is homogeneous I R = I , but that is not necessarily the case if, as sometimes happens, the beam has nonstructural attachments that contribute rotary inertia.
e 2 The factor of MC R can be further transformed to facilitate parametric studies by introducing r R = I R / A as cross-section gyration radius and = r R / as element slenderness ratio. Then the factor I R /((1 + )2 ) e e 2 /(1 + )2 . If = 0 and = 0, MC becomes A R vanishes and MC T in (32.26) reduces to (32.17).
Obtaining a diagonally lumped matrix can be done by the HRZ scheme explained in 32.6.1. The optimal lumped mass is derived in the next Chapter by the template method. 32.4.5. *Spar and Shaft Elements The mass matrices for these 2-node elements are very similar to those of the bar, since they can be derived from linear displacement interpolation for the CMM. The only thing that changes is the matrix factor and the end DOFs. The derivation of these elements is done as Exercises.
3212
3213
32.5
Trig3IsoPMembraneConsMass[ncoor_, _,h_,{numer_,p_}]:= Module[{i,k,x1,y1,x2,y2,x3,y3,A,Nfxy, tcoor,w,Me=Table[0,{6},{6}]}, For [k=1, k<=Abs[p], k++, {{x1,y1},{x2,y2},{x3,y3}}=ncoor; A=Simplify[(x2-x1)*(y3-y1)-(x1-x3)*(y1-y2)]/2; {tcoor,w}= TrigGaussRuleInfo[{p,numer},k]; Nfxy={Flatten[Table[{tcoor[[i]],0 },{i,3}]], Flatten[Table[{ 0,tcoor[[i]]},{i,3}]]}; Me+= *w*A*h*Transpose[Nfxy].Nfxy; ]; If[!numer,Me=Simplify[Me]]; Return[Me] ];
Figure 32.7. CMM module for 3-node linear triangle in plane stress.
32.5. Mass Matrix Examples: Plane Stress To illustrate the two-dimensional case, this section works out the mass matrices of two simple plane stress elements. More complicated cases are relegated to the Exercises. 32.5.1. The Plane Stress Linear Triangle The stiffness formulation of the 3-node triangle was discussed in Chapter 15. For the following derivations the plate is assumed to have constant mass density , area A, uniform thickness h , and motion restricted to the {x , y } plane. The six DOFs are arranged as ue = [ u x 1 u y 1 u x 2 u y 2 u x 3 u y 3 ]T . The consistent mass matrix is obtained using the linear displacement interpolation (15.17). Expanding (Ne )T Ne gives a 6 6 matrix quadratic in the triangular 2 d = A /3, coordinates. This can be integrated with the formulas (15.27) exemplied by e 1 = A /6, etc. The result is e 1 2 d 1 1 0 1 2 0 1 3 0 0 1 1 0 1 2 0 1 3 2 1 0 2 2 0 2 3 0 d 2 1 0 2 2 0 2 3 e 0 3 1 0 3 2 0 3 3 0 0 3 1 0 3 2 0 3 3 2 0 Ah 1 = 12 0 1 0 0 2 0 1 0 1 1 0 2 0 1 0 0 1 0 2 0 1 1 0 1 0 2 0 0 1 0 (32.27) 1 0 2
e MC = h
This computation may be checked with the Mathematica module listed in Figure 32.7. The module is invoked as Trig3IsoPMembraneConsMass[ncoor, ,h,{ numer,p }] and returns matrix Me. The arguments are: ncoord passes the node coordinate list { { x1,y1 },{ x2,y2 },{ x3,y3 } }, the mass density, h the plate thickness, numer is a logical ag set to True or False for numeric or symbolic computations, respectively, and p identies the triangle integration rule as described in 24.2.1. Subordinate module TrigGaussRuleInfo is described in Chapter 24. Since the order of Me is 6, and each Gauss point adds two (the number of space dimensions) to the rank, a rule with 3 or more points is required to reach full rank, as can be veried by simple numerical experiments. The lumped mass matrix is constructed by taking the total mass of the element, which is Ah , dividing it by 3 and assigning those to the corner nodes. See Figure 32.8. This process produces a 3213
3214
diagonal matrix:
(32.28)
Ah
Ah
y x
Ah
massless wireframe
Quad4IsoPMembraneCMass[ncoor_,rho_,h_,{numer_,p_}]:= Module[{i,k,Nf,dNx,dNy,Jdet,Nfxy,qcoor,w,Me=Table[0,{8},{8}]}, For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}= Quad4IsoPShapeFunDer[ncoor,qcoor]; Nfxy={Flatten[Table[{Nf[[i]], 0},{i,4}]], Flatten[Table[{ 0,Nf[[i]]},{i,4}]]}; Me+=(rho*w*Jdet*h/2)*Transpose[Nfxy].Nfxy; ]; If[!numer,Me=Simplify[Me]]; Return[Me] ];
Figure 32.9. CMM module for 4-node bilinear quad in plane stress.
32.5.2. Four-Node Bilinear Quadrilateral Module Quad4IsoPMembraneConsMass, listed in Figure 32.9, returns the CMM of a 4-node bilinear quadrilateral under plane stress, moving in the {x , y } plane. The plate is homogeneous with density and constant thickness h . The arguments are similar to those described for the linear triangle. except that the quadrature rule pertains to quadrilateralks, and is specied as described in Chapter 23. The subordinate modules QuadGaussRuleInfo (shape functions) and Quad4IsoPShapeFunDer (Gauss quadrature information) are described in that Chapter. The integration is carried out numerically using a p p Gauss product rule, with p specied as argument. Testing the module on a rectangular element of dimensions {a , b} returns the following CMMs for the 11 and 22 Gauss rules:
1 0 1 abh 0 = 32 1 0 1 0
e MC 11
0 1 0 1 0 1 0 1
1 0 1 0 1 0 1 0
0 1 0 1 0 1 0 1
1 0 1 0 1 0 1 0
0 1 0 1 0 1 0 1
1 0 1 0 1 0 1 0
0 4 0 2 1 0 4 0 2 0 4 0 abh 1 e , MC 0 2 0 22 = 0 72 1 0 2 0 1 0 1 2 0 1 0 1 0 2 0
0 2 0 4 0 2 0 1
1 0 2 0 4 0 2 0
0 1 0 2 0 4 0 2
2 0 1 0 2 0 4 0
0 2 0 1 . (32.29) 0 2 0 4
3214
3215
The mass given by 1-point integration has rank 2 and 6 zero eigenvalues, and thus rank-decient by 6. The mass given by the 22 rule is rank-sufcient and positive denite. Either matrix repeats e on globalization. Using p > 2 returns MC 22 . The DLMM is obtained by assigning one fourth of the total element mass abh to each freedom.
32.6.
The construction of consistent mass matrix (CMM) is fully dened by the choice of kinetic energy functional and shape functions. No procedural deviation is possible. On the other hand the construction of a diagonally lumped mass matrix (DLMM) is not a unique process, except for very simple elements in which the lumping is fully dened by conservation and symmetry considerations. A consequence of this ambiguity is that various methods have been proposed in the literature, ranging from heuristic through more scientic. This subsection gives a quick overview of the two more important methods. 32.6.1. HRZ Lumping This scheme is acronymed after the authors of [134]. It produces a DLMM given the CMM. Let M e denote the total element mass. The procedure is as follows. 1. 2. 3. 4. For each coordinate direction, select the DOFs that contribute to motion in that direction. From this set, separate translational DOF and rotational DOF subsets. Add up the CMM diagonal entries pertaining to the translational DOF subset only. Call the sum S . Apportion M e to DLMM entries of both subsets on dividing the CMM diagonal entries by S . Repeat for all coordinate directions.
Example 32.1. The see HRZ in action, consider the 3-node prismatic bar with CMM given by (32.15). Only
one direction (x ) is involved and all DOFs are translational. Excluding the factor A /30, which does not affect the results, the diagonal entries are 4, 4 and 16, which add up to S = 24. Apportion the total element mass A to nodes with weights 4/ S = 1/6, 4/ S = 1/6 and 16/ S = 2/3. The result is the DLMM (32.16).
Example 32.2. Next consider the 2-node Bernoulli-Euler plane beam element. Again only one direction ( y ) is involved but now there are translational and rotational freedoms. Excluding the factor A /420, the diagonal entries of the CMM (32.17), are 156, 4 2 , 156 and 4 2 . Add the translational DOF entries: S = 156+156 = 312. Apportion the element mass A to the four DOFs with weights 156/312 = 1/2, 4 2 /312 = 2 /78, 156/312 = 1/2 and 4 2 /312 = 2 /78. The result is the DLMM (32.19) with = 1/78.
The procedure is heuristic but widely used on account of three advantages: easy to explain and implement, applicable to any element as long as a CMM is available, and retaining nonnegativity. The last attribute is particularly important: it means that the DLMM is physically admissible, precluding numerical instability headaches. As a general assessment, it gives reasonable results if the element has only translational freedoms. If there are rotational freedoms the results can be poor compared to templates. 32.6.2. Lobatto Lumping
e A DLMM with n e F diagonal entries m i is formally equivalent to a numerical integration formula with n F points for the element kinetic energy:
Te =
ne F i =1
m i Ti ,
where
Ti = 1 u 2 2 i
(32.30)
3215
3216
Table 32.1. One-Dimensional Lobatto Integration Rules Points 2 3 4 Abscissas i [1, 1] 1 = 1 = 2 1 = 1 = 3 , 2 = 0 1 = 1 = 4 , 2 = 1/ 5 = 3 Weights wi w1 = w2 = 1 w1 = w3 = 1 , w2 = 4 , 3 3 1 w1 = w4 = 6 , w2 = w3 = Comments Trapezoidal rule Simpsons rule Interior points at 0.447214
5 6
The 4-point Lobatto rule should not be confused with Simpsons Three-Eighths rule, a Newton-Coates quadrature that has equidistant abscissas: 1 = 2 = 1, 2 = 3 = 1 , w1 = w2 = 1 , w2 = w3 = 3 . 3 4 4 For 4 < n 10, which is rarely important in FEM work, see Table 25.6 of [1]. If the element is one-dimensional and has only translational DOF, (32.30) can be placed in correspondence with the so-called Lobatto quadrature in numerical analysis.4 . A Lobatto rule is a 1D Gaussian quadrature formula in which the endpoints of the interval [1, 1] are sample points. If the formula has p 2 abscissas, only p 2 of those are free. Abscissas are symmetric about the origin = 0 and all weights are positive. The general form is
1
f ( ) d = w1 f (1) + w p f (1) +
1
p 1 i =2
wi f (i ).
(32.31)
The rules for p = 2, 3, 4 are collected in Table 32.1. Comparing (32.30) with (32.31) clearly indicates that if the nodes of a 1D element are placed at the Lobatto abscissas, the diagonal masses m i are simply the weights wi . This fact was rst noted by Fried and Malkus [106] and further explored in [168,169]. For the type of elements noted, the equivalence works well for p = 2, 3. For p = 4 a minor difculty arises: the interior Lobatto points are not at the thirdpoints, as can be seen in Table 32.1. If instead the element has nodes at the , one must switch to the Simpson three-eights rule also listed in that Table, and adjust thirdpoints = 1 3 the masses accordingly. As a generalization to multiple dimensions, for conciseness we call FEM Lobatto quadrature one in which the connected nodes of an element are sample points of an integration rule. The equivalence with (32.30) still holds. But the method runs into some difculties: Zero or Negative Masses. If one insists in higher order accuracy, the weights of 2D and 3D Lobatto rules are not necessarily positive. See for example the case of the 6-node triangle in the Exercises. This shortcoming can be alleviated, however, by accepting lower accuracy, or by sticking to product rules in geometries that permit them. See Exercise 32.19. Rotational Freedoms. If the element has rotational DOF, Lobatto rules do not exist. Any attempt to transform rules such as (32.31) to node rotations inevitably leads to coupling. Varying Properties. If the element is nonhomogeneous or has varying properties (for instance, a tapered bar element) the construction of Lobatto rules runs into difculties, since the problem effectively becomes the construction of a quadrature formula with non-unity kernel. As a general assessment, the Lobatto integration technique seems advantageous only when the mass diagonalization problem happens to t a rule already available in handbooks such as [231].
Also called Radau quadrature by some authors, e.g. [39]. However the handbook [1, p. 888] says that Lobatto and Radau rules are slightly different.
3216
3217
Notes and Bibliography
The rst appearance of a mass matrix in a journal article occurs in two early-1930s papers5 by Duncan and Collar [62,63]. There it is called inertia matrix and denoted by [m ]. The original example [62, p. 869] displays the 3 3 diagonal mass of a triple pendulum. In the book [105] the notation changes to A. Diagonally lumped mass matrices (DLMM) dominate pre-1963 work. Computational simplicity was not the only reason. Direct lumping gives an obvious way to account for nonstructural masses in simple discrete models of the spring-dashpot-pointmass variety. For example, in a multistory building stick model wherein each oor is treated as one DOF in lateral sway under earthquake or wind action, it is natural to take the entire mass of the oor (including furniture, isolation, etc.) and assign it to that freedom. Nondiagonal masses pop-up ocassionally in aircraft matrix analysis e.g. wing oscillations in [105, 10.11] as a result of measurements. As such they necessarily account for nonstructural masses due to fuel, control equipment, etc. The formulation of the consistent mass matrix (CMM) by Archer [11,12] was a major advance. All CMMs displayed in 32.3 were rst derived in those papers. The underlying idea is old. In fact it follows directly from the 18th -Century Lagrange dynamic equations [154], a proven technique to produce generalized masses. If T is the kinetic energy of a discrete system and u i (xi ) the velocity eld dened by the nodal velocities , the master (system-level) M can be generally dened as the Hessian of T with respect to nodal collected in u velocities: 2T u u d , u = u ( u ), M = . (32.32) T = 1 i i i i 2 u u . Two key decisions remain before this could be used in FEM. This matrix is constant if T is quadratic in u Localization: (32.32) is applied element by element, and the master M assembled by the standard DSM steps. Interpolation: the velocity eld is dened by the same element shape functions as the displacement eld. These had to wait until three things became well established by the early 1960s: (i) the Direct Stiffness Method, (ii) the concept of shape functions, and (iii) the FEM connection to Rayleigh-Ritz. The critical ingredient (iii) was established in Meloshs thesis [178] under Harold Martin. The link to dynamics was closed with Archers contributions, and CMM became a staple of FEM. But only a loose staple. Problems persisted: (a) (b) (c) (d) Nonstructural masses are not naturally handled by CMM. In systems such as ships or aircraft, the structural mass is only a fraction (10 to 20%) of the total. It is inefcient in some solution processes, notably explicit dynamics.6 It may not give the best results compared to other alternatives.7 For elements derived outside the assumed-displacement framework, the stiffness shape functions may be unknown or be altogether missing.
Problem (a) can be addressed by constructing rigid mass elements accounting for inertia (and possibly gravity or centrifugal forces) but no stiffness. Nodes of these elements must be linked to structural (elastic)
5
The brain behind these developments, which launched Matrix Structural Analysis as narrated in Appendix H, was Arthur Collar. But in the hierarchically rigid British system of the time his name, on account of less seniority, had to be last. In explicit time integration, accelerations are computed at the global level as M1 fd , where fd is the efective dynamic force. This is efcient if M is diagonal (and nonsingular). If M is the CMM, a system of equations has to be solved; moreover the stable timestep generally decreases. If K results from a conforming displacement interpolation, pairing it with the CMM is a form of Rayleigh-Ritz, and thus guaranteed to provide upper bounds on natural frequencies. This is not necessarily a good thing. In practice it is observed that errors increase rapidly as one moves up the frequency spectrum. If the response is strongly inuenced by intermediate and high frequencies, as in wave propagation dynamics, the CMM may give extremely bad results.
3217
3218
nodes by MFC constraints that enforce kinematic constraints. This is more of an implementation issue than a research topic, although numerical difculties typical of rigid body dynamics may crop up. Problems (b,c,d) can be attacked by parametrization. The father of NASTRAN, Dick MacNeal, was the rst to observe [161,167] that averaging the DLMM and CMM of the 2-node bar element produced better results than using either alone. This idea was further studied by Belytschko and Mullen [22] using Fourier analysis. Krieg and Key [152] had emphasized that in transient analysis the introduction of a time discretization operator brings new compensation phenomena, and consequently the time integrator and the mass matrix should not be chosen separately. A good discussion of mass diagonalization schemes can be found in the textbook by Cook et al. [50]. The template approach addresses the problems by allowing and encouraging full customization of the mass to the problem at hand. It was rst described in [85,88] for a Bernoulli-Euler plane beam using Fourier methods. It is presented in more generality in the following Chapter, where it is applied to other elements. The general concept of template as parametrized form of FEM matrices is discussed in [84]. References Referenced items have been moved to Appendix R.
3218
3219
Homework Exercises for Chapter 32 Lumped and Consistent Mass Matrices
Exercises
EXERCISE 32.1 [A/C:15]. Derive the consistent mass for a 2-node tapered bar element of length and A (1 ) + 1 A (1+ ). constant mass density , moving along its axis x , if the cross section area varies as A = 1 2 1 2 2 Obtain also the DLMM by the HRZ scheme. Show that
e MC =
12
3 A1 + A2 A1 + A2
A1 + A2 , A1 + 3 A2
Me L =
3 A1 + A2 0 8( A1 + A2 )
0 . A1 + 3 A2
(E32.1)
EXERCISE 32.2 [A:15]. Dr. I. M. Clueless proposed a new diagonally lumped mass scheme for the 2-node bar: placing one half of the element mass A at each Gauss point = 1/ 3 of a two-point rule. His argument is that this conguration conserves total mass and angular momentum, which is true. Explain in two sentences why the idea is worthless. EXERCISE 32.3 [A:25]. Extend the result (32.13) to three dimensions. The element has n e nodes and three
translational DOF per node. Arrange the element DOFs by component: Me is RBD, formed by three n e n e , which are left arbitrary. For Te , assume nine blocks ti j I for {i , j } = 1, 2, 3, where ti j are the submatrices M direction cosines of the local system {x , y , z with respect to the global system {x , y , z }, and I is the n e n e identity matrix. Hint: use the orthogonality properties of the ti j : ti j tik = jk .
EXERCISE 32.4 [A:20]. Show that the local and global mass matrices of elements with only translational
DOFs repeat under these constraints: all local DOFs are referred to the same local frame, and all global DOF are referred to the same global frame. Hints: the kinetic energy must be the same in both frames, and the local-to-global transformation matrix is orthogonal.
EXERCISE 32.5 [A/C:25]. Derive the CMM and DLMM for the 2-node spar and shaft elements derived in Chapter 6. Assume thet the elements are prismatic with constant properties along their length . EXERCISE 32.6 [A/C:20]. Derive the consistent mass for a 2-node Bernoulli-Euler tapered plane beam element of length if the cross section area varies as A = Ai (1 )/2 + A j (1 + )/2 while the mass density is constant. Show that
240 Ai + 72 A j 2(15 Ai + 7 A j ) 54( Ai + A j ) 2(7 Ai + 6 A j ) 2(15 Ai + 7 A j ) (5 Ai + 3 A j ) 2 2(6 Ai + 7 A j ) 3( Ai + A j ) 2 e . MC = 54( A + A ) 2(6 A + 7 A ) 72 Ai + 240 A j 2(7 Ai + 15 A j ) 840 i j i j (3 Ai + 5 A j ) 2 2(7 Ai + 6 A j ) 3( Ai + A j ) 2 2(7 Ai + 15 A j )
(E32.2)
EXERCISE 32.7 [A:15]. Derive the local CMM and DLMM for the 2-node spar element derived in Chapter 6. Assume that the element is prismatic with constant properties along their length , and that can move in 3D space. EXERCISE 32.8 [A:15]. Derive the local CMM and DLMM for the 2-node spar shaft derived in Chapter 6.
Assume that the element is prismatic with constant properties along their length , and that can move in 3D space.
EXERCISE 32.9 [C:25]. Write a Mathematica script to verify the result (32.25)(32.26). (Dont try this by
hand.)
EXERCISE 32.10 [A/C:20]. Derive the consistent mass for a plane stress 3-node linear triangle with constant mass density and linearly varying thickness h dened by the corner values h 1 , h 2 and h 3 .
3219
3220
EXERCISE 32.11 [A/C:20]. Derive the consistent mass for a plane stress 6-node quadratic triangle with
constant mass density and uniform thickness h , moving in the {x , y } plane. The triangle has straight sides and side nodes placed at the midpoints; consequently the metric (and thus the Jacobian) is constant. Show that with the element DOFs arranged ue = [ u x 1 u y 1 u x 2 . . . u y 6 ]T , the CMM is [68, p. 35] 6 0 1 0 1 0 0 0 4 0 0 0 6 0 1 0 1 0 0 0 4 0 0 0 1 0 6 0 1 0 0 0 0 0 4 0 0 1 0 6 0 1 0 0 0 0 0 4 1 0 1 0 6 0 4 0 0 0 0 0 h A 0 1 0 1 0 6 0 4 0 0 0 0 e (E32.3) MC = 0 0 0 4 0 32 0 16 0 16 0 180 0 0 0 0 0 0 4 0 32 0 16 0 16 4 0 0 0 0 0 16 0 32 0 16 0 0 4 0 0 0 0 0 16 0 32 0 16 0 0 4 0 0 0 16 0 16 0 32 0 0 0 0 4 0 0 0 16 0 16 0 32 and check that all eigenvalues are positive. Hint: use the shape functions of Chapter 24 and the 6 or 7-point triangle integration rule.
EXERCISE 32.12 [A:20=5+15]. Assuming the result (E32.3), use the HRZ and Lobatto integration methods to get two DLMMs for the six-node plane stress triangle. Show that HRZ gives h A diag[ 3 3 3 3 3 3 16 16 16 16 16 16 ], (E32.4) Me L = 57 whereas Lobatto integration, using the triangle midpoint rule (24.6), gives h A diag[ 0 0 0 0 0 0 1 1 1 1 1 1 ]. (E32.5) Me L = 3 EXERCISE 32.13 [A/C:30]. Derive the consistent and the HRZ-diagonalized lumped mass matrices for a plane stress 10-node cubic triangle with constant mass density and uniform thickness h , moving in the {x , y } plane. The triangle has straight sides, side nodes placed at the thirdpoints and node 0 at the centroid. Consequently the metric (and thus the Jacobian) is constant. Show that with the element DOFs arranged ue = [ u x 1 u y 1 u x 2 . . . u y 0 ]T , the CMM is [68, p. 35]
76
0 11 0 11 0 18 0 0 h A 0 e MC = 6720 27 0 27 0 0 0 18 0 36 0
0 76 0 11 0 11 0 18 0 0 0 27 0 27 0 0 0 18 0 36
11 0 76 0 11 0 0 0 18 0 18 0 0 0 27 0 27 0 36 0
0 11 0 76 0 11 0 0 0 18 0 18 0 0 0 27 0 27 0 36
11 0 11 0 76 0 27 0 27 0 0 0 18 0 18 0 0 0 36 0
0 11 0 11 0 76 0 27 0 27 0 0 0 18 0 18 0 0 0 36
0 0 18 0 36 0 0 0 0 18 0 36 27 0 27 0 36 0 0 27 0 27 0 36 18 0 0 0 36 0 0 18 0 0 0 36 135 0 270 0 162 0 0 135 0 270 0 162 54 0 135 0 162 0 0 54 0 135 0 162 135 0 54 0 162 0 0 135 0 54 0 162 270 0 135 0 162 0 0 270 0 135 0 162 540 0 189 0 162 0 0 540 0 189 0 162 189 0 540 0 162 0 0 189 0 540 0 162 162 0 162 0 1944 0 0 162 0 162 0 1944 (E32.6)
3220
3221
Exercises
Quad8IsoPMembraneConsMass[ncoor_,_,h_,{numer_,p_}]:= Module[{i,k,Nf,dNx,dNy,Jdet,Nfxy,qcoor,w,Me=Table[0,{16},{16}]}, For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}= Quad8IsoPShapeFunDer[ncoor,qcoor]; Nfxy={Flatten[Table[{Nf[[i]], 0},{i,8}]], Flatten[Table[{ 0,Nf[[i]]},{i,8}]]}; Me+=(*w*Jdet*h/2)*Transpose[Nfxy].Nfxy; ]; If[!numer,Me=Simplify[Me]]; Return[Me] ];
Figure E32.1. CMM module for 8-node serendipity quadrilateral in plane stress.
Check that all eigenvalues are positive. Show that the HRZ-diagonalized LMM is Me L = h A diag[ 19 19 19 19 19 19 135 135 135 135 135 135 135 135 135 135 135 135 486 486 ]. 1353 (E32.7)
EXERCISE 32.14 [A/C:20]. Derive the consistent mass for a plane stress 4-node bilinear rectangle with
(assumed homogeneous and of constant thicknbess) repeats once the p p Gauss integration rule veries p 2. Explain why.
EXERCISE 32.17 [C:15]. Using the script of Figure E32.1 derive the consistent and HRZ-diagonalized lumped mass matrices for a 8-node serendipity quadrilateral specialized to a rectangle of dimensions {a , b} that moves in the {x , y } plane. Assume constant mass density and uniform thickness h . Show that
6 0 2 0 3 0 2 0 6 0 0 6 0 2 0 3 0 2 0 6 2 0 6 0 2 0 3 0 6 0 0 2 0 6 0 2 0 3 0 6 3 0 2 0 6 0 2 0 8 0 0 3 0 2 0 6 0 2 0 8 2 0 3 0 2 0 6 0 8 0 abh e 0 2 0 3 0 2 0 6 0 8 MC = 360 6 0 6 0 8 0 8 0 32 0 0 6 0 6 0 8 0 8 0 32 8 0 6 0 6 0 8 0 20 0 0 8 0 6 0 6 0 8 0 20 8 0 8 0 6 0 6 0 16 0 0 8 0 8 0 6 0 6 0 16
8 0 6 0 6 0 8 0 20 0 32 0 20 0 6 0 8 0 8 0 6 0 20 0 16 0 6 0 8 0 8 0 6 0 20 0
0 8 0 6 0 6 0 8 0 20 0 32 0 20 0 16
8 0 8 0 6 0 6 0 16 0 20 0 32 0 20 0
0 8 0 8 0 6 0 6 0 16 0 20 0 32 0 20
6 0 8 0 8 0 6 0 20 0 16 0 20 0 32 0
0 6 0 8 0 8 0 6 0 20 0 16 0 20 0 32
(E32.8)
Which is the minimum integration rule required to get this matrix? Show that HRZ gives Me L = abh diag [ 3 76 3 3 3 3 3 3 3 16 16 16 16 16 16 16 16 ]. (E32.9)
3221
3222
Quad9IsoPMembraneConsMass[ncoor_,_,h_,{numer_,p_}]:= Module[{i,k,Nf,dNx,dNy,Jdet,Nfxy,qcoor,w,Me=Table[0,{18},{18}]}, For [k=1, k<=p*p, k++, {qcoor,w}= QuadGaussRuleInfo[{p,numer},k]; {Nf,dNx,dNy,Jdet}= Quad9IsoPShapeFunDer[ncoor,qcoor]; Nfxy={Flatten[Table[{Nf[[i]], 0},{i,9}]], Flatten[Table[{ 0,Nf[[i]]},{i,9}]]}; Me+=(*w*Jdet*h/2)*Transpose[Nfxy].Nfxy; ]; If[!numer,Me=Simplify[Me]]; Return[Me] ];
Figure E32.2. CMM module for 9-node biquadratic quadrilateral in plane stress.
EXERCISE 32.18 [C:15]. Using the script of Figure E32.2 derive the consistent and HRZ-diagonalized lumped mass matrices for a 9-node biquadratic quadrilateral specialized to a rectangle of dimensions {a , b} that moves in the {x , y } plane. Assume constant mass density and uniform thickness h . Show that
0 8 0 2 0 2 0 8 0 4 0 4 0 8 0 2 0 2 0 8 0 4 0 8 0 8 0 2 0 2 0 4 0 1 0 8 0 8 0 2 0 2 0 4 0 2 0 8 0 8 0 2 0 4 0 4 0 2 0 8 0 8 0 2 0 4 0 2 0 2 0 8 0 8 0 4 0 16 0 2 0 2 0 8 0 8 0 4 0 64 0 4 0 16 0 4 0 32 0 2 0 64 0 4 0 16 0 4 0 32 0 4 0 64 0 4 0 16 0 32 0 2 0 4 0 64 0 4 0 16 0 32 0 16 0 4 0 64 0 4 0 32 0 8 0 16 0 4 0 64 0 4 0 32 0 4 0 16 0 4 0 64 0 32 0 8 0 4 0 16 0 4 0 64 0 32 0 32 0 32 0 32 0 32 0 256 0 4 0 32 0 32 0 32 0 32 0 256 (E32.10) Which is the minimum integration rule required to get this matrix? Show that HRZ gives 16 0 4 0 1 0 4 0 abh e 8 MC = 1800 0 2 0 2 0 8 0 4 0 0 16 0 4 0 1 0 4 0 8 0 2 0 2 0 8 0 4 0 4 0 16 0 4 0 1 0 8 0 8 0 2 0 2 0 4 1 0 4 0 16 0 4 0 2 0 8 0 8 0 2 0 4 0 0 1 0 4 0 16 0 4 0 2 0 8 0 8 0 2 0 4 Me L = abh diag [ 1 1 1 1 1 36 1 1 1 4 4 4 4 4 4 4 4 16 16 ]. (E32.11)
4 0 16 0 4 0 1 0 8 0 8 0 2 0 2 0 4 0
4 0 1 0 4 0 16 0 2 0 2 0 8 0 8 0 4 0
EXERCISE 32.19 A:25] Two Lobatto formulas that may be used for the 9-node biquadratic quadrilateral
may be found listed in [231, p. 244245]. Translated to a rectangle geometry of area A and FEM quadrilateralcoordinate notation, they are 1 A f (, ) d
e
= +
16 36 1 36 20 48 1 48
f (0, 0) +
4 36
(E32.12)
1 A
f (, ) d
e
= +
(E32.13)
3222
3223
Exercises
(E32.12) is a product Simpson formula, whereas (E32.13) was derived by Albrecht and Collatz in 1953. Explain (i) how these formulas can be used to set up a DLMM for a quadrilateral of arbitrary geometry, and (ii) whether (E32.12) coalesces with the HRZ result in the case of a rectangle.
3223
33
331
332
TABLE OF CONTENTS
Page
Introduction Customization Scenarios Parametrization Techniques Two-Node Bar Element 33.4.1. Best by Angular Momentum Preservation 33.4.2. Best by Fourier Analysis . . . . . 33.4.3. *Best By Modied Equation . . . 33.5. Three-Node Bar Element 33.5.1. Patch Equations . . . . . . . . . 33.5.2. Fourier Analysis . . . . . . . . 33.5.3. Customization . . . . . . . . . 33.6. The Bernoulli-Euler Beam 33.7. *Two-Node Timoshenko Beam Element 33.7.1. *Continuum Analysis . . . . . . 33.7.2. *Beam Element . . . . . . . . . 33.7.3. *Setting Up the Mass Template . . . 33.7.4. *Full Mass Parametrization . . . . . 33.7.5. *Block-Diagonal Mass Parametrization . 33.7.6. *Fourier Analysis . . . . . . . . 33.7.7. *Template Instances . . . . . . . 33.7.8. *Vibration Analysis Example . . . . 33. Notes and Bibliography . . . . . . . . . . . . . . 33. References. . . . . . . . . . . . . . . 33. Exercises . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . .
. . . . .
. . . . . . . . . . . . . . . . .
. . . . .
. . . . . . . . . . . . . . . . .
. . . . .
. . . . . . . . . . . . . . . . .
333 333 334 335 336 336 339 3310 3311 3312 3314 3316 3318 3318 3321 3321 3321 3323 3323 3324 3326 3329 3329 3330
332
33.2
CUSTOMIZATION SCENARIOS
Two standard procedures for building nite element mass matrices have been covered in the previous Chapter. Those lead to consistent and diagonally-lumped forms. These models are denoted by MC and M L , respectively, in the sequel. Abbreviations CMM and DLMM, respectively, will be also used. Collectively these take care of many engineering applications in structural dynamics. Occasionally, however, they fall short. The gap can be lled with a more general approach that relies on templates. These are algebraic forms that carry free parameters. This approach is covered in this paper using one-dimensional structural elements as expository examples. The template approach has the virtue of generating a set of mass matrices that satisfy certain a priori constraints such as symmetry, nonnegativity, invariance and momentum conservation. In particular, the diagonally-lumped and consistent mass matrices can be obtained as instances. Thus those standard models are not excluded. Availability of free parameters, however, allows the mass matrix to be customized to special needs such as high precision in vibration analysis, or minimally dispersive wave propagation. This versatility will be evident from the examples. The set of parameters is called the template signature, and uniquely characterizes an element instance. An attractive feature of templates for FEM programming is that each custom mass matrix need not be coded and tested individually. It is sufcient to implement the template as a single elementlevel module, with free parameters as arguments, and simply adjust the signature to the problem at hand. In particular the same module should be able to produce the conventional DLMM and CMM models, which can provide valuable crosschecks. 33.2. Customization Scenarios The ability to customize the mass matrix is not free of cost. The derivation is more complicated, even for 1D elements, than those based on standard procedures. In fact, hand computations rapidly become unfeasible. Help from a computer algebra system (CAS) is needed to complete the task. When is this additional work justied? Two scenarios can be mentioned. The rst is high delity systems. Dynamic analysis covers a wide range of applications. There is a subclass that calls for a level of simulation precision beyond that customary in engineering analysis. Examples are deployment of precision structures, resonance analysis of machinery or equipment, adaptive active control, ultrasonics imaging, signature detection, radiation loss in layered circuits, and molecular- and crystal-level simulations in micro- and nano-mechanics. In structural static analysis an error of 20% or 30% in peak stresses is not cause for alarm such discrepancies are usually covered adequately by safety factors. But a similar error in frequency analysis or impedance response of a high delity system may be disastrous. Achieving acceptable precision with a ne mesh, however, can be expensive. Model adaptivity comes to the rescue in statics; but this is less effective in dynamics on account of the time dimension. Customized elements may provide a practical solution: achieving adequate accuracy with a coarse regular mesh. A second possibility is that the stiffness matrix comes from a method that avoids displacement shape functions. For example assumed-stress or assumed strain elements. [Or, it could simply be an array of numbers provided by a black-box program, with no documentation explaining its source.] If this happens the concept of consistent mass matrix, in which velocity shape functions are taken to coincide with displacement ones, loses its comfortable variational meaning. One way 333
334
out is to take the mass of an element with similar geometry and freedom conguration derived with shape functions, and to pair it with the given stiffness. But in certain cases, notably when the FEM model has rotational freedoms, this may not be easy or desirable. 33.3. Parametrization Techniques There are several ways to parametrize mass matrices. Three techniques found effective in practice are summarized below. All of them are illustrated in the worked out examples of Sections 46. Matrix-Weighted Parametrization. A matrix-weighted mass template for element e is a linear combination of (k + 1) component mass matrices, k 1 of which are weighted by parameters:
e e Me = Me 0 + 1 M1 + . . . k Mk def
(33.1)
Here Me 0 is the baseline mass matrix. This should be an acceptable mass matrix on its own if 1 = . . . k = 0. The simplest instance of (33.1) is a linear combination of the consistent and diagonally-lumped masss def e + Me (33.2) Me = (1 )MC L
e e + (Me This can be reformatted as (33.1) by writing Me = MC L MC ). Here k = 1, the baseline e e e e e . Expression (33.2) is is M0 MC , 1 and M1 is the consistent mass deviator M L MC often abbreviated to LC-weighted mass matrix or simply LCM.
A matrix-weighted mass template represents a tradeoff. It cuts down on the number of free parameters. Such a reduction is essential for 2D and 3D elements. It makes it easier to satisfy conservation and nonnegativity conditions through appropriate choice of the Mie . On the minus side it generally spans only a subspace of acceptable matrices. Spectral Parametrization. This has the form Me = HT D H,
def
D = diag [ c0 0 c1 1 . . . ck k ] .
(33.3)
in which H is a generally full matrix. Parameters 0 . . . k appear as entries of the diagonal matrix D . Scaling coefcients ci may be introduced for convenience. Often 0 = 1 or 0 = 0 are preset from conservation conditions. Conguration (33.3) occurs naturally when the mass matrix is constructed rst in generalized coordinates, followed by transformation to physical coordinates via H. If the generalized mass is derived using mass-orthogonal functions (for example, Legendre polynomials in 1D elements), the unparametrized generalized mass D = diag [ c0 c1 . . . ck ] is diagonal. Parametrization is effected by scaling entries of this matrix. Some entries may be left xed, however, to satisfy a priori constraints. Expanding (33.3) and collecting matrices that multiply i leads to a matrix weighted combination form (33.1) in which each Mie is a rank-one matrix. The analogy with the spectral representation theorem of symmetric matrices is obvious. But in practice it is usually better to work directly with the congruent representation (33.3). Entry-Weighted Parametrization. An entry-weighted mass template applies parameters directly to every entry of the mass matrix, except for a priori constraints on symmetry, invariance and 334
335
33.4
conservation. This form is the most general one and can be expected to lead to best possible solutions. But it is restricted to simple (usually 1D) elements because the number of parameters grows quadratically in the matrix size, whereas for the other two schemes it grows linearly. Combined Approach. A hierarchical combination of parametrization schemes can be used to advantage if the kinetic energy can be naturally decomposed from physics. For example the Timoshenko beam element covered in Section 6 uses a two-matrix-weighted template form similar to (33.2) as top level. The two components are constructed by spectral and entry-weighted parametrization, respectively. 33.4. Two-Node Bar Element The template concept is best grasped through an example that involves the simplest structural nite element: the two-node prismatic bar of density , area A and length , moving along x . See Figure 33.1. The most general form of the 2 2 mass matrix form is the entry-weighted template Me =
e M11 e M21 e M12 e M22
Total mass A
(e) =L
e
2 x
= Me
11 21
12 22
= A
11 21
12 . 22
(33.4)
The rst form is merely a list of entries. To parametrize it, the total element mass M e = A is taken out as factor. The free parameters 11 through 22 are simply numbers. This illustrates a basic convenience rule: free template parameters should be dimensionless. To cut down on the number of free parameters one looks at mass property constraints. The most common ones are Matrix symmetry: Me = (Me )T . For (33.4) this requires 21 = 12 . Physical symmetry: For a prismatic bar Me must exhibit antidiagonal symmetry: 22 = 11 . Conservation of total translational mass: same as conservation of linear momentum or of kinetic energy. Apply the uniform velocity eld u = v to the bar. The associated nodal velocity vector is e = ve = v [ 1 1 ]T . The kinetic energy is T e = 1 (ve )T Me ve = 1 M e v 2 (11 + 12 + 21 + 22 ). u 2 2 M e v 2 , whence 11 + 12 + 21 + 22 = 1. This must equal 1 2 Nonnegativity: Me should not be indenite. [This is not an absolute must, and it is actually relaxed in the Timoshenko beam element discussed in 33.6.] Whether checked by computing eigenvalues or principal minors, this constraint is nonlinear and of inequality type. Consequently it is not often applied ab initio, unless the element is quite simple, as in this case. On applying the symmetry and conservation rules three parameters of (33.4) are eliminated. The (2 + ) and 12 = 21 = remaining one, called , is taken for convenience to be 11 = 22 = 1 6 1 (1 ), which gives 6
1 Me = 6 A
2+ 1
1 = (1 ) 1 A 6 2+
2 1 + 1 A 2 1 2
1 0 0 1
(33.5)
e + Me = (1 )MC L.
335
336
Expression (33.5) shows that the one-parameter template can be presented as a linear combination of the well known consistent and diagonally-lumped mass matrices. So starting with the general entry-weighted form (33.4) we end up with a two-matrix-weighted form betting (33.2). If = 0 e and Me and = 1, (33.5) reduces to MC L respectively. This illustrates another desirable property: the CMM and DLMM models ought to be instances of the template. Finally we can apply the nonnegativity constraint. For the two principal minors of Me to be 2 2 nonnegative, 2 + 0 and (2 + ) (1 ) = 3 + 6 0. Both are satised if /. Unlike the others, this constraint is of inequality type, and only limits the range of . The remaining task is to nd . This is done by introducing an optimality criterion that ts the problem at hand. This is where customization comes in. Even for this simple case the answer is not unique. Thus the sentence the best mass matrix for the two-node bar is so-and-so has no unique meaning. Two specic optimization criteria are studied below. 33.4.1. Best by Angular Momentum Preservation Allow the bar to move in the {x , y } plane by expanding its nodal DOF to ue = [ u x 1 u y 1 u x 2 u y 2 ]T so (33.5) becomes a 4 4 matrix 2+ 0 1 0 2+ 0 1 1 0 Me (33.6) = 6 A 1 0 2+ 0 0 1 0 2+ about the midpoint. The associated node velocity vector at Apply a uniform angular velocity T 1 e = 2 [ 0 1 0 1 ] . The discrete and continuum energies are = 0 is u
e T
1 e T e ) Me (u u 2
1 A 3 (1 24
+ 2),
T =
e
/2 /2
x A
dx =
1 A 3. 24
(33.7)
e Matching T = T e gives = 0. So according to this criterion the optimal mass matrix is the e consistent one (CMM). Note that if = 1, T = 3T e , whence the DLMM overestimates the rotational (rotary) inertia by a factor or 3.
33.4.2. Best by Fourier Analysis Another useful optimization criterion is the delity with which planes waves are propagated over a bar element lattice, when compared to the case of a continuum bar pictured in Figure 33.2. Symbols used for propagation of harmonic waves are collected in Table 33.1 for the readers convenience. (Several of these are reused in Sections 5 and 6.) The discrete counterpart of Figure 33.2 is shown in Figure 33.3.
,E,A = const
0
Figure 33.2. Propagation of a harmonic wave over an innite, continuum prismatic bar. The wave-prole axial displacement u (x , t ) is plotted normal to the bar.
This is a lattice of repeating two-node bar elements of length . Lattice wave propagation nomenclature is similar to that dened for the continuum case in Table 33.1, but without zero subscripts. 336
337
Table 33.1 Quantity , E , A u 0 = Eu 0 u 0 (x , t ) B0 0 k0 0 f0 T0 c0 0
0
33.4
Meaning (physical dimension in brackets) Mass density, elastic modulus, and cross section area of bar 2 2 2 Bar wave equation. Alternate forms: 0 u = c0 u and u + k0 u = 0. Waveform u 0 = B0 exp i (k0 x 0 t ) [length], in which i = 1 Wave amplitude [length] Wavelength [length] Wavenumber k0 = 2/0 [1/length] Circular (a.k.a. angular) frequency 0 = k0 c0 = 2 f 0 = 2 c0 /0 [radians/time] Cyclic frequency f 0 = 0 /(2) [cycles/time: Hz if time in seconds] Period T0 = 1/ f 0 = 2/0 = 0 /c0 [time] Phase velocity c0 = 0 / k0 = 0 / T0 = 0 f 0 = E / [length/time] Dimensionless wavenumber 0 = k0 0 (0 = 2 in continuum) Dimensionless circular frequency 0 = 0 T0 = 0 0 /c0
Zero subscripted quantities, such as k0 or c0 , refer to the continuum bar. Unsubscripted counterparts, such as k or c, pertain to a discrete FEM lattice as in Figure 33.3.
+ Ku = 0, The lattice propagation process is governed by the semidiscrete equation of motion Mu which can be solved by Fourier methods. To study solutions it is sufcient to extract a two-element patch as illustrated in Figure 33.3(a). Within some constraints noted later the lattice can propagate travelling harmonic waves of wavelength and phase velocity c, as depicted in Figure 33.3(b). The wavenumber is k = 2/ and the circular frequency = 2/ T = 2 c/ = kc. Figure 33.3(b) displays two characteristic lengths: and . The element-to-wavelength ratio is called = /. This ratio characterizes the neness of the discretization with respect to wavelength. A harmonic wave of amplitude B is described by the function u (x , t ) = B exp [i (kx t )] = B exp i x c0 t ], i = 1. (33.8) Here the dimensionless wavenumber and circular frequency are dened as = k = 2 / = 2 and = /c0 , respectively, in which c0 = E / is the continuum bar wavespeed. Using the well-known bar stiffness matrix and the mass template (33.5) gives the patch equations A 6 2+ 1 0 1 4 + 2 1 0 1 2+ u j 1 u j u j +1 + EA 1 1 0 1 2 1 0 1 1 u j 1 uj u j +1 = 0. (33.9)
From this one takes the middle (node j ) equation, which repeats in the innite lattice: A [1 6 4 + 2 1 ] u j 1 u j u j +1 + EA [ 1 2 1 ] u j 1 uj u j +1 = 0. (33.10)
Evaluate (33.8) at x = x j 1 = x j , x = x j and x = x j +1 = x j + while keeping t continuous. Substitution into (33.10) gives the wave propagation condition
2 Ac0 6 (2 + ) 3 2
6 (1 )
cos 337
cos
c0 t
i sin
c0 t
B = 0.
(33.11)
338
Phase velocity c
(a)
j1
j+1
(b) x uj
j
Two-element patch
xj
j1 j
j+1
xj
,E,A = const
xj +
Figure 33.3. An innite lattice of two-node prismatic bar elements: (a) 2-element patch extracted from lattice; (b) characteristic dimensions for a propagating harmonic wave.
If this is to be zero for any t and B , the expression in brackets must vanish. Solving gives the frequency-wavenumber relations 6(1 cos ) 1 2 4 1 10 + 102 6 = 2 + + + ..., 2 + + (1 ) cos 12 360 1 2 3 9 20 + 202 5 6 (2 + ) 2 + + ... = = arccos 6 + (1 ) 2 24 1920
2
(33.12)
c0 / :
2
(33.13) An equation that links frequency and wavenumber: = (k ) as in (33.13), is a dispersion relation. An oscillatory dynamical system is nondispersive if is linear in k , in which case c = / k is constant and the wavespeed is the same for all frequencies. The dispersion relation for the continuum bar (within the limits of MoM assumptions) is c0 = 0 / k0 : all waves propagate with the same speed c0 . On the other hand the FEM model is dispersive for any , since from (33.12) we get 1 c = = c0 k c0 1 2 2 1 20 + 202 4 6(1 cos ) =1+ + + . . . (33.14) 2 + + (1 ) cos 24 1920
1 cos(k ) 12 2 2 2 k 1+ = c0 k 2 + + (1 ) cos(k ) 12
110+102 4 k 360
+ ...
The best t to the continuum for small wavenumbers = k <<1 is obtained by taking = /. This makes the second term of the foregoing series vanish. So from this standpoint the best mass matrix for the bar is A 5 1 e e 1 1 . (33.15) Me =/ = 2 MC + 2 M L = 12 1 5 Figure 33.4(a) plots the dimensionless dispersion relation (33.12) for the consistent ( = 0), diagonally lumped ( = 1) and LC-averaged ( = /) mass matrices, along with the continuumbar relation 0 = 0 . The lattice curves of Figure 33.4(a) have a 2 period: () = ( + 2 n ), n being an integer. Thus it is enough to plot () over [0, 2 ]. The maximum lattice frequency, which occurs for = k = or = 2 , is called the Nyquist or folding frequency. If it is possible to pick as function of or we can match the continuum over a certain range of 338
339
(a)
Dimensionless frequency = /c0
6 Exact (Continuum Bar) 5 4 Consistent mass: = 0 3 2 1 Diagonally lumped mass: = 1 0 5 1 4 2 3 Dimensionless wavenumber =k 6
(b) 1
M
0.8 0.6 0.4 0.2 0 0.2 0.4 0 5 1 4 2 3 Dimensionless wavenumber =k 6 = 1/2
LC averaged: = 1/2
Figure 33.4. Results from Fourier analysis of two-node bar lattice: (a) dispersion curves for various choices of ; (b) wavenumber dependent M that makes lattice match the continuum.
or
6 3 1 2 4 6 1 4 2 2 16 4 4 = . . . = ... 2 1 cos 2 40 1008 28800 2 40 1008 2 4 6 6 3 1 =1+ 2 = ... 1 cos 2 40 1008 28800 (33.16) in which = 2 . The function M () is plotted in Figure 33.4(b). Interesting values are M = 0 if = 3.38742306673364 and M = / if = lim = 4.05751567622863. If > lim the tted Me becomes indenite. So (33.16) is practically limited to the range 0 k 4/ shown in the plot. M = 1 +
33.4.3. *Best By Modied Equation The gist of Fourier analysis is to nd an exact solution, which separates space and time in the characteristic equation (33.11). The rest is routine mathematics. The method of modied differential equations or MoDE, introduced in 13.8, makes less initial assumptions but is not by any means routine. The objective is to nd a MoDE that, if solved exactly, produces the FEM solution at nodes, and to compare it with the continuum = 2 u, where is a lattice frequency wave equation given in Table 33.1. The method assumes only1 that u left to be determined. This takes care of the time variation. Applying this assumption to the patch equation (33.10) and passing to dimensionless variables we get (1 ) [ 1 1 6
2
2 1 (4 + 2) 6
1 1 (1 ) 6
u j 1 uj u j +1
= 0.
(33.17)
This assumption is necessary because no discretization in the time domain has been specied. If a time integrator had been applied, we would face a partial differential equation in space and time. That is a tougher nut to crack in an introductory course.
339
3310
in which = /c0 is the dimensionless circular frequency used in the previous subsection. This difference equation is continuied by replacing u j u (t ) and u j 1 u (t ), and scaled through to produce the following difference-differential form or DDMoDE: [1 2 1 ] 2 u (t ) u (t ) u (t + ) = u (t )
1 2
u (t ) + u (t + ) = 0, with =
6 (2 + ) 6 + (1 )
2 2
. (33.18)
As MoDE expansion coefcient we select the element-to-wavelength ratio = /. Accordingly, expanding the the end values in Taylor series about u (t ) gives u (t ) = u j u (t ) + 2 u (t )/2! . . ., and u (t + ) = u (t ) + u (t + ) = u (t ) + 2 u (t )/2! + u j + u (t ) + 2 u (t )/2! + . . .. The foregoing semisum is 1 2 4 u (t )/4! + . . ., which contains only even u derivatives. Replacing into (33.18) and setting = , we obtain the innite-order modied differential equation or IOMoDE: (1 )u + 4 4 1 2 2 u + u 2! 4! + . . . = 0. (33.19)
This form needs further work. To see why, consider a mesh renement process that makes 0 while keeping xed. Then (33.19) approaches (1 )u = 0. Since u = 0, 1 in the sense that 1 = O ( 2 ). To 2 , where is another free obtain the canonical MoDE form exhibited below, the transformation 1 1 2 2 2 2 2 = 6 /(6 (1 ) ). Replacing into (33.19)and coefcient, is specied, and solved for , giving dividing through by 2 = 2 2 yields 1 2 2 u+ u + u 2 2 2! 4! + 4 4 u 6! + . . . = 0. (33.20)
This has the correct IOMoDE form: as > 0 two terms survive and a second-order ODE emerges. In fact, but for the sign of the rst term this is a canonical IOMoDE form studied in [94] for a different application. The last and quite complicated MoDE step is elimination of derivatives of order higher than two. The technique of that reference leads to the nite order modied equation or FOMoDE: 2 4 u = 0. (33.21) u + 2 2 arcsin 2
2 u = 0 of Table 33.1, assuming that = 0 . Equating This is matched to the continuum bar equation u + k0 1 , whence = 4 sin2 ( )/ 2 and coefcients gives k0 0 /2 = = arcsin( 2 ) or sin( ) = 1 2 2
6 2 12 sin2 ( ) = = 4 2 2 . 6 (1 ) 2 2 + + (1 ) cos(2 )
(33.22)
Replacing 2 by (or by = ) gives M = 1 + 6/ 2 3/(1 cos ), thus reproducing the result (33.16). So Fourier analysis and MoDE deliver the same result.
Remark 33.1. When Fourier can be used, as here, it is far simpler than MoDE. However the latter provides
a side bonus: a priori error estimates. For example, suppose that one plans to put 10 elements within the shortest wavelength of interest. Thus = / = 1/10 and = 4 sin2 ( )/ 2 = 38.1966. Replacing into (33.22) gives /(2 ) = 1.016520, 0.999670 and 0.983632 for = 0, = / and = 1, respectively. The estimate frequency errors with respect to the continuum are 1.65%, 0.04% and 1.64%, respectively.
3310
33.5
Total mass A
As pictured in Figure 33.5, this element is prismatic with length , cross section area A and mass density . Midnode 3 is at the center. The element DOFs are arranged as ue = [ u 1 u 2 u 3 ]T . Its well known stiffness matrix is paired with a entry-weighted mass template:
3 (e) =L
e
2 x
EA K = 3
e
7 1 8
1 7 8
8 8 , 16
Me
A = 90
12 + 1 3 + 3 6 + 4
3 + 3 12 + 1 6 + 4
6 + 4 6 + 4 48 + 2
(33.24)
The idea behind the assumed form of Me in (33.24) is to dene the mass template as a parametrized deviation from the consistent mass matrix. That is, setting 1 = 2 = 3 = 4 = 0 makes e Me = MC . Setting 1 = 3 = 3, 2 = 12 and 4 = 6 gives the well known diagonally lumped , /, / . mass matrix (DLMM) generated by Simpsons integration rule: Me L = A diag / e Thus again the standard models are template instances. Notice that M in (33.24) incorporates matrix and physical symmetries a priori but not conservation conditions. Linear and angular momentum conservation requires 21 + 2 + 23 + 44 = 0 and 3 = 1 , respectively. Eliminating 3 and 4 from those constraints reduces the template to two parameters: Me A = 360 4(12 + 1 ) 4(3 + 1 ) 24 41 2 4(3 + 1 ) 4(12 + 1 ) 24 41 2 24 41 2 24 41 2 4(48 + 2 ) (33.25)
For (33.25) to be nonnegative, 1 9/2 and 15 + 1 3 5 9 + 21 1 15 + 1 + 4 2 3 5 9 + 21 . These inequality constraints should be checked a posteriori.
j2 Two-element patch j1 j j+1 j+2
x
j
xj
xj
,E,A = const
xj +
Figure 33.6. Lattice of three-node bar elements from which a 2-element patch is extracted. Yellow and red-lled circles ag endnodes and midnodes, respectively.
3311
3312
33.5.1. Patch Equations Unlike the two-node bar, two free parameters remain after the angular momentum conservation condition is enforced. Consequently we can ask for satisfactory wave propagation conditions in addition to conservation. To assess performance of mass-stiffness combinations we carry out the plane wave analysis of the innite beam lattice shown in Figure 33.6. From the lattice we extract a typical two node patch as illustrated. The patch has ve nodes: three endpoints and two midpoints, which are assigned global numbers j 2, j 1, . . . j +2. The unforced P + K P u P = 0, where semidiscrete dynamical equations of the patch are M P u 4(12 + 1 ) 24 41 2 A MP = 4(3 + 1 ) 360 0 0 7 8 1 0 E A 8 16 8 0 P K = 1 8 14 8 3 0 0 8 16 0 0 1 8 24 41 2 4(3 + 1 ) 0 0 4(48 + 2 ) 24 41 2 0 0 24 41 2 8(12 + 1 ) 24 41 2 4(3 + 1 ) 0 24 41 2 4(48 + 2 ) 24 41 2 0 4(3 + 1 ) 24 41 2 4(12 + 1 ) 0 0 1 , u P = [ u j 2 u j 1 u j u j +1 u j +2 ]T . 8 7 (33.26)
From the foregoing we keep the third and fourth equations, namely those for nodes j and j +1. This selection provides the equations for a typical corner point j and a typical midpoint j +1. The retained patch equations are P + KP (33.27) MP j , j +1 u j , j +1 u P = 0.
P P P The 2 5 matrices M P j , j +1 and K j , j +1 result on deleting rows 1,2,5 of M and K , respectively.
33.5.2. Fourier Analysis We study the propagation of harmonic plane waves of wavelength , wavenumber k = 2/, and circular frequency over the lattice of Figure 33.6. For convenience they are separated into corner and midpoint waves: u c (x , t ) = Bc ei (kx t ) , u m (x , t ) = Bm ei (kx t ) . (33.28)
Wave u c (x , t ) propagates only over corners and vanishes at midpoints, whereas u m (x , t ) propagates only over midpoints and vanishes at corners. Both have the same wavenumber and frequency but different amplitudes and phases. [Waves (33.28) can be combined to form a single waveform that propagates over all nodes. The combination has two components that propagate with the same speed but in opposite directions. This is useful when studying boundary conditions or transitions in nite lattices, but is not needed for a periodic innite lattice.] As in the two-node bar case, we will work with the dimensionless frequency = /c0 and dimensionless wavenumber = k . 3312
3313
Inserting (33.28) into (33.26), passing to dimensionless variables and requiring that solutions exist for any t yields the characteristic equation 1 960 2(48 + 2 ) 180 symm
2
cos 1 2
2
(33.29) For nontrivial solutions the determinant of the characteristic matrix must vanish. Solving for 2 gives two frequencies for each wavenumber . They can be expressed as the dispersion relations
2 a
+ (30 + (31 )
) cos
Bc Bm
= 0.
1 + , 5 + 6 cos
2 o
1 , 5 + 6 cos
(33.30)
in which 1 = 720(208 2 + (2 32) cos ), 2 = 64(1 60)1 321 2 + 132 2 + 384(474 + 2 ), 3 = 12(112 + 2 )(128 + 2 ), 4 = 64(132 + (1 60)1 ) 32(1 6)2 + 2 2, 2 2 + ( 60 ) ) 8 ( 30 + ) + , = 2880 + 16 ( 60 ) 8 + 5 = 16(540 1 1 2 6 1 1 1 2 2 2 1 and = 120 6 2 3 cos 4 cos 2 . Frequencies a and o pertain to the so-called acoustic and optical branches, respectively. This nomenclature originated in crystal physics, in which both branches have physical meaning as modeling molecular oscillations. [In molecular crystallography, acoustic waves are long-wavelength, low-frequency mechanical waves caused by sonic-like disturbances, in which adjacent molecules move in the same direction. Optical waves are short-wavelength, high-frequency oscillations caused by interaction with light or electromagnetics, in which adjacent molecules move in opposite directions. Notes and Bibliography provides references.] Figure 33.7 illustrates nomenclature used for a two-branched dispersion diagram such as that given by (33.30). The meaning of terms such as stopping band is dened below. In FEM discretization work only the acoustic branch has physical meaning because for small (that is, long wavelengths) it approaches the continuum bar relation = , as shown below in (33.31). On the other hand, the optical branch is physically spurious. It is caused by the discretization and pertains to high-frequency lattice oscillations, also known as mesh modes.
8 7 6 5 4 3 2 1 0 1
Dimensionless frequency
Cutoff frequency
min
max
Dimensionless wavenumber
Figure 33.7. Notation pertaining to a typical two-branch dispersion diagram. The stopping band is the union of I and II.
The distinction between the two branches can be better grasped by examining the Taylor expansions of the frequencies (33.30) about = 0:
2 a
C4 4 C6 6 C8 8 = + + + + ..., 4! 6! 8!
2
2 o
D2 2 = D0 + + ..., 2!
(33.31)
in which 3313
3314
2 5 1440 C4 = 14400 1 = (240 41 + 2 )(41 2 ), 2 3 4 2 10 14402 C6 = 41472000 + 72001 + 1801 + 1 7201 2 , 2 3 4 5 60 14403 C8 = 2030469120000 + 3483648001 145152001 3427201 25201 6 2 3 4 2 2 71 + 580608001 2 + 14515201 2 + 100801 2 29030401 2 ,
(33.32)
D0 =
1 , 3
D2 =
2 Here 1 = 41 2 120, 2 = 1 2 and 3 = 28800 + 3601 + 1 14402 = 2 2 2 2880 9601 + 161 1202 81 2 + 2 . Note that the expansion of a approaches 2 as 0. Clearly the acoustic branch is the long-wavelength counterpart of the continuum bar, for which = . On the other hand, the optical branch has a nonzero frequency 2 o = 1/3 at = 0, called the cutoff frequency, which cannot vanish although it may go to innity if 3 = 0. As illustrated in Figure 33.7, the lowest and highest values of o (taking the + square root of 2 o ) are max min max called o and o , respectively, while the largest a is called a . Usually, but not always, min max and a occur at = . 0 max max > a , the range min > > a is called the acoustoptical frequency gap or simply If min o o the AO gap. Frequencies in this gap are said to pertain to portion I of the stopping band, a term pertain to portion II of the stopping band. derived from lter technology. Frequencies > max o A stopping band frequency cannot be propagated as harmonic plane wave over the lattice. This can be proven by showing that if pertains to the stopping band, the characteristic equation (33.29) has complex roots with nonzero real parts. This causes exponential attenuation so any disturbance with that frequency will decay exponentially.
Table 33.2. Useful Mass Matrices for Three-Node Bar Element Mass matrix CMM DLMM BLC COF Template signature 1 2 3 4 0 3 2 8 0 12 8 32 0 0 2 + 2 2 2 Taylor expansion of (acoustic branch)
6 720 6 1440 8 37800 6 240 2 a
2 o
11 8 151200 8 48383
7 10 129600 10 4147200
+ O ( 12 ) + O ( 12 )
3 6 2 4 8 16
10 864000
+ O ( 12 )
10 86400
+ O ( 4 )
8 6048
+ O ( 12 )
33.5.3. Customization Figure 33.8 shows dispersion curves for the four parameter settings tabulated in Table 33.2. The e four associated mass matrices are positive denite. Dispersion curves for the consistent mass MC and the diagonally lumped mass Me L are shown in (a,b). Both matrices have an acoustical branch that agrees with the continuum to order O ( 4 ), as shown by the series listed in Table 33.2. 3314
3315
Dimensionless frequency Dimensionless frequency
8 7 6 5 4 3 2 1 0 8 7 6 5 4 3 2 1 0 1 2 1 2 8 7 6 5 4 3 2 1 0 8 7 6 5 4 3 2 1 0
33.5
(a) Consistent Mass (CMM): 1 = 0, 2 = 0
Optical branch Continuum bar
Acoustic branch
Acoustic branch
1
Dimensionless wavenumber
Dimensionless wavenumber
Dimensionless frequency
Dimensionless frequency
Acoustic branch
1
Dimensionless wavenumber
Dimensionless wavenumber
Figure 33.8. Dispersion curves of four mass matrices for the three-node prismatic bar, plotted for [0, 2 ]. Acoustic branch in red, optical branch in blue, continuum bar line = in black. Acoustic and optical branches repeat with period 2 ; note symmetry about = .
For a mass matrix to produce fourth order accuracy in the acoustic branch, C4 = 0 in the series (33.31). This has the two solutions 2 = 41 and 2 = 41 240. Both CM and DLM comply with the rst solution. To get sixth order accuracy for small we impose C4 = C6 = 0. This has only two solutions: {1 = 2, 2 = 8} and {1 = 62, 2 = 8}. Only the rst solution is of interest, as the second one produces large positive-negative entries and exactly the same dispersion curves. The resulting mass matrix turns out to be a linear combination of CMM and DLMM. It is labeled BLC for best lumped-consistent combination: A 90 14 1 2 1 14 2 2 2 56
Me BLC =
e MC +2 Me =1 L. 3 3
(33.33)
As shown in Table 33.2, the acoustic branch of this matrix agrees up to O ( 6 ) with the continuum bar. The dispersion curves are shown in Figure 33.8(c). A different kind of customization is advisable in dynamic simulations that involve propagation of high frequencies, such as shock and impact. The presence of the optical branch is undesirable, because it introduces spurious noise into the solutions. For such problems the two-node bar, which lacks an optical branch, should be used. If use of a three-node model is mandated for some reason, the harmful effects of the optical branch can be reduced by making it of constant frequency. Setting 3315
3316
in which acronym COF stands for Constant Optical Frequency. Then 2 o = 12 for all wavenumbers, as pictured in Figure 33.8(d). This conguration maximizes the stopping band and facilitates the implementation of a narrow band lter centered at that frequency. The acoustic branch accuracy is inferior to that of the other models, however, so this customization involves a tradeoff. One nal parameter choice is worth mentioning as a curiosity. Setting {1 = 2, 2 = 8} produces a dispersion diagram with no stopping band: the optical branch comes down from + at = 0, 2 and merges with the acoustic branch at = . The application of this mass matrix (which is singular) as a modeling tool is presently unclear and its dispersion diagram is omitted. 33.6. The Bernoulli-Euler Beam The Bernoulli-Euler beam model is a special case of the Timoshenko beam treated in the next section. It is nonetheless useful to do its mass template rst, since results provide a valuable cross check with the more complicated Timoshenko beam. We take the consistent mass matrix derived in the previous chapter, and modify their entries to produce the following entry-weighted template: 13 11 9 13 + 11 ( 210 + 12 ) + 13 ( 420 + 14 ) 35 70 1 13 1 ( 105 + 22 ) 2 ( 420 + 23 ) ( 140 + 24 ) 2 = A (33.35) Me 11 13 + 11 ( 210 + 12 ) 35 symm
1 ( 105 + 22 ) 2
The parameters in (33.35) are i j , where i j identies the mass matrix entry. The template (33.35) accounts for matrix symmetry and some physical symmetries. Three more conditions can be imposed right away: 14 = 23 , 13 = 11 and 212 = 11 + 222 + 223 224 . The rst comes from beam symmetry and the others from conservation of total translational mass and angular momentum, respectively. This reduces the free parameters to four: {11 , 22 , 23 , 24 }. The Fourier analysis procedure should be familiar by now to the reader. An innite lattice of identical beam elements of length is set up. Plane waves of wavenumber k and frequency propagating over the lattice are represented by v(x , t ) = Bv exp i (kx t , (x , t ) = B exp i (kx t (33.36)
At a typical lattice node j there are two freedoms: v j and j . Two patch equations are extracted, and converted to dimensioneless form on dening = k and = c0 / , in which c0 = E I /( A 4 ) is a reference phase velocity. The condition for wave propagation gives the characteristic matrix equation det Cvv C v Cv C = Cvv C Cv C v = 0, 3316 (33.37)
3317
where Cvv = 8402(13+3511 ) 2 (840+(97011 ) 2 ) cos /35, Cv = Cv = i 2520 + (13+42023 ) 2 sin /210, C = 16804(1+10522 ) 2 +(840+3(1+14024 ) 2 ) cos /210. The condition (33.37) gives a quadratic equation in 2 that provides two dispersion solutions: acous2 () and optical branch 2 tical branch a o (). These were already encountered in the analysis of the 3-node bar in 33.2. The acoustical branch represent genuine exural modes, whereas the optical one is a spurious byproduct of the discretization. The small- (long wavelength) expansions of these roots are = D0 + D2 2 + D4 4 + . . . , (33.38) 2 2 in which C6 = 11 222 423 + 224 , C8 = 1/720 + 11 + 422 + 223 /3 + 1622 23 + 2 162 23 + 11 (1/12 + 422 + 823 424 ) 24 822 24 1623 24 + 424 , etc.; and D0 = 2520/(1 + 42022 42024 ), etc. Mathematica calculated these series up to C14 and D4 .
2 a 2 o 2 as 0. Thus The continuum dispersion curve is 2 = 4 , which automatically matches a four free parameters offer the opportunity to match coefcients of four powers: { 6 , 8 , 10 , 12 }. But it will be seen that the last match is unfeasible if Me is to stay nonnegative. We settle for a scheme that agrees up to 10 . Setting C6 = C8 = C10 = 0 while keeping 22 free yields two sets of solutions, of which the useful one is
= 4 + C6 6 + C8 8 + C10 10 + C12 12 + . . . ,
11 = 422 67/540 (4/27) 38/35 10822 , 23 = 43/1080 222 + 24 = 19/1080 22 + 95/14 67522 /54, 19/70 2722 /27. (33.39)
(e) The positivity behavior of Me is indenite for as 22 is varied is shown in Figure 33.9(a). M min 22 < 22 = (27 4 35)/5040 = 0.0006618414419844316. At the other extreme the solutions of (33.39) become complex if 22 > max 22 = 19/1890 = 0.010052910052910053.
Figure 33.9(b) plots C12 (22 ) = (111545 3008 + z15120(525 + 4)22 )/685843200, with = 70 19 189022 . This has one real root 22 = 0.02830257472322391, but that min max gives an inde nite mass matrix. For 22 in the legal range [22 , 22 ], C12 is minimized for b 22 = (25 105 171)/30240 = 0.0028165928951385567, which substituted gives the optimal mass matrix:
1788 a13 732 0.389589 0.059127 0.110410 0.024206 A a22 2 732 a24 2 0.012340 2 0.024206 0.005548 2 e MB = = A a33 1788 0.389589 0.059127 30240 2 symm a44 0.012340 2 (33.40) a11
in which a11 = a 2724 + 60 105, a22 = a44 = 117 + 25 105 and 33 = 12396 60 105, a13 = a24 = 219 + 5 105. For this set, C12 = (25 105 441)/91445760 = 2.02 106 . Another interesting value is 22 = 13/3150 = 0.004126984126984127, which substituted in (33.39) yields rational values for the other parameters: 11 = 13 = 23/2100, 12 = 14 = 23 = 23/4200, 24 = 23/4200 and 24 = 17/12600. Replacing into the template gives 3317
3318
d 4 = det(Me) d1 d2
0 5 max 22 = 0.01005291 10
b 22 =0.00281659 z =0.0283026 22
C12106 22
0.02
a =0.00412698 22
1 0.03
d3
0.02
min 22 = 0.00066184
22
0.01
15 0 0.01 0.03
0.01
0.01
Figure 33.9. Behavior of Me as function of 22 when other parameters are picked from (33.39): (a) determinants dk of principal minors of order k of Me , showing legal min max 12 2 positivity range {22 , 22 }; (b) coefcient C12 of in a series.
4818 729 1482 321 0.382381 0.057857 0.117619 0.025476 2 2 A 321 73 172 0.013651 2 0.025476 0.005794 2 Me = A Q = 4818 729 0.382381 0.057857 12600 symm 172 2 symm 0.013651 2 (33.41)
For this matrix, C12 = 41/18144000 = 2.25 106 , which is only about 10% higher than for the optimal mass. Since the entries are simpler, (33.41) is adopted as custom mass matrix and used as a baseline for the Timoshenko beam.
33.7.
The last example is far more elaborate than the previous ones. The goal is to construct a mass template for the prismatic, plane-beam Timoshenko model. This includes the Bernoulli-Euler model as special case, and consequently results can be crosschecked with those of the previous section. The continuum Timoshenko model is rst examined in some detail, since frequency expansion formulas applicable to template customization by characteristic root tting are not easily found in the literature. 33.7.1. *Continuum Analysis Consider a structural beam member modeled as a shear-exible Timoshenko plane beam, as illustrated in Figure 33.10. This gure provides the notation used below. Section properties {, E , A , As , I , I R } are constant along x . The beam is transversally loaded by line load q (x , t ) (not shown in gure), with dimension of force per length. The primary kinematic variables are the transverse deection v(x , t ) and the total cross-section rotation (x , t ) = v (x , t ) + (x , t ), where = V /(G As ) is the mean shear rotation. The kinetic and potential energies in terms of those variables are
L
T [v, ] =
1 2 0
2 d x , Av 2 + IR
[v, ] =
0
1 2
E I (v )2 + 1 G As ( v 2
q v d x . (33.42)
where superposed dots denote time derivatives. The equations of motion (EOM) follow on forming the Euler-Lagrange equations from the Lagrangian L = T : L = q, = 0 G As ( v ) + Av v L = 0. = 0 E I + G As (v ) I R (33.43)
3318
3319
Section-averaged shear rotation Deformed cross y, v section Normal to deformed longitudinal axis
v(x)
z
Positive bending moment and transverse shear conventions
M x V
x, u L
+V
Figure 33.10. A plane beam member modeled as Timoshenko beam, illustrating notation followed in the continuum analysis. Transverse load q (x ) not shown to reduce clutter. Innitesimal deections and deformations grossly exaggerated for visibility.
An expedient way to eliminate is to rewrite the coupled equations (33.43) in transform space: As 2 G As p 2 G As p G As p E I p 2 G As I R s 2 v = q , 0 (33.44)
q in which { p , s , v, , } denote transforms of {d /d x , d /dt , v, , q }, respectively (Fourier in x and Laplace in and returning to the physical domain yields t ). Eliminating EI v + Av IR + AE I G As v + 2 AI R .... EI IR v =q q + q . G As G As G As (33.45)
(Note that this derivation does not pre-assume I I R , as usually done in textbooks.) For the unforced case q = 0, (33.45) has plane wave solutions v = B exp i (k0 x 0 t ) . The propagation condition yields a characteristic equation relating k0 and 0 . To render it dimensionless, introduce a reference phase velocity 2 = E I /( AL 4 ) so that k0 = 0 /c0 = 2/0 , a dimensionless frequency = 0 L /c0 and a dimensionless c0 wavenumber = k0 L . As dimensionless measures of relative bending-to-shear rigidities and rotary inertia take 2 2 rR = I R / A, (33.46) 0 = 12 E I /(G As L ), 0 = r R /L . The resulting dimensionless characteristic equation is 4
2 1 ( 12 0
2 2 0)
1 12
2 0
= 0.
(33.47)
This is quadratic in 2 . Its solution yields two kinds of squared-frequencies, which will be denoted by 2f and 2 s because they are associated with exural and shear modes, respectively. Their expressions are listed below along with their small- (long wavelength) Taylor series: P Q 2 2 6 2 2 4 8 1 1 1 = 4 ( 12 0 + 0 ) + ( 144 0 + 4 0 0 + 0 ) f = 6 2 (33.48) 0 0
1 ( 1728 P+ Q =6 = 2 0 0 2 3 0
+ 12
0 2 0
1 24
2 0
2 0
1 2
4 0
6 10 0)
+ . . . = A4 4 + A6 6 + A8 8 + . . .
0
2 s
2 0
+
1 12
12
0
1
2 0
1 2 4 + ( 12
2 6 0 )
+ . . . = B0 + B2 2 + . . . (33.49)
1 4 2 2 2 in which P = 1 + ( + 0 ) and Q = P 3 0 0 . The dispersion relation f () denes the 2 exural frequency branch whereas s () denes the shear frequency branch. If 0 0 and 0 0, which
3319
3320
(a)
Shear branches of Timoshenko model Bernoulli-Euler model =0 = 1/2 Flexural branches of Timoshenko model 0 5 15 10 20 Dimensionless wavenumber 25
40 Dimensionless speed / 35 30 25 20 10 5 15
(b)
Shear branches of Timoshenko model = 1/2 =0
=0
Figure 33.11. Spectral behavior of continuum Timoshenko beam model for a narrow b h rectangular cross section. (a): dispersion curves () for = h / = 1/4 and two Poissons ratios; Timoshenko exural and shear branches in red and blue, respectively; Bernoulli-Euler curve = 2 in black. (b) Wavespeed / .
reduces the Timoshenko model to the Bernoulli-Euler one, (33.47) collapses to 2 = 4 or (in principal value) = 2 . This surviving branch pertains to exural motions while the shear branch disappears or more precisely, 2 s () +. It is easily shown that the radicand Q in the exact expressions is strictly positive for any { 0 > 0, 0 > 0, 0}. Thus for any such triple, 2f and 2 s are real, nite and distinct 2 2 2 2 with f () < s (); furthermore { f , s } increase indenitely as . Following the nomenclature introduced in Figure 33.7, the value s at = 0 is called the cutoff frequency. To see how branches look like, consider a beam of narrow rectangular cross section of width b and height h , fabricated of isotropic material with Poissons ratio . We have E / G = 2(1 + ) and As / A 5/6. [Actually a more rened As / A ratio would be 10(1 + )/(12 + 11), but that makes little difference in 1 2 2 2 2 = I R / A = h 2 /12, 0 = rR / L 2 = 12 h / L 2 and the results.] We have A = bh , I = I R = bh 3 /12, r R 2 2 2 2 0 = 12 E I /(G As L ) = 12(1 + )h /(5 L ). Since 0 /12 = 12(1 + ) 0 /5, the rst-order effect of shear on 2f , as measured by the 6 term in (33.48), is 2.4 to 3.6 times that from rotary inertia, depending on . Replacing into (33.48) and (33.49) yields
2 f 2 s
= =
60 + 2 (17 + 12)
240 4 (1 + )
4 8
1 (17 60
+ 12)
6 +
60 + (17 + 12)
(1 + ) (1 + ) 4
2 2
1 (349 + 3600 4 4
468 + 144 2 )
+ ...
(33.50)
+ ...
in which = h / L . Dispersion curves () for = h / L = / and = {0, /} are plotted in Figure 33.11(a). Phase velocities / are shown in Figure 33.11(b). The gure also shows the exural branch of the BernoulliEuler model. The phase velocities of the Timoshenko model tend to nite values in the shortwave, highfrequency limit , which is physically correct. The Bernoulli-Euler model is wrong in that limit because it predicts an innite propagation speed.
3320
3321
33.7.2. *Beam Element
2 2
v' 2 =[dv/dx]2
The shear-exible plane beam member of Figure 33.10 is discretized by two-node elements. An individual element of this type is shown in Figure 33.12, which illustrates its kinematics. The element has four nodal freedoms arranged as ue = [ v1 1 v2 2 ]T (33.51) Here 1 = v1 + 1 and 2 = v2 + 2 are the total cross section rotations evaluated at the end nodes.
v1
1
v(x)
2
v2 x, u
Figure 33.12. Two-node element for Timoshenko plane beam, illustrating kinematics.
The dimensionless properties (33.46) that characterize relative shear rigidity and rotary inertia are redened using the element length: = 12 E I /(G As 2 ),
2 rR = I R / A,
= rR/ .
(33.52)
If the beam member is divided into Ne elements of equal length, = L / Ne whence = 0 Ne2 and = 0 Ne . Thus even if 0 and 0 are small with respect to one, they can grow without bound as the mesh is rened. 2 = 1/100, which are typical values for a moderately thick beam, and we take For example if 0 = 1/4 and 0 2 10. Those are no longer small numbers, a fact that will impact performance Ne = 32, then 250 and as Ne increases. The stiffness matrix to be paired with the mass template is taken to be that of the equilibrium element: 12 6 12 6 2 2 EI (4 + ) 6 (2 ) 6 Ke = 3 (33.53) 12 6 12 6 (1 + ) 2 2 (2 ) 6 (4 + ) 6 This is known to be nodally exact in static analysis for a prismatic beam member, and therefore an optimal choice in that sense. 33.7.3. *Setting Up the Mass Template
e e e FEM derivations usually split the 4 4 mass matrix of this element into Me = Me v + M , where Mv and M come from the translational inertia and rotary inertia terms, respectively, of the kinetic energy functional T [v, ] of (33.42). The most general mass template would result from applying a entry-weighted parametrization of those two matrices. This would require a set of 20 parameters (10 in each matrix), reducible to 9 through 11 on account of invariance and conservation conditions. Attacking the problem this way, however, leads to unwieldy algebraic equations even with the help of a computer algebra system, while concealing the underlying physics. A divide and conquer approach works better. This is briey outlined next and covered in more detail in the next subsections. e e (I) Express Me as the one-parameter matrix-weighted form Me = (1 0 ) Me F + 0 M D . Here M F is full and includes the CMM as instance, whereas Me D is 2 2 block diagonal and includes the DLMM as instance. This is plainly a generalization of the LC linear combination (33.2). e e e e (II) Decompose the foregoing mass components as Me F = M F T + M F R and M D = M DT + M D R , where T and R subscripts identify their source in the kinetic energy functional: T if coming from the translational inertia 2. Av 2 and R from the rotary inertia term 1 IR term 1 2 2 e (III) Both components of Me F are expressed as parametrized spectral forms, whereas those of M D are expressed as entry-weighted. The main reasons for choosing spectral forms for the full matrix are reduction of parameters and physical transparency. No such concerns apply to Me D.
The analysis follows a bottom up sequence, in order (III)-(II)-(I). This has the advantage that if a satisfactory custom mass matrix for a target application emerges during (III), stages (II) and (I) need not be carried out, and that matrix directly used by setting the remaining parameters to zero.
3321
3322
33.7.4. *Full Mass Parametrization As noted above, one starts with full-matrix spectral forms. Let denote the natural coordinate that varies from 1 at node 1 to +1 at node 2. Two element transverse displacement expansions in generalized coordinates are introduced: vT ( ) = L 1 ( ) cT 1 + L 2 ( ) cT 2 + L 3 ( ) cT 3 + L 4 ( ) cT 4 = LT cT , v R ( ) = L 1 ( ) c R 1 + L 2 ( ) c R 2 + L 3 ( ) c R 3 + L 4 ( ) c R 4 = L R c R , L 1 ( ) = 1, L 2 ( ) = , L 3 ( ) = 1 (3 2 1), L 4 ( ) = 1 (5 3 3 ), 2 2 L 4 ( ) =
1 2
(33.54)
5 3 (5 + 10 ) = L 4 ( ) (1 + 5 ).
The vT and v R expansions are used for the translational and rotational parts of the kinetic energy, respectively. The interpolation function set { L i } used for vT is formed by the rst four Legendre polynomials over = [1, 1]. The set used for v R is the same except that L 4 is adjusted to L 4 to produce a diagonal rotational mass matrix. All amplitudes cT i and c Ri have dimension of length. Unlike the usual Hermite cubic shape functions, the polynomials in (33.54) have a direct physical interpretation. L 1 : translational rigid mode; L 2 : rotational rigid mode; L 3 : pure-bending mode symmetric about = 0; L 4 and L 4 : bending-with-shear modes antisymmetric about = 0. With the usual abbreviation (.) d (.)/d x = (2/ )d (.)/d , the associated cross section rotations are T = vT + T = LT cT + T ,
2
R = vR + R = LR cR + R ,
2
(33.55)
in which the mean shear distortions are constant over the element: 12 12 The kinetic energy of the element in generalized coordinates is T =
e 1 2 0 2 Av T 2 R + IR dx = 1
T =
vT =
10
cT 4 ,
R =
vR =
10
c R4 .
(33.56)
2 2 R T DT c T + 1 T DR c R, c c Av T + IR d = 1 2 T 2 R
(33.57)
in which both generalized mass matrices turn out to be diagonal as intended: DT = A diag [ 1
1 3 1 5 1 7
],
D R = 4 A
diag [ 0 1 3 5 ] .
To convert DT and D R to physical coordinates (33.51), vT , v R , T and R are evaluated at the nodes by setting = 1. This establishes the transformations ue = GT cT and ue = G R c R . Inverting: cT = HT ue and 1 1 c R = H R ue with HT = G T and H R = G R . A symbolic calculation yields HT = 1 60(1 + 30(1 + ) 36 30 0 ) 6
HR =
1 60(1 +
30(1 + ) 5 (1 + ) 15 30 0 5 (1 + ) ) 6 3
5 (1 + ) 30(1 + ) 5 (1 + ) 3 36 + 30 3 5 (1 + ) 0 5 (1 + ) 3 6 3 30(1 + 30 0 6 ) 5 (1 + ) 15 5 (1 + ) 3
(33.58)
Matrices HT and H R differ only in the second row. This comes from the adjustment of L 4 to L 4 in (33.54). To render this into a spectral template inject six free parameters in the generalized masses while moving 4 2 inside D R : DT = A diag [ 1
1 3 T1 1 5 T2 1 7 T3
],
D R = A diag [ 0 R 1 3 R 2 5 R 3 ] .
(33.59)
3322
3323
T T The transformation matrices (33.58) are reused without change to produce Me F = HT DT HT + H R D R H R . If T 1 = T 2 = T 3 = 1 and R 1 = R 2 = R 3 = 4 2 one obtains the well known consistent mass matrix (CMM) of Archer, listed in [205, p. 296], as a valuable check. The conguration (33.59) already accounts for linear momentum conservation, which is why the upper diagonal entries are not parametrized. Imposing also angular momentum conservation requires T 1 = 1 and R 1 = 4 2 , whence the template is reduced to four parameters:
1 T 0 Me F = A HT 0 0
0
1 3
0 0
0 0 1 5 T2 0
0 0 0 0 H + A HT R 0 T 0 1 0 7 T3
0 4 0 0
2
0 0 3 R 2 0
0 0 H . 0 R 5 R 3
(33.60)
Because both HT and H R are nonsingular, choosing all four parameters in (33.60) to be nonnegative guarantees that Me F is nonnegative. This useful property eliminates lengthy a posteriori checks. Setting T 2 = T 3 = R 2 = R 3 = 0 and = 0 yields the correct mass matrix for a rigid beam, including rotary inertia. This simple result highlights the physical transparency of spectral forms. 33.7.5. *Block-Diagonal Mass Parametrization Template (33.60) has a aw: it does not include the DLMM. To remedy the omission, a block diagonal form, with four free parameters: {T 1 , T 2 , R 1 , R 2 }. is separately constructed:
T 1 T 2 Me D = M DT + M D R = A 0 0 0 0
/ T 1
2
0 0 0 R1 0 0 R1 R2 / T 1 + A 0 0 T 1 T 2 2 0 0
0 0 0 0 (33.61) 0 R 1 R 1 R 2 2
1 Me D = A 0 0
1 2 2 0 0
0 0 / 1
0 0 . 1 2 2
(33.62)
where 1 = T 1 + R 1 and 2 = T 2 + R 2 . Sometimes it is convenient to use the split form (33.61), for example in lattices with varying beam properties or lengths, a topic not considered there. Otherwise (33.62) sufces. If 1 = 0, Me D is diagonal. However for computational purposes a block diagonal form is just as good and provides additional customization power. Terms in the (1,1) and (3,3) positions must be as shown to satisfy linear momentum conservation. If angular momentum conservation is imposed a priori it is necessary 2 , and only one parameter remains. to set 2 = 1 2
e The general template is obtained as a linear combination of Me F and M D : e Me = (1 0 )Me F + 0 M D
(33.63)
e Summarizing there is a total of 7 parameters to play with: 4 in Me F , 2 in M D , plus 0 . This is less that the 9-to-11 that would result from a full entry-weighted parametrization, so not all possible mass matrices are included by (33.63).
3323
3324
33.7.6. *Fourier Analysis An innite lattice of identical beam elements of length is set up. Plane waves of wavenumber k and frequency propagating over the lattice are represented by v(x , t ) = Bv exp i (kx t , (x , t ) = B exp i (kx t (33.64)
At each typical lattice node j there are two freedoms: v j and j . Two patch equations are extracted, and converted to dimensionless form on dening = k and = c/ , in which c = E I /( A 4 ) is a reference phase velocity. (Do not confuse with c0 ). The condition for wave propagation gives the characteristic matrix equation Cvv Cv det = Cvv C Cv Cv = 0, (33.65) Cv C where the coefcients are complicated functions not listed there. Solving the equation provides two equations: 2 2 a and o , where a and o denote acoustic and optical branch, respectively. These are expanded in powers of for matching to the continuum. For the full mass matrix one obtains
2 a
= 4 + C6 6 + C8 8 + C10 10 + . . . ,
2 o
= D0 + D2 2 + . . .
(33.66)
Coefcients up to 12 were computed by Mathematica. Relevant ones for parameter selection are C6 = /12
2
, ) + 60(1 + 3 ) + 525 R 2 (1 +
2
+ 720
) 105 R 3 (1 +
(2940 + 12600 R 2 (1 + (7 + 6 ))
) 5 (7 + 6 (2 +
6 2
302400(1 +
)
2
/ 302400(1 + ,
) , )
2
(33.67)
+ 3T 3
525 R 2 (1 + 2100 )
)) + 2100(1 + )
4
+
2 2 2
+ 52920000
(1 +
/ 7 + 105 R 2 + 3T 3 + 2100
= 4 + F6 6 + F8 8 + F10 10 + . . . , 28802 5
2 o
= G0 + G2 2 + . . . +5
(33.68)
242 + 2 G2 = 22 (1 + )
(33.69)
The expansions for the 7-parameter template (33.63) are considerably more complicated than the above ones, and are omitted to save space.
3324
3325
33.7 *TWO-NODE TIMOSHENKO BEAM ELEMENT Table 33.3. Useful Template Instances for Timoshenko Beam Element
Description Consistent mass matrix of Archer. Matches exural branch up to O ( 6 ). Flexural-branch matched to O ( 10 ) with spectral (Legendre) template (33.60). Shear branch matched to O ( 0 ) while exure tted to O ( 10 )
Comments A popular choice. Fairly inaccurate, however, as beam gets thicker. Grossly overestimates intermediate frequencies. Converges faster than CMM. Performance degrades as beam gets thicker, however, and element becomes inferior to CDLA. Custom application: to roughly match shear branch and cutoff frequency as mesh is rened. Danger: indenite for certain ranges of and . Use with caution. Custom application: to nely match shear branch and cutoff frequency as mesh is rened. Danger: indenite for wide ranges of and . Use with extreme caution. Obvious choice for explicit dynamics. Accuracy degrades signicantly, however, as beam gets thicker. Underestimates frequencies. Becomes singular in the Bernoulli-Euler limit. Robust all-around choice. Less accurate than FBMS and FBMG for thin beams, but becomes top performer as aspect ratio increases. Easily constructed if CMM and DLMM available in code. Known to be the globally optimal positivedenite choice for matching exure in the Bernoulli-Euler limit. Accuracy, however, is only marginally better than FBMS. As in the case of the latter, performance degrades as beam gets thicker.
FBMS
SBM0
SBM2
DLMM
Diagonally lumped mass matrix with rotational mass picked to match exural branch to O ( 6 ). Average of CMM and DLMM. Matches exure branch to O ( 8 ).
CDLA
FBMG
33.7.7. *Template Instances Seven useful instances of the foregoing templates are identied and described in Table 33.3. Table 33.4 lists the template signatures that generate those instances. These tables include two existing mass matrices (CMM and DLMM) re-expressed in the template context, and ve new ones. The latter were primarily obtained by matching series such as (33.67) and (33.68) to the continuum ones (33.48) and (33.49), up to a certain number of terms as described in Table 33.3. For the spectral template it is possible to match the exure branch up to O ( 10 ). Trying to match O ( 12 ) leads to complex solutions. For the diagonal template the choice is more restrictive. It is only possible to match exure up to O ( 6 ), which leads to instance DLMM. Trying to go further gives imaginary solutions. For
3325
3326
Templ. form (33.60) (33.60) (33.60) (33.60) (33.62) (33.63) (33.63) + 120
2
Template signature R2 R3 1 4
2 2 2
Fit to continuum freqs. 2 2 s (shear) f (exural) up to 6 up to 10 none none up to 0 up to 2 none none none
4 c1
+ /3 + /3 20 c2 20
2 2 1 2 1 2 1 2 2
up to 10 up to 8 0 up to 6 1/2 c7
4
1 c3 +
2
1 c4 (45 300
4 c5
2
4 c6
0 1/12
2
up to 8 up to 10 ) ,
) + 3 (7 20
+ 1200
) / 15(1 +
+ 727
the 7-parameter template (33.63) it is again possible to match up to O ( 10 ) but no further. The instance that exhibits least truncation error while retaining positivity is FBMG. This is globally optimal for the BernoulliEuler limit = = 0, but the results are only slightly better for the reasons discussed in 33.6.9. Matching both exure and shear branches leads to instances SBM0 and SBM2, which have the disadvantages noted in Table 33.3. The exact dispersion curves of these instances are shown in Figure 33.13 for = 48/125 and 2 = 1/75, which pertains to a thick beam. On examining Figure 33.13(c) it is obvious that trying to match the shear branch is difcult; the t only works well over a tiny range near = 0. 33.7.8. *Vibration Analysis Example The performance of the seven instances of Tables 34 for vibration analysis is evaluated on a simply supported (SS) prismatic beam of length L divided into Ne equal elements. The cross section is rectangular with width b and height h . The material is isotropic with Poissons ratio = 0. Three different height-to-span ratios h / L , characterizing a thin, moderately thick and thick beam, respectively, are considered. Results for these congurations are collected in Figures 33.14, 33.15 and 33.16, respectively, for the rst three vibration frequencies. All calculations are rendered dimensionless using the scaling techniques described previously. Vibration accuracy is displayed as log-log plots of dimensionless natural frequency error versus Ne . The error is displayed as d = log10 (| comp exact |, which gives at a glance the number of correct digits d , versus log2 Ne for Ne = 1 to 32. Should the error be approximately controlled by a truncation term of the form m ,
3326
3327
60
Dimensionless frequency
50 40 30 20 10
Dimensionless frequency
cutoff
50 40 30 20 10
o DLMM a CMM
0
f continuum
6
6 60
60
Dimensionless frequency
50 40 30 20 10
Dimensionless frequency
cutoff
cutoff
50 40 30 20 10
o FBMG
f continuum
o FBMS
0 1
a FBMS
6
a FBMG
0
Dimensionless wavenumber = k
Figure 33.13. Dimensionless dispersion curves of Timoshenko mass matrices instances of Tables 33.333.4 for 2 = 1/75 = 0.0133. (a) Curves for standard consistent and a thick beam with 0 = 48/125 = 0.384 and 0 diagonally-lumped matrices CMM and DLMM; (b) curves for the exural-branch-matched FBMS and CDLA, (d) curves for the shear-branch-matched SBM0 and SBM2; (e) curve for exure branch globally optimized FBMG.
the log-log plot should be roughly a straight line of slope m , since = k = k L / Ne . The results for the Bernoulli-Euler model, shown in Figure 33.14, agree perfectly with the truncation error in the 2f branch as listed in Table 33.4. For example, top performers FBMG and FBMS gain digits twice as fast as CMM, DLMM and SBM2, since the formers match 2f to O ( 10 ) whereas the latter do that only to O ( 6 ). Instances CDLA and SMB0, which agree through O ( 8 ), come in between. The highly complicated FBMG is only slightly better than the simpler FBMS. Their high accuracy case should be noted. For example, four FBMS elements give 1 to six gures: 9.86960281 . . . versus 2 = 9.86960440 . . ., whereas CMM gives less than three: 9.87216716 . . .. The accuracy ceiling of about 11 digits for FBMS and FBMG observable for Ne > 16 is due to the eigensolver working in double precision ( 16 digits). Rerunning with higher (quad) oating point precision, the plots continues marching up as straight line before leveling at 25 digits. On passing to the Timoshenko model, the well ordered Bernoulli-Euler world of Figure 33.14 unravels. The culprits are and . These gure prominently in the branch series and grow without bound as Ne increases, as discussed in 33.6.2. Figure 33.15 collects results for a moderately thick beam with h / L = 1/8, which 2 = 1/768. The Bernoulli-Euler top performers, FBMS and FBMG, corresponds to 0 = 3/80 and 0 gradually slow down and are caught by CDLA by Ne = 32. All other instances trail, with the standard ones: CMM and DLMM, becoming the worst performers. Note that for Ne = 32, CMM and DLMM provide only 1 digit of accuracy in 3 although there are 32/1.5 21 elements per wavelength.
2 Figure 33.16 collects results for a thick beam with h / L = 2/5, corresponding to 0 = 24/625 and 0 = 1/75. The foregoing trends are exacerbated, with FBMS and FBMG running out of steam by Ne = 4 and CDLA
3327
3328
10
10
FBMG CDLA
SBM0
2 DLMM CMM 1 2 4 8 16
SBM2
16
32
32
Figure 33.14. Accuracy of rst 3 natural vibration frequencies of SS prismatic beam using mass matrices of Tables 33.333.4. Bernoulli-Euler model with 0 = 0 = 0. Exact (12-decimal) frequencies 1 = 2 = 9.869604401089, 2 = 4 2 = 39.478417604357 and 3 = 9 2 = 88.826439609804. Cutoff frequency +.
12 12 12
10
10
6 CDLA 4
2 CMM DLMM 1 2 4 8 16 32
16
Figure 33.15. Accuracy of rst 3 natural vibration frequencies of SS prismatic beam using mass matrices of 2 = 1/768 = 0.00130, pertaining to a Tables 33.333.4. Timoshenko model with 0 = 3/80 = 0.0375 and 0 rectangular x-section with h / L = 1/8 and = 0. Exact (12-decimal) frequencies 1 = 9.662562122511, 2 = 2 ) = 495.741868314549. 36.507937703548 and 3 = 75.894968024537. Cutoff frequency cut = 12/( 0 0
12 12 12
10
10
10
16
32
Figure 33.16. Accuracy of rst 3 natural vibration frequencies of SS prismatic beam using mass matrices of 2 = 1/75 = 0.0133, pertaining Tables 33.333.4. Timoshenko model with 0 = 24/625 = 0.384 and 0 to a rectangular x-section with h / L = 2/5 and = 0. Exact (12-decimal) frequencies 1 = 8.287891683498, 2 2 = 24.837128591729 and 3 = 43.182948411234. Cutoff frequency cut = 12/( 0 0 ) = 48.412291827593.
3328
3329
emerging as best for Ne 8. Again DCLM and CMM trail badly.
33.
References
The reason for the performance degradation of FBMS and FBMG as the Timoshenko beam gets thicker is unclear. Eigensolver accuracy is not responsible since rerunning the cases of Figures 33.15 and 33.16 in quad precision did not change the plots. A numerical study of the 2f truncation error shows that FBMS and FBMG t the continuum branch better than CDLA even for very thick beams. Possible contamination of vibration mode shapes with the shear branch was not investigated. Notes and Bibliography The template approach addresses the deciencies of the conventional mass models by using a parametrization approach that permits customization of that matrix to the problem and solution method at hand. The method was originally developed to construct high-performance stiffness matrices; a historical account and pertinent references are provided in a recent tutorial [92]. For stiffness-mass pairs it was used in [85,88] for a BernoulliEuler plane beam using Fourier analysis. One idea developed in those papers but not pursued here was to include the stiffness matrix template in the customization process. This provides more exibility but has a negative side: highly optimized stiffness-mass pairs become sensitive to mesh distortion. The symbolic derivation scheme used for the EOM (33.45) is due to Flaggs [95]; see also [189]. Making K and M frequency dependent was rst proposed by Przemieniecki [205], who expanded both Ke and Me as Taylor series in 2 . The idea was applied to eigenfrequency analysis of bars and beams, but not pursued further. The approach can be generalized to the template context by making free parameters frequency dependent, as illustrate in the two-node bar example. This may be of interest for problems dominated by a single driving frequency, as in some electronic and optical components. For more general use keeping the parameters frequency independent, as done in the last two examples, appears to be more practical. Two powerful customization techniques used regularly for templates are Fourier methods and modied differential equations (MoDE). Fourier methods are limited to separable systems but can be straightforward to apply, requiring only undergraduate mathematics. (As tutorials for applied Fourier methods Hammings textbooks [126,127], are recommended.) MoDE methods, rst published in correct form in 1974 [262] are less restrictive but more demanding on two fronts: mathematical ability and support of a computer algebra system (CAS). Processing power limitations presently restrict MoDE to two-dimensional elements and regular meshes. The selection of template optimization criteria is not yet on rm ground. For example: is conservation of angular momentum useful in mass templates? The answer seems to depend on the element complexity. Results for regular lattices of structural elements have direct counterparts in a very different area: molecular physics. More precisely, the wave mechanics of crystalline solids created in the XX Century by particle mechanicians; e.g., [35,282]. In crystal models, lattice nodes are occupied by molecules interacting with adjacent ones. Thus the element dimension acquires a physical meaning of molecular gap. In those applications masses are always lumped at molecule locations, and atoms vibrate as harmonic oscillators in the potential well of the force elds of their neighbors. Dispersion curves govern energy transmission. In a linear atomic chain, the wavenumber range [, ] is called the rst Brillouin zone [36,150]. Such a connection may be of interest as FEM and related discretization methods are extended into nano-mechanics. References Referenced items moved to Appendix R.
3329
3330
3330
ASEN 5007 Fall 2011 - Midterm Exam #1 - Open Notes and HWs
On-campus: Th October 6, 2011, 3:304:45 pm. CAETE students: see instructions on cover sheet Begin answering each Question on a new page; Question items may continue on the same page. Do not write on the exam sheets. Write your name or initials on each page. Use this sheet as cover. QUESTION 1. 30 pts = 10+10+10 Figure Q1.1 shows a at plate of constant thickness and uniform material, loaded as indicated. All edges are free: there are no external supports. The external boundary is a circle and the square hole is centered.
P y x
(a) Try to reduce the portion to be discretized as much as possible by identifying symmetry and/or antisymmetry lines. Sketch a diagram of the whole plate that identies such lines. (b) Sketch a coarse nite element mesh over the portion you picked in (a). Draw this separately from the sketch in (a). Make sure that there are several nodes over cutout. Identify (for example with arrows) regions over which a ner mesh may be desirable (but do not draw the ner mesh). Identify the loads that are to be applied on the smaller region. (c) Mark (using roller and/or xed-point symbols) how you would apply displacement boundary conditions on the nodes of the mesh sketched in (b), so as to enforce symmetry and/or antisymmetry conditions identied in (a). QUESTION 2. 35 pts: 8 + 10 + 10 + 7
;; ;;
1 (0,0) (1)
x
(x,y) node coordinates written in parenthesis after node numbers
(2)
Figure Q1.2 shows a pin-jointed plane truss discretized with 2 elements and 3 nodes. Node 3 is xed whereas 1 and 2 move over rollers as shown. The only nonzero applied load acts upward on node 1. Solve this problem by the Direct Stiffness Method. Start from the element stiffness equations given in (Q1.1) below. These are listed so you do not need to refer to the Notes, and already incorporate the E e Ae / L e factor in the stiffness matrices. Q11
; ;
2 (6,6)
; ; ;
3 (12,0)
e E e = 200 2 , A = 3 and e L = 6 2 for both (1) and (2)
P=5
The element stiffness equations in global coordinates are f (1) 1) 2) u( u( x1 x1 x2 50 50 50 50 50 50 50 50 1) 1) 2) f y(1 u( u( 50 50 50 50 50 50 50 50 y1 y2 (2) = (1) = (1) , 50 50 50 50 50 50 50 50 ux2 fx2 ux3 ( 1 ) ( 1 ) ( 2 ) 50 50 50 50 50 50 50 50 u y2 f y2 u y3
(a) Assemble the master stiffness equations. (This result is reused in Question 3 below). (b) Apply the given force and displacement BCs to get a reduced system of 2 equations and show it. (c) Solve the reduced stiffness system for the unknown displacements and show the complete node displacement vector. Skip recovery of node forces and reactions. (d) Recover the axial force F (2) in element (2) using the displacements you got in (c), noting sign. QUESTION 3. 35 pts = 8 + 10 + 10 + 7 This Question reuses the truss structure solved in P=5 Question 2. Everything remains the same except that the supports at 1 and 2 are changed to skew 1 (0,0) 3 (12,0) rollers at 45 with respect to x , as pictured 45 in Figure Q1.3. These two support conditions (2) (1) become multifreedom constraints (MFCs). The y departing point for the Question is the master stiffness system obtained upon removing node 3, x 2 (6,6) which is xed, but before applying the MFCs: ux1 0 45 u y1 (Q1.2) = Figure Q1.3. Structure for Question 3. 0 ux2 0 u y2 Asterisks are entries you got in item (a) of Question 2, upon removing rows and columns 5 and 6. (a) Write down the two MFCs. (b) Apply the MFCs by the master-slave (M/S) method by picking two slaves. Write down the M/S transformation matrix but do not proceed further. (c) Apply the MFCs by the penalty function method. Write down the stiffness equations of the 2 penalty elements needed for this method (use same weight w for each) but do not proceed further. (d) Apply the MFCs by Lagrange multipliers. Show the resulting system of equations, but do not solve.
; ;
y
BONUS QUESTION. Up to 5 pts. The plate of Question 1 has thickness h and is now loaded only by uniform pressure p , which is expressed as force per unit area, inside the hole. A very coarse mesh, shown in Figure Q1.4, is established over the whole plate. (Note that this mesh is too coarse to be useful; it is used only to make this Question specic.) Using the EbE loadlumping method determine force components at node 2 in terms of p , h and a , in which a is the hole side dimension (see Figure).
;; ;;
1 p
a
x
Figure Q1.4. Structure for Bonus Question.
Q12
; ; ;
2 3
a
ASEN 5007 Intro to FEM Fall 2011 - First Midterm Quiz - Solutions
QUESTION 1. 30 pts =10+10+10
P
Symmetry and antisymmetry lines (marked in red)
P A
c L
c L
P/2
Support conditions and applied loads
c L
A
no supports on hole nodes not on symmetry or antisymmetry lines
at entrant corner
;; ;;
1 (0,0) (1)
x
(x,y) node coordinates written in parenthesis after node numbers
(2)
; ;
2 (6,6)
; ; ;
3 (12,0)
e E e = 200 2 , A = 3 and e L = 6 2 for both (1) and (2)
P=5
50 50 0 100 50 50
0 0 50 50 50 50
0 ux1 0 u y1 50 u x 2 = 50 u y 2 50 ux3 50 u y3
(Q1.3)
(b) BCs: u x 1 = u y 2 = u x 3 = u y 3 = 0, f y 1 = 5, f x 2 = 0. Crossing out rows and columns 1, 4, 5 and 6 gives the reduced stiffness equation: 50 50 50 100 Q13 u y1 ux2 = 5 0 (Q1.4)
(c) Solving: u x 2 = 1/10 = 0.10, Complete displacement solution: u = [0 0.20 0.10 0 0 0 ]T (Q1.6) u y 1 = 1/5 = 0.20 (Q1.5)
Points are deducted for not listing this vector. node 2 to node 3. The orientation (d) Compute the internal force p (2) in member (2), which goes from angle from x to 23 (+CCW) is 45 . We have c = cos 45 = 1/ 2 and s = sin 45 = 1/ 2. The local displacements are recovered from the displacement transformation u x 2 = 1/10 2 1/2 0 0 1/ u x 2 = 1/(10 2) 0 0 u y2 = 0 1/ 2 1/ 2 (Q1.7) = u x3 = 0 0 0 1/ ux3 = 0 2 1/2 0 0 1/ 2 1/ 2 u y3 = 0
(2) where * are values of no interest x3 u x2 = for this computation. The member elongation is d = u 0 (1/(10 2) = +1/(10 2), whence
(2)
(Q1.8)
; ;
1 (0,0) (1)
45 (2) y x
Following the exam statement, the master stiffness equations for the truss constrained as shown in the above gure, after removing node 3 (which is xed) but before applying the MFCs, is obtained by deleting rows and columns 5 and 6 of the system (Q1.5): 50 50 50 50 50 50 50 50 50 50 100 0 0 50 ux1 50 u y 1 5 = ux2 0 0 u y2 0 100
;; ;;
2 (6,6) 45
; ; ;
3 (12,0)
P=5
(Q1.9)
Note that the RHS contains the numbers for the applied forces. It is an error to put f x 1 . . . f y 2 there. (a) Multifreedom constraints: u x 1 = u y 1 , u x 2 = u y 2 (Q1.10) Q14
(b) One slave freedom to be eliminated must be selected from each constraint. On taking u y 1 and u y 2 as slaves, the transformation equation is 1 0 ux1 0 ux1 u y1 1 . or u = T u (Q1.11) = 0 1 ux2 ux2 0 1 u y2 The remaining operations of the M/S method are not required in the test. (b) To applied the penalty function method the two MFCs of (Q1.10) are placed in canonical form: u x 1 u y 1 = 0 and u x 2 + u y 2 = 0. Rewrite in matrix form: [1 1 ] ux1 u y1 = 0, [1 1] ux2 u y2 = 0, (Q1.12)
Premultiply both sides of these equations by [ 1 1 ]T and [ 1 1 ]T , respectively, to get 1 [1 1 1 ] ux1 u y1 = 1 0, 1 1 [1 1 1] ux2 u y2 = 1 0, 1 (Q1.13)
and nally scale by the weight w to get the two penalty elements: w 1 1 1 1 ux1 u y1 = 0 , 0 w 1 1 1 1 ux2 u y2 = 0 0 (Q1.14)
Note that the RHS is a column 2-vector. Several tests had the scalar 0 as RHS, which is a considered an error because if so the matrix equations (Q1.14) have inconsistent dimensions. The remaining operations of the penalty function method are not required in the test. (c) To apply the Lagrange multiplier method two multipliers are required because there are two independent MFCs. Again one uses those in canonical form: u x 1 u y 1 = 0 and u x 2 + u y 2 = 0. On augmenting the coefcient matrix of (Q1.9) with 2 rows and columns yields 50 50 50 50 1 0 50 50 50 50 1 0 50 50 100 0 0 1 50 50 0 100 0 1 1 1 0 0 0 0 0 ux1 0 0 u y1 5 1 ux2 0 = 1 u y2 0 0 0 1 0 0 2
(Q1.15)
Switching signs in the last 2 rows and columns is also considered correct. The solution of this system is not required in the test. BONUS QUESTION. Up to 5 pts, total may not exceed 100. By inspection,
1 p 2 3
f x 2 = 0, .
pah f y2 = 2 2
(Q1.16)
y x
a a
Q15
ASEN 5007
Introduction to FEM
Midterm Exam 2
For on-campus students: Th November 10, 2011, 3:30pm. Open Notes and HWs Begin answering each Question on a new page. Questions may be answered in any order. Do not write on the exam sheets. Write your name on each page. Use this sheet as cover QUESTION 1 (40 pts, 10+15+15) The plane stress triangle element shown in Figure 1(a) has 4 nodes: 3 at its corners, and one (node 4) at the centroid (1 = 2 = 3 = 1/3). e for node 1 (a) Construct the shape function N1 using the product of two line equations that cross the other 3 nodes: side 23, and a parallel to 2-3 that passes through 4.
(a) 4 2 Figure 1. Plane stress element for Question 1. 3 1 (b) 4 2 3
(b) Check whether the shape function found in (a) satises C 0 interelement continuity along side 1-2 if connected to another triangle of the same kind, such as that pictured in Figure 1(b).
e by a different technique, called the correction method in the (c) Suppose that you construct N1 e Notes, by assuming that N1 = 1 + c4 1 2 3 . How would you compute c4 , and would the resulting shape function satisfy interelement continuity over 12?
QUESTION 2 (20 points) Consider the element of Figure 1(a). Assume that you have developed a set of shape functions. The element stiffness matrix is to be computed by Gaussian numerical integration. Which minimum number of Gauss points would be required so that the stiffness is rank sufcient? (Explain.) QUESTION 3 (40 pts, 14+18+8) A four node bar element is congured as shown in Figure 2. It has length L and four equally spaced nodes numbered as shown. The isoparametric denition of the element in its local system (bars and element superscripts are omitted to reduce clutter) is 1 x u 1 x1 u1 1 x2 u2 1 x3 u3 1 x4 u4 N1 ( ) N2 ( ) N3 ( ) N4 ( ) =
=1
1
=1/3 =1/3
3 4
=1
2
L/3
L/3 L
L/3
x, u
in which x1 = 1 L , x2 = 1 L , x3 = 1 L , x4 = 1 L (note that the x -coordinate origin is at the 2 2 6 6 element center), u 1 through u 4 are the nodal displacements along x , and the shape functions are ) N1 ( ) = (9/16)(1 )( 2 1 9 ) N3 ( ) = (27/16)(1 2 )( 1 3 N2 ( ) = (9/16)(1 + )( 2 1 ) 9 N4 ( ) = (27/16)(1 2 )( + 1 ) 3
(a) Show that the Jacobian J = x / is constant and equal to L /2. Hints: use chain rule; also see bottom of next page for useful formulas. OVER Q21
(b) A uniformly distributed force q (force per unit length) acts along the longitudinal direction x . The energy-consistent node force vector is given by f=
0 L
q NT d x =
1 1
q NT J d
in which NT collects the four shape functions given above. Find the consistent node force f 1 at node 1. (c) What is the minimum number of Gauss integration points that would be needed to get the exact element stiffness and why? (Note: this question is not related to rank sufciency.) To help Question 3(a): 9 N1 = (2 3 2 + 1 ), 9 16 27 2 N3 = ( + 3 2 1), 16 3 9 N2 = (2 + 3 2 1 ) 9 16 27 2 N4 = ( 3 2 + 1) 16 3
Q22
(b) Side 1-2 has equation 3 = 0. The N1 constructed in (a) varies quadratically because N1 = (3/2)1 (1 1/3) is independent of 3 . Since there are only two nodes on that side, the C 0 interelement continuity condition is generally violated when connected to another element that has corner nodes only. A special thing happens if the element is connected to another triangle of the same type, as in Figure 1(b) of exam. Corresponding shape functions agree exactly over the common side, and C 0 continuity is satised. Either answer, with plausible reasoning, is considered correct for this item. (c) Coefcient c4 is determined by requiring that the corrected N1 vanish at centroid node 4: N1 (1/3, 1/3, 1/3) = 1/3 + c4 (1/27) = 0 whence c4 = 9 and N1 = 1 91 2 3 (Q2.2) The variation of this shape function over side 1-2 of equation 3 = 0 is linear because the cubic term vanishes. Since there are two nodes over the side, the C 0 interelement continuity condition is generally satised when connected to another element with corner nodes only. QUESTION 2 The correct rank is n F n R = 2 4 3 = 8 3 = 5. Hence r = min(5, 3n G ), which requires n G 2. That is, at least two Gauss points are required. QUESTION 3 (a) From the denition of isoparametric element, x = x1 N1 + x2 N2 + x3 N3 + x4 N4 = i4=1 x1 Ni hence 9 J = x / = i4=1 xi Ni / . The necessary partial derivatives are N1 / = 16 (2 3 2 + 1 ), 9 9 1 27 2 27 2 2 2 2 N2 / = 16 (2 + 3 9 ), N3 / = 16 ( 3 + 3 1), N4 / = 16 ( 3 3 + 1). Replacing the node coordinates: L J=1 2 =L N1 N3 N2 N4 +1 L 6 27 27 2 9 1 + + = 16 16 16 16 =1 L 2
1 L 2
9 2 6 2 16 9
+1 L 6
27 6 2 + 2 16
(Q2.3)
Alternatively: expand x directly nding (after simplication) that x = 1 L , whence J = 1 L. 2 2 (b) The consistent force at node 1 is f1 =
1 1
q N1 J d = 1 Lq 2
1 1
1 1
(9/16)(1 )( 2 1 ) d = 1 Lq 9 2
4 9 = 16 9
qL 8
(Q2.4)
, because B( ) is quadratic. This is evaluated exactly by three or more Gauss points, since a 3-point Gauss rule is exact up to 2 3 1 = 5th order polynomials. By coincidence that also happen to be the minimum number of Gauss points to get rank sufciency. If the right answer is obtained by the rank sufciency argument, only partial credit is given. Q23
ASEN 5007 Introduction to FEM Fall 2011 Take Home Final Exam Important: Work individually. No consultation with others is permitted
On campus students: Take home posted Wed Dec 7, 2011 by noon. Due on or before Wed Dec 14 by 11am, at ECAE 187. If I am not there leave in instructors mailbox at ECAE 196 or ECOT 613 (note that the latter is locked after 5pm) If you leave in mailbox, place in clearly marked envelope. Do not leave under door or in hallway as it could be accidentally discarded. Attach pages 14 of exam as cover with your name on it. CAETE students: deadline instructions to be sent by email This test contains ve Questions, all pertaining to the same problem. The rst four are analytical; Q1 is fairly short. The algebra in Q2-Q4 may be helped by a CAS. The last one is computer oriented. Any language can be used to solve it; however, a Mathematica Notebook called PlaneThermalFEM.nb can be downloaded to help. The Notebook will be posted, along with this document, on Dec 7, 2011 by noon. Reference to formulas in the Notes where appropriate is encouraged instead of explicitly listing them. Technical background for the rst four Questions is given in Addendum A to this exam. QUESTION 1. 15 pts = 3 + 4 + 4 + 4 After reading Addendum A, answer the following conceptual questions. Please be brief: no more than one short paragraph for each. (a) What is the variational index m for the heat conduction problem? (Explain) (b) Does bilinear interpolation over 4-node quadrilaterals provide the correct temperature continuity between elements? If so, why? (c) Why is a 2 x 2 Gauss integration rule used for Ke of the 4-node quad? Wouldnt 1 x 1 be enough? (d) If a 6-node triangle element were to be developed for this problem, how many Gauss points would be needed so that Ke is rank sufcient? Note: the notion of element rank sufciency (and the equivalent of rigid body modes) for (c) and (d) is briey covered on page Q3-7. QUESTION 2. 20 pts = 10 + 6 + 4 (a) Show that the 4 4 element stiffness matrix of the 4-node bilinear iso-P quadrilateral for the heat conduction problem described in Addendum A and pictured in Figure A.2(b), has the form Ke =
e
kh BT B d
(1)
Here k is the coefcient of thermal conduction, h is the element thickness and the 2 4 matrix B is dened in equation (A.8) of Addendum A. Both k and h can be assumed to be constant over the element and therefore taken out of the integral. (b) Check that for a rectangular element of sizes a b along the x and y axes, respectively, this formula, integrated either exactly or by a 2 2 Gauss rule, gives 2a b b a 2b 2a + b +2 a a a a a b b b b a 2 b 2 b b b 2 a 2 a a + + b a a a b b b a (2) kh Ke = 1 6 2a + b 2a + 2b a 2b a b b a a a a b b b a 2b 2a + 2b 2a + b a b a a a b b a b b Q31
10 mm
0.1mm
copper channel
ceramic substrate
(c) Assuming that k , h , a and b are all positive, how many zero eigenvalues does the matrix (2) have? Is that the correct number? If so, why? Material relevant to (a) is given in Addendum A (formulation) and 16.5.2 of Notes (shape functions of 4-node quad). Verication of (b,c) by computer algebra is ne. Check also the posted Notebook. QUESTION 3. 15 pts = 10+5 Assume the source term of equation (A.1) varies bilinearly over the quadrilateral so that it is interpolated from the node values as (3) s = N 1 s1 + N 2 s2 + N 3 s 3 + N 4 s4 = N s where Ni (, ) are the shape functions of the bilinear quadrilateral, and N the 1 4 shape function matrix. Assume that all prescribed uxes q n over element sides are zero. (a) With an argument similar to that of 14.4 but using the W e of (A.6), show that the consistent element nodal force vector fe can be expressed as fe =
e
h NT s d
=
e
h NT N s d
(4)
(b) What fe would you get for an a b rectangular element if s is constant over it? Hint: check Cell 4 of posted Notebook. QUESTION 4. 15 pts Suppose side 12 of the individual quadrilateral of Figure A.2(b) is subject to a uniform prescribed thermal n is positive (negative) if heat ows out of (into) the element. ux q n , constant along the side, in which q Assume that the source term s is identically zero. Using the W e of (A.6) show that the consistent element node forces are 1 f1 1 f2 e 1 f = = 2q (5) n h 12 , 0 f3 0 f4 where 12 is the length of side 12. Verication by computer algebra is ne. Hint: check the module in Cell 5 of posted Notebook, in which the four sides of a quadrilateral are processed for specied uxes.
Q32
y
c
Components:
1 AIO ceramic matrix 2 2 copper channel 3 silicon chip
e b
E D
2
F G
1
x
A
a = 25 mm b = 10 mm c = 5 mm d = 3.75 mm e = 0.1 mm
Figure Q3.2. The computational domain ABCDEFGH for the problem of Figure Q3.1.
QUESTION 5. 35 pts This question deals with the FEM analysis of the 2D thermal problem depicted in Figure Q3.1. We want to nd the temperature distribution on an electronic package consisting of a heat-producing silicon chip sitting on a ceramic substrate placed over a chilling plate. In the center of the substrate a copper channel is placed to enhance cooling. The following assumptions are made to simplify the model. Time dependency is neglected. Consequently the problem is steady state heat conduction and is modeled by the Poissons equation presented in Addendum A. Temperature gradients in the z direction are negligible; hence the problem is modeled in 2D, with a nominal unit thickness in the z direction. The materials are in perfect contact. Any effects due to bonding or imperfect interfaces are ignored. The bottom plate is at constant temperature Tbot . The vertical boundaries are thermally isolated. Fluxes along the upper boundary are specied. Note that this is not an appropriate boundary condition if this is an air interface because heat will be actually dissipated by convection, which depends on the differences of temperature of the chip and ceramic matrix boundary from the air temperature. The boundary condition term for convection, however, is not provided in the functional given in Addendum A. The addition of such term is the subject of a Bonus Question. Radiation dissipation is neglected. The heat source in the chip material is taken to be constant over its volume. The heat sources in the other two materials are zero.
Table Q3.1 Geometric and physical properties for the electronic package heat conduction problem Properties Lengths Specied temperature Conductivity Heat body source Heat ux, top Heat ux, lateral Units mm C mW/mm/ C mW/mm3 mW/mm2 mW/mm2 Values In Figure Q3.2: a = 25, b = 10, c = 5, d = 3.75, e = 0.1 Chilling plate boundary AB and BC: Tbot = 20. Silicon: k = 150, copper: k = 400, ceramic: k = 40. Silicon: s = 16000, copper: s = 0, ceramic: s = 0. Over EF and FG: q n = 25; over GH: q n = 10. Over CD, DE and HA: q n = 0.
The problem has one line of symmetry. Using that feature the computational domain can be reduced to that shown in Figure Q3.2. The necessary geometric and physical properties are provided in Table Q3.1. Q33
y
1 2 D3 4 5 6 7
33 G
69 70 71
72 73 74
40
75
Figure Q3.3. Recommended FE mesh for Question 5. There is only one degree of freedom at each node n : the temperature u n .
All units are in the SI system. The boundary conditions are as follows. Over ABC the temperature is prescribed: u = Tbot , the chilling plate temperature. Over EF and FG the heat ux is specied to the value listed in Table Q3.1. Over GH, the heat ux is also specied to the value listed in Table Q3.1. Over CDE and HA, the heat ux is zero. Note that CDE is the symmetry line. Cell 13 of Notebook PlaneThermalFEM.nb contains a driver program for this problem using a very coarse mesh with 15 nodes and 8 elements. This mesh is depicted in a plot that appears under that cell when it is executed. To answer Question 5 you must use a ner idealization, such as the graded mesh depicted in Figure Q3.3. This has 75 nodes and 58 elements. You may use a ner mesh if so desired, but that shown in Figure Q3.3 is sufcient. As answer to this Question, provide: The computed temperatures u at the nodes, such as those shown in Figure A.5 for a demo problem. Mark or highlight where the highest temperature occurs and its value. The nodal forces f recovered from f = K u, such as those shown in Figure A.5 for a demo problem. A plot of the mesh showing element and node numbers, similar to that shown in Figure A.6(a) A contour plot of the temperature distribution, similar to those shown in Figure A.6(b,c). If you produce both a polygon plot and a band plot, pick one.
Bonus Question. Up to 6 pts, total may exceed 100. (Requires good knowledge of variational calculus, else dont even try it. Purely analytical: no computer work required.) Change the boundary conditions over EFGH (the air interface) to be of convection type. Over this boundary portion, mathematically called 3 , qn = (u Tair ) on
3,
(6)
where u is the (unknown) boundary temperature of the electronic package, Tair the given air (environment, ambient) temperature, and a convection coefcient. In applied math, this boundary condition is said to be mixed or of Robbins type. (a) Add an appropriate surface convective term (a surface integral over 3 ) to (A.3)(A.4) to account for this term. (b) Show that the Euler-Lagrange equations of this expanded functional yield (6) as natural BC. Q34
Here 2 is the Laplacian, u = u (x , y ) is a scalar unknown function, k a known constitutive coefcient that may be function of x and y , and s = s (x , y ) is a given source function. The actual body has a thickness h in the z direction; often this thickness is uniform and taken equal to unity. The Poisson partial differential equation (A.1) models many important problems in mathematical physics. Some of them are: steady-state heat conduction (the topic of this exam), St-Venant torsion of arbitrary cross sections, potential uid ow, linear acoustics, hydrostatics and electrostatics. The physical meaning of u (as well as of that of k and s ) depends on the application. In the heat conduction problem considered here, u is the temperature, k the coefcient of thermal conductivity, qn = k ( u / n ) the heat ux along a direction n and s the internal heat source density (heat produced per unit volume in the material).
2
n
1
Figure A.1. The problem domain for the 2D Poisson equation. To nish the problem specication, the Poisson equation (A.1) has to be complemented by boundary conditions (BC) on the domain boundary . The classical BC are of two types. Over a portion 1 of the domain boundary (distinguished by a dashed line in Figure A.1) the value of u is prescribed to be u ; for example u = 0 or u = 100. Over the complementary portion 2 the ux qn = k ( u / n ), where n is the exterior normal to , is prescribed to be q n . See sketch in Figure A.1. Mathematically: u (A.2) =q n on 2 . n The heat ux is considered positive if heat ows away from . In the mathematical literature the conditions on 1 and 2 are referred to as Dirichlet and Neumann boundary conditions, respectively. A third type of BC called mixed, which is appropriate for convective heat transfer interfaces (e.g., air-cooled electronics) is the topic of the Bonus Question. u=u on
1,
q n = k
Variational Formulation A variational form equivalent to (A.1)(A.2) is function u , and is the total energy functional = 0, where denotes variation with respect to the unknown (A.3)
kh
u x
u y
d ,
W (u ) =
shud
q n h u d ,
(A.4)
Q35
(a)
(b)
4 (x4 ,y4 )
3 (x3 ,y3)
y x
(e)
1 (x1 ,y1)
(e)
2 (x2 ,y2)
Figure A.2. (a) FEM discretization of the problem domain of Figure A.1 with quadrilateral elements; (b) an individual quadrilateral with 1,2,3,4 as local nodes. in which u = u on 1 is satised a priori, and h is the thickness in the z direction. With respect to this variational principle the Dirichlet BC u = u on 1 is essential, whereas the Neumann BC q n = k u / n on 2 is natural. Finite Element Discretization of Heat Conduction Functional The domain is discretized with 4-node bilinear-quadrilateral nite elements as sketched in Figure A.2(a). Functionals U and W specialize to the element level in the usual way: U =
e 1 2
kh
e
u x
u y
1 2
2 kh gx + g2 y d
e
1 2
kh gT g d
e
(A.5) (A.6)
We =
e
shud
q n h u d
in which gx = u / x and g y = u / y are the temperature gradients and gT = [ gx g y ]. Over a generic quadrilateral 1-2-3-4, depicted in Figure A.2(b), the temperature u is approximated by the bilinear iso-P interpolation: u1 u N4 ] 2 = Nue , u3 u4
u e = N1 u 1 + N2 u 2 + N3 u 3 + N4 u 4 = [ N1
N2
N3
(A.7)
where u 1 , u 2 , u 3 and u 4 are the node temperatures, and N1 , N2 , N3 and N4 are the usual iso-P shape functions for the 4-node quadrilateral given in Chapter 16; e.g., N1 (, ) = (1 )(1 )/4. Because the functional (A.3) of the thermal conduction problem has variational index one, the interpolation (A.7) can be shown to satisfy the requirements of continuity and completeness. The temperature gradients gx = u / x and g y = u / y are mathematically analogous to strains in mechanical problems. We call gT = [ gx g y ] the thermal gradient vector and the matrix B that relates g to the element node values u1 gx u / x N1 / x N2 / x N3 / x N4 / x u 2 g= = = = Bue , (A.8) u / y N1 / y N2 / y N3 / y N4 / y u 3 gy u4 the thermal-gradient-to-temperature matrix. To answer Questions 24, (A.5) and (A.6) must be maneuvered into the standard quadratic form e = Ue We = 1 (ue )T Ke ue (fe )T ue (A.9) 2 whence the rst variation
e
Q36
Here Ke is the 4 4 element stiffness matrix, which derives from the element internal energy U e , and fe is the element node force vector, which derives from the element external potential W e . A 2 2 Gauss integration rule is recommended to evaluate Ke . Rank Sufciency of Ke In the heat conduction problem the rank of Ke is still given by formula (19.6) with the following adjustments: (1) The number of DOFs per node is 1 (2) In 2D, the dimension of the constitutive matrix is 2 (it connects two temperature gradients to two uxes) (3) The number of rigid body modes is 1 The last one requires some clarication. A rigid body mode in this context is a a vector ue R of equal temperatures at each node. If the 4 node temperatures are equal, the whole element is at constant temperature. Postmultiplying Ke ue R = 0 because a constant temperature state produces no heat uxes: the gradients are zero. This is analogous to the denition of RBM in structures: postmultiplying Ke by a RBM evaluated at the nodes gives zero forces.
qn = 0
A 10
qn = 60 2
(heat flowing outward) thickness h = 1
C
3 (1) 5 (2) 4 6
y
B
k = 12 s=0
y x
2
x
u = 100 over AB
qn = 0
20
Figure A.3. A simple dam thermal conduction benchmark case: (a) problem denition, (b) FEM discretization with 5 nodes and 2 quadrilateral nite elements. With the properties and BCs shown in (a), the exact temperature distribution depends only on x and varies linearly from u = +100 on AB (x = 0) to u = 100 at node 6 (x = 20). This exact solution must be reproduced by any FEM mesh as long as the elements satisfy completeness. The input cell that denes and solves this sample problem is shown in Figure A4. The input is self-explanatory except possibly for ElemTypes ElementForces, FreedomTags and FreedomValues. ElemTypes should be set to "Quad4" for all elements. For processing, this is only a placeholder since this is the only element available in the Notebook. But it is required by the plotting programs. ElemForces is a list of length equal to the number of elements. Each entry of this list, for a specic element, is of the form {s,{q12,q23,q34,q41}}. Here s is the heat source, assumed constant over the element. Entry q12 is the The names stiffness matrix and force vector, which are standard in the FE literature for all applications, exploit the mathematical analogy with structural mechanics. In the heat conduction problem Ke is physically a heat reactance matrix whereas fe has dimensions of heat ux times volume.
Q37
(*
Define FE model *)
NodeCoordinates= N[{{0,10},{0,0},{10,10},{10,0},{15,5},{20,0}}]; ElemNodes={{1,2,4,3},{3,4,6,5}}; PrintPoissonNodeCoordinates[NodeCoordinates, "Node Coordinate Data",{8,4}]; numele=Length[ElemNodes]; numnod=Length[NodeCoordinates]; ElemTypes=Table["Quad4",{numele}]; ElemMaterial=Table[12,{numele}]; ElemFabrication=Table[1,{numele}]; ElemForces=Table[{0,{0,0,0,0}},{numele}]; ElemForces[[2]]={0,{0,0,N[60*Sqrt[2]],N[60*Sqrt[2]]}}; PrintPoissonElementNodesMatFab[ElemNodes,ElemMaterial, ElemFabrication,"Element Data",{9,4}]; PrintPoissonElementForces[ElemNodes,ElemForces, "Element Forces",{6,3}]; FreedomValues=FreedomTags=Table[0,{numnod}]; FreedomValues[[1]]=FreedomValues[[2]]=100; (* T @ 1,2*) FreedomTags[[1]]=FreedomTags[[2]]=1; (* prescribed T *) PrintPoissonFreedomActivity[FreedomTags,FreedomValues, "DOF Activity Data",{6,3}]; elepar={9,1.5,1,12,{0.15,1,1}}; nodpar={3.5,1.5,-8,5,12,{0.7,0.2,0.9}}; typspec={}; Plot2DMesh[NodeCoordinates,ElemTypes,ElemNodes,{},typspec, nodpar,elepar,{False,True,True,True,True},Automatic, "Plot of FEM Mesh"]; ProcessOptions={True}; (* Solve problem and print results *)
{u,f}=LinearSolutionOfPoissonModel[NodeCoordinates, ElemTypes,ElemNodes,ElemMaterial,ElemFabrication, ElemForces,FreedomTags,FreedomValues,ProcessOptions]; PrintPoissonNodeTempForces[u,f,"Computed Solution",{6,4}]; (* Contour plot temperature distribution: 2 plotters tested *) umax=Max[Abs[u]]; Nsub=8; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, u,umax,Nsub,1/2,"Computed Temp Dist: Polygon Plotter"]; ContourBandPlotNodeFuncOver2DMesh[NodeCoordinates, ElemNodes,u,{-umax,umax,umax/10},{True,False,False,False, False,False},{},1/2,"Computed Temp Dist: Band Plotter"];
Figure A4. Driver script for benchmark problem of Figure A.3. Available in Cell 12B of posted Notebook. specied ux q n over side 12 of the element (1 and 2 being the local node numbers); q23 is the specied ux over side 23 and so on. If the ux over an element side is unknown, a zero is entered. If the q list is completely omitted so only s appears, q12=q23=q34=q41=0 is assumed. Lists FreedomTags and FreedomValues are used to mark freedom BCs. Because there is only one DOF per node, these lists have a at, array-like, node-by-node conguration. The tag FreedomTags[[n]]=1 indicates that the temperature u at node n is prescribed, in which case its value is found in FreedomValues[[n]]. Else the tag is zero and FreedomValues[[n]] is ignored. Executing the above cell, upon being sure that Cells 1-11 of the Notebook have been initialized, should give the answers shown in Figure A.5 under the title Computed Solution. Observe that the computed temperatures at nodes 3, 4, 5 and 6 of the two-element mesh are 0, 0, 50 and 100, respectively, in accordance with the exact solution. The computed temperatures at 1 and 2 are 100, as expected since those are prescribed values. Graphic output is shown in Figure A6, which merges output from three different cells. Figure A.6(a) is the mesh plot produced by the call to module Plot2DEMesh. This is a recently written mesh plotter that replaced the old Plot2DElementsAndNodes. Arguments typspec, elepar and nodpar, as well as the string of logical ags, are used to control the conguration and appearance of the plot. Since these are still undocumented, the values shown for
Q38
DOF Activity Data node 1 2 3 4 5 6 DOF- tag 1 1 0 0 0 0 DOF- value 100.000 100.000 0.000 0.000 0.000 0.000 thermal- force 600.0000 600.0000 - 300.0000 0.0000 - 600.0000 - 300.0000
Computed Solution node 1 2 3 4 5 6 temperature 100.0000 100.0000 0.0000 0.0000 - 50.0000 - 100.0000
Required in Exam
Figure A5. Output from driver script of Figure A.4. Upper four tables echoprint input data, whereas the lower table gives the computed solution.
(a)
1 Plot of FEM Mesh 3
(b)
Comp Temp Dist: Polygon Plotter
(c)
Comp Temp Dist: Band Plotter
5 2 4 6
Figure A.6. Plot output from driver script of Figure A.4. elepar and nodpar in the script of Figure A4 represent reasonable choices. The call to the polygon potter ContourPlotNodeFuncOver2DMesh produces the contour plot of temperatures shown in Figure A.6(b). Here bright red corresponds to the highest temperature (+100 at nodes 1 and 2), bright blue corresponds to the lowest (100 at node 6) and white to zero temperature. The value-to-color mapping is obtained by linear interpolation over the red-to-blue RGB table, which is implemented in Mathematica by function RGBColor. This mapping cannot display as many intermediate colors as the band plotter described below. A second temperature contour plot, is shown in Figure A6(c). This one is produced by a band plotter which is invoked as ContourBandPlotNodeFunctionOver2DMesh, Here each color band is associated with certain tempearture values that range from red at the highest: +100, through white at zero, through blue at the lowest: 100. But unlike the polygonal plotter ContourPlotNodeFuncOver2DMesh here intermediate values are plotted using a richer value-tohue mapping that may range over all colors of the rainbow.
Q39
Introduction to FEM
Introduction to FEM
No consultation with others is permitted There have been reports of cheating in Aerospace graduate courses, so instructors will be extra careful in going over final exams
Introduction to FEM
c e
E D
2 3
AIO 2 ceramic matrix 2 copper channel b 3 silicon chip (Dimensions DE and FG not to scale in sketch)
F G
1
x
A
a = 25 mm b = 10 mm c = 5 mm d = 3.75 mm e = 0.1 mm
33 G
69 70 71
72 73 74
40
75
2
n
(a)
(b)
4 (x4 ,y4 )
3 (x3 ,y3)
1 (x1 ,y1)
x
(e)
(e)
2 (x2 ,y2)
qn = 0
A 10 D
qn = 60 2
(heat flowing outward) thickness h = 1
C
3 (1) 5 (2) 4 6
y
B
k = 12 s=0
y x
2
x
u = 100 over AB
qn = 0
20
{u,f}=LinearSolutionOfPoissonModel[NodeCoordinates, ElemTypes,ElemNodes,ElemMaterial,ElemFabrication, ElemForces,FreedomTags,FreedomValues,ProcessOptions]; PrintPoissonNodeTempForces[u,f,"Computed Solution",{6,4}]; (* Contour plot temperature distribution: 2 plotters tested *) umax=Max[Abs[u]]; Nsub=8; ContourPlotNodeFuncOver2DMesh[NodeCoordinates,ElemNodes, u,umax,Nsub,1/2,"Computed Temp Dist: Polygon Plotter"]; ContourBandPlotNodeFuncOver2DMesh[NodeCoordinates, ElemNodes,u,{-umax,umax,umax/10},{True,False,False,False, False,False},{},1/2,"Computed Temp Dist: Band Plotter"];
DOF Activity Data node 1 2 3 4 5 6 DOF- tag 1 1 0 0 0 0 DOF- value 100.000 100.000 0.000 0.000 0.000 0.000 thermal- force 600.0000 600.0000 - 300.0000 0.0000 - 600.0000 - 300.0000
Computed Solution node 1 2 3 4 5 6 temperature 100.0000 100.0000 0.0000 0.0000 - 50.0000 - 100.0000
Required in Exam
(a)
1 Plot of FEM Mesh 3
(b)
Comp Temp Dist: Polygon Plotter
(c)
Comp Temp Dist: Band Plotter
5 2 4 6