Applied Mathematics and Mechanics (English Edition) ›› 1997, Vol. 18 ›› Issue (11): 1045-1057.

• Articles • Previous Articles     Next Articles

THE GLOBALIZATION OF DURAND-KERNER ALGORITHM

Wang Deren1, Zhao Fengguang2   

  1. 1. Shanghai University, Shanghai 201800, P. R. China;
    2. Fudan University, Shanghai 200433, P. R. China
  • Received:1996-10-16 Revised:1997-06-23 Online:1997-11-18 Published:1997-11-18
  • Supported by:
    Project supported by the National Natural Science Foundation of China

Abstract: Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability one. Discrete tracingalong this honlotopic curve leads 10 a class of Durand-Kerner algorithm with stepparameters. The convergernce of this class of algorithms is given, which solves theconjecture about the global property of Durand-Kerner algorithm. The.problem forsteplength selection is thoroughly discussed Finally, sufficient numerical examples areused to verify our theory

Key words: Durand-Kerner algorithm, continuous homotopy, path tracing, global convergence, point estimation

APS Journals | CSTAM Journals | AMS Journals | EMS Journals | ASME Journals