next up previous
Next: Conversion to Upper Up: Facts about Eigenvalues Previous: Facts about Eigenvalues

Similarity Transformations

Consider a matrix tex2html_wrap_inline303 with tex2html_wrap_inline395 as an eigenvalue, eigenvector pair. Further, let tex2html_wrap_inline397 be an arbitrary non-singular matrix. Define a new vector tex2html_wrap_inline399 . Then

displaymath391

Therefore, tex2html_wrap_inline401 is an eigenvalue, eigenvector pair of tex2html_wrap_inline403 and tex2html_wrap_inline405 is said to be similar to tex2html_wrap_inline303 . Such transformations are called similarity transformations. Similarity transforms preserve the spectrum and characteristic polynomial of a matrix.

Most methods for calculating the eigenvalues and eigenvectors of a matrix perform a sequence of similarity transformations to convert the original matrix to a simpler form.



Dinesh Manocha
Mon Apr 20 01:33:57 EDT 1998