The globalization of Durand-Kerner algorithm (Q1387545)
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 1159625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The globalization of Durand-Kerner algorithm |
scientific article; zbMATH DE number 1159625 |
Statements
The globalization of Durand-Kerner algorithm (English)
0 references
9 February 1999
0 references
The construction of a regularly homotopic curve with probability one, based on homotopy theory and the relation between a symmetric polynomial and a polynomial in one variable, is proposed. The discrete tracing along this homotopic curve leads to a class of Durand-Kerner algorithms with stepsizes as parameters. The convergence of this class of algorithms is known, which solves the conjecture about the global property of the Durand-Kerner algorithm. The problem for steplength selection is also discussed. For the verification of the proposed theory a numerical example is given.
0 references
continuous homotopy
0 references
path tracing
0 references
global convergence
0 references
point estimation
0 references
Durand-Kerner algorithms
0 references
steplength selection
0 references
0 references
0 references
0.8017587065696716
0 references
0.7836081981658936
0 references
0.7708151936531067
0 references
