Nonlinear Processes in kngineering Dynamic Programming Invariant Imbedding Quasilinearization Finite Elements System Identification Optimization
Ikpnrlmcn ts of (’ivil Ilnginccring and Arrliitcrturc University of (hlifornia, Ikrkclcy
ACADEMIC PRESS New York and London A Subsidiary of Harcourt Bracc Jovanovich, I’tiblishcrs
1974
COPYRIGHT 6 1974,BY ACADEMIC PRESS,INC. ALL RIGHTS RESERVED. NO PART OF THIS PUBLICATION MAY BE REPRODUCED OR TRANSMITTED IN ANY FORM OR BY A N Y MEANS, ELECTRONIC OR MECHANICAL, INCLUDING PHOTOCOPY, RECORDING, OR ANY INFORMATION STORAGE AND RETRIEVAL SYSTEM, WITHOUT PERMISSION IN WRITING FROM THE PUBLISHER.
ACADEMIC PRESS, INC.
111 Fifth Avenue, New Ymk, New York 10003
United Kingdom Edition published by ACADEMIC PRESS, INC. (LONDON) LTD. 24/28 Oval Road. London NWl
Library of Congress Cataloging in Publication Data Distifano, Nistor. Nonlinear processes in engineering. (Mathematics in science and engineering, v. 110) Includes bibliographies. 2. Nonlinear theories. 1. Engineering mathematics. I. Title. 11. Series. TA33 1 .D57 620.1'001'5 15 73-7437 ISBN 0-12-218050-X AMS (MOS)1970 Subject Classifications: 731(99,77F99,73K25,65D15
PRINTED IN THE UNITED STATES OF
AMERICA
Contents
Preface
xv
Acknowledgments
xvii
Chapter 1. Invariant Imbedding 1. Introduction 2. An Elastic String 3. Classical Imbedding 4. Representation of the Solution 5. An Analytical Example 6. Variable Coefficients 7. Numerical Aspects, Stability 8. Invariant Imbedding 9. Discussion 10. Semigroup Properties 11. Reciprocity Relation 12. Computation of u l . A Two-Sweep Method vii
1 2 3 4 4
6 8 9 12 12 16 16
...
CONTENTS
Vlll
13. A One-Sweep Method 14. A Continuous Analog 15. An Infinite String on Elastic Foundation
16. Buckling. Classical Approach 17. Buckling. Invariant Imbedding
NOTES, COMMENTS, A N D BIBLIOGRAPHY
17 18 20 21 24 26
Chapter 2. Differential Equations I . Introduction 2. Vector-Matrix Notation 3. Systems of Ordinary Differential Equations 4. Linear Homogeneous Systems. Superposition 5 . Linear lnhomogeneous System 6. Variation of Parameters 7. Constant Coefficients 8. Higher-Order Equations 9. Discussion 10. Physical Systems. State Variables 11. Initial-Value Systems 12. Numerical Solutions 13. Stability of the Numerical Process 14. Two-Point-Value Problems 15. Linear Two-Point-Value Problems NOTES, COMMENTS, AND BIBLIOGRAPHY
29 29 32 34 35 36 37 37 38 39 40 41 42 43 44 45
Chapter 3. Beamlike Structures 1 . Introduction 2 . The Elementary Beam
3. Higher-Dimensional Mode& Cylindrical Shells 4. Semigroup Properties of Generalized Beams 5 . Invariant Imbedding. Perturbation Analysis 6 . Matrix Riccati Transformations 7. Validation of the Results 8. Discussion 9. A Two-Sweep Computational Method 10. Invariant Imbedding. A One-Sweep Method 1 1. Self-Adjoint Systems 12. Numerical Stability 13. General Two-Point Boundary Conditions 14. Difference Equations 15. Transfer Matrices
48 49 50 54 56 58 61 62 63 63 65 67 70 73 74
ix
CONTENTS
16. The Scattering Matrix 17. The Flexibility Matrix NOTES, COMMENTS, A N D BIBLIOGRAPHY
Chapter 4.
Partial Differential Equations I
1 . Introduction 2. Poisson’s Equation 3. Finite Elements 4. Difference Equations 5 . Solution of the Equations 6. Discussion 7. Semidiscretization. The Elastic Plate 8. A Stiffness Matrix 9. Prescribed Displacements at Opposite Edges 10. A Flexibility Matrix 11. Numerical Example 12. Buckling Problems. Critical Lengths NOTES, COMMENTS, A N D BIBLIOCRAI’HY
Chupter 5.
84 85 86 88 90 92 94 97 99
100 101
102 103
Partial Differential Equations I 1
1 . Introduction 2. Formulation of the Problem 3. Initial-Value Formulation 4. Reciprocity Relations 5 . Integral Riccati Transformations 6. Computational Aspects 7. Influence of Poisson’s Ratio 8. Invariant Imbedding Solution NOTES, COMMENTS, A N D BIBLIOGRAPHY
Chapter 6.
75 78 79
106 107 109 113 114 1 I6 117 119 121
Dynamic Programming
1 . Introduction 2 . A Linear String 3. The Principle of Optimality 4. An Analytical Solution 5 . Constraints 6. A Nonlinear String 7. A Routing Problem 8. A Continuous Analog 9. Euler Equations
123 124 125 126 128 128 130 133 135
CONTENTS
X
10. 11. 12. 13. 14. 15.
16. 17. 18. 19. 20. 21. 22. 23. 24.
25.
Convexity Numerical Aspects Discussion Partial Differential Equations The Biharmonic Equation Theorem of Castigliano Euler Equations Natural Boundary Conditions Solution of (14.17). Betti’s Theorem A Statically Indeterminate Structure The Theorem of Complementary Energy Linearity An Identification Problem The Error Measure A Numerical Example Discussion NOTES, COMMENTS, AND BIBLIOGRAPHY
137 139 141 142 144 146 147 148 148 149 152 152 155 156 157 158 159
Chapter 7. Quasilinearization 1. Introduction 2. Approximation in Policy Space 3. Quasilinearization 4. A Nonlinear Fredholm Operator 5. Successive Approximations-Monotonicity 6. Quadratic Convergence 7. Green’s Function 8. Beam on Nonlinear Foundation 9. Numerical Example 10. Lower and Upper Bounds 11. Nonlinear Systems 12. The Linear Associated Problem 13. Computational Aspects. Storage 14. An Alternative Quasilinearization Procedure 15. A Matrix Riccati Equation 16. A Parametric Design Problem NOTES, COMMENTS, AND BIBLIOGRAPY
161 162 164 166 169 170 171 173 177 179 181 183 184 185 185 187 189
Chapter 8. Elements of Optimal Structural Design 1. 2. 3. 4.
Introduction Objective Functions and Constraints Elastic Trusses Sufficiency. Prager’s Device
192 193 193 195
xi
CONTENTS
5. Discussion 6. Dual Loading 7. Kuhn-Tucker Conditions
8. Prescribed Displacements 9. Dual Loading in Statically Determinate Elastic Trusses Subject to Displacement Constraints 10. Beam Optimization 11. Sandwich Beams 12. Discussion 13. Example 14. Piecewise Continuous Stiffness 15. Prescribed Deflections 16. An Example 17. Rotating Disks NOTES, COMMENTS, AND BIBLIOGRAPHY
196 196 197 198 199 201 203 204 205 207 208 210
212
214
Chapter 9. Control Theory Introduction Dynamical Equations Control Variables. Objective Functionals Constraints A Control Problem 6. A Fundamental Equation 7. The Optimality Condition 8. Optimal Loading of a Creeping Bar Axially Stretched 9. Linear Dynamics and Quadratic Criterion 10. Smoothing, Filtering, and Prediction 11. Euler-Lagrange Equations 12. The Minimum Principle 13. Optimal Loading Policy for a Voigt Model 14. Optimal Design as a Control Process 15. Discussion 16. The Necessary Conditions 1. 2. 3. 4. 5.
NOTES, COMMENTS, AND BIBLIOGRAPHY
217 219 22 1 22 1 222 222 224 224 227 229 232 234 236 237 239 239 240
Chapter 10. Optimal Beam Design 1. Introduction
244
I. Dynamic Programming 2. Max-Min Optimization Problem 3. Dynamic Programming
245 246
C 0N TEN TS
xii 4. Constant Curvature 5. Euler-Lagrange Equations
6. Design Constraints. Successive Approximations 7. Numerical Example
249 250 251 253
11. Invariant Imbedding 8. Alternative Formulation 9. An Alternative Derivation of the Optimality Condition 10. Optimum Cantilever under Prescribed Displacement 11. Invariant Imbedding 12. A Two-Sweep Iterative Procedure 13. Inertia Forces 14. Stability Considerations 15. Numerical Examples NOTES, COMMENTS, AND BIBLIOGRAPHY
256 259 260 261 263 265 265 266 273
Chapter I I . Optimal Design of Rotating Disks 1. Introduction
276
I. Minimum Potential Energy 2. The Problem 3. Dynamic Programming 4. Numerical Aspects 5. Design Constraints. Successive Approximations 6. Equilibrium and Compatibility-Euler Equations
277 279 282 282 285
11. Prescribed Displacements 7. Optimization 8. Successive Approximations 9. Numerical Examples 10. Conclusions NO1 ES, COMMENTS, AND BIBLIOGRAPHY
286 290 292 296 296
Chapter I2A. Modeling and Identification of Hereditary Processes 1. 2. 3. 4. 5.
Introduction Modeling Aspects in Viscoelasticity Hereditary Processes Dissipation of Hereditary Effects Time-Invariant Processes
298 299 307 310 311
CONTENTS
6. Aging Processes 7. Bounds and Asymptotic Behavior 8. Asymptotic Stability of Linear Viscoelastic Structures 9. Aging Spring 10. Nonconstant Loading, Bounds 11. Almost Periodic Loading. Time Averages 12. Stochastic Aspects 13. Nonlinear Models. Generalities 14. System Identification 15. Formulation of the Identification Problem 16. Identifiability. Hidden Variables 17. An Alternative Formulation 18. Differential Approximation of Functions 19. Controlled Inputs. Discussion 20. Nonlinear Filtering and Sequential Identification NOTES, COMMENTS, AND BIBLIOGRAPHY
xiii 312 313 316 319 32 1 323 324 325 325 327 328 329 330 332 332 335
Chapter 12B. The Identification Problem in Viscoelasticity 1. Introduction 2. The Identification Problem 3. Quasilinearization 4. Computational Aspects 5. Computation of the Derivatives 6. Computation of the Convolutions 7. Prediction. Inversion of a Nonlinear Volterra Equation 8. Identification of Solid Polyurethane from General o-EData 9. Another Example: Low-Density Polyethylene 10. Discussion NOTES, COMMENTS, AND BIBLIOGRAPHY
Index
339 340 341 342 343 344 345 341 3 52 356 3 58 361
Preface
The advent of the digital computer deeply affected attitudes toward the formulation and solution of mathematical problems arising in engineering applications. Old and new mathematical ideas quickly combined to give rise to a host of powerful and sophisticated postcomputer methods that recognized the intrinsic features of the new computational device. With them, a new methodology for the modeling of physical phenomena started to develop. This bookis intended to be an introduction to a number of methods and techniques for the study of nonlinear processes, developed in this methodological framework. More specifically, it may be considered an introduction to the study of a class of dynamical processes in engineering, using modern notions of imbedding, control, and optimization. Although the presentation concentrates on engineering mechanics applications, many of the ideas and the methods may be easily applied to a broad class of engineering problems. This book is an outgrowth of courses on analytical techniques for design that the author has been teaching at Berkeley during the past five years. The title emphasizes the main theme of the book, i.e., the study of nonlinear processes in engineering applications. Nonlinearities enter into the description of engineering processes in a number of different ways. In some cases we observe the process through variables clearly related by nonlinear xv
xvi
PREFACE
relations. In this fashion we are naturally led to the formulation of nonlinear mathematical models. In other cases we may transform a linear mathematical model of a certain process into a nonlinear one by a suitable change of variables. There are many reasons we may wish to proceed in this direction. Computational advantages might be the principal motivation of these transformations. This is the main thrust in Chapters 1-5 and the reasons for the appearance of matrix and integral (nonlinear) Riccati equations as the pertinent models for the determination of quantities such as flexibilities, stiffnesses, etc., entering in studies of linear structural mechanics. In the remaining chapters of the book a variety of nonlinear processes are formulated and studied. It is not our intenr to examine critically other reasons for nonlinear behaviour. The reader will find in this task, if undertaken on his own, a most exciting and rewarding activity. However, we feel tempted to whisper, en passant, that it is in the areas of the major inverse problems in engineering, e.g., design, control, optimization, system identification, where he will find a most prolific and challenging source of nonlinear problems. We expect this book to be of value to graduate students, researchers, and professors. Many examples, problems, and exercises, presented as an integral part of the text, should facilitate the task of the instructor. A number of research exercises and abundant citing of the literature will hopefully assist graduate students starting research in the topics covered here.
Acknowledgments
I feel particularly indebted to Richard Bellman who inspired this book and to the University of California at Berkeley which, in so many ways, facilitated the completion of this work. Many sincere thanks to Edward Angel, Anil Jain, Estela Llinas, Amitav Rath, Avelino Samartin, Jaime Schujman, and Ricardo Todeschini who read parts of the manuscript and made invaluable suggestions. I am also grateful to Debbie Aoki and Pat Tifft who typed the manuscript in such a good spirit. Finally, I wish to acknowledge the following organizations for permission to reproduce the indicated tables and figures :Akademie-Verlag, Figures 12B.4, 12B.5 and 12B.6 and Tables 12B.3, 12B.4 and 12B.5; American Society of Civil Engineers, Table 4.1; Pergamon Press, Figures 10.2, 10.3, 10.4, 10.5, 12B.1, 12B.2, 12B.3 and Tables 10.2, 10.3, 12B.1 and 12B.2; Plenum Publishing Corporation, Figures 11.1, 11.2, 11.3, 11.4 and Table 11.1; The Franklin Institute, Figure 10.1 and Table 10.1; The Society of Rheology, Inc., for permission t o use data employed to prepare the numerical examples of Chapter 12B.
xvii
Chapter I
Invariant Imbedding
1. Introduction
The determination of configurations of equilibrium in structural mechanics usually leads to the consideration of boundary-value problems. Unfortunately, boundary-value problems cannot generally be solved directly by numerical methods, and therefore the analyst is forced to recast the problem in a manner suitable for handling by a digital computer. This can be accomplished by transforming the original boundary-value problem into an initial-value formulation for which many direct methods are available. This in turn is intimately related to the modeling of the mechanical process itself, for the reduction of boundary-value problems into stable initial-value ones by purely mathematical transformations is generally neither a trivial nor an easy task. The construction of alternative models of the mechanical boundaryvalue problem resulting in stable initial-value formulations is therefore highly desirable if a digital computer will be involved in the solution of the problem. A systematic study of these problems must deal with a number of sophisticated aspects of topology and group theory. In connection with several branches of mathematical physics, the theory of invariant imbedding has 1
2
I
INVARIANT IMBEDDING
recently emerged in an attempt to furnish answers to those fundamental questions. In this chapter, we start a systematic study of invariant imbedding in structural mechanics using a simple structural system to illustrate the application and constantly attempt to emphasize the conceptual rather than the formal aspects of the theory. 2. An Elastic String
To illustrate the basic ideas, we consider throughout this chapter, a simple structure, namely, an elastic string of length L stretched with a force S > 0, fixed at the ends, and resting on a number of equally spaced elastic springs. After deformation takes place, each node will undergo a vertical deflection ui; see Fig. 1-1.
i
i+l
Fig. 1-1
The classical way to formulate a mathematical model of this structure is by consideration of equilibrium and continuity around an internal, generic point i. Let ui be the slope of the string at the left of node i, i.e., (2.1) a quantity assumed to be small with respect to its square. We also assume that the stretching force S does not change with the deformation. Then, equilibrium of vertical forces around node i requires that vi
= (Ui - Ui-JZ,
+
s(ui+l - V i ) = -Pi k iu i , (2.2) where Piis the vertical external load and ki is the spring constant at node i. Since the string is assumed to be fixed at the ends, two additional conditions are provided by specifying the values of uo and uN . We recast Eqs. (2.1) and (2.2) in the form ‘ i = l , 2,..., N , ui = Ui- 1 h i , (2.3) i = 1,2, . , N - 1, u i + , = u i (ki/S)ui- Pi/S,
+
+
..
3
3. CLASSICAL IMBEDDING
and subject the end deflections to the specific conditions ug
=o,
UN
= c.
(2.4)
Equations (2.3) and (2.4) comprise a two-point boundary-value problem involving a system of difference equations. The existence and uniqueness of the solution of these equations can be established easily for all N when S and k, are positive. This in fact could be expected on physical grounds but, fortunately in this simple case, it can be made rigorous with little effort. See the exercises below. EXERCISES 1. Show that u l , i = 1, 2 , . . . , N - 1, given by Eqs. (2.3) and (2.4), satisfies the secondorder differenceequation U I -I
- (2
+ lkr/S)ul+ ui +
=
-IPJS,
i = 1,2, . . . ,N - 1,
(a)
subject to the end conditions uo = 0 and un = c. 2. Prove existence and uniqueness of the solution of system (2.3) and (2.4) for all N > 0 assuming that k I and S are positive. Hint: Use the second-order system of difference equations for ul given in the exercise above and show that the associated matrix possesses an inverse for all N. 3. Derive equations similar to (2.3) assuming that the springs are unequally spaced distances Ir , i = 1,2, . . . , N , and prove the proposition of Exercise 2. 4. Let
and lim ( P , / l )= p(x),
lim ( k I / l )= k(x).
I*O
1-0
Show that the limiting model that can be derived from Eqs. (2.3) and (2.4) is given by the differential system
and therefore u satisfies the second-order differential equation Su" - ku = - p , subject to the end conditions u(0) = 0, u(L)= c.
3. Classical Imbedding
We observe that the space of the solutions of Eqs. (2.3) and (2.4) is the set of all polygonals joining the endpoints uo and u N = c, i.e., all the admissible polygonals. See Fig. 1-2. We could, therefore, state our problem in the following way: Find an admissible polygonal that satisfies the equations
4
1
INVARIANT IMBEDDING
un=0
Fig. 1-2
of equilibrium (2.3). This is a classical idea that implicitly involves the notion of imbedding, i.e., the idea of generating a family of problems containing the original one as a particular member of the family. Boundary-value problems associated with difference-or differential-operators furnishing local conditions of compatibility and equilibrium offer typical examples of classical imbedding. As opposed to this classical concept, invariant imbedding offers an alternative model associated with different functional representations. Before entering into the discussion of these new models, we wish to refresh the memory of the reader in connection with the classical steps in the solution of our two-point boundary-value problems. 4. Representation of the Solution In view of the linearity of the equations, the general solution of (2.3) and (2.4) can be represented by ui = c,u{’) ~i
= C,V:’)
+ ~2 ui2), + vI”, ~2
i = 0,1, 2,
. ..,N ,
i = 1, 2, . . .,N ,
(4-1)
where u ! ’ ) ~u:’) and ui2), v!” are two arbitrary pairs of linearly independent solutions of Eqs. (2.3). Here we have considered the homogeneous case, i.e., P i = 0. Making use, of the boundary conditions (2.4), the constants c1 and c2 appearing in Eqs. (4.1) can be obtained as the solution of an algebraic system. This provides a very general method for the solution of twopoint boundary-value problems. Since this method primarily hinges on the availability of a set of linear independent solutions, we first concentrate on this aspect, and consider next the simplest case, i.e., constant coefficients. The subtleties of the numerical solution using this method are discussed in Section 7 in connection with problems of stability.
5. An Analytical Example Consider the homogeneous system with constant coefficients ui = ui-1
+ lv,,
v i + , = vi + (k/S)ui,
i = l , 2 ,..., N ,
.
i = 1,2, . . ,N - 1,
5
5. AN ANALYTICAL EXAMPLE
subject to the end conditions
=o,
c. (5.2) There is no difficulty in proving, by direct substitution, that Eqs. (5.1) and (5.2) admit solutions of the form uo
UN =
ui = Alai, vi = I , a i , (5.3) where 11,2, are arbitrary constants and c1 is a number, real or complex, that must satisfy the characteristic equation,
d e t l lklS -'
1 la -a
1
=0,
or u2 - (2
+ Ik/S)a + 1 = 0.
(5.4) Since Ik/S > 0, the roots of Eq. (5.4) are real and positive and such that one root is the inverse of the other. We call them r and l / r , respectively. Two corresponding characteristic vectors are given by
Hence, the general solution given by the representation (4.1) can be written
+
ui = clri c2 r - i , ui = cl(l - r-')i-'ri
+ c2(l - r)I-'r-i,
(5.6)
where the constants c1 and c2 must be determined using the boundary conditions (2.4), i.e., c = clrN + c2 r - N 0 = ~1 c2, (5.7) Hence
+
-C -N --N'
C
r
-N
-r"
(I - r - l ) r i - (1 - r ) r b i 0.= c, ( r N- r - N ) l
(5.9) i = 1, 2,. .
N - 1.
6
1 INVARIANT IMBEDDING
Clearly, u i ,u i given by Eqs. (5.9) are the unique solution of Eqs. (5.1) and (5.2). EXERCISES 1. Solve Eqs. (5.1) subject to end conditions u,, = 0, u N = c.
2. Solve the following nonhomogeneous equations u,=Ul-l$ul,
uIfl
= u,
+ ul + i,
u,=o uN = 0.
3. Show that the limiting form of the solution of problem 1 is u(x) =
sinh[(kS/)’/’x] (k/S)’” co~h[(k/S)~’~L] ”
v(x) =
cosh[(k/S)’lZx] co~h[(k/S)~’” ~L]
where L is the length of the string. 4. Show that the solution of the continuous analog of problem 2 is given by u = -x
+ L(sinh xlsinh L).
(4
6. Variable Coefficients The elegant analytical solution obtained in Section 5 owes its existence to our ability to obtain two independent solutions in closed form plus the possibility of explicitly solving the associated algebraic problem to determine c1 and c 2 . None of this will occur in the general case. Either we shall encounter larger and more involved algebraic problems or no explicit set of independent solutions will in general be available. The latter is particularly true when the general case of variable coefficients is considered. It is therefore convenient to abandon any hope of closed-form solution in terms of analytical functions in favor of a different, numerical approach. This can be easily done. Consider, for example, the homogeneous case with variable coefficients : ui = ui-1
ui+l
= vi
+ hi,
+ (ki/S)ui,
i = l , 2 ,..., N, i = 1,2, . . . , N - 1 ,
(6.1)
subject to the nonhomogeneous boundary conditions uo = 0,
U N = c.
(6.2)
It is clear that if instead of boundary conditions (6.2), we prescribe initial conditions, i e . , we give the values of uo and u l , then the sequence ui,ui can be recursively computed using Eqs. (6.1). Hence the determination of
7
EXERCISES
two independent solutions amounts to the solution of two linearly independent initial-value problems. This can be done, for example, by prescribing as initial conditions
MI'),
i.e., two linearly independent vectors. The solutions 0s') and uj2) obtained in this way are called principal solutions. The general solution of (6.1) can then be written as the linear combination, i.e., superposition, of the principal solutions,
+ c2 ui2), vi = c,vl') + c2 vj'),
ui = c,uI')
. .
i = 0,1, . .,N , i = 1,2, . . ,N.
(6.4)
Making use of the boundary conditions (6.2), we can easily determine cI and c2. In fact, combining Eqs. (6.2)-(6.4), we have c1 = 0,
+ c2up,
(6.5)
i = 0, 1, ..., N, i = l , 2 ,...,N.
(6.6)
c =c,up
Hence ui = (ui (2) /uN ( 2 ))c,
ui=(v,
(2,
(2)
/uN)c,
EXERCISES 1. Consider the nonhomogeneous difference equation ut+ 1
- (2 + Iktls)ut + UI+
1
=
+/WI.
(a)
Show that if u:') and u:') satisfy the associated homogeneous equation and the initial
conditions
then the general solution of Eq. (a) subject to boundary conditions u o = u N = O is given by
where A1 and A, are two arbitrary constants and ujp) is a particular solution of (a), subject to the initial conditions u$) = hi and u y ) = & . 2. Solve problem 1 by considering boundary conditions uo=O, u N = 1 and principal solutions u l l ) and u!') subject to the initial conditions @ = 1, u(l)
1
=o,
= 0, u(2)-.
1-11.
8
1 INVARIANT IMBEDDING
7. Numerical Aspects, Stability
The method of superposition of principal solutions presented in the last section exploits the linear structure of the problem and our ability to determine numerically linear independent solutions as the solution of initial-value problems. This is very convenient computationally, but unfortunately the method is severely handicapped by its intrinsic instability. What this entails is that any small error, inevitably introduced because of the limited accuracy of our computer, will grow in an exponential fashion and reach arbitrarily larger values provided the number of steps in the computation is large enough. To illustrate this point we consider the familiar second-order difference equation
ui+1 - (2
+ lk/S)ui + ui-1 = 0,
(7.1)
where IklS is a positive quantity, subject to the boundary conditions 240
=o,
(7.2)
U N = c.
Let us now assume that, by using two linearly independent solutions such as ri and r - i , where r a n d r - l are the two positive solutions of the associated characteristic equation
r z - (2 + Ik/S)r
+ 1 = 0,
(7.3)
we have determined the “missing” initial condition of Eq. (7.1), namely the quantity u1 given by
r - r-l NAr-N r
(7.4)
C.
Once u1 has been determined, our task is to compute u irecursively in Eq. (7.1) by using the given initial value uo = 0 and the previously computed value of u1 given by (7.4). We wish to investigate now the effect of a small error introduced in the computation of ul. To this end we subject (7.1) to the initial conditions r - r-’ uo = 0, 241 = c E, (7.5) r -r-N
+
where E is a small quantity. We leave as an exercise for the reader to show that u isatisfying (7.1) and (7.5) is given by ri - r - i ri - r - i u’. = r * - r - N C+- r - r - 1 E. (7.6) It is clear now that the error term, no matter how small E is, will reach any prescribed value for i large enough. The dominant solution is ri, if r > 1, and
9
8. INVARIANT IMBEDDING
r-i, if r < 1. We shall be concerned with a number of stability problems of this type in subsequent applications. Here they are only mentioned as a valid reason to seek alternative methods of solution. EXERCISES 1. Derive Eqs. (7.4) and (7.6).
+
+ +
2. Assume 2 lk/S = 10.1 in Eq. (7.1). Show that if i > K L 1 and E term [(r' - r-')/(r - r - ' ) ] s in Eq. (7.6) will be larger than loL.
=
the error
8. Invariant Imbedding
In Section 3 we have shown that the notion of solution cannot be separated from the imbedding used in the formulation of the problem. In other words, a particular imbedding automatically defines the space of the solutions. It is therefore understandable that different questions relevant to a given mechanical system should be studied in different solution spaces. This is a very convenient conceptual framework which is the ruison d'ttre of invariant imbedding. A number of meaningful and interesting questions associated with modeIing and perturbations of the mathematical structure of mechanical processes can be systematically studied by exploiting the notion of imbedding. In order to illustrate the basic ideas, we return once more to the example used in previous sections. We consider here a homogeneous string, i.e., with no external loading acting on it, fixed at the left end, uo = 0, and subject it to a vertical deflection, uN = 1, at the right end. Our problem is to determine the vertical component of the string at node N or, in other words, we are interested in the slope v,. Clearly one way to treat this problem is by solving the resulting boundary-value problem along with the classical lines outlined in previous sections. We realize, however, that this procedure would imply the computation of the whole sequence ul, u 2 , ... , u ~ - ~ , ul, u 2 , . .., u,, in order to obtain the desired value of u N . A more direct answer should be obtained if we imbed our problem in an appropriate space. Quite arbitrarily at this point, we consider the family of strings with variable length J I N and subject it to a vertical deflection u, = c at the right end. Assuming the problem to be linear, we consider the slope u, given by the linear homogeneous expression
where Z, is a quantity depending on the length J but not on the deflection u J . We realize that the particular member of this family corresponding to J = N and uN = 1, i.e., Z,, is the desired value of the slope v N .It is worth
10
1
INVARIANT IMBEDDING
noting that formulated in this fashion, 2, turns out to be a “stiffness” in the parlance of structural engineering since it transforms (by multiplication) deflections into forces. In order to find an equation for Z , , we consider a perturbation with respect to the spatial variable J, a technique at the very basis of invariant imbedding. To this end, we consider an extension of one link as indicated = 1. in Fig. 1-3. With no loss in generality, we can assume that J-I
E
J
.t
J+I
Fig. 1-3
We define V- = vertical forces at the left of node J , V , = vertical forces at the right of node J .
Taking into account Eq. (8.1), we have
v+ = SVJ+1= SZJ+1,
(8.2)
V- = S V= ~ SZj U J = SZj( 1 - lZj+i).
(8.3)
and
An equilibrium equation is finally obtained by making the balance of vertical forces V+ = V-
+ kJ(l - fzj+l)
(8.4)
or, substituting V - and V , given by Eqs. (8.2) and (8.3) into Eq. (8.4), ZJ + 1
= (2,
+ k J / W - G+
117
(8.5)
from which we derive
a recurrence equation for the quantity 2, subject to the initial condition 2, = 111.
(8.7)
What is remarkable about Eq. (8.6) is that it is afirst-order nonlinear difference equation subject to the initial condition (8.7) in contrast with the
11
EXERCISES
system of linear difference equations (6.1) subject to two-point boundary condition (6.2). We wish to prove now that the quantities 2, computed recursively with Eqs. (8.6) and (8.7) are stable, i.e., that a small error introduced in step J will not grow larger in subsequent steps. To this end, let be the approximate value of Z , given by
z,
z,=z,
(8.8)
+EJ,
,
,
where E is the error at step J . The quantity Z satisfies the recurrent relation
k,/S + Z, z,+, = 1 + I(k,/S + Z,)’ -
=Z Therefore, since E, using (8.Q we obtain
,
+1
- Z , +1, by subtracting (8.6) from (8.9) and
+ + + +
kj/S Zj 1 /(kj/S Zj
+
EJ+1=
-
EJ
Ej)
k f / S + zJ 1 I(kj/S Zj)’
+
+
(8.10)
i.e., an equation relating the error in two consecutive steps. Assuming that E~ is small, Eq. (8.10) may be conveniently linearized in E, furnishing, after some transformation,
+ ZJ2E, = 1 + l ( k J / s+ Z J )- [I 4kJlS + f ( k J / Si-2,)12’ EJ
Eft1
an approximate equation for the error which in turn may be reduced to the more convenient one
(8.1 1) from which we may readily show that IEJ+ll
5
IEJl,
(8.12)
since the denominator in (8.1 1) is a quantity always greater than one. Clearly, (8.12) establishes the required property. EXERCISES 1. Instead of boundary conditions uo = 0 and uN = 1, consider uo = 0 and uN = 1. Using a procedure similar to that employed in this section, find a recursive equation for Rj in the equation uj=Rj~j. 2. Show that Rj
= 2;
’.
(a)
12
1 INVARIANT IMBEDDING
9. Discussion In the previous section we presented a different approach to the study of the equilibrium of an elastic string. Here the imbedding was quite different to that used in classical mechanics. It is similar to that introduced by R. Bellman in the study of transport processes and radiative transfer, and it is called invariant imbedding. In the following sections we enlarge and refine the notion of this kind of imbedding by considering a number of illustrative applications. Historical and general references are in the Bibliography at the end of the chapter. 10. Semigroup Properties
The solution obtained in Section 8 is a particular version of a more general result. In fact, we can use invariant imbedding ideas to derive semigroup relations that in turn will furnish a number of useful results. Consider, for example, a string of length N where at the ends we prescribe the values of the deflection uN and the initial slope q.Our objective will be, first, the determination of the missing boundary conditions, i.e., the values of vN and uo . If we admit existence and uniqueness of these values, they must be determined as functions of the data values u1 and u N .In formulas this fact can be expressed (10.1) UN =Z ( ~ N u1, , N), U o = T(uN 01 N ) . 9
9
Considering now the portion of the string between i = 0 and i = J , we can write (see Fig. 1-4) uJ
= z(uJ
5
vl,
J),
UO
= T(uJ9
J),
ul,
(10.2)
Fig. 1-4
and, similarly, considering the remaining portion of the string between i =J a n d i = N , uN=Z(UN,
u J + ~N, - J ) ,
U J = T ( U Nu, J + ~N, - J ) .
(10.3)
The intuitive results given by (10.2) and (10.3), derived from invariant imbedding considerations, express some semigroup relations. To see this
13
10. SEMIGROUP PROPERTIES
it is enough to consider first uN given by the first equation of (10.3) and uo given by the second equation of (10.2), i.e.,
and the values of
U,
and
v J + 1 given
(a)
uO=T(uJ?ul,J),
uN=Z(uN,uJ+l,N-J),
by
uJ = R(T(uN VJ + 1 = s(z(uN
9
ul,
N), u l , J ) ,
9
Ul?
N ) , uN J ) ?
(b)
9
obtained from solving for uJ and u J + l in the second equation appearing in (10.2) and the first equation in (10.3), respectively, where u,, and uN were eliminated using (10.1). Clearly, Eqs. (a) and (b) are the desired semigroup relations associated with the original boundary-value problem. In other words, they provide the missing boundary conditions uN and uo in terms of the state variables U, and vr+ of the system at an intermediate point J . We discuss more general semigroup properties in Chapter 3, in connection with nonlinear two-pointvalue systems. Our aim at present is to use (10.1)-(10.3) in the context of linear problems. To this end, if linearity is postulated, Eqs. (10.1)-(10.3) will be linear expressions of the deflections and slopes, the coefficients of proportionality being functions of the length of the string. For example, Eqs. (10.1)-(10.3) will read uN = Z l l ( N ) u N uO
=Z21(N)UN
+ Z12(N)u1 + wl(N),
(10.4)
+ Z22(N)u1 + w2(N),
(10.5) uN = Z11(N - J)uN
uJ = Z 2 1 ( N - J ) u N
+ Z12(N - JkJ+l+ w l ( N - 4, +Z22(N-J)uJ+1 + w2(N - J ) ,
(10.6)
, 2 2 ,w l , and w2 are functions of the string respectively, where Z , , , Z , , , Z Z l Z length but do not depend on the deflections and slopes. We shall use limiting forms of Eqs. (10.5) and (10.6) to derive recurrence relations for the Z and the w functions. Consider, for example, J = N - 1 in Eqs. (10.5). Subtraction of (10.5) from (10.4) yields uN-vN-l
=Zll(N)uN-Zll(N-
l b N - 1 +(Z12(N)-Z12(N-
+ w , ( N ) - w,(N - 11,
= Z21(N)uN
- Z21(N
-
l h N - 1
+ w , ( N ) - w2(N - 1).
+ (Z22(N)
l))ul
- Z22(N -
(10.7)
14
1 INVARIANT IMBEDDING
Equilibrium at node N - 1 requires that ON - v N - l
(10.8)
=(k~V-l/~)uN-l -PN-l/s,
where vN must satisfy the continuity relation UN
= UN-1
+ IvN
(10.9)
Substituting the values of vN - vN-l and uN given by Eqs. (10.8) and (10.9) respectively, into Eqs. (10.7) and collecting terms in UN-1 and ul, the following equations for Z i j, i, j = 1,2, and w 1 and w2 are found : (10.10)
(10.12) Z,,(N) = Zzz(N - 1) - G ( N ) Z l , ( N - 11, w,(N) = (wl(N - 1) 2PN-1/s)(l
w,(N) = wz(N - 1)
(10.13)
- IZ11(N - I)),
(10.14)
+ Z,,(N)w,(N - 1).
(10.15)
These equations must hold for N = 1, 2, . . . , i.e., for strings of various lengths. In particular, the string of length N = 1 yields the obvious initial conditions Zll(1) = 0, Z120) = 1, ZZl(1) = 1, Z Z Z ( 1 ) = 0, w,(l) = W,(l) = 0.
(10.16)
The recurrence relations (10.10)-(10.15) can be made simultaneous by substituting Z,,(N), Z 2 , ( N )appearing in Eqs. (lO.ll), (10.13), and (10.15) with the values given by Eqs. (10.10) and (10.12), respectively, yielding Zll(l) = 0, (10.17) Zlz(l) = 1, (10.18) &(l)
=
1, (10.19)
15
EXERCISES
Wl(1) = 0, (10.21)
a set of simultaneous Riccati difference equations subject to initial values. Similar recurrence relations can be obtained as limiting forms of Eqs. (10.6). See the exercises at the end of the section. It is worth noting that Eq. (10.17) is uncoupled from the rest of the system (10.18)-(10.22). This was already found in Section 8 where a direct procedure to derive an equation for Z, in the equation V, = Z,U, was developed. We notice that the recurrence relations (8.6) and (10.1") are the same, but the quantities defined by them have different initial conditions. The reason for this is that in the problem of Section 8 we prescribed the deflection u o , whereas in Section 10 we prescribed the initial slope ul. EXERCISES 1. Instead of Eqs. (10.4), consider
and find recurrence relations for the R's and x's. 2. Show that R l z ( N )= R Z 1 ( N ) . 3. Show that R i i ( N ) = Zi;(N),
(b)
where Z 1, ( N ) is given by Eq. (10.17). 4. Show that if kNis a positive constant k , and S > 0, then ZL1(N) in Eq. (10.17) is bounded and has a limit as N + 00. 5. Show that
Z = lim Zll(N) N-W
is the positive root of the algebraic equation
IZz
+ I(k/S)Z - k / S = 0.
(d)
6. The statically indeterminate moments Ml at the supports i = 1,2, . . . , N - 1 of a continuous beam of N spans of equal length, loaded with a unit moment at node i = 0, satisfy the second-order difference equations
+
Mi-1 4Mt f Mi+1 = 0,
(4
subject to boundary conditions MO=l,
MN=O.
(f)
16
1 INVARIANT IMBEDDING
Clearly, if MI were known,Eq. (e) could be solved recursively, M2 = -1 Show that Mi admits a solution of the form
M f + *= T i M i ,
i = O , 1,2,
..., N-
- 4Mi, , .. .
1,
(g)
and find the recurrence relation for the Tf’s. 7. What is the value of M I as N co ? 8. Using Eqs. (10.4) and (10.6), derive the pertinent equations for the quantities Zi1(N) and wf(N),i = 1,2.
11. Reciprocity Relation Inspection of Eqs. (10.18) and (10.19) shows that z12
= 221,
(11.1)
a symmetry relation. If we regard u1 and uN as quantities proportional to the vertical components of the forces acting along the displacements u,, and uN , respectively, then conservation of energy will demand the symmetry of the cross quantities in Eqs. (10.4). In other words, Eq. (11.1) is the equation of reciprocity of Maxwell derived from invariant imbedding considerations. 12. Computation of ui,i = 0, 1, 2,
. , . , N - 1. A Two-Sweep Method
Once the Zij(N), i, j = 1,2, and w,(N), w2(N) have been computed, Eqs. (10.4) yield the “missing” boundaryconditions vN and uo . If in addition, to this information, the value of all the deflections ui,i = 0, 1, . .. ,N - 1 is required, we can proceed as follows. (To fix ideas assume u N = 1.) Substituting u, given by Eq. (10.5) in the continuity equation uJ = u ~ - ~ hJ,we obtain
+
UJ-1
= (1
- lzI,(J))uJ - lz1Z(J)vl - Iw,(J),
uN =
1,
(12.1)
a backward recurrence equation for the deflections at the interior points i = 0, 1,2, . ..,N - 1. We note that (1 2.1) is a backward recurrence relation in contrast to Eqs. (10.16)-(10.22), which provide Zij(N), i, j = 1,2, and w,(N), w,(N) in the forward direction. The combination of Eqs. (10.13,
17
13. A ONE-SWEEP METHOD
(10.21), and (12.1) to compute the deflections is therefore a two-sweep procedure. In practice, it will generally require the storage in core of all the quantities computed in the first sweep, i.e., the 2 ’ s and the w’s.
13. A One-Sweep Method The two-sweep method outlined in the last section is particularly remarkable in that it furnishes all the deflections in a sequential fashion. However, when not all of this information is needed, for example, if only the deflection at the center is desired, then a more direct procedure can be developed. In fact, invariant imbedding leads naturally to the formulation of a onesweep method that proves to be efficient when only partial information is needed. We shall illustrate the method with an example. Let, for instance, u, for a particular value of J < N be required. Then from the linearity of the problem we can establish that UJ
+
= ri(J, NUN rz(J, N)o,
+ x(J, N ) ,
(13.1)
i.e., the deflection at a point J is a linear combination of the data values uN and ui, the coefficients of proportionality being functions not only of the length N of the string but also of the point J under consideration. The perturbation technique used in Section 10, i.e., consideration of the reduced string of length N - 1, yields the equation UJ
= ri(Jy N
- 1 ) ~ N - l + rz(J, N - I)o,
+ x(J, N - 1).
(13.2)
Subtracting (13.2) from (13.1), substituting uN with the value given by Eq. (10.9), eliminating uNdl and U, in the resulting equations [using (10.4) and (10.8)], and collecting terms in u,-, and ulY we finally obtain the following recurrence relations : r1(J,
N)=
ri(J9
1
N
- 1)
+ l(Z,,(N - 1) + kN-1/S)’
subject to the obvious initial conditions, rl(JyJ ) = 1,
r2(J, J> = 0,
x(J, J ) = 0.
(13.4)
Naturally, functions rl(J, N ) , rz(J, A’),and x(J, N ) are not defined for N < J.
18
1 INVARIANT IMBEDDING
Thus, the one-sweep method consists of the sequential computation of Zij(N),i, j = 1,2,and w,(N), w2(N), using the forward equations (10.17)(10.22)from N = 1 to N = J. At that point, we introduce the system (13.3) subject to the initial conditions (13.4)and proceed with the computation until N reaches the desired value. Clearly r,(J, N), rz(J, N ) , and x(J, N) computed in this way and substituted into Eq. (13.1)yield the value of uJ. EXERCISES
1. Let VJ
= ll(J, N)uN
+
fZ(J,
N)ol
+ y(J, N),
J _< N .
(a)
Using the same method employed in this section, derive recurrence relations for t l ( J , N ) , tz(J, N),and y(J, N).What are the initial conditions of those relations?
2. Develop a one-sweep method for the computation of M,,j < N,in Exercise 6 of See tion 10.
14. A Continuous Analog
It is not difficult to construct a continuous analog of the results derived in Section 10. A continuous version of the equation of equilibrium (2.3) is duldx = V ,
S dvldx
= k(x)u
- P(x),
(14.1)
where u, u, k, and p are the limiting quantities of u i , u i , ki , and p i , when the distance I between springs tends to zero. Assuming the string to be of length L and subjected to the same end conditions of Section 10, i.e., u(L) and u(0) prescribed, we seek solutions of the form
+ z, z(L)v(O) + w , m ,
=Zll(~)U(L)
(14.2)
u(0) = Z21(L)4L) + Z 2 , ( ~ ) 4 0 + ) wz(0,
a continuous version of (10.4). Clearly, perturbation with respect to the length of the interval L can be achieved in the continuous case by differentiation. In fact, taking derivatives with respect to L in (14.2), we obtain
+
+ +
+
v’(L) = 2;,(L)u(L) 2,,(L)u’(L) z;,(L)V(O) w,yL), 0 = z;,(L)u(L) + Z,,(L)u’(L) z;,(L)v(o) + wz’(L),
(14.3)
where a prime indicates derivative with respect to the length of the string. Clearly (14.3)is the analog of Eq. (10.7). Substituting the derivatives by the values given by the equilibrium equation (14.l), and collecting terms common in the boundary conditions v(0) and u(L), we finally obtain Z;, =k/S-Z:,, Wlf
Z ; , = -Z11Z12,
= p / s - Z,,Wl,
Zj’,
W2) = - z 1 2
=
w,,
-Z;2,
(1 4.4)
19
EXERCISES
a system of Riccati differential equations subject to the initial conditions
z , m = 1,
Z,,(O) = 0,
W,(O) = W Z ( 0 )
zzm = 0,
= 0,
(14.5)
and where Z,,(L) = Z,,(L) as was expected. EXERCISES 1. Show that u in Eq. (14.1) satisfies the second-order differential equation
SU"- ku = - p . 2. Show that if
u
(a)
satisfies Eq. (a) in problem 1, then Z. w and R , x in the equations
+ u(L) = R(L)u'(L) + x(L),
u'(L) = Z(L)U(L) w(L),
(b) (4
satisfy the Riccati differential equations Z ( L ) = k(L)/S - ZZ(L),
(dl
w'(L) = - p(L)/S - Z(L)w(L),
(4
and R'(L) == 1
- (k(L)/S')R'(L),
respectively. 3. Show that Z(L) = R-'(L) and w(L) = Z(L)x(L). 4. If Eqs. (f) and (g) in Exercise 2 are subject to the initial conditions R(0) = 0 and x(0) = 0, show that Z and w in Eqs. (d) and (e) satisfy the following asymptotic properties:
lirn Z(L) = 1/L,
lim w(L) = L.
L-t 0
L-0 0
5. Let u(x, L), x S L, be given by u(x, L) = Sl(X, L)u(L)
+
SAX,
LMO)
+ Ax, L),
x IL.
Show that sI(x, L), sz(x, L), and y(x, L ) satisfy the differential equations
dsdx, L)IdL = -S1(X, L)Zll(L), L)Z,,(L), d Y k N d L = -s1(x, L)WdL)),
d d x , LYdL = --SI(X,
where Z 1l(L), Z l z ( t ) ,and w l ( L ) in Eqs. (i) are given by Eqs. (14.4)and (14.5), subject to the initial conditions Sl(X,
x ) = 1,
SZ(X,
x) = 0,
y(x. x) = 0.
(j)
6. Show that Eqs. (i) and (j) of the preceding exercise are limiting forms of Eqs. (13.3) and (13.4) as the distance I between springs tends to zero.
20
1
INVARIANT IMBEDDING
7. Consider the Riccati differential equation
Z' = K - Zz,
Z(0) = 0,
where K is a positive quantity. Show that Z is stable with respect to small perturbations in the initial conditions. Hint: First prove that Z is positive and uniformly bounded. Then consider the behavior of the approximate differential equation
6 z = -2282,
(1)
for the perturbation term 62.
15. An Infinite String on Elastic Foundation
We consider now the problem of determining the deflection under a concentrated load 2P of an infinite string resting on a uniform foundation.
Fig. 1-5
To this end we first consider the finite string of length 2L (Fig. 1-5). We set
u(L)= W M L ) ,
(15.1)
where v(L)is related to the vertical load by means of (15.2)
V(L) =P/S,
S being the axial force in the string. Now, if the foundation coefficient k is constant and L is large enough, a small increment in the length of the string will not result in a variation of the compliance R in Eq. (15.1). Therefore we can write
u(L
+ A) z R(L)v(L+ A).
(15.3)
Combining (1 5.1) and (1 5.3) we obtain
u(L + A) - u(L)= R(L)[v(L+ A)
- u(L)],
L large.
(15.4)
Retaining only linear terms of a Taylor's expansion of u(L + A) and v(L + A) in (15.4), and using the equilibrium equations U' = 0,
V' = (k/S)u,
(15.5)
we find 1 - (k/S)R2= 0,
(15.6)
16. BUCKLING. CLASSICAL APPROACH
21
an algebraic equation for R, the limiting value of R(L). Of course, we could have derived (1 5.6) directly from the asymptotic behavior of the Riccati equation (15.7) R’(L) = 1 - (k/S)R2(L). Combining (15.1 .), (1 5.2), and (15.6) we obtain u = (P/S)(S/k)”2,
(15.8)
the desired asymptotic deflection. The simplicity of this result is emphasized by the algebraic character of Eq. (15.6), from which this originated. The connection between the algebraic problem (1 5.6) and the differential equation (15.7) is the basis for a number of gradient methods for solving nonlinear equations. As the reader possibly suspects at this point, (15.7) is not the only differential equation whose asymptotic behavior tends to the solution of (15.6). In general we can use
R‘ = F[1 - ( k / S ) R Z ] , where F is a function introduced to accelerate the convergence. The same procedure can in general be used to solve more general functional equations. EXERCISES 1. In the problem of the infinite string considered above, how would you proceed to compute the deffection u(z) at a distance z of the concentrated load P? If necessary, use the value u(0) given by (15.8). Prove the stability of the proposed method 2. Formulate the solution of (15.6) by Newton’s method.
16. Buckling. Classical Approach Before closing this chapter we wish to present an example in which the lack of uniqueness plays the major role. As it is well known, examples of this kind in the context of structural mechanics are elegantly furnished by the elementary theory of buckling. This in turn will provide us with an example to compare the classical and the invariant imbedding approach in the realm of characteristic value problems. Consider the chain of rigid bars of length 1 supported on springs with elastic coefficients ki> 0 and subject to a compressive axial load S < 0. The ends are assumed to be fixed in the lateral direction as indicated in Fig. 1-6. We consider first the classical version of the problem. To this end we
s-~T~”-’ Fig, 1-6
22
1
INVARIANT IMBEDDING
write the equilibrium equations in the form U, - 1
- (2 + Ik,/S)u, + U, + 1 = 0.
(16.1)
Clearly, (16.1) follows directly from the equilibrium equations of the elastic string, by making the lateral loads P, = 0 and by eliminating the slopes u, between the two equations of (2.3). The present problem of buckling can now be mathematically formulated as the problem of finding a nontrivial solution u, # 0, n = 1, 2, . . . ,N - 1, to Eq. (16.1) subject to the fixed end conditions ug
(16.2)
= u N = 0.
In order to examine this matter in more detail it is convenient to write Eqs. (16.1) and (16.2) in the matrix-vector form
TU= -(I/S)Ku,
(16.3)
where u is the ( N - 1)-dimensional vector
(16.4)
u =
K is the diagonal matrix
(16.5)
and T is the ( N - 1)-dimensional Jacobi matrix
(1 6.6)
The homogeneous system (16.3) possesses the unique solution u, = 0, n = 1, 2, . .., N - 1, if and only if the associated matrix T (I/S)K is nonsingular. This is the case when S 2 0, i.e., when the chain is subject to a
+
23
EXERCISES
tensile axial force or to no force at all. We leave to the reader the exercise of proving that for S 2 0, T + (1/S)K is positive definite, thus having an inverse. However, when S < 0, we cannot ensure that this property will hold. In fact, there will be values of S < 0 for which the system (16.3) will have infinite solutions, in addition to the trivial one u, = 0, n = 1,2, .., N - 1. This will occur for those values of S for which the characteristic equation
.
det[T
+ (1/S)K]= 0
(16.7)
is satisfied. The minimum absolute value of S satisfying (16.7) is known as the Euler critical load. Higher characteristic values are associated with higher order buckling configurations. When k , = k , = . * . = kN-l= k , Eq. (16.7) reduces to det[T
+ (l/S)klZ]= 0,
(16.8)
a characteristic equation that can be solved in closed form. See the exercises below. In general, the solution of (16.7) will be obtained employing numerical procedures. EXERCISES 1. Show that if kI = k 1 = .* . written in the form
=kN- 1 =k
> 0, the general solution of (16.1) may be
u. = cI sinh na
+ cl cosh na,
(a)
where a is a number, real or complex, that satisfies the characteristic equation cosh a = 1
+ lk/2S,
(b)
and where cl, c2 are arbitrary constants.
2. If uo = 0, then c2 = 0. Thus Eq. (a) reduces to u. = c1 sinh na.
(4
Show that the minimum absolute value of S [from Eq. (b)], such that uN = c1 sinh Na = 0, is given by
3. Using the determinantal condition (16.8) show that the characteristic values are given by
s.=
-
3lk
1
+ cos ( n a / N ) ’
n = 1,2, . . .,N
-
24
1
Hint: Set 1
INVARIANT IMBEDDING
+
k1/2S = cos y in (16.8), expand the determinant about the first row, and study the resulting difference equation. 4. What is the buckling load when N + co?
17. Buckling. Invariant Imbedding
We look now at the same problem from an invariant imbedding point of view. As usual we imbed the problem in terms of length. In particular, we consider the chain of n 1 links fixed at n = 0 as indicated in Fig. 1-7.
+
Fig. 1-7
The displacements must satisfy the equilibrium equations and end condition ~,-1
+
- (2 + Ikn/S)un
~ , += l 0,
UO
= 0.
(17.1)
We seek solutions of the type un+1 = R n U n .
(17.2)
Combining (17.1) and (17.2) for n = 1, we readily obtain
R, = 2 +- IkJS,
(17.3)
R, = 2 + lk,lS - R,=',,
(1 7.4)
and for n # 1,
a recurrence relation for the quantities R, subject to the initial condition (17.3). Now consider the chain of two links. According to (17.2), when R, = 0, for any value of u1 we have u2 = 0. In other words, R, = 0 furnishes the buckling condition for a chain of two links. Similarly, the buckling condition for a chain of n + 1 links fixed at the two ends is provided by R, = 0. We can make use of this condition in a number of ways. We note, however, that Eq. (17.4) is particularly well adapted to determine the so-called critical lengths. In fact, starting with a value 1 So1 < #,I, i.e., below the critical load for n = 1, we compute the sequence R 2 ,R , ,.. . ,using (17.4) and record the values n, < n2 < . . * for which R, changes the sign, i.e., when sign R,,# sign R,+ n i .
(17.5)
25
EXERCISES
+
We agree to call the numbers 1 n, the critical lengths of the chain. Let N be the smallest critical length associated with an axial load So, i.e., O,
RN(SO)
> 0.
RN+I(SO)
If RN(SO)= 0, So is the critical load associated with the chain of length N + 1. If R N ( S O< ) 0, [ SoI is clearly a lower bound. To compute the critical load I S* I > I So1, we can proceed in several ways. A direct procedure consists in computing R,, n = 1, 2, . . . , N , by means of (17.3) and (17.4) using increasingly large values of I SI such as S , = So i AS, where A S is an appropriate increment of the load, until R , = 0. Other procedures are discussed in the following chapters.
+
EXERCISES 1. Show that the critical loads of a chain of n
+ 1 links are given by the roots of the equation
0 = K,,(S) -
where K,(S) = 2
+ iki/S.
+
2. Consider the chain of N 1 links shown in the figure, subject to a compressive force S
uo = 0.
=Znu.,
Prove that Z , satisfies Z. = 2
+ ik./S - l/Zn-
1,
Z o = a,
and show that the condition for criticality is given in this case by
Z,v = (1
+
'.
NCN+ 11s)-
Hint: Consider the condition for a free end given by
s-v -s
3. Assuming k l = k z = ... - k , compute the critical loads for N using (c) and (d).
= 1,
N
= 2,
and N
= 3,
26
1 INVARIANT IMBEDDING
4. Using the D’Alembert principle, it is easy to write the equations of motion of a chain subject to a compressive force S below the critical value. Assuming the masses m, to
be concentrated at the nodes, we have
uf- - (2
+ lkl/S)uf+ uI+
= m ld’u,ldt2.
(f)
Setting uI = Zfsin w l t, we are led to the frequencies equation Zi- - (2
+ lkl/S - mi wiz)Z1 + Z I ,
= 0.
(9)
Assuming Zo = ZN= 0, discuss the solution of (g) by classical and invariant imbedding procedures. * = kN = k,and mi = rn2 = mN = m in Eq. (g) of Exercise 4, find the dependence between the natural frequencies and the axial load S.
5. Assuming k l = kZ =
NOTES, COMMENTS, AND BIBLIOGRAPHY
The purpose of this chapter has been to introduce the reader to invariant imbedding ideas using one of the simplest two-point boundary-value problems occurring in structural mechanics. Difference models, as opposed to differential ones, were selected to illustrate the basic ideas. Simplicity of exposition is partially responsible for this selection of methodology. The main reason, however, should be associated with the increasing interest that discrete formulations are acquiring on their own. The classical treatment at the beginning of the chapter, Sections 2-7, serves to emphasize to the reader the dependence of the solution on the boundary conditions. This chapter follows closely the first part of N. DistCfano, Dynamic Programming and Invariant Imbedding in Structural Mechanics, in “Invariant Imbedding” (R. Bellman and E. Denman, eds.), Chapter 9. Lecture Notes in Operations Res. and Math. Syst., No. 52, Springer-Verlag, Berlin and New York, 1971.
The following comments, notes, and bibliography serve to expand the basic material covered in the corresponding sections. 2-6. A treatment of the string and other linear second-order boundaryvalue problems in structural mechanics along classical lines can be found in T. von Karman and M. A. Biot, “ Mathematical in Methods Engineering.” McGraw-Hill, New York, 1940.
A systematic treatment of difference equations at an elementary level is available in K. S. Miller, “Linear Difference Equations.” Benjamin, New York, 1968;
and for the more advanced subject of difference-differential equations R. Bellman and K. Cooke, York, 1963.
‘I
Differential-Difference Equations.” Academic Press, New
NOTES, COMMENTS, AND BIBLIOGRAPHY
27
7. For the subtleties and difficulties in the application of the method of superposition, see L. Fox, “The Numerical Solution of Two-Point Problems in Ordinary Differential Equations.” Oxford Univ. Press (Clarendon), London and New York, 1957.
8. The term invariant imbedding was coined by Richard Bellman in the 1950s to designate a set of techniques that he and his coworkers developed to
attack a number of boundary-value problems in mathematical physics by reduction to initial-value formulations. See R. Bellman and R. Kalaba, On the Fundamental Equations of Invariant Imbedding, I. Proc. Nar. Acad. Sci. U.S.41, 336, 1961.
See also the book R. Bellman and M. Wing, “Introduction to Invariant Imbedding” (to appear).
Historically, the roots of the method can be traced back to Stokes and the problem of determining the reflection of N + 1 plates when the reflection of the first N plates is known. See M. Wing, The Method of Invariant Imbedding with Applications to Transport Theory and Other Areas of Mathematical Physics. Colloq. Lectures in Pure and Appl. Sci., Number 10, March 1965, Socony Mobil Oil Company; R. Redheffer, Difference Equations and Functional Equations inTransmission-Line Theory, “Modern Mathematics for the Engineer,” 2nd Ser. McGraw-Hill, New York. 1962.
More recently, invariant imbedding can be associated with, and was certainly strongly influenced by, Ambarzumian in the context of a number of problems in astrophysics. See, for example, S. Chandrasekhar, New York, 1950.
“
Radiative Transfer.” Oxford Univ. Press (Clarendon), London and
10. Semigroup properties of differential equations in connection with invariant imbedding were first given in
R. Bellman and T. Brown, A Note on Invariant Imbedding and Generalized Semigroups. J. Math. Anal. Appl. 9, 1964.
The perturbation character of invariant imbedding has been emphasized in M. Wing, “An Introduction to Transport Theory.” Wiley, New York, 1962;
and in the first reference of Section 8. 13. Reduction of two-point boundary-value problems to one-sweep initial-value formulations is one of the keystones of invariant imbedding. The name itself can be easily justified in the context of the example presented
28
1
INVARIANT IMBEDDING
in this section. In fact, here the variable J of the classical imbedding remains fixed while the effective independent variable of our problem is N , the length of the string. The treatment of this section follows the introductory paper of the author quoted at the beginning of these notes. See also R. Kalaba, A One-Sweep Method for Linear Difference Equations with Two-Point Boundary Conditions. USCEE Tech. Rep. 69-23, Univ. of Southern California, Los Angeles, 1969.
16. A good introduction to characteristic value problems in mechanics using classical methods can be found in S . Timoshenko and J. Gere, ‘‘ Elastic Stability.” McGraw-Hill, New York, 1961 ; Ziegler, H., “ Principles of Structural Stability.” Ginn (Blaisdell), Boston, Massachusetts, 1968.
17. The first invariant imbedding treatment of buckling problems appears
to be E. M. Shoemaker, Invariant Imbedding Applied to Eigenvalue Problems in Mechanics, J. Appl. Mech. 32 (1965), 41.
Differential Equations
1. Introduction
In this chapter we introduce some topics in differential equations that are used systematically throughout this book. We assume that the reader is acquainted with basic notions in the theory of ordinary differential equations. Here we present only a brief survey of the main properties of systems that wjff be repeatedly used in the applications. In order to provide a methodological link with Chapter 3, we introduce the notions of initial-value and two-point-value problems in the context of physical systems and discuss the difficulties associated with the numerical solution of such problems. 2. Vector-Matrix Notation
An array of numbers in column form such as
29
30
2 DIFFERENTIAL EQUATIONS
will be called a vector of dimension N, or simply an N vector. We shall always refer to column vectors unless otherwise noted. The quantities y i are called the components of the vector. The square array of numbers given by
is called an N-dimensional matrix or N x N matrix. The quantities aij are called the elements of A . We define the sum of two vectors y and z
where y i and zi are the components of the vectors y and z, respectively. Similarly we define the sum of two matrices A
+B =
(ajj
+
bij),
(2.4)
where a j j and bij are the elements of A and B, respectively. The multiplication of a vector y, or a matrix A , by a scalar c1 is defined
c l A = A c , = (c,aij).
(2.6)
The multiplication of a vector y by a matrix A is the vector b = (bi), i = 1, 2, .. ., N , such that N
bi = C a i j y j . j= 1
In compact notation we write
A y = b. The multiplication of two matrices A and B is a matrix C = (c,)
(2.8)
such that
In compact form AB = C.
(2.10)
31
2. VECTOR-MATRIX NOTATION
Clearly the product of two matrices is not commutative, i.e., AB # BA, in general. Given the system Ay = b,
(2.1 1)
where A is an N x N matrix such that det A # 0 and b is a given N vector, we can solve for y and obtain y = Cb,
(2.12)
where C is an N x N matrix whose elements can be obtained in principle using Cramer’s rule. We call C the inverse of A and write symbolically C = A-’.
(2.13)
Substituting (2.13) in (2.12) and the result in (2.1 1) we obtain (AA-’ - Z)b = 0, where I is the identity matrix given by (2.14)
Therefore
AA-’ = I .
(2.15)
Given the matrix A = (aij),the matrix AT = (aji),obtained by transposing rows and columns, is called the transpose of A. If A = AT, we say that A is symmetric. Given two N vectorsy and z we define (2.16) to be the inner product of the two vectors. We consider naw the inneq ptaduct
of y and Az, i.e., (2.17)
Therefore, interchanging subscripts we find
If A is an N x N real and symmetric matrix such that the quadratic form N
N
(2.19)
32
2 DIFFERENTIAL EQUATIONS
is positive for all real vectors y # 0, we say that A is positive definite and write A > 0.
(2.20)
If (y,Ay) 2 0 for all real vectors y # 0, we say that A is nonnegative definite and write (2.21)
A2O.
We shall use lowercase symbols to designate vectors and uppercase ones to designate matrices, unless otherwise stated. EXERCISES 1. Show that (A+B)y = Ay 2. Let A = (alJ), i, j = 1, 2, ail # 0, A - ' = ( 0 ; ' ) .
3. 4. 5. 6.
Show that (AB)'
+ By,
A(y+
Z) = A y
+ Az.
.. . ,N, be a diagonal matrix, i.e., ail = 0 if i # j . Show that if
= ETAT.
Show that if A and Bare nonsingular, (A@-' = B-'A-'. Show that A-lA = I . Show that A'A is a symmetric matrix.
7. Show that matrix T given by Eq. (16.6) of Chapter 1 is positive definite.
8. As norm of a matrix A = (al,), i, j = 1,2, ...,N,we can use the quantity
3. Systems of Ordinary Differential Equations We consider now vectors and matrices whose elements are fmctions of the real variable x , e.g., 4 x 1 = (ui(x)), i, j = 1, 2,
A(x)
(aij(x)),
(3.1)
...,N. We introduce the derivatives given by du/dx = (dui/dx),
dA/dx = (daij/dx),
(3.2)
S A dx = ( ! a i j d x ) .
(3.3)
and the integrals
I u dx = ( s u i dx),
3. SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS
33
Consider now the nonlinear system of ordinary differential equations d ’ l / d x = g l ( u l , u 2 , . . * )U N , x ) d‘2/dx = gZ(U1r u2 > . . * uN x ) f
d‘N/dx
= gN(U1f U 2 9
...
9
9
uN
(3.4)
x).
Using vector notation we can write (3.4) in the compact form dujdx
(3.5)
= g(u, x ) ,
where u is the vector whose components are u i ,i = 1, 2, . . . , N , and g is an N vector given by Sl(U9 x ) g(u,x)=
x ) ) =(g,(u,x)).
f2(;
(3.6)
SNh4
I),
It is of interest to note that we could, if desired, remove the dependence of g with x in (3.5) by considering the N + 1 vectors
U =
UN
(3.7)
X
and
h(u) = 9 N W
With this notation (3.5) reduces to
(3.9)
dv/dx = h(0).
A system such as (3.9) exhibiting no dependence with the independent variable is called auronomous. An important particular case of Eqs. (3.4) is the linear system dU,/dx=ailui duZ/dx =
+ + + +P~(x), + a22 U 2 + + & N U N + p2(X), ~
1
2
~
2
*. *
u~NuN
(3.10)
34
2
DIFFERENTIAL EQUATIONS
where the coefficients aij are generally functions of x . Using matrix notation we can write (3.10) in the compact form du/dx = A(x)u
+p ,
(3.11)
where A(x) = (a,(x)) a n d p = (pi), i, j = 1,2, .. .,N. In what follows we shall recall some of the fundamental properties of linear systems. 4. Linear Homogeneous Systems. Superposition Let us consider the linear homogeneous system dYWX
=m
lY,
(4.1)
where y = (yi) and A = (aij(x)),i, j = 1, 2, . . , , N. If y ( l )denotes a particular solution of (4.1), the function c,y"', where cl is a scalar, is also a solution, as may be proved by substitution. Let J J ( ~ ) , i = 1, 2, . . . , N, be N linearly independent solutions of (4.1) and let ci, i = 1, 2, . . , , N, be N arbitrary constants. Then the linear form y
= qy")
+ c2y(2) + - - * + c,
y'"
(4-2)
is the most general solution of (4.1). We shall now show how these solutions are elegantly furnished by the solution of a certain matrix differential system. For this purpose, we construct a matrix Y(x) whose columns are the desired linearly independent solutions of (4.1), i.e., Y(x) = (y'"(x) y'2'(x)
* * *
y("(x)).
(4.3)
It may be easily verified that the matrix Y(x) satisfies the matrix differential equation d Y/dx = A Y.
(4.4)
Now, the simplest way to ensure that the vector functions ~ ( ~ ) (i x=) 1,2, , . . ., N, are linearly independent is to prescribe Y ( x , ) = I, where x i is any point in the interval of definition of (4.1). In particular, we may prescribe Y(0)= I.
(4.5)
Therefore, the solution of a linear homogeneous system of differential equations reduces to the integration of a matrix differential system (4.4) subject to initial condition (4.5). The matrix Y is called the matrix of the principal solutions, or the fundamental matrix. Now we can write y given by (4.2) in terms of the fundamental matrix Y , i.e., y = Yc,
(4-6)
35
EXERCISES
where c = (ci)is an arbitrary constant vector. Since Y(0)= I it follows that
(4.7)
c = y(0). EXERCISES 1. Let Y satisfy the matrix differential equation
d Y/dx = A Y,
Y(0)= B,
where B is a nonsingular N x N matrix. Show that Y is a fundamental matrix of the linear homogeneous system (4.1). 2. Prove that if
dZ/dx = AZ,
Z(0) = I ,
then Y = ZB, where Y satisfies Eq. (a) in Exercise 1.
5. Linear Inhomogeneous System
We consider the inhomogeneous system
dyldx = A y
+ p,
(5.1)
and introduce the associated matrix differential equation dYjdx = A Y, Y(0) = I. If y(P) denotes a particular solution of (5. I), then y given by
y = Yc
(5.2)
+ y(p),
(5.3) where c is an arbitrary constant N vector, is the most general solution of (5.1). This, a result going back to D’Alembert, is a consequence of the linear structure of the system (5.1). We can construct a particular solution y(p)by integrating the initial-value system
+
dy‘p’/dx = Ay”’ p, y(P’(0) = 0, (5.4) numerically or otherwise. In the next section we present the elegant method of variation of parameters due to Lagrange, which permits the construction of a particular solution in terms of the fundamental matrix. Clearly, when y ( p )in (5.3) satisfies (5.4), c in (5.3) is given by
c = y(0).
(5.5)
EXERCISES 1. Show that i f p is a constant vector and A is a constant, nonsingular matrix, a particular solution of Eq. (5.1) is given by y(”)= - A - ’ P.
36
2
DIFFERENTIAL EQUATIONS
2. Show that a particular solution of the system u'=xu+x
u'=u,
isgivenbyu=-1
andu=O.
6. Variation of Parameters To construct a particular solution of (5.1), we can alternatively resort to the elegant method of variation of parameters due to Lagrange. In this method we seek solutions of the inhomogeneous system (5.1) of the form y = Yu,
(6.1)
where Y is the matrix of the fundamental solution, i.e., it satisfies (4.4) and (43,and u is an unknown vector function to be determined. Differentiating (6. I), we obtain dy/dx = (d Y/dx)u
+ Y duldx.
(6.2)
Eliminating dyldx and dY/dx from among (5.1), (5.2), and (6.2) and using (6.1) conveniently we obtain p
=
Y du/dx
(6.3)
from which
where c is an arbitrary constant vector. Substitution of (6.4) into (6.1) yields
the desired general solution of (5.1) in terms of an arbitrary constant vector c. We recognize the integral in (6.5) as a particular solution of (6.1). That Y ( x )is nonsingular follows from a classical result due to Jacobi, namely,
(
det Y = exp jOxtr(A)d o , where tr(A) is the trace of matrix A given by N
tr(A) =
11a i i.
i=
(6.6)
37
8. HIGHER-ORDER EQUATIONS
EXERCISES 1. Show that dY-'/dx = - Y-'(dY/dx)Y-'. 2. Prove Jacobi's formula given by Eq. (6.6). 3. If Y satisfies the matrix differential equation
d Y/dx = A Y,
Y(0) = I ,
the equation dZ/dx = -ZA,
Z(0) = I,
is called the adjoint. Prove that Z = Y-'.
7. Constant Coefficients A particular case occurs when A in (5.1) is a constant matrix. Then Y ( x ) satisfying (5.2) is given by the matrix exponential 1 +A2x2 + . 2!
Y(x) = eAx = Z + A x
* *.
(7.1)
Using this representation, (6.5) reduces to
(7.2) EXERCISES 1. Show that e A ( x + y= ) eAxeAY.
2. Derive Eq. (7.2). 3. Show that (elx)-'
= e--IX.
4. Show that (d/dx)eAx= Ae"". 5. Let A be a constant N x N matrix. Show that if h is a root of the characteristic equation
det(A - h1) = 0, then y = eAXcis a solution of the equation y(0) = C.
dy/dx = Ay,
8. Higher-Order Equations Our apparent lack of interest in equations of higher order, so often appearing in the applications, can be justified in view of the possibility of reducing any differential equation of arbitrary order to first-order differential systems. Consider, for example, the Nth-order differential equation given by
. . . , dNU/dXN)= 0,
g(u, duldx, d2UldX2,
(8.1)
explicitly solved in terms of the higher derivative, i.e.,
dNU/dXN= h(u, duldx,. .. , dN-IU/dXN-').
(8.2)
38
2 DIFFERENTIAL EQUATIONS
Introducing the new variables
Y N = dN-'u/dxN-',
we can transform (8.2) into the differential system of dimension N :
The linear version of @.I), given by
a, u + al duldx + *
+ aN-
dN-'u/dxN-' + dNu/dxN= 0,
(8.5)
may be readily shown to be equivalent to the system
where y is the vector
and A is the matrix
9. Discussion Clearly, there is no unique way of transforming a higher-order equation into a system of first-order equations. In other words, (8.4) is a convenient but not a unique set of auxiliary variables performing the transformation.
39
10. PHYSICAL SYSTEMS. STATE VARIABLES
As arule of thumb, the best results may be obtained by introducing as auxiliary variables, quantities exhibiting a clear physical meaning. There is much to gain, computationally and analytically, in so doing. We note in passing that a natural way to proceed in this respect is to trace back the derivation of the model equation. In problems of structural mechanics, for example, we could start with the system formed by the constitutive equations in addition to the equations of equilibrium and compatibility. See the exercises below. EXERCISES 1. Using the slope, shear force, and bending moment in addition to the deflection, transform the fourth-order differential equation of a beam in elastic foundation (d2/dx2)(EZd2u/dx')
+ ku =p
into a first-order linear system. 2. Write the linear equations of bending of an elastic circular plate subject to axisymmetric loading in terms of a system of ordinary first-order linear differential equations. 3. Write the equations of bending for shells of revolution in terms of a system of firstorder nonlinear differential equations. See the two papers by Kalnins in the Bibliography at the end of the chapter.
10. Physical Systems. State Variables
The preceding discussion highlights the interest in the study of some structural properties of alternative mathematical models used to describe a physical system. We have already emphasized this aspect in Chapter 1 in connection with the modeling of a simple structural system. The same concept is systematically emphasized throughout this book in connection with a number of models in applied mechanics. Here we only wish the reader to recall the basic steps usually taken in formulating a mathematical model, namely: 1. We pick descriptive quantities known as state variables. 2. We define relationships between the state variables. In other words, we define the basic laws followed by the components of the system. 3. We apply mathematical reasoning to determine a solution of the model using a prescribed computational device such as a digital, analog, or a hybrid computer. Clearly, the choice of appropriate state variables is a crucial step in the formulation of the model. The remaining steps will depend heavily on the first one. Once the state variables are chosen, the nature of the relationships between the variables will define the type of model. We can think in terms of differential (local) or integral (global) relations. Realistic description of
40
2
DIFFERENTIAL EQUATIONS
processes entails frequently the incorporation of difference, differencedifferential, or integrodifferential relations. We are presently interested only in differential models. In the remainder of this chapter we discuss two important types of differential models, namely, initial-value and boundary-value models. Both are shown to be completely different from the third modeling stage point of view, i.e., with respect to the construction of computational algorithms. This discussion provides enough motivation for the developments presented in Chapter 3 and those following. 11. Initial-Value Systems
If a system of differential equations is to represent the behavior of a physical system, we must require at least two crucial properties : existence and uniqueness of the solution, and stability with respect to the structure of the equations and the data furnished to solve the equations. In the preceding sections we have studied some basic properties of the solutions of differential systems. In order to ensure uniqueness, however, we must prescribe the values of the variables at one or various points. When all the components of the vector representing the state variables of the system are prescribed at a single point, we say that the system is initial valued. We consider, for example, the nonlinear system discussed in Section 3, namely, dujdx = g(u, x ) ,
where u is the vector
U =
("),
(11.1)
(11.2)
UN
and g is given by (11.3)
where gi(u, x), i = 1,2, .. . ,N,are scalar functions of the vector u, continuous in u and x , and enjoying a Lipschitz condition of the type
Ilgi(u, X )
-gi(u,
x)II I M l l u - 011,
(11.4)
where llull is the norm given by (11.5)
41
12. NUMERICAL SOLUTIONS
Now, if all the components of vector u are prescribed at a single point, say x = 0, i.e., if
(11.6)
u(0) = c,
where c is a known vector, the preceding conditions are sufficient to ensure the existence and uniqueness of the differential system (1 1.1). We observe that when the elements of the Jacobian matrix (agJdu,), i , j = 1, 2, , . . , N , are continuous in u, the Lipschitz condition (I 1.4) is automatically satisfied. This, a more restrictive condition, is frequently encountered in the applications. Problems of stability are far more involved and require a special treatment. The reader can find a number of appropriate references at the end of the chapter. 12. Numerical Solutions The concept of solution of ordinary differential equations subject to initial conditions is by no means a statical concept. It has in fact been changing progressively with the advancement of the mathematical buildup. The last important step in this progress occurred with the advent of the digital computer. The ideas and methods currently employed in the numerical solution of differential equations subject to initial conditions can be traced back as far as Euler and Cauchy, if not to Newton himself. But the number of equations that can be handled by these numerical procedures has increased astronomically during the last 25 years. We can in fact accurately integrate systems of 5000-10,000 nonlinear equations using standard routines in a matter of minutes. This change in quantity has induced a change in quality, a manifestation of a Hegelian proposition that is occasionally invoked to point out the qualitative nature of the changes introduced by grand-scale, accurate arithmetic. We illustrate the main ideas associated with the numerical solution of initial-valued systems using a simple example, namely the scalar equation du/dx = g(u),
~ ( 0= ) C,
(12.1)
where g(u) is a continuous function of the scalar function u and c is a prescribed initial value. The simplest numerical scheme for the solution of (12.1) is due to Euler. We seek the numerical values of u ( x ) at the points x = iA, i = 1, 2, ..., where A is usually called the step size. Let ui = u(iA),
(12.2)
and consider an expansion of ui+ linear in u iand the first derivative, i.e., (1 2.3)
42
2 DIFFERENTIAL EQUATIONS
Using (12.1) we can write (12.3) in the form u i + l E ui + Ag(ui).
(12.4)
Since uo = c, the sequence u l r u 2 , . . . , is uniquely determined by the recurrence relation (12.4). The algorithm given by (12.4) and the initial condition are frequently called a numerical process. We can think now of a number of possible generalizations of this numerical process. The names of Runge-Kutta, Adams-Moulton, and so on, are associated with these generalizations. A geometrical interpretation of the process given by (12.4) helps to understand the nature of possible generalizations. In Fig. 2-1, the solid line represents the solution of (12.1) while the
Fig. 2-1
vertices of the polygonal are the values of ui obtained using the recursive relation (12.4). Clearly, the slopes of the polygonal are the values of the derivatives u’(iA). We encourage the reader to develop these notions further using appropriate literature such as that indicated at the end of the chapter. 13. Stability of the Numerical Process Despite the particular method employed to discretize the original equation, in general what we do is to replace the original equation (12.1) by an approximate difference equation of the form
where A i is the operator of elementary operations.
43
14. TWO-POINT-VALUE PROBLEMS
Using a machine with finite word length, we cannot guarantee an exact evaluation of ui at each step of the calculations. Rather, we shall obtain a sequence of values u i , i = 1, 2, . . . , that satisfies the equation Vi+l
= Ai(Ui, u i - 1 ,
. . . , Vk)
+ Si,
(13.2)
where di is presumably an element of small norm. Since zli is the output of our computational device, we must compare it with the solution of (12.1), the original equation. We generally proceed in two parts. First we can study how well the difference equation (13.1) approximates the solution of (12.1). In particular we are interested in the dependence of ui with A, the step size of the process. For a number of numerical processes we can derive a number of results establishing the degree of approximation obtained by using (13.1) rather than the original equation (12.1). We note in passing that although this is a problem in approximation theory, error analysis has only recently been tackled using the powerful ideas and techniques of the theory of approximation. The second problem, a consequence of the limited accuracy of digital computers (finite word length), is to study the behavior of di in (13.2) as i-, co. In general the problem consists of establishing conditions under which I d i I < 6, for i 2 N , where 6 and N are two prescribed positive numbers. This is clearly a problem in stability theory. We have so far implicitly assumed that A, the step size, is a constant. In some cases this is a convenient simplification but in general we would expect better results using a variable step size Ai that might account for rapid changes of the solution, and so forth. An interesting proposition here appears to be the determination of the sequence Ai that minimizes the computational error, subject to an appropriate constraint that accounts for the computational effort (time, storage, etc.). This is a problem in control theory, offering interesting research possibilities. Although the stability properties of numerical processes comprise an area still in vigorous development, we can safely assume that at present, a blend of intuition, analytical ability, and an accurate computer are sufficient ingredients to tackle the solution of a broad class of large systems of ordinary differential equations subject to initial conditions. 14. Two-Point-Value Problems
The study of problems of equilibrium in structural mechanics is a prolific source of two-point-, or more generally, multipoint-value problems. These problems differ from the initial-value ones discussed in Sections 11-13 in that the components of the state variable vector, instead of being prescribed at a single point, are partially known at two or more points in a given interval.
44
2
DIFFERENTIAL EQUATIONS
For example the problem of the string studied in the first chapter is a classical two-point-value problem; a continuous elastic beam furnishes a good example of a multipoint-value problem. The reader can find a number of additional examples with little effort. The treatment of problems of this sort is considerably more difficult than the treatment of initial-value problems. From a numerical point of view the difficulty is of a structural nature: Since we do not know completely the state vector at any point of the interval, we cannot initiate the numerical integration. Thus, to construct a numerical solution we must resort to more involved procedures. To fix ideas we consider the following two-point-value problem
du/dx= g(u, u), dv/dx = h(u, v),
~ ( 0=) C, (14.1) u(L)= d, defined in the interval [0, L ] .Assuming L < 1, we can ensure, by fixed-point techniques or otherwise, the existence and uniqueness of the solution for a large class of functions g and h. However, the determination of the largest interval for which this property holds is a matter of some difficulty that requires special treatment. This is a difficulty of an analytical nature, invariably attached to two-point-value problems. The construction of a numerical solution of (14.1) cannot follow a routine path since we do not have a complete set of intial conditions to start the numerical integration. Therefore, we are forced to implement ad hoc methods (and theory) to overcome this difficulty.In general we are led to use the method of successive approximations in conjunction with a convenient linearization of the equations. Thus, in a final analysis, the construction of a numerical solution will rely on our ability to solve systematically linear systems of differential equations subject to two-point (and multipoint)-value conditions. This is not, unfortunately, a routine problem. In the next section we show how to use the method of superposition to solve problems of this kind and indicate some of the difficulties that arise in connection with some numerical aspects. This in turn is the main motivation for the developments of Chapter 3.
15. Linear Two-Point-Value Problems We consider the two-point-value system
dy/dx= A y + Bz, dz/dx= Cy + Dz,
y(0) = 0
z(L) = ZO
(15.1)
where y , z are N-dimensional vectors, zo is a given N vector, and A , B, C, D are N x N matrices. For small L we can guarantee the existence and uniqueness of the solution of (1 5. I). Assume that this is the case. We introduce now
45
NOTES, COMMENTS, A N D BIBLIOGRAPHY
the associated principal matrices Y c l )Z, ( l )and Y(2),Z(’) satisfying the matrix differential equations dY“’/dx = A Y ( l )+ BZ“), dZ‘”/dX = CY“’ DZ“’,
Y(”(0) = I , Z“’(0) = 0,
(15.2)
dY‘2’/dx = A Y(2) + B z ( 2 ) , dZ‘2’ldX = c Y ‘ 2 ’ Dz‘2’,
Y(2)(0)= 0, Z‘2’(0) = I ,
(15.3)
+
and
+
respectively. Now, the solution of (15.1) can be written by superposition in the form y = y(1)c+ Y(2)d,
z = Z“’C
+ Z‘Z’d,
(1 5.4)
where c and d a r e two vectors that satisfy the algebraic system Y‘”(0)c + Y”’(O)d, zo = Z“’(L)c + Z‘2’(L)d. 0
=
(1 5.5)
Since Y(2)(0)= 0, (15.5) yields c = 0. Thus
d = [Z(2’(L>] - lzo .
(15.6)
The solution (15.4) may now be written y(x)= Y~2’(X)[z~2~(L)]-’zo, z ( x ) = Z(2’(X)[Z(2’(L)] - 1Zo .
(15.7)
We note that the possibility of using the representation (15.7) for effective numerical solutions depends on the possibility to compute the inverse of Z@)(L)accurately. The inverse certainly exists if (15.1) is to have a unique solution. The problem, however, lies in the difficulty in computing the ) This, a result of the limited accuracy of numerical value of Z ( 2 ) ( Laccurately. the digital computer, makes the matrix Z(”(L)more and more ill-conditioned as L grows. The consequence of all this is that the error made in the computation of d given by (15.6) will grow exponentially with L . This poses a severe limitation on this method. Chapter 3 is devoted to the development of an algorithmic solution of linear two-point-value problems that is exempt from the present undesirable characteristics. NOTES, COMMENTS, A N D BIBLIOGRAPHY
1. An excellent elementary text on ordinary differential equations is R. Bellman and K. Cooke, “ Modern Elementary Differential Equations,” 2nd ed. AddisonWesley, Reading, Massachusetts, 1971.
46
2 DIFFERENTIAL EQUATIONS
Classical references at a more advanced level are E. A. Coddington and N. Levinson, “ Theory of Ordinary Differential Equations.” McGrawHill, New York, 1955; E. Ince, “Ordinary Differential Equations.” Dover, New York, 1944.
2-7. Excellent books on matrices and differential equations are R. Bellman, “ Introduction to Matrix Analysis,” 2nd ed. McGraw-Hill, New York, 1970; F. R. Gantmacher, “The Theory of Matrices.” Chelsea, Bronx, New York, 1959.
A profound, more classically oriented treatment of systems of linear differential equations in connection with the applications can be found in C. Lanczos, Linear Differential Operators.” Van Nostrand Reinhold, Princeton, New Jersey, 1961. I‘
8. A classical treatment of ordinary differential equations of higher order can be found in the book by Ince quoted above. 9. A number of structural systems can be modeled in terms of first-order differential equations. For beams and frames see E. C. Pestel and F. A. Leckie, “Matrix Methods in Elastomechanics.” McGraw-Hill, New York, 1963.
For shells of revolution, linear and nonlinear, see the articles A. Kalnins, Analysis of Shells of Revolution Subjected to Symmetrical and Nonsymmetrical Loads, J. Appl. Mech. September 1964, pp. 467476; A. Kalnins and J. F. Lestingi, On Nonlinear Analysis of Elastic Shells of Revolution, J. Appl. Mech. March 1967, pp. 59-64.
10. An excellent exposition of various topics in systems theory may be found in R. Bellman, “Vistas in Modern Mathematics.” Kentucky Univ. Press,1968.
11. The stability of dynamical systems has been thoroughly investigated. Introductory to the field are J. Lasalle and S. Lefschetz, “ Stability by Liapunov’s Direct Method with Applications.” Academic Press,New York, 1961; S. Lefschetz, “ Differential Equations, Geometric Theory.” Wiley (Interscience), New York, 1957.
Classical references containing a number of results are R. Bellman, “Stability Theory of Differential Equations.” McGraw-Hill, New York, 1953. Also available in Dover, New York, 1969; L. C w i , ‘ 2 s ~ ~ @ uBehavior tk aod S¶abilityProblems jn Ordinary Differential q u a tions.” Springer-Verlag, Berlin and New York, 1963.
NOTES, COMMENTS, AND BIBLIOGRAPHY
47
12. Difference methods for the solution of initial-value systems are treated in detail in I. BabuSka, M. Prager, and E. Vitisek, ‘‘ Numerical Processes in Differential Equations.” Wiley (Interscience), New York, 1966; P. Henrici, “ Discrete Variable Methods in Ordinary Differential Equations.” Wiley, New York, 1962; R. D. Richtmyer, “ Difference Methods for Initial-Value Problems.” Wiley (Interscience), New York, 1957.
13. The stability of numerical processes is thoroughly treated in the book by BabuSka, Prhger, and Vithsek quoted in Section 12, and in P. Henrici, “ Error Propagation for Difference Methods.” Wiley, New York, 1963.
When the characteristic values of a given system are separated, i.e., their magnitudes vary greatly, the system is called stifl. The numerical solution of such systems, using single- or multiple-step methods, presents some difficulties associated with stability and accuracy. The problem is usually formulated so as to find the largest possible step size for which both the stability and the accuracy criteria are satisfied for a reasonable computing time. Examples of stiff systems abound in applications of dynamics, system identification, and so on. An introductory reading is provided in L. Lapidus and J. H. Seinfeld, “ Numerical Solution of Ordinary Differential Equations.” Academic Press, New York, 1971.
14. A number of results in connection with numerical applications can be found in P. B. Bailey, L. F. Shampine, and P. E. Waltman, “Nonlinear Two Point Boundary Value Problems.” Academic Press, New York, 1968.
The use of quasilinearization to solve two-point boundary-value problems is well illustrated in R. Bellman and R. Kalaba, “ Quasilinearization and Nonlinear Boundary Value Problems.” American Elsevier, New York, 1965.
15. For the numerical difficulties associated with the method of superposition of principal solutions, see the book by L. Fox quoted in the Bibliography of Section 1-7.
Chapter 3
Beamlike Structures
1. Introduction
In this chapter we discuss the solution of vector-matrix differential equations such as
du(x)/dx = B(x)u(x) + A(x)u(x) + p(x), - du(x)/dx = D(x)u(x) + C(x)u(x) + q(x),
(1.1)
where x is a real variable in the interval [0, L],and vector-matrix difference systems such as u(i + 1) = B(i)u(i)+ A(i)v(i) + p ( i ) , + 1) = D(i)u(i) C(i)u(i)+ q(i),
+
-u(i
(1.2)
where i is an integer variable, subject to a number of two-point-value conditions. Mathematical systems such as (1.1) .and (1.2), associated with boundary conditions, usually arise in applications of structural mechanics, in particular in connection with a linearized treatment of beamlike structures. The simplest example in this class is the well-known Euler-Bernoulli beam and its elementary generalizations. Examples of higher-dimensional problems arise 48
49
2. THE ELEMENTARY BEAM
very naturally considering more complex structures with one predominant dimension such as long cylindrical shells, folded plates, and thin-walled sections. Framed structures such as towers usually lead to consideration of discrete systems such as (1.2), although a distinction between difference and differential models does not need to be associated with any structural characteristic of the mechanical system. In fact, on analytical or computational grounds, it might be more convenient to use difference models for structural systems of the “continuous” type, and vice versa. The solution of two-point boundary-value problems governed by equations of the type (1. l) or (1.2) can be obtained in principle by using the method of superposition of principal solutions outlined in the previous chapters. There are, however, a number of reasons for developing alternative solution procedures. The basic one of course is the well-known inherent numerical instability of the method of superposition. In this chapter we construct solutions to linear two-point-value problems by using ideas of invariant imbedding. In this sense we are enlarging the scope and content of the introductory chapter. 2. The Elementary Beam
The simplest model for the bending of an elastic beam is furnished by the linear, fourth-order differential equation
known as the Euler-Bernoulli beam, where w is the displacement, EZ is the stiffness, and f is the load. Slightly more general and Guch more interesting is the system of four first-order differential equations
where rp = (d/dx)w is the slope and t and m are the shear force and bending moment, respectively. The first two equations of (2.2), i.e., those containing the derivatives of w and cp, are the constitutive equations of the bar, involving the flexibility coefficients aij(x); the remaining two are the equilibrium equations. It is easy to verify that (2.2) contains, as special cases, some of the classical formulations. For example, taking all = at2 = azl = 0,
aZ2= l/EZ,
(2.3)
50
3
BEAMLIKE STRUCTURES
and eliminating the three variables cp, t , and m from among the four equations of (2.2), we recover the classical Euler-Bernouilli equation (2.1). Similarly, the Timoshenko beam is found by taking
where A is the cross-sectional area, G is the shear modulus, and p is a formdependent coefficient whose value is 2 for a thin-walled circular section. In the general case [Eq. (2.2)], the coefficients a i j must satisfy the symmetry condition
a consequence of Betti’s theorem. On the other hand, the positive-definite character of the strain energy implies a,,
> 0,
a22 > 0,
a11a22
-4
2
> 0,
(2.6)
i.e., the positive definiteness of the matrix ( a i j ) .Clearly, if a,, = 0, the condition for positive definiteness of the strain energy reduces to a,, = aZ1= 0 and a,, > 0. Similar considerations hold when a 2 , = 0. 3. Higher-Dimensional Models. Cylindrical Shells The vector of the four components w , cp, t, and rn employed in the previous section to formulate the equations of the elementary beam proves to be inadequate when more involved structures are considered. A realistic treatment of more elaborate beam structures requires higher-dimensional descriptions. In order to illustrate the ideas, we present one of the most representative examples in this class involving cylindrical shells. Only the model equations are presented, not the derivation. Specific technical versions of cylindrical shells, such as various kinds of prismatic folded plates leading in a very natural way to equations of the type (1.1) and (l.2), are not considered here. Some references can be found at the end of the chapter. In addition to these examples, the reader should bear in mind that one of the most prolific sources of equations such as ( I . 1) or (1.2) is the method of finite elements in various discrete and semidiscrete versions, when applied to the solution of equilibrium problems in continuum mechanics. This will be illustrated i n Chapter 4, where adequate bibliography will be given. The equations of the theory of cylindrical shells can be written in terms of systems of first-order partial differential equations with respect to either x, the variable along the longitudinal direction, or y , the variable along the directrix. When we use x for the first-order derivatives, the equations reduce to (for notation and geometry see Fig. 3-1) Eq. (3.1) on p. 51, where :8
3. HIGHER-DIMENSIONAL MODELS. CYLINDRICAL SHELLS
0
3
0
Q
S l Q
I
Q"
51
ax
Q
0
n
N
Q" N
Q I
ax > l Q Q A
I
r"
F"
a
G
I
0
.
3
3
I
",.. >
I
.
52
3
BEAMLIKE STRUCTURES
Fig. 3-1
with respect to
denotes partial derivative of order
+ ( 1lP)mxy sx = 4 x + aym x y
sxy
= nxy
9
3
syx
= nyx
CI
and where
3
x, = -a,w.
(3.2)
If instead of x we use y for the first-order derivatives, then the equations read 0 0 aY
Ehu
-a x
Eh w
-
1
0 20 I + v
--
ax2
0
-1
P
where sy = qy
+ axmy,,
xy =
-ay w + ( i / p ) ~ .
(3.4)
3. HIGHER-DIMENSIONAL MODELS. CYLINDRICAL SHELLS
53
With the introduction of a specific behavioral hypothesis such as neglecting the longitudinal bending of the shell, we can achieve a simplification of the equations. We are, however, not interested in pursuing that direction. Our scope is to show that (3.3) and (3.1) may be satisfactorily transformed into a set of ordinary differential equations. In order to operate such a reduction in transcendentality we can resort to a number of procedures. A standard, very convenient method consists in replacing the partial differential operators appearing in the matrices by an approximate, finite-dimensional operator. In other words, by discretizing with respect to one variable. This, a semidiscretization procedure usually known as the method of lines, leads to a system of ordinary differential equations of order 8 M , where M is the order of the semidiscretization and the factor 8 represents the number of equations in the systems (3.1) or (3.3). We discuss this method in the next chapter in connection with the solution of partial differential equations. Another classical device to reduce the transcendentality of the partial differential equations is by means of Fourier decomposition in one direction. Suppose, for example, that the shell is supported on two diaphragms located at x = 0 and x = L and such that u = w = m, = xy = 0 on them. Assuming p x , p y , p z given by the Fourier expansions
where c(k
= kn/L, we
can write
ny = nk(y)sin akx, my = mk(y)sin c(k x,
Ehu = vk(y)sin akx, Ehx,,= xk(y)sin c(k x,
u,(y)cos c(k x, Ehw = Wk(y)Sin c(kX, Ehu
tk(y)cos @kX, sy = sk(y)sin ak x,
=
sxy
=
(3.6)
where the coefficients of the expansion are functions of the transverse coordinate y and satisfy the set of ordinary differential equations
: \I -1
0
O I \ (3.7a)
54
3 BEAMLIKE STRUCTURES
In Eqs. (3.1)-(3.7), E and v denote Young’s modulus and Poisson’s ratio, respectively, h is the thickness, and D = h2/12. 4. Semigroup Properties of Generalized Beams
Our main objective in this chapter is to discuss the solution of twopoint boundary-value problems associated with Eqs. (1.1) and (1 -2) using invariant imbedding ideas. There are several ways to do this. We have chosen to derive the pertinent results from consideration of principles of invariance on a general nonlinear beam. In so doing we shall formulate some semigroup properties of the solutions of generalized beams that will prove to be of interest analytically and computationally. To this end consider a generalized nonlinear beam described by the system duldx = g(u, U, x),
duldx = h(u, U, x),
(4.1)
where g and h are two generally nonlinear vector functions of the N-dimensional vectors u and u, the state variables of the beam. To fix ideas, and with no loss in generality, we shall identify u with displacements and u with forces, subject to the end conditions ~ ( 0=) a,
u(L) = 6,
(44
where L is the length of the beam and a and b are two arbitrary, N-dimensional vectors. We shall assume that Eqs. (4.1),subject to boundary conditions (4.2), have a unique solution, Now in the tradition of statics we make a cut in the beam as indicated in Fig. 3-2. Invoking a well-known principle in statics we know that forces and deformations in the remaining portions (0, X) and (X, L) of the beam will remain undisturbed if and only if we introduce the internal vector u(X), v ( X ) associated with the equilibrium of the entire beam, as an external effect, at both faces of the section x = X. This is indeed a consequence of the principle of causality in physics. Observe that the fi and only if statement is equivalent to the assumption of the existence and uniqueness of the solution
55
4. SEMIGROUP PROPERTIES OF GENERALIZED BEAMS
X
0
4x1
u(o)=a
L
v(L)=b
Fig. 3-2
of the underlining differential equations (4.1) and (4.2). We shall now construct some functional equations in the theory of beams. To this end let d(u(L), u(O), L) be a yet unknown N-dimensional vector function defined by d(u(L),u(O), L ) = the deformation vector at x = L of a beam of length L subject to forces u(L) at x = L and to de€ormationsu(0) at x = 0.
(4.3)
Clearly by definition (4.3) we have
449,401, L ) = u(L).
(4.4)
Using (4.3) in the portion (0, X ) of the beam we have
4x1= d(v(X), u(O), XI,
(4.5)
while consideration of the remaining portion ( X , L ) results in
u(L) = d(v(L),u(X),L - X ) .
(4.6)
Similarly, defining the N-dimensional vector function f ( v ( L ) ,u(O), L ) = the force vector occurring at x = 0 of a beam of length L subject to force v(L) at x = L and deformations u(0) at x = 0,
(4.7)
and considering the two portions of the beam we find the functional relations and We now observe, by inspecting Eqs. (4.5) and (4.6), that in order to determine u ( X ) and v ( X ) , it is enough to know function d. Let u ( X ) and v ( X ) , obtained from the solution of the simultaneous equations (4.5) and (4.6), be given by
u ( X ) = l(V(L), u(O), x,L )
(4.10)
NX) = k ( W , 4 0 ) , X , L),
(4.1 1)
and
56
3 BEAMLIKE STRUCTURES
respectively. Now, Eqs. (4.6) and (4.8), where u ( X ) and u ( X ) are given by (4.10) and (4.11), respectively, are the desired semigroup relations of the generalized beam described by the two-point boundary-value problem (4.1) and (4.2). In other words, those equations furnish functional equations that relate the missing boundary conditions u(L)and u(0) with the known end conditions u(0) and u(L) through the value of u and u at an interior point .'A These relations are a natural device for the derivation of a number of procedures devoted to compute functions g and$ In the next section we derive differential equations for g and f using a perturbation procedure. We finally note that if the beam is homogeneous, i.e., if we can remove the x dependence in the right-hand side of Eqs. (4.1), then functions d and f defined by (4.3) and (4.7), respectively, enjoy the obvious symmetry relations (4.12)
5. Invariant Imbedding. Perturbation Analysis In this section we use the functional relations previously derived to construct partial differential equations for the unknown functions d and f defined by (4.3) and (4.7), respectively. The limiting form of (4.5) as X - r L will furnish an equation for d while the limiting form of (4.8) yields an equation for f.Alternatively, we could consider limiting forms of (4.6) and (4.9), as X - t 0. In either case, the study of limiting forms is indeed a perturbation problem. The simplest way to proceed is to differentiate (4.5) and (4.8) with respect to X , the length of the imbedded beam, keeping in mind that the equilibrium of the beam should remain unaltered. This implies that u(0) and u(0) should be regarded as constants. In this fashion we obtain
du(X)/dX= dx 0 =fx
+ U du(X)/dX, + Vdu(X)/dX,
(5.11
(5.2)
where the subscript X stands for partial derivative with respect to X and where U and I/ are the Jacobian matrices U = (adifavj),
i, j = 1 , 2 , . .., N,
V = (8fi/auj),
i, j = 1,2,,..
(5.3)
and
.,N ,
(5.4) where di and fi are the components,-of vectors d and f, respectively, and where the u;s are the corresponding components of vector v. Now, a condition for the beam to remain unaltered after the perturbation at the end
57
EXERCISES
x = Xis that the total derivatives du/dXand du/dX appearing in the perturbed equations (5.1) and (5.2) satisfy the conditions of equilibrium and compatibility given by (4.1). Thus substituting (4.1) into (5.1) and (5.2) we obtain
( W W ( u , a, X ) = - W o , a, X)h(d(u,a, X ) , v, X ) + g(d(u, a, XI, U,
XI, (5.5)
and
( W W ( u , a, XI = - U u , a, W h M u , a, W , u, XI,
(5.6)
respectively, a system of quasilinear partial differential equations for the vector functions d and f in terms of u and X. We can easily derive initial conditions for d andf. In effect, making X = 0 in (4.5) and (4.8) we obtain and the pertinent initial conditions of Eqs. (5.5) and (5.6), respectively. We observe that dcan be determined using (5.5) above but the determination offdemands the solution of the coupled system (5.5) and (5.6). What is remarkable about the present analysis is that the invariant imbedding approach leads to the solution of quasilinear partial differential equations (5.5) and (5.6) subject to initial conditions (5.7) and (5.8), in contrast with the system of ordinary diflerential equations (4.1) subject to two-point boundary conditions (4.2) afforded by the formulation based in a classical imbedding. EXERCISES 1. Let u(x) satisfy the nonlinear boundary-value problem d2uldx2= au
+ bu3,
u(0)= 0,
u’(L) = v.
(a)
Show that din the equation
u(L)= d(u’(L),L) satisfies the quasilinear partial differential equation ad ad ( a d + b d 3 ) ~ =+u ,~
subject to the initial condition d(v, 0) = 0.
2. Consider Hamilton’s equations
(b)
58
3
BEAMLIKE STRUCTURES
where 4 = ( 9 i ) and p = ( p , ) are the generalized displacement and momentum vector, respectively, subject to boundary conditions 4(O)= a ,
p ( T ) = b.
(f)
Using the principles of invariance outlined in Section 5 derive partial differential equations and associated initial conditions for Y and T in the equations 9 ( T ) = W T ) , do), TI,
P(0) = T ( P ( T ) , 9(0), T ) . See the paper by Bellman et a/. in the Bibliography. 3. Consider the nonlinear two-point-value problem du/dx = g(u, u), dV/dx = h(u, v ) ,
u(0) = a ,
v(L) = b,
where u and u are scalar functions. Using invariant imbedding it is easy to show that r in the equation
u ( D = r(u(L), L ) satisfies the quasilinear partial differential equation (ar/au)h(r, u )
+ a r / Z = g ( r , L),
r(u, 0) = a.
(9
Show that (h) are the differential equations of the characteristic curves associated with Eq. (i).
6. Matrix Riccati Transformations
We now apply some of the preceding ideas to the solution of the linear two-point boundary-value system
+ Au + p , = DU + CV + 4,
duldx = Bu
-duldx
u(0) = a,
v(L) = b,
(6.1)
where u, u, p , q, a. and b are N-dimensional vectors and A , B, C, D are N x N matrices. In view of the linearity of the system we assume the missing boundary conditions, i.e., u(L) and v(O), to be linear combinations of the available data u(0) and v(L). Under this assumption we can write
+ a),
u(L) = R(L)U(L)4- T(L)U(O)
~ ( 0=) S(L)v(L)+ Q(L)NO) + W ) ,
(6.2)
where matrices R, T, S, Q and vectors a, p depend on L, the length of the structure, but not on the boundary conditions. In order to derive equations for R, T,S, Q , a, and p, we modify the length of the beam a small amount dL while keeping the equilibrium of the structure unaltered, and see how
59
6. MATRIX RICCATI TRANSFORMATIONS
those quantities change. We can study infinitesimal changes by taking the derivatives of u(L) and u(0) given by (6.2) with respect to L.In this manner we obtain
+
+
+
u’(L)= R’(L)v(L) R(L)d(L) T’(L)u(O) “(I.), 0 = s’(L)o(L) S(L)v’(L) Q(L)u(O) pyL),
+
+
+
(6.3)
where the primes indicate derivative with respect to L. Now, in order for u(x) and u(x), 0 5 x 5 L, to remain unaltered while enlarging infinitesimally
the length of the beam, the derivatives u’(L) and u’(L) must satisfy the equilibrium and compatibility equations (6.1). Thus, substituting u’(L) and u‘(L) given by (6.1) into (6.3) and eliminating u(L)and v ( 0 ) from the resulting equations by using (6.2), we obtain (R‘ - A
- BR - RC - BDR)u(L)+ (T’ - BT - RDT)u(O)
+ a’ - ( B + RD)a - p
- Rq = 0,
(6.4)
and (S‘ - SDR - SC)U(L)+ (Q’ - SDT)u(O)
+ 8‘ - S(q + Du) = 0,
(6.5)
where we purposely collected terms common in the boundary conditions u(0) and o(L).Since these values are arbitrary, (6.4) and (6.5) yield
+ BR + R C + RDR T’ = ( B + RD)T S‘ = S(DR + C) R’= A
(6.6)
Q’ = SDT a’ = ( B
+ RD)a + p + Rq
8‘ = S(DU + q),
i.e., a system of Riccati matrix differential equations for the quantities R, T, S, Q, u, and 8 subject to the initial conditions R(0) = Q(0) = 0,
T(0) = S(0) = I,
~(0) = B(0)
= 0,
(6.7)
where I is the N x N identity matrix. The initial conditions (6.7) follow from consideration of Eqs. (6.2) where L, the length of the beam, is set equal to zero. Clearly, Eqs. (6.6) hold for the general case where the components of the matrices A, B, C, and D are functions of x, i.e., when (6.1) is a system with variable coefficients. The reader should carefully follow the steps in the derivation of (6.6) to convince himself that no assumption on the constancy of the coefficients has been made.
60
3
BEAMLIKE STRUCTURES
EXERCISES 1. Consider the differential equation
d2UldX2= U,
where u is an N-dimensional vector subject to two-point value conditions u(0) = 0 and u'(L) = c. Show that the N x N matrix R(L) in the equation
u(L)= R(L)u'(L) satisfies the matrix Riccati differential equation
(b)
dRldL = I - R Z , R(0) = 0. (4 2. Consider the differential equations of a cantilever on elastic foundation subject to a concentrated load P and moment M at the end x = L, given by dwldx=p,+allt+alzm,
w(O)=O,
d~ldx=a12t+azzm, dtldx -kw, dmldx = t,
F(0) = 0, t(L) = P,
(d)
m(L) = M,
where k is the coefficient of the foundation and all are the flexibility coefficients defined in Section 2. Show that r l l , r 1 2 ,and r Z 2in the equations
+ +
w(L) = rll(L)t(L) rl2(L)m(L), y(L)= rlz(L)t(L) rZAL)m(L)
satisfy the differential equations drtl/dL=all + 2 r 1 ~ - k r : ~ , d r l ~ / d L = a 1+r22 2 -krllr,2,
rl1(0)=O, rl2(0)=O,
drZz/dL= aZ2- k&,
rz2(0)= 0.
3. Show that the flexibility matrix
'-"')
where ri, is given by Eqs. (f), satisfies the Riccati equation dx-
a12 a 2 2
-k
(" ')
("
0 0 R+R 1 0 ')-R(;
:)R,
R(O)=O.
(g)
4. Set k = 0 and consider a,, , i, j = 1,2, constants in Eq. (d). Under these assumptions, integrate Eqs. (f) in closed form.
5. Consider the two-point-value problem
+ +
dU/dX = BU Au, -dv/dX = DU CV,
~ ( 0-) Av(0) = 0,
u(L) = b, where A is a prescribed matrix. Show that R(L) in the equation
(h)
(0
u(L) = R(L)u(L)
satisfies the Riccati equation
R = A + BR + R C + RDR,
R(0) = A.
(j)
61
7. VALIDATION OF THE RESULTS
6. Instead of the boundary condition u(L) = b in (h), consider u(L) = 6. Set
(k)
u(L) = Z(L)u(L)
and show that Z(L) satisfies the equation -Z’=ZAZ+ZB+CZ+D,
Z(O)=A-’.
(1)
7. Validation of the Results The results of the previous section must be validated since they were obtained under the assumption that the linear relations (6.2) hold. We can easily prove the validity of that assumption. To this end we introduce the matrices of the principal solutions U ( l ) , V ( ’ )and U c 2 ) ,V ( 2 )such that U‘”(0) = z, (d/dx)U“’ = BU“’ + AV“’, (7.11 V‘l)(O)= 0, -(d/dx)V‘” = DU‘” + CV‘” , and (d/dx)U”’ = BU‘” + A V ” ) , U”’(0) = 0, (7.2) V‘Z’(0) = I . -(d/dX)V‘Z’ = DU‘2’ + cV‘z’, If u p , up denotes the particular solution that satisfies the equation u(P’(0) = 0, (d/dx)u‘P’ = BU(P) + Au‘” + p , u(P)(O) = 0, -(d/dX)U‘P’ = Du‘P) CU(P)+ q,
+
(7.3)
then u(L) and u(L) may be expressed by superposition as the linear combinations u(L) = U(”(L)u(O)+ U(Z’(L)U(O)+ u‘P)(L), (7.4) u(L) = V(”(L)u(O)+ V(2’(L)V(O)+ U ( P ’ ( L ) . Since u(0) and v(L) are given boundary conditions, we solve (7.4) for the missing boundary values u(L) and v(O), i.e., u(L) = U‘2’(V‘2’)-1u(L)+ [U”’ - 1/‘2’(v‘2’)-~V(1’]u(o) - U‘2’(V(2’)-1U(P’ + u(P’ 3
(7.5)
u(0) = (V(2))-’u(L)- (V(Z))-1V(1’u(O)- (V(2))-1U‘p’,
are evaluated at x = L. Comparison where U ( l ) ,V ( l ) ,U ” ) , V(’), u(J’),and dP) of (7.5) and (6.2) proves the desired property. Here we could go a little further and prove that the coefficients in (7.5) satisfy the matrix Riccati equations (6.6) subject to the initial conditions (6.7). For example, let R(L) be the matrix R(L) = u ( 2 ) [ V ( 2 ) ( L ) ] - 1 . Differentiating with respect to L, taking into account that
(d/dx)(V‘Z’)-1 = - ( V‘Z’)- ‘(d/dx)V‘Z’( V ( 2 ) ) -1 ,
(7.6) (7.7)
62
BEAMLIKE STRUCTURES
3
and that U"), V(') satisfies (7.2), we obtain dR,/dL= A + BU(2)(J,d2))-1 + (j(z)(V(2))-1C+
,7J(2)(V(2))-IDu(2)( v(2))-1,
(7.8) a result which shows that R satisfies the equation dRldL = A
+ BR + RC + RDR,
R(0) = 0.
We can show in a similar way that the remaining coefficients in (7.5) satisfy (6.6)-( 6,7), We finally note that the existence of the inverse (V('))-' in (7.5) and subsequent equations is guaranteed by the existence and uniqueness of the solution of the original two-point-value problem.
8. Discussion In Section 4 we pointed out that in the general nonlinear case, vectors < L, can be determined by using only function d. This property naturally carries over to the linear case studied in Sections 6 and 7. In fact, R , T, and LY in the first equation of (6.2), the linear counterpart of (4.4), can be determined by using the first, second, and fifth equations of (6.6), subject to the corresponding initial conditions (6.7), independently from the evaluation of S, Q , and p. As should be expected, the linear case offers further simplifications. For example, we observe that the first equation of (6.6) decouples from the rest of the system, indicating that matrix R can be evaluated independently from T, S , Q, LY, and p. This property is of analytical and computational interest. Additional properties can be found if we further specify the nature of matrices A , B, C, and D . For example, we may assume homogeneity along the structure, i.e., that matrices A , B, C, and D are x independent. In this case matrices R, T, S, Q and vectors LY, j? will be independent of which end of the structure is considered. Thus we can interchange zero and L in u and v appearing in (6.2), namely,
u ( x ) and v(x), 0 < x
+ T(L)u(L)+ u(L),
u(0) = R(L)v(O)
4 L ) = S(L)v(O)+ Q(L)u(L)+ LW).
(8.1)
Substituting u(L)and u(0) from (6.2) into (8.I), we find the following symmetry conditions RQ + T 2 = I , RS -k TR = 0,
+ QT=O, + + I). = 0,
SQ Rp ( T
Q.
QR+S~=I, ( S I)B = 0,
+ +
(8.2)
which hold if the structure is homogeneous. Clearly, (8.1) is the linear version of (4.12).
10. INVARIANT IMBEDDING. A ONE-SWEEP METHOD
63
9. A Two-Sweep Computational Method
Equations (6.6), a system of matrix differential equations of the Riccati type subject to initial conditions (6.7), can be integrated numerically, furand p in terms of the imnishing in this manner the values of R,S , T, Q, CL, bedding variable L, the length of the structure. Hence, substitution of those values in Eqs. (6.2) provides the missing boundary conditions of a family of structures with varying length L. The information furnished by this procedure might eventually satisfy our needs but in general our purpose will be to determine u and u at a number of points 0 I x1 < x2 < . . < x, I L within a fixed interval [0, L ] and for fixed values of the boundary conditions u(0) and u(L). When this is the case we can proceed as follows: We substitute u(x) given by the first equation of (6.2), i.e., U(X)
+
+
= R(X)U(X) T(x)u(O)C L ( X ) ,
(9.11
into the second equation of (6.1), to obtain (d/dx)= ~ -(DR C)V- D(Ta a) - 4,
+
+
u(L)= b, (9.2) where a stands for the prescribed value of u(0) and L is the required length of the structure. Equation (9.2) may be integrated backward, furnishing the values of u(x) at every point of the integration mesh. At the same time that we compute u by the backward integration of (9.2), we can compute u(x) using (9. I), where u(0) = a. Clearly, the integration of (9.2) requires the availability (storage) of R, T, and CL, quantities that have been computed in a previous run in the forward direction using the corresponding equations, (6.6) and (6.7). For this reason, we call the method a two-sweep procedure.
10. Invariant Imbedding. A One-Sweep Method We have shown above how to reduce the original boundary-value problem to an initial formulation by proceeding in two stages. First we construct a forward initial-value problem that yields the missing boundary conditions of a family of structures of variable length L. Second, by using that information, we integrate a backward initial-value problem that provides the complete solution of the problem, i.e., the values of u(x) and u(x) in [0, L]. In this section we wish to construct an initial-value problem that furnishes the values of u(x) and u(x) directly at any given point 0 < x 5 L without resorting to a second sweep or matrix inversions. To this end we shall use ideas of invariant imbedding. Using the same conceptual framework that led us to the formulation of Eqs. (6.2), we seek solutions of the form
u(x> = E(x, L)@) + m,0 4 0 ) + Y(X, L), V(X) = G(x, L)u(L) H ( x , L)u(O) d(x, L),
+
+
(10.1)
64
3
BEAMLIKE STRUCTURES
where the matrices E, F, G, H a n d the vectors y, 6 are defined only for x I L. Equations (10.1) can be justified easily on account of the linearity of the problem. Comparison of (10.1)with (6.2) shows that
E(L, L) = R(L), G(L, L) = I, y(L, L ) = a(L),
F(L, L) = T(L), H(L, L ) = 0,
(10.2)
6(L, L ) = 0.
We can now proceed to the derivation of pertinent differential equations for the quantities E, F, G , H, y, and 6 appearing in (10.1). To this end we use a perturbation technique, similar to the one employed in Section 6. We differentiate (10.1) with respect to the length of the structure L. Note that during this process u(x) and v(x) remain constant. We obtain
+ +
+ +
+
0 = E'(x, L)v(L) E(x, L)v'(L) F'(x, L)u(O) y'(x, L), 0 = G'(x, L)v(L) G(x, L)v'(L) H'(x, L)u(O)+ 6'(x, L),
(10.3)
where the primes indicate derivative with respect to L. For u(x) and v(x) to remain undisturbed while changing the length of the structure, u' and v' appearing in (10.3) must satisfy the equations of equilibrium and compatibility given by (6. I). Thus, using (6.1) in (10.3) and collecting terms common in the boundary conditions we obtain
+
( d / W E ( x ,L) = E(x, L)[D(L)NL) W)I, VldL)F(X,L) = E(x, L ) W ) W ) , ( d / W G ( x ,L) = G(x, L ) [ W W ( L ) W ) I , (d/dL)H(x, = G(x, L ) W ) W ) , (WL)Y(X,L) = E(x, L)twJa(L) 4W)1, ( W M X , L) = G(x, ~)tD(L)a(L) 4 w 1 ,
+
(10.4)
+ +
a system of equations for E, F, G, H, y, and 6 subject to the obvious initial conditions E(x, x ) = R(x), G(x, X ) = I, y(x, x ) = a(x),
F(X, x ) = T(x), H(x, x ) = 0, 6(x, x ) = 0.
(10.5)
We observe now that the computation of u(x) and v(x) using (10.1) requires the integration of (10.4), which in turn requires the values of R(L), T(L),S(L), Q(L),a(L),and p(L)for L 2 x . The actual computation is carried out in the following way: We first integrate (6.6)-(6.7) in the forward direction until L reaches the value x , the point at which we wish to evaluate u and v. At this point we adjoin the systems (10.4) and (10.5) and continue the
65
11. SELF-ADJOINT SYSTEMS
integration in the forward direction until the value of L has been reached. The vectors u ( x ) and u(x) can be computed using (10.1) evaluated at the prescribed values of u(0) and v(L), i.e.,
+ F(x, L)u+ Y(X, L), V ( X ) = G(x, L)b + H(x,L)u+ 6 ( ~L). , U(X) = E(x,L)b
(10.6)
This is indeed a one-sweep forward procedure derived from invariant imbedding considerations. We observe that in the present method, x , the variable of the classical imbedding, is maintained fixed while the length of the structure, a constant in classical formulations, is the present variable of integration. 11. Self-Adjoint Systems
In previous sections we have shown that the missing end conditions of generalized beams described by differential equations and boundary conditions of the form
may be given in the form (11.2)
where R, T , S, Q , a, and P are given by the solution of the differential equations (6.6) and (6.7). In the foregoing analysis, no specification on the nature of matrices A , B, C , and D was made. It is known, however, that in dealing with problems in structural mechanics we can generally ensure the following properties on those matrices : A
= AT > 0,
D
=
DT 2 0 ,
B
=
CT,
(11.3)
by means of a proper choice of vectors u and u. This is particularly true when u and u are the generalized displacement and force vector, respectively, and such that there is a correspondence between the ith components u iand ui,
in an energy sense. System ( l l . l ) , subject to conditions (11.3), is called a self-udjoint system and is such that it can be derived from the variation of a certain functional. Interest in systems of this kind is apparent, because we expect that the additional information furnished by (1 1.3) will be reflected in a deeper understanding of the solution of the problem. And this is indeed the
66
3
BEAMLIKE STRUCTURES
case. Inspection of Eqs. (6.6) and (6.7), having (11.3) in mind, shows that matrices R and Q are symmetric, i.e., R
= RT,
Q = QT
(11.4)
and, additionally,
ST= T.
(11.5)
In other words, the composed 2N x 2N matrix Sc R
“=(S
T
Q)
(11.6)
is a symmetric matrix. This could be anticipated on mechanical grounds since the symmetry of S, is a consequence of Betti’s law. In addition, we could go a little further and prove that R 0 and Q 2 0. We shall see this in Section I2 in connection with problems of stability. The composed matrix S, given by (11.6) appears to have been little investigated in the literature of structural analysis and therefore bears no name. We shall refer to it as the scattering structural matrix or just the scattering matrix, by analogy with the scattering matrix appearing in wave propagation and transmission line theory. It is clear that the results outlined here for the scattering matrix still hold in the case where v and u are not forces and displacements, respectively, but generalized state vectors constructed such that the scalar product (u, u) represents a quantity proportional to the work of deformation. By exploiting this notion we can derive a number of mixed formulations of interest in various applications. We leave this as a research exercise to the reader. When u and u denote forces and displacements, respectively, then it is customary in structural analysis to introduce a stiffness matrix defined by
=-
(11.7)
where the minus sign in front of u(0) indicates that the forces denoted by the components u(0) and v(L) of the state vector are acting on the structure. The connection between the scattering matrix S, and the stiffness matrix (K,) may be shown to be K l l = R-’, K 2 , = -SR-‘,
K I 2= -R-’T, K22 = S R - ’ T - Q.
(11.8)
By making use of the fact that R is positive definite and that ST= T, the reader may easily show that ( K i j )is also positive definite, a property to be expected on mechanical grounds.
67
12. NUMERICAL STABILITY
EXERCISES 1. Write Eqs. (2.2) in the form of Eqs. (11.1). Assuming a l I , a I 2 ,and azz to be constants,
integrate the differential equations in closed form and derive expressions for the scattering matrix S, given by (11.6). 2. Consider rill = a12= uZ1= 0 in problem 1. Show that the submatrices R, T, S, and Q of the scattering matrix S, are given by =
L3/3EI Lz/2EI), (L2/2EI LIEI
=
(1L
01 ) '
Q=C 3. 3. Assume that u and u are forces and displacements, respectively. Exhibit a physical meaning for R, T,S, and Q in (1 1.6) in terms of stiffness, flexibilities, and transmission concepts.
12. Numerical Stability
$$$tion arc of theoretical
The properties just discussed in the last ifld practical (numerical) interest. We see briefly here some of the consequences of those properties in a computational context. In particular we sketch a proof of the stability of the Riccati differential equations (6.6) and (6.7) with respect to small numerical errors introduced in the computational process. We only discuss the stability of R as given by the first equation of (6.6), namely,
R' = A
-+ BR i- RBT i- RDR,
R(0) = 0,
(12.1)
where C has been replaced by BT.We consider a small perturbation on R given by (12.2)
R=R+S,
where R satisfies the perturbed equation
R' = A i- BR i- KBT i- RDR,
(12.3)
and S is a matrix, small in norm, such that S(0) = A, the initial error. Eliminating K and R' from Eqs. (12.1)-(12.3), and neglecting the higher-order term SDS, we obtain
S' = ( B + RD)S + S(BT+ DR), an equation for the perturbation matrix S.
S(0) = A,
(12.4)
68
3
BEAMLIKE STRUCTURES
The behavior of S in Eq. (12.4), a linearized version of Eq. (12.1), will establish the desired stability properties. We now leave as an exercise to the reader the task to prove that the solution of (12.4) is given by (12.5)
S ( t ) = X ( t ) AXT(t),
where X is the fundamental matrix of B + R D , i.e., X satisfies the matrix differential equation X' = ( B + RD)X, X ( 0 ) = I, ( I 2.6) and where it is tacitly assumed that D is a symmetric matrix. It follows now that the desired stability depends on the characteristic values of B RD. When B + R D is a stability matrix, i.e., when the real part of all its characteristic values is negative, then there exist two positive constants k and y such that llXll I k e - Y x , (12.7)
+
where the norm is taken to be IIAII = II(aij>II =
1
(12.8)
IaijI.
i, j
Using (12.7) in (12.5) we can easily bound the perturbation matrix S, namely, IlSll = IIXAXTII I llXllzllAll i k211Alle-2Yx.
(12.9)
Equation (12.9) now establishes the fact that, under the pertinent assumptions, the errors will propagate bounded by a negative exponential function, i.e., will tend to zero as x 4 00. This is usually called exponential stability, a very desirable property in numercial appications. When exponential stability cannot be ensured, we must look for an alternative, less demanding stability criterion. In most practical cases all we shall require is that, for x sufficiently large, llSll does not exceed a prescribed value. This will cause the accumulated error to grow not faster than linearly. We are not concerned with processes of this type here. It remains now to establish conditions under which the exponential stability holds. We note first that when A > 0 and D i 0, R ( t ) and R'(t) given by (12.1) will be positive definite and bounded for all t > 0. This follows from the representation of R in terms of X, the fundamental matrix of B + R D , given by
. which in turn follows from (12.1) written in a slightly different manner,
namely R'
= (B
+ RD)R + R(BT + DR) + A - RDR,
R(0) = 0.
(12.11)
69
EXERCISES
If Y(x) denotes the fundamental matrix of B, i.e., Y' = BY,
Y(0) = I ,
( 12.1 2)
then R in (12.1) may also be represented by R(x) =
j:
Y ( x )Y - ' ( O [ 4 5 ) + R(OD(OR(41Y - ' ( < )Y ( x ) d5. (12.13)
Since A > 0 and D 5 0, it follows from (12.10) and (12.13) that
0 < R(x) 5 JxY(x)Y-'(&l(5)Y-'(5)Y(x)d5,
x > 0,
(12.14)
0
the desired result. To prove now that B + R D is a stability matrix amounts to proving the exponential stability of the differential system Z' = ( B
+ RD)z,
~ ( 0=) C .
( 12.1 5)
This can easily be done by constructing a Liapunov function V(z) such as V ( Z )= (z,R - ~ Z ) .
(12.16)
In fact, taking into account that R-' satisfies the Riccati differential equation -dR-'/dx
=
D -I- BTR-'
+ R - ' B + R-IAR-',
x > 0, (12.17)
and that z in (12.16) satisfies (12.15), we find dvjnx
= (QZ, z ) ,
Q
=
D - R - ~ A R - '< 0 ,
x > 0, (12.18)
establishing the desired asymptotic property. An immediate consequence of this result is the stability of the original two-point-value system (11.1). This can be shown in a number of ways. A very expressive one follows from consideration of the transmissibility matrices T (or S ) given by the second (or third) equations of (6.6)-(6.7). In fact, since B + R D is a stability matrix, T will be asymptotically stable, thus establishing the desired stability of the model with respect to boundary conditions. EXERCISES
1. Show that the solution of the matrix equation dZ/dx = A 2 is given by Z
= XCY,
+ ZB,
Z(0) = C,
where X and Y satisfy dXjdx = A X ,
X(0)= I,
dY/dx = YB,
Y(0) = I .
70
3
BEAMLIKE STRUCTURES
where the norm is given by (12.8). 3. Show that if C > 0, then BCBT > 0.
> 0 and D 5 0, show that the numerical process indicated by Eqs. (6.6)(6.7) and (10.4)-(10.5) is exponentially stable.
4. Assuming A
5 . Under similar assumptions show that u, given by the differential equation (9.2), namely,
-du/dx
=(DR
+ BT)u + D(Tu + a ) + q,
u(L)= b,
(4
is exponentially stable in the backward direction. 6. Show that if instead of A
> 0, we consider
where A , > 0, the results of this section hold.
13. General Two-Point Boundary Conditions
In previous sections, in an effort to clarify the exposition of the main ideas, we have systematically discussed end conditions of the type given in (6.1). If the problem demands consideration of other boundary conditions, we have at least two options. In the first place we could use R, T, S, Q, CI, and p computed with (6.6)-(6.7) in (6.2) and solve the resulting system of algebraic equations in the corresponding unknowns. Or, alternatively, we can derive appropriate differential equations to determine the missing end conditions directly. We shall indicate how to proceed in the second case. To this end, we rewrite system (6.1) in the form of a 2N-dimensional system (d/dx)z =
wz + w,
(13.1)
where
and subject z to the most general linear two-point boundary conditions Kz(0) + Mz(L) = m,
(1 3.3)
where m is a given 2N-dimensional vector and K, M are prescribed 2N x 2N matrices. We assume that a solution of (13.1) and (13.3) exists and is unique for all L in some interval 0 2 L 2 L,. Uniqueness of this system requires at least the existence of 2N linearly independent boundary conditions. This imposes a condition on matrices K and M in (13.3), namely, rank(KM) 2 2N,
(13.4)
71
13. GENERAL TWO-POINT BOUNDARY CONDITIONS
where ( K M ) is the 2 N x 4N rectangular matrix formed with the 2 N columns of K and the 2N columns of M . With these restrictions in mind we consider the linear transformation
z(L) = P(L)m + r(L)
(13.5)
in terms of the unknown matrix P and vector r. In order to obtain equations for P and r we differentiate (13.5) with respect to L, i.e., z'(L) = P'(L)m
+ P(L)rn' + r'(L),
(13.6)
where the primes indicate derivative with respect to L. Differentiating Eq. (13.3) with respect to L, we obtain
m'
(13.7)
= Mz'(L),
an equation that substituted into (1 3.6) yields
(P' - WP + PMWP)m + r'
+ PMw - Wr + PMWr = 0.
(13.8)
Equation (1 3.8) must hold for any vector m, the prescribed " end " conditions. Thus
P' = WP - PMWP,
r'
=
Wr - PMWr - PMw,
(1 3.9)
a system of Riccati-like equations that generalizes Eqs. (6.6). Unfortunately, we cannot ensure in this general case that a set of initial conditions at L = 0 will exist. In fact, P(L) and r(L) appearing in (13.5) need not be defined at L = 0, thus preventing a numerical integration from the origin. When this is the case we define our initial conditions in a point L = s near the origin, and start the numerical integration at that point. This can be certainly done because we can always evaluate P ( s ) and r(s) by means of superposition of principal solution, asymptotic methods, etc. A case of some particular interest arises when the same components of the state vector are prescribed at both ends of the interval. To fix ideas, consider the system of differential equations U'
= BU
+ Av,
-v' = DU
+ CV,
( 1 3.10)
subject to boundary conditions v(0) = 0,
v(L) = b,
(13.11)
where u and v are N-dimensional vectors. We set as usual U(L) = R ( W ( L ) ,
(13.12)
and find for R the well-known Riccati equation
R'= A
+ BR + R C + RDR.
( 1 3.13)
12
3
BEAMLIKE STRUCTURES
The difficulty here lies in the fact that R is not defined at L = 0. This can be seen by inspection of (13.11) and (13.12). In order to integrate (13.13) we shall find an initial condition at a point s near the origin. To this end we consider the auxiliary boundary conditions u(0) = 0, u(L) = a such that the associated Riccati equation is well behaved at L
= 0.
( 13.14) We set ( 13.1 5)
u(L) = Z(L)u(L)
and find with no difficulty -Z’ = ZAZ + ZB + CZ + D, Z(0) = 0, (1 3.16) a Riccati differential equation for Z subject to initial conditions at L = 0. Comparison of (13.12) and (13.15) shows that
R(s) = z ( s ) - ’ ,
( 13.17)
an equation that furnishes the desired initial condition for (13.13). The term Z ( s ) in (13.16) may be obtained by integration of (13.16) or, if s < 1, by means of approximate asymptotic expansions. EXERCISES Consider the boundary-value problem U’ = BU
-u’
=
+ Au,
DU + CU,
~(0) = a, u(L)= 6 ,
where u and u are N-dimensional vectors. Show that the scattering matrix
in the equation
satisfies the 2 N x 2 N Riccati equation
Consider the two-point-value problem
u” - u = 0,
u(0) = 0,
u(L) = c.
Show that r(L) in the equation u’(L) = r(L)u(L) satisfies the Riccati equation r’(L) = 1 - r2(L),
where s< 1.
r(s) 2 I/s,
73
14. DIFFERENCE EQUATIONS
14. Difference Equations
In this section we show how to generalize some of the results derived in Chapter 1 for difference equations. To this end it is enough to consider the homogeneous system u(i
-u(i
+ 1) = B(i)u(i) + A(i)u(i), + 1) = D ( i ) u ( i )+ C(i)v(i),
u(1) = 0,
u ( N ) = b,
(14.1)
where u(i) and u ( i ) are N-dimensional vectors. Assuming existence and uniqueness of the solution, we express the missing boundary conditions in terms of the given data, i.e.,
4 N )= R ( N ) W ) ,
(14.2)
where R ( N ) is an N x N matrix to be determined. Proceeding as usual we consider u(N + 1)
= R(N
+ l)u(N + 1).
(14.3)
Eliminating u(N + l), u(N + l), and u ( N ) from Eqs. (14. I)-( 14.3), we obtain
R(N
+ 1) = - [ A ( N ) + B ( N ) R ( N ) ] [ C ( N+) D ( N ) R ( N ) ] - ' ,
(14.4)
a recurrence relation for R ( N ) subject to the obvious initial condition R(1)
(14.5)
= 0.
Similarly, if we wish to determine u(i),i < N , by using a one-sweep procedure, we set u(i) = S(i, N ) u ( N ) ,
(14.6)
where S(i, N ) is an N x N matrix to be determined using the well-known technique based on principles of invariance. To this end, enlarging the interval to N + 1 while keeping u ( i ) constant, we have u(i) = S(i, N
+ l)u(N + 1).
(14.7)
+
Eliminating u(i), u ( N ) , and v(N 1) from the second equation of (14.1) and Eqs. (14.2), (14.6), and (14.7), we obtajn the recurrence relation for S(i, N ) : S(i, N
+ 1) = -S(i,
N)[C(N)
+ D(N)R(N)]-I,
(14.8)
subject to the initial condition S(i, i ) = R(i).
(1 4.9)
74
3
BEAMLIKE S T R U C T U R E S
EXERCISES 1 . If in Eq. (14.1) ~ ( 1 = ) 0 is substituted by the boundary conditions u ( l ) = 0, which are the pertinent initial conditions for R ( N ) given by (14.4)? 2. Let u ( i ) = T(i,N ) u ( N ) .
Find a recurrence relation for T(i, N ) and the associated initial condition. 3. Consider o(1)
=0
and u ( N ) = b in (14.1). Set
u ( N ) = Z(N)u(N). Find a recurrence relation for Z ( N ) and show that Z ( N ) = R ( N ) - ' , where R ( N ) is given by (14.4).
15. Transfer Matrices
At this point the reader is well aware that a class of structural systems can be suitably described in terms of matrix-difference systems of the type u(i + 1) = B ( i ) u ( i )+ A ( i ) v ( i )+ p ( i ) , - v ( i + I ) = D(i)u(i)+ C(i)v(i)+ q(i),
(15.1)
subject to a number of two-point boundary conditions. To fix ideas and with no loss in generality, we shall assume that u ( i ) represents the generalized displacements and v(i) the generalized forces. In the same vein, we consider boundary conditions ~(l= ) a,
v ( N ) = b,
( 1 5.2)
where a and b are the prescribed values of displacements and forces, respectively, at both ends of the structure. We can alternatively write ( 1 5.1) in the form
z(i+ I)
= Z(i)z(i),
(15.3)
by the simple device of making B(i) A(i) p(i) (15.4) - D ( i ) -C(i> q(i) z(i)= _________________ _____________, ____... 0 0 / 1 In view of (15.2) we know z(1) incompletely because the value of v(1) is missing. However, we can write formally ~
I
~
4 2 ) =Z(l)Z(l), z(3) = Z(2)Z(2)= Z(2)2(1)Z(I), (15.5)
z ( N ) = Z ( l ) 2 ( 2 ) . . . Z ( N - l)z(l).
75
16. THE SCATTERING MATRIX
If n ( N ) denotes the matrix product r I ( N ) = Z( 1)Z(2). . .Z(N - I),
(15.6)
we can write the last equation of (15.5) under the form z ( N ) = rI(N)z(l).
(15.7)
Partitioning the system (1 5.7) conveniently and imposing the boundary conditions (15.2), we can solve for u ( N ) and u(l), the missing boundary conditions. After this linear algebraic problem is carried out, we can use the recurrence relation ( 15.3) directly because now z( 1) is known. Matrices Z(i ) are called state transition matrices or transmission matrices in a structural engineering context. The present method is known as the transfer matrix method. The difficulty with this method lies in the ill-conditioning of the matrix product r I ( N ) as N increases. The reason for this should be traced back to the limited accuracy of the digital computer. In other words, for a fixed round-off error, and a prescribed accuracy in the elements of r I ( N ) , there exists a value of N for which this accuracy is reached. There are several methods of preventing the fatal numerical instability associated with the transfer matrix method. The reader is urged to consult the Bibliography at the end of the chapter. We devote our next section to the description of a method that is exempt from such an undesirable feature. EXERCISE
+
Consider the element i, i 1 of a generalized beamlike structure and let u(i) and u(i) be the force and displacement vector, respectively, at section i. A stiffness matrix for the element i, i 1 is defined by the equation
+
Show that the coefficients A(i), B(i), C ( i ) , and D(i) of the transfer matrix (15.1) are given in terms of the stiffness matrices K,, by means of the relations B = -K- ZI'KZ,, D = KllKF:KZz - K12,
A = - K - 2I 1 ,
C = K11KC1'
(b)
16. The Scattering Matrix
Instead of the invariant imbedding approach outlined in Section 14 for solving difference equations, we can employ alternative procedures based on invariant imbedding ideas. Here we present one of them based on the scattering matrix. In the next section we outline another one based on the flexibility matrix.
76
3
BEAMLJKE STRUCTURES
In order to explain the method it is enough to consider the homogeneous case, i.e., p ( i ) = q ( i ) = 0. We assume boundary conditions (15.2). Instead of starting from the state transition matrix (16.1) we start with the scattering matrix X ( i ) of the element i, i + 1 of the structural system, given by (1 6.2)
which is defined such that (16.3)
We assume that matrices B(i),F(i), Y(i),and I ( i ) are known for each one of the elements composing the structure. We now define the global scattering matrix of the system of i elements by means of the relations (16.4) Our task is to derive recurrence relations for R ( i ) , T ( i ) ,S ( i ) , and Q(i), i.e., for the global scattering matrix. This is a well-known problem for us. We solve it by considering the structure of i + 1 elements and associated scattering matrix (16.5) Mathematically our problem now amounts to eliminating the two intermediate vectors u(i) and u(i) between Eqs. (16.3) and (16.4) and to compare the result with (16.5). Since there are four equations to eliminate two quantities, we can operate in a number of ways. For example, eliminating u(i) between the first equation of (16.4) and the second of (16.3), we obtain
u ( i ) = A(i)Y(i)u(i+ 1) + A(i)b(i)T(i)u(l),
(16.6)
where A(i)
= (I -
I(i)R(i))-'.
(16.7)
If, on the other hand, we eliminate u(i) between the same two equations, we obtain u ( i ) = T(i)R(i)Y(i)u(i + 1) + T(i)T(i)u(l), (16.8) where (16.9) T(i) = ( I - R(i)d(i))-'.
77
16. THE SCATTERING MATRIX
We can now use v ( i ) given by (16.6), or u ( i ) given by (16.8), or both, to derive the desired recurrence relations. For example, substituting (16.6) in the first equation of (16.3), and (16.8) in the second equation of (16.4), and comparing the result with (16.5), we obtain R(i + 1) = W ( i ) F(i)T(i)R(i)Y(i) T ( i + 1) = F(i)T(i)T(i) (16.10 S(i + 1) = S ( i ) A ( i ) Y ( i ) Q(i + 1) = S(i)A(i)9(i)T(i) + 9ii) a system of recurrence relations for the matrices R ( i ) , T ( i ) ,S(i), and Q ( i ) subject to the obvious initial conditions
+
R( 1) = 0 , S( 1) = I, (16.11) T(1) = I , Q(1) = 0. By an appropriate choice of the state vectors u and u we can always make the scattering matrix of the i, i + 1 element symmetric, i.e., 9 ( i )= WT(i), 9(i)= 21T(i), Y ( i )= F T ( i ) . (16.12) Using (16.12) in ( 16.10) and (16.1 l), the reader will find no difficulty in proving that R ( i ) = RT(i), Q ( i ) = QT(i), S(i) = T T ( i ) , (16.13) i.e., the global scattering matrix associated with the structure of i elements is also symmetric. This, a manifestation of Betti’s law derived from invariant imbedding considerations, permits the deletion of one equation in (16.10) and (16.1 1). We may go a little further and verify by inspection of Eqs. (16.10)-(16.11) that W ( i )> 0 and 9(i)2 0 imply R ( i ) > 0 and Q(i) 2 0. This property is of the utmost importance since it guarantees the numerical stability of the process given by (16.10)-(16.1 I). Finally, we wish to note that the semigroup properties associated with two-point-value conditions studied for the general nonlinear case in Section 4 acquire particular relevance in the present linear case. Combining (16.3)(16.5) and ( 1 6. lo), we can symbolically write R ( i + 1) T(i+ 1) R(i) T(i) g(i) F ( i ) (s(i 1) Qci 1)) = (s(i) Qci)) * ( Y ( i ) 9(i)) I ) + F(i)T( i)R(i)Y(i) Y(i)T(i)T(i) S(i)A(i)Y(i) 9(i) S(i)A(i)2(i)T(i) ’ = ( 1 6.14) where the star symbol (*) is used in order to avoid confusion with the ordinary product of matrices. In other words, the rule of composition of scattering matrices is given by the star product while the rule of composition of transfer matrices is given by the ordinary product of matrices.
+
+
?(.
+
1
78
3 BEAMLIKE STRUCTURES
EXERCISES 1. Find the components A , B, C, D of the transfer matrix given by (15.1) in terms of the and 9 of the scattering matrix given by (16.3). components 22, 3, 9, 2. Find the components 9?,F, 9,and 9 of the scattering matrix in terms of thecomponents Ki, of the stiffness matrix given by Eq. (a) in Exercise 1 of Section 15. 3. instead of boundary conditions (15.2), assume u(1) = a,
u ( N ) = b.
Find recursive equations for 3, F, 3, and
0 in Eq. (c).
(a)
Set
and
4. Show that R(i) = R - ‘(i).
5. Consider the nonhomogeneous case p ( i ) # 0 and q(i) # 0 in (15.1), together with boundary conditions (15.2). We can generalize Eqs. (16.3) and (16.4) by writing
and
Show that y(i) and 6(i) are given by the recurrence relations
y(i
6(i
+ 1) = 4)+ F(i)r(i)[y(i)+ R(i)B(i)], + 1) S(i)h(i)[P(i) + 2(i)y(i)], =
y(1) = 0, S(1) = 0.
17. The Flexibility Matrix
If, instead of boundary conditions (1 5.2), we consider ~ ( 1 )= U ,
u ( N ) = b,
(17.1)
it might be more convenient to start the analysis with a flexibility matrix for the structural element i, i + 1:
(17.2)
79
NOTES, COMMENTS, A N D BIBLIOGRAPHY
Our purpose here is to derive recurrence relations for the components of the global flexibility matrix
(17.4) in terms of the components of 9 given by (17.2). We proceed here in exactly the same way we did in Section 16. We leave to the reader the task of proving the following recurrence relations subject to initial conditions, for the components of the global flexibility matrix:
F1l(i+ = 911(i)- 912(i)K(i)F21(i)7 F11(2)= F1l(l), F12(i 1)= F12(i)K(i)F12(i), FlZ(2)= 9 1 2 ( 1 ) ? (17.5) FZ1(i+ 1) = Fzl(i)K(i)Fz1(i), F21(2)= 921(1)7 F22(i + 1) = F22(i) - FZl(i)K(i)FIZ(i), F22(2)= ~ 2 2 ( ~ ) 9
+
where the matrix K ( i ) is given by
+
(17.6) ~ ( i=)(Fll(i)FZ2(i))-'. We leave as an exercise to the reader the proof that 9 > 0 implies F = (Fij)> 0. We also leave to the reader the task of developing a similar procedure by employing a global stiffness matrix instead of a flexibility one. EXERCISES 1. Assuming that F given by (17.2) is positive definite, show that F = (Ftj) > 0. 2. Under the assumption of Exercise 1, show that F, I ( i )
+ F2&) in (17.6) is never singular.
3. Show that the components Fijof the flexibility matrix are related to the components of the scattering matrix through the relations - TQ-lS, -Q-'S,
F11
=R
Fz,
=
F12 = -TQ-', F22 = - Q - l .
(a)
NOTES, COMMENTS, A N D BIBLIOGRAPHY
2. A number of references and historical remarks on the classical beam may be found in S. Timoshenko, History of Strength of Materials." McGraw-Hill, New York, 1953. "
The formulation of the beam presented in this section, which is the most general linear model attainable without increasing the dimensionality of the state vector of the classical beam, was employed by V. Tvergaard in V. Tvergaard, Free Vibrations of Beam-like Structures, Internat. J. Solids and Structures 7 (1971), 789-803; V. Tvergaard, Beam Analysis of Axisymmetrical Shells, The Danish Center for Appl. Math. and Mech., The Tech. Univ. of Denmark, Rep. No. 10, January 1971.
80
3
BEAMLIKE STRUCTURES
This formulation, in turn, is a generalization of J. G. Simmonds, Modification of the Timoshenko Beam Equation Necessary for ThinWalled Circular Tubes, Inrernat. J. Mech. Sci. 9 (1967), 237-244.
3. Higher-dimensional models are required in a number of applications. For the construction of models for elastic plates using the three-dimensional theory of elasticity as the starting point, see R. D. Mindlin, An Introduction to the Mathematical Theory of Vibrations of Elastic Plates. Monograph prepared for U.S. Army Signal Corps Eng. Lab., Fort Monmouth, New Jersey, 1955.
Cylindrical shells of various types also require higher-dimensional descriptions. For example,
Prismatic Folded Plates M. H. Gradowczyk, Dissertation, Technische Hochschule, Graz (1961); N. DistCfano and M. H. Gradowczyk, Creep Behavior of Homogeneous Anisotropic Prismatic Shells, Proc. I.A.S.S. Symp. Non-Classical Shell Probl., Warsaw September 1963, pp. 409-427; J. E. Goldberg, W. D. Glauz, and A. V. Setlur, Computer Analysis of Folded Plate Structures, Congr. Z.A.B.S.E., 7rh Preliminary Rep., 1964, p. 55.
Thin-Walled Beam Shells of Closed Sections V. Z. Vlasov, ‘‘ Thin-Walled Elastic Beams,” translated from the Russian, published for NSF and the Dept. of Commerce, USA, by the Israel Program for Scientific Translations, 1961.
Cylindrical Shells
A first step in reducing the shell equations to a Cauchy (or initial-value) system, the ultimate goal of our analysis, is to write the pertinent equations in the form given in (3.1) or (3.3). These equations, as reported here, were derived in W. Wunderlich, Zwei Halbanalytische Verfahren Zur Berechnung Von Tonnenschalen, Schriftenreihe des Lehrstuhls fur Stahlbau, T. H. Hannover, Heft 6, 1967.
from a linear theory of cylindrical shells. Similar formulations are available. See R. S. Jenkins and H. Tottenham, The Solution of Shell Problems by the Matrix Progression Method, Proc. World Conf. Shell Structures, Sun Francisco, I962 Nat. Acad. of Sci., No. 1187 (1964); J. E. Goldberg, A. V. Setlur, and D. W. Alspaugh, Computer Analysis of Non-Circular Cylindrical Shells, Paper presented at the Internat. Symp. (I.A.S.S.) on Shell Structures in Engineering Practice, Budapest, Hungary, 31 Aug. to 3 Sept., 1965.
NOTES, COMMENTS, AND BIBLIOGRAPHY
81
Similar systems of first-order equations can be constructed for general shell geometries. Shells of revolution have attracted the attention of numerical analysts particularly. For example, for conical shells see J. E. Goldberg and J. L. Bogdanoff, Static and Dynamic Analysis of Nonuniform Conical Shells Under Symmetrical and Unsymmetrical Conditions, in Proc. Symp. Ballisfic Missile Aerospace Technol., 6th Academic Press, New York, 1961.
Extensions to general meridional geometry are available : A. Kalnins, Analysis of Shells of Revolution Subjected to Symmetrical and Nonsymmetrical Loads, J. Appl. Mech. September 1964, pp. 467-476. W. Wunderlich, Zur Berechnung Von Rotationsschalen mit Ubertragungsmatrizen, Ingenieur-Arch. 1967, pp. 262-279.
Clearly, this approach is not restricted to linear systems. See A. Kalnins and J. F. Lestingi, On Nonlinear Analysis of Elastic Shells of Revolution, J. Appl. Mech. March 1967, pp. 59-64.
4. See the paper by Bellman and Brown in the references of Section 1-10. See also R. Bellman, R. Kalaba, and M. Wing, Invariant Imbedding and Mathematical Physics, I. Particle Processes, J. Math. Phys. 1 (1960), 280-308; R. Bellman and R. Kalaba, Invariant Imbedding, Random Walk and Scattering, 11. Discrete Versions, J. Math. Mech. 9, No. 3 (1960), 411-420; R. Bellman, Invariant Imbedding: Semigroups in Time, Space and Structure, Univ. of Southern California, EE Tech. Rep. No. 71-9, March 1971.
5. See the references of Section 1-8. For a connection between invariant imbedding and the theory of characteristics, see G. H. Meyer, On a General Theory of Characteristics and the Method of Invariant Imbedding, SIAM J. Appl. Math. 16 (1968), 488-509.
6-8. The technique of perturbation was extensively used by R. Bellman ef al. to derive appropriate Riccati equations from two-point boundary-
value problems. For some of the early work see R. Bellman, R. Kalaba, and M. Wing, Dissipation Functions and Invariant Imbedding, Proc. Nut. Acad. Sci. 46, No. 8 (1960), 1145-1147; R. Bellman, R. Kalaba, and M. Wing, On the Principle of Invariant Imbedding and Neutron Transport Theory. I: One Dimensional Case, J. Math. Mech. 7 (1959), 575-584.
See also the first reference of Section 1-8 and the second reference of Section 4. For an application of invariant imbedding to analytical mechanics, see R. Bellman and R. Kalaba, Invariant Imbedding and the Integration of Hamilton's Equations, Rend. Circ. Mar. Palermo Serie TI, Tom0 XI1 (1963), 1-11.
82
3
BEAMLIKE STRUCTURES
The connection between linear, second-order, ordinary differential equations and Riccati equations is well known. The connection between high-dimensional linear two-point boundary-value systems and matrix Riccati equations was extensively studied by W. T. Reid in a series of articles. For some of the early work see W. T. Reid, Solution of a Riccati Matrix Differential Equation as Functions of Initial Values, J. Math. Mech. 8 (1959), 221-230; W. T. Reid, A Class of Two Point Boundary Problems, Illinois J. Math. 2 (1958), 434-453; W. T. Reid, Riccati Matrix Differential Equations and Nonoscillation Criteria for Associated Linear Differential Systems, Pacific J . Math. 13 (1963), 665-685.
10. The results presented here are a matrix version of those given in R. Bellman, H. Kagiwada, and R. Kalaba, Invariant Imbedding and the Numerical Integration of Boundary-Value Problems for Unstable Linear Systems of Ordinary Differential Equations, Comm. ACM 10 (1967), 100-102.
See also P. Nelson, Internal Values in Particle Transport by the Method of Invariant Imbedding, J . Math. Anal. Appl. 34, No. 3 (1971), 628-643; R. Bellman, H. Kagiwada, R. Kalaba, and S . Ueno, Invariant Imbedding and the Computation of Internal Fields for Transport Processes, J . Math. Anal. Appl. 12, No. 3 (1965), 54-548.
11. See W. T. Reid, Principal Solutions of Nonoscillatory Self-Adjoint Linear Differential Systems, Pacific J . Math. 8 (1958), 147-169.
Self-adjoint systems are intimately related to dynamic programming. See, for example, R. Bellman, “Introduction to Matrix Analysis,” 2nd ed. McGraw-Hill, New York, 1970.
12. For the stability properties of matrix Riccati equations arising in filtering theory, see R. S. Bucy and P. D. Joseph, “Filtering for Stochastic Processes with Applications to Guidance.” Wiley (Interscience), New York, 1968.
13. Here we follow N. Distkfano, An Application of Invariant Imbedding to the Solution of Mixed BoundaryValue Problems, Univ. of Southern California, Rep. USCEE No. 292, July 1968, Los Angeles, California.
14. The results derived here are a matrix extension of the scalar version presented in Chapter 1.
NOTES, COMMENTS, AND BIBLIOGRAPHY
83
15. Transfer matrices, a discrete version of the state transition matrices in the theory of differential systems, have been applied to several branches of engineering. For applications to transmission line theory and wave propagation, see F. Beckenbach (ed.), ‘‘ Modern Mathematics for the Engineer,” 2nd ser. McGraw-Hill, New York, 1967.
For applications to structural engineering, see E.C. Pestel and F. A. Leckie, Matrix Methods in Elastomechanics.” McCraw-Hill, New ‘I
York, 1963.
See also the references on shells in Section 3. 16-17. The scattering and flexibility matrices are discrete versions of the Riccati transformations discussed in Section 6. The derivation of scattering and related stiffness matrices in structural mechanics from Riccati-like algorithms was originally presented in N. Distefano and J. Schujman, Numerical Solution of Boundary-Value Problems in Structural Mechanics by Reduction to an Initial-Value Formulation, EERC Res. Rep. No. 69-4, Univ. of California, Berkeley, 1969.
For application of the discrete matrix Riccati approach to wave propagation in plasmas, elastic media, and so on, see the book E. D. Denman, “ Coupled Modes in Plasmas, Elastic Media and Parametric Amplifiers.” American Elsevier, New York, 1970.
Chapter 4
Partial Differential Equations I
1. Introduction In this and the next chapter, we wish to apply some of the ideas exposed previously to the solution of boundary-value problems governed by partial differential equations. Here we shall consider discrete, and semidiscrete, versions of the original partial differential operators. In the next chapter we shall focus on the derivation of suitable initial-valued, or Cauchy, systems without resorting to a prior discretization of the operator. We shall restrict our attention to elliptic boundary-value problems. The potential and biharmonic equations in the context of some problems of equilibrium in mechanics will be the vehicle for the illustration of the main ideas and the methods. We start with the classical equation of Poisson in two dimensions over an arbitrary irregular domain. In order to discretize this equation, we employ finite elements and a weighted residuals scheme, two notions introduced for the first time in this book. Although the exposition on these topics intends to be self-contained, the reader wishing to expand this introductory treatment should resort to the literature indicated in the Bibliography. By an appropriate partition of the domain in small disjoint regions, the finite element equations are written in terms of difference equations 84
85
2. POISSON’S EQUATION
subject to two-point boundary conditions. Application of invariant imbedding techniques leads to algorithmic solutions of the equations in terms of stable, initial-valued matrix difference equations. In the rest of the chapter, we deal with the solution of an elastic rectangular plate to illustrate the fruitful combination of semidiscretization techniques with invariant imbedding ideas. The thorough treatment of this example intends to exhibit some of the techniques and applications of this accurate method. 2. Poisson’s Equation
In order to introduce the method we consider Poisson’s equation w =p(x,y)
on
V,
where w(x, y ) is a function with piecewise continuous first derivatives in the bounded domain V E R2 with boundary S, subject to Dirichlet boundary conditions
w = wo
on S, c S ,
(2.2)
i.e., over a portion of the boundary, and mixed conditions
aw -+q an
+ au = 0
on S , = S - S , ,
(2.3)
over the remaining portion of the boundary. In Eq. (2.3), n denotes the normal to the boundary and q and a 2 0 are functions defined over S, . We seek an approximate solution wh, which in addition to satisfying the essential (in this case Dirichlet) boundary conditions
w h = wo
on S,,
(2.4)
is required to satisfy the projection equations
for an appropriate set of weighting functions ui. In (2.5) the integral over S, is a weighted boundary residual added to incorporate the natural boundary conditions (2.3). This, a natural extension of the Bubnov-Galerkin method of dealing with natural boundary conditions, is a very convenient device since it relaxes the requirements on the approximating functions at a portion of the boundary.
86
4 PARTIAL DIFFERENTIAL EQUATIONS I
To reduce the differentiability requirements on the approximating functions wh, we integrate (2.5) by parts and apply the divergence theorem, obtaining
(2.6) where the boundary term over S , vanishes if the weighting functions are chosen such as to satisfy the homogeneous equations on S , . (2.7) Equations (2.6) are well suited to be discretized using finite element procedures. Before doing this, however, we can further relax the requirements on the trial functions wh over S1 given by Eq. (2.4).To this effect, instead of the Dirichlet conditions (2.4), we consider the mixed conditions ui=O
-+ an awh
l(wh - wo) = O
on S1,
where I is a constant parameter. Here we reasonably expect that wh(l) satisfying (2.6) and (2.8) will approach wh satisfying (2.6) and (2.4), as 1 + 00. This, a stratagem borrowed from variational methods, permits complete relaxation of the conditions on the approximating functions over the boundary. Substituting awh/an given by (2.8) in (2.6), we obtain
+1
(wh
- W 0 ) u i ds = 0,
(2.9)
SI
the pertinent projection equations with relaxed boundary conditions. It is important to note that a set of equations similar to (2.9) may be constructed if, instead of Eq. (2.1), we are given AW = p ,
where A is a general elliptic differential operator, not necessarily of the selfadjoint type. 3. Finite Elements
In a finite element procedure, the domain V is divided into a number of subregions or elements { V ' } such that V ' = V and I/' = 0. Such a partition may be arbitrarily designed. Triangular and quadrilateral shapes,
u
n
87
3. FINITE ELEMENTS
not necessarily with straight edges, are in general the most popular candidates for plane elements. Tetrahedrons and cubes play the same role in spatial partitions. Once the domain has been subdivided, we introduce a class of approximating functions (3.1) wh = C Nil(x,y)ui 9
i
where the u iare constants to be determined and the Ni' functions are required to form a local (or patch) basis, i.e., in addition to certain completeness requirements N i r ( x ,y ) = 0 if ( x , y ) # V' u S'. Here, a superindex denotes the element and S' the boundary of the element. Usually the constants ui are chosen to denote the values of the approximating function wh at specified locations (nodes) of the element. In particular, if ( x i , y i ) are the coordinates of node i, the quantity u i= wh(xi, y i ) is a nodal value. In this case, functions Ni' are interpolation functions that satisfy the conditions (3.2) Ni'(xj Y j ) = 6ij where aij is the Kronecker delta. Functions N i t must satisfy appropriate conditions of completeness and integrability. Possible continuity requirements on the approximating functions Wh impose additional conditions on the choice of the interpolation functions Nil. In the present example we require Co continuity on Wh along the edges of the elements, a condition not hard to satisfy in the applications. We now proceed to discretize Eq. (2.9). The weighting functions ui will be chosen B la Galerkin, i.e., u . = N.'1 . (3.3) Substitution of (3.1) and (3.3) in (2.9) yields 3
9
C C kfju j + 1I fi' = 0 , I
j
i = l , 2 , ... R ,
(3.4)
where R is the number of nodes and the sum is taken over all the elements. In (3.4), k f j given by the expression
klj = J/
aN. (-aNi a N j + aNi 2 ay ay -
v l ax ax
Ni'aNj' ds
-
+ I JsllNi'Nj'ds, (3.5)
is only defined for those values of i and j belonging to element 1. This is a consequence of the local nature of the interpolation functions N i * . Matrix ( k f j ) ,known as the stzfSness matrix of the element, is a symmetric, positive definite matrix. The quantity f i l , appearing in (3.4), and given by fi=
/ Ni'p dx dy + Is Ni'q ds V'
2'
-A
Ni'wo ds, Sl'
(3.6)
88
4 PARTIAL DIFFERENTIAL EQUATIONS I
is the loading contribution of element 1 to node i , in the structural mechanics parlance. In Eqs. (3.5) and (3.6), the boundary integrals are defined over the portions S , and S,' of the boundary such that
'
S I 1 =S , n S 1 , S,' = S , n S , , where S, is the boundary of element 1. Equations (3.4)may be compactly written in the form
(3.7)
KU +f= 0,
(3.8) where u = (ui), i = 1, ...,R , is the vector of all nodal values, K = ( K i j )is the global stiffness matrix whose generic term is given by
andf=
(A) is the global loading vector whose generic term is given by A = C fi'. (3.10) 1
In (3.9) and (3.10) the sums extended over all the elements are intended in a Boolean sense, their rules of composition clearly emanating from Eq. (3.4). We note that K in (3.8) is a sparse matrix, a direct consequence of the local basis employed to span the approximating solutions (3. I). Standard finite element procedures take advantage of this property and usually attempt to reduce the bandwidth to a minimum. Clearly, the bandwidth is intimately related to the manner in which the nodes have been numerated. In some simple cases the rules to numerate the nodes such as to achieve minimum bandwidth are easily determined. In general, however, this proposition leads to involved combinatorial problems. Once the matrix K has been conveniently conditioned, Eq. (3.8) is solved using Gauss elimination or various iterative procedures. Here we shall not pursue that path of action. Instead, we shall attempt a direct algorithmic solution of the equations conveniently written in terms of difference equations. 4. Difference Equations
Here we reformulate the finite element equations (3.4) in vector-matrixdifference form. To this end we shall first group the elements in adjacent strips as shown in the illustrative example of Fig. 4-la. Each node will be now denoted by the pair (m,n), indicating row and column, respectively. Accordingly, the value of w,,at the node (m,n ) will be denoted by u,, . The strip between column n and n + 1 will be called the nth strip. We now introduce
u(n) =
( "::),
4. DIFFERENCE EQUATIONS
89
Fig. 4-1. (a) Standard numeration, (b) strip configuration.
i.e., the vector of the nodal values along column n, where M , denotes the number of nodes in such a column. For example, in Fig. 4-1 b, M = 2 , M , = 3, M , = 5, ... , M , = 4. Using this notation it is possible to write Eq. (3.4) in the form .............. K21(1)
..............
.....................................................................
j
+ KIl(2) I ~,l(2) i~
K22(1)
K12(2) 2 ~ +2~ l) l ( 3 ) .
I
.........................
+
.........................
= 0.
........................
(4.2)
where Kij(n),i , j = I , 2, are partitions of the stiffness matrix K ( n ) = (Kij(n))of the strip (or super element) n , that may be easily constructed from the stiffness matrices of the individual elements composing the strip. Similarly, p l ( n ) and p,(n) are loading vectors at the sides n and n + 1 of the strip n, respectively. To illustrate the construction of these quantities, we compute the stiffness matrix of the strip n = 1 in the example of Fig. 4-lb, namely
I I
I
1
k....f..,..+ :..,.............k:, ....k... .................k ...:..3.............k...1..4 ...+ ...k...:..4...............0 ... k:, j k:, k3, 0 1 kz4 + k i 4 k:5
+
K(1) =
(4.3)
90
4
PARTIAL DIFFERENTIAL EQUATIONS I
and the loading vectors p , ( l ) and p 2 ( I ) given by
where the subindexes refer to the nodes and the superindexes denote the element, according to the numeration system given in Fig. 4-la. Equation (4.2) may be compactly written as the difference equation K21(n - l>u(n - 1) =
-pl(n) - ~
+ [K,,(n
- 1)
l),
n
+ Kll(n)lu(n) + K,,(n)u(n + 1) . . . , N - 1,
(4.5)
+ K12(1)42) + Pl(1) = 0,
(4.6)
2 ( n
= 2,
subject to the following end conditions Kll(IM1)
and K21(N - I)u(N - 1)
+ Kz2(n)u(N) + p 2 ( N - 1) = 0.
(4.7)
It is interesting to point out that K(n) is a square matrix of dimension ( M , + M n + 1 ) 2whose partitions Kij(n),i, j = 1,2, are of dimensions as indicated in
K(n)=
i
Kllb)
j
K12(4
1.
(Mn x M n..--.... +l) x M n ) -..........-...... _.__._ ...(..M ... ,.............._.-. ~
K21(n) (Mn+1 x Mn) j
K22(n) (Mn+1 x
(4.8)
Mn+1)
In general, K,, and K2, will be rectangular matrices that automatically take care of changes in dimensionality of vector u(n)in the difference equation (4.5). We finally observe that by construction, K,,(n) > 0, K2,(n) > 0, and Kl2(4 = K m . 5. Solution of the Equations
a. Riccati Transformations
To deal with the two-point-value problem (4.5), (4.6), and (4.7), we may resort to the method of the Riccati transformations extensively used in Chapters 1 and 3. To this end we consider a domain of variable length formed with the N - n consecutive strips between the boundaries n and N . We now look for solutions of the form u(n
+ 1) = R(n)u(n)+ r(n),
1 5 n _< N - 1,
(5.11
5 . SOLUTION
91
OF THE EQUATIONS
where R(n) is a M , , x M , matrix and r ( n ) an M,, vector to be determined. Elimination of u(n) and u(n I ) in (4.5) by making proper use of (5.1) leads to the following recurrence relations for those quantities :
+
R(n - 1) = - ( K z z ( n - 1) + K , , ( n )
+ K ~ Z ( ~ ) R ( ~ Z ) ) --' Kl),Z ~ ((5.2) ~
and r(n - 1) = -(K,,(n - 1) *
+ K , , ( n ) + Klz(n>R(n>)-l
( J G 2 ( 4 r ( n )+ P l ( 4
+ pz(n - I)),
(5.3)
subject to the initial conditions R ( N - 1) = -K,;'(N)K,,(N
-
l),
r ( N - 1) = -K;;(N)pz(N
- l),
(5.4)
and (5.5)
respectively, obtained from consideration of (5.1) and (4.7). Clearly, the computation of R ( n ) and r(n), as given by Eqs. (5.2) and (5.3), proceeds recursively in the backward direction starting from the known conditions (5.4) and (5.5) at N - 1. Once these quantities have been determined, we may compute u(n) using (5.1) starting with the initial condition 4 1 ) = -(41(1)
+~
l
z
~
~
~
R+ PIU)), ~ ~
~
~(5.6)-
obtained from consideration of (5.1) and (4.6). 6. Invariant Imbedding
In the method presented above, it is required to store all the quantities R(n) and r(n) and to perform two computational sweeps. In return, the values of w, at every node are obtained. Here we present a direct method to determine u i j for specified values of i and j , which appears very efficient with respect to time and storage if only a few nodal values are required. Suppose that we wish to determine the nodal value u i j . By superposition we may write u i j = s(i,j, n)u(n)
+ W ,n),
(5.7)
where s(i,j, n) = (sk(i,j , n)), k = 1, . . . , M , , is a row vector of dimension M , , and t ( i , j , n) is a scalar. Equation (5.7) expresses the fact that there exists a linear relationship between u i j and the nodal values, say along column n, i.e., u(n). We assume now that j 2 n and, while keeping i and j fixed, we consider the domain of length N - (n + l), namely, uij = s(i,j, n - l)u(n - 1)
+ l(i,j, n - 1).
(5.8)
l
~
~
92
4 PARTIAL DIFFERENTIAL EQUATIONS I
+
Substitutingu(n) = R(n - l)u(n - 1) r(n - 1) in (5.7), subtracting (5.7) from (5.Q and collecting terms in u(n - l), we finally find the recursive equations s(i,j, n - 1)
= s(i,j, n)R(n -
t(i,j, n - 1) = t(i,j , n)
I),
+ s(i,j , n)r(n - I),
n <j,
(5.9)
n < j,
(5.10)
for the quantities s and t , subject to the initial conditions (5.11) (5.12) respectively, obtained from consideration of (5.7) at n =j.In Eq. (5.1 l), hki is the Kronecker delta. The method consists in the recursive, backward computation of R(n) and r(n) using (5.2) and (5.3) starting at n = N - 1 with (5.4) and (5.5). At n =j, we adjoin Eqs. (5.9)-(5.12) and continue the recursive computation of all the quantities R(n), r(n), s(i,j , n ) and t(i, j , n ) , until n = 1. We finally obtain u i j by employing (5.7) at n = 1, i.e., uij = s(i,j , l)u(l)
+ t ( i , j , I),
(5.13)
where u(1) is given by (5.6) 6 . Discussion
The choice of a certain strip pattern may be determined by a number of considerations associated with the specific problem, such as the type and quantity of information required from the solution, the topological properties of the domain, questions of computational efficiency, etc. It is beyond the purpose of this section to deal systematically with all those aspects. Here we only wish to present a few examples to illustrate some possible applications of the present methodology. When the finite element partition is given, the number of possible strip configurations that may be designed on that partition will depend on the topology of the domain and the finite element mesh. For example, in a simply connected plane domain we distinguish at least RZ different configurations, where R is the number of boundary nodes. Two such possible configurations are presented in Fig. 4-2 (a and b) for a triangular mesh in a given region. When the finite element mesh is not given in advance, there is considerably more freedom in selecting a convenient strip configuration that recognizes some of the special features of the problem. In the examples presented in Fig. 4-2 (c-h), we have subdivided threedomains in two different ways each, to illustrate a few possible configurations. It is interesting to note that the
6. DISCUSSION
93
F&. 4-2
present method handles in a uniform fashion all the cases presented here or any other constructed along similar lines. In particular, there is no operational distinction between constant and variable strip dimensionality. Hence, the strip pattern may be entirely selected to reflect special features of the problem and not to simplify the analytical aspects of the method. In some problems involving mechanical applications, for example, the design of the strip pattern might be dictated by the configuration of the actual layers employed in the construction of structures such as dams, tunnels, etc. In other instances, the same role may be played by an a priori qualitative knowledge of the stress or flow pattern of some of the relevant variables of the problem. We finally wish to discuss some of the merits of this method. The combination of invariant imbedding and finite element ideas accentuates the
94
4
PARTIAL DIFFERENTIAL EQUATIONS I
advantages of both approaches. In fact, the present method inherits the versatility of finite element techniques that handle intricate geometries and general boundary conditions in an elegant, uniform fashion. On the other hand, the use of invariant imbedding is accompanied by several advantages. First, it provides a clear physical meaning to each computational step in the solution of the equations. This, together with the geometric flavor attached to the strip method, enriches the information content of the solution, in comparison with ordinary finite element procedures. Second, the method of Section 5b enables the selection of those nodes on which the solution is desired, with a storage requirement nearly proportional to the number of nodal values to be computed. This, an advantage not shared by standard finite element procedures, increases the analyst's control over the type and quantity of information to be extracted from the solution. Third, the numerical algorithms derived in Sections 5a and b are exponentially stablewith respect to initial conditions, a consequence of the positive definite nature of the stiffness matrices and the intrinsic stability of Riccatilike algorithms. Finally, we note that the present method admits immediate generalizations. We could, for example, add one element (rather than one strip) at a time, furnishing additional flexibility to the method. In this case, the algorithms developed in Section 5 retain their validity if a proper reinterpretation of the meaning of the stiffnessmatrices (Kij(n))of the strips is performed.. We leave this as a research exercise to the reader. EXERCISES 1. Discuss the stability of the quantities R(n) and r(n) given by Eqs. (5.2)-(5.5), with respect to initial conditions. See the paper
D. Rappaport and L. M.Silverman, Structure and Stability of Discrete Time Optimal Systems, IEEE Transactionson Automatic Control AC-16 (3), June 1971, pp. 227-233. 2. Study the solution of the equation
over an arbitrary irregular domain using the method presented above. Assume k(x,y ) > 0.
7. Semidiscrethation. The Elastic Plate A method frequently employed in the numerical solution of partial differential equations consists of the discretization G f the operator with respect to one variable only, thus reducing the problem to the solution of a finite system of ordinary differentialequations subject to two-point-value conditions. '
95
7. SEMIDISCRETIZATION. THE ELASTIC PLATE
This is the basis of the so-called method of the lines. (See the Bibliography at the end of the chapter.) The combination of semidiscretization with ideas of invariant imbedding leads to initial-value formulations of a novel type offering features of theoretical and numerical interest. We shall illustrate the application of the method with the solution of the biharmonic equation in the context of elementary thin plate theory. The discussion is restricted to rectangular domains.
Fig. 4-3
The equations of equilibrium of an elastic plate in terms of the usual mechanical variables (see Fig. 4-3) are given by
mxy= -my,
=
a2w
D ( l - v ) -, axay
a%, ax2
--
+
a2mxy a2m 2-ax + aY
ay
= - ~ z9
where D = Eh3/[12(l- v’)] is the stiffness of the plate with thickness h, modulus of elasticity E, and Poisson’s ratio v. When D is a constant, we may eliminate m,, m y , mxy, q,, and qy from the six equations of (7.1) and obtain the classical partial differential equation
i.e., the biharmonic equation in terms of the displacement w. Introducing
(7.3) representing the combination of the shear forces qx and the contribution of the twisting moments mxyin the direction of the shear, and the slope cp, given by cpx =
awlax,
(7.4)
96
4 PARTIAL DIFFERENTIAL EQUATIONS I
we can combine (7.1), (7.3), and (7.4) to derive the following first-order system in x: aw _ -
ax
cpx,
Our task now is to reduce (7.5) to a system of ordinary differential equations by semidiscretizing with respect to y . To simplify the notation we shall assume D = 1. Clearly, the present method affords consideration of variable stiffness D. We consider the rectangular domain enclosed by x = y = 0, x = L, and y = H. To simplify the present analysis further we assume edges y = 0 and y = H to be either clamped or simply supported. The partial differential operators with respect to y will be replaced by the following difference ones:
+ wj+,)/h2, =( w ~ - 4Wj-1 ~ + 6wi - 4Wj+l + wi+2)/h4,
(azw/ay2),,i h = (wi-l (a4w/ay4),, i h
-
2wj
(7.6) (7.7)
where w i= w(x,ih) and h, the distance between
“
(7.8)
lines,” is chosen to satisfy
h
=H/(N+
(7.9)
l),
where N , the number of “lines,” is an integer. We introduce now vectors 4x1, 44, t(x), --(XI, and ~ ( x given ) by
u(x) = (W,ih)) = (wi(x)), u(x) = ((d/dx)w(x,ih)) = du/dx,
t(x) = (t,(x,
w,
m(x) = (m,(x, ih)),
(7.10)
P(X) = ( P A X ,ih)),
and the N x N matrices K = (l/h2)T,
(7.1 1)
L = K Z+ (i/h4)~,
(7.12)
and
97
8. A STIFFNESS MATRIX
where T is the tridiagonal matrix defined by (16.6) of Chapter 1 and F = (fii) is an N x N matrix whose elements are zero except fil and f N Ngiven by if edge y = 0 is simply supported if edge y = 0 is clamped
0 = (2 0 = (2
*"
if edge y = H is simply supported if edge y = H is clamped.
(7.13)
Using the discretization scheme given by (7.6)-(7.7) and the vector-matrix notation introduced by (7.10)-(7.13), Eqs. (7.5), where D = 1, reduce to the 4N-dimensional system of ordinary differential equations = p -L*M - vKm, v' = - m + VKM, m' = - t - K"u, u' = u,
t'
(7.14)
where L" = L - v 2 K 2 ,
K * = 2(1 - v)K.
(7.15)
EXERCISES 1. Derive Eqs. (7.5). 2. Semidiscretize (7.5) assuming D variable in both the x and y direction. 3. Show that urn- ~ K u -t " LU=P
is the semidiscrete version of the biharmonic equation (7.2) for D u, f , and m from Eqs. (7.14).
(a) 3
1. Hint: Eliminate
4. Show that the semidiscrete versions of m, and tx given by Eqs. (7.1) and (7.3), respectively (assuming D = I), are
m
=
-u"
+ VKU,
t = urn- ( 2 - v)Kv.
5. Write the semidiscrete versions of the remaining quantities, i.e., m,. , m,,
(b)
, qx, and qy
given by (7.1).
8. A Stiffness Matrix Consider now the boundary-value problem of integrating the system (7.14) subject to the end conditions t(0) = m(0) = 0,
M(L) = U(L) = 0.
(8.1)
In the invariant imbedding approach, we consider the following family of problems: Integrate (7.14) subject to t(0) = m(0) = 0 ~ ( l=) C, ~ ( l =) d,
0 I 1 I L,
(8.2)
98
4 PARTIAL DIFFERENTIAL EQUATIONS I
in which c and d are arbitrary N-dimensional vectors. Clearly, this solution reduces to the solution of (7.14) and (8.1), when c = d = 0, and I = L. In the familiar fashion we consider the missing boundary conditions t(l) and m(Z) as the linear combinations t ( l ) = R11U)c + Rl,(Od + C%(O, m(l) = R21(l)c R22(1)d + ~12(Z).
(8.3)
+
Proceeding as usual, we find that R i j and a i , i = 1, 2, satisfy the Riccati differential equations
subject to the initial conditions Ri,(O) = R12(O) = R21(0) = R22(O) = 0, a,(O) = 4 0 ) = 0.
(8.5)
We leave the derivation of (8.4)-(8.5) as an exercise for the reader. Introducing the 2N x 2N matrices
),
A=( O I vK 0
B = (O 0
O),
C=
( y :*),
R=
-I
and the following 2N-dimensional vectors:
Eqs. (7.14), (8.2), and (8.3) reduce to z' = A z
+ By,
y' = - c z - ATy
and
Y(0) = 0,
+ p,
z ( l )=
();
(R1l
'I2),
R,,
8 2 2
99
9. PRESCRIBED DISPLACEMENTS A T OPPOSITE EDGES
respectively. Equations (8.4) and (8.5) can be written in compact form R ' = - C - RA - A'R - RBR, a' = -A'u - RBu + p,
(8.10)
and R(0) = 0,
~ ( 0= ) 0,
(8.11)
respectively, as can be proved by inspection. Equations (8.10) can also be obtained by a direct analysis involving (8.8) and (8.9). Clearly, R ( f )satisfying the matrix Riccati equation (8.10) subject to initial conditions (8.11) is a stiffness matrix. It is a symmetric matrix as can be directly verified using (8.10) and (8.11). This symmetry reflects Betti's law obtained via invariant imbedding. Due to this property, R I 2 = RZ, in Eqs. (8.3). Therefore we can delete one of the differential equations involving the symmetric terms in Eqs. (8.4). EXERCISES 1. Show that R given by (8.10) and (8.11) is R < 0. Hint:
Use the fact that C > 0.
2. Using a fully discretized biharmonic operator, derive the discrete analog of Eqs. (8.10). See the book by Angel and Bellman listed in the Bibliography.
9. Prescribed Displacements at Opposite Edges It is worthwhile to observe that whatever conditions we consider at x = 0, the differential equations (8.4) or (8.10) remain unchanged. This is due to the fact that the edge conditions at x = 0 are only used to define the initial conditions for the Riccati equations (8.4) or (8.10). In this section we shall consider the edge conditions
i.e., we prescribe the displacements at both edges x = 0 and x = 1. In this case Eqs. (8.9) and (8.10) still hold, but (8.11) must be modified. In fact, on physical grounds it is clear that when the displacements are prescribed on opposite edges it is no longer true that the matrix R vanishes as I tends to zero, i.e., the stiffness matrix R is not defined for a clamped plate of length zero. To remove this difficulty we define initial conditions for the Riccati equations at x = A, a point near the origin where the stiffness matrix R can be computed in some convenient manner. This can be done in a number of ways.
100
4 PARTIAL DIFFERENTIAL EQUATIONS I
For example, we can consider the plate of length A as being divided into N uncoupled clamped beams. The stiffness matrix is then found to be
A, vector u(A) is given by and, assuming that the load is constant in 0 I x I (9.3) Initial conditions for R in a neighborhood of x = 0 could also be obtained by a number of asymptotic procedures. The reader interested in this problem can consult the Bibliography at the end of the chapter.
10. A Flexibility Matrix We have shown in Section 8 that R in the equation y = RZ
(10.1)
is a stiffness matrix that satisfies the Riccati equation R'= -C-RA-ATR-RBR.
(10.2)
Similarly, by considering the equation z
=zy,
(10.3)
we can derive a Riccati equation for the flexibility matrix Z. There is no need to use a perturbation procedure here since Z enjoys the property Z
= R-'.
(10.4)
By differentiating (10.4), and making use of (l0.2), we obtain z' = - R - ~ R ' R - ~ =
- Z ( - C - RA - ATR - RBR)Z AZ + Z A ~ ZCZ,
=B
+
+
(10.5)
a Riccati equation for Z which in expanded form reads
+ +
+
+
Z ; , = Z12 ZTz Z,,L*Z,, Z l ZK*ZT2, K 2 1 2 K*Z22, Z ; , =Z22 V Z ~ ~Z,,L*2,2 Z;z = - I + v K Z , + ~ vZT, K + ZT2L*Z12 Z2, K*Z22,
+
+
(10.6)
+
where (10.7)
and where K , K*, and L* have the meaning given in Section 7.
101
1 1 . NUMERICAL EXAMPLE
EXERCISES 1. Show that instead of the approximate value given for R(A) by Eq. (9.2). we could use the exact one given by R(A) = Z - ’ ( A ) ,
where Z is the solution of (10.5) subject to Z(0) = 0. 2. Derive a differential equation for p in the equation z= z y
+ p.
11. Numerical Example We present here a numerical example to show the feasibility and accuracy of the method. In Table 4-1 we present a comparison of the results obtained using invariant imbedding and those appearing in Timoshenko’s book on plates and shells, in the computation of rectangular plates with two opposite TABLE 4-1 Rectangular Plate with Two Opposite Edges Simply Supported and Two Other Edges Clamped (Uniform Distributed Load, v = 0.3)
tY I-,-I x = a/2, y = b/2
Invariant Timoshenko . imbedding 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2.0
0.00192 0.0025 1 0.00319 0.00388 0.00460 0.00531 0.00603 0.00668 0.00732 0.00790 0.00844
0.00191 0.00252 0.00319 0.00389 0.00461 0.00532 0.00602 0.00669 0.00732 0.00791 0.00846
Invariant Invariant Timoshenko imbedding imbedding -0.0697 -0.0787 -0.0868 -0.0938 -0.0998 -0.1049 -0.1090 -0.1122 -0.1152 -0.1174 -0,1191
-0.0696 -0.0785 -0.0865 -0.0935 -0.0996 -0.1047 -0.1089 -0.1123 -0.1150 -0.1 172 -0.1190
0.0332 0.0371 0.0400 0.0426 0.0448 0.0460 0.0469 0.0475 0.0477 0.0476 0.0474
0.0331 0.0368 0.0399 0.0425 0.0445 0.0459 0.0468 0.0474 0.0476 0.0476 0.0474
102
4
PARTIAL DIFFERENTIAL EQUATIONS I
edges simply supported and the two other edges clamped, subject to uniform load. The differential equations were integrated using a Runge-Kutta scheme with a step size of 0.01. In this example N = 1 1 and A for the initial conditions (9.2) and (9.3) was taken to be equal to 0.1. The moments at the middle of the plate were computed by backward integration using a two-sweep method such as that outlined in Section 3-9. 12. Buckling Problems. Critical Lengths
As an example of the application of the method to buckling problems, we calculate the critical length of a rectangular plate simply supported along y = 0 and y = 1 and clamped along x = 0 and x = L , subject to in-plane compressive forces n,(y) acting on edges x = 0 and x = L. Under the effect of in-plane forces n,, the differential equations (7.1) remain unaltered except for the last one, the equilibrium equation in the z direction, which should read (12.1) The additional term n, azw/ax2in Eq. (12.1) clearly denotes the influence of the curvature a2w/ax2in the equilibrium of normal loads. The corresponding system (7.5) now reads
-aw_ ax
CPX
,
aZw
I 8 C P-X - - m, - v 2,
ax
D
am, - - -t,
ax
aY
a D -. 8% + 2(1 - V ) aY
aY
Semidiscretizing (12.2) under the assumption that D of ordinary differential equations
u‘ = u, u’ = -m vKu, i’ = p - L*u - vKm, m’ = - f - K** 0,
= 1 leads to the system
+
(12.3)
NOTES, COMMENTS, AND BIBLIOGRAPHY
103
where i is the effective shear force given by
-
t=t-Np,
m is the diagonal matrix of the compressive forces given by m diag(n,(ih)), =
(12.4)
(12.5)
and K** is the matrix
K**
= 2(1 -
v)K - W.
(12.6)
We leave the details of the derivation of (12.2) and (12.3) to the reader. We observe that Eqs. (7.14) and (12.3) are formally the same. Therefore, the solution of (7.14) provided by the Riccati system (8.3) and (8.4) may still be used provided that t is substituted by t and K* by K**.With these substitutions in mind we integrate the system (8.4) subject to appropriate initial conditions and find the value of L for which the matrix R = (Rij) ceases to be negative definite. This is the smallest critical length of the plate. Recalling the physical meaning of R, a sufficient condition for criticality is that any element of the matrix R becomes zero. This simplifies the numerical procedure considerably. We now present the following numerical example. The critical force nXcri, of a square plate of length one, simply supported along edges parallel to x and clamped along edges parallel to y , with constant thickness and Poisson ratio v = 0.25, is given by nxcrit= 6.74n2,
(12.7)
according to the Handbook of Engineering Mechanics (see Bibliography at the end of the chapter). We have used this value to compute matrix K** given by Eq. (12.6) and subsequently to compute R(x) by means of Eqs. (8.4). The initial conditions for Eqs. (8.4) were computed at A = 0.1. The differential equations were integrated with a Runge-Kutta scheme using a step size of 0.01. The integration was interrupted when the first element of the stiffness matrix R changed its sign. This procedure yielded a value L erit = 1. No further investigation was done to calculate more precisely where the change of sign took place, which obviously occurred in the interval 1 5 LcritI 1.01. In this computation N = 9. NOTES, COMMENTS, AND BIBLIOGRAPHY
1. The numerical solution of partial differential equations by invariant imbedding procedures is presently a fertile and active area of research. In this and the next chapter we make a short incursion into this rapidly evolving
104
4 PARTIAL DIFFERENTIAL EQUATIONS I
field to show some of the most important features of the methods. The treatment of the Poisson equation presented in Sections 2 to 6 , follows very closely the paper N. Distkfano, Invariant Imbedding and the Solution of Finite Element Equations, J. Math. Anal. Appl. (to appear).
2 . The reader interested in Ritz-Galerkin or more general weighted residuals methods should consult B. A. Finlayson, “The Method of Weighted Residuals and Variational Principles.” Academic Press, New York, 1972.
In a variational context, the parameter ?, appearing in Eq. (2.8) is known as a Courant parameter. See R. Courant, Variational Methods for the Solution of Problems of Equilibrium and Vibrations, Bull. Amer. Math. SOC.49 (1943), 1-23.
and T. Butler and A. V. Martin, On a Method of Courant for Minimizing Functionals, J. Math. Phys. 41 (1962), 291-299.
3. The finite element method, an ingenious extension of Ritz-Galerkin techniques well suited for digital computers, has gained considerable support among engineers and applied mathematicians dealing with the numerical solution of partial differential equations. In addition to the pioneering work by Courant (see the book J. L. Synge, “The Hypercircle in Mathematical Physics.” Cambridge Univ. Press, London and New York, 1957.
and the original paper by Courant cited in Section 2), the method was independently formulated and developed by structural engineers interested in the solution of problems of elasticity with very complicated boundaries. We note in this connection the following papers: M. J. Turner, R . W. Clough, H. C. Martin and L. J. Topp, Stiffness and Deflection Analysis of Complex Structures, J . Aeronaut. Sci. 23 (9) (1956), 805-823; R. W. Clough, The Finite Element in Plane Stress Analysis, Proc. 2nd ASCE Conference on Electronic Computation, Pittsburg, Pa., Sept., 1960; J. H. Argyris, Energy Theorems and Structural Analysis, Butterworths Scientific Publications, London, 1960 (Reprinted from Aircr. Engng., 1954-1955).
The method, with many engineering applications, is presented in 0. C. Zienkiewicz, “The Finite Element Method in Engineering Science.” McGraw-Hill, New York, 1971.
NOTES, COMMENTS, AND BIBLIOGRAPHY
105
The mathematical foundations of the method, with particular emphasis on approximation aspects, may be found in : A. K. Aziz (ed.), “The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations.” Academic Press, New York, 1972. G. Strang and G. Fix, “An Analysis of the Finite Element Method.” Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
4-6. The use of invariant imbedding in finite element equations as formulated here was originally presented in the reference by DistCfano cited in Section 1. For an extensive treatment of partial differential equations using finite differences and invariant imbedding, see the book E. Angel and R. Bellman, “Dynamic Programming and Partial Differential Equations.” Academic Press, New York, 1972.
See also N. Distkfano and A. Jain, A One Sweep Method for Linear Elliptic Equations over Irregular Domains, J . Optimization Theory Appl. (to appear).
7. The method ‘of lines, or line method, is a very versatile semidiscrete method. See,for example, S.A. Mikhlin, “Variational Methods in Mathematical Physics.” Pergamon, Oxford, 1964.
8-10. The results given here for the biharmonic equation were first given in N. Disttfano and J. Schujman, Numerical Solution of Boundary Value Problems in Structural Mechanics by Reduction to an Initial Value Formulation, Earthquake Engrg. Res. Center, Rep. No. 69-4, Univ. of California at Berkeley, March 1969; N. DistCfano and J. Schujrnan, Solutions of Elastic Plates by Invariant Imbedding, Proc. Amer. SOC.Civil Engrg. Engrg. Mech. Div., EM5, October 1971.
11-12. For additional examples and details on the numerical solution of the matrix Riccati equations see N. DistCfano, Dynamic Programming and the Solution of the Biharmonic Equation, Internat. J. Numerical Methods Engrg. 3 (1971), 199-213; P. Nelson, A Comparative Study of Invariant Imbedding and Superposition, Internat. J. Comput. Math. Section B, 3 (1972), 195-207.
Chapter 5
Partial Differential Equations I1
1. Introduction
Searching for appropriate numerical schemes, in the last chapter we applied invariant imbedding ideas to suitable discrete or semidiscrete versions of the partial differential operator. It should be kept in mind, however, that a reduction in the transcendentality of the operator is a convenient device but not an essential one for the application of invariant imbedding arguments to boundary-value problems. In fact, a number of significant results in the theory of partial differential equations can be obtained by application of invariant imbedding ideas without resorting to any prior discretization of the operator. Historically, the first result in this direction appears to be due to Hadamard in his celebrated equation for the variation of the Green’s function of the potential equation in terms of a certain variation of the contour. More recently, it has been shown that Hadamard’s result can be derived and generalized using standard arguments in dynamic programming. This is of interest from both a theoretical and a numerical point of view. We note that the same results can be derived from invariant imbedding considerations. The usual argument consists in considering a one-parameter family of regions, monotone under inclusion, and deriving a Cauchy system in terms of such a parameter. Clearly, 106
2. FORMULATION O F THE PROBLEM
107
a considerable simplification in the formulation occurs when the contour lines are simple in relation to the coordinate system employed. In order to illustrate the ideas involved in this method, we consider again the biharmonic equation in the context of elastic rectangular plates. We take a, the length of the plate in the x direction, to be the pertinent imbedding parameter and derive an appropriate Cauchy system in terms of integrodifferential equations. This is discussed in Sections 2-6. In the last two sections, 7 and 8, we change our course to discuss a new problem, namely, the influence of Poisson’s ratio in the stress distribution of the plate. This, a perturbation problem in elasticity investigated mostly by Westergaard using classical arguments in potential theory, is reformulated here as an initial-value problem in terms of integrodifferential equations. In this fashion the theory of invariant imbedding furnishes a new Cauchy system that can be regarded as a functional perturbation with respect to Poisson’s ratio. The vehicle for this derivation is the construction of an appropriate system of Fredholm integral equations. As usual, a Bibliography with comments is provided at the end of the chapter. 2. Formulation of the Problem
Let w be the deflection of a plate satisfying the biharmonic equation
v4w = w,,,, + 2wx,,, + w y y y y = 0, (2.1) where the subscripts indicate partial differentiation in the rectangular domain 0 Ix I a, 0 5 y I 1. We consider that edges x = 0, y = 0, and y = 1 are rigidly clamped, i.e., w(0, y ) = w(x, 0) = w(x, 1) = 0, (2.2) w,(O, Y ) = wy(x,0 ) = w,(x, 1) = 0, and that the edge x = a is subject to prescribed moments m(y) normal to the edge, and to vertical forces n(y). In terms of displacements the conditions on the edge x = a read w x x ( a , Y ) = m(y), (2.3) w,,, + 2wxyy(a,Y ) = 4.Y). (2.4) Note that for simplicity, and without any loss of generality, we are assuming that v, the Poisson ratio of the material, is zero. We discuss an interesting solution for the case v # 0 in Section 7 and subsequent sections. The problem mentioned above is considered a fundamental problem for the plate in the context of invariant imbedding. We obtain the solution of this problem by superposition of the solutions of the two auxiliary problems defined below. Let be a parameter such that OIa11.
(2.5)
108
5
PARTIAL DIFFERENTIAL EQUATIONS I1
We consider two functions u(x, y , a) and u(x, y , a) satisfying the biharmonic equations
v4u = 0 ,
v4v = 0,
(2.6)
subject to u(0, y , a) = u(x, 0, a) = u(x, 1, a) = 0,
ux(0, y , 4 = u,(x, 0,a) = uy(x, 1 , 4 = 0 , u(0, y , a) = v(x, 0, a) = u(x, 1, a) = 0,
(2.7)
ox@,y , a) = uy(x,0 , a) = uy(x, 1, a) = 0.
If 6(y) denotes the Dirac delta function, we additionally require at x conditions uxx(a, y , 4 = S(Y - a), uxxx(a, y , a> + 2uxyy(a,Y , a) = 0, and uxx(a, y , 4 = 0 , uxxx(a,y , 4 + 2uxy,(a, y , 0)= -6bJ - 4.
=a
the
(2.8)
(2.9)
In physical terms, u represents the deflection of a plate clamped at x = y = 0 and y = 1, and subject to a concentrated force P = 1 applied on the free edge x = a at the point y = a. Similarly, u is the deflection of a plate equally supported but loaded with a concentrated unitary moment at the pointy = a of the free edge x = a. Clearly, u and u are special Green’s functions for the original problem. By superposition, w satisfying Eqs. (2.1)-(2.4) can be expressed as W(X,
y) = -
J
1
V(X,
+ S,u(x, y , a)m(a) da. 1
y , a)n(a) do
0
(2.10)
Our purpose is to derive initial-value problems for u and u , and then use (2.10) to obtain the desired solution. We will regard u and u as being functions not only of x, y , and a but also of the length of the plate a. Thus, we write u = u(x, y , a, a),
v = u(x, y , a, a).
(2.1 1)
To facilitate the use of functions of several variables, the following notation is introduced. We will let u i and u i ,i = 1, 2, 3, 4, denote differentiation of u and u with respect to the ith variable. Thus with this notation u satisfies the biharmonic equation Ullll
and at x
=a
+ 2u1122 + u 2 2 2 2 = 0 ,
(2.12)
we have ulll(a,
%,(a, y , a, 4 = 6 ( y - 4, y , a, a> + 2u,z,(a, y , a, a> = 0.
(2.13)
109
3. INITIAL-VALUE FORMULATION
Similar equations can be written for u. Our next task is to investigate how the solutions for u and u vary as the length of the plate is increased. Although we employ some formal manipulations with delta functions, it is clear that the results can be easily justified via the theory of distributions under the smoothing conditions usually adopted in the theory of thin elastic plates and generally required for numerical computations.
3. Initial-Value Formulation We start by differentiating Eqs. (2.6)-(2.9) with respect to the imbedding parameter a. Assuming all necessary conditions for the interchangeability of the order of differentiation, we find that the new functions u3 and u3 satisfy v4u3 = 0,
v4u3 = 0,
(3.1)
subject to U,(O,
Y , a7 a) = U3(X, 0, a, 0)= U3(X, 1, a7
g) = 0,
[u3(0,Y , 4 0)11 = [u3(X, 0, a, 0112 = [U3(X, 1, a, a112 = 0,
u,(O, Y , a, a) = u3(X, 07 a, 0)= u3(X, 1, a7 0)= 07 [u3(0, Y , a, u)]i = [u3(X7 0, a, 0)]2 = [u3(X, 1, a, .)I2 along the edges x = 0, y = 0, and y to a in Eqs. (2.8) and (2.9) yields
and
=
1. At x
=a
(3.2)
= 0,
differentiation with respect
110
5
PARTIAL DIFFERENTIAL EQUATIONS I1
Comparing the problems for u and v with those for u3 and v 3 , we see that the problems are similar except for the forcing functions at x = a. Applying superposition as in (2.10) we have 1
u3(x,Y , a,
4 = 2 J 0 4x7 Y , a,v)u122(a, ?, 44 d?
and
Let us define two new functions by
@, Y , a,4 = u,(x, Y , a,4,
$(x, Y , a7
0) =
q ( x , Y , a, 4. (3.9)
Differentiation of (3.7) and (3.8) with respect to x yields 1
e3(x,
Y9
e(x?Y ,
a,a) =
?)e22(u7
?7
a,
d?
0
(3.10) and
Using the definitions of 0 and $,(3.7) and (3.8) become
14x7 Y , 1
u3(x,Y , 4 4 = 2
and
0
4 ?)022G7, 'I,a,4 4
111
3. INITIAL-VALUE FORMULATION
These are our fundamental imbedding relationships.We shall regard these four equations as initial-value problems for all a 2 x , x being fixed. In order to define more precisely our Cauchy system, let us introduce the functions ~ ( aY,, 4 = e(a, Y , a, 4 = u&, Y , a, 4, qta, Y , 4 = $(a, Y , a,4 = q(a, Y , a, 4,
rta, Y , 4 = u(a, Y , a, 4, s t 4 Y , 4 = u(a, Y , a, a). Differentiation of p with respect to a yields
(3.14)
pl(a, Y , a) = O,(a, YY a, 4 + 83(a, Y , a, (0 (3.15) = u11 ( ~Y,, a, 0 ) + e3(a,Y , a, 0). If we use (2.13) to replace ull and (3.10) evaluated at x = a to replace 8,, we find that p satisfies 1
Pl(%Y , 4 = StY - 4 + 2 s p(a, Y , rtIPzz(a9 0
r 3
44 (3.16)
In a similar manner we find the following equations for q, r, and s:
(3.17)
From (2.7) we find the initial conditions P(0, Y , 4 = do, Y,0)= 4 0 , Y , 0 ) = 40,Y , 4 = 0.
(3.20)
The following auxiliary boundary conditions were derived from consideration of Eqs. (2.7)-(2.9) : p(a, 094 = P(a, 1 , a ) = p(a, Y , 0) = p(a, Y , 1) = 0, d a , 0 9 4 = qta, 1,o) = q(a, Y , 0) = d a , YY 1) = 0, r(a, 0, o) = r(a, 1, o) = r(a, y, 0) = r(a, y , 1) = 0, s(a, 0,6)= s(a, 1, Q) = s(a, y , 0) = s(a, y, 1) = 0.
(3.21)
112
5
PARTIAL DIFFERENTI/,L EQUATIONS I1
To find u(x, y , a, a) and u(x, y , a, CJ)for a given x , we proceed as follows: Starting with (3.20), we solve Eqs. (3.16)-(3.19), subject to (3.21), from a = 0 to a = x . Then we adjoin Eqs. (3.10)-(3.13) which can be rewritten in view of (3.14) as 1
03(x, Y , a , 4 = 2 J
0
w, Y , a,
?)Pz2(a, ?,
44
1
- Jo $(x7 Y , a, ? ) r 2 2 2 2 ( a * ?, a> 4,
1(/3(x,Y , a , 4 = e ( x , Y , a, 0 ) + 2 J
1
0
w, Y , a, 1)922(a, ?, 4 4
1
- Jo $ ( X ? Y , a9
?)sz222(a,
?>0 ) d%
(3.22)
1
%(X, Y , Q, 4
=2
J u(x, Y , a,
?)P22@,
0
?,
44
I, 1
-
u(x, Y , a9 v)r2222(a, ?, 4 d?, 1
h(X,
Y , a, a) = 4 x 3 Y , a, a) + 2 J 4x9 Y , a , 1)922(a, ?, a> d? 0
1
- Jo u(x, Y , a, ?)S2222(% ?, 6)4. These equations are subject to the initial conditions
w,y , x , 4 =
Y , a), u(x,y , x , a) = 4x9 y , a), P(X,
y , x, 4 = d x , y , 4, u(x, y , x, 4 = 4x3 y , a),
%4
(3.23)
and auxiliary conditions similar to those in (3.21) which follow directly from (2.7)-(2.9). The entire fundamental system has now been described as an initial-value problem in terms of the imbedding parameter a. In order to obtain the solution of the original problem, we use superposition as given by Eq. (2.10). We have therefore accomplished a reduction of the original boundaryvalue problem in terms of the biharmonic equation, to a Cauchy system in terms of integrodifferential equations subject to initial values. We should prove now the converse, i.e., that every solution of the Cauchy system is also a solution of the original boundary-value problem. The reader should try to prove this as an exercise. He can compare his findings with the results in the Bibliography given at the end of the chapter.
113
4. RECIPROCITY RELATIONS
4. Reciprocity Relations
The well-known reciprocity relations
p(a, y, 6) = p(u, 6,y),
s(a, Y, a) = s(a, 0 , Y ) ,
d a , Y,4 = r(a, 6,Y ) ,
(4.1) a special case of the theorem of reciprocity of Betti, can be derived directly from the results obtained in Section 3. In order to prove this we can proceed as follows: Setting
.>
4%y , 4 = p(a, Y , 4 - p(a, OY Y), P(a, Y , 4 = 4 7 ,Y , - s(a, 6,r),
(4-2)
x u ,y, 4 = qta, Y , a) - rta, Q, Y), we seek appropriate differential equations for a,8, and A. This is not difficult to do, by differentiating (4.2) with respect to a and by making appropriate use of the integrodifferential system obtained in Section 3 for the functions p , q, r, and s. We leave as an exercise to the reader to prove that a,p, and A in Eqs. (4.2) satisfy the equations
and
subject to the homogeneous initial conditions
4 0 ,y , a) = 0,
B(0, y , 0 ) = 0,
40, y , a) = 0,
(4.6)
114
5 PARTIAL DIFFERENTIAL EQUATIONS I1
obtained by consideration of (3.20) and (4.1). Clearly 4 7 ,
y , a> = 0,
A h , y , a) = 0
/?(a, y , 0 ) = 0,
(4.7)
is a solution of the homogeneous system (4.3)-(4.6). Since this system is linear, (4.7) is the unique solution, proving (4.1), our original assertion. 5. Integral Riccati Transformations Instead of using the two auxiliary boundary-value problems (2.6)-(2.9) and then applying ideas of invariant imbedding, we could have treated the present problem by directly pursuing the idea of “ missing” boundary conditions, so successfully employed in the previous chapters. The two formulations are equivalent, as should be expected. We illustrate this idea by considering the “missing” functions w(a, y ) and w,(a, y ) at the edge x = a in the example of Section 2, given as linear functionals of the “data” functions n(a) and m(a), i.e., 1 0 1
1
wl(a, v) = - d a , Y , ah(.) 0
+ S0 r(a, Y , a)m(a) da, 1
w(a, V ) = - J” $(a, Y , a>n(a>da
da +
1
1
(5.1)
p(a, y , a)m(a)da.
0
The linear transformation defined by (5.1) generalizes in a natural fashion the Riccati transformation operated with matrices in previous chapters. The kernel of the transformation, i.e., functions p , q, r, and s, is expected to satisfy initial-valued functional equations. We show this in the following. Differentiation of (5.1) with respect to a yields
-1
1
w,(a, V >=
0 1
+ S,
1
w,l(a, Y> = -
1
J” $(a, Y , a)na(a)do Y , a)m(a>do + J” r(a, Y , a)ma(a>do,
sl(a, Y , a>n(o> da -
0
1
0 1
J” qI(a,Y , a)n(a>da - J q(a, Y , a)na(a>do 0
where na and ma are given by
0
(5.2)
115
5. INTEGRAL RICCATI TRANSFORMATIONS
as it follows from differentiating (2.3) and (2.4) with respect to a and making appropriate use of (2.1). Recalling w(a, y ) and w,(a, y ) given by (5.1), Eqs. (5.3) can also be written na(a> =
J’
1
0
~ 2 2 2 2 ( a 0, , ‘IM(’I)d
1
m,(4 = 4 . )
+ 2 J-0 4 2 2 @
‘~ -
J
1
0
4,
r 2 2 2 2 ( a , 0 , ‘I>~(‘I>
(5.4)
1
0,
M r ) 4 - 2 J0 P 2 2 ( G
6 9
v>m(‘I)4
Substitution of w,(a, y) given by (5.1), w,,(a, y ) given by (2.3), and n,,
ma given by (5.4), into (5.2) yields
1
+ P ( 4 Y , 0 ) + 2 J0 A4 Y , 1 ) 4 2 2 ( 4 v, 4 d‘I
) 44I
- Jolda,Y , v ) s 2 2 2 2 ( 4 ‘I,0 ) 4
do = 0,
where the delta function appearing in the second equation has been used in order to include m(a) under the integral sign. Equations (3.16)-(3.19) follow directly from (5.5) since Eqs. (5.5) must hold for all m(o) and n(a). It is finally noted that the initial conditions (3.20) and additional conditions (3.21) follow immediately from consideration of (2.2) and (5.1). We have therefore proved that p, q, r, and s, the kernel functions of the integral Riccati transformations (5. l), satisfy the Cauchy system derived in Section 3, exhibiting the equivalence of both methods. Along similar lines we could prove that functions u(x, y, a, a), ~ ( xy,, a, a), O(x, y, a, a), and +(x, y, a, 0 ) in the equations 1
Nx,Y ) = w ~ ( xV, ) =
1
- J’0 4 x , Y , a, 444 do + J’0 u(x, Y , a, a)m(a) da,
J’
1
- Jib, Y , a, a)n(a) do + 0
1W, y , a, a)m(a) do, 1
0
116
5 PARTIAL DIFFERENTIAL EQUATIONS I1
satisfy the Cauchy system (3.22)-(3.23), and the associated set of additional conditions similar to (3.21). We leave this derivation as an exercise for the reader. 6. Computational Aspects
At this point it is convenient to consider possible numerical schemes for the solution of our equations. The Cauchy systems formulated in previous sections can be solved in principle using various quadrature methods. Use of a discretization scheme in the y direction is one possible path of action. We choose this path to illustrate how our equations can be easily reduced to algorithms suitable for solution with a digital computer. Suppose we are interested in the computation of the displacement at the free edge, x = a, of a rectangular plate produced by the action of moments m(y) and vertical forces n(y) along this edge. These quantities, w(a, y) and wl(a, y), are given by Eqs. (5.1), which we reproduce here: 1
5,
w(a, Y ) = - Nu, Y, >.(n). w1(a, Y) =
-I’
do +
1
1
J 44 Y , a)m(a) da, 0
1
4(a,Y , M a )
0
+ J-0 p(a, Y , 46d do,
(6.1)
to facilitate the task of the reader. Subdividing the edge x = a into N equidistant points so that yi=iA,
aj=jA,
i , j = 1 , 2 ,..., N,
(6.2)
and ( N + 1)A = 1, we can integrate (6.1) over the interval [(i - $)A, (i + +)A] and write the results in the form
where u, v , n, and m are N-dimensional column vectors whose ith components are the average intensity of the corresponding continuous quantities w(a, y), w,(a, y), n(y), and m(y) along the interval [(i - $)A, (i + +)A]; e.g., if di) denotes the ith component of vector u, we shall have
117
7. INFLUENCE OF POISSON’S RATIO
The N x N matrices S, R, Q, and P are similarly given by integration of the functions s, r, q, and p . For example, we have 1
R=A’
(1“ 1 i+1/2)A
(j+1/2)A
(i- I / Z ) A
(j- I / Z ) A
r ( a , y , o)d’do),
i , j = 1,2, ..., N. (6.6)
The composed matrix (6.7)
a flexibility matrix, can be shown to be symmetric, a consequence of the reciprocity relations given in Section 4. We can now easily find ordinary differential equations for the quantities in Eq. (6.7) by differentiating R given by (6.6) and corresponding equations for S, Q, and P , under the integral sign and making use of Eqs. (3.16)-(3.19). Application of a convenient quadrature formula yields the system of ordinary equations
+ RT f RTKR + SLS, R, = P + RKP iSLR, Pa = I + PKP -t RrLR, S,
=R
S(0) = 0, R(0) = 0, (6.8) P(0) = 0, where the initial conditions follow directly from (3.20). The matrices K and L depend on the discretization of the second and fourth derivatives in the integrands of (3.16)-(3.19), the auxiliary conditions (3.21), and the particular quadrature formula used. If the trapezoidal rule is used to approximate integrals and central differences are used to replace derivatives, then the equations in (6.8) reduce exactly to Eqs. (10.6) of Chapter 4 where Poisson’s ratio v should be set equal to zero, taking due account of the notation and different sign convention for the shear forces.
7. Influence of Poisson’s Ratio In the example carried out in this chapter, we assumed for simplicity that v, Poisson’s ratio of the material, was zero. Here we release this restriction and assume that v can take any value in the interval 0 Iv I The upper
+.
limit corresponds to the condition of incompressibility of the material. To take into account the influence of Poisson’s ratio, we consider the same problem discussed in Section 2 and introduce the function of three variables u(x, y , v ) such that
v4u = U l l l l + 2u1122 + u 2 2 2 2
= 0,
(7.1)
and u(0, y , v ) = u(x, 0, v ) = u(x, 1, v ) = 0 ,
Ul(0, Y , v )
= uz(x, 0, v ) = u,(x, 1, v ) = 0 ,
(7.2)
118
5 PARTIAL DIFFERENTIAL EQUATIONS I1
in the rectangular domain 0 I x Ia, 0 I yI 1, and such that u11
Ulll
+ vu22 = W ) ,
(7.3)
+ (2 - v>u12z = n w .
The reader familiar with elementary plate theory is aware that u represents the deflection of a rectangular plate clamped at the edges x = y = 0 and y = 1, subject to forces n(y)and moments m(y)at the free boundary x = a, and made of a material whose Poisson’s ratio is v. Therefore w defined in Section 2 is related to u by the equation w(x, u) = 4 x 7 Y , 0). (7.4) Clearly, we could apply the method developed in Section 3 or that of Section 5 to the solution of the present boundary-value problem defined by Eqs. (7.1)-(7.3). We encourage the reader to pursue one of these paths. Our approach, however, is different. In fact, since v is the variable of interest, we seek the construction of a Cauchy system in terms of v and use the available resultsfor v = 0, as the pertinent initial conditions. Toillustrate the main ideas of the method, we restrict ourselves to the derivation of an initial-value problem for the deflection u(a, y , v) and the slope u,(a, y , v) at the free edge x = a. It is first shown that these quantities satisfy a system of Fredholm integral equations and then we use invariant imbedding to operate the reduction to a Cauchy system. Let v(x, y , v) denote the difference v(x, y , v) = @, y , v) - w(x,
v) = 4%y , v) - u(x, y, 0).
Clearly, v satisfies the boundary-value problem v4v = 0 v(0, y , v) = v ( x , 0, v) = v ( x , 1, v) = 0 V , ( O , y, v) = u2(x, 0, v) = V , ( X , 1, v) = 0 v11
Vlll
(7.5)
(7.6)
= -VU22
+ 2 V m = vu122.
This system is identical to Eqs. (2.1)-(2.4), where the moment m(y)and vertical forces n(y) at the free edge are substituted by the values - vuzz and vulzz, respectively. Therefore, the functions v(a, y , v) = u(a, y , v) - w(a, y ) and vl(a, y , v) = ul(a, y , v) - wl(a, y ) can be represented by superposition:
I
1
u(a, Y , v) = w(a, Y ) - v
s(a, y , c)u122(a,c, v) do
0
- v Jolr(a, Y , c>u,,(a, 0, v) do, (7.7)
1
UI(~,Y , V) = wi(a,
U) -
v j da,Y , c)u1n(a, 0
0 , V)
119
8. INVARIANT IMBEDDING SOLUTION
a system of integrodifferentialequations of the Fredholm type for the quantities of interest, u(a, y, v) and u,(a, y, v). Introducing the following notation
(7.9) and A=
i),
(7.10)
and recalling that w(a, y ) = u(a, y, 0) and that w,(a, y) = u,(a, y, 0), Eqs. (7.7) can be written in the compact form
Note that in this notation the reciprocity relations (4.1) reduce to
XCa,y, 4 = XT(40 , u).
(7.12)
Equation (7.1 I), an integrodifferential equation, can be easily transformed into an ordinary second-order Fredholm integral equation by the simple device of integrating twice by parts, thus obtaining
where conditions (3.21) and (7.2) have been used to eliminate the boundary terms appearing in the integration by parts. Our problem next is to solve Eq. (7.11) or, alternatively, (7.13), assuming that the problem has already been solved for v = 0, i.e., that z(a, y, 0) and X(a,y, a) are known. 8. Invariant Imbedding Solution
Our aim is to reduce (7.11) or (7.13) to a Cauchy system. This can be accomplished in a number of ways, using ideas of invariant imbedding. We could, for example, start our analysis by using the Cauchy system for the resolvent kernel of the integral equations. The imbedding parameter would be in this case the length of the interval of integration. In this fashion we could derive an initial-value problem in terms of the width of the plate, i.e., the length in the y direction. Several types of Fredholm integral equations can be treated along these lines. (See the Bibliography at the end of the chapter for references pertaining to the aforementioned items.)
120
5
PARTIAL DIFFERENTIAL EQUATIONS I1
However, as already noted in Section 7, out task is to use v as the basic imbedding parameter. Surprisingly, this can be easily done. The resulting Cauchy system will be an initial-value problem with respect to v, a convenient parametrization for studying the influence of v in the stress distributions. To this end, we shall use some results on integral equations due to R. Kalaba, which are limiting forms of the classical resolvent equations in functional analysis. We can write the solution of (7.13) in terms of the resolvent kernel R(y, o,v), a 2 x 2 matrix function, as
where for simplicity we have omitted the dependence of R on the length of the plate a. We will now find initial-value problems for both z and R as functions of v. Differentiating(7.13) with respect to v, we have 1
zv(a,Y , v) = -Jo Xz2(a, Y , o ) M a , u, v) do - v
Xzz(a,y , o)Azv(a, o,v) do,
Jol
(8.2) or, using (7.13) to eliminate the first integral in (8.2), 1
zv(a,Y , v) = (l/v)[z(a, y , v) - z(a, Y , 011 -
X d a , Y , o)Azv(a, 6, v) do.
(8.3) Once again we can employ the resolvent kernel to write the solution of Eq. (8.3) in the form zv(a, Y , v) = (l/v)[z(a, Y , v) - 4% Y , 0)l "1
Substitution of z(a, y , v) given by (8.1) into (8.4) yields
an initial-value problem for z(a, y , v) with respect to v since we assumed to know z(a, y , 0), the initial condition of (8.5). In order to solve (8.5), however, we need to know the resolvent R. To this end we now construct an initialvalue problem for R. Substitution of z(a, y , v) given by (8.1) into (8.5) yields the equation 1
zv(a,Y , v)
=
J w,vMa, u,o>do 0,
0
121
NOTES, COMMENTS. A N D BIBLIOGRAPHY
On the other hand, differentiating (8.1) with respect to v, “1
Comparison of (8.6) and (8.7) yields [since z(a,a, 0) is arbitrary] R,(y,
0,v) =
J k Y ,
4,v)R(4,0,v) d4,
0
(8.8)
the desired initial-value problem for the resolvent R in terms of v. Since the kernels R and X,, A must satisfy the classical equation for the resolvent
R(Y,a, v) = - X d a , Y ,
-v
1‘x2,(a, 0
Y , WW, 0,v) dt,
(8.9)
the initial condition for (8.8) will be N Y , 620) = - Xzz(a, Y , O M .
(8.10)
Equation (8.5) subject to the obvious initial condition z(a, a, 0), assumed to be given, and Eq. (8.8) subject to initial condition (8.10) comprise the desired Cauchy system in terms of Poisson’s ratio v. NOTES, COMMENTS, AND BIBLIOGRAPHY
1. For the variation of Green’s function with the contour see J. Hadamard, Memoire sur le problkme d’ analyse relatif i I’equilibre des plaques elastiques encastrees. Memoires present& par divers savants a 1’Academie des Sciences de I’Institut de France, Vol. XXXIII (1908); R. Bellman and H. Osborn, Dynamic Programming and the Variation of Green’s Functions, J . Math. Mech. 7, No. 1 (1958), 81-86; V. Volterra, “Theory of Functionals.” Dover, New York, 1959; M. M. Schiffer, Boundary-Value Problems in Elliptic Partial Differential Equations, in “Modern Mathematics for the Engineer” (E. F. Beckenbach, ed.). McGraw-Hill, New York, 1956 (paperback).
2-4. Here we follow E. Angel, N. Distkfano, and A. Jain, Invariant Imbedding and the Reduction of BoundaryValue Problems of Thin Plate Theory to Cauchy Foimulations, Internut. J . Engrg. Sci. 9 (197 l), 933-945.
A proof of the converse, i.e., that every solution of the nonlinear Cauchy problem satisfies the original linear boundary-value problem, is given in E. Angel and N. Distefano, Equivalence of a Cauchy System and a Class of Boundary-Value Problems in Thin Plate Theory, J. Engrg. Math. 6 , No. 2 (1972), 117-123.
122
5
PARTIAL DIFFERENTJAL EQUATIONS I1
Application of this method to the solution of thin shells of revolution may be found in N. Distkfano and A. Jain, A Cauchy System in the Linear Theory of Thin Shells of Revolution, Proc. SECTAM VII March 1974.
7. The influence of Poisson’s ratio has been studied using classical arguments by Westergaard. See H. M. Westergaard, ‘‘Theory of Elasticity and Plasticity.” Harvard Univ. Press, Cambridge, Massachusetts, 1952.
8. The results presented here were first given in E. Angel and N. DistCfano, Invariant Imbedding and the Effects of Changes of Poisson’s Ratio in Thin Plate Theory, Internat. J. Engrg. Sci. 10 (1972), 401408.
For a derivation of a Cauchy system for the resolvent see R. Bellman, Functional Equations in the Theory of Dynamic Programming-VIII: A Partial Differential Equation for the Fredholm Resolvent, Proc. Amer. Math. SOC.8 (1957). 435440.
For a connection between matrix Riccati equations and Fredholm resolvents see A. Schumitzky, On the Equivalence between Matrix Riccati Equations and Fredholrn Resolvents, J. Comput. System Sci. 2, No. 1 (1968), 76-87.
The solution of Fredholm integral equations using invariant imbedding ideas has been extensively studied by R. Kalaba. For applications of a class of integral equations of interest in radiative transfer and other branches of physics, see R. Kalaba, Reduction of Matrix Integral Equations with Displacement Kernels on the Half-Line to Cauchy Systems, in “ Invariant Imbedding” (R. Bellman and E. Denman, eds.), Chapter 4, Lecture Notes in Operations Research and Mathematical Systems No. 52. Springer-Verlag, Berlin and New York, 1970.
For applications of the theory of dual integral equations in potential theory in connection with the problem of thermal diffusion in a cylinder see R. Kalaba and E. Ruspini, Invariant Imbedding and Potential Theory, InterMr. J. Engrg. Sci.7 (1969), 1091-1101.
The method of this section is based on a result first given in J. Casti and R. Kalaba, On the Equivalence between a Cauchy System and Fredholm Integral Equations, USC-EE Tech. Rep. 70-21 (March 1970).
which in turn may be considered a limiting form of some classical results for the resolvent. See, for example, A. N. Kolmogorov and S.V. Fomin, “Elements of the Theory of Functions and Functional Analysis,” Vol. 1, pp. 110-112. Graylock Press, Rochester, New York, 1957.
Chapter 6
Dynamic Programming
1. Introduction
In this chapter we wish to present some of the fundamental ideas and techniques of dynamic programming, the counterpart of invariant imbedding in the realm of variational processes, as it applies to a number of basic problems in structural mechanics. The origins of dynamic programming lie in the theory of multistage decision processes. The advent of the digital computer and the needs of modern engineering analysis have led in a natural way to a look at the calculus of variations as a multistage decision process, thus enlarging in an almost unlimited fashion the scope of the theory. There are several important sources of variational problems that fall within the scope of this book. In the first place we have the problems of equilibrium in mechanics. In fact, an alternative way to formulate models in mechanics is through the use of variational principles: A quantity, energy, written as a functional of the variables of the system, reaches a minimum value when it corresponds to the configuration of equilibrium of the system. Teleological principles, seeking conditions for equilibrium, are at present well understood and embodied in the developments of the calculus of 123
124
6
DYNAMIC PROGRAMMING
variations, an important branch of analysis. Philosophical as well as scientificrivalry between variational and nonvariational models has reduced at present to only prosaic considerations and disputes over alternative computational advantages. On the other hand, the control of engineering processes on one hand, and the problems arising in the emerging theory of optimal structural design on the other, lead naturally to variational formulations. Last but not least we must consider the important class of inverse problems that can be formulated as optimization problems. In this class we recognize, among others, the problems of system identification, which is of paramount importance in modern nonlinear mechanics. In this chapter we concentrate mainly on the first class of problems mentioned in this introduction, i.e., on those problems arising from consideration of variational principles in mechanics. The inclusion of a problem on system identification at the end of the chapter is an exception to this rule, a decision taken mainly on methodological grounds. A systematic treatment of system identification and structural optimization problems finds its place in specific chapters of this book.
2. ALinearString
To illustrate the basic ideas of the theory, let us consider the example of the linear string supported on elastic springs discussed in Chapter 1. We consider the potential energy ei stored during the deformation of a generic link between the nodes i and i + 1. This energy, assuming for simplicity that there is no external load acting on node i, is formed by the energy needed to produce the displacement uiof the spring plus that needed to elongate the string between nodes iand i + 1. Under the hypotheses of small deformations, ei can be written ei = +(kiu: lSwiz), (2.1) where wi is the slope of the string to the right of node i. Clearly, the functional
+
N- 1
E(ui) =
+ C (ki uiZ+ ISwi’) +
+kN uN2,
i=O
(2.2)
where ui and wi are related by the continuity condition Ui+l = ui
+ lw,,
(2.3)
represents the potential energy of the system formed by N links and in the absence of external loads. We assume the ends of the string to be fixed and, in particular, u N = 0,
uo = c.
(2.4)
125
3. THE PRINCIPLE OF OPTIMALITY
We shall use an imbedding procedure to solve our problem. To this end we define N-1
fn(un) = min
41 (kiui2+ /swi2), n
(2.5)
where the minimization can be performed with respect to either ui or w isince both quantities are related by (2.3). Equation (2.5) exhibits our fundamental imbedding: We are considering the minimum potential energy of the family of strings of variable lengths ( N - n)Z, with n varying from n = N - 1 up to n = 0, and subject to a displacement u, at the end node n. Clearly, fn(u,)is a function of n and u,, but may also be interpreted as a functional of the sequence u,,, ~ , , + 1 , ... , uN-1 (or w , , w,,+~, . . . , w ~ - ~ Our ) . next task is to find a functional equation relating the quantitiesS,(u,,). To this end, choosing w, to be the decision variable, we can write
= min[HknunZ
+ lswn2) +fn+i(un+l)I,
W"
a result that on account of (2.3) yields fn(un) = min[f(k,un2
+ /swn2)
+fn+l(un
+ /wn)I,
(2.7)
W"
a functional equation for the minimum potential energy, subject to the initial condition (2.8) fN-i(uN-1) = f(kN-1 + slM-1,
~ in the equation an expression that was obtained by substituting w ~ =-uN-l/i fN-i(uN-1)
= f(kN-iui-1
+ /swi-i).
3. The Principle of Optimality The functional equation (2.7) was obtained using some properties of the minimum operation, as indicated in Eq. (2.6). We can derive (2.7) in a more direct fashion. Consider a typical member of the imbedding family, e.g., the string comprised between nodes n and N , in the equilibrium configuration.
126
6 DYNAMIC PROGRAMMING
Fig. 6-1
See Fig. 6-1. We shall use an asterisk to differentiate the slopes associated with an equilibrium configuration from those merely satisfying kinematic constraints. Thus, since the energy is an additive quantity, we have by definition
+ ~ S W , +L+l(un *~) + lwn*),
(3.1) i.e., we consider the potential energy of the string (n,N ) in its equilibrium configuration to be equal to the potential energy stored in the link (n,n + l), plus the potential energy of the remaining string (n + 1, N ) which is clearly subject to the displacement u,,+l = u,, + Iw,* at node n + 1 . Now, from the principle of minimum potential energy, if instead of w,*, we use any admissible w,,in (3.1), we must have fn(un)
= $(knun2
L(UJ 5 H k n U n 2 + lSwn2) + L + l ( u n + lwn),
(3.2) where the equality sign holds only for w,, = w,*. Clearly, (2.7) follows immediately from (3.2). The considerations that precede are a particular version of the principle of optimality by Bellman. See any of the books given as references of Section 1 , at the end of the chapter. We return again to this point in Section 25. 4. An Analytical Solution
The results of the last section can be considerably advanced, providing an elegant solution of the string, if we use calculus to find the minimizing slope wn* at each stage of the optimization process. In fact, the condition for a minimum in (2.7) is ISwn
+ (a/awn)fn+l(un + lwn) = 0,
(4.11
which on account of (2.3) reduces to
Clearly, since Sw,,is the vertical component of the string tension, the condition of optimality (4.2) of the Bellman-Hamilton-Jacobi equation (2.7) is an expression of the theorem of Castigliano.
127
EXERCISES
Now, it is easy to show by an inductive reasoning on (2.7) and (2.8) that fn(un)is a quadratic function in its argument. Hence if we write fXUA
= tRn un2,
(4.3)
Eq. ‘(2.7)reduces to R,u,Z
= k,~,’
+ ISW,’ + R,+~(u,,+ Iw,,)~,
(4.4) where w,,in (4.4) is the value that minimizes in (2.7), i.e., w, satisfies the equation SW,, R,+l(u, + ZW,,) = 0, (4.5) from which we derive
+
Instead of directly eliminating w, between (4.4) and (4.6), we take an intermediate step that simplifies the algebra. In fact, we combine (4.4) and (4.5) to rewrite (4.4) in the form
which, on account of (4.6), and after collecting terms in un2,leads to
a backward recursive equation for R, subject to the initial condition RN-1 = kN-1
+ Sll,
(4.8)
obtained from consideration of (2.8) and (4.3). Finally we wish to show that R,, given by (4.7)-(4.8) and 2, given by Eqs. (8.6)-(8.7) of Chapter 1 are related in a simple manner. All we have to do is to compare Z,, with RN-”because of the opposite “time” directions in both cases. Very simple manipulations show that
RN-,,= k,,
+ SZ,, .
(4.9)
EXERCISES 1. Consider k, constant and equal to k > 0. Show that, as n tends to infinity, the initial slope of the string is related to the initial deflection uo by means of the equation
wo=--
R S + 1R ‘O’
where R is the positive solution of
R2- k R - k(S/l)= 0 .
128
6
DYNAMIC PROGRAMMING
2. The potential energy of a string of N links subject to loads p , on the nodes is given by
where u1 and w 1are related by the equation u l +
and
= u1
+ Iw, . Set
M u ) = R.uZ + r,u + s..
Find recurrence relations for R., r., and s.. What are the initial conditions of those relations if U N = O? 3. Show that the Riccati equation R'
=k
- ( l/S ) R 2,
where k = liml,o (kJl), is the limiting form, as I tends to zero, of the differenceequation (4.7).
5. Constraints
The simplicity of the analytical solution derived in the previous sections is largely due to the use of differential calculus to minimize at each stage of the process. This procedure, however, will not be legal in general because we shall be bound by local constraints imposed on the displacements and slopes such as to render the expression to be minimized, nondifferentiable. In general, the structure of the analytical solution of the constrained case will be much more complex than that of the unconstrained one. Paradoxically, the direct numerical solution turns out to be easier in the constrained case than in the unconstrained one. We defer a discussion of the numerical solution to the next section where more general cases are discussed.
6. A Nonlinear String If we assume that the springs are nonlinear, the potential energy stored by them will no longer be a quadratic functional. For example, we can think of a spring whose force-displacement law is given by F, = k,u, + 2rnun3. The potential energy stored in such a spring will be equal to t(k, u,' + r, un4). In general we shall consider, instead of (2.5), the nonquadratic functional N- 1
f,(un)
= min
31 (hi(ui) + lswi2) + hN(uN), n
where hi(ui) is the potential energy stored in the spring i.
(6.1)
6.
129
A NONLINEAR STRING
More generally, we can think of the potential energy stored in the spring i and the link i, i + 1 as a function of the type gi(ui, wi , So),where So is the tension of the string at a given reference state. In this case we consider N-1 f.(un)
= min
C gi(ui
7
wi 9
n
so) + C P ( ~ N ) ,
(6.2)
where p(uN) is the potential energy stored in the last spring. By following the arguments of Section 3 step by step, we readily obtain the functional equation
where v is a dummy variable and where for simplicity we omitted So in gn. The end condition reads fN(u)
(6.4)
= q(u)*
In general, the determination of the structure of the solution of (6.3) and (6.4) by analytical methods can be a matter of considerable difficulty, particularly when u,, and w,, are subject to local constraints. Thus one sees the interest in concentrating here on numerical procedures. To illustrate the essential ideas we shall consider local constraints on the slopes and displacements of the type O
Iw,,~
rd,,.
(6.5)
We consider that for a fixed n, only a discrete set of values can be taken by u,, and w,,. For example,
where u, and /3, are such that a, 6 = c,, and /3, y a discretized version of (6.3) will read
. With these restrictions,
= d,,
(6.7)
where i
= 0, 1,2,
..., u,, and wheref, is subject to the end condition f N ( i 6 ) = q(i6).
(6.8)
We can see that the problem has reduced to the minimization of a sequence ofN - 1 functions of one variable, a problemwithin even modest computational capabilities,if reasonable values of a,,and B,, are prescribed. The procedure to follow at a typical computation stage is very simple. At the stage n we assume to have available in rapid access storage, the values of the functionf,,, at the points 0, 6,26, . . . ,~ , , + ~which 6 , were computed in the previous stage. Now,
130
6
DYNAMIC PROGRAMMING
for each fixed value of i, we minimize the right-hand member of (6.7) by using, for example, an exhaustive enumeration procedure, and retain the values of j that minimize. We shall denote these values byj(i). In order to evaluatef,,, at the points i6 Qy, we make use of the stored values off,, at the points id, together with some interpolation procedure, if needed. We repeat the procedure for each admissible value of i and proceed to store the values of the new functionf, . One of the typical difficulties arising in this method is that for some i 5 a,, and j 5 j,, the argument i6 l j y may fall outside the range for which the function is defined. What we can do in this case is to restrict the set of values of the admissible slopes further. For example, in our present case we would consider only values o f j that satisfy the original constraint I j l 5 fin and the additional one
+
+
0
+ Qy ~ a , + , d ,
0I i
(6.9)
+ 3242) + 3(u52 +&u54),
(7.1)
7. A Routing Problem
As an example we consider the functional 4
J(uJ =
+c
( U i Z +&Ui4
i=O
where ui and ui are related by the continuity equation Ui+l =
ui
+
ui,
(7.2)
subject to the particular initial condition 245
= 3.
(7.3)
In addition to the fixed end condition (7.3) we consider the following constraints on the displacements u i , 0 5 ~ ~ 5 5 i,= O , 1 , 2 , 4 ,
0
5243
52,
(7.4)
and the following constraint on the slopes u i ,
l u i l r l , i = O , l , ..., 4.
(7.5)
We discretize ui and u i in uniform increments of one, i.e., 6 = y = 1. With this discretization in mind and taking into account (7.4), the displacements ui are restricted to take the values
ui={0,1,2,3,4,5}, u3
= (0, 1921,
i=O,l,2,4,
(7.6)
131
7. A ROUTING PROBLEM
and the slopes the values u i = { - 1 , 0 , 11,
i = O , 1,2,3,4.
(7.7)
We observe that consideration of the continuity equation (7.2) in combination with the constraints (7.6) and (7.7) introduces further constraints on the displacements. In Fig. 6-2 we represent with a large dot all possible states of the nodes, i.e., the displacements ui ,and with dotted lines, all possible slopes between adjacent nodes. So posed, the problem can be treated as an optimal routing problem, namely, for any given admissible state u o , find the trajectory connecting feasible states associated with permissible slopes so as to minimize the functional (7.1). We define as usual
f.(un) = min
+
4
(u: +&u: n
+ 3u:) + 5.31,
(7.8)
and construct the functional equation
where un has been replaced by i = 0, 1, .. .,according to (7.0, vi by j = - 1, 0, 1 according to (7.7), and where g(i,j) is the potential energy stored in a generic link given by g(i,j) = +(i2 + h i 4
+ 3j’).
(7.10)
The minimum potential energy h(i)satisfies the initial condition f5(3) = 5.31.
(7.11)
We solve the function equations (7.9) and (7.1 1) directly on the graph of Fig. 6-2. We start by considering the last link and compute
+
f4(2) = g(2, - 1) 5.31 = 8.97 f4(3) = g(3,O) + 5.31 = 10.62.
(7.12)
The values of f4(2) and f4(3) are recorded in the circles located above the large dots representing the nodes. The arrows indicate the optimum slope; in the present case there is only one possible slope for each node at n = 4. Then we consider the chain with two links and compute
f3(1)
= g(1,
f3(2) = min
- 1) +f4(2)
= 2.01
+ 8.97 = 10.98,
g(2,O) +$4(2) = 2.16 +8.97 = 11.13
- 1) +f4(3)
= 3.66
I
+ 10.62 = 14.28
= 11.13 (U = 0).
(7.13)
In I1
c
P C
ro I1
c
133
8. A CONTINUOUS ANALOG
The values of f3( 1) and f3(2) are again recorded in circles above the nodes, with the arrow that indicates the slope u that minimizes. Proceeding in the same fashion, adding one link at a time, we finally compute all thef,(i) in a sequential manner, by minimizing functions of one variable at each stage of the process. At the same time the arrows associated with the minimum potential energy functionsprovide the optimal trajectories, i.e., the elasticas with the same endpoint us = 3. For example, the elastica with the fixed ends uo = 3 and us = 3 is the trajectory obtained following the arrows from the node uo = 3. This is the dashdot line in the figure. Another example is provided by the dashed line in the figure. This, the elastica starting at uo = 5 , has been clearly affected by the constraint on the deflection at n = 3. The reader could convince himself that this is the case by solving the unconstrained case. Or, is there a quicker way to prove that by removing the constraint u3 I 3 , the elastica will change? Finally we note that if the displacement at n = 0 is not prescribed, the associated elastica will be that for which the potential energy is minimum. In the present case the minimum offo(i) occurs at i = 0 withfo(0) = 12.48 and an associated elastica indicated by the dotted line. 8. A Continuous Analog
We consider here the minimization of the functional L
g(u, u'x) dx,
J(u) = 0
which may be considered to represent the potential energy of a general nonhomogeneous, nonlinear string of length L. By analogy with the discrete case, we define f ( u , x) = min
lL
g(u, u', z) dz,
(8.2)
where the minimization may be performed with respect to either u or u'. Again, we choose u' as the pertinent decision variable. Proceeding as in Section 3, we decompose the interval [x, L] in the interval [x, x A] and [x + A, L] and apply the additive property of the integrals
+
x+ A
f(u, x)
= min [Jx UP
L
+ s,,,g(u, u', z ) dz]
[jxx+A g(u, u', z) dz +
- min U'(2) SE[X, x+
g(u, u', z ) dz
A]
s+,.,
L
min u, (2)
zs[x+ A, Ll
- min [/xx+Ag(u,u', z) dz + f ( u ( x + A), x + A)]. u' ZE[X,
(2)
x + A]
1
u', z) dz
(8.3)
134
6 DYNAMIC PROGRAMMING
We can now write, under appropriate smoothing conditions, x+ A
5,
9(u, uf, 4 dz = g(u, u’, x)A
+ @I,
(8.4)
and U(X
+ A) = U ( X ) + u’(x)A + o(A),
(8.5)
where the term o(A) is such that limA+oo(A)/A = 0. We can now substitute (8.4) and (8.5) into (8.3) obtaining
f(u, x) = min[g(u, w, x)A +f(u
+wA, x + A) + o(A)],
(8.6)
W
a functional equation similar to (6.3) where the minimization is performed with respect to w = u’(x), a dummy function in the present case. The limiting form of (8.6) as A + 0 can be constructed easily. Assuming the existence and boundedness of the necessary derivatives, we can write
f(u
+ wA,x + A) = f ( u , X) +fX(u, x)A + wfU(u,x)A + o(A),
(8.7)
where u stands for u(x) and where a subscript indicates partial derivative. Substitution of (8.7) into (8.6) yields
- U u , x) = min[g(u, w,x ) + wfXu, w, x)l,
(8.8)
W
a partial differential equation for the minimum potential energy. When the displacement u(L) is not prescribed, function f(u, x) must satisfy the end condition f ( u ( J 3 , L )= 0. (8.9) When, on the contrary, we prescribe u(L),u’(x) will become unbounded as x -+L and therefore the function f(u, x) will not in general be defined at x = L. In this case we look for an initial condition at a point x in the neighborhood of L. This can be done easily using several asymptotic expansions forf(u, x). The simplest one can be obtained by substituting u‘(x), given by
L - A 5 x -< L,
u’(x) = [u(L)- u(L - A)]/A,
valid for A
(8.10)
< I , into Eq. (8.2), i.e., L
f(u(L- A), L - A) = L-A
g(u5 u’, z) dz,
(8.1 1)
where u’ is given by (8.10). Finally we could write
f(u, X) 2 ( L - X)g(u, (d - u)/(L- x), x), the desired asymptotic result, where d stands for u(L).
L - x Q 1,
(8.12)
135
9. EULER EQUATIONS
EXERCISE Show that the problem of mimimizing the functional
where u and u are related through the differential equation u’
= h(u,
u, x),
u(0) = u g ,
can be reduced to the integration of the partial differential equation
-fx(u, x ) = min[g(u,
”
0,
XI + Mu, u, XMU, 41,
where f ( u , x ) = min J’:L&
0,
5) d5,
subject to the intial condition f(u,. L ) = 0.
9. Euler Equations We consider here the minimization of the functional
I
L
J(u) =
0
g(u, u’, x ) dx
(9.1)
by classical variational methods. We assume u prescribed at both ends ~ ( 0= ) C, u(L) = d. (9.2) This is known as the simplest problem in the calculus of variations. The function g(u, u’, x ) is assumed to be continuously differentiable up to the second order with respect to any of the three arguments u, u’, and x. In addition, u’ is assumed to be piecewise continuous. This condition may be considerably weakened, but the present restriction is enough for our purposes. We consider now a variation of the function u constructed in the following way: Let q(x) be an admissible function defined in the closed interval [0, L], and vanishing at the endpoints of the interval. For sufficiently small absolute values of a parameter E , the functions
U=u+&q (9.3) lie in the neighborhood of u. We say that 6u = eq is a variation of the function u. We now compute J at U = u + eq, i.e.,
+ E V ) = S g(u + ~ q U‘, + EV’, X) dx. L
J(u
(9.4)
0
A necessary condition for a minimum is given by (d/dE)J(u
+ &q)
Je=O
= 0.
(9.5)
136
6 DYNAMIC PROGRAMMING
Consequently, differentiating under the integral sign in (9.3), we obtain JOL(9J + 9.. ?') dx = 0,
(9.6)
an equation that, integrated by parts, and recalling that q vanishes at the endpoints, yields
valid for all admissible trial functions q. From the fundamental lemma of the calculus of variations it follows that
(dPxlg,. - 9, = 0, (9.8) a second-order ordinary differential equation subject to the two-point conditions (9.2). In expanded form (9.8) reads g,.,. u"
+ g,., u' +
gurx
- 9" = 0.
(9.9)
In order to be able to solve (9.9) for the higher derivative we must have
gu,,, # 0,
(9.10)
an inequality known as the Legendre condition. We observe that in integrating (9.6) by parts in order to obtain (9.7), we are implicitly assuming the existence of the second derivative of u, a fact that has not been postulated. Fortunately, under our present assumption regarding u and g, the existence of U" can be readily proved, validating in this fashion the Euler equations (9.8). The reader can find references on this aspect at the end of the chapter. Our next task is to show the connection between dynamic programming and the classical calculus of variations. Specificallywe wish to prove that u in f(u, x) which satisfies (8.8), satisfies the Euler equation (9.8). This is very easy to do. In fact, assuming that the minimization in (8.8) can be carried out by differential calculus, instead of (8.8) we consider the system
f, = -9 - UYU, 0 =9.* + f u ,
(9.11) (9.12)
where the second equation furnishes the condition for a minimum. Now differentiating(9.12) with respect to x and (9.11) with respect to u, we obtain
-9u - U I f U U , d d d 0 = -9,. f, = -g,. dx dx dx
fxu =
+fuuu)+f,,, from which (9.8) follows by equating f,, and f,, . +-
(9.13)
137
10. CONVEXITY
RARRCIS~S 1. Show that when g(u, u', x) = tu"
+ h(u),the Euler equation is u"
= h(u).
2. Show that if u(L) is not prescribed, the natural condition is u'(L) = 0.
10. Convexity
We consider again the functional
1
L
J(u) =
g(u, u', X) dx.
(10.1)
0
By expanding the integrand in a Taylor's series with a remainder after two terms, around an admissible function u, we can compute J(u
+ u) = J(u) + SJ(u) + f 6 2 J ( U ) ,
(10.2)
where u is an admissible variation, 6 J is the first variation given by ,L
6J(u) = J (ug, 0
+ u'g,,,)dx,
(10.3)
and where S*J(u), the second variation, is given by L
S2J(u) =
J0 (v2S,, + ~ u u ' ~ , , , +. u ' ~ ~ ~dx, ~ , . )
(10.4)
where an overbar indicates that the derivatives have been calculated along intermediate curves U. For example,
+ U ,u' + U', x), where U is a function that lies between u and u + u. g,,
= guu(u
(10.5)
When u = u* is an extremal, i.e., when it satisfies the boundary conditions (9.2) and the Euler equation (9.8), the first variation vanishes identically for every admissible trial function u. This can be verified by integrating by parts in (10.3). Therefore J(u*
+ u) - J(u*) = #J(u*),
(10.6)
and a necessary condition for a minimum is that the second variation S2J(u*) be nonnegative for all admissible U lying in the neighborhood of an extremal u*. This is a local convexity property that can be reduced, after an adroit treatment, to the elegant Legendre condition gu,,, 2 0,
where the second derivative is evaluated along the extremal.
(10.7)
138
6 DYNAMIC PROGRAMMING
A more general result is obtained if the second variation given by the quadratic functional (10.4) is nonnegative for all admissible functions u and u. This, a global convexity property, is a sufficient condition for a minimum. The minimum obtained in this fashion is an absolute minimum. If the strict case a2J > O holds, i.e., if J i s strictly convex for all admissible u and v , we can additionally guarantee the uniqueness of the minimum, or in other words, we can establish the uniqueness of the Euler equation. This can be proved readily by contradiction. Clearly, a sufficientcondition for a minimum is that the Hessian matrix H, associated with the quadratic form under the integral sign in (10.4), i.e., (10.8) be nonnegative definite. If, furthermore, H > 0, the Euler equation yields the unique solution of the minimization problem. It is clear that conditions for anabsolute minimum are far more demanding and difficult to establish than those associated with local aspects. In general, we shall always be able to assert the existence and uniqueness of the solution of the minimization problem, or equivalently, of the Euler equations in a local sense, i.e., for small interval L and small IIu(x) - u(O)((.Results of this type can therefore be used to establish appropriate conditions and bounds for the existence and uniqueness of f ( u , x) satisfying the partial differential equation (8.8) subject to appropriate initial conditions. A direct treatment of questions of existence and uniqueness in Eq. (8.8) without resorting to results in the classical theory is possible, but is beyond our present scope. The reader can consult the references at the end of the chapter. We return partially to this subject in the next chapter, in connection with some topics of quasilinearization. EXERCISES I . The potential energy of a beam resting on a nonlinear foundation characterized by the force-displacement relation F = U + ~ X U ~
(a)
is given by the functional J(u) = I I L ( E h N z 2pu
+ u2 + hu4) dx.
(b)
0
Assuming the end x = 0 to be rigidly clamped, i.e., u(0) = u’(0) = 0,
(4
show that the Euler equation associated with the minimization of the functional (b) is
(d2/dx2)(EZdzu/dr2) +u
+ 2 h 3= p ,
subject to (c) and the natural conditions
u”(L)= (EZU”(L))’= 0.
(dl
139
11, NUMERICAL ASPECTS
2.
show that if X 2 0 ,the Euler equation (d) subiect to the two-point boundary conditions (c) and (e) admits one and only one solution for all L 2 Q.
3. If < 0, we cannot ensure in general uniqueness of the solution. However, if Ihl 4 1 and IpI Q 1, we expect to enjoy uniqueness. A number of bounds on h and p can be determined for this purpose. For example, show that if a function u(x) satisfies (c), (d), (e), and in addition the inequality
IU I
< (1/6h)”*,
(f)
then it is the unique solution. 4. Can you construct bounds on IpI and
1x1 that are independent of u?
5. Suppose that for a given h < 0 and p , the problem admits more than one solution. What physical interpretation of this fact would you give in the present case?
11. Numerical Aspects
We have reduced the solution of our original unconstrained minimization problem to the solution of the partial differential equation (8.8) which can be written in the form f = - g - wfu (11.1) 5
where w = u‘ is given by the optimality condition 9w
Additionally, when the end x to the initial condition
=L
+f”= 0.
(11.2)
is free, the minimum function f is subject
f (4L ) = 0,
(11.3)
whileiftheend x = Lisfixed, with u(L) = d, we must use (8.12) as the pertinent initial condition. In either case the problem consists of the solution of the partial differential system (1 1. I)-( 1 1.2) subject to appropriate initial conditions. This can be done in a number of ways. Since (1 1.1) and (1 1.2) comprise a quasilinear system that can be written in the form fx
= -9
+ wgw,
fu
=
-9w7
(11.4)
we can apply the theory of characteristics and reduce the problem to that of integrating ordinary differential equations along the characteristics. This approach may be shown to be equivalent to that of integrating the associated Euler equations written in canonical form. We must expect, therefore, to be confronted with two-point conditions, a situation that we systematically try to avoid. In other instances, a particular structure of the function g might suggest a particular direction of attack. This is true, for example, when g is given in the form g(u, u’, x ) = +u’2 h(u). (11.5)
+
140
6 DYNAMIC PROGRAMMING
Equation (1 1.5) can be interpreted as the potential energy per unit length of a string subject to small displacements, lying on a nonlinear foundation. In this case Eq. (1 1.2) yields w = u ' = -f U ) (1 1.6) again a manifestation of the theorem of complementary energy, this time in a nonlinear context. Using (1 1.6), Eq. (1 1.1) reduces to
f, = - h(u) + *f"Z.
(11.7)
When h(u) is a polynomial, one is tempted to try expansions of the type
f (u, x) = ~ ~ ( x ) u+' R , ( x ) u ~+ R , ( x ) u ~+ . . .
(11.8)
In other cases h(u) may be of the form h(u, E )
= +u2
+ Eh,(U),
(I 1.9)
where E is a small parameter and h,(u) is a polynomial of order higher than 2. In this case we may attempt expansions in terms of the parameter E , i.e.,
f ( u , x, 4 =fo(u, x ) + Efi(U, x> + EZf2(U, x) + . - * .
(1 1.10)
If the nonlinear effect, given by the term affected by E , is relatively small, we can reasonably expect, on physical grounds, that the series (11.10) possesses a nonzero radius of convergence. Exercises and references on these analytical techniques can be found at the end of the chapter. A direct numerical approach by using difference schemes on (1 1.1) and (11.2) is also possible. In this case however, there is much to gain if instead of the system (1 1 .I)-(I 1.2) we treat directly the original equation (8.8), or even better, the discretized equation (8.6) from which (8.8) originated. The reasons for this are several. In the first place Eq. (8.6) reflects the physical nature of the problem directly since it has been constructed using physical entities such as energy. We can therefore expect to inherit, in the process of our calculations, the benefits of the inherent stability of the physical quantities involved. On the other hand, we note that in a nondissimulated effort to exhibit analyticity, in Sections 8-10 we have carefully and systematically avoided consideration of local constraints on the slopes and deflections, a fact of the utmost importance in dealing with realistic processes. But we know that when local constraints are to be considered, the analytical structure that we began to build in the preceding three paragraphs will almost completely collapse, confronting us with a new highly intricate problem, for whose solution we cannot unfortunately offer any uniform theoretical treatment at present. On the contrary, a solution based on the discrete scheme (8.6) will recognize the existence of local constraints, which in addition will generally facilitate the solution by naturally delimitating the range of existence of the variables.
141
12. DISCUSSION
In order to illustrate the basic ideas, we write (8.6) without the o(A) term
f(u, x)
= min[g(u, w,
+
x)A f (u
+ wA, x + A)].
(1 1.1 1)
W
Assuming the right end at x = L free, the end condition
f(u, L) = 0
(I 1.12)
must be imposed. Making (1 1.13) and g(u, w, n
(11.14)
w = g&, w),
(11.11) and (11.12) reduce to
L(4 = min[g,(u, w) +fn+1(u + w 4 1 , W
f N W = 0,
(11.15)
a recursive system for the f.(u) that has been discussed in some detail in Sections 6 and 7. We finally note that the solution of Eq. (8.8) can be tackled via the use of the method of successive approximations. We delay this matter until Chapter 7, where it is treated in connection with the problem of approximation in policy space. 12. Discussion
In the preceding sections we discussed the solution of the optimization problem L
min Jo g(u, u', x ) dx,
u(0) = c,
(12.1)
Y
where the other end x = L can either be fixed or free, by means of two utterly different approaches. On the one hand, we have seen how the classical calculus of variations inexorably leads us to two-point boundary-value problems in terms of ordinary differential equations. On the other hand, the dynamic programming formulation resulted in quasilinear partial differential equations subject to initial conditions.
142
6
DYNAMIC PROGRAMMING
This striking structural difference in the resulting functional equations is a consequence of the different imbedding used in the formulation of the problem. We clarify these concepts in the following. In fact, the solution space in the classical formulation is the set of all continuous functions u(x) satisfying the boundary conditions. Once the problem has been posed in this way, we must select that (or those) admissible function(s) u(x) for which the functional (12.1) is a minimum. To solve this global problem we then resort to a local formulation and in fact we derive the Euler equations that provide necessary conditions for local optimality. In the dynamic programming formulation we regard the minimization of the functional (12.1) as a multistage decision process and consider at each stage the value of the slope u'(x) that minimizes the remainder of the process associated with the admissible family of u(x) at the same stage x . In other words, for a given x we compute the value of u' associated with every possible u. In mathematical terms what we do here is to determine the function u'(u); in the terminology of control theory, we are determining at each stage of the process, the decision in terms of the state of the system, a feedback rule. The sequence of decisions constitutes a policy, and in fact, the dynamic programming approach to problems in the calculus of variations is to determine optimum policies in a sequential fashion, a fact rich in consequences. Since at each stage we minimize with respect to every possible decision and for every admissible state, the solution resulting from this formulation is an absolute minimum. Therefore a local formulation at each stage leads to a global solution. It is in this duality, u(t) versus u'(u), or local versus global, that the difference between the two theories lies. The implications of this duality in a computation context are obvious. Clearly, in dealing with the Euler equations we are compelled to reformulate the problem in some adroit fashion if our intention is to solve the problem on a digital computer. In fact, there is no standard procedure to solve nonlinear boundary-value problems numerically. The dynamic programming approach, on the other hand, does not require a special reformulation because the functional equation itself leads in a natural fashion to a recursive computational scheme of the optimum policies and associated optimum value function. 13. Partial Differential Equations
In this and subsequent sections we wish to discuss the application of dynamic programming ideas to the solution of partial differential equations. The natural device in this context is the use of variational formulations. Consider, for example, the Dirichlet functional
!Iv
(w:
+ :w
- 2pw) dx
dy,
(13.1)
143
13. PARTIAL DIFFERENTIAL EQUATIONS
where w is a function with piecewise continuous first derivatives in the domain V, taking prescribed values along the boundary S, i.e.,
(13.2)
on S.
w(x,y) = wo
We know that the function w that minimizes in (1 3.1) and satisfies boundary conditions (13.2) is the (unique) solution of Poisson's equation
(13.3) w,, + W'yy = P, subject to (13.2). It is often convenient to replace the constrained minimization problem (13.1)-(13.2), by an unconstrained one. This may be done by incorporating the constraint (13.2) into the functional (13. l), via the introduction of a Courant parameter A, i.e., by constructing the functional J(w) =
JJV (w,' + :w
- 2pw)
dx dy + A
[ (w - w,#
ds.
(13.4)
S
As expected, it is possible to prove that w(x, y , A) that minimizes in (13.4) will approach the minimum of (13.1) subject to (13.2), as A 00. In order to solve this minimization problem, we discretize the integrand of (13.4) using finite element procedures. To that end we use the same finite element partition, strip configuration, and notation as introduced in Sections 3 and 4 of Chapter 4. In this fashion, by making w = c i N i ' u iin Eq. (13.4), we are led, after appropriate grouping of terms, to the discrete functional --f
N-
J(u(l), ~ ( 2 1 *, * * u ( W ) = 9
1
C1 En(u(n>,u(n + I)),
(13.5)
n=
where u(n) is the vector defined by Eq. (4.1) of Chapter 4 and En is the energy stored in the strip (n,n l), given by the quadratic form
+
E,(u(n), u(n + 1)) = (44, K,,(n)u(n)) + (u(n + I), K z , ( M n -t 1)) + 2(u(n), K,,(n)u(n + 1)) + 2(u(n),p,(n))
+ 2(4n + l),~z(n))-
(13.6)
In (13.6), matrices Kij(n) and vectors pi(n) retain the same meaning as in Section 4 of Chapter 4. Introducing N- 1
f.(u(n)) = min
C
Ei(u(i),u(i
u(n+l) i = n
+ I)),
(1 3.7)
application of standard arguments in dynamic programming leads to the functional equation
whose solution may be written in the form
144
6
DYNAMIC PROGRAMMING
In (13.9), Q(n), q(n),and s(n) are quantities to be determined. Proceeding as in Section 4, we find
EXERCISES 1. Work out the details of the derivations of Eqs. (13.10)-(13.12). 2. Show that the quantities Q(n) and q(n) are related to R(n) and r(n) defined in Section 5 of Chapter 4 by
Qb)= Kl1(n)+ K I ~Wn), )
q(n) = p l ( n )
+ K12(n)r(n)
14. The Biharmonic Equation
We illustrate now the application of dynamic programming to problems of higher order using semidiscrete operators, by considering again the bending of a thin rectangular plate enclosed by x = y = 0, x = L , and y = H . We know that the configuration of equilibrium of such a plate is associated with the minimization of the functional J(w) =
+ lJ[(w,,
+ w,,,)~ - 2(1 - v)(w,,
wyy- wqy) - 2pw] dx dy,
(14.1)
where w is the deflection, p is the load per unit area, and v is Poisson's ratio. We assume that the edges y = 0, y = H are rigidly clamped, i.e., w = W" = 0,
(14.2)
while the values of w(0, y ) and those of the derivatives w,(O, y ) along x = 0 are prescribed. Additional conditions will be specified later on the remaining edge x = L.
145
14. THE BIHARMONIC EQUATION
Now, considering the semidiscretization scheme w,,(x. ih) z ( l/h)(wi - wi-1), wyy(x,ih) z ( ~ / h ~ ) ( w-~2wi -~
(14.3)
+ wi+l),
where w i= w(x, ih), and using the matrix-vector notation introduced in Section 4-7, we can readily transform (14.1) into the approximate functional L
J(u) =
+J [(u”,u“) - ~ ( K u ”u,) + (Lu, u) + 2( 1 - v)((Ku”,U) + (Ku’, u’))- 2(P, u)]dx, 0
(14.4)
in terms of the displacement vector u given by (14.5)
and where the matrices K and L have the meaning given by Eqs. (7.11) and (7.12) of Chapter 4, respectively. The mesh size in the y direction, h, is related to N by H = ( N + I)h. It is convenient to introduce here the vector forces m and t defined by Eqs. (7.14) of Chapter 4, i.e.,
m = -ufr
+ vKu
(14.6)
and t
= urrr- (2 -
(14.7)
v)Ku’.
Using m given by (14.6), (14.4) reduces to
S, [(m,m) + (L*u, u) + (K*u’, u’) L
J(u) = f
- 2(P, u)] dx,
(14.8)
where L* = L - v2K2 and K* = 2(1 - v)K have been found previously in Eqs.(7.15)ofChapter4.InEqs.(14.4)and(14.8),P=(p(x,ih)),i= 1, . . . N . We define as usual
where (14.10)
u’ = u,
and where m is related to u by means of (14.6). Now considering the decomposition L
minJx U
=
min
min
m(t)
u(<)
x c < ~ x + Ax t A s < < L
lxL =
L
min
min Jxx+A u(<) ‘x+A m(<) xs<jx+A x+As<sL
(14.1 1)
146
6 DYNAMIC PROGRAMMING
based on the additive property of the integrals and an elementary property of the minimum function, we can write
f(u, u, x) = min[+((m, m) + (L*u, u) + (K*u, u) - 2(P, u))A m(x)
+f ( u ( x + A), u(x + A), x + A)] + 4 A ) .
(14.12)
Assuming the existence of the necessary derivatives and recalling that, with the help of (14.6), u' = U" can be written in the form
u" = - m
+ VKU,
( 14.13)
it is easy to show that
-fx(u, u, x)
= min[+((m, rn) m
+ (fu
1
+ (L*u, u) + (K*v, u) - 2(P, u))
u> - ( f u
9
4 + v(fu
7
w,
(14.14)
where f, stands for aJax and f,,and f, are the gradients fu = (af/au,),
f , = (af/au,),
i = 1 , 2,
,
. . , N,
( 14.15)
where uiand u iare the components of the vectors u and u, respectively, is the limiting form of (14.12) when A 4 0 .We leave this derivation as an exercise for the reader. The minimum in (14.14) is attained at m =fv,
(14.16)
a value that substituted into (14.14) yields
fx
= -$(L*u, U) - $(K*u, 0)
+ $(fu
,fu) - (f,,,V ) - ~ ( f ,Ku) , + (P,u), (14.17)
a partial differential equation for f subject to appropriate initial conditions which are discussed below. First we wish to find a meaning for the gradient fu and to construct appropriate equations for fu and f,. We do this in the next section. 15. Theorem of Castigliano
We compute f,, by taking the gradient with respect to namely,
21
in (14.17),
-K*u + f , " f , - f u - f u u v - vf,vKu = - K * v + s , , ( f u - V W -fu - f u l J u , where with the symbol fms we denote the Jacobian matrix
(15.1)
...,N.
(1 5.2)
fxu
=
faS = (a2f/aai ag,),
i , j = i,2,
I47
16. EULER EQUATIONS
We now compute m'
= dm/dx from
m'
(14.16):
=fux
+fuuv
=f,x
+fuuv -fu,(m - VKU).
+fUUV'
(1 5.3)
Adding (1 5.1) and ( I 5.3), taking into account that m =f , , we obtain
m'
=
-K*u -f U .
(1 5.4)
Recalling (14.6), (14.7), Eq. (1 5.4) yields
f" = t ,
(15.5)
the desired result which, together with (14.16),expresses Castigliano's theorem. 16. Euler Equations
We now take the gradient with respect to u in (14.17):
+P
fxu =
-L*U
+f,,f, -fu,,v -vfv,,Ku
=
-L*u
+ P +fuu(f,- VKU)-fuu(v- VKf,),
- vKfu
(16.1)
and differentiate (1 5.5) with respect to x : t'
=fux
+fuuv
+fuuv'
=fux
+fuuo
-fuu(m - V K 4 .
(16.2)
Combining (16.1) and (16.2) we readily obtain t' = -L*u - vKm
+ P,
(16.3)
a differential equation for t . Writing (15.4) in the form
m'
=
-K*u' - t ,
(16.4)
and eliminating m and t from among (14.16), (16.3), and (16.4), taking into account that L* = L - v