Finding polynomial roots by dynamical systems -- a case study (Q2211136)
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: Finding polynomial roots by dynamical systems -- a case study |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding polynomial roots by dynamical systems -- a case study |
scientific article |
Statements
Finding polynomial roots by dynamical systems -- a case study (English)
0 references
12 November 2020
0 references
By means of numerical experiments the authors compare the efficiency of the Newton root finding method with that of the Ehrlich-Aberth method. Some applications to complex dynamical systems generated by iterations of polynomials are discussed. Results of many spectacular numerical examples are given.
0 references
root finding
0 references
experiments
0 references
polynomials
0 references
efficiency
0 references
Newton's method
0 references
Ehrlich-Aberth method
0 references
comparison
0 references
0 references
0.8416557908058167
0 references
0.8203068971633911
0 references
0.8189162611961365
0 references
0.8181689381599426
0 references
0.8160179257392883
0 references
