Zero-clusters of polynomials: best approach in supercomputing era (Q961599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Zero-clusters of polynomials: best approach in supercomputing era |
scientific article; zbMATH DE number 5688885
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Zero-clusters of polynomials: best approach in supercomputing era |
scientific article; zbMATH DE number 5688885 |
Statements
Zero-clusters of polynomials: best approach in supercomputing era (English)
0 references
31 March 2010
0 references
deflated Newton method
0 references
multiple roots
0 references
supercomputing era
0 references
zero-clusters of polynomials
0 references
numerical examples
0 references
randomized methods
0 references
exhaustive search algorithm
0 references
real/complex zero-cluster
0 references
computational error
0 references
computational/time complexity
0 references
0.88328695
0 references
0.8688863
0 references
0.86298937
0 references
0.8596127
0 references
0.8577906
0 references
0.8561995
0 references
0.8522024
0 references
0.8508562
0 references
