On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (Q3698168): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:39, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials |
scientific article |
Statements
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (English)
0 references
1985
0 references
complexity
0 references
roots of complex polynomial
0 references
piecewise linear approximation
0 references
