Recurrence Relations Flashcards
Consider the solution of given recurrence relation an + 7an–1 + 10an–2 = 0 where a0 = 2 & a1 = 3 by second order linear homogenous recurrence relations:
an = 13/3 (-2)^n + -7/5 (-5)^n
What is the general form of first order recurrence relation?
xn = cxn–1
The relation defined as Xn+1 = Xn + Xn–1 is named as .
Fibonacci numbers
Which among the following is a recurrence relation that defines the nth term in terms of the previous two terms?
Second order recurrence relation
Which among the following is an equation that characterises a sequence based on a principle that gives the next term as a relation with previous terms?
Recurrence relation
Classify the following as first order linear recurrence relation:
xn = 5xn–1
he recurrence relation of the form Xan + Yan–1 + Zan–2 = 0 where X, Y & Z are
Real
Consider the solution of following equation by characteristic root method: xn = 3xn–1, x0 = 1
xn = 1.3n
Determine the recurrence relation for the following function by iteration method: xn = 4xn–1, x0 = .2
xn = 4xn–1 = 4n-1.2
How many methods are used to solve a first order recurrence relation?
2