Solving Linear Recurrence Relations

In summary, the conversation discusses solving linear recurrence relations with different initial conditions and finding the characteristic equation and general solution for repeated characteristic roots.
  • #1
taya
1
0
Solve each of the following linear recurrence relations:
1. t(1)=1 t(2)=4
t(n) - 5t(n-1) + 6t (n-2)= 0 for n>1

2. a(n)=4a(n-1) - 4a (n-2)
with initial conditions a(0) = 4 and a(1)=12

3. t(1)=3 t(2)=3
t(n) + 2t (n-1) + t(n-2) = 0
 
Physics news on Phys.org
  • #2
taya said:
1. t(1)=1 t(2)=4
t(n) - 5t(n-1) + 6t (n-2)= 0 for n>1
Rewrite this as \(\displaystyle t_{n + 2} - 5t_{n + 1} + 6 t_n = 0\). What is your characteristic equation?

-Dan
 
  • #3
Hello and welcome to MHB, taya! :D

For future reference, we ask that no more than 2 questions be asked in the initial post of a thread.

In case you find repeated characteristic roots, what form will your general solution take?
 

What is a linear recurrence relation?

A linear recurrence relation is a mathematical equation that describes the relationship between a sequence of numbers, where each term is calculated based on one or more previous terms. It is a recursive formula, meaning that it uses previous terms to calculate new terms.

Why is solving linear recurrence relations important?

Solving linear recurrence relations is important because they often arise in real-world problems and can be used to model and predict various phenomena, such as population growth, stock prices, and chemical reactions. Understanding how to solve these equations allows scientists to make accurate predictions and make informed decisions.

What is the process for solving linear recurrence relations?

The process for solving linear recurrence relations involves rewriting the equation in terms of the initial terms, creating a characteristic equation, finding the roots of the characteristic equation, and using these roots to determine the general solution. This solution can then be used to find specific terms in the sequence.

What is the characteristic equation?

The characteristic equation is a polynomial equation that is created by replacing the terms in a linear recurrence relation with variables. The roots of this equation correspond to the coefficients in the general solution of the recurrence relation.

Can all linear recurrence relations be solved?

No, not all linear recurrence relations can be solved. Some equations may have complex roots or may not have a closed-form solution. In these cases, numerical methods or approximations may be used to find an approximate solution.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
831
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
18
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
698
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
13
Views
1K
Replies
0
Views
371
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
750
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
Back
Top