Of particular interest is a theorem due to Jim Agler [A] and
extensions of it [AM] [BT]. Let
denote the unit polydisk
in
the space of
n
complex variables. Let
denote the functions
analytic on
and bounded in supremum norm by 1.
Also
denotes
the
matices.
The
Nevannlina -Pick type interpolation problem on
,the
bi-disk, is:
Given a finite set of pointsSuch problems arise naturally when one is trying to find a function f analytic on the bi-disk which has a supremum normin the bi-disk and numbers
in the complex plane C, find a function f in 2 which takes the values
at the points
.
for some
analytic on the bi-disk.
This is because in the typical situation on the bi-disk the
zero set
of a function g in 2 is empty or is the
union of finitely many one complex dimensional surfaces. Thus
and
have zero sets intersecting (transversally) in
only a finite number of points
and at these points f is constrained to take values
regardless of what h is. An expert in traditional H
control will recall that this problem on the ordinary disk
(as opposed to the bi-disk) will have
and is the model matching problem.
Consequently, we shall call problem (1)
the
bi-disk model matching problem.
The proof is in principle constructive, see [AM] [BT], though considerable effort would probably be required to refine it for computer implementation. While Theorem 2.1 is only stated for f a scalar valued function, it holds in a very similar form f is a matrix valued function, see [BT]. However, this article involves only SISO systems, primarily for ease of pedagogy.
In this article we study a control problem which leads to a
bidisk model matching problem with
. Thus the
interpolating constraints form an infinite set. The
implications of this will be discussed later as they arise