Root-finding Algorithm Question

  • Thread starter DuncanM
  • Start date
  • #1
98
2

Main Question or Discussion Point

Some time ago I saw a thread in which was mentioned a root-finding algorithm that converges twice as fast as the Newton-Raphson method. Newton-Raphson converges to a zero at a quadratic rate, and a poster pointed out that another algorithm converges to a zero at a quartic rate.

I have tried to find that thread, but cannot.

Anybody here know what algorithm I am talking about? It is for computing the roots of a function and converges to a solution at twice the rate of Newton-Raphson?
 

Answers and Replies

  • #2
Office_Shredder
Staff Emeritus
Science Advisor
Gold Member
3,750
99
  • #3
98
2
I think I found it, and here is an old thread in these forums about it:

https://www.physicsforums.com/showthread.php?t=409453

It is called Halley's Method.

I was mistaken; it actually offers cubic convergence, not quartic.
In any case, is still faster convergence than the Newton-Raphson Method.

Here are a couple other links with information about it:

http://en.wikipedia.org/wiki/Halley's_method

http://mathworld.wolfram.com/HalleysMethod.html
 
  • #4
Office_Shredder
Staff Emeritus
Science Advisor
Gold Member
3,750
99
The paper I linked to does have a fourth order convergence
 

Related Threads for: Root-finding Algorithm Question

  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
3
Views
2K
Replies
14
Views
17K
Replies
9
Views
6K
Replies
12
Views
2K
Replies
2
Views
1K
  • Last Post
Replies
1
Views
2K
Top