点击次数：

论文类型：期刊论文

发表时间：2011-11-25

发表刊物：THEORETICAL COMPUTER SCIENCE

收录刊物：Scopus、SCIE、EI

卷号：412

期号：50

页面范围：7029-7043

ISSN号：0304-3975

关键字：Nearest polynomial; Zero; Complex; Perturbation; I(infinity)-norm

摘要：Given a univariate complex polynomial f and a closed complex domain D, whose boundary C is a curve parameterized by a piecewise rational function, we propose two computational algorithms for finding a univariate complex polynomial (f) over tilde such that (f) over tilde has a zero in D and the distance between f and (f) over tilde is minimal. Our approach is composed of two steps. First, in the case of D consisting of one point alpha, we give explicit formulas of (f) over tilde and the minimal distance in terms of alpha. Next, the case of a general closed domain D is considered by using the property that a nearest polynomial (f) over tilde has a zero on the boundary C. The curve C is parameterized piecewisely, and on each piece we search for the minimum of the distance between f and (f) over tilde. At this step we exploit the explicit formula of the minimal distance as a function of a point alpha. Then the global minimum and the nearest polynomial are obtained by comparing the piecewise minima. Some examples are presented: one of them confirms that the distance between a nearest complex polynomial and a given polynomial is less than that between a nearest real polynomial and the given polynomial. (C) 2011 Elsevier B.V. All rights reserved.