Lecture Notes in Differential Equations - Bruce E. Shapiro
Lecture Notes in Differential Equations - Bruce E. Shapiro Lecture Notes in Differential Equations - Bruce E. Shapiro
310 LESSON 31. LINEAR SYSTEMS Example 31.2. Solve the system ( y ′ 6 = Ay where y(0) = 5) and From theorem 31.4 y = e A(t−t0) y 0 = A = ( ) 1 1 4 −2 { [( 1 1 exp 4 −2 ) ]} ( 6 t 5 ) (31.65) (31.66) (31.67) The problem now is that we don’t know how to calculate the matrix exponential! We will continue this example after we have discussed some of its properties. Theorem 31.5. Properties of the Matrix Exponential. 1. If 0 is a square n × n matrix composed entirely of zeros, then e 0 = I (31.68) 2. If A and B are square n×n matrices that commute (i.e., if AB = BA), then e A+B = e A e B (31.69) 3. e A is invertible, and ( e A ) −1 = e −A (31.70) 4. If A is any n × n matrix and S is any non-singular n × n matrix, then S −1 e A S = exp ( S −1 AS ) (31.71) 5. Let D = diag(x 1 , ..., x n ) be a diagonal matrix. Then e D = diag(e x1 , ..., e xn ). (31.72) 6. If S −1 AS = D, where D is a diagonal matrix, then e A = Se D S −1 . 7. If A has n linearly independent eigenvectors x 1 , ..., x n with corresponding eigenvalues λ 1 , ..., λ n , then e A = UEU −1 , where U = (x 1 , ..., x n ) and E = diag ( e λ1 , ..., e λn ) . 8. The matrix exponential is differentiable and d dt eAt = Ae At .
311 The Jordan Form Let A be a square n × n matrix. A is diagonalizable if for some matrix U, U −1 AU = D is diagonal. A is diagonalizable if and only if it has n linearly independent eigenvectors v 1 , ..., v n , in which case U = ( v 1 · · · v n ) will diagonalize A. If λ 1 , ..., λ k are the eigenvalues of A with multiplicities m 1 , ..., m k (hence n = m 1 + · · · + m k ) then the Jordan Canonical Form of A is ⎛ ⎞ B 1 0 · · · 0 J = 0 B 2 . ⎜ ⎝ . ⎟ . .. 0 ⎠ 0 · · · 0 B k (31.73) where (a) if m i = 1, B i = λ i (a scalar or 1 × 1 matrix; and (b) if m i ≠ 1, B i is an m i ×m i submatrix with λ i repeated in every diagonal element, the number 1 in the supra-diagonal, and zeroes everywhere else, e.g., if m i = 3 then ⎛ λ i 1 0 ⎞ 0 0 λ i B i = ⎝ 0 λ i 1 ⎠ (31.74) The B i are called Jordan Blocks. For every square matrix A, there exists a matrix U such J = U −1 AU exists. If J is the Jordan form of a matrix, then Thus e A = Ue J U −1 . ⎛ ⎞ e B1 0 0 e J ⎜ = ⎝ . 0 .. ⎟ 0 ⎠ (31.75) 0 0 e B k Example 31.3. Evaluate the solution y = e A(t−t0) y 0 = { [( 1 1 exp 4 −2 ) ]} ( 6 t 5 ) (31.76) found in the previous example.
- Page 267 and 268: 259 Since the first two terms (corr
- Page 269 and 270: 261 Hence ∞∑ ∞∑ ∞∑ 0 =
- Page 271 and 272: 263 has an analytic solution at t =
- Page 273 and 274: 265 By the triangle inequality, |(k
- Page 275 and 276: 267 Table 28.1: Table of Special Fu
- Page 277 and 278: 269 Thus y = a 0 ( 1 + 1 6 t3 + 1 +
- Page 279 and 280: 271 into (28.114) and collect terms
- Page 281 and 282: 273 Summary of Power series method.
- Page 283 and 284: Lesson 29 Regular Singularities The
- Page 285 and 286: 277 ∑ ∞ ∞∑ ∞∑ 0 = t 2 a
- Page 287 and 288: 279 Case 2: Two equal real roots. S
- Page 289 and 290: 281 Example 29.6. Solve t 2 y ′
- Page 291 and 292: Lesson 30 The Method of Frobenius I
- Page 293 and 294: 285 This is a homogeneous linear eq
- Page 295 and 296: 287 Example 30.4. Find a Frobenius
- Page 297 and 298: 289 Thus a Frobenius solution is y
- Page 299 and 300: 291 Example 30.6. Find the form of
- Page 301 and 302: 293 term by term to (30.97). Starti
- Page 303 and 304: 295 Let j = n − k. Then |n − 1
- Page 305 and 306: 297 is a solution of (t − t 0 ) 2
- Page 307 and 308: 299 Evaluation of the integral depe
- Page 309 and 310: 301 Example 30.8. In example 30.4 w
- Page 311 and 312: Lesson 31 Linear Systems The genera
- Page 313 and 314: 305 is where λ 2 − T λ + ∆ =
- Page 315 and 316: 307 (b) If λ 1 ≠ λ 2 ∈ R, i.e
- Page 317: 309 We will verify (31.54) by induc
- Page 321 and 322: 313 y = 1 [( ) ( ) ] ( ) 4 1 e 2t 1
- Page 323 and 324: 315 Theorem 31.8. (Abel’s Formula
- Page 325 and 326: 317 By a similar argument, the seco
- Page 327 and 328: 319 we can replace (31.118) with a
- Page 329 and 330: 321 Corollary 31.12. The generalize
- Page 331 and 332: 323 where (A − λI)w 2 = w 1 , i.
- Page 333 and 334: 325 so that λ = 3, −5. The eigen
- Page 335 and 336: 327 Non-constant Coefficients We ca
- Page 337 and 338: 329 we find that ∫ M(t)g(t)dt = (
- Page 339 and 340: Lesson 32 The Laplace Transform Bas
- Page 341 and 342: 333 Figure 32.1: A piecewise contin
- Page 343 and 344: 335 Example 32.4. From integral A.1
- Page 345 and 346: 337 apply this result iteratively.
- Page 347 and 348: L [ t x−1] [ ] 1 d = L x dt tx =
- Page 349 and 350: 341 Equating numerators and expandi
- Page 351 and 352: 343 Derivatives of the Laplace Tran
- Page 353 and 354: 345 can be written as as illustrate
- Page 355 and 356: 347 Translations in the Laplace Var
- Page 357 and 358: 349 Summary of Translation Formulas
- Page 359 and 360: 351 The inverse transform is [ ] f(
- Page 361 and 362: 353 Example 32.18. Find the Laplace
- Page 363 and 364: 355 Similarly, we can express a uni
- Page 365 and 366: 357 Figure 32.7: Solution of exampl
- Page 367 and 368: Lesson 33 Numerical Methods Euler
310 LESSON 31. LINEAR SYSTEMS<br />
Example 31.2. Solve the system<br />
(<br />
y ′ 6<br />
= Ay where y(0) =<br />
5)<br />
and<br />
From theorem 31.4<br />
y = e A(t−t0) y 0 =<br />
A =<br />
( ) 1 1<br />
4 −2<br />
{ [( 1 1<br />
exp<br />
4 −2<br />
) ]} ( 6<br />
t<br />
5<br />
)<br />
(31.65)<br />
(31.66)<br />
(31.67)<br />
The problem now is that we don’t know how to calculate the matrix exponential!<br />
We will cont<strong>in</strong>ue this example after we have discussed some of its<br />
properties.<br />
Theorem 31.5. Properties of the Matrix Exponential.<br />
1. If 0 is a square n × n matrix composed entirely of zeros, then<br />
e 0 = I (31.68)<br />
2. If A and B are square n×n matrices that commute (i.e., if AB = BA),<br />
then<br />
e A+B = e A e B (31.69)<br />
3. e A is <strong>in</strong>vertible, and<br />
(<br />
e<br />
A ) −1<br />
= e<br />
−A<br />
(31.70)<br />
4. If A is any n × n matrix and S is any non-s<strong>in</strong>gular n × n matrix, then<br />
S −1 e A S = exp ( S −1 AS ) (31.71)<br />
5. Let D = diag(x 1 , ..., x n ) be a diagonal matrix. Then<br />
e D = diag(e x1 , ..., e xn ). (31.72)<br />
6. If S −1 AS = D, where D is a diagonal matrix, then e A = Se D S −1 .<br />
7. If A has n l<strong>in</strong>early <strong>in</strong>dependent eigenvectors x 1 , ..., x n with correspond<strong>in</strong>g<br />
eigenvalues λ 1 , ..., λ n , then e A = UEU −1 , where U =<br />
(x 1 , ..., x n ) and E = diag ( e λ1 , ..., e λn )<br />
.<br />
8. The matrix exponential is differentiable and d dt eAt = Ae At .