Point estimation of simultaneous methods for solving polynomial equations

[1]  L. Kantorovich,et al.  Functional analysis in normed spaces , 1952 .

[2]  Hans J. Maehly,et al.  Zur iterativen Auflösung algebraischer Gleichungen , 1954 .

[3]  W. Börsch-Supan.  A posteriori error bounds for the zeros of polynomials , 1963 .

[4]  Immo O. Kerner,et al.  Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .

[5]  Louis W. Ehrlich,et al.  A modified Newton method for polynomials , 1967, CACM.

[6]  Wolfgang Börsch-supan,et al.  Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation , 1970 .

[7]  Oliver Aberth,et al.  Iteration methods for finding all zeros of a polynomial simultaneously , 1973 .

[8]  R. Tapia,et al.  Optimal Error Bounds for the Newton–Kantorovich Theorem , 1974 .

[9]  L. B. Rall.  A Note on the Convergence of Newton’s Method , 1974 .

[10]  A. W. Nourein,et al.  An iteration formula for the simultaneous determination of the zeros of a polynomial , 1975 .

[11]  E. Hansen,et al.  A family of root finding methods , 1976 .

[12]  Abdel Wahab M. Anourein.  An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial , 1977 .

[13]  Irene Gargantini,et al.  Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials , 1978 .

[14]  Henryk Wozniakowski,et al.  Convergence and Complexity of Newton Iteration for Operator Equations , 1979, JACM.

[15]  S. Smale.  The fundamental theorem of algebra and complexity theory , 1981 .

[16]  Wilhelm Werner,et al.  On the simultaneous determination of polynomial roots , 1982 .

[17]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[18]  Layne T. Watson,et al.  A parallel algorithm for simple roots for polynomials , 1984 .

[19]  S. Smale,et al.  Computational complexity: on the geometry of polynomials and a theory of cost. I , 1985 .

[20]  S. Smale.  On the efficiency of algorithms of analysis , 1985 .

[21]  Richard E. Ewing,et al.  "The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics" , 1986 .

[22]  Stephen Smale,et al.  Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II , 1986, SIAM J. Comput..

[23]  S. Smale.  Newton’s Method Estimates from Data at One Point , 1986 .

[24]  Myong-Hi Kim.  On approximate zeros and rootfinding algorithms for a complex polynomial , 1988 .

[25]  James H. Curry,et al.  On zero finding methods of higher order from data at one point , 1989, J. Complex..

[26]  X. Wang.  ON DOMINATING SEQUENCE METHOD IN THE POINT ESTIMATE AND SMALE THEOREM , 1990 .

[27]  Carsten Carstensen,et al.  On iteration methods without derivatives for the simultaneous determination of polynomial zeros , 1993 .

[28]  Carsten Carstensen.  On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials , 1993 .

[29]  T. Yamamoto.  Validated computation of polynomial zeros by the Durand-Kerner method , 1994 .

[30]  Pengyuan Chen.  Approximate zeros of quadratically convergent algorithms , 1994 .

[31]  Carsten Carstensen,et al.  Weierstrass formula and zero-finding methods , 1995 .

[32]  W. Deren,et al.  The theory of Smale's point estimation and its applications , 1995 .

[33]  Tetsuro Yamamoto,et al.  On some methods for the simultaneous determination of polynomial zeros , 1996 .

[34]  Miodrag S. Petkovic,et al.  Börsch-supan-like methods: point estimation and parallel implementation , 1997, Int. J. Comput. Math..

[35]  Miodrag S. Petković,et al.  Point estimation theory and its applications , 1997 .

[36]  Miodrag S. Petković,et al.  A family of simultaneous zero-finding methods , 1997 .

[37]  M. Petkovic,et al.  Point estimation and some applications to iterative methods , 1998 .

[38]  Miodrag S. Petković,et al.  Complex Interval Arithmetic and Its Applications , 1998 .

[39]  Dorde Herceg,et al.  On the convergence of Wang-Zheng's method , 1998 .

[40]  Prashant Batra,et al.  Improvement of a convergence condition for the Durand-Kerner iteration , 1998 .

[41]  Dorde Herceg,et al.  Point estimation of a family of simultaneous zero-finding methods , 1998 .

[42]  Wang Xinghua,et al.  Convergence of Newton's method and inverse function theorem in Banach space , 1999 .

[43]  Slobodan Ilic,et al.  The guaranteed convergence of Laguerre-like method , 2003 .

[46]  Miodrag S. Petkovic,et al.  Safe convergence of simultaneous methods for polynomial zeros , 2004, Numerical Algorithms.

[47]  Miodrag S. Petkovic,et al.  On initial conditions for the convergence of simultaneous root finding methods , 1996, Computing.