Heads up for a hot new root seeking algorithm!!

01112017, 08:05 PM
(This post was last modified: 01112017 08:19 PM by Namir.)
Post: #5




RE: Heads up for a hot new root seeking algorithm!!
(01102017 10:14 PM)Claudio L. Wrote: Since it's ontopic: I looked at the article and my new method does not involve as much calculations per iterations! I think my new algorithm has the same order of convergence as Halley, which is third order. Also the author of teh article is improving on Ostrowski (who improved on Newton). My new algorithms improves on Halley's method using Ostroskwi's approach. Anyway, thanks for the articles. A few years ago I did a survey of recent algorithms that were inspired by Ostrowski. I found algorithms with three or more intermediate refinements for the root per iterations. While the number of iterations of these algorithms decreased (compared to Newton or Halley), the number of function calls went up! So I am conscious that the number of function calls, per iteration, should not get out of hand. Namir 

« Next Oldest  Next Newest »

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