Numerical computation of polynomial zeros by means of Aberth's method
From MaRDI portal
Publication:676928
DOI10.1007/BF02207694zbMath0869.65034WikidataQ61908527 ScholiaQ61908527MaRDI QIDQ676928
Publication date: 1 September 1997
Published in: Numerical Algorithms (Search for Journal in Brave)
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
Related Items
na10, Relations between roots and coefficients, interpolation and application to system solving, Computing zeros of analytic functions in the complex plane without using derivatives, An algebraic method to compute the critical points of the distance function between two Keplerian orbits, Computing curve intersection by means of simultaneous iterations, Innovative methods of correlation and orbit determination for space debris, A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Improved algorithms for computing determinants and resultants, On the complexity of real root isolation using continued fractions, Determining the number of real roots of polynomials through neural networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple algorithms for approximating all roots of a polynomial with real roots
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem
- Initial approximations in Durand-Kerner's root finding method
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- A comparison of methods for terminating polynomial iterations
- A bibliography on roots of polynomials
- Some remarks on Dvorcuk's root-finding method
- A posteriori error bounds for the zeros of polynomials
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Generalizations of an algorithm of Sebastião e Silva
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Circular arithmetic and the determination of polynomial zeros
- A posteriori error bounds for the zeros of a polynomial
- Simultaneous inclusion of the zeros of a polynomial
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- The Durand-Kerner polynomials roots-finding method in case of multiple roots
- A Machine Method for Solving Polynomial Equations
- A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- Root Neighborhoods of a Polynomial
- The fundamental theorem of algebra and complexity theory
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- Some modifications of Laguerre's method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- A modified Newton method for polynomials
- A stopping criterion for polynomial root finding
- On the Convergence of Sebastião E. Silva’s Method for Finding a Zero of a Polynomial
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Practical Problems Arising in the Solution of Polynomial Equations
- On a theorem by J. L. Walsh concerning the moduli of roots of algebraic equations
