Inverse eigenvalues theorem: Difference between revisions

Revision as of 05:14, 18 November 2008

Latest revision as of 00:41, 22 March 2011

(13 intermediate revisions by 11 users not shown)

Line 1:

#REDIRECT [[Eigendecomposition of a matrix]]

In [[numerical analysis]] and [[linear algebra]], the '''Inverse eigenvalues theorem''' states that, given a matrix A that is [[nonsingular]], with [[eigenvalue]] <math>\lambda>0</math>, <math>\lambda</math> is an eigenvalue of <math>A</math> if and only if <math>\lambda^{-1}</math> is an eigenvalue of <math>A^{-1}</math>.

{{math-stub}}

[[Category:Linear algebra]]

[[Category:Mathematical theorems]]