과제정보
We would like to express our sincere gratitude to the referees for their valuable suggestions and comments which improve the paper.
참고문헌
- T. Bilarev, M. Aspenberg, and D. Schleicher, On the speed of convergence of Newton's method for complex polynomials, Math. Comp. 85 (2016), no. 298, 693-705. https://doi.org/10.1090/mcom/2985
- S. Chaiya, On the distance to a root of polynomials, Abstr. Appl. Anal. 2011 (2011), Art. ID 495312, 6 pp. https://doi.org/10.1155/2011/495312
- J. Hubbard, D. Schleicher, and S. Sutherland, How to find all roots of complex polynomials by Newton's method, Invent. Math. 146 (2001), no. 1, 1-33. https://doi.org/10.1007/s002220100149
- F. Przytycki, Remarks on the simple connectedness of basins of sinks for iterations of rational maps, in Dynamical systems and ergodic theory (Warsaw, 1986), 229-235, Banach Center Publ., 23, PWN, Warsaw, 1989.
- D. Schleicher, On the number of iterations of Newton's method for complex polynomials, Ergodic Theory Dynam. Systems 22 (2002), no. 3, 935-945. https://doi.org/10.1017/S0143385702000482
- D. Schleicher, On the efficient global dynamics of Newton's method for complex polynomials, Manuscript (2016), arXiv:1108.5773v3.
- D. Schleicher and R. Stoll, Newton's method in practice: Finding all roots of polynomials of degree one million efficiently, Theoret. Comput. Sci. 681 (2017), 146-166. https://doi.org/10.1016/j.tcs.2017.03.025
- M. Shishikura, The connectivity of the Julia set and fixed points, in Complex dynamics, 257-276, A K Peters, Wellesley, MA, 2009.