What to expect when i simulate a recurrence relation?
I am working on an assignment, and I am having trouble with this recurrence relation:
x(n+2) - 3x(n+1) + x(n) = 0
x(0) = 1
x(1) = (3-sqrt(5))/2
What can you expect to happen when you simulate this equation numerically?
The next task is to simulate the equation in python, but for now, they want me to point out what kind of problems I might run into.
I figured that x(1) will not be represented correctly when converted to a 64-bit float, and that the misrepresentation will lead to large errors for large values of n, but I don't know how to elaborate and explain this sufficiently, or if i might encounter more problems.
Can anyone help me?
Sorry if my english is unclear!