• Tidak ada hasil yang ditemukan

Linear Algebra and Differential Equations

N/A
N/A
Protected

Academic year: 2024

Membagikan "Linear Algebra and Differential Equations"

Copied!
41
0
0

Teks penuh

(1)

Linear Algebra and Differential Equations

Sujin Khomrutai, Ph.D.

Department of Math & Computer Science Chulalongkorn University

Lecture 7

(2)

Table of Contents

1 Nonhomogeneous Vector DE

2 Dynamical Systems

(3)

Nonhomogeneous Vector DE

We study

~

x0 =A(t)~x+f~(t),

where A(t) isn×n matrix and ~f is ann-vector function.

Theorem

Assume A(t), ~f are continuous.

Then ~x0 =A(t)~x+f~(t) has a general solution

~

x(t) =C1~x1(t) +· · ·+Cn~xn(t) +X(t),

where~x1, . . . , ~xn are fundamental solutions to the homogeneous equation

~x0 =A(t)~x,

and X(t) is a particular solution to the nonhomogeneous vector DE.

(4)

Nonhomogeneous Vector DE

Theorem (Variation of parameters method) Let Φ(t) be an n×n matrix value function given by

Φ(t) =

~

x1(t) · · · ~xn(t) , where~x1, . . . , ~xn are linearly independent solutions of

~

x0 =A(t)~x.

Then a particular solution to ~x0 =A(t)~x+~f(t) is X~(t) = Φ(t)

Z

Φ(s)−1f~(s)ds.

Note. Φ(t) is called a fundamental matrixfor the vector DE.

(5)

Nonhomogeneous Vector DE

Remark. In practice, it is easier calculateX~(t) as follows.

Step 1. Find~x1, . . . , ~xn, then form Φ(t).

Step 2. Solve the linear algebraic equation

Φ(t)~v0(t) =f~(t) ⇒ get ~v0(t) = p0(t)

q0(t)

.

One may use Cramer’s rule/Gaussian elimination method.

Step 3. Integrate~v0(t) to get

~ v(t) =

Z

~

v0(t)dt = p(t)

q(t)

.

Step 4. A particular solution is

X~(t) = Φ(t)~v(t).

(6)

Nonhomogeneous Vector DE

Example

Find a particular solution of ~x0 = 1 2

4 3

~ x+

12e3t 18e2t

. Given that

~ x1(t) =

−e−t e−t

, ~x2(t) = e5t

2e5t

. Sol. We get Φ(t) =

−e−t e5t e−t 2e5t

. We solve Φ(t)~v0 =f~(t), i.e.

−e−t e5t e−t 2e5t

p0(t) q0(t)

= 12e3t

18e2t

, det

−e−t e5t e−t 2e5t

=−3e4t By Cramer’s rule

p0(t) = det

12e3t e5t 18e2t 2e5t

−3e4t =−8e4t+ 6e3t ∴p(t) =−2e4t+ 2e3t

(7)

Nonhomogeneous Vector DE

Next,

q0(t) = det

−e−t 12e3t e−t 18e2t

−3e4t = 6e−3t+ 4e−2t

∴q(t) =−2e−3t−2e−2t From the calculations, we obtain

X~(t) = Φ(t) p(t)

q(t)

=

−4e2t

−2e2t−6e3t

as a particular solution to the vector DE.

(8)

Nonhomogeneous Vector DE

Example

Find a particular solution of ~x0 =

3 2

−2 −1

~x+ −3et

6tet

. Sol.

(9)

Exercise

EX.Find a particular solution to the vector DE~x0 =

2 −1

−1 2

~x+ 0

4et

. Sol.

(10)

Table of Contents

1 Nonhomogeneous Vector DE

2 Dynamical Systems

(11)

Autonomous Systems

We have developed theory to solve linear systems d

dt~x(t) =A~x(t) +~f(t)

explicitly, where Ais a constant matrix. This is impossible to do when Ais non-constant, or the system is nonlinear.

1 qualitative technique

2 numerical technique

We discuss qualitative technique for the system of 2 functions.

Consider the finding of x(t),y(t) satisfying d

dtx =F(x,y,t), d

dty =G(x,y,t).

(12)

Autonomous Systems

Definition

IfF,G does not depend explicitly on t, i.e.

d

dtx =F(x,y), d

dty =G(x,y), the system is called an autonomous system.

Otherwise, it is called non-autonomous.

1 x(t),y(t) are velocities of two particles.

2 (x(t),y(t)) are moving in the phase plane, i.e. thexy-plane.

3 The curve of (x(t),y(t)) for allt is called thetrajectory.

4 All trajectories (varying initial conditions) form thephase portrait.

(13)

Autonomous Systems

(14)

Equilibriums

Definition

For an autonomous dynamical system d

dtx =F(x,y), d

dty =G(x,y), an equilibrium point is a point (x0,y0) such that

F(x0,y0) = 0, G(x0,y0) = 0.

If (x0,y0) is an equilibrium point, then

x(t) =x0, y(t) =y0

is a solution called an equilibrium solution.

(15)

Equilibriums

Example

Find all equilibrium points of the dynamical system x0=x(y−1), y0 =y(x+ 1).

Sol.

(16)

Equilibriums

Example

Find all equilibrium points of the dynamical system x0 =x(2x+y), y0=y(x−2y+ 4).

Sol.

(17)

Exercise

EX.Find all equilibrium points of the dynamical system x0 =x(x2+y2−1), y0 = 2y(xy −1).

Sol.

(18)

Classifications of Equilibrium Points

Consider a linear system d

dtx=ax+by, d

dty =cx+dy. Taking ~x(t) =

x(t) y(t)

, the linear system can be written as d

dt~x =A~x, A= a b

c d

. We assume throughout that

detA6= 0.

Theorem

(x0,y0) = (0,0)is the only equilibrium point of the system.

Two eigenvalues λ1, λ2 of A are non-zero.

(19)

Stability of Equilibrium Point

Definition

For a linear system, an equilibrium point (x0,y0) is said to be

1 stableif every solution stays bounded as t → ∞.

2 unstable if it is not stable.

3 asymptotically stable if every solution converges to (x0,y0) as t → ∞. The equilibrium in this case is called anattractor.

1 If all eigenvaluesλj <0, or Reλj <0, then asymptotically stable.

2 If one eigenvalueλj >0 or Reλj >0, then unstable.

3 If all eigenvaluesλj ≤0 or Reλj ≤0, then stable.

(20)

Classifications of Equilibrium Points

There are 3 cases for λ1, λ2:

1 Distinct real eigenvalues

Eigenvectors ~v1, ~v2 and fundamental solutions

~

x1(t) =eλ1t~v1, ~x2(t) =eλ2t~v2.

2 Complex Eigenvalues a±bi

Complex Eigenvector ~v =~u+iw~ and fundamental solutions

~x1(t) =eat(cosbtu~−sinbtw~), ~x2(t) =eat(sinbtu~+ cosbtw~).

3 Repeated Eigenvaluesλ12.

(21)

Distinct Real Eigenvalues

General solution is

~

x(t) =C1eλ1t~v1+C2eλ2t~v2. If~x(0) is parallel to ~vj (C2= 0 or C1= 0) then

~

x(t) =Cjeλjt~vj. For λj >0, trajectory is pointing away from (0,0),

(22)

Distinct Real Eigenvalues

For λj <0, trajectory pointing towards (0,0),

(23)

Stable Node

Theorem (Stable Node) Ifλ2 < λ1 <0 then

1 For t small,~x(t)k~v2(t)

2 For t large,~x(t)k~v1(t)

3 lim

t→∞~x(t) = 0

0

So the trajectory starts parallel to ~v2 but eventually parallel to~v1 and approaches (0,0)at t =∞.

The equlibrium point (0,0)is called astable node. It is asymptotically stable.

(24)

Stable Node

(25)

Unstable Node

Theorem (Unstable Node) If0< λ1 < λ2

1 For t small,~x(t)k~v1(t)

2 For t large,~x(t)k~v2(t)

3 lim

t→∞~x(t) unbounded

4 lim

t→−∞~x(t) = 0

0

So the trajectory starts parallel to ~v1 but eventually parallel to~v2 and unbounded at t =∞.

The equlibrium point (0,0)is called an unstable node.

(26)

Saddle Point

Theorem (Saddle Point) Ifλ2 <0< λ1 then

1 For t small,~x(t)k~v2

2 For t large,~x(t)k~v1

3 lim

t→∞~x(t) unbounded

4 lim

t→−∞~x(t) unbounded

The equlibrium point (0,0)is called asaddle point. It is unstable.

(27)

Saddle Point

(28)

Complex Eigenvalues

Next, assume the eigenvalues are

λ1,2=a±ib (b 6= 0).

Then

~

x(t) =C1~x1(t) +C2~x2(t)

=eat(C1(cosbt~u−sinbtw~) +C2(sinbt~u+ cosbtw~)

=eatP~(t).

Observe that

P~

t+2π b

=P(t).~

(29)

Center

Theorem (Center)

Ifλ1,2=±ib (a pure imaginary, i.e. a= 0) then~x(t) =P~(t) is periodic.

So the trajectory is a closed curve.

The equilibrium (0,0)is called acenter. It is stable.

(30)

Spiral Point

Theorem

Ifλ1,2=a±bi where a6= 0,b6= 0 then

1 a<0, the trajectory spiral towards (0,0). So (0,0)is called a stable spiral point. It is asymptotically stable.

2 a>0, the trajectory spiral away from (0,0)and unbounded at t =∞. So (0,0)is called an unstable spiral point.

(31)

Repeated Eigenvalues

For the repeated eigenvalues case, there are two subcases

1 A=kI (k 6= 0). Then λ12=k and we can choose eigenvectors

~ v1 =

1 0

, ~v2= 0

1

.

Then the solution

~

x(t) =ekt(C1~v1+C2~v2).

~x(t)k(C1~v1+C2~v2). Since C1~v1+C2~v2 spans all 2-vectors, the phase portrait contains all straight lines passing through (0,0).

2 Ais not a multiple of I. In this case, we need a generalized eigenvector.

(32)

Proper Node

Theorem

If A=kI (k 6= 0) then

1 If k >0 the trajectory is pointing away from(0,0). So(0,0)is called an unstable proper node.

2 If k <0 the trajectory is pointing towards(0,0). So (0,0)is called a stable proper node. It is asymptotically stable.

(33)

Degenerate Node

Finally, assume Ais not a multiple of I. Let V~ be a generalized eigenvector andV~(1) = (A−λI)V~.

General solution

~x(t) =eλt(C1V~(1)+C2(V~ +tV~(1))) Theorem

Then

1 For t small,~x(t)kV~(1)

2 For t large,~x(t)kV~(1).

Ifλ <0, the equilibrium(0,0)is called astable degenerate node. It is asymptotically stable.

Ifλ >0, the equilibrium(0,0)is called an unstable degenerate node.

(34)

Degenerate Node

(35)

Some Examples

Example

Characterize the equilibrium point for the system ~x0 = 1 3

1 −3

and sketch the phase portrait.

Sol.

(36)

Some Examples

Example

Characterize the equilibrium point for the system ~x0 =

0 2

−2 0

and sketch the phase portrait.

Sol.

(37)

Some Examples

Example

Characterize the equilibrium point for the system ~x0 = 1 0

3 1

and sketch the phase portrait.

Sol.

(38)

Exercise

EX.Characterize the equilibrium point for the system ~x0=

2 3

−1 2

and sketch the phase portrait.

Sol.

(39)

Exercise

EX.Characterize the equilibrium point for the system ~x0=

1 1

−9 −5

and sketch the phase portrait.

Sol.

(40)

More Examples

Example

(Fin 2017) Consider the initial value problem ~x0 =

α 1

−1 α

~x

1 Find eigenvalues and eigenvectors in terms of α. Also, write the general real value solutions.

2 Give the condition on α so that the equilibrium (0,0) is stable.

Sol.

(41)

More Examples

Example

(Fin 2017) Consider the system of linear equation~x0 =

−1 0

2 −1

~x+ 1

2

1 Find the equilibrium point ~x0 and determine its stability (asymptotically stable, stable, or unstable).

2 Find the general solution and sketch some trajectories in the phase plane.

Sol.

Referensi

Dokumen terkait

The conformability condition for multiplication is that the column dimension of A (the lead matrix) must be equal to the row dimension of B ( the lag matrix).. If defined the

However, rectangular arrays of numbers occur in other contexts as well. For example, the following rectangular array with three rows and seven columns might describe the number

2.B Bases 39 Exercises 2.B 43 2.C Dimension 44 Exercises 2.C 48 3 Linear Maps 51 3.A The Vector Space of Linear Maps 52 Definition and Examples of Linear Maps 52 Algebraic Operations

Trivial solution x = 0 of the system 2 is called exponential stable with respect to qt fort →+∞, if for any solution xt≡xt;t0, x0 of this system in some area t0 ≤t... Aldazharova

♦ Click on the ad to read more Click on the ad to read more Click on the ad to read more Click on the ad to read more Click on the ad to read more Click on the ad to read more Click on

Give an example of a matrix or class of matrices for which the column space CA is orthogonal to the null space NA you may identify isomorphic vector

SOR iterative method for the linear rational finite difference solution of second- order Fredholm integro-differential equations ABSTRACT In this paper, a new three-point linear

List of the Abbreviations 3FSLRFD Three-point full-sweep linear rational finite difference 3LRFD Three-point linear rational finite difference 3HSLRFD Three-point half-sweep linear