Example 11.  Find the eigenvalues of the following matrix  A.

Solution 11.

[Graphics:../Images/EigenvaluesMod_gr_357.gif]



[Graphics:../Images/EigenvaluesMod_gr_358.gif]

[Graphics:../Images/EigenvaluesMod_gr_359.gif]

 

 

Which method do we trust ?  
Are the answers on the left better or are the answers on right better ?

We trust Mathematica's Eigenvalue subroutine !   

We should go with the answers on the right.  This is a transition matrix and it is known that one of its eigenvalues is  [Graphics:../Images/EigenvaluesMod_gr_360.gif].   

The eigenvalue-eigenvector methods we study seem overbearing, but they are necessary when [Graphics:../Images/EigenvaluesMod_gr_361.gif].

We could try to envision the difficulties of finding the root of

[Graphics:../Images/EigenvaluesMod_gr_362.gif]


[Graphics:../Images/EigenvaluesMod_gr_363.gif]

[Graphics:../Images/EigenvaluesMod_gr_364.gif]


[Graphics:../Images/EigenvaluesMod_gr_365.gif]

[Graphics:../Images/EigenvaluesMod_gr_366.gif]

 

[Graphics:../Images/EigenvaluesMod_gr_367.gif]

Clearly, there are computational problems in evaluating the Newton-Raphson iteration function.  This is why there are methods for finding eigenvalues that do not rely on finding roots of polynomials.  

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004