Skip to search formSkip to main contentSkip to account menu

Aberth method

The Aberth method, or Aberth–Ehrlich method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Durand–Kerner methodGauss–Seidel methodJacobi methodList of numerical analysis topics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Midpoint two- steps rule for the square root method
We present a method “Midpoint-Two-Steps rule” for the square root functional iteration for enclosing zeros of a polynomial. The… 
2008
2008
On fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations 1
In this paper, we present and analyse fourth order method for finding simultaneously multiple zeros of polynomial equations. S. M… 
1975
1975
Aberth Oliver. The concept of effective method applied to computational problems of linear algebra. Journal of computer and system sciences, vol. 5 (1971), pp. 17–25.