Complexity analysis of a process for simultaneously obtaining all zeros of polynomials (Q1262084)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity analysis of a process for simultaneously obtaining all zeros of polynomials |
scientific article; zbMATH DE number 4123172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of a process for simultaneously obtaining all zeros of polynomials |
scientific article; zbMATH DE number 4123172 |
Statements
Complexity analysis of a process for simultaneously obtaining all zeros of polynomials (English)
0 references
1989
0 references
The authors consider the problem to find starting values for certain iterative methods for the simultaneous computation of the zeros of a complex polynomial.
0 references
complexity analysis
0 references
starting values
0 references
iterative methods
0 references
zeros
0 references
complex polynomial
0 references
0 references
0 references
