Solution of the recurrence relation

In summary, the conversation is about solving a recurrence relation using calculated values and the characteristic equation. The person is wondering if they have calculated the values correctly and if there is another way to find the solution. They receive a hint and are able to solve the problem.
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :eek:

How can we solve the following recurrence relation?

$$f_n=\left (\frac{2}{a^2}+b\right )f_{n-1}-\frac{1}{a^4}f_{n-2} \\ f_0=1, f_{-1}=0$$

I calculated some values to see if there is a general pattern, but it doesn't seems so...

$$f_1=\left (\frac{2}{a^2}+b\right ) \\ f_2 =\left (\frac{2}{a^2}+b\right )^2-\frac{1}{a^4} \\ f_3 =\left (\frac{2}{a^2}+b\right )^3-\frac{2}{a^4}\left (\frac{2}{a^2}+b\right ) \\ f_4=\left (\frac{2}{a^2}+b\right )^4-\frac{3}{a^4}\left (\frac{2}{a^2}+b\right ) ^2+\frac{1}{a^8} \\ f_5=\left (\frac{2}{a^2}+b\right )^5-\frac{4}{a^4}\left (\frac{2}{a^2}+b\right ) ^3+\frac{3}{a^8}\left (\frac{2}{a^2}+b\right )$$

Have calculated these values right?

Is there an other way to find the solution of the recurrence relation? (Wondering)
 
Physics news on Phys.org
  • #2
mathmari said:
Hey! :eek:

How can we solve the following recurrence relation?

$$f_n=\left (\frac{2}{a^2}+b\right )f_{n-1}-\frac{1}{a^4}f_{n-2} \\ f_0=1, f_{-1}=0$$

I calculated some values to see if there is a general pattern, but it doesn't seems so...

$$f_1=\left (\frac{2}{a^2}+b\right ) \\ f_2 =\left (\frac{2}{a^2}+b\right )^2-\frac{1}{a^4} \\ f_3 =\left (\frac{2}{a^2}+b\right )^3-\frac{2}{a^4}\left (\frac{2}{a^2}+b\right ) \\ f_4=\left (\frac{2}{a^2}+b\right )^4-\frac{3}{a^4}\left (\frac{2}{a^2}+b\right ) ^2+\frac{1}{a^8} \\ f_5=\left (\frac{2}{a^2}+b\right )^5-\frac{4}{a^4}\left (\frac{2}{a^2}+b\right ) ^3+\frac{3}{a^8}\left (\frac{2}{a^2}+b\right )$$

Have calculated these values right?

Is there an other way to find the solution of the recurrence relation? (Wondering)
Start with:
\(\displaystyle f_n = c f_{n-1} + d f_{n-2}\)

\(\displaystyle f_{n + 2} - c f_{n + 1} - d f_n = 0\)

The characteristic equation is \(\displaystyle m^2 - cm - d = 0\)

Can you take it from here?

-Dan
 
  • #3
I did it! Thanks for the hint! (flower)
 

FAQ: Solution of the recurrence relation

What is a recurrence relation?

A recurrence relation is a mathematical equation that defines a sequence of numbers, where each term in the sequence is defined in terms of previous terms. It is often used in computer science and other fields to describe the relationship between a problem and its subproblems.

What is the solution of a recurrence relation?

The solution of a recurrence relation is a closed-form expression or algorithm that allows us to calculate the value of any term in the sequence without having to recursively calculate all previous terms. It helps to simplify and optimize the process of finding a solution to the original problem.

How do you solve a recurrence relation?

There are several methods for solving recurrence relations, including substitution, iteration, and the master theorem. The method used depends on the form of the recurrence relation and its coefficients. In general, solving a recurrence relation involves finding a pattern or formula that describes the relationship between terms in the sequence.

What is the importance of solving recurrence relations?

Solving recurrence relations is important in understanding and analyzing algorithms, as well as in finding efficient solutions to problems. It allows us to predict and control the growth of a sequence, which is crucial in designing algorithms that are efficient and scalable.

Can all recurrence relations be solved?

No, not all recurrence relations can be solved. Some may have a closed-form solution, while others may require an algorithm or approximation method to find a solution. Additionally, some recurrence relations may be unsolvable or have no closed-form solution.

Back
Top