Iterative methods for multiple zeros of a polynomial by clustering

DOI10.1016/0377-0427(89)90343-9MaRDI QIDQ1824355zbMATH OpenOpenAlexFDO

Authors T. 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

clusteringcomplex polynomialDurand-Kerner methoditerative methodsmultiple zerosmultiplicities of zeros of polynomialsTanabe's methods

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) 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)

Review text

Remarks on the numerical decision of multiplicities of zeros of polynomials.

Cites work

• A note on some improvements of the simultaneous methods for determination of polynomial zeros
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• An iteration formula for the simultaneous determination of the zeros of a polynomial
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• scientific article; zbMATH DE number 3161517 (Why is no real title available?)
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros

Cited in

(8)

• Balanced convergence of iterative methods to a multiple zero of a complex polynomial
• Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
• Simultaneous factorization of a polynomial by rational approximation
• Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
• scientific article; zbMATH DE number 1254284 (Why is no real title available?)
• Computing multiple roots of inexact polynomials
• On isolation of simple multiple zeros and clusters of zeros of polynomial systems
• Zero-clusters of polynomials: best approach in supercomputing era

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

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