Skip to content Skip to navigation

Connexions

You are here: Home » Content » The Eigenvalue Problem: Examples

Navigation

Recently Viewed

This feature requires Javascript to be enabled.

The Eigenvalue Problem: Examples

Module by: Steven J. Cox. E-mail the author

User rating (How does the rating system work?)
Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

:
(0 ratings)

Summary: (Blank Abstract)

Note: Your browser may not currently support MathML. See our browser support page for additional details. You can always view the correct math in the PDF version.

We take a look back at our previous examples in light of the results of two previous sections The Spectral Representation and The Partial Fraction Expansion of the Transfer Function. With respect to the rotation matrix B= 01-10 B 01 -10 we recall, see Cauchy's Theorem eqn6, that Rs=1s2+1s1-1s Rs 1 s 2 1 s1 -1s

Rs=1s1/2-221/2+1s+1/22-21/2 Rs 1 s 12 2 2 12 1 s 12 2 2 12 (1)
Rs=1s λ1 P1 +1s λ2 P2 Rs 1 s λ1 P1 1 s λ2 P2 and so B= λ1 P1 + λ2 P2 =1/2-221/2+-1/22-21/2 B λ1 P1 λ2 P2 12 2 2 12 12 2 2 12 From m1 = m2 =1 m1 m2 1 it follows that P1 P1 and P2 P2 are actual (as opposed to generalized) eigenspaces. These column spaces are easily determined. In particular, P1 P1 is the span of e1 =1 e1 1 while P2 P2 is the span of e2 =1- e2 1 To recapitulate, from partial fraction expansion one can read off the projections from which one can read off the eigenvectors. The reverse direction, producing projections from eigenvectors, is equally worthwhile. We laid the groundwork for this step in the discussion of Least Squares. In particular, this Least Squares projection equation stipulates that P1 = e1 e1 T e1 -1 e1 T   and   P2 = e2 e2 T e2 -1 e2 T P1 e1 e1 e1 e1   and   P2 e2 e2 e2 e2 As e1 T e1 = e1 T e1 =0 e1 e1 e1 e1 0 these formulas can not possibly be correct. Returning to the Least Squares discussion we realize that it was, perhaps implicitly, assumed that all quantities were real. At root is the notion of the length of a complex vector. It is not the square root of the sum of squares of its components but rather the square root of the sum of squares of the magnitudes of its components. That is, recalling that the magnitude of a complex quantity zz is zz¯ z z , e1 2 e1 T e1   rather   e1 2 e1 ¯T e1 e1 2 e1 e1   rather   e1 2 e1 e1 Yes, we have had this discussion before, recall complex numbers, vectors, and matrices. The upshot of all of this is that, when dealing with complex vectors and matrices, one should conjugate before every transpose. Matlab (of course) does this automatically, i.e., the ' symbol conjugates and transposes simultaneously. We use xH x to denote `conjugate transpose', i.e., xHx¯T x x All this suggests that the desired projections are more likely
P1 = e1 e1 H e1 -1 e1 H   and   P2 = e2 e2 H e2 -1 e2 H P1 e1 e1 e1 e1   and   P2 e2 e2 e2 e2 (2)
Please check that Equation 2 indeed jives with Equation 1.

Content actions

Give Feedback:

E-mail the module author | Rate module ( How does the rating system work?)

Rating system

Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

(0 ratings)

Download:

Add module to:

My Favorites (?)

'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.

| A lens (?)

Definition of a lens

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

What are tags? tag icon

Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

| External bookmarks