排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
Bahman Kalantari. 《Mathematics of Computation》2005,74(250):841-852
Smale's analysis of Newton's iteration function induce a lower bound on the gap between two distinct zeros of a given complex-valued analytic function . In this paper we make use of a fundamental family of iteration functions , , to derive an infinite family of lower bounds on the above gap. However, even for , where coincides with Newton's, our lower bound is more than twice as good as Smale's bound or its improved version given by Blum, Cucker, Shub, and Smale. When is a complex polynomial of degree , for small the corresponding bound is computable in arithmetic operations. For quadratic polynomials, as increases the lower bounds converge to the actual gap. We show how to use these bounds to compute lower bounds on the distance between an arbitrary point and the nearest root of . In particular, using the latter result, we show that, given a complex polynomial , , for each we can compute upper and lower bounds and such that the roots of lie in the annulus . In particular, , ; and , , where . An application of the latter bounds is within Weyl's classical quad-tree algorithm for computing all roots of a given complex polynomial.
2.
3.
In this paper, we present the properties on zeros, fixed points, poles, Borel exceptional value of finite order transcendental meromorphic solutions of complex difference equation of Malmquist typewhere n(∈ N) 〉 2, P(f(z)) and Q(f(z)) are relatively prime polynomials in f(z) with rational coefficients a8 (s = 0, 1,…,p) and bt (t = 0, 1,… ,q) such that aoapbq 7≠ O, and also consider the existence and the forms on rational solutions of this type of difference equations. Some examples are also listed to show that the assumptions of theorems, in certain senses, are the best possible. 相似文献
4.
1