Approximation by Analytic Matrix Functions: The Four Block Problem

✍ Scribed by V.V. Peller; S.R. Treil

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 485 KB
• Volume: 148
• Category: Article
• ISSN: 0022-1236
• DOI: 10.1006/jfan.1996.3073

✦ Synopsis

The four block problem is a generalization of Nehari's problem for matrix functions. It plays an important role in H -optimal control theory. It is well known that Nehari's problem for a continuous scalar function has a unique solution. However, in the matrix case the situation is quite different. V. V. Peller and N. J. Young (1994, J. Funct. Anal. 120, 300 343) studied superoptimal solutions of Nehari's problem. They minimize not only the L -norm of the corresponding matrix function but also the essential suprema of all further singular values. It was shown that for H +C matrix functions Nehari's problem has a unique superoptimal solution. In this paper we study superoptimal solutions of the four block problem and we find a natural condition under which such a superoptimal solution is unique. Our result is new even in the case of Nehari's problem. We study some related problems such as thematic factorizations, invariance of indices, and inequalities between the singular values of the four block operator and the superoptimal singular values.