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?

  • 4
    I don't understand the question. You say "ite1 is better by this metric, ite2 is better by this metric, which one is better?" and then don't specify what the third use of the word "better" means.2012-09-23
  • 0
    @QiaochuYuan I have edited my question. Does it help?2012-09-23
  • 1
    @srijan: your edit haven't addressed the problem. You specify particular way in which ite1 is better. Then you specify a particular way in which ite2 is better. But when you ask "which is better?" you don't specify what measure you want to compare them by.2012-09-23
  • 0
    @Hurkyl Please take a look . I have edited again. I am extremely sorry for inconvenience.2012-09-23
  • 0
    Jori's answer is right. To paraphrase [Hurkyl's comment on another thread](http://math.stackexchange.com/questions/296102/fastest-square-root-algorithm#comment644002_296107), there's always 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