Advanced Eng. Math HW4 - Eigenvalues, Eigenvectors, Diagonalization, Stochastic Matrices, Assignments of Mathematics

The instructions and problems for homework 4 of math 348 - advanced engineering mathematics, focusing on topics such as eigenvalues, eigenvectors, diagonalization, spectral decomposition, and applications. Additionally, it introduces the concept of stochastic matrices and their relation to markov chains.

Typology: Assignments

Pre 2010

Uploaded on 08/18/2009

koofers-user-s6f
koofers-user-s6f 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MATH 348 - Advanced Engineering Mathematics June 25, 2009
Homework 4, Summer 2009 Due: June 30 , 2009
Eigenvalues - Eigenvectors - Diagionalization - Spectral Decomposition - Applications
1. Find the eigenvalues and eigenvectors of the following matrix.
A=
401
210
201
2. Given,
A="3 1
2 1 #.
Determine the eigenvalues and eigenfunctions associated with the system of differential equations dx
dt =A·x(t).
3. Given,
A=
4000
0400
0020
1002
.
If Ais diagonalizable, then determine Dand Passociated with its decomposition PDP1. Do not find P1.
4. Square matrices having columns whose entries sum to 1 are often called stochastic matrices. Those with only non-negative
entries, for some power, are called regular stochastic matrices. Given a random process, with an initial state x0, the
application of Pon x0discretely steps the process forward in time. That is xn+1 =Pxn=Pnx0, n = 1,2,3, . . . . If a
matrix is a regular stochastic matrix then there exists a steady-state vector qsuch that Pq=q. This vector determines the
long term probabilities associated with an arbitrary inital state x0. The sequence of states, {x0,x1,x2,...,xn+1}, is called
aMarkov Chain. Given the regular stochastic matrix:
P=".1.6
.9.4#.
(a) Show that the steady-state vector of Pis q=2
5
3
5t
.
(b) Find the matrices Dand Qsuch that P=QDQ1. That is, diagonalize the matrix P.
(c) Show that lim
n→∞
Pnx0=qwhere x0= [x1, x2]tis an arbitrary vector in R2such that x1+x2= 1.
5. Recall the Pauli Spin Matrix from homework 1,
σ2=σy="0i
i0#.
(a) Show that σyis self-adjoint. 1
(b) Find the orthogonal diagonalization of σy.2
(c) Show that σy=λ1x1xh
1+λ2x2xh
2, where x1and x2are the normalized eigenvectors from part (b).
1Recall that self-adjoint means that A=Ah=¯
At. See the linear algebra handout on ticc.mines.edu for the definitions.
2This will require you to normalize vectors that contain imaginary numbers. Generally to normalize a vector xwe makea new vector ˆ
x=x
|x|=x
xtx.
However, when using vectors with imaginary entries we must use the adjoint in our definition of inner-product. That is, we take a normalized vector
to be, ˆ
x=x
|x|=x
xhx. If you do not do this then then your inner-products will become zero and your normalized vectors will be undefined, which I
guess they should be in real-space.
1

Partial preview of the text

Download Advanced Eng. Math HW4 - Eigenvalues, Eigenvectors, Diagonalization, Stochastic Matrices and more Assignments Mathematics in PDF only on Docsity!

MATH 348 - Advanced Engineering Mathematics June 25, 2009

Homework 4, Summer 2009 Due: June 30 , 2009

Eigenvalues - Eigenvectors - Diagionalization - Spectral Decomposition - Applications

  1. Find the eigenvalues and eigenvectors of the following matrix.

A =

  1. Given,

A =

[

]

Determine the eigenvalues and eigenfunctions associated with the system of differential equations

dx dt

= A · x(t).

  1. Given,

A =

If A is diagonalizable, then determine D and P associated with its decomposition PDP

− 1

. Do not find P − 1 .

  1. Square matrices having columns whose entries sum to 1 are often called stochastic matrices. Those with only non-negative

entries, for some power, are called regular stochastic matrices. Given a random process, with an initial state x 0 , the

application of P on x 0 discretely steps the process forward in time. That is xn+1 = Pxn = P

n x 0 , n = 1, 2 , 3 ,.... If a

matrix is a regular stochastic matrix then there exists a steady-state vector q such that Pq=q. This vector determines the

long term probabilities associated with an arbitrary inital state x 0. The sequence of states, {x 0 , x 1 , x 2 ,... , xn+1}, is called

a Markov Chain. Given the regular stochastic matrix:

P =

[

]

(a) Show that the steady-state vector of P is q =

[

]t

(b) Find the matrices D and Q such that P= QDQ

− 1

. That is, diagonalize the matrix P.

(c) Show that lim n→∞

P

n x 0 = q where x 0 = [x 1 , x 2 ]

t is an arbitrary vector in R

2 such that x 1 + x 2 = 1.

  1. Recall the Pauli Spin Matrix from homework 1,

σ 2 = σy =

[

0 −i

i 0

]

(a) Show that σy is self-adjoint.

1

(b) Find the orthogonal diagonalization of σy. 2

(c) Show that σy = λ 1 x 1 x

h 1 +^ λ^2 x^2 x

h 2 , where^ x^1 and^ x^2 are the normalized eigenvectors from part (b).

1 Recall that self-adjoint means that A = A h = A¯

t

. See the linear algebra handout on ticc.mines.edu for the definitions.

2 This will require you to normalize vectors that contain imaginary numbers. Generally to normalize a vector x we make a new vector ˆx =

x

|x|

=

x √ xtx

.

However, when using vectors with imaginary entries we must use the adjoint in our definition of inner-product. That is, we take a normalized vector

to be, ˆx =

x

|x|

=

x √ x h x

. If you do not do this then then your inner-products will become zero and your normalized vectors will be undefined, which I

guess they should be in real-space.