Complexity analysis of a process for simultaneously obtaining all zeros of polynomials (Q1262084): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the convergence order of a modified method for simultaneous finding polynomial zeros / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4196372 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circular arithmetic and the determination of polynomial zeros / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros / rank | |||
Normal rank | |||
Revision as of 11:29, 20 June 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
