Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
type: Item
instance of: scholarly article
title: Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
zbMATH Open document ID: 0685.65042
DOI: 10.1007/BF02241861
author: Deren Wang
author: Fengguang Zhao
published in: Computing
publication date: 1989-01-01T00:00:00Z
review text: The authors consider the problem to find starting values for certain iterative methods for the simultaneous computation of the zeros of a complex polynomial.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 4123172
zbMATH Keywords: complexity analysis
zbMATH Keywords: starting values
zbMATH Keywords: iterative methods
zbMATH Keywords: zeros
zbMATH Keywords: complex polynomial
reviewed by: Gerhard Merz
MaRDI profile type: Publication
cites work: On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
cites work: On the convergence order of a modified method for simultaneous finding polynomial zeros
cites work: Q4196372
cites work: Circular arithmetic and the determination of polynomial zeros
cites work: Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
full work available at URL: https://doi.org/10.1007/bf02241861
OpenAlex ID: W26388196
description: scientific article; zbMATH DE number 4123172