Advertisement

Algebraic Interpolation

  • Patrick Dewilde
  • Alle-Jan van der Veen
Chapter

Abstract

In this chapter, we use our knowledge of Hankel operators and chain scattering matrices to solve a set of constrained interpolation problems. These are problems in which one looks for an operator that meets a collection of specifications of the following type: (1) the operator takes specific “values” at specific “points” (we shall make the notion more precise) (2) it is constrained in norm, and (3) it is causal and has minimal state dimensions. We have to limit ourselves to specifications that satisfy a precise structure, but the class is large enough for interesting applications, namely time-varying equivalents of the celebrated “H optimal control” problem or control for minimal sensitivity. Algebraic interpolation is an extension of the notion of interpolation in complex function theory, and we derive algebraic equivalents for very classical interpolation problems such as the Nevanlinna-Pick, Schur, Hermite-Fejer and Nudel’man problems.

Keywords

Interpolation Problem Contractive Operator Hankel Operator Interpolation Property Interpolation Data 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Patrick Dewilde
    • 1
  • Alle-Jan van der Veen
    • 1
  1. 1.DIMESDelft University of TechnologyDelftThe Netherlands

Personalised recommendations