Firstly i won't put the method down for both methods as I am really asking a question and so whoever answers it will be familiar with the routine.

Basically I wrote 2 programmes one for a bisection method and one for a false position method which are both used to find roots for simple 1d problems.

i.e roots of y = f(x)

to me it seems that the false position method would be better i.e. converges to the root more rapidly as it takes into account the relative magnitudes of f(b) and f(a) unlike bisection which just uses the midpoint of a and b, where [a,b] is the interval over which the root occurs.

However when i ran my programme the false position method actually converges slower to the root =S. can anyone explain this to me??

N.B. both these methods are poor so this point is rather moot but it still interests me.

EDIT**If anyone wants the programme it is a matlab m-file so just pm me and i will email it to you.**