Newton's method and the computational complexity of the fundamental theorem of algebra (Q4918038)
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 6160454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Newton's method and the computational complexity of the fundamental theorem of algebra |
scientific article; zbMATH DE number 6160454 |
Statements
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (English)
0 references
3 May 2013
0 references
subdivision schemes
0 references
global methods
0 references
factorization approach
0 references
constructive proofs
0 references
0 references
0 references
0.818192720413208
0 references
0.8134217262268066
0 references
0.8015031814575195
0 references
0.8000733852386475
0 references
0.79880690574646
0 references
