A parallel algorithm for finding roots of a complex polynomial (Q805233): 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: Q3262547 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel Wilf algorithm for complex zeros of a polynomial / rank | |||
Normal rank | |||
Latest revision as of 17:28, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for finding roots of a complex polynomial |
scientific article |
Statements
A parallel algorithm for finding roots of a complex polynomial (English)
0 references
1990
0 references
parallel algorithm
0 references
roots of a complex polynomial
0 references
Wilf algorithm
0 references
