The globalization of Durand-Kerner algorithm (Q1387545)

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.