Complexity analysis of a process for simultaneously obtaining all zeros of polynomials (Q1262084): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02241861 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W26388196 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 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
0 references
0 references
