Post Reply 
Heads up for a hot new root seeking algorithm!!
01-26-2017, 08:21 PM (This post was last modified: 01-26-2017 08:30 PM by emece67.)
Post: #27
RE: Heads up for a hot new root seeking algorithm!!
These are my findings so far.

Legend:
  • Iter: number of iterations
  • TNFE: total number of function evaluations
  • COC: computational order of convergence
  • EI: efficiency index
  • Time: referenced to the fastest method

COC is rounded to the nearest integer, except for the \(x^6-1\) case.

Derivatives are always computed by means of the analytical expressions for them (not approximated with differences).

The Potra-Ptak method is a 3rd order method requiring two evaluations for f(x) and one for its derivative. The Kung-Traub method is the 8th order one.

Although I expected bigger differences between different methods, the Ostrowsky-Traub method seems a winner to me.

Regards.


Attached File(s)
.pdf  COC.pdf (Size: 21.69 KB / Downloads: 14)
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
RE: Heads up for a hot new root seeking algorithm!! - emece67 - 01-26-2017 08:21 PM



User(s) browsing this thread: 1 Guest(s)