The fast and parallel Halley algorithm for finding all zeros of a polynomial (Q3611053)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5525684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The fast and parallel Halley algorithm for finding all zeros of a polynomial |
scientific article; zbMATH DE number 5525684 |
Statements
6 March 2009
0 references
parallel computation
0 references
fast Halley algorithm
0 references
circular arithmetic
0 references
all zeros of a polynomial
0 references
convergence
0 references
0.9763985872268676
0 references
0.8564819097518921
0 references
