Iterative convergent functions

Maths and statistics discussion, revision, exam and homework help.

Announcements Posted on
Enter our travel-writing competition for the chance to win a Nikon 1 J3 camera 20-05-2013
IMPORTANT: You must wait until midnight (morning exams)/4.30AM (afternoon exams) to discuss Edexcel exams and until 1pm/6pm the following day for STEP and IB exams. Please read before posting, including for rules for practical and oral exams. 28-04-2013
Sign in to Reply
  1. bleagos's Avatar
    • Junior Member
    • Posts: 31
    Iterative convergent functions
    Hey All,

    I am looking for examples of iterative functions  t_{n+1} = f(t_n) that have the property for all possible real initial values  t_0 > 1 we have

     t_n \rightarrow 1, n \rightarrow \infty

    The only ones I could think of were:

     f(t) = t^x , 0<x<1
     f(t) = \frac{t+\epsilon}{\epsilon +1}, \epsilon > 0

    Can anybody think of any more?

    Thanks
  2. Bobifier's Avatar
    • TSR Demigod
    • Location: England
    • Posts: 5,616
    Re: Iterative convergent functions
    Look up the Newton Raphson method, then use it on functions with a single root at 1. Most of the time it will converge to 1.

    Also consider how your values will approach 1 - for instance, construct a function such that the distance between the new value and 1 is half the distance between the old value and 1.

    Finally, consider any function you can think of that tends to a limit other than 0 and just multiply it by the reciprocal of the limit.
    Last edited by Bobifier; 03-04-2012 at 18:12.
  3. DFranklin's Avatar
    • TSR Royalty
    • Location: London
    • Posts: 18,052
    Re: Iterative convergent functions
    Your first suggestion doesn't work very well for t < 0.

    Note that your 2nd suggestion can be written as (t-1+1+e)/(e+1) = (t-1)/(e+1) + 1.

    That is, f(t) = g(t-1) + 1, where g(x) = x/(1+e). It's quite easy to see that the nth iterate f^n(t) is g^n(t-1) + 1.

    So you're basically looking for functions g(x) s.t. g^n(x) -> 0 as n->\infty

    I think this is a bit easier to deal with conceptually. E.g. g(x) = x /(2+x^2) should work.
  4. bleagos's Avatar
    • Junior Member
    • Posts: 31
    Re: Iterative convergent functions
    (Original post by Bobifier)
    Look up the Newton Raphson method, then use it on functions with a single root at 1. Most of the time it will converge to 1.

    Also consider how your values will approach 1 - for instance, construct a function such that the distance between the new value and 1 is half the distance between the old value and 1.

    Finally, consider any function you can think of that tends to a limit other than 0 and just multiply it by the reciprocal of the limit.
    Thanks for the ideas, I never thought of the Newton Raphson method, that is really good!

    The second function I gave covers your second suggestion by letting epsilon = 1 and I like the third idea, it has given me something to think about.

    Thanks again
  5. bleagos's Avatar
    • Junior Member
    • Posts: 31
    Re: Iterative convergent functions
    (Original post by DFranklin)
    Your first suggestion doesn't work very well for t < 0.

    Note that your 2nd suggestion can be written as (t-1+1+e)/(e+1) = (t-1)/(e+1) + 1.

    That is, f(t) = g(t-1) + 1, where g(x) = x/(1+e). It's quite easy to see that the nth iterate f^n(t) is g^n(t-1) + 1.

    So you're basically looking for functions g(x) s.t. g^n(x) -> 0 as n->\infty

    I think this is a bit easier to deal with conceptually. E.g. g(x) = x /(2+x^2) should work.
    I should have said this but I want t_n > 1 for all n so the first one would work.

    I never thought about it the way you did with g(x), I think that works well. Thank you
  6. bleagos's Avatar
    • Junior Member
    • Posts: 31
    Re: Iterative convergent functions
    (Original post by DFranklin)
    Your first suggestion doesn't work very well for t < 0.

    Note that your 2nd suggestion can be written as (t-1+1+e)/(e+1) = (t-1)/(e+1) + 1.

    That is, f(t) = g(t-1) + 1, where g(x) = x/(1+e). It's quite easy to see that the nth iterate f^n(t) is g^n(t-1) + 1.

    So you're basically looking for functions g(x) s.t. g^n(x) -> 0 as n->\infty

    I think this is a bit easier to deal with conceptually. E.g. g(x) = x /(2+x^2) should work.
    Does the second idea neccessarily work? I am not sure for example:

     g(t) = \frac{t}{2}

    Then  t_{n+1} = g(t_n) + 1 has a fixed point at t = 2.

    Also for the example you gave we have a fixed point at the real solution of the cubic equatiobn  t^3 - t^2 + 3t -2 = 0 which gives  t \approx 1.35
    Last edited by bleagos; 03-04-2012 at 18:42. Reason: More information
  7. DFranklin's Avatar
    • TSR Royalty
    • Location: London
    • Posts: 18,052
    Re: Iterative convergent functions
    It's actually a bit easier if you know t_0 > 1, I think.
  8. DFranklin's Avatar
    • TSR Royalty
    • Location: London
    • Posts: 18,052
    Re: Iterative convergent functions
    As a "something to think about" function:

    f(t) = 1 (t < 2)
    f(t) = t-1 (t>=2).
Sign in to Reply
Share this discussion:  
Article updates
Moderators

We have a brilliant team of more than 60 volunteers looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

Reputation gems:
The Reputation gems seen here indicate how well reputed the user is, red gem indicate negative reputation and green indicates a good rep.
Post rating score:
These scores show if a post has been positively or negatively rated by our members.