Zero-clusters of polynomials: best approach in supercomputing era (Q961599): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BRENT / rank | |||
Normal rank | |||
Revision as of 08:07, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Zero-clusters of polynomials: best approach in supercomputing era |
scientific article |
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
