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.
2015
2015
An Algorithm for Quadratic Eigenproblems with Low Rank Damping
We consider quadratic eigenproblems $\left(M\lambda^2+D\lambda+K\right)x=0$, where all coefficient matrices are real and positive… 
2015
2015
Tropical Roots as Approximations to Eigenvalues of Matrix Polynomials
The tropical roots of $tp(x) = \max_{0\le j\le d}\|A_j\|x^j$ are points at which the maximum is attained at least twice. These… 
2014
2014
On the simultaneous refinement of the zeros of H-palindromic polynomials
Highly Cited
2012
Highly Cited
2012
Locating the Eigenvalues of Matrix Polynomials
Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem… 
2011
2011
CertiVed Numerical Root Finding
Root isolation of univariate polynomials is one of the fundamental problems in computational algebra. It aims to find disjoint… 
2008
2008
A highly efficient root-solver of very fast convergence
2006
2006
Numerical Methods for the Tridiagonal Hyperbolic Quadratic Eigenvalue Problem
We consider numerical methods for the computation of the eigenvalues of the tridiagonal hyperbolic quadratic eigenvalue problem… 
2005
2005
The Ehrlich-Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
An algorithm based on the Ehrlich--Aberth iteration is presented for the computation of the zeros of $p(\lambda)=\det(T-\lambda I… 
2004
2004
On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
A modified method of the fourth order for the simultaneous determination of simple complex zeros of a polynomial, which may be… 
2003
2003
On the fourth order zero-finding methods for polynomials
The fourth order methods for the simultaneous approximation of simple complex zeros of a polynomial are considered. The main… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)