Safe convergence of simultaneous methods for polynomial zeros
暂无分享,去创建一个
[1] Gradimir V. Milovanović,et al. A METHOD TO ACCELERATE ITERATIVE PROCESSES IN BANACH SPACE , 1974 .
[2] J. Kuntzmann,et al. Solutions Numeriques des Equations Algebriques , 1963 .
[3] S. Smale. The fundamental theorem of algebra and complexity theory , 1981 .
[4] Carsten Carstensen,et al. Weierstrass formula and zero-finding methods , 1995 .
[5] Miodrag S. Petković,et al. The Root Separation of Polynomials and Some Applications , 1995 .
[6] X. Wang. ON DOMINATING SEQUENCE METHOD IN THE POINT ESTIMATE AND SMALE THEOREM , 1990 .
[7] Miodrag S. Petkovic,et al. Börsch-supan-like methods: point estimation and parallel implementation , 1997, Int. J. Comput. Math..
[8] M. Petkovic,et al. Point estimation and some applications to iterative methods , 1998 .
[9] Myong-Hi Kim. On approximate zeros and rootfinding algorithms for a complex polynomial , 1988 .
[10] Tetsuro Yamamoto,et al. On some methods for the simultaneous determination of polynomial zeros , 1996 .
[11] Miodrag S. Petkovic,et al. On the convergence order of a modified method for simultaneous finding polynomial zeros , 2005, Computing.
[12] A. W. Nourein. An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm) , 1977 .
[13] Immo O. Kerner,et al. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .
[14] S. Smale. Newton’s Method Estimates from Data at One Point , 1986 .
[15] W. Deren,et al. The theory of Smale's point estimation and its applications , 1995 .
[16] Miodrag S. Petkovic,et al. On initial conditions for the convergence of simultaneous root finding methods , 1996, Computing.
[17] James H. Curry,et al. On zero finding methods of higher order from data at one point , 1989, J. Complex..
[18] Pengyuan Chen. Approximate zeros of quadratically convergent algorithms , 1994 .