1. A linear homogenous recurrence relation of degree 2 with constant coefficients is a recurrence relation of the form an = Aan-1+ Ban 2. , Vn 2 2, (1) where A and B are fixed real numbers. (a) Show that this relation can be rewritten in a matrix form as follows an-1 M (2) an-2 where M is a 2 x 2 matrix (that you need to determine). (b) Show by induction that an

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
1. A linear homogenous recurrence relation of degree 2 with constant coefficients is a recurrence
relation of the form
an = Adn-1+ Ban 2, Vn 2 2,
(1)
where A and B are fixed real numbers.
(a) Show that this relation can be rewritten in a matrix form as follows
()-
an-1
= M
(2)
where M is a 2 x 2 matrix (that you need to determine).
(b) Show by induction that
a1
= M"
(c) We turn now our attention to the Fibonacci sequence (a particular case of (1)) given by
( Fo = 0, Fı =1
Fn-1+ Fn-2
(3)
(d) Write the value of the matrix M for the recurrence relation (3) and establish that
(:)-
F, = (0 1) M" ()
(4)
(e) In order to determine a closed formula for F, we need to calculate the value of M". For
this purpose we should diagonalize the matrix M, i.e. we need to find two matrices P
and D such that
M = PDP',
(5)
where D is a diagonal matrix with its diagonal entries being the eigenvalues of M. Find
matrices P and D such that equation (5) is satisfied.
(f) Using equation (5), show that
M = PD"P-1
(g) Show that if the diagonal matrix D =
then D" =
Transcribed Image Text:1. A linear homogenous recurrence relation of degree 2 with constant coefficients is a recurrence relation of the form an = Adn-1+ Ban 2, Vn 2 2, (1) where A and B are fixed real numbers. (a) Show that this relation can be rewritten in a matrix form as follows ()- an-1 = M (2) where M is a 2 x 2 matrix (that you need to determine). (b) Show by induction that a1 = M" (c) We turn now our attention to the Fibonacci sequence (a particular case of (1)) given by ( Fo = 0, Fı =1 Fn-1+ Fn-2 (3) (d) Write the value of the matrix M for the recurrence relation (3) and establish that (:)- F, = (0 1) M" () (4) (e) In order to determine a closed formula for F, we need to calculate the value of M". For this purpose we should diagonalize the matrix M, i.e. we need to find two matrices P and D such that M = PDP', (5) where D is a diagonal matrix with its diagonal entries being the eigenvalues of M. Find matrices P and D such that equation (5) is satisfied. (f) Using equation (5), show that M = PD"P-1 (g) Show that if the diagonal matrix D = then D" =
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Relations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,