Numerical computation of polynomial zeros by means of Aberth's method
From MaRDI portal
Publication:676928
DOI10.1007/BF02207694zbMATH Open0869.65034OpenAlexW2043237762WikidataQ61908527 ScholiaQ61908527MaRDI QIDQ676928FDOQ676928
Authors: Dario A. Bini 
Publication date: 1 September 1997
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02207694
Recommendations
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
- scientific article; zbMATH DE number 939310
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
- A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- A bibliography on roots of polynomials
- Circular arithmetic and the determination of polynomial zeros
- The fundamental theorem of algebra and complexity theory
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- A Machine Method for Solving Polynomial Equations
- Title not available (Why is that?)
- Initial approximations in Durand-Kerner's root finding method
- A posteriori error bounds for the zeros of polynomials
- Generalizations of an algorithm of Sebastião e Silva
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Title not available (Why is that?)
- On the Convergence of Sebastião E. Silva’s Method for Finding a Zero of a Polynomial
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Some modifications of Laguerre's method
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Title not available (Why is that?)
- Root Neighborhoods of a Polynomial
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem
- Practical Problems Arising in the Solution of Polynomial Equations
- A comparison of methods for terminating polynomial iterations
- Some remarks on Dvorcuk's root-finding method
- A posteriori error bounds for the zeros of a polynomial
- The Durand-Kerner polynomials roots-finding method in case of multiple roots
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- A stopping criterion for polynomial root finding
- On a theorem by J. L. Walsh concerning the moduli of roots of algebraic equations
- Simple algorithms for approximating all roots of a polynomial with real roots
Cited In (50)
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- Finding polynomial roots by dynamical systems -- a case study
- A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Finite spatial-grid effects in energy-conserving particle-in-cell algorithms
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- How to count the number of zeros that a polynomial has on the unit circle?
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- New progress in real and complex polynomial root-finding
- Title not available (Why is that?)
- Root-finding by expansion with independent constraints
- Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots
- A fitting algorithm for real coefficient polynomial rooting
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- 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
- Characterization of local optima of polynomial modulus over a disc
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Determining the number of real roots of polynomials through neural networks
- Title not available (Why is that?)
- On the complexity of real root isolation using continued fractions
- On the stability of computing polynomial roots via confederate linearizations
- Real polynomial root-finding by means of matrix and polynomial iterations
- On scale functions for Lévy processes with negative phase-type jumps
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Revisiting the computation of the critical points of the Keplerian distance
- na10
- Improved algorithms for computing determinants and resultants
- Solving secular and polynomial equations: a multiprecision algorithm
- Relations between roots and coefficients, interpolation and application to system solving
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- Computing zeros of analytic functions in the complex plane without using derivatives
- Computing curve intersection by means of simultaneous iterations
- Is the polynomial so perfidious?
- Implementation of Pellet's theorem
- Generalization and variations of Pellet's theorem for matrix polynomials
- A new fast root-finder for black box polynomials
- Fast and Backward Stable Computation of Roots of Polynomials
- Orbit determination with the two-body integrals. II
- An algebraic method to compute the critical points of the distance function between two Keplerian orbits
- Computing curve intersection by homotopy methods
- Orbit determination with the two-body integrals
- Innovative methods of correlation and orbit determination for space debris
- Improved schemes on Durand-Kerner method and Aberth method
- New bounds for roots of polynomials based on Fiedler companion matrices
- On using symmetric polynomials for constructing root finding methods
This page was built for publication: Numerical computation of polynomial zeros by means of Aberth's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676928)
