Durand-Kerner method

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

After Emile Durand,[1] a French mathematician, and Immo Kerner,[2] a German mathematician.

Proper noun[edit]

Durand-Kerner method

  1. (mathematics) An algorithm for finding the roots of polynomial equations.
    • 1975, International journal of computer mathematics‎[1], volumes 5-6:
      The improved Durand-Kerner Method […] Referring to the improved Durand-Kerner and the improved Ehrlich we find that the approximations converging towards the origin will move directly towards this zero on each iteration cycle always reducing their distance away by the fraction 2/(m+1) in the first method and 3/(m+2) in the second […]

Synonyms[edit]

Translations[edit]

References[edit]

  1. ^ Durand, E. (1960). "Equations du type F(x) = 0: Racines d'un polynome". in Masson et al. Solutions numeriques des equations algebriques, vol. 1.
  2. ^ Kerner, Immo O. (1966). "Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen". Numerische Mathematik 8: 290–294. doi:10.1007/BF02162564

Further reading[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=Durand-Kerner_method&oldid=78113133"