Iteration Methods for Finding all Zeros of
暂无分享,去创建一个
Durand and Kerner independently have proposed a quadratically convergent iteration method for finding all zeros of a polynomial simultaneously. Here, a new deriva- tion of their iteration equation is given, and a second, cubically convergent iteration method is proposed. A relatively simple procedure for choosing the initial approximations is described, which is applicable to either method.
[1] Brian T. Smith,et al. Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems , 1970, JACM.
[2] Immo O. Kerner,et al. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .