Inverse eigenvalues theorem: Difference between revisions

Content deleted Content added

Revision as of 16:48, 3 May 2006 edit Retired username (talk \| contribs) 48,708 edits Category:Linear algebra ← Previous edit		Latest revision as of 00:41, 22 March 2011 edit undo King of Hearts (talk \| contribs) Edit filter managers, Autopatrolled, Administrators 68,953 edits Wikipedia:Articles for deletion/Inverse eigenvalues theorem closed as redirect to Eigendecomposition of a matrix
(18 intermediate revisions by 16 users not shown)
Line 1: #REDIRECT [[Eigendecomposition of a matrix]] In [[numerical analysis]] and [[linear algebra]], this theorem states that <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>. ~~[[Category:Linear algebra]]~~