7.2 Solving Recurrence Relations. Definition 1 (p. 460)- LHRR-K Def: A linear homogeneous recurrence relations of degree k with constant coefficients.

Slides:



Advertisements
Similar presentations
Notes 6.6 Fundamental Theorem of Algebra
Advertisements

Fall 2002CMSC Discrete Structures1 Now it’s Time for… RecurrenceRelations.
section 6.2 Solving Recurrence Relations
Rational Root Theorem.
Discrete Mathematics Lecture 8 Alexander Bukharovich New York University.
Discrete Structures Chapter 6 Recurrence Relations
Zeros of Polynomial Functions Section 2.5. Objectives Use the Factor Theorem to show that x-c is a factor a polynomial. Find all real zeros of a polynomial.
Solving Polynomial Equations. Fundamental Theorem of Algebra Every polynomial equation of degree n has n roots!
Chapter 4 – Polynomials and Rational Functions
Remainder and Factor Theorem Unit 11. Definitions Roots and Zeros: The real number, r, is a zero of f(x) iff: 1.) r is a solution, or root of f(x)=0 2.)
1 Linear Recurrence Relations Part I Jorge Cobb The University of Texas at Dallas.
Applied Discrete Mathematics Week 9: Relations
Advanced Counting Techniques
Exam 1 Review 5.1, , 8.1, 8.2.
Sullivan Algebra and Trigonometry: Section 5.6 Complex Zeros; Fundamental Theorem of Algebra Objectives Utilize the Conjugate Pairs Theorem to Find the.
Exam 2 Review 8.2, 8.5, 8.6, Thm. 1 for 2 roots, Thm. 2 for 1 root Theorem 1: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1.
Jessie Zhao Course page: 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Graphing Polynomial Functions. Graphs of Polynomial Functions 1. Polynomials have smooth, continuous curves 2. Continuous means it can be drawn without.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Dividing Polynomials Intro - Chapter 4.1. Using Long Division Example 1: Dividing Polynomials DIVISOR DIVIDEND REMAINDER QUOTIENT.
2.3 Synthetic Substitution
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Recurrence Relation. Outline  What is a recurrence relation ?  Solving linear recurrence relations  Divide-and-conquer algorithms and recurrence relations.
15.1 CompSci 102© Michael Frank Today’s topics Recurrence relationsRecurrence relations –Stating recurrences –LiHoReCoCo Reading: Sections Reading:
Module #17: Recurrence Relations Rosen 5 th ed., §
Solving Second-Order Recursive Relations Lecture 36 ½ Section 8.3 Wed, Apr 19, 2006.
RECURRENCE Sequence Recursively defined sequence
CSCI 115 Chapter 3 Counting. CSCI 115 §3.1 Permutations.
2.3 Synthetic Substitution OBJ:  To evaluate a polynomial for given values of its variables using synthetic substitution.
Factor Theorem & Rational Root Theorem
2.4 – Real Zeros of Polynomial Functions
Module #1 - Logic 1 Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank and Modified By Mingwu Chen Recurrence.
after UCI ICS/Math 6A, Summer AdvancedCounting -1 Recurrence Relations (RRs) A “Recurrence Relation”
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Chapter 8 Recursion. 8.3 More Recurrence Second-Order Recurrence Definition – A second-order linear homogeneous recurrence relation with constant coefficients.
Section 5.5 The Real Zeros of a Polynomial Function.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 3 Polynomial and Rational Functions.
7.2 Solving Linear Recurrence Relations Some of these recurrence relations can be solved using iteration or some other ad hoc technique. However, one important.
Asymptotics and Recurrence Equations Prepared by John Reif, Ph.D. Analysis of Algorithms.
Solving Polynomial Equations by Factoring Factoring by grouping Ex. 1. Solve:
6.5 Theorems About Roots of Polynomial Equations
CSE 2813 Discrete Structures Solving Recurrence Relations Section 6.2.
Agenda Lecture Content:  Recurrence Relations  Solving Recurrence Relations  Iteration  Linear homogenous recurrence relation of order k with constant.
Recurrence Relations. Outline Recurrence relationsSolving recurrence relationsRecurrence and Divide-and-conquer algorithmsGenerating functions
CSCI 115 Chapter 3 Counting. CSCI 115 §3.1 Permutations.
Homogeneous Linear Recurrences To solve such recurrences we must first know how to solve an easier type of recurrence relation: DEF: A linear recurrence.
Solving Linear Homogeneous Recurrence Relations ICS 6D Sandy Irani.
Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.
case study on Laplace transform
1 Lecture Outline for Recurrences Already Covered: Recursive definition of sequences Recursive definition of sets Recursive definition of operations Recursive.
Discrete Math For Computing II. Contact Information B. Prabhakaran Department of Computer Science University of Texas at Dallas Mail Station EC 31, PO.
Section 2.5 – Quadratic Equations
CMSC Discrete Structures
Modeling with Recurrence Relations
Factor Theorem & Rational Root Theorem
UNIT-6 Recurrence Relations
Rational Zero Theorem Rational Zero Th’m: If the polynomial
Section 11.2 The Quadratic Formula.
Auxiliary Equation with Repeated Roots
Today in Precalculus Go over homework Notes: Remainder
Warm-up: Find all real solutions of the equation X4 – 3x2 + 2 = 0
Rational Root Theorem.
CMSC Discrete Structures
Solving Recurrence Relations
CMSC Discrete Structures
Recurrence Relations Discrete Structures.
4.1: Polynomial Functions
Recurrence Relations Rosen 5th ed., §6.2 5/22/2019
Presentation transcript:

7.2 Solving Recurrence Relations

Definition 1 (p. 460)- LHRR-K Def: A linear homogeneous recurrence relations of degree k with constant coefficients (referred to as “LHRR-K”) is a recurrence relation of the form a n = c 1 a n-1 + c 2 a n-2 + … +c k a n-k where c 1, c 2, …c k are real numbers, and c k ≠ Note: These can be explicitly solved in a systematic way.

First, are the following examples or non-examples? a n = 3 a n-1 a n = a n-1 + a n-2 2 f n = f n-1 + f n-2 H n = 2H n-1 +1 B n = n B n-1 a n = a n-1 +3 a n-2, a 0 =1, a 1 =2

Solving LHRR-K: Step 1: Find a characteristic equation: a n =r n is a solution of a n = c 1 a n-1 + c 2 a n-2 + … +c k a n-k iff r n = c 1 r n-1 + c 2 r n-2 + … +c k r n-k Divide by r n-k : Then r k = c 1 r k-1 + c 2 r k-2 + … +c k So: r k - c 1 r k-1 - c 2 r k-2 - … - c k =0 For degree 2: the characteristic equation is r 2 -c 1 r –c 2 =0 (roots are used to find explicit formula) Basic Solution: a n =α 1 r 1 n + α 2 r 2 n where r 1 and r 2 are roots of the characteristic equation

Thm. 1 (for 2 nd degree equations) Theorem 1: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1 r –c 2 =0 has two distinct roots r 1 and r 2, Then the sequence {a n } is a solution of the recurrence relation a n = c 1 a n-1 + c 2 a n-2 iff a n =α 1 r 1 n + α 2 r 2 n for n=0, 1, 2… where α 1 and α 2 are constants First an example… Proof: later…

Ex. 1. Let a n =7a n-1 – 10 a n-2 for n≥2; a 0 =2, a 1 =1 Find the characteristic equation … get r=2, 5 Let a n = α 1 r 1 n + α 2 r 2 n …solve system and get α 1 = 3 and α 2 = -1 So, basic solution is:a n = 3*2 n -5 n

Prove this is a solution (as we did in sec 7.1):

Sketch of Proof of Thm. 1: (p. 462) Step 1: Show that a n =α 1 r 1 n + α 2 r 2 n is a solution of a n =c 1 a n-1 +c 2 a n-2 c 1 a n-1 +c 2 a n-2 =c 1 (α 1 r 1 n-1 + α 2 r 2 n-1 )+c 2 (α 1 r 1 n-2 + α 2 r 2 n-2 ) why? = α 1 r 1 n-2 (c 1 r 1 + c 2 ) + α 2 r 2 n-2 (c 1 r 2 + c 2 )algebra =α 1 r 1 n-2 r α 2 r 2 n-2 r 2 2 reason: r 1 r 2 are roots of r 2 -c 1 r-c 2 =0 so r 1 2 =c 1 r 1 +c 2 and r 2 2 = c 1 r 2 +c 2 =α 1 r 1 n + α 2 r 2 n = a n

Pf- step 2 Step 2: Show that there exist constants α 1 α 2 such that a n =α 1 r 1 n + α 2 r 2 n satisfies the initial conditions a 0 =C 0 and a 1 =C 1. a 0 = C 0 = … a 1 = C 1 = … Next solve system of 2 equations and 2 variables and get… α 1 = (C 1 -C 0 r 2 )/(r 1 -r 2 ) α 2 = (C 0 r 1 – C 1 ) / (r 1 -r 2 )

Ex: 2. a n =6a n-1 -8a n-2 for n≥2; a 0 =4 and a 1 =10. Find characteristic equation Find solution

Ex 2 - Prove it is a solution

Ex: 3. Fibonacci numbers: f n =f n-1 +f n-2 for n≥2; f 0 =0 and f 1 =1. Find characteristic equation r 2 = r+1find r 1 and r 2 Thm. 1 says f n = α 1 r 1 n + α 2 r 2 n Solve for α 1, α 2 Solution:

Note: Thm. 1 is only for r 1 ≠r 2 Thm. 2 is for r 1 = r 2 Theorem 2: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1 r –c 2 =0 has only one root r 0, Then the sequence {a n } is a solution of the recurrence relation a n = c 1 a n-1 + c 2 a n-2 iff a n =α 1 r 0 n + α 2 n r 0 n for n=0, 1, 2… where α 1 and α 2 are constants.

Ex: 4. (Recall this ex from section 5.1) a n =2a n-1 -a n-2 for n≥2; a 0 =0 and a 1 =3 Find characteristic equation Find solution Prove it is a solution

Ex: 5. a n = - 6a n-1 -9a n-2 for n≥2; a 0 =3 and a 1 = - 3 Find characteristic equation Find solution Prove it is a solution

Ex: 6. a n =8a n-1 -16a n-2 for n≥2; a 0 =2 and a 1 =20. Find characteristic equation Find solution Prove it is a solution

Summarize k degree solution

Ex: (#12 in book) a n =2a n-1 +a n-2 -2a n-3 for n≥3; a 0 =3,a 1 =6, a 2 =0 Find characteristic equation r 3 – 2 r 2 - r +2=0 Use synthetic division to get (r-1)(r+1)(r-2)=0 Find solution Prove it is a solution

Ex: (#15 bk) a n =2a n-1 +5a n-2 -6a n-3 for n≥3; a 0 =7,a 1 = - 4, a 2 =8 Find characteristic equation Use synthetic division to get Find solution Prove it is a solution

Ex: 7. a n =5a n-2 -4a n-4 ; a 0 =3, a 1 =2, a 2 =6 and a 3 =8 Find characteristic equation Find solution Prove it is a solution

Ex: (#8 in book—modeling number of lobsters caught) Find characteristic equation Find solution Prove it is a solution