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(adsbygoogle = window.adsbygoogle || []).push({}); quarticrate.

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?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Root-finding Algorithm Question

Loading...

Similar Threads for Root finding Algorithm | Date |
---|---|

Finding the roots! | Dec 12, 2012 |

Root-finding by iteration | Jun 16, 2012 |

Linear Combinations of Trig Functions - Finding Roots | Mar 11, 2010 |

Find the asymptotes of f(x)= x/square root(4x-1) | May 19, 2005 |

Finding the roots | Jan 1, 2005 |

**Physics Forums - The Fusion of Science and Community**