0
$\begingroup$

I have two iteration methods say ite1 and ite2 . If ite1 is performing well in terms of number of iterations and accuracy while ite2 is slightly better than ite1 in terms of computing time only. Which method would be better one? Could anybody clear my doubt? I would be very much thankful.

Edit 1: I want to compare my proposed iteration method with some other iteration methods. I have taken three parameters: Number of iterations, computing time, accuracy. I found that my proposed methhod has better accuracy and taking less number of iterations in comparison to other methods, while one particular method is slightly better than mine in terms of computing time only. I am confused how can i say that my method is better than others or shall I remove computing time parameter?

  • 0
    Jori's answer is right. To paraphrase [$H$urky$l$'s comment on another thread](http://math.stacke$x$change.com/questions/296102/fastest-square-root-a$l$gorithm#comment644002_296107), there's a$l$ways an easy way to reduce the number of iterations: each iteration, you do two steps of some other algorithm. :) In the end, what matters is *the total compute time it takes to achieve a given accuracy*.2013-03-11

2 Answers 2

2

Number of iterations is not only affecting thing. How much work each round needs? See for example http://en.wikipedia.org/wiki/Secant_method#Comparison_with_other_root-finding_methods

In general "best" in computer programs is not that easy to define. There might even be some very bad cases for algorithm, and then they might be very unusual (or very usual!) in reality.

1

Here ite1 is better.
Because according to the Newton-Raphson iterative principal as the no of iteration is lesser(irrespective of the computing time) is presumed as the most efficient rather than such a method which involves more steps with lesser computing time.
Thanks