Theory of Ordinary Differential Equations. Stability and Bifurcation II. John A. Burns

Size: px
Start display at page:

Download "Theory of Ordinary Differential Equations. Stability and Bifurcation II. John A. Burns"

Transcription

1 Theory of Ordiary Differetial Equatios Stability ad Bifurcatio II Joh A. Burs Ceter for Optimal Desig Ad Cotrol Iterdiscipliary Ceter for Applied Mathematics Virgiia Polytechic Istitute ad State Uiversity Blacksburg, Virgiia MATH FALL 1

2 Iitial Value Problem (IVP) { (Σ) (IC) x( t) f x( t), q x( t) x R m f ( xq, ) : D R R R d dt x1( t) f1( x1( t), x( t),... x( t), q1, q,... qm) x ( t) f ( x ( t), x ( t),... x ( t), q, q,... q ) R x ( t) f ( x ( t), x ( t),... x ( t), q, q,... q ) 1 1 m 1 1 m

3 Autoomous Systems (IVP) { (Σ) (IC) x( t) f x( t), q x( t) x R m f ( xq, ) : D R R R Let x e = x e (q) be a equilibrium for some parameter q, i.e. f ( x, q) f( x ( q), q) e e We will assume x e = x e (q) is a isolated equilibrium

4 Isolated Equilibrium f ( x, q) f ( x ( q), q), j 1,,3,... j j there exists a such that x B( x, ) if i j j i j j x ( ) q x ( ) 1 q R x ( ) 4 q x ( ) 3 q NON-ISOLATED EQUILIBRIUM CAN NOT BE ASYMPTOTICALLY STABLE

5 First Order Liear x( t) qx( t) x() t e qt x x( t) qx( t) f ( x( t), q) q = q = q = q = -.5 q =

6 Equilibrium x e =, q < : Stable qx f ( x, q) q < x e xe

7 Equilibrium x e =, q > : Ustable qx f ( x, q) q > x e xe

8 Equilibrium x e =, q = : Stable qx f ( x, q) q = xe x 1 ANY xe xe.5 x.1 xe.1 x.5 e e x e is NOT isolated

9 Example 4. x ( t) x ( t) 1 x ( t) qx ( t) x ( t) [ x ( t)] f x x 1 [ ] 3 x qx x x 1 1 x 1 1 x ( q [ x ] ) x or ( q [ x ] ) 1 1

10 Example 4. ( [ ] x q x ) 1 1 x q x 1 x q > x q 1 x

11 Example 4. q = 1 f1( x, y) y ( xy, ) : 3 f( x, y) ax y x ( x, y) : f ( x, y) y 1 3 ( x, y) : f( x, y) ax y x ( x, y) : y ax x 3

12 Epidemic Models Susceptible Ifected Removed

13 Epidemic Models SIR Models (Kermak McKedrick, 197) Susceptible Ifected Recovered/Removed d S ( t ) S ( t ) I ( t ) dt d I ( t ) S ( t ) I ( t ) I ( t ) dt d R ( t ) I ( t ) dt S( t) I( t) R( t) N costat

14 SIR Models d R ( t ) I ( t ) ad S ( t ) I ( t ) R ( t ) N costat dt d S ( t ) S ( t ) I ( t ) dt d I ( t ) S ( t ) I ( t ) I ( t ) I ( t ) S ( t ) dt x ( t) S( t), x ( t) I( t) ad q 1 T d dt x1 ( t) q1x1 ( t) x( t) x ( t) q x ( t) x ( t) q x ( t) 1 1

15 SIR Model: Equilibrium d dt x1 ( t) q1x1 ( t) x( t) x ( t) q x ( t) x ( t) q x ( t) 1 1 q1x 1x q1x 1x q x x q x ( q x q ) x q x x x1 or x 1 1 x1 q x hece x 1 x x 1 ca be ay value

16 SIR Model: Equilibrium x R x 1 EQUILIBRIUM x e x x 1 : x x NONE ARE ISOLATED

17 SIR Model x (t) x 1 (t) + x (t) N = 1 x 1 (t)

18 Stability of Equilibrium f x x( t) f x( t) e () t xe x x e x(t) (t)= x e t? HOW DO WE KNOW IF x e IS ASYMPTOTICALLY STABLE?

19 Fudametal Stability Theorem Let 1,, 3, be the eigevalues of J x f(x e ), i.e det( I J f( )) k x xe i (Re( ), Im( ) ) k k k k k k k Theorem S1: If Re( k ) < for all k=1,,., the x e is a asymptotically stable equilibrium for the o-liear system x( t) f x( t). I particular, there exist > such that if x() x, the lim ( t). e t x x e

20 No-Stability Theorem Theorem S: If there is oe eigevalue p such that Re( p ) >, the x e is a ustable equilibrium for the o-liear system x t f x t ( ) ( ). The two theorems above may be foud i: Richard K. Miller ad Athoy N. Michel, Ordiary Differetial Equatios, Academic Press, 198. (see pages 58 53) ad Earl A. Coddigto ad Norma Leviso, Theory of Ordiary Differetial Equatios, McGraw-Hill, (see pages )

21 Critical Case If there is oe eigevalue p of [ J f x ( x, q e )] such that Re( p ) =, the x e the liearizatio theorems do ot apply ad other methods must be used to determie the stability properties of the equilibrium for the oliear system x( t) f x( t), q

22 Example 5.1 f 3 d x1( t) x1( t) [ x1( t)] x( t) f 3 dt x( t) x( t) x1( t) [ x( t)] 3 x1 [ x 1] x 3 x x 1[ x] [ x ] x 3 1 ad [ x ] 1 x 3 [ x ] [ x ] x or 8 [ x1 ] 1 x e x1 x x?? IS STABLE?? e

23 Example 5.1 Try the liearizatio theorems J f ( ) x 1 1 3[ x1 ] 1 1 3[ x] x, x det I J( ) det( ) det i Re( i ) for i 1, Theorem S1 ad Theorem S do ot apply

24 Example 5.1 LOOKS ASYMPTOTICALLY STABLE

25 Example 5. d dt x1( t) x1( t) x( t) f 3 x( t) x( t) q[ x1( t)] 3 x( t) f x1 x 3 x q[ x1 ] 3x x e x1 x x?? IS ASYMPTOTICALLY STABLE?? e Try the liearizatio Theorem J f ( ) x [ ] 3 3 qx 1 x, x 1

26 Example det I J( ) det( ) det ( 3) ( 3) ad 3 1 Re( ) Liearizatio Theorems do ot apply BUT

27 Example 5. ZOOM IN

28 Example 5. LOOKS ASYMPTOTICALLY STABLE

29 Isolated Equilibrium H R x 3 x e R a ope set x e x 1 xˆe H R ad x H, for x V( x) : H R R e e

30 Lyapuov Fuctios H R e a ope set x e x x V( x) : H R R V( x) V( x, x,... x ) 1 If V ad whe ( ) V ( x), x, the V ( x) is said to be positive defiite

31 Lyapuov Fuctios d dt x() t f f f 1 ( x) ( x) ( x) R x x x x R 1 T x 1 V( ) : H R R V( x) V( x, x,... x ) We defie the fuctio. V( x) : H R R by. V ( x) V ( x) V ( x) V ( x) f1( x) f( x)... f( x) x x x 1

32 Lyapuov Fuctios V( x) : H R R is called a Lyapuov fuctio for the equilibrium (Σ) x e of the system x( t) f x( t) if ad ( i) V ( x) is positive defiite i H. ( ii) V ( x) for all x H

33 Lyapuov Theorems Theorem L1. If there exists a Lyapuov fuctio for the equilibrium x of the system the the equilibrium e (Σ) x( t) f x( t), x e is stable. Theorem L. If there exists a Lyapuov fuctio for the equilibrium x of the system ad. e (Σ). x( t) f x( t), V( ) ad V( x) for all x H, x, the the equilibrium x e is asymptotically stable.

34 Example 5.1 AGAIN 3 d x1( t) x1( t) [ x1( t)] x( t) f 3 dt x( t) x( t) x1( t) [ x( t)] x?? IS STABLE?? e H R is a ope set V( x) V( x, x ) [ x ] [ x ] 1 1 V( ) ad V( x) V( x, x ) [ x ] [ x ] if x 1 1 Hece, V( x) is positive defiite

35 Example 5.1 AGAIN. V( x) V( x, x ) [ x ] [ x ] 1 1 V ( x, x ) V ( x, x ) V x x f x x f x x 1 1 ( 1, ) 1( 1, ) ( 1, ) x x 1 V ( x1, x) x 1 x 1 V ( x1, x) x x f 3 x1 f1( x1, x) [ x1] x 3 x f( x1, x) x1[ x]. V ( x, x ) V ( x, x ) V x x f x x x ( fx x [ xx] ) ( 1, ) x1 ( [ 1x( 1] 1, x ) 1( 1, ) x x 1

36 Example 5.1 AGAIN.. V ( x, x ) V ( x, x ) V x x f x x x ( fx x [ xx] ) ( 1, ) x1 ( [ 1x( 1] 1, x ) 1( 1, ) x x 1. V( x, x ) [ x ] x x x x [ x ] V (,) ([] [] ) x x V( x, x ) ([ x ] [ x ] ) V( x, x ) ([ x ] [ x ] ) ad if, the Theorem L x e IS ASYMPTOTICALLY STABLE

37 Example 5. AGAIN d dt f q x1( t) x1( t) x( t) f 3 x( t) x( t) q[ x1( t)] 3 x( t) x1 x 3 x q[ x1 ] 3x H R is a ope set V ( x) V ( x, x ) [ x ] [ x ] V ( ) ad V ( x) V ( x, x ) [ x ] [ x ] if x Hece, V( x) q is positive defiite q x e x1 x

38 Example 5. AGAIN. V ( x) V ( x, x ) [ x ] [ x ] V ( x, x ) V ( x, x ) V x x f x x f x x 1 1 ( 1, ) 1( 1, ) ( 1, ) x x 1 V ( x1, x) x 1 qx [ ] V ( x1, x) x q x f x1 x f1( x1, x) 3 x q[ x1 ] 3 x f( x1, x). V ( x, x ) V ( x, x ) ( 1, ) qx [ 1] 1( x 1, ) x q x ( 1 1, x ) x x 1 V x x f x x ( f[ x] x3 )

39 Example 5. AGAIN. V ( x, x ) V ( x, x ) ( 1, ) qx [ 1] 1( x 1, ) x q x ( 1 1, x ) x x 1 V x x f x x ( f[ x] x3 ). V( x, x ) q[ x ] x q[ x ] x 6[ x ] 6[ x ] Hece,. V( x) 6[ x ] for all xh R ad Theorem L1 implies that x x e is stable?? IS ASYMPTOTICALLY STABLE?? e

40 Example 5. AGAIN x?? IS ASYMPTOTICALLY STABLE?? e.. ( 1, ) 6[ x] V x x. BUT. V(1,) 6[] SO V(,) 6[] V( x) for all x H, x Theorem L does ot apply NEED A BETTER THEOREM

41 Example 5.3 d dt x1( t) x1( t) x( t) f 3 x( t) x( t) x1( t) [ x( t)] f x1 x 3 x x1 [ x] x e x1 x x?? IS STABLE?? Try the liearizatio Theorem e J f ( ) x [ ] 1 x x, x 1

42 Example det I J( ) det( ) det i Re( i ) for i 1, Liearizatio Theorems do ot apply BUT

43 Example 5.3 ZOOM IN

44 Example 5.3 LOOKS LIKE A CENTER

45 Example 5.3 d dt x1( t) x1( t) x( t) f 3 x( t) x( t) x1( t) [ x( t)] f x1 x 3 x x1 [ x] x e H R is a ope set V( x) V( x, x ) [ x ] [ x ] 1 1 x1 x V( ) ad V( x) V( x, x ) [ x ] [ x ] if x 1 1 Hece, V( x) is positive defiite

46 Example 5.3. V( x) V( x, x ) [ x ] [ x ] 1 1 V ( x, x ) V ( x, x ) V x x f x x f x x 1 1 ( 1, ) 1( 1, ) ( 1, ) x x 1 V ( x1, x) x 1 x 1 V ( x1, x) x x f x1 x f1( x1, x) 3 x x1 [ x] f( x1, x). V ( x, x ) V ( x, x ) V x x f x x f x x ( 1, ) x 1( x 1 1, ) x ( x ( 1[ 1, x] ) x x 1

47 Example 5.3. V ( x, x ) V ( x, x ) V x x f x x f x x ( 1, ) x 1( x 1 1, ) x ( x ( 1[ 1, x] ) x x 1 Hece,.. V x x x x x x x 3 ( 1, ) 1 ( 1 [ ] ) V( x, x ) x x x x [ x ] [ x ] V( x) [ x ] for all xh R ad Theorem L1 implies that 4 x e is stable x?? IS ASYMPTOTICALLY STABLE?? e

48 Example 5.3 x?? IS ASYMPTOTICALLY STABLE?? e. 4. ( 1, ) [ x] 4 V x x. BUT. 4 V(1,) [] SO V(,) [] V( x) for all x H, x Theorem L does ot apply NEED A BETTER THEOREM

49 Positively Ivariat Sets (Σ) x( t) f t, x( t) x 3 R (IC) x( t) x R x x 1 x M x M x( t) x( t; x ) M for all t t

50 SIR Models d S ( t ) S ( t ) I ( t ) dt d I ( t ) S ( t ) I ( t ) I ( t ) I ( t ) S ( t ) dt If St ( ), the d I ( t ) I ( t ) S ( t ) dt I e Equilibrium, S NOT ISOLATED e N

51 SIR Models S(t) + I(t) N = 1 I(t) LOTS OF (POSITIVELY) INVARIANT SETS M M S(t)

52

53 Trajectories x t t x ( ;, ) R x R x R x t t x ( ;, ) R

54 Trajectories & Limit Sets Give x R, the (positive) trajectory through x Is the set x( t; t, x ) R : t t Give x R, the (egative) trajectory through x Is the set x( t; t, x ) R : t t Give x R, the trajectory through x Is the set x x ( t; t, ) R : t (, )

55 -limit Sets x R Give, a poit p belogs to the omega limit set (-limit set) of x t t x ( ;, ) R if for each ad every there is a such that T x( t; t, x ) p < t t T ( x ) p : p is a -limit poit of x R

56 -limit Sets ( x ) p : p is a -limit poit of x ( x ) p : there is a sequece t with lim x( t ; t, x ) p R k k k Theorem LIM1. If t t, the x t t x ( ;, ) R ( x ) is bouded for is a o-empty, compact ad coected positively ivariat set. xˆ ( x ) xˆ( t; tˆ, xˆ ) ( x ) for all t tˆ

57 Covergece to a Set x 3 R x( t) x( t; x ) M as t M x 1 For ay there is a T T ( ) t such that if t T( ), the there is a poit p M with x( t; x ) p <

58 Covergece to a Set x 3 x( ;, ) t t x R p M p 1 M x( ;, ) t1 t x M x 1 x t t x ( ;, ) R x( T( );, ) t x x

59 Example NS

60 Example NS M

61 Example agai a =1 > x( t) y( t) y( t) x( t) ([ x( t)] [ y( t)] 1) y( t) d dt x1( t) x( t) x( t) x1 ( t) ([ x1 ( t)] [ x( t)] 1) x( t) f x1 x x x1 ([ x1 ] [ x] 1) x x x 1

62 Example agai a =1 >

63 Example agai a =1 > M

64 Example agai a =1 > M

65 Example agai a =1 > LIMIT CYCLE M

66 LaSalle Theorems Theorem LIM. If t t i.e., the x( tt ;, x ) x t t x ( ;, ) R x( tt ;, x ) ( x ) approaches its -limit set. is bouded for Theorem LIM3. If t t ( ) M x x t t x ( ;, ), ad the R is bouded for x t t x ( ;, ) M

67 Theorem LIM: Example NS x x t t x ( ;, ) R M ( x )

68 LaSalle s Ivariace Theorem Let Hˆ R be a bouded closed positively ivariat set ( ) : ˆ V x H R R ( i) V ( x) v >, for all x Hˆ ad. mi ( ii) V ( x) for all x Hˆ E x H ˆ : V ( x). E Ĥ M E Hˆ is LARGEST ivariat subset of E

69 LaSalle s Ivariace Theorem Theorem LaSalle IP: If fuctio satisfyig (i) ad (ii) above ad M E is the largest ivariat subset of ˆ. E x H : V ( x), the for each x x( ;, ) tt x Hˆ Ĥ the trajectory approaches M. ( ) : ˆ V x H R R x( tt ;, x ) M M is a E Ĥ x( tt ;, x ) M x Lets apply this to some previous examples

70 Example 5. AGAIN d dt f q x1( t) x1( t) x( t) f 3 x( t) x( t) q[ x1( t)] 3 x( t) x1 x 3 x q[ x1 ] 3x H R is a ope set V ( x) V ( x, x ) [ x ] [ x ] V ( ) ad V ( x) V ( x, x ) [ x ] [ x ] if x Hece, V( x) q is positive defiite q x e x1 x

71 Example 5. AGAIN. V ( x) V ( x, x ) [ x ] [ x ] V ( x, x ) V ( x, x ) V x x f x x f x x 1 1 ( 1, ) 1( 1, ) ( 1, ) x x 1 V ( x1, x) x 1 qx [ ] V ( x1, x) x q x f x1 x f1( x1, x) 3 x q[ x1 ] 3 x f( x1, x). V ( x, x ) V ( x, x ) ( 1, ) qx [ 1] 1( x 1, ) x q x ( 1 1, x ) x x 1 V x x f x x ( f[ x] x3 )

72 Example 5. AGAIN. V ( x, x ) V ( x, x ) ( 1, ) qx [ 1] 1( x 1, ) x q x ( 1 1, x ) x x 1 V x x f x x ( f[ x] x3 ). V( x, x ) q[ x ] x q[ x ] x 6[ x ] 6[ x ] Hece,. V( x) 6[ x ] for all xh R ad Theorem L1 implies that x x e is stable?? IS ASYMPTOTICALLY STABLE?? e

73 Example 5. AGAIN x?? IS ASYMPTOTICALLY STABLE?? e.. ( 1, ) 6[ x] V x x. BUT. V(1,) 6[] SO V(,) 6[] V( x) for all x H, x Theorem L does ot apply APPLY LaSALLE s Theorem

74 Example 5. AGAIN q= -.5 V ( x) V ( x, x ) [ x ] [ x ] q H ˆ ( x, x ) : V( x).4 1

75 Example 5. AGAIN q= -.5 E x H ˆ : V ( x). E x ( x, x ) Hˆ : x 1

76 Ivariat Sets i E d dt x1( t) x( t) 3 x( t) q[ x1 ( t)] 3 x( t) x e x1 x x E x ( x1, x) : 6[ x] M { x } e x 1 3 IF x( t), the x ( t) q[ x ( t)] 3 x ( t) 1 x ( t) 1

77 Example 5. AGAIN x E x ( x1, x) : 6[ x] M { x } e x 1 M EHˆ is LARGEST ivariat subset of E Hece LaSalle s Ivariace Theorem Implies x( tt ;, x ) M = x = x e e IS ASYMPTOTICALLY STABLE

78 Example 5.3 AGAIN d dt x1( t) x1( t) x( t) f 3 x( t) x( t) x1( t) [ x( t)] f x1 x 3 x x1 [ x] x e x1 x x?? IS STABLE?? Try the liearizatio Theorem e J f ( ) x [ ] 1 x x, x 1

79 Example 5.3 AGAIN 1 1 det I J( ) det( ) det i Re( i ) for i 1, Liearizatio Theorems do ot apply BUT

80 Example 5.3 AGAIN ZOOM IN

81 Example 5.3 AGAIN LOOKS LIKE A CENTER

82 Example 5.3 AGAIN d dt x1( t) x1( t) x( t) f 3 x( t) x( t) x1( t) [ x( t)] f x1 x 3 x x1 [ x] x e H R is a ope set V( x) V( x, x ) [ x ] [ x ] 1 1 x1 x V( ) ad V( x) V( x, x ) [ x ] [ x ] if x 1 1 Hece, V( x) is positive defiite

83 Example 5.3 AGAIN. V( x) V( x, x ) [ x ] [ x ] 1 1 V ( x, x ) V ( x, x ) V x x f x x f x x 1 1 ( 1, ) 1( 1, ) ( 1, ) x x 1 V ( x1, x) x 1 x 1 V ( x1, x) x x f x1 x f1( x1, x) 3 x x1 [ x] f( x1, x). V ( x, x ) V ( x, x ) V x x f x x f x x ( 1, ) x 1( x 1 1, ) x ( x ( 1[ 1, x] ) x x 1

84 Example 5.3 AGAIN. V ( x, x ) V ( x, x ) V x x f x x f x x ( 1, ) x 1( x 1 1, ) x ( x ( 1[ 1, x] ) x x 1 Hece,.. V x x x x x x x 3 ( 1, ) 1 ( 1 [ ] ) V( x, x ) x x x x [ x ] [ x ] V( x) [ x ] for all xh R ad Theorem L1 implies that 4 x e is stable x?? IS ASYMPTOTICALLY STABLE?? e

85 Example 5.3 AGAIN x?? IS ASYMPTOTICALLY STABLE?? e. 4. ( 1, ) [ x] 4 V x x. BUT. 4 V(1,) [] SO V(,) [] V( x) for all x H, x Theorem L does ot apply APPLY LaSALLE s Theorem

86 Example 5. AGAIN q= -.5 V( x) V( x, x ) [ x ] [ x ] 1 1 H ˆ ( x, x ) : V ( x). 1 1

87 Example 5.3 AGAIN Ĥ E x H ˆ : V( x) E x. 4 ( x1, x) : [ x]

88 Example 5.3 AGAIN d dt x1( t) x( t) 3 x( t) x1 ( t) 3[ x( t)] x e x1 x x E x 4 ( x1, x) : [ x] M { x } e x 1 IF x( t), the x ( t) x ( t) [ x ( t)] 1 x ( t) 1 3

89 Example 5.3 AGAIN x E x 4 ( x1, x) : [ x] M { x } e x 1 M EHˆ is LARGEST ivariat subset of E Hece LaSalle s Ivariace Theorem Implies x( tt ;, x ) M = x = x e e IS ASYMPTOTICALLY STABLE

90 Example 4. AGAIN x ( t) x ( t) 1 x ( t) qx ( t) x ( t) [ x ( t)] f x x 1 [ ] 3 x qx x x 1 1 x 1 1 x ( q [ x ] ) x or ( q [ x ] ) 1 1

91 Example 4. AGAIN f x 1 [ ] 3 x qx x x 1 1 x J x f ( x) J x f x 1 1 3[ ] x q x 1 1 q x e x 1 x

92 Example 4.: q AGAIN J x f ( x) J x f x 1 1 3[ ] x q x 1 1 x e x 1 x J f( x ) J x e x f 1 q 1

93 Example 4.: q < AGAIN 1 1 J ( f ( ) x q 1 q 1 q IN ALL CASES WHEN q real( ) ad real( ) 1 x e Theorem S1 IMPLIES is asymptotically stable

94 Example 4.: q > Also, we foud that IN ALL CASES WHEN q Theorem S1 IMPLIES xe is asymptotically stable

95 Example 4.: q = f x x x 1 x qx x [ x ] 3 x [ x ] x e x1 x J x f ( ) x e 1 1 Jxf q 1 1

96 Example 4.: q = J x 1 f( x ) Jxf e det ( 1)

97 Example 4.: q = f x x x 1 x qx x [ x ] 3 x [ x ] H R is a ope set V ( x) V ( x, x ) [ x ] [ x ] V ( ) ad V ( x) V ( x, x ) [ x ] [ x ] if x Hece, V( x) is positive defiite

98 Example 4.: q =. V ( x) V ( x, x ) [ x ] [ x ] V ( x, x ) V ( x, x ) V x x f x x f x x 1 1 ( 1, ) 1( 1, ) ( 1, ) x x 1 V ( x1, x) x 1 [ x ] V ( x1, x) x 1 x f x1 x f1( x1, x) 3 x [ x1 ] x f( x1, x). V (, x ) V ( x, x ) ( 1, ) [ x1 ] 1( x 1, ) x ( x1 1, x ) x x 1 V x x f x x ( f [ x] x )

99 Example 4.: q =. V (, x ) V ( x, x ) ( 1, ) [ x1 ] 1( x 1, ) x ( x1 1, x ) x x 1 V x x f x x ( f [ x] x ). V( x, x ) [ x ] x [ x ] x [ x ] [ x ] Hece,. V( x) [ x ] for all xh R ad Theorem L1 implies that x e is stable x?? IS ASYMPTOTICALLY STABLE?? e

100 Example 4.: q = d dt x1( t) x( t) 3 x( t) [ x1 ( t)] x( t) x e x1 x x E x ( x1, x) : [ x] M { x } e x 1 IF x( t), the x ( t) [ x ( t)] x ( t) 3 1 x ( t) 1

101 Example 4.: q = x E x 4 ( x1, x) : [ x] M { x } e x 1 M EHˆ is LARGEST ivariat subset of E Hece LaSalle s Ivariace Theorem Implies x( tt ;, x ) M = x = x e e IS ASYMPTOTICALLY STABLE

102 Bifurcatio Diagram: Example 4. R x 1 q STABLE x STABLE LaSalle s Ivariace Theorem Implies x STABLE x UNSTABLE q q? EXPONENTIALLY??STABLE?

103 Example 4.1 q < x( t) y( t) y( t) qx( t) ([ x( t)] [ y( t)] 1) y( t) d dt x1( t) x( t) x( t) qx1 ( t) ([ x1 ( t)] [ x( t)] 1) x( t) f x1 x x qx1 ([ x1 ] [ x] 1) x x x 1

104 Example 4.1 q = -1 q 1 f1( x, y) y ( xy, ) : f( x, y) qx ( x y 1) y ( x, y) : f ( x, y) y 1 ( x, y) : f( x, y) qx ( x y 1) y

105 Example 4.1 q = -1 q 1 x1 () t si( t) x() t cos( t) ([ x ( t)] [ x ( t)] 1) 1 PERIODIC SOLUTION

106 Example 4.1 q = -1 x1 () t si( t) x() t cos( t) q 1

107 Example 4.1 q = -1 q 1 LIMIT CYCLE

108 Example 4.1 q = -1 d dt x1( t) x( t) x( t) x1 ( t) ([ x1 ( t)] [ x( t)] 1) x( t) f x1 x x x1 ([ x1 ] [ x] 1) x x x 1 V ( x) V ( x, x ) ([ x ] [ x ] 1)

109 Example 4.1 q = -1 V ( x1, x) x 1 V ( x) V ( x, x ) ([ x ] [ x ] 1) x ([ x ] [ x ] 1) V ( x1, x) x x ([ x ] [ x ] 1) 1 f x1 x x x1 ([ x1 ] [ x] 1) x. V ( x, x ) V ( x, x ) V ( x, x ) f ( x, x ) ( f ( x,([ x )] [ ] 1) ) x1 ([ x1 ] [ x] 1) x 1 1 x x 1 x 1 1 x x ([ x1 ] [ x] 1) x x 1 V( x, x ) x x ([ x ] [ x ] 1) x x ([ x ] [ x ] 1) ([ x ] [ x ] 1) x

110 . Example 4.1 q = -1 V( x, x ) x x ([ x ] [ x ] 1) x x ([ x ] [ x ] 1) ([ x ] [ x ] 1) x V( x, x ) ([ x ] [ x ] 1) x 1 1 E x H ˆ : V( x) E x ( x, x ) Hˆ : ([ x ] [ x ] 1) x. 1 1 E x ( x 1, x ˆ ˆ ) H : ([ x1 ] [ x] 1) x ( x1, x) H : x E x ( x, x ) H ˆ : ([ x ] [ x ] 1) E x ( x, x ) Hˆ : x 1 E E1 E WHAT IS Ĥ

111 Example 4.1 q = -1 V ( x) V ( x, x ) ([ x ] [ x ] 1) E 1 M { xe } E M { x= [ x, x ] :([ x ] [ x ] 1) } 1 1 T 1 H ˆ ( x, x ) : V ( x) 1

112 Example 4.1 q = -1 q 1 LIMIT CYCLE H ˆ ( x, x ) : V ( x) 1

113 Bifurcatio Theory: 1D 3 f ( t, x, q) qx [ x] x( t) qx( t) [ x( t)] 3 x e = q (1/) x e = -q (1/) q < q = q > x e = x e = x e = Supercritical Pitchfork Bifurcatio

114 Bifurcatio Theory: 1D R 1 x 1 1/ [ q] STABLE x STABLE x UNSTABLE q STABLE x [ q] 1/

115 Bifurcatio: 1D 3 5 x( t) qx( t) [ x( t)] [ x( t)] 3 5 f ( x, q) qx [ x] [ x] x 1 x4 x 1 x

116 Bifurcatio: 1D 3 5 x( t) qx( t) [ x( t)] [ x( t)] 3 5 f ( x, q) qx [ x] [ x] x 5 x x4 x 1 x 3 x 5 x x x 4 1 x 3

117 Bifurcatio: 1D 3 5 x( t) qx( t) [ x( t)] [ x( t)] 3 5 f ( x, q) qx [ x] [ x] x x 5 1 x 3 x 5 x3 x 1

118 Bifurcatio: 1D Subcritical Pitchfork Bifurcatio x 3 R 1 STABLE x x UNSTABLE STABLE x UNSTABLE q = -.5 UNSTABLE q x 4 x 5 STABLE

119 Bifurcatio: 1D q =

120 Bifurcatio: 1D q =

121 Bifurcatio: 1D R 1 STABLE x 3 x UNSTABLE x STABLE x UNSTABLE q = -.5 x UNSTABLE 4 q x 5 STABLE Subcritical Pitchfork Bifurcatio = BIG JUMP!!!

122 Typical Hopf Bifurcatio, b ad q x t q x t y t x t y t x t ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) ( b([ x( t)] [ y( t)] )) y( t) y t q x t y t x t y t y t ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) +( b([ x( t)] [ y( t)] )) x( t) f x ( q x y ( x y ) ) x ( b( x y )) y y ( q x y ( x y ) ) y+( b( x y )) x OR

123 Typical Hopf Bifurcatio ( q x y ( x y ) ) ( b( x y )) x ( b( x y )) ( q x y ( x y ) ) y det ( q x y ( x y ) ) ( b( x y )) ( b( x y )) ( q x y ( x y ) ) ( q x y ( x y ) ) ( b( x y )), b ad q ( q x y ( x y ) ) ( b( x y )) x e x y

124 Typical Hopf Bifurcatio f x ( q x y ( x y ) ) x ( b( x y )) y y ( q x y ( x y ) ) y+( b( x y )) x J x f ( ) x e J x f q q 1 q q 1 q q q q det ( q)

125 Typical Hopf Bifurcatio q q det ( q) ( q) 1 qi qi Re( ) i q q q xe IS STABLE xe IS UNSTABLE

126 Polar Coordiates x t q x t y t x t y t x t ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) ( b([ x( t)] [ y( t)] )) y( t) y t q x t y t x t y t y t ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) +( b([ x( t)] [ y( t)] )) x( t) x( t) r( t)cos( ( t)) y( t) r( t)si( ( t)) x( t) r( t)cos( ( t)) r( t)si( ( t)) ( t) y( t) r( t)si( ( t)) r( t)cos( ( t)) ( t)

127 Polar Coordiates rt () x t q x t y t x t [ ( )] y t x t 4 ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) ( b([ x( t)] [ y( t)] )) y( t) rt r( t)cos( ( t)) rt () r( t)si( ( t)) y t q x t y t x t [ rt ( )] y t y t 4 ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) r t q r t r t r t rt () rt () ( b([ x( t)] [ y( t)] )) x( t) 4 ( ) ( [ ( )] ([ ( )] ) ( ) ( t) ( b[ r( t)] ) r( t)cos( ( t))? HOW? WORK BACKWARDS r( t)si( ( t))

128 Polar Coordiates r t q r t r t r t 4 ( ) ( [ ( )] ([ ( )] ) ( ) ( t) ( b[ r( t)] ) x( t) r( t)cos( ( t)) r( t)si( ( t)) ( t) x t q r t r t r t t 4 ( ) ( [ ( )] ([ ( )] ) ( )cos( ( )) r( t)si( ( t)) ( t) x t q r t r t r t t 4 ( ) ( [ ( )] ([ ( )] ) ( )cos( ( )) r t t b r t ( )si( ( ))( [ ( )] )

129 Polar Coordiates x t q r t r t r t t 4 ( ) ( [ ( )] ([ ( )] ) ( )cos( ( )) r t t b r t ( )si( ( ))( [ ( )] ) r x y x r y r ( ) cos( ) si( ) x t q x t y t x t y t r t t ( ) ( ([ ( )] [ ( )] ) (([ ( )] [ ( )] ) ) ( )cos( ( )) r t t b x t y t ( )si( ( ))( ([ ( )] [ ( )] )) x t q x t y t x t y t x t ( ) ( ([ ( )] [ ( )] ) (([ ( )] [ ( )] ) ) ( ) y t b x t y t ( )( ([ ( )] [ ( )] ))

130 Polar Coordiates x t q x t y t x t y t x t ( ) ( ([ ( )] [ ( )] ) (([ ( )] [ ( )] ) ) ( ) y t b x t y t ( )( ([ ( )] [ ( )] )) SIMILARLY y t q x t y t x t y t y t ( ) ( [ ( )] [ ( )] ([ ( )] [ ( )] ) ) ( ) +( b([ x( t)] [ y( t)] )) x( t) r t q r t r t r t 4 ( ) ( [ ( )] ([ ( )] ) ( ) ( t) ( b[ r( t)] )

131 Polar Coordiates r t q r t r t r t 4 ( ) ( [ ( )] ([ ( )] ) ( ) ( t) ( b[ r( t)] ) r( t) qr( t) [ r( t)] [ r( t)] ( t) ( b[ r( t)] ) qr r r qr r r 3 5

132 Recall 1D example 3 5 x( t) qx( t) [ x( t)] [ x( t)] 3 5 f ( x, q) qx [ x] [ x]

133 Polar Coordiates r( t) qr( t) [ r( t)] [ r( t)] ( t) ( b[ r( t)] ) 3 5 qr r r 3 5 qr r r 3 5

134 q = -.5

135 q = -.5

136 q = -.

137 q = -.5

138 q =

139 q =.

140 Hopf Bifuricatio R x s_lc () t STABLE LIMIT CYCLE x q = -.5 x us_lc STABLE x 4 () t UNSTABLE LIMIT CYCLE x UNSTABLE q Subcritical Hopf Bifurcatio = BIG JUMP!!!

141 Itroductio to Dyamical Systems Basic Ideas

142 Dyamical Systems (Σ) x( t) f x( t) (IC) x() zr x( t) x( t, z) R for all t DEFINE S( t) : R R BY S( t) z x( t, z) ( i) S() I : R R ( ii) S( t ) zs( t) S( ) z ( iii) lim S( t) z t z

143 Dyamical Systems A FAMILY OF CONTINUOUS OPERATORS S() z x(, z) z = Iz lim S ( t ) z lim x ( t, z) x (, z) z S( t) : R R, t SATISFYING (i), (ii) ad (iii) ABOVE IS CALLED A DYNAMICAL SYSTEM ON t t R WHAT ABOUT (ii)? ( ii) S( t ) zs( t) S( ) z

144 Dyamical Systems time t x( t, z) x( t, x(, z)) z x(, z) S( t ) z x( t, z) x( t, x(, z)) S( t) S( ) z

145 Semi-groups A FAMILY OF CONTINUOUS OPERATORS SATISFYING S( t) : R R, t ( i) S() I : R R ( ii) S( t ) zs( t) S( ) z ( iii) lim S( t) z t z IS CALLED A SEMI-GROUP ON R

146 Ivariat Sets (Σ) St ( ) : x 3 R z Positively Ivariat Set z M M z x 1 S( t) z x( t; z) M for all t

147 Ivariat Sets (Σ) St ( ) : x 3 R z Negatively Ivariat Set z M M z x 1 S( t) z x( t; z) M for all t

148 Ivariat Sets (Σ) St ( ) : x 3 R z Ivariat Set z M M z x 1 S( t) z x( t; z) M for all t ad S( t) z x( t; z) M for all t

149 Covergece to a Set x 3 R S( t) z x( t, z) M as t M x 1 For ay T if T t T there is a such that, the there is a poit p M with S( t) z p <

150 Covergece to a Set x 3 p St ( ) z M p 1 M R St ( 1) z M S() t z R x 1 ST ( ) z x

151 Orbits & Limit Sets z R Give, the (positive) orbit through is the set ( z) S( t) zr : t z IF Stz () EXISTS FOR ALL t the (egative) orbit through z is the set ( z) S( t) zr : t ad the orbit through z is the set ( z) S( t) z R : t (, )

152 Give z R -Limit Sets, a poit p is a omega limit poit of () z T t T if for each ad every there is a such that S()z t p < - limit set of z ( z) p: p is a -limit poit of zr EQUIVALENTLY ( z) St ( ) z s ts

153 Give z R -Limit Sets, a poit p is a alpha limit poit of () z T if for each ad every there is a such that S()z t p < - limit set of z ( z) p: p is a -limit poit of zr t T EQUIVALENTLY 1 ( z) [ S( t)] z s ts

154 Limit Sets Give Z R, - limit set of Z ( Z) St ( ) Z s ts - limit set of Z S t 1 Z s ts ( Z) [ ( )]

155 Ivariat Set & Attractors Z R A set semi-group, is (fuctioal) ivariat for the S( t) : R R, t if S( t) ZZ, t A R B R St () ( AB, ) A set attracts a set uder the semi-group if, for ay there exists a t t such that S( t) BN( A, ) for all t t

156 Attractors B N( A, ) A StB () St ( ) B A attractor is a set (i) ad A A A R is compact ad ivariat satisfyig (ii) attracts a ope eighborhood of A U

157 Global Attractor A global attractor is a set (i) ad (ii) A A is a attractor A R attracts all bouded sets A semi-group satisfyig B R S( t) : R R, t said to be dissipative if there is a bouded positively ivariat set bouded sets B R W R is that attracts all

158 (Σ) Dissipative System x( t) f x( t) (IC) x() x( t) x( t, z) R for all t zr DEFINE S( t) : R R BY S( t) z x( t, z) Theorem D1. If costats, such that the the dyamical system defied by with absorbig set f : R R is smooth ad there exist f ( x), x x for all x R, St W B(, / ) x : x / is dissipative

159 Dissipative System Theorem D: If S( t) : R R, t is a dissipative dyamical system with absorbig set W, the is a global attractor. ( ) St ( ) s ts A W W A. M. Stuart ad A. R. Humphries, Dyamical Systems ad Numerical Aalysis, Cambridge Uiversity Press, ad Jack K. Hale, Asymptotic Behavior of Dissipative Systems, Mathematical Surveys 5, AMS Publicatios,Providece, RI 1989.

Intermediate Differential Equations. Stability and Bifurcation II. John A. Burns

Intermediate Differential Equations. Stability and Bifurcation II. John A. Burns Intermediate Differential Equations Stability and Bifurcation II John A. Burns Center for Optimal Design And Control Interdisciplinary Center for Applied Mathematics Virginia Polytechnic Institute and

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

More information

Lyapunov Stability Analysis for Feedback Control Design

Lyapunov Stability Analysis for Feedback Control Design Copyright F.L. Lewis 008 All rights reserved Updated: uesday, November, 008 Lyapuov Stability Aalysis for Feedbac Cotrol Desig Lyapuov heorems Lyapuov Aalysis allows oe to aalyze the stability of cotiuous-time

More information

AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS

AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

More information

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques. How to Solve Equations Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually

More information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

On the convergence rates of Gladyshev s Hurst index estimator

On the convergence rates of Gladyshev s Hurst index estimator Noliear Aalysis: Modellig ad Cotrol, 2010, Vol 15, No 4, 445 450 O the covergece rates of Gladyshev s Hurst idex estimator K Kubilius 1, D Melichov 2 1 Istitute of Mathematics ad Iformatics, Vilius Uiversity

More information

A) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set.

A) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set. M.A./M.Sc. (Mathematics) Etrace Examiatio 016-17 Max Time: hours Max Marks: 150 Istructios: There are 50 questios. Every questio has four choices of which exactly oe is correct. For correct aswer, 3 marks

More information

Solutions for Math 411 Assignment #2 1

Solutions for Math 411 Assignment #2 1 Solutios for Math 4 Assigmet #2 A2. For each of the followig fuctios f : C C, fid where f(z is complex differetiable ad where f(z is aalytic. You must justify your aswer. (a f(z = e x2 y 2 (cos(2xy + i

More information

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b. Iterative Techiques for Solvig Ax b -(8) Cosider solvig liear systems of them form: Ax b where A a ij, x x i, b b i Assume that the system has a uique solutio Let x be the solutio The x A b Jacobi ad Gauss-Seidel

More information

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let. Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

Stability Analysis of the Euler Discretization for SIR Epidemic Model

Stability Analysis of the Euler Discretization for SIR Epidemic Model Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we

More information

Math 341 Lecture #31 6.5: Power Series

Math 341 Lecture #31 6.5: Power Series Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series

More information

MATH 10550, EXAM 3 SOLUTIONS

MATH 10550, EXAM 3 SOLUTIONS MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define 5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o

More information

( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to

( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to Compaiso Fuctios I this lesso, we study stability popeties of the oautoomous system = f t, x The difficulty is that ay solutio of this system statig at x( t ) depeds o both t ad t = x Thee ae thee special

More information

MATH 31B: MIDTERM 2 REVIEW

MATH 31B: MIDTERM 2 REVIEW MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate x (x ) (x 3).. Partial Fractios Solutio: The umerator has degree less tha the deomiator, so we ca use partial fractios. Write x (x ) (x 3) = A x + A (x ) +

More information

1. Linearization of a nonlinear system given in the form of a system of ordinary differential equations

1. Linearization of a nonlinear system given in the form of a system of ordinary differential equations . Liearizatio of a oliear system give i the form of a system of ordiary differetial equatios We ow show how to determie a liear model which approximates the behavior of a time-ivariat oliear system i a

More information

PAPER : IIT-JAM 2010

PAPER : IIT-JAM 2010 MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure

More information

MATHEMATICS. 61. The differential equation representing the family of curves where c is a positive parameter, is of

MATHEMATICS. 61. The differential equation representing the family of curves where c is a positive parameter, is of MATHEMATICS 6 The differetial equatio represetig the family of curves where c is a positive parameter, is of Order Order Degree (d) Degree (a,c) Give curve is y c ( c) Differetiate wrt, y c c y Hece differetial

More information

Period Function of a Lienard Equation

Period Function of a Lienard Equation Joural of Mathematical Scieces (4) -5 Betty Joes & Sisters Publishig Period Fuctio of a Lieard Equatio Khalil T Al-Dosary Departmet of Mathematics, Uiversity of Sharjah, Sharjah 77, Uited Arab Emirates

More information

Research Article A New Second-Order Iteration Method for Solving Nonlinear Equations

Research Article A New Second-Order Iteration Method for Solving Nonlinear Equations Abstract ad Applied Aalysis Volume 2013, Article ID 487062, 4 pages http://dx.doi.org/10.1155/2013/487062 Research Article A New Secod-Order Iteratio Method for Solvig Noliear Equatios Shi Mi Kag, 1 Arif

More information

Ans: a n = 3 + ( 1) n Determine whether the sequence converges or diverges. If it converges, find the limit.

Ans: a n = 3 + ( 1) n Determine whether the sequence converges or diverges. If it converges, find the limit. . Fid a formula for the term a of the give sequece: {, 3, 9, 7, 8 },... As: a = 3 b. { 4, 9, 36, 45 },... As: a = ( ) ( + ) c. {5,, 5,, 5,, 5,,... } As: a = 3 + ( ) +. Determie whether the sequece coverges

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor IJITE Vol Issue-, (November 4) ISSN: 3-776 ATTRACTIVITY OF A HIGHER ORDER NONLINEAR DIFFERENCE EQUATION Guagfeg Liu School of Zhagjiagag Jiagsu Uiversit of Sciece ad Techolog, Zhagjiagag, Jiagsu 56,PR

More information

ANSWERS TO MIDTERM EXAM # 2

ANSWERS TO MIDTERM EXAM # 2 MATH 03, FALL 003 ANSWERS TO MIDTERM EXAM # PENN STATE UNIVERSITY Problem 1 (18 pts). State ad prove the Itermediate Value Theorem. Solutio See class otes or Theorem 5.6.1 from our textbook. Problem (18

More information

Introduction to Optimization Techniques

Introduction to Optimization Techniques Itroductio to Optimizatio Techiques Basic Cocepts of Aalysis - Real Aalysis, Fuctioal Aalysis 1 Basic Cocepts of Aalysis Liear Vector Spaces Defiitio: A vector space X is a set of elemets called vectors

More information

Classification of DT signals

Classification of DT signals Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {

More information

CALIFORNIA INSTITUTE OF TECHNOLOGY. Control and Dynamical Systems CDS 270. Eugene Lavretsky Spring 2007

CALIFORNIA INSTITUTE OF TECHNOLOGY. Control and Dynamical Systems CDS 270. Eugene Lavretsky Spring 2007 CALIFORNIA INSTITUTE OF TECHNOLOGY Cotrol ad Dyamical Systems CDS 7 Eugee Lavretsky Sprig 7 Lecture 1 1. Itroductio Readig material: [1]: Chapter 1, Sectios 1.1, 1. [1]: Chapter 3, Sectio 3.1 []: Chapter

More information

Solution of EECS 315 Final Examination F09

Solution of EECS 315 Final Examination F09 Solutio of EECS 315 Fial Examiatio F9 1. Fid the umerical value of δ ( t + 4ramp( tdt. δ ( t + 4ramp( tdt. Fid the umerical sigal eergy of x E x = x[ ] = δ 3 = 11 = ( = ramp( ( 4 = ramp( 8 = 8 [ ] = (

More information

Differentiable Convex Functions

Differentiable Convex Functions Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for

More information

Theory of Ordinary Differential Equations. Stability and Bifurcation I. John A. Burns

Theory of Ordinary Differential Equations. Stability and Bifurcation I. John A. Burns Theory of Ordinary Differential Equations Stability and Bifurcation I John A. Burns Center for Optimal Design And Control Interdisciplinary Center for Applied Mathematics Virginia Polytechnic Institute

More information

CHAPTER 1 SEQUENCES AND INFINITE SERIES

CHAPTER 1 SEQUENCES AND INFINITE SERIES CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig

More information

Beyond simple iteration of a single function, or even a finite sequence of functions, results

Beyond simple iteration of a single function, or even a finite sequence of functions, results A Primer o the Elemetary Theory of Ifiite Compositios of Complex Fuctios Joh Gill Sprig 07 Abstract: Elemetary meas ot requirig the complex fuctios be holomorphic Theorem proofs are fairly simple ad are

More information

Math 210A Homework 1

Math 210A Homework 1 Math 0A Homework Edward Burkard Exercise. a) State the defiitio of a aalytic fuctio. b) What are the relatioships betwee aalytic fuctios ad the Cauchy-Riema equatios? Solutio. a) A fuctio f : G C is called

More information

State Space Representation

State Space Representation Optimal Cotrol, Guidace ad Estimatio Lecture 2 Overview of SS Approach ad Matrix heory Prof. Radhakat Padhi Dept. of Aerospace Egieerig Idia Istitute of Sciece - Bagalore State Space Represetatio Prof.

More information

BIRKHOFF ERGODIC THEOREM

BIRKHOFF ERGODIC THEOREM BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s) that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION

-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION NEW NEWTON-TYPE METHOD WITH k -ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION R. Thukral Padé Research Cetre, 39 Deaswood Hill, Leeds West Yorkshire, LS7 JS, ENGLAND ABSTRACT The objective

More information

Chapter 3 Inner Product Spaces. Hilbert Spaces

Chapter 3 Inner Product Spaces. Hilbert Spaces Chapter 3 Ier Product Spaces. Hilbert Spaces 3. Ier Product Spaces. Hilbert Spaces 3.- Defiitio. A ier product space is a vector space X with a ier product defied o X. A Hilbert space is a complete ier

More information

Chapter 7 Isoperimetric problem

Chapter 7 Isoperimetric problem Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated

More information

An Analysis of a Certain Linear First Order. Partial Differential Equation + f ( x, by Means of Topology

An Analysis of a Certain Linear First Order. Partial Differential Equation + f ( x, by Means of Topology Iteratioal Mathematical Forum 2 2007 o. 66 3241-3267 A Aalysis of a Certai Liear First Order Partial Differetial Equatio + f ( x y) = 0 z x by Meas of Topology z y T. Oepomo Sciece Egieerig ad Mathematics

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5 Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You

More information

} is said to be a Cauchy sequence provided the following condition is true.

} is said to be a Cauchy sequence provided the following condition is true. Math 4200, Fial Exam Review I. Itroductio to Proofs 1. Prove the Pythagorea theorem. 2. Show that 43 is a irratioal umber. II. Itroductio to Logic 1. Costruct a truth table for the statemet ( p ad ~ r

More information

Lecture 3: Convergence of Fourier Series

Lecture 3: Convergence of Fourier Series Lecture 3: Covergece of Fourier Series Himashu Tyagi Let f be a absolutely itegrable fuctio o T : [ π,π], i.e., f L (T). For,,... defie ˆf() f(θ)e i θ dθ. π T The series ˆf()e i θ is called the Fourier

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Section A assesses the Units Numerical Analysis 1 and 2 Section B assesses the Unit Mathematics for Applied Mathematics

Section A assesses the Units Numerical Analysis 1 and 2 Section B assesses the Unit Mathematics for Applied Mathematics X0/70 NATIONAL QUALIFICATIONS 005 MONDAY, MAY.00 PM 4.00 PM APPLIED MATHEMATICS ADVANCED HIGHER Numerical Aalysis Read carefully. Calculators may be used i this paper.. Cadidates should aswer all questios.

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals

More information

B U Department of Mathematics Math 101 Calculus I

B U Department of Mathematics Math 101 Calculus I B U Departmet of Mathematics Math Calculus I Sprig 5 Fial Exam Calculus archive is a property of Boğaziçi Uiversity Mathematics Departmet. The purpose of this archive is to orgaise ad cetralise the distributio

More information

The Sumudu transform and its application to fractional differential equations

The Sumudu transform and its application to fractional differential equations ISSN : 30-97 (Olie) Iteratioal e-joural for Educatio ad Mathematics www.iejem.org vol. 0, No. 05, (Oct. 03), 9-40 The Sumudu trasform ad its alicatio to fractioal differetial equatios I.A. Salehbhai, M.G.

More information

MATH 312 Midterm I(Spring 2015)

MATH 312 Midterm I(Spring 2015) MATH 3 Midterm I(Sprig 05) Istructor: Xiaowei Wag Feb 3rd, :30pm-3:50pm, 05 Problem (0 poits). Test for covergece:.. 3.. p, p 0. (coverges for p < ad diverges for p by ratio test.). ( coverges, sice (log

More information

Special Modeling Techniques

Special Modeling Techniques Colorado School of Mies CHEN43 Secial Modelig Techiques Secial Modelig Techiques Summary of Toics Deviatio Variables No-Liear Differetial Equatios 3 Liearizatio of ODEs for Aroximate Solutios 4 Coversio

More information

Assignment 1 : Real Numbers, Sequences. for n 1. Show that (x n ) converges. Further, by observing that x n+2 + x n+1

Assignment 1 : Real Numbers, Sequences. for n 1. Show that (x n ) converges. Further, by observing that x n+2 + x n+1 Assigmet : Real Numbers, Sequeces. Let A be a o-empty subset of R ad α R. Show that α = supa if ad oly if α is ot a upper boud of A but α + is a upper boud of A for every N. 2. Let y (, ) ad x (, ). Evaluate

More information

Taylor expansion: Show that the TE of f(x)= sin(x) around. sin(x) = x - + 3! 5! L 7 & 8: MHD/ZAH

Taylor expansion: Show that the TE of f(x)= sin(x) around. sin(x) = x - + 3! 5! L 7 & 8: MHD/ZAH Taylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. A ay poit i the eighbourhood of 0, the fuctio ƒ() ca be represeted by a power series of the followig form: X 0 f(a) f() f() ( ) f( ) ( )

More information

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1. SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad

More information

CDS 101: Lecture 5.1 Controllability and State Space Feedback

CDS 101: Lecture 5.1 Controllability and State Space Feedback CDS, Lecture 5. CDS : Lecture 5. Cotrollability ad State Space Feedback Richard M. Murray 8 October Goals: Deie cotrollability o a cotrol system Give tests or cotrollability o liear systems ad apply to

More information

Describing Function: An Approximate Analysis Method

Describing Function: An Approximate Analysis Method Describig Fuctio: A Approximate Aalysis Method his chapter presets a method for approximately aalyzig oliear dyamical systems A closed-form aalytical solutio of a oliear dyamical system (eg, a oliear differetial

More information

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that Lecture 15 We have see that a sequece of cotiuous fuctios which is uiformly coverget produces a limit fuctio which is also cotiuous. We shall stregthe this result ow. Theorem 1 Let f : X R or (C) be a

More information

NBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian?

NBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian? NBHM QUESTION 7 NBHM QUESTION 7 NBHM QUESTION 7 Sectio : Algebra Q Let G be a group of order Which of the followig coditios imply that G is abelia? 5 36 Q Which of the followig subgroups are ecesarily

More information

Research Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property

Research Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property Discrete Dyamics i Nature ad Society Volume 2011, Article ID 360583, 6 pages doi:10.1155/2011/360583 Research Article A Note o Ergodicity of Systems with the Asymptotic Average Shadowig Property Risog

More information

Name: Math 10550, Final Exam: December 15, 2007

Name: Math 10550, Final Exam: December 15, 2007 Math 55, Fial Exam: December 5, 7 Name: Be sure that you have all pages of the test. No calculators are to be used. The exam lasts for two hours. Whe told to begi, remove this aswer sheet ad keep it uder

More information

Concavity Solutions of Second-Order Differential Equations

Concavity Solutions of Second-Order Differential Equations Proceedigs of the Paista Academy of Scieces 5 (3): 4 45 (4) Copyright Paista Academy of Scieces ISSN: 377-969 (prit), 36-448 (olie) Paista Academy of Scieces Research Article Cocavity Solutios of Secod-Order

More information

Brief Review of Functions of Several Variables

Brief Review of Functions of Several Variables Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(

More information

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),

More information

n 3 ln n n ln n is convergent by p-series for p = 2 > 1. n2 Therefore we can apply Limit Comparison Test to determine lutely convergent.

n 3 ln n n ln n is convergent by p-series for p = 2 > 1. n2 Therefore we can apply Limit Comparison Test to determine lutely convergent. 06 微甲 0-04 06-0 班期中考解答和評分標準. ( poits) Determie whether the series is absolutely coverget, coditioally coverget, or diverget. Please state the tests which you use. (a) ( poits) (b) ( poits) (c) ( poits)

More information

Research Article Nonautonomous Discrete Neuron Model with Multiple Periodic and Eventually Periodic Solutions

Research Article Nonautonomous Discrete Neuron Model with Multiple Periodic and Eventually Periodic Solutions Discrete Dyamics i Nature ad Society Volume 21, Article ID 147282, 6 pages http://dx.doi.org/1.11/21/147282 Research Article Noautoomous Discrete Neuro Model with Multiple Periodic ad Evetually Periodic

More information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

Research Article Nonexistence of Homoclinic Solutions for a Class of Discrete Hamiltonian Systems

Research Article Nonexistence of Homoclinic Solutions for a Class of Discrete Hamiltonian Systems Abstract ad Applied Aalysis Volume 203, Article ID 39868, 6 pages http://dx.doi.org/0.55/203/39868 Research Article Noexistece of Homocliic Solutios for a Class of Discrete Hamiltoia Systems Xiaopig Wag

More information

Solutions to Final Exam Review Problems

Solutions to Final Exam Review Problems . Let f(x) 4+x. Solutios to Fial Exam Review Problems Math 5C, Witer 2007 (a) Fid the Maclauri series for f(x), ad compute its radius of covergece. Solutio. f(x) 4( ( x/4)) ( x/4) ( ) 4 4 + x. Sice the

More information

Numerical Method for Blasius Equation on an infinite Interval

Numerical Method for Blasius Equation on an infinite Interval Numerical Method for Blasius Equatio o a ifiite Iterval Alexader I. Zadori Omsk departmet of Sobolev Mathematics Istitute of Siberia Brach of Russia Academy of Scieces, Russia zadori@iitam.omsk.et.ru 1

More information

ON THE FUZZY METRIC SPACES

ON THE FUZZY METRIC SPACES The Joural of Mathematics ad Computer Sciece Available olie at http://www.tjmcs.com The Joural of Mathematics ad Computer Sciece Vol.2 No.3 2) 475-482 ON THE FUZZY METRIC SPACES Received: July 2, Revised:

More information

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

Ω ). Then the following inequality takes place:

Ω ). Then the following inequality takes place: Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,

More information

Uniform Strict Practical Stability Criteria for Impulsive Functional Differential Equations

Uniform Strict Practical Stability Criteria for Impulsive Functional Differential Equations Global Joural of Sciece Frotier Research Mathematics ad Decisio Scieces Volume 3 Issue Versio 0 Year 03 Type : Double Blid Peer Reviewed Iteratioal Research Joural Publisher: Global Jourals Ic (USA Olie

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Stability Analysis and Bifurcation Control of Hysteresis Current Controlled Ćuk Converter Using Filippov s Method

Stability Analysis and Bifurcation Control of Hysteresis Current Controlled Ćuk Converter Using Filippov s Method Stability Aalysis ad Bifurcatio otrol of Hysteresis urret otrolled Ću overter Usig Filippov s Method I. Daho*, D. Giaouris * (Member IE, B. Zahawi*(Member IE, V. Picer*(Member IE ad S. Baerjee** *School

More information

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

More information

Solutions to quizzes Math Spring 2007

Solutions to quizzes Math Spring 2007 to quizzes Math 4- Sprig 7 Name: Sectio:. Quiz a) x + x dx b) l x dx a) x + dx x x / + x / dx (/3)x 3/ + x / + c. b) Set u l x, dv dx. The du /x ad v x. By Itegratio by Parts, x(/x)dx x l x x + c. l x

More information

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0. 40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx

1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx Problem A. Calculate ta(.) to 4 decimal places. Solutio: The power series for si(x)/ cos(x) is x + x 3 /3 + (2/5)x 5 +. Puttig x =. gives ta(.) =.3. Problem 2A. Let f : R R be a cotiuous fuctio. Show that

More information

Math 5C Discussion Problems 2 Selected Solutions

Math 5C Discussion Problems 2 Selected Solutions Math 5 iscussio Problems 2 elected olutios Path Idepedece. Let be the striaght-lie path i 2 from the origi to (3, ). efie f(x, y) = xye xy. (a) Evaluate f dr. olutio. (b) Evaluate olutio. (c) Evaluate

More information

MATH2007* Partial Answers to Review Exercises Fall 2004

MATH2007* Partial Answers to Review Exercises Fall 2004 MATH27* Partial Aswers to Review Eercises Fall 24 Evaluate each of the followig itegrals:. Let u cos. The du si ad Hece si ( cos 2 )(si ) (u 2 ) du. si u 2 cos 7 u 7 du Please fiish this. 2. We use itegratio

More information

II. EXPANSION MAPPINGS WITH FIXED POINTS

II. EXPANSION MAPPINGS WITH FIXED POINTS Geeralizatio Of Selfmaps Ad Cotractio Mappig Priciple I D-Metric Space. U.P. DOLHARE Asso. Prof. ad Head,Departmet of Mathematics,D.S.M. College Jitur -431509,Dist. Parbhai (M.S.) Idia ABSTRACT Large umber

More information

PRELIM PROBLEM SOLUTIONS

PRELIM PROBLEM SOLUTIONS PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)]. Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x

More information

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0, Math Activity 9( Due with Fial Eam) Usig first ad secod Taylor polyomials with remaider, show that for, 8 Usig a secod Taylor polyomial with remaider, fid the best costat C so that for, C 9 The th Derivative

More information

INTRODUCTORY MATHEMATICAL ANALYSIS

INTRODUCTORY MATHEMATICAL ANALYSIS INTRODUCTORY MATHEMATICAL ANALYSIS For Busiess, Ecoomics, ad the Life ad Social Scieces Chapter 4 Itegratio 0 Pearso Educatio, Ic. Chapter 4: Itegratio Chapter Objectives To defie the differetial. To defie

More information