Complexity analysis of a process for simultaneously obtaining all zeros of polynomials (Q1262084): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1174325 |
||
| Property / reviewed by | |||
| Property / reviewed by: Gerhard Merz / rank | |||
Revision as of 20:08, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of a process for simultaneously obtaining all zeros of polynomials |
scientific article |
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
