A Globally Convergent Method for Simultaneously Finding Polynomial Roots

DOI10.2307/2007798zbMATH Open0565.65026OpenAlexW4233970610MaRDI QIDQ3680171FDOQ3680171

Donato Trigiante, L. Pasquini

Publication date: 1985

Full work available at URL: https://doi.org/10.2307/2007798

Recommendations

• The simultaneous approximation of polynomial roots
• scientific article; zbMATH DE number 3872574
• Convergence conditions of some methods for the simultaneous computation of polynomial zero
• Ein numerisches Verfahren zur simultanen Ermittlung aller Nullstellen eines Polynoms. (A numerical method for the simultaneous computation of all zeros of a polynomial)
• On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial

zbMATH Keywords

multiple rootsquadratic convergencezeros of polynomialsimultaneous computation of all rootsset of starting points

Mathematics Subject Classification ID

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)

Cited In (24)

• Numerical factorization of multivariate complex polynomials
• Title not available (Why is that?)
• Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some remarks on Dvorcuk's root-finding method
• The simultaneous approximation of polynomial roots
• Quadratically convergent method for simultaneously approaching the roots of polynomial solutions of a class of differential equations: Application to orthogonal polynomials
• Title not available (Why is that?)
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
• Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
• The Durand-Kerner polynomials roots-finding method in case of multiple roots
• On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
• Durand-Kerner method for the real roots
• Numerical computation of polynomial zeros by means of Aberth's method
• Polynomial roots: The ultimate answer?
• Title not available (Why is that?)
• The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem
• Title not available (Why is that?)
• A combined method for polynomial roots using modified Newton-Raphson with minimum searching
• Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
• Modified Newton method in circular interval arithmetic
• Computing singular solutions to polynomial systems
• The Durand-Kerner method for trigonometric and exponential polynomials

This page was built for publication: A Globally Convergent Method for Simultaneously Finding Polynomial Roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680171)