On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (Q3698168): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Solution of Systems of Piecewise Linear Equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4138976 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5546070 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The fundamental theorem of algebra and complexity theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The computation of fixed points and applications / rank | |||
Normal rank | |||
Latest revision as of 18:23, 14 June 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
