# Convergence and precision of root-seeking programs

1. How might I find a root-seeking program's "order of convergence"?

2. For an iteration program, how might I examine the effect of the rounding-error? (If MATLAB displays the iterates to 4 d.p., does that mean it is working with that level of accuracy or does it work with more digits internally?)

Thanks.

-
Welcome to math.sx! You should try to write a more descriptive title. As for matlabs display of numbers, you can change it with format long or with fprintf if that's what you mean –  Mikael Öhman Sep 5 '11 at 8:04

2. MATLAB works with normal 8 byte floating point numbers (double), which has precision down to about 16 decimals (or rather, exactly 52 decimals position in binary). In matlab, the function eps(x) will give you the smallest possible increment for the value x. The value displayed corresponds to an increment of the least significant decimal. Note that you cannot exactly describe even just 0.1 in binary, as you can try for yourself in MATLAB: fprintf('%.20e\n',0.1) will result in 1.00000000000000005551e-01 which is the closest binary representation.