+- MKLab (https://mklab.gr)
+-- Forum: [INDEX] (https://mklab.gr/forumdisplay.php?fid=1)
+--- Forum: MATHEMATICS (https://mklab.gr/forumdisplay.php?fid=3)
+---- Forum: ARTICLES (https://mklab.gr/forumdisplay.php?fid=13)
+---- Thread: Aberth method (/showthread.php?tid=917)
Aberth method - mklabgr - 07-06-2026
Aberth method
Summary
The Aberth method is a powerful numerical technique used to find all the roots of a polynomial at the same time, rather than calculating them one by one. Developed by Oliver Aberth in 1973, it improves on earlier approaches such as Newton's method by allowing multiple approximations to evolve together while preventing them from collapsing onto the same root.
The idea is to start with several guesses for the roots and repeatedly refine them using information from the polynomial and from the positions of the other approximations, so each guess is naturally pushed toward a different solution. This makes the method especially effective for polynomials with many complex roots, where traditional methods can become slow or unreliable.
In practice, the Aberth method combines the speed of Newton-like iteration with a clever correction mechanism that encourages the approximations to spread out and discover all roots efficiently. It is widely used in computer algebra systems and numerical mathematics because it provides a fast, stable, and elegant way to solve one of the fundamental problems of algebra: finding the zeros of a polynomial.
ARTICLE