Hiroshi Sekigawa
ABSTRACT
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 zero in D and |f - ~f|∞ is minimal. First, it is proved that the minimum distance between f and polynomials having a zero at α in C is a piecewise rational function of the real and imaginary parts of α. Thus, on C, the minimum distance is a piecewise rational function of a parameter obtained through the parameterization of C. Therefore, by using the property that ~f has a zero on C and computing the minimum distance on C, ~f can be constructed.
- M. J. Atallah. Some dynamic computational geometry problems. Computers and Mathematics with Applications, 11(12):1171--1181, 1985.Google Scholar
Cross Ref
- A. C. Bartlett, C. V. Hollot, and H. Lin. Root location of an entire polytope of polynomials: It suffices to check the edges. Mathematics of Controls, Signals and Systems, 1: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
- H. Davenport and A. Schinzel. A combinatorial problem concerned with differential equations. American Journal of Mathematics, 87(3):684--694, 1965.Google ScholarCross Ref
- S. Graillat. A note on a nearest polynomial with a given root. ACM SIGSAM Bulletin, 39(2):53--60, 2005. Google ScholarDigital Library
- 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), pages 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), pages 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
- M. Karow. Geometry of spectral value sets. PhD thesis, Universitat Bremen, 2003.Google Scholar
- V. L. Kharitonov. Asymptotic stability of an equilibrium position of a family of systems of linear differential equations. Differentsial'nye Uravneniya, 14(11):2086--2088, 1978.Google Scholar
- R. G. Mosier. Root neighborhoods of a polynomial. Math. Comp., 47(175):265--273, 1986. Google ScholarDigital Library
- L. Qiu and E. J. Davison. A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations. Systems and Control Letters, 13:413--420, 1989. Google ScholarDigital Library
- A. Rantzer. Stability conditions for polytopes of polynomials. IEEE Trans. Auto. Control, 37(1):79--89, 1992.Google ScholarCross Ref
- N. Rezvani and R. C. Corless. The nearest polynomial with a given zero, revisited. ACM SIGSAM Bulletin, 39(3):73--79, 2005. Google ScholarDigital Library
- H. Sekigawa. The nearest polynomial with a zero in a given domain. In Proc. 2007 International Workshop on Symbolic-Numeric Computation (SNC'07), pages 190--196, 2007. 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), pages 310--317, 2006. Google ScholarDigital Library
- H. Sekigawa and K. Shirayanagi. On the location of zeros of an interval polynomial. In D. Wang and L. Zhi, editors, Symbolic-Numeric Computation, pages 167--184. Birkhauser, 2007.Google ScholarCross Ref
- M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995. Google ScholarDigital Library
- H. J. Stetter. The nearest polynomial with a given zero, and similar problems. ACM SIGSAM Bulletin, 33(4):2--4, 1999. Google ScholarDigital Library
Index Terms
- The nearest polynomial with a zero in a given domain from a geometrical viewpoint
Recommendations
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 ...
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 ...
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 ...
Comments