This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Linear Recurrence using matrices Jonathan L.F. King University of Florida, Gainesville FL 32611 squash@ufl.edu Webpage http://www.math.ufl.edu/ squash/ 26 October, 2011 (at 10:39 ) See also Problems/NumberTheory/fibonacci.latex Notation. Use r for rowequivalence: I.e, K N matrices M r M IFF we can get from M to M using row operations. Use c for column equivalence. Two N N matrices B & C are similar , or con jugate to each other, if there exists an invertible matrix U such that U 1 B U = C . Use B sim C for the similarity equivrelation. Call a matrix OTForm s I note ==== [ s s ], a dilation ; its action on the plane is simply to scaleuniformly by factor s . Every matrix commutes with I , and so: A dilation is only conjugate to itself. 1 : I.e, for invertible U , necessarily U 1 s I U = s I . For T a square matrix ( or a trn from a vectorspace to itself ) and a complex number , define the subspace E T , := vectors v T v = v . 2 : Saying that is a Teigenvalue is the same as saying that Dim( E T , ) > 1....
View
Full
Document
This note was uploaded on 01/26/2012 for the course MAC 3472 taught by Professor Jury during the Fall '07 term at University of Florida.
 Fall '07
 JURY
 Calculus, Matrices

Click to edit the document details