• DocumentCode
    336660
  • Title

    Analytic interpolation with a degree constraint

  • Author

    Georgiou, Tryplion T.

  • Author_Institution
    Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
  • Volume
    3
  • fYear
    1998
  • fDate
    1998
  • Firstpage
    2769
  • Abstract
    The author previously (1983, 1987) showed that there is a correspondence between nonnegative (hermitian) trigonometric polynomials of degree ⩽n and solutions to the standard Nevanlinna-Pick-Caratheodory interpolation problem with n+1 constraints, which are rational and also of degree ⩽n. It was conjectured that the correspondence under suitable normalization is bijective and thereby, that it results in a complete parametrization of rational solutions of degree ⩽n. The conjecture was proven by Byrnes et al. (1995) along with a detailed study of this parametrization, but their result was shown under a slightly restrictive assumption that the trigonometric polynomials are positive and accordingly, the corresponding solutions have positive real part. The purpose of the present note is to extend the result to the case of nonnegative trigonometric polynomials as well. We present the arguments in the context of the general Nevanlinna-Pick-Caratheodory-Fejer interpolation
  • Keywords
    interpolation; polynomial matrices; Nevanlinna-Pick-Caratheodory-Fejer interpolation; analytic interpolation; bijective correspondence; hermitian trigonometric polynomials; nonnegative trigonometric polynomials; normalization; rational solution parametrization; Circuit theory; Functional analysis; Interpolation; Mathematics; Passive circuits; Polynomials; Robustness; Signal processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1998. Proceedings of the 37th IEEE Conference on
  • Conference_Location
    Tampa, FL
  • ISSN
    0191-2216
  • Print_ISBN
    0-7803-4394-8
  • Type

    conf

  • DOI
    10.1109/CDC.1998.757874
  • Filename
    757874