Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
An error estimate for fixed point computation of b^x
Ok, we want to compute the lower fixed point of for, as usual, .

We do that by iterating:

while iterating we can not directly compute the difference but we can compute and we ask our self how close must come to 1 such that

First we translate the difference into a quotient:

is decreasing. Now lets compute

To make an estimate we want to know whether , is decreasing for . To decide this we differentiate:


This is true for because then .

So we know that is strictly increasing for small enough . So we get
for , equivalently:

The right side can be further simplified:

The condition is satisfied for , i.e. on the right side is a constant . So during the iteration we can decrease according to without fear that becomes to small and the iteration does not stop.

Proposition. Let , let be the lower fixed point of , let and then for each :
iff .

Possibly Related Threads...
Thread Author Replies Views Last Post
  fixed point formula sheldonison 6 15,273 05/23/2015, 04:32 AM
Last Post: mike3
  Attempt to find a limit point but each step needs doubling the precision... Gottfried 15 27,362 11/09/2014, 10:25 PM
Last Post: tommy1729
  Find all fixed points of exp[b] MorgothV8 10 22,043 10/07/2014, 11:00 AM
Last Post: Gottfried
  A note on computation of the slog Gottfried 6 12,991 07/12/2010, 10:24 AM
Last Post: Gottfried
  Single-exp series computation code mike3 0 3,726 04/20/2010, 08:59 PM
Last Post: mike3
  sexp(strip) is winding around the fixed points Kouznetsov 8 17,422 06/29/2009, 10:05 AM
Last Post: bo198214

Users browsing this thread: 1 Guest(s)