Isolated real zero of a real polynomial system under perturbation
Isolated real zero of a real polynomial system under perturbation
复制标题
DOI:
10.1145/2016567.2016591
复制
发表时间:
2011-07
期刊:
影响因子:
--
通讯作者:
Hiroshi Sekigawa;Kiyoshi Shirayanagi
中科院分区:
文献类型:
--
作者:
Hiroshi Sekigawa;Kiyoshi Shirayanagi
When solving a system of empirical polynomials, one might be concerned whether properties of a zero such as multiplicity and uniqueness are preserved under perturbation of the coefficients. We consider such a problem for real polynomial systems and solve the problem by using the Kantorovich theorem [2]. Suppose that we are given polynomials fi ∈ R[x1, . . . , xn] (1 ≤ i ≤ n) and a point x(0) ∈ Rn such that (i) x(0) is an isolated simple real zero of the polynomial system f1 = · · · = fn = 0 or its approximation and (ii) f ′(x(0)) is nonsingular, where f = (f1, . . . , fn) : Rn → Rn. When x(0) is an approximation of a real zero, we further assume that a special case of the Kantorovich theorem below guarantees that the Newton iterates x(m+1) = x(m) − f ′(x(m))−1f(x(m)) (m ≥ 0) are well-defined and converge to a unique simple real zero of the polynomial system f1 = · · · = fn = 0 in a neighborhood of x(0). Furthermore, for each i (1 ≤ i ≤ n), we are given polynomials uij ∈ R[x1, . . . , xn] (1 ≤ j ≤ mi), where ui1, . . . , uimi are linearly independent over R. Each uij is an arbitrary polynomial (not necessarily a monomial) and its degree might be larger than that of fi. In this setting, we consider the following problem. Problem 1 Compute a positive value as large as possible and construct a neighborhood U of x(0) such that for each real polynomial f̃i = fi + ∑mi j=1 ijuij (1 ≤ i ≤ n) with | ij | ≤ , the polynomial system f̃1 = · · · = f̃n = 0 has a unique simple real zero in U .