Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010167374 | TJ213 A22 2008 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
This book concerns the numerical simulation of dynamical systems whose trajec- ries may not be differentiable everywhere. They are named nonsmooth dynamical systems. They make an important class of systems, rst because of the many app- cations in which nonsmooth models are useful, secondly because they give rise to new problems in various elds of science. Usually nonsmooth dynamical systems are represented as differential inclusions, complementarity systems, evolution va- ational inequalities, each of these classes itself being split into several subclasses. The book is divided into four parts, the rst three parts being sketched in Fig. 0. 1. The aim of the rst part is to present the main tools from mechanics and applied mathematics which are necessary to understand how nonsmooth dynamical systems may be numerically simulated in a reliable way. Many examples illustrate the th- retical results, and an emphasis is put on mechanical systems, as well as on electrical circuits (the so-called Filippov's systems are also examined in some detail, due to their importance in control applications). The second and third parts are dedicated to a detailed presentation of the numerical schemes. A fourth part is devoted to the presentation of the software platform Siconos. This book is not a textbook on - merical analysis of nonsmooth systems, in the sense that despite the main results of numerical analysis (convergence, order of consistency, etc. ) being presented, their proofs are not provided.
Table of Contents
1 Nonsmooth Dynamical Systems: Motivating Examples and Basic Concepts | p. 1 |
1.1 Electrical Circuits with Ideal Diodes | p. 1 |
1.1.1 Mathematical Modeling Issues | p. 2 |
1.1.2 Four Nonsmooth Electrical Circuits | p. 5 |
1.1.3 Continuous System (Ordinary Differential Equation) | p. 7 |
1.1.4 Hints on the Numerical Simulation of Circuits (a) and (b) | p. 9 |
1.1.5 Unilateral Differential Inclusion | p. 12 |
1.1.6 Hints on the Numerical Simulation of Circuits (c) and (d) | p. 14 |
1.1.7 Calculation of the Equilibrium Points | p. 19 |
1.2 Electrical Circuits with Ideal Zener Diodes | p. 21 |
1.2.1 The Zener Diode | p. 21 |
1.2.2 The Dynamics of a Simple Circuit | p. 23 |
1.2.3 Numerical Simulation by Means of Time-Stepping Schemes | p. 28 |
1.2.4 Numerical Simulation by Means of Event-Driven Schemes | p. 38 |
1.2.5 Conclusions | p. 40 |
1.3 Mechanical Systems with Coulomb Friction | p. 40 |
1.4 Mechanical Systems with Impacts: The Bouncing Ball Paradigm | p. 41 |
1.4.1 The Dynamics | p. 41 |
1.4.2 A Measure Differential Inclusion | p. 44 |
1.4.3 Hints on the Numerical Simulation of the Bouncing Ball | p. 45 |
1.5 Stiff ODEs, Explicit and Implicit Methods, and the Sweeping Process | p. 50 |
1.5.1 Discretization of the Penalized System | p. 51 |
1.5.2 The Switching Conditions | p. 52 |
1.5.3 Discretization of the Relative Degree Two Complementarity System | p. 53 |
1.6 Summary of the Main Ideas | p. 53 |
Part I Formulations of Nonsmooth Dynamical Systems | |
2 Nonsmooth Dynamical Systems: A Short Zoology | p. 57 |
2.1 Differential Inclusions | p. 57 |
2.1.1 Lipschitzian Differential Inclusions | p. 58 |
2.1.2 Upper Semi-continuous DIs and Discontinuous Differential Equations | p. 61 |
2.1.3 The One-Sided Lipschitz Condition | p. 68 |
2.1.4 Recapitulation of the Main Properties of DIs | p. 71 |
2.1.5 Some Hints About Uniqueness of Solutions | p. 73 |
2.2 Moreau's Sweeping Process and Unilateral DIs | p. 74 |
2.2.1 Moreau's Sweeping Process | p. 74 |
2.2.2 Unilateral DIs and Maximal Monotone Operators | p. 77 |
2.2.3 Equivalence Between UDIs and other Formalisms | p. 78 |
2.3 Evolution Variational Inequalities | p. 80 |
2.4 Differential Variational Inequalities | p. 82 |
2.5 Projected Dynamical Systems | p. 84 |
2.6 Dynamical Complementarity Systems | p. 85 |
2.6.1 Generalities | p. 85 |
2.6.2 Nonlinear Complementarity Systems | p. 88 |
2.7 Second-Order Moreau's Sweeping Process | p. 88 |
2.8 ODE with Discontinuities | p. 92 |
2.8.1 Order of Discontinuity | p. 92 |
2.8.2 Transversality Conditions | p. 93 |
2.8.3 Piecewise Affine and Piecewise Continuous Systems | p. 94 |
2.9 Switched Systems | p. 98 |
2.10 Impulsive Differential Equations | p. 100 |
2.10.1 Generalities and Well-Posedness | p. 100 |
2.10.2 An Aside to Time-Discretization and Approximation | p. 104 |
2.11 Summary | p. 104 |
3 Mechanical Systems with Unilateral Constraints and Friction | p. 107 |
3.1 Multibody Dynamics: The Lagrangian Formalism | p. 107 |
3.1.1 Perfect Bilateral Constraints | p. 109 |
3.1.2 Perfect Unilateral Constraints | p. 110 |
3.1.3 Smooth Dynamics as an Inclusion | p. 112 |
3.2 The Newton-Euler Formalism | p. 112 |
3.2.1 Kinematics | p. 112 |
3.2.2 Kinetics | p. 115 |
3.2.3 Dynamics | p. 117 |
3.3 Local Kinematics at the Contact Points | p. 123 |
3.3.1 Local Variables at Contact Points | p. 123 |
3.3.2 Back to Newton-Euler's Equations | p. 126 |
3.3.3 Collision Detection and the Gap Function Calculation | p. 128 |
3.4 The Smooth Dynamics of Continuum Media | p. 131 |
3.4.1 The Smooth Equations of Motion | p. 131 |
3.4.2 Summary of the Equations of Motion | p. 135 |
3.5 Nonsmooth Dynamics and Schatzman's Formulation | p. 135 |
3.6 Nonsmooth Dynamics and Moreau's Sweeping Process | p. 137 |
3.6.1 Measure Differential Inclusions | p. 137 |
3.6.2 Decomposition of the Nonsmooth Dynamics | p. 137 |
3.6.3 The Impact Equations and the Smooth Dynamics | p. 138 |
3.6.4 Moreau's Sweeping Process | p. 139 |
3.6.5 Finitely Represented C and the Complementarity Formulation | p. 141 |
3.7 Well-Posedness Results | p. 143 |
3.8 Lagrangian Systems with Perfect Unilateral Constraints: Summary | p. 143 |
3.9 Contact Models | p. 144 |
3.9.1 Coulomb's Friction | p. 145 |
3.9.2 De Saxce's Bipotential Function | p. 148 |
3.9.3 Impact with Friction | p. 151 |
3.9.4 Enhanced Contact Models | p. 153 |
3.10 Lagrangian Systems with Frictional Unilateral Constraints and Newton's Impact Laws: Summary | p. 161 |
3.11 A Mechanical Filippov's System | p. 162 |
4 Complementarity Systems | p. 165 |
4.1 Definitions | p. 165 |
4.2 Existence and Uniqueness of Solutions | p. 167 |
4.2.1 Passive LCS | p. 168 |
4.2.2 Examples of LCS | p. 169 |
4.2.3 Complementarity Systems and the Sweeping Process | p. 170 |
4.2.4 Nonlinear Complementarity Systems | p. 172 |
4.3 Relative Degree and the Completeness of the Formulation | p. 173 |
4.3.1 The Single Input/Single Output (SISO) Case | p. 174 |
4.3.2 The Multiple Input/Multiple Output (MIMO) Case | p. 175 |
4.3.3 The Solutions and the Relative Degree | p. 175 |
5 Higher Order Constrained Dynamical Systems | p. 177 |
5.1 Motivations | p. 177 |
5.2 A Canonical State Space Representation | p. 178 |
5.3 The Space of Solutions | p. 180 |
5.4 The Distribution DI and Its Properties | p. 180 |
5.4.1 Introduction | p. 180 |
5.4.2 The Inclusions for the Measures v[subscript i] | p. 182 |
5.4.3 Two Formalisms for the HOSP | p. 183 |
5.4.4 Some Qualitative Properties | p. 186 |
5.5 Well-Posedness of the HOSP | p. 187 |
5.6 Summary of the Main Ideas of Chapters 4 and 5 | p. 188 |
6 Specific Features of Nonsmooth Dynamical Systems | p. 189 |
6.1 Discontinuity with Respect to Initial Conditions | p. 189 |
6.1.1 Impact in a Corner | p. 189 |
6.1.2 A Theoretical Result | p. 190 |
6.1.3 A Physical Example | p. 191 |
6.2 Frictional Paroxysms (the Painleve Paradoxes) | p. 192 |
6.3 Infinity of Events in a Finite Time | p. 193 |
6.3.1 Accumulations of Impacts | p. 193 |
6.3.2 Infinitely Many Switchings in Filippov's Inclusions | p. 194 |
6.3.3 Limit of the Saw-Tooth Function in Filippov's Systems | p. 194 |
Part II Time Integration of Nonsmooth Dynamical Systems | |
7 Event-Driven Schemes for Inclusions with AC Solutions | p. 203 |
7.1 Filippov's Inclusions | p. 203 |
7.1.1 Introduction | p. 203 |
7.1.2 Stewart's Method | p. 205 |
7.1.3 Why Is Stewart's Method Superior to Trivial Event-Driven Schemes? | p. 213 |
7.2 ODEs with Discontinuities with a Transversality Condition | p. 215 |
7.2.1 Position of the Problem | p. 215 |
7.2.2 Event-Driven Schemes | p. 215 |
8 Event-Driven Schemes for Lagrangian Systems | p. 219 |
8.1 Introduction | p. 219 |
8.2 The Smooth Dynamics and the Impact Equations | p. 221 |
8.3 Reformulations of the Unilateral Constraints at Different Kinematics Levels | p. 222 |
8.3.1 At the Position Level | p. 222 |
8.3.2 At the Velocity Level | p. 222 |
8.3.3 At the Acceleration Level | p. 223 |
8.3.4 The Smooth Dynamics | p. 224 |
8.4 The Case of a Single Contact | p. 225 |
8.4.1 Comments | p. 227 |
8.5 The Multi-contact Case and the Index Sets | p. 229 |
8.5.1 Index Sets | p. 229 |
8.6 Comments and Extensions | p. 230 |
8.6.1 Event-Driven Algorithms and Switching Diagrams | p. 230 |
8.6.2 Coulomb's Friction and Enhanced Set-Valued Force Laws | p. 231 |
8.6.3 Bilateral or Unilateral Dynamics? | p. 232 |
8.6.4 Event-Driven Schemes: Lotstedt's Algorithm | p. 232 |
8.6.5 Consistency and Order of Event-Driven Algorithms | p. 236 |
8.7 Linear Complementarity Systems | p. 240 |
8.8 Some Results | p. 241 |
9 Time-Stepping Schemes for Systems with AC Solutions | p. 243 |
9.1 ODEs with Discontinuities | p. 243 |
9.1.1 Numerical Illustrations of Expected Troubles | p. 243 |
9.1.2 Consistent Time-Stepping Methods | p. 247 |
9.2 DIs with Absolutely Continuous Solutions | p. 251 |
9.2.1 Explicit Euler Algorithm | p. 252 |
9.2.2 Implicit [theta]-Method | p. 256 |
9.2.3 Multistep and Runge-Kutta Algorithms | p. 258 |
9.2.4 Computational Results and Comments | p. 263 |
9.3 The Special Case of the Filippov's Inclusions | p. 266 |
9.3.1 Smoothing Methods | p. 266 |
9.3.2 Switched Model and Explicit Schemes | p. 267 |
9.3.3 Implicit Schemes and Complementarity Formulation | p. 269 |
9.3.4 Comments | p. 271 |
9.4 Moreau's Catching-Up Algorithm for the First-Order Sweeping Process | p. 271 |
9.4.1 Mathematical Properties | p. 272 |
9.4.2 Practical Implementation of the Catching-up Algorithm | p. 273 |
9.4.3 Time-Independent Convex Set K | p. 274 |
9.5 Linear Complementarity Systems with r [less than or equal] 1 | p. 275 |
9.6 Differential Variational Inequalities | p. 279 |
9.6.1 The Initial Value Problem (IVP) | p. 280 |
9.6.2 The Boundary Value Problem | p. 281 |
9.7 Summary of the Main Ideas | p. 283 |
10 Time-Stepping Schemes for Mechanical Systems | p. 285 |
10.1 The Nonsmooth Contact Dynamics (NSCD) Method | p. 285 |
10.1.1 The Linear Time-Invariant Nonsmooth Lagrangian Dynamics | p. 286 |
10.1.2 The Nonlinear Nonsmooth Lagrangian Dynamics | p. 289 |
10.1.3 Discretization of Moreau's Inclusion | p. 293 |
10.1.4 Sweeping Process with Friction | p. 295 |
10.1.5 The One-Step Time-Discretized Nonsmooth Problem | p. 296 |
10.1.6 Convergence Properties | p. 303 |
10.1.7 Bilateral and Unilateral Constraints | p. 305 |
10.2 Some Numerical Illustrations of the NSCD Method | p. 307 |
10.2.1 Granular Material | p. 307 |
10.2.2 Deep Drawing | p. 309 |
10.2.3 Tensegrity Structures | p. 309 |
10.2.4 Masonry Structures | p. 309 |
10.2.5 Real-Time and Virtual Reality Simulations | p. 311 |
10.2.6 More Applications | p. 314 |
10.2.7 Moreau's Time-Stepping Method and Painleve Paradoxes | p. 315 |
10.3 Variants and Other Time-Stepping Schemes | p. 315 |
10.3.1 The Paoli-Schatzman Scheme | p. 315 |
10.3.2 The Stewart-Trinkle-Anitescu-Potra Scheme | p. 317 |
11 Time-Stepping Scheme for the HOSP | p. 319 |
11.1 Insufficiency of the Backward Euler Method | p. 319 |
11.2 Time-Discretization of the HOSP | p. 321 |
11.2.1 Principle of the Discretization | p. 321 |
11.2.2 Properties of the Discrete-Time Extended Sweeping Process | p. 322 |
11.2.3 Numerical Examples | p. 324 |
11.3 Synoptic Outline of the Algorithms | p. 325 |
Part III Numerical Methods for the One-Step Nonsmooth Problems | |
12 Basics on Mathematical Programming Theory | p. 331 |
12.1 Introduction | p. 331 |
12.2 The Quadratic Program (QP) | p. 331 |
12.2.1 Definition and Basic Properties | p. 331 |
12.2.2 Equality-Constrained QP | p. 335 |
12.2.3 Inequality-Constrained QP | p. 338 |
12.2.4 Comments on Numerical Methods for QP | p. 344 |
12.3 Constrained Nonlinear Programming (NLP) | p. 345 |
12.3.1 Definition and Basic Properties | p. 345 |
12.3.2 Main Methods to Solve NLPs | p. 347 |
12.4 The Linear Complementarity Problem (LCP) | p. 351 |
12.4.1 Definition of the Standard Form | p. 351 |
12.4.2 Some Mathematical Properties | p. 352 |
12.4.3 Variants of the LCP | p. 355 |
12.4.4 Relation Between the Variants of the LCPs | p. 357 |
12.4.5 Links Between the LCP and the QP | p. 359 |
12.4.6 Splitting-Based Methods | p. 363 |
12.4.7 Pivoting-Based Methods | p. 367 |
12.4.8 Interior Point Methods | p. 374 |
12.4.9 How to chose a LCP solver? | p. 379 |
12.5 The Nonlinear Complementarity Problem (NCP) | p. 379 |
12.5.1 Definition and Basic Properties | p. 379 |
12.5.2 The Mixed Complementarity Problem (MCP) | p. 383 |
12.5.3 Newton-Josephy's and Linearization Methods | p. 384 |
12.5.4 Generalized or Semismooth Newton's Methods | p. 385 |
12.5.5 Interior Point Methods | p. 388 |
12.5.6 Effective Implementations and Comparison of the Numerical Methods for NCPs | p. 388 |
12.6 Variational and Quasi-Variational Inequalities | p. 389 |
12.6.1 Definition and Basic Properties | p. 389 |
12.6.2 Links with the Complementarity Problems | p. 390 |
12.6.3 Links with the Constrained Minimization Problem | p. 391 |
12.6.4 Merit and Gap Functions for VI | p. 392 |
12.6.5 Nonsmooth and Generalized equations | p. 396 |
12.6.6 Main Types of Algorithms for the VI and QVI | p. 398 |
12.6.7 Projection-Type and Splitting Methods | p. 398 |
12.6.8 Minimization of Merit Functions | p. 400 |
12.6.9 Generalized Newton Methods | p. 401 |
12.6.10 Interest from a Computational Point of View | p. 401 |
12.7 Summary of the Main Ideas | p. 401 |
13 Numerical Methods for the Frictional Contact Problem | p. 403 |
13.1 Introduction | p. 403 |
13.2 Summary of the Time-Discretized Equations | p. 403 |
13.2.1 The Index Set of Forecast Active Constraints | p. 403 |
13.2.2 Summary of the OSNSPs | p. 405 |
13.3 Formulations and Resolutions in LCP Forms | p. 407 |
13.3.1 The Frictionless Case with Newton's Impact Law | p. 407 |
13.3.2 The Frictionless Case with Newton's Impact and Linear Perfect Bilateral Constraints | p. 408 |
13.3.3 Two-Dimensional Frictional Case as an LCP | p. 409 |
13.3.4 Outer Faceting of the Coulomb's Cone | p. 410 |
13.3.5 Inner Faceting of the Coulomb's Cone | p. 414 |
13.3.6 Comments | p. 417 |
13.3.7 Weakness of the Faceting Process | p. 418 |
13.4 Formulation and Resolution in a Standard NCP Form | p. 419 |
13.4.1 The Frictionless Case | p. 419 |
13.4.2 A Direct MCP for the 3D Frictional Contact | p. 419 |
13.4.3 A Clever Formulation of the 3D Frictional Contact as an NCP | p. 420 |
13.5 Formulation and Resolution in QP and NLP Forms | p. 422 |
13.5.1 The Frictionless Case | p. 422 |
13.5.2 Minimization Principles and Coulomb's Friction | p. 423 |
13.6 Formulations and Resolution as Nonsmooth Equations | p. 424 |
13.6.1 Alart and Curnier's Formulation and Generalized Newton's Method | p. 424 |
13.6.2 Variants and Line-Search Procedure | p. 429 |
13.6.3 Other Direct Equation-Based Reformulations | p. 430 |
13.7 Formulation and Resolution as VI/CP | p. 432 |
13.7.1 VI/CP Reformulation | p. 432 |
13.7.2 Projection-type Methods | p. 433 |
13.7.3 Fixed-Point Iterations on the Friction Threshold and Ad Hoc Projection Methods | p. 434 |
13.7.4 A Clever Block Splitting: the Nonsmooth Gauss-Seidel (NSGS) Approach | p. 437 |
13.7.5 Newton's Method for VI | p. 440 |
Part IV The SICONOS Software: Implementation and Examples | |
14 The SICONOS Platform | p. 443 |
14.1 Introduction | p. 443 |
14.2 An Insight into Siconos | p. 443 |
14.2.1 Step 1. Building a Nonsmooth Dynamical System | p. 444 |
14.2.2 Step 2. Simulation Strategy Definition | p. 447 |
14.3 Siconos Software | p. 448 |
14.3.1 General Principles of Modeling and Simulation | p. 448 |
14.3.2 NSDS-Related Components | p. 451 |
14.3.3 Simulation-Related Components | p. 456 |
14.3.4 Siconos Software Design | p. 457 |
14.4 Examples | p. 460 |
14.4.1 The Bouncing Ball(s) | p. 460 |
14.4.2 The Woodpecker Toy | p. 463 |
14.4.3 MOS Transistors and Inverters | p. 464 |
14.4.4 Control of Lagrangian systems | p. 466 |
A Convex, Nonsmooth, and Set-Valued Analysis | p. 475 |
A.1 Set-Valued Analysis | p. 475 |
A.2 Subdifferentiation | p. 475 |
A.3 Some Useful Equivalences | p. 476 |
B Some Results of Complementarity Theory | p. 479 |
C Some Facts in Real Analysis | p. 481 |
C.1 Functions of Bounded Variations in Time | p. 481 |
C.2 Multifunctions of Bounded Variation in Time | p. 482 |
C.3 Distributions Generated by RCLSBV Functions | p. 483 |
C.4 Differential Measures | p. 486 |
C.5 Bohl's Distributions | p. 487 |
C.6 Some Useful Results | p. 487 |
References | p. 489 |
Index | p. 519 |