Matrix Diagonalization and Fibonacci Numbers

Matrix Diagonalization and Fibonacci Numbers

pcsulbxml_no_dcsulb-edudate:D:L:dUTF-8 Anh N. Ho – Major in Applied Mathematic INTRODUCTION Examples of FIBONACCI ART EIGENVALUES & EIGENVECTORS METHOD Fibonacci numbers in An eigenvector of an nxn matrix A is an STUDY OF A MATRIX A: smokestack (Turku) and non-zero vector x: Ax = λx for some scalar building (Sweden). λ. (called the associated eigenvalue of A). |A – λI | = 0→ → →Give Anxn, λ = solution of equation |A – λI | = 0 λ1=(1+√5)/2: General solution: X1 Similarly X2: DIAGONALIZATION A nxn is called diagonalizable if there exists an invertible matrix P of the same size → → ; satisfying for some diagonal matrix D. Compute power of A: From theorem: → 1. dim (Eλ1) + dim (Eλ2)=2 2. → A is diagonalizable → Theorem A nxn matrix & λ1,…, λk be the distinct (real) eingenvalues of A. We have: Applied to Fibonacci sequence: fn=fn-1+fn-2. where 1. A is diagonalizable if and only if dim (Eλ1) +…+ dim (Eλk)=n. Let: → ; 2. If A is diagonalizable with P-1AP=D, then the columns of P are basis vectors for the eigenspaces of A and the diagonal entries of → . We have: D are the corresponding eigenvalues. But An=PDnP-1 (as studied above) → FIBONACCI NUMBER The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 . .) occurs throughout the carefully multiply out → the nth Fibonacci term: e.g. for n = 100: worlds of nature, art, music, and mathematics! Each term in the series is produced by adding together the two previous terms, so that 1 + 1=2, 1 + 2=3, 2 + 3=5, and so on. = 573147844013817084101. Spiral shells also exhibit pattern: SUMMARY ______________________________________________________________________________ fn=fn-1+fn-2. Fibonacci 1170-1250 The Fibonacci numbers get bigger and bigger. The Leonardo Pisano, known by his nick name Fibonacci, was born in Pisa, Italy, but was educated in North Africa (Algeria) where (from thirteenth-century Europe) his father, Guilielmo, held a diplomatic post. expression that gives fn for any n can be found if one Fibonacci numbers: 1, 1, 2, 3, 5, 8, 13, 21, 55, 89, 144, 233, 377, . knows a little bit about matrix diagonalization. This sequence occurs in many places in math, general science, in nature and even in art..

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    1 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us