Recurrence relations - intuition

Click For Summary

Discussion Overview

The discussion centers around the understanding of recurrence relations, particularly focusing on the intuition behind them rather than their solutions. Participants express a desire for resources that provide a deeper conceptual grasp of various types of recurrence relations, including homogeneous, non-homogeneous, linear, non-linear, first-order, and second-order relations.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification

Main Points Raised

  • One participant expresses frustration with their calculus textbook's explanations of recurrence relations and seeks resources for a better intuitive understanding.
  • Another participant explains that recurrence relations define a function in terms of itself, using the Fibonacci sequence as an example, and notes the confusion that arises from different mathematical expressions.
  • A participant acknowledges their ability to solve recurrence relations numerically but struggles with understanding the analytic solutions, specifically the form of solutions for linear second-order homogeneous relations.
  • A later reply offers a link to a resource that purportedly begins to prove the application of characteristic polynomial solutions, suggesting it follows a proof by induction.

Areas of Agreement / Disagreement

Participants do not appear to reach a consensus on the intuitive understanding of recurrence relations, with multiple viewpoints and expressions of confusion remaining present throughout the discussion.

Contextual Notes

Some participants mention specific types of recurrence relations and their properties, but the discussion lacks clarity on the underlying assumptions and proofs that would solidify their understanding.

Avatrin
Messages
242
Reaction score
6
Hi

My calculus textbook is completely crap at explaining recurrence relations. I know the theorems needed to solve difference equations analytically, but I do not understand why they are true.

What websites and/or books can I read to get a better intuitive understanding of recurrence relations?

PS. I am not asking how to solve some specific type of recurrence relation. Homogeneous, non-homogeneous, linear, non-linear, first-order and second order recurrence relations are all relevant.
 
Physics news on Phys.org
Avatrin,

Recurrence relations are a way to express a function by using that same function in it's definition. There is usually a base case (at least in any I can remember). Then the solution set can be built iteratively. Take the Fibonacci sequence: 0,1,1,2,3,5,8,13, etc
The sequence is just defined with 2 terms at the start F(0) = 0 and F(1) = 1. Then a relationship F(n)=F(n-1) + F(n-2). This is where things start to get confusing, at least for me, there are a lot of different way to express a set or solution in mathematics. Strangely mathematicians get uncomfortable when something is expressed in terms of itself (like the definition of numbers). The details are http://ulcar.uml.edu/~iag/CS/Fibonacci.html" , but a closed form expression is just a different way (usually much harder and less intuitive) to represent the solution. The benefit comes in calculation of F(n) when n is large. If we wanted a fast way to compute F(1000) the closed solution would directly provide an answer, but the recursive would require computations of all the previous solutions up to n.
 
Last edited by a moderator:
I know what recurrence relations are, and I know how to solve them numerically. However, I do not understand the analytic solutions to them.

For instance, I know the solution of a linear second-order, homogeneous recurrence relation has the form:
x_n = Cr_1^n + Dr_2^n
Where r_1 and r_2 are the roots of a quadratic equation derived from the original recurrence relation.
... But, I do not understand why (the proof in my textbook was pointless)..

I would be able to solve a linear, second-order homogeneous recurrence relation, but I do not understand the process.
 
Avatrin,

Sorry I glossed over the important part. If I understand correctly, you would like to see the proof of the application of the characteristic polynomial solutions. http://condor.depaul.edu/ntomuro/courses/415/notes/lecture8.html" starts the proof and continues with the cases. It's a proof by induction similar to the tower of hanoi inductive proof from the other site.
 
Last edited by a moderator:

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 3 ·
Replies
3
Views
7K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
8K