Polynomial hulls and H-infinity control for a hypoconvex constraint

Mathematics – Complex Variables

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages. This work is strengthened in another paper by the same author, "Polynomial hulls, an optimization problem and the Ko

Scientific paper

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and analytic selections,'' Indiana Univ. Math. J. 39, no. 1 (1990), 157-184.) Let p:T X C^n --> R+ be a smooth function whose sublevel sets have compact hypoconvex fibers over T. Then, with some restrictions on p, if Y is the set where p is less than or equal to 1, the polynomial convex hull of Y is the union of graphs of analytic vector-valued functions with boundary in Y. Furthermore, let t be the smallest real number such that the set where p is less than or equal to t contains the boundary of the graph of some analytic vector-valued function on the disk. Then there is only one analytic vector-valued function f such that p(z,f(z)) is less than or equal to t for all z in T. We show that f is smooth on T. We also prove that if p varies smoothly with respect to a parameter, so does the unique f just found.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Polynomial hulls and H-infinity control for a hypoconvex constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial hulls and H-infinity control for a hypoconvex constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial hulls and H-infinity control for a hypoconvex constraint will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-186503

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.