Iterative methods for multiple zeros of a polynomial by clustering
type: Item
instance of: scholarly article
title: Iterative methods for multiple zeros of a polynomial by clustering
zbMATH Open document ID: 0682.65024
DOI: 10.1016/0377-0427(89)90343-9
author: T. Miyakoda
published in: Journal of Computational and Applied Mathematics
publication date: 1989-01-01T00:00:00Z
review text: Remarks on the numerical decision of multiplicities of zeros of polynomials.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 4117749
zbMATH Keywords: iterative methods
zbMATH Keywords: multiple zeros
zbMATH Keywords: clustering
zbMATH Keywords: complex polynomial
zbMATH Keywords: Durand-Kerner method
zbMATH Keywords: Tanabe's methods
zbMATH Keywords: multiplicities of zeros of polynomials
reviewed by: Gerhard Merz
MaRDI profile type: Publication
full work available at URL: 0377-0427(89)90343-9
OpenAlex ID: W2083153030
cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
cites work: Q3279563
cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
cites work: An iteration formula for the simultaneous determination of the zeros of a polynomial
cites work: An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
cites work: A note on some improvements of the simultaneous methods for determination of polynomial zeros
cites work: On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
description: scientific article; zbMATH DE number 4117749