12 views

Uploaded by Daniel Menéndez Crespo

Eigenvectors diagonalization

save

- affine similarity metric rectification with c codes
- Sensitivity Analysis A Multiconductor Transmission Line
- 6 4 matrix factorisation and decomposition
- FP3 P6 January 2006 Mark Scheme
- A g 4301181184
- ch11
- A Classification of Integrable Hydrodynamic Type Chains Using the Haantjes Tensor
- Worksheet 4 So Ls
- 1718
- statika-noteeng (1)
- c08s5
- Exercise 1 2018
- Symmetric Matrices
- Lit Vm Ijnme01
- ch4lamod
- 1441998861Projection.pdf
- 1207.6328
- 03 Thesis Debdeep
- Papadrakakis - Dynamic Relaxation
- 10mse1077-72review3
- engdynamics2011.0v1.pdf
- Eff Res Mtns06
- quickref-linalg
- matrixintr
- 0105
- ma1101 -maths1
- chapter4--phpapp02
- ContinuumMechanicsV1-7
- Cyclic Reduction
- Solid Mechanics-10.pdf
- archivo_724_16609
- equivalencia_idiomas
- gantt diagram
- charge btdmttf tcnq
- IELTS Information for Candidates 2014
- Quantum
- Spectroscopy
- cuantica
- Lectures on Physics - Richard Feynman.pdf
- Template

You are on page 1of 34

Stephen Boyd

Lecture 11

Eigenvectors and diagonalization

• eigenvectors

• dynamic interpretation: invariant sets

• complex eigenvectors & invariant planes

• left eigenvectors

• diagonalization

• modal form

• discrete-time stability

11–1

**Eigenvectors and eigenvalues
**

λ ∈ C is an eigenvalue of A ∈ Cn×n if

X (λ) = det(λI − A) = 0

equivalent to:

• there exists nonzero v ∈ Cn s.t. (λI − A)v = 0, i.e.,

Av = λv

any such v is called an eigenvector of A (associated with eigenvalue λ)

• there exists nonzero w ∈ Cn s.t. wT (λI − A) = 0, i.e.,

wT A = λwT

any such w is called a left eigenvector of A

Eigenvectors and diagonalization

11–2

**• if v is an eigenvector of A with eigenvalue λ, then so is αv, for any
**

α ∈ C, α 6= 0

• even when A is real, eigenvalue λ and eigenvector v can be complex

• when A and λ are real, we can always find a real eigenvector v

associated with λ: if Av = λv, with A ∈ Rn×n, λ ∈ R, and v ∈ Cn,

then

Aℜv = λℜv,

Aℑv = λℑv

so ℜv and ℑv are real eigenvectors, if they are nonzero

(and at least one is)

• conjugate symmetry : if A is real and v ∈ Cn is an eigenvector

associated with λ ∈ C, then v is an eigenvector associated with λ:

taking conjugate of Av = λv we get Av = λv, so

Av = λv

we’ll assume A is real from now on . . .

Eigenvectors and diagonalization

11–3

we’ll consider λ ∈ C later) if v is an eigenvector.Scaling interpretation (assume λ ∈ R for now. effect of A on v is very simple: scaling by λ Ax v x Av (what is λ here?) Eigenvectors and diagonalization 11–4 .

) Eigenvectors and diagonalization 11–5 . |λ| > 1: Av larger than v (we’ll see later how this relates to stability of continuous.and discrete-time systems. . |λ| < 1: Av smaller than v • λ ∈ R.• λ ∈ R. λ < 0: v and Av point in opposite directions • λ ∈ R. λ > 0: v and Av point in same direction • λ ∈ R. .

then x(t) = eλtv several ways to see this.. v 6= 0 if x˙ = Ax and x(0) = v.Dynamic interpretation suppose Av = λv. e. x(t) = etAv = 2 I + tA + (tA) + ··· v 2! (λt)2 v + ··· = v + λtv + 2! = eλtv (since (tA)k v = (λt)k v) Eigenvectors and diagonalization 11–6 .g.

λ > 0. resulting motion is very simple — always on the line spanned by v • solution x(t) = eλtv is called mode of system x˙ = Ax (associated with eigenvalue λ) • for λ ∈ R. assume λ∈R • if initial state is an eigenvector v. solution is complex (we’ll interpret later). for now. mode contracts or shrinks as t ↑ • for λ ∈ R.• for λ ∈ C. mode expands or grows as t ↑ Eigenvectors and diagonalization 11–7 . λ < 0.

: once trajectory enters S. never out Eigenvectors and diagonalization 11–8 . then x(τ ) ∈ S for all τ ≥ t i. it stays in S trajectory S vector field interpretation: trajectories only cut into S.Invariant sets a set S ⊆ Rn is invariant under x˙ = Ax if whenever x(t) ∈ S.e.

v 6= 0.suppose Av = λv. λ ∈ R • line { tv | t ∈ R } is invariant (in fact. ray { tv | t > 0 } is invariant) • if λ < 0. line segment { tv | 0 ≤ t ≤ a } is invariant Eigenvectors and diagonalization 11–9 .

λ = σ + iω. λ is complex for a ∈ C.Complex eigenvectors suppose Av = λv. v 6= 0. a = α + iβ • trajectory stays in invariant plane span{vre. vim} • σ gives logarithmic growth/decay factor • ω gives angular velocity of rotation in plane Eigenvectors and diagonalization 11–10 . (complex) trajectory aeλtv satisfies x˙ = Ax hence so does (real) trajectory λt x(t) = ℜ ae v = e σt vre vim cos ωt sin ωt − sin ωt cos ωt α −β where v = vre + ivim.

. wT x is simple • if.e. λ ∈ R. halfspace { z | wT z ≤ a } is invariant (for a ≥ 0) • for λ = σ + iω ∈ C.Dynamic interpretation: left eigenvectors suppose wT A = λwT .g. λ < 0. wT x satisfies the DE d(wT x)/dt = λ(wT x) hence wT x(t) = eλtwT x(0) • even if trajectory x is complicated. w 6= 0 then d T (w x) = wT x˙ = wT Ax = λ(wT x) dt i.. (ℜw)T x and (ℑw)T x both have form eσt (α cos(ωt) + β sin(ωt)) Eigenvectors and diagonalization 11–11 . e.

for any initial condition Eigenvectors and diagonalization 11–12 .Summary • right eigenvectors are initial conditions from which resulting motion is simple (i.. remains on line or in plane) • left eigenvectors give linear functions of state that are simple.e.

± i 10 Eigenvectors and diagonalization 11–13 . −1 −10 −10 0 0 x example 1: x˙ = 1 0 1 0 block diagram: 1/s x1 −1 1/s x2 −10 1/s x3 −10 X (s) = s3 + s2 + 10s + 10 = (s + 1)(s2 + 10) √ eigenvalues are −1.

5 0 −0.5 −1 0 x3 1 0.5 5 x2 0.5 0 −0.5 4 4.5 t 3 3.5 2 2.5 4 4.5 1 1.5 5 0.5 2 2.5 t 3 3.5 1 1.5 t 3 3. 1): x1 2 1 0 −1 0 0.5 1 1.5 0 Eigenvectors and diagonalization 11–14 .trajectory with x(0) = (0. −1.5 5 0.5 2 2.5 4 4.

1 0 0 0. −1.5 0.3 0. 1) (as above): 1 0.7 gT x 0.8 0.2 0.4 0.5 1 1.left eigenvector associated with eigenvalue −1 is 0.5 2 2.1 g= 0 1 let’s check g T x(t) when x(0) = (0.5 4 4.6 0.5 3 3.5 5 t Eigenvectors and diagonalization 11–15 .9 0.

175 −0.175 0.554 + i0.077 11–16 .554 vre = 0.055 Eigenvectors and diagonalization vim 0.√ eigenvector associated with eigenvalue i 10 is −0.055 − i0.077 so an invariant plane is spanned by −0.771 v = 0. 0.244 + i0.771 = 0.244 .

5 1 1.5 5 0.5 2 2.1 0 −0.5 4 4.5 t 3 3.5 0 x3 0.5 2 2.5 0 −0.1 0 Eigenvectors and diagonalization 11–17 .5 2 2.5 5 x2 0.5 1 1.5 t 3 3.5 1 1.5 4 4.5 5 0.5 4 4.5 t 3 3. with x(0) = vre we have x1 1 0 −1 0 0.for example.

Example 2: Markov chain probability distribution satisfies p(t + 1) = P p(t) Pn pi(t) = Prob( z(t) = i ) so i=1 pi(t) = 1 Pn Pij = Prob( z(t + 1) = i | z(t) = j ).v. hence we can n normalize v so that i=1 vi = 1 interpretation: v is an equilibrium distribution. i. [1 1 · · · 1] is a left eigenvector of P with e. 1 hence det(I − P ) = 0.e.e.. if p(0) = v then p(t) = v for all t ≥ 0 (if v is unique it is called the steady-state distribution of the Markov chain) Eigenvectors and diagonalization 11–18 . so there is a right eigenvector v 6= 0 with P v = v it can be shown thatPv can be chosen so that vi ≥ 0. so i=1 Pij = 1 (such matrices are called stochastic) rewrite as: [1 1 · · · 1]P = [1 1 · · · 1] i..

. . . v1 · · · vn = v1 · · · vn and Λ = diag(λ1. . . i = 1.. .. .Diagonalization suppose v1. . . . λn). . vn is a linearly independent set of eigenvectors of A ∈ Rn×n: Avi = λivi. so v1 · · · vn λn AT = T Λ and finally T −1AT = Λ Eigenvectors and diagonalization 11–19 . . n express as A define T = λ1 .

. . . i. . n so v1. . T −1AT = Λ = diag(λ1. . . . T −1AT = Λ is diagonal • A has a set of n linearly independent eigenvectors (if A is not diagonalizable. vn linearly independent • similarity transformation by T diagonalizes A conversely if there is a T = [v1 · · · vn] s. . ..• T invertible since v1. . . vn is a linearly independent set of n eigenvectors of A we say A is diagonalizable if • there exists T s. it is sometimes called defective) Eigenvectors and diagonalization 11–20 .t. λn) then AT = T Λ. . i = 1. .e. .t. Avi = λivi. .

e. 0 1 0 0 so all eigenvectors have form v = v1 0 v1 v2 where v1 6= 0 =0 thus.Not all matrices are diagonalizable example: A = 0 1 0 0 characteristic polynomial is X (s) = s2. i. so λ = 0 is only eigenvalue eigenvectors satisfy Av = 0v = 0. A cannot have two independent eigenvectors Eigenvectors and diagonalization 11–21 .

λi 6= λj for i 6= j.Distinct eigenvalues fact: if A has distinct eigenvalues. then A is diagonalizable (the converse is false — A can have repeated eigenvalues but still be diagonalizable) Eigenvectors and diagonalization 11–22 . i.e..

. . or w1T w1T . A = Λ . normalized so that wiT vj = δij (i. indep. the rows of T −1 are (lin.e. .. wnT wnT where w1T . wnT are the rows of T −1 thus wiT A = λiwiT i. left & right eigenvectors chosen this way are dual bases) Eigenvectors and diagonalization 11–23 . .e.Diagonalization and left eigenvectors rewrite T −1AT = Λ as T −1A = ΛT −1. ...) left eigenvectors.

so Tx ˜˙ = AT x ˜ Eigenvectors and diagonalization ⇔ x ˜˙ = T −1AT x ˜ ⇔ x ˜˙ = Λ˜ x 11–24 .Modal form suppose A is diagonalizable by T define new coordinates by x = T x ˜.

e. i. x ˜i(t) = eλitx ˜i(0) hence the name modal form Eigenvectors and diagonalization 11–25 .. system is diagonal (decoupled): 1/s x ˜1 λ1 1/s x ˜n λn trajectories consist of n independent modes.in new coordinate system.

λj = σj + iωj . Mr+1. . . . system can be put in real modal form: S −1AS = diag (Λr . . Mr+3. . and Mj = σj −ωj ωj σj . . r + 3. . Mn−1) where Λr = diag(λ1. .Real modal form when eigenvalues (hence T ) are complex. λr ) are the real eigenvalues. . n where λj are the complex eigenvalues (one from each conjugate pair) Eigenvectors and diagonalization 11–26 . . j = r + 1. . .

block diagram of ‘complex mode’: σ 1/s −ω ω 1/s σ Eigenvectors and diagonalization 11–27 .

e..g. resolvent: (sI − A)−1 = = sT T −1 −1 −1 − T ΛT −1 −1 T (sI − Λ)T = T (sI − Λ)−1T −1 1 1 = T diag ... .. T −1 s − λ1 s − λn powers (i. .. discrete-time solution): A k = = T ΛT T ΛT −1 k −1 = T Λk T −1 · · · T ΛT −1 = T diag(λk1 .diagonalization simplifies many matrix expressions e. λkn)T −1 (for k < 0 only if A invertible. all λi 6= 0) Eigenvectors and diagonalization 11–28 . .. i. ..e.

. eλn )T −1 Eigenvectors and diagonalization 11–29 . . . continuous-time solution): eA = I + A + A2/2! + · · · = I + T ΛT −1 + T ΛT −1 2 /2! + · · · = T (I + Λ + Λ2/2! + · · ·)T −1 = T eΛT −1 = T diag(eλ1 ..e. .exponential (i.

we have f (A) = β0I + β1A + β2A2 + β3A3 + · · · = β0T T −1 + β1T ΛT −1 + β2(T ΛT −1)2 + · · · −1 2 = T β0 I + β1 Λ + β2 Λ + · · · T = T diag(f (λ1). .Analytic function of a matrix for any analytic function f : R → R. .. given by power series f (a) = β0 + β1a + β2a2 + β3a3 + · · · we can define f (A) for A ∈ Rn×n (i. f (λn))T −1 Eigenvectors and diagonalization 11–30 .e. .. .e. overload f ) as f (A) = β0I + β1A + β2A2 + β3A3 + · · · substituting A = T ΛT −1. i.

Solution via diagonalization assume A is diagonalizable consider LDS x˙ = Ax. with T −1AT = Λ then x(t) = etAx(0) = T eΛtT −1x(0) n X = eλit(wiT x(0))vi i=1 thus: any trajectory can be expressed as linear combination of modes Eigenvectors and diagonalization 11–31 .

interpretation: • (left eigenvectors) decompose initial state x(0) into modal components wiT x(0) • eλit term propagates ith mode forward t seconds • reconstruct state as linear combination of (right) eigenvectors Eigenvectors and diagonalization 11–32 .

ℜλs < 0. . . ℜλn ≥ 0 from x(t) = n X eλit(wiT x(0))vi i=1 condition for x(t) → 0 is: x(0) ∈ span{v1. . . . wiT x(0) = 0. .application: for what x(0) do we have x(t) → 0 as t → ∞? divide eigenvalues into those with negative real parts ℜλ1 < 0. and the others. vs}. . . i = s + 1. n (can you prove this?) Eigenvectors and diagonalization 11–33 . . . . or equivalently. . . . ℜλs+1 ≥ 0. . .

so we have fact: x(t + 1) = Ax(t) is stable if and only if all eigenvalues of A have magnitude less than one Eigenvectors and diagonalization 11–34 . we will see later that this is true even when A is not diagonalizable.Stability of discrete-time systems suppose A diagonalizable consider discrete-time LDS x(t + 1) = Ax(t) if A = T ΛT −1. . i = 1. . n. . . then Ak = T Λk T −1 then x(t) = Atx(0) = n X i=1 λti(wiT x(0))vi → 0 as t → ∞ for all x(0) if and only if |λi| < 1.

- affine similarity metric rectification with c codesUploaded bysri
- Sensitivity Analysis A Multiconductor Transmission LineUploaded byMarioTorresCruz
- 6 4 matrix factorisation and decompositionUploaded byapi-195736626
- FP3 P6 January 2006 Mark SchemeUploaded byFitri Azmeer Nordin
- A g 4301181184Uploaded byAnonymous 7VPPkWS8O
- ch11Uploaded byWiwid Murdany
- A Classification of Integrable Hydrodynamic Type Chains Using the Haantjes TensorUploaded byDave Marshall
- Worksheet 4 So LsUploaded byCharlotte
- 1718Uploaded byJorge Luis Garcia Zuñiga
- statika-noteeng (1)Uploaded byRavi Khandelwal
- c08s5Uploaded bysteve4775
- Exercise 1 2018Uploaded byTrungtin Bui Duc
- Symmetric MatricesUploaded byRahul Oorath
- Lit Vm Ijnme01Uploaded byAndrés Mercado
- ch4lamodUploaded bycrazynup
- 1441998861Projection.pdfUploaded byRicardoPedraza
- 1207.6328Uploaded byNikolay Raychev
- 03 Thesis DebdeepUploaded bySiddhartha Kotnana
- Papadrakakis - Dynamic RelaxationUploaded byDina Arzina
- 10mse1077-72review3Uploaded byraanav
- engdynamics2011.0v1.pdfUploaded bysteefff88
- Eff Res Mtns06Uploaded bymayalasan1
- quickref-linalgUploaded bywoodbrent7
- matrixintrUploaded bydiaz1887
- 0105Uploaded byGicu
- ma1101 -maths1Uploaded byvinomalai
- chapter4--phpapp02Uploaded bykhawaldeh jamal
- ContinuumMechanicsV1-7Uploaded byUmair Ismail
- Cyclic ReductionUploaded byPrashant Singh
- Solid Mechanics-10.pdfUploaded bychetan

- archivo_724_16609Uploaded byDaniel Menéndez Crespo
- equivalencia_idiomasUploaded byDaniel Menéndez Crespo
- gantt diagramUploaded byDaniel Menéndez Crespo
- charge btdmttf tcnqUploaded byDaniel Menéndez Crespo
- IELTS Information for Candidates 2014Uploaded byDaniel Menéndez Crespo
- QuantumUploaded byDaniel Menéndez Crespo
- SpectroscopyUploaded byDaniel Menéndez Crespo
- cuanticaUploaded byDaniel Menéndez Crespo
- Lectures on Physics - Richard Feynman.pdfUploaded byDaniel Menéndez Crespo
- TemplateUploaded byDaniel Menéndez Crespo