Approximate zeros of quadratically convergent algorithms
暂无分享,去创建一个
[1] S. Smale. The fundamental theorem of algebra and complexity theory , 1981 .
[2] S. Smale,et al. Computational complexity: on the geometry of polynomials and a theory of cost. I , 1985 .
[3] S. Smale. On the efficiency of algorithms of analysis , 1985 .
[4] Stephen Smale,et al. Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II , 1986, SIAM J. Comput..
[5] S. Smale. Newton’s Method Estimates from Data at One Point , 1986 .
[6] W. Rheinboldt. On a theorem of S. Smale about Newton's method for analytic mappings , 1988 .
[7] Myong-Hi Kim. On approximate zeros and rootfinding algorithms for a complex polynomial , 1988 .
[8] James H. Curry,et al. On zero finding methods of higher order from data at one point , 1989, J. Complex..