Iterative methods for multiple zeros of a polynomial by clustering

DOI10.1016/0377-0427(89)90343-9zbMath0682.65024OpenAlexW2083153030MaRDI QIDQ1824355

Tsuyako Miyakoda

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90343-9

zbMATH Keywords

clusteringiterative methodsDurand-Kerner methodmultiple zeroscomplex polynomialmultiplicities of zeros of polynomialsTanabe's methods

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) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items (5)

Simultaneous factorization of a polynomial by rational approximation ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ Balanced convergence of iterative methods to a multiple zero of a complex polynomial ⋮ Computing multiple roots of inexact polynomials ⋮ Multiplicity estimating algorithm for zeros of a complex polynomial and its applications

Cites Work

• Unnamed Item
• A note on some improvements of the simultaneous methods for determination of polynomial zeros
• An iteration formula for the simultaneous determination of the zeros of a polynomial
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously

This page was built for publication: Iterative methods for multiple zeros of a polynomial by clustering