Extremal problems of interpolation theory

被引:4
作者
Helton, JW [1 ]
Sakhnovich, LA
机构
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
[2] NYU, Courant Inst, New York, NY USA
关键词
D O I
10.1216/rmjm/1181069708
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We consider problems where one seeks m x m matrix valued H-infinity functions w(zeta) which satisfy interpolation constraints and a bound (0.1) omega*(zeta)omega(zeta) <= rho 2(min)(2), |zeta| where the m x m positive semi-definite matrix rho(min) is minimal (no smaller than) any other matrix p producing such a bound. That is, if (0.2) omega*(zeta)omega(zeta) <= rho, |zeta| and if rho(min) - rho is positive semi-definite, then rho(min) = rho. This is an example of what we shall call a "minimal interpolation problem." Such problems are studied extensively in the book [13, Chapter 7]. When the bounding matrices rho are restricted to be scalar multiples of the identity, then the problem where we extremize over them is just the classical matrix valued interpolation problem containing those of Schur and Nevalinna-Pick (which in typical cases has highly nonunique solutions). Our minimal interpolation forces tighter conditions. In this paper we actually study a framework more general than that of Nevardinna-Pick and Schur, and in this general context we show under some assumptions that our minimal interpolation problem, with rho(min) defined formally by a minimal rank condition in Definition 3.3, has a unique solution rho(min) and omega(min)(zeta). It is important both from applied and theoretical view points that the solution omega(min)(zeta) turns out to be a rational matrix function, indeed for the matrix Nevanlinna-Pick and Schur problems we obtain an explicit formulas generalizing those known classically. Also in this paper we compare minimal interpolation problems to superoptimal interpolation problem, cf. [14] and [11], and see that they have very different answers. Whether one chooses super-optimal criteria or our minimal criteria in a particular situation depends on which issues are important in that situation. The case m = 1 was investigated by many people with a formulation close to the one we use being found in Akhiezer [1]. Interpolation with matrix valued analytic functions has found great application in control theory, cf. the books [2, 3, 6, 7, 15].
引用
收藏
页码:819 / 841
页数:23
相关论文
共 15 条
[1]  
AKHIEZER NI, 1997, TOPICS INTERPOLATION, V95, P19
[2]  
[Anonymous], CBMS REG C SER MATH
[3]  
Ball J.A., 1990, Interpolation of Rational Matrix Functions
[4]  
DYM H, 1989, CBMS, V71
[5]   NECESSARY AND SUFFICIENT CONDITIONS FOR THE EXISTENCE OF A POSITIVE-DEFINITE SOLUTION OF THE MATRIX EQUATION X+A-ASTERISK-X-1A=Q [J].
ENGWERDA, JC ;
RAN, ACM ;
RIJKEBOER, AL .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1993, 186 :255-275
[6]   Hermitian solutions of the equation X=Q+NX(-1)N* [J].
Ferrante, A ;
Levy, BC .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1996, 247 :359-373
[7]  
Green M., 2012, Linear Robust Control
[8]  
IVANCHENKO TS, 1987, SOVIET J CONT MATH A, V22, P84
[9]  
KIMURA H, 1989, LECT NOTES CONTROL I, V135, P243
[10]  
Kimura H., 1997, Chain-Scattering Approach to H Control