Download
limit cycle n.
Skip this Video
Loading SlideShow in 5 Seconds..
Limit Cycle PowerPoint Presentation
Download Presentation
Limit Cycle

Limit Cycle

678 Vues Download Presentation
Télécharger la présentation

Limit Cycle

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Limit Cycle • Limit Cycle • Isolated closed trajectoriesAnalysis is, in general, quite difficult. For nonlinear systems, two simple results exist. 2 - 1

  2. (angular region) # Bendixson’s Theorem • Bendixson’s Theorem Connected (but not simple set) B A 2 - 2

  3. Ex: 2 - 3

  4. positive limit set positive limit set Negative limit set exists. Positive limit set does not. Poincare-Bendixson Theorem • Poincare-Bendixson Theorem 2 - 4

  5. Theorem 2 - 5

  6. Example for Poincare-Bendixson Theorem Ex : 2 - 6

  7. Index Theorem • Index Theorem 2 - 7

  8. Isolated Equilibrium • Facts -1 +1 2 - 8

  9. Either (1) center, focus, node or (2) 2 node + 1 saddle Facts (Continued.) Ex : no periodic solution ! 2 - 9

  10. Volterra predator – prey model Ex: eq) center saddle 2 - 10

  11. 3. Mathematical Foundations  existence, uniqueness, continuously dependent on initial conditions • Introduction and motivation or Obviously, we can write (for simplicity, we assume a time invariant case) To analyze the fundamental properties, use the simple idea of successive approximations : Choose the initial approximation not initial condition but the initial approximation 2 - 11

  12. Introduction and motivation Then, we can write first approximation In general, So, the procedure generates the sequence Questions: 2 - 12

  13. Introduction (Continued) The idea to provide the answers is quite simple. We write again, Then we can write Processing this and analogous inequalities, one can arrive at the conclusions of existence, uniqueness, etc. 2 - 13

  14. T Introduction (Continued) The modern approach to the problem is based on a more general principle, useful for many other applications – the contraction mapping theorem (functional analysis technique). Introduce an operator Define T as follows : Then, the recursion has the form 2 - 14

  15. Introduction and motivation It is possible to show that under the Lipschitz condition, T has a fixed point which says that x is a solution. It is also possible to find conditions under which this fixed point is unique. To develop, more or less carefully, the machinery for such a proof we need several metrics : Linear Normed Space Linear Space Norm + = Set of elements closed w.r.t. addition and multiplication by a scalar • Measure of • distance between • two elements • (after generated • by the projection • inner product • of elements - ) Inner Product Space Inner Product = 2 - 15

  16. Introduction (Continued) every convergent sequence has the limit in this set Operator T Complete linear normed space Complete linear normed space 2 - 16

  17. Preliminaries • Preliminaries (real number) Norm  real valued function of x such that P-norm 2 - 17

  18. Preliminaries(continued) Most used norms Euclidean norm All finite dimensional norms are equivalent. (Example) (proof) 2 - 18

  19. Preliminaries(continued) matrix norm For instance, (max column sum) (max row sum) 2 - 19

  20. Preliminaries(continued) Then 2 - 20

  21. Preliminaries(continued) • Linear infinite dimensional (function) spaces 2 - 21

  22. Preliminaries(Examples) 2 - 22

  23. Preliminaries(Examples) 2 - 23

  24. Cauchy Sequence 2 - 24

  25. Cauchy Sequence(Examples) Ex : Solution : 2 - 25

  26. Cauchy Sequence(Examples) 2 - 26

  27. Cauchy Sequence(Examples) (sol.) 2 - 27

  28. Cauchy Sequence(Examples) 2 - 28

  29. Cauchy Sequence(Examples) Ex : 2 - 29

  30. Banach Space 2 - 30

  31. Banach Space(continued) 2 - 31

  32.  Banach Space(continued)  2 - 32

  33. Contraction Mapping • Contraction Mapping not necessarily linear 2 - 33

  34. Proof : 2 - 34

  35. 2 – 35

  36. Banach Space(Examples) Ex : 2 – 36

  37. Local Contraction mapping theorem • Local Contraction mapping theorem Proof : same as before. 2 - 37