Hiroshi Sekigawa
ABSTRACT
For a real univariate polynomial f and a bounded closed domain D ⊂ C whose boundary C is a simple closed curve of finite length and is represented by a piecewise rational function, we provide a rigorous method for finding the real univariate polynomial f such that f has a zero in D and ||f -- f||∞ is minimal. First, we prove that the absolute value of every coefficient of f -- f is ||f -- f∞ with at most one exception. Using this property and the representation of C, we reduce the problem to solving systems of algebraic equations, each of which consists of two equations with two variables. Furthermore, every equation is of degree one with respect to one of the two variables.
- L. V. Ahlfors. Complex Analysis (3rd edition). McGraw-Hill, 1979.Google Scholar
- A. C. Bartlett, C. V. Hollot and Huang Lin. Root Location of an Entire Polytope of Polynomials: It Suffices to Check the Edges. Mathematics of Controls, Signals and Systems, Vol.1, pp.61--71, 1988.Google ScholarCross Ref
- S. P. Bhattacharyya, H. Chapellat and L. H. Keel. Robust Control, The Parametric Approach. Prentice-Hall, 1995. Google ScholarDigital Library
- M. A. Hitz and E. Kaltofen. The Kharitonov Theorem and its Applications in Symbolic Mathematical Computation. In Proc. Workshop on Symbolic-Numeric Algebra for Polynomials (SNAP96), pp.20--21, 1996.Google Scholar
- M. A. Hitz and E. Kaltofen. Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. In Proc. 1998 International Symposium on Symbolic and Algebraic Computation (ISSAC98), pp.236--243, 1998. Google ScholarDigital Library
- M. A. Hitz, E. Kaltofen and Y. N. Lakshman. Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. In Proc. 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC99), pp.205--212, 1999. Google ScholarDigital Library
- E. Kaltofen. Efficient Algorithms for Computing the Nearest Polynomial with Parametrically Constrained Roots and Factors. Lecture at the Workshop on Symbolic and Numerical Scientific Computation (SNSC '99), 1999.Google Scholar
- V. L. Kharitonov. Asymptotic Stability of an Equilibrium Position of a Family of Systems of Linear Differential Equations. Differentsial 'nye Uravneniya, Vol.14, No.11, pp.2086--2088, 1978.Google Scholar
- R. G. Mosier. Root Neighborhoods of a Polynomial. Math.Comp., Vol.47, No.175, pp.265--273, 1986. Google ScholarDigital Library
- L. Qiu and E. J. Davison. A Simple Procedure for the Exact Stability Robustness Computation of Polynomials with Affne Coefficient Perturbations. Systems and Control Letters, Vol.13, pp.413--420, 1989. Google ScholarDigital Library
- A. Rantzer. Stability Conditions for Polytopes of Polynomials. IEEE Trans. Auto. Control, Vol.37, No. 1, pp.79--89, 1992.Google ScholarCross Ref
- N. Rezvani and R. C. Corless. The Nearest Polynomial with a Given Zero, Revisited. ACM SIGSAM Bulletin, Vol.39, No.3, pp.73--79, 2005. Google ScholarDigital Library
- W. Rudin. Real and Complex Analysis (3rd edition). McGraw-Hill, 1987. Google ScholarDigital Library
- H. Sekigawa and K. Shirayanagi. Locating Real Multiple Zeros of a Real Interval Polynomial. In Proc. 2006 International Symposium on Symbolic and Algebraic Computation (ISSAC2006), pp.310--317, 2006. Google ScholarDigital Library
- H. Sekigawa and K. Shirayanagi. On the Location of Zeros of an Interval Polynomial. In Symbolic-Numeric Computation, edited by Dongming Wang and Lihong Zhi, pp.167--184, Birkhä user, 2007.Google ScholarCross Ref
- H. J. Stetter. The Nearest Polynomial with a Given Zero, and Similar Problems.ACMSIGSAM Bulletin, Vol.33, No.4, pp.2--4, 1999. Google ScholarDigital Library
Index Terms
- The nearest polynomial with a zero in a given domain
Recommendations
The nearest polynomial with a zero in a given domain
For a real univariate polynomial f and a closed domain D@?C whose boundary C is represented by a piecewise rational function, we provide a rigorous method for finding a real univariate polynomial f@? such that f@? has a zero in D and @?f-f@?@?"~ is ...
The nearest complex polynomial with a zero in a given complex domain
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@? such that f@? has ...
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
For a real univariate polynomial f and a closed complex domain D whose boundary C is a simple curve parameterized by a univariate piecewise rational function, a rigorous method is given for finding a real univariate polynomial f@? such that f@? has a ...
Comments