The inverse problem of analytic interpolation with degree constraint
2006 (English)In: Proceedings Of The 45th IEEE Conference On Decision And Control, Vols 1-14, 2006, 559-564 p.Conference paper (Refereed)
In , (6] a theory for degree-constrained analytic interpolation was developed in terms of the minimizers of certain convex entropy functionals. In the present paper, we introduce and study relevant inverse problems. More specifically, we answer the following two questions. First, given a function f which satisfies specified interpolation conditions, when is it that f can be obtained as the minimizer of a suitably chosen entropy functional? Second, given a function g, when does there exist a suitably entropy functional so that the unique minitnizer f which is subject to interpolation constraints also satisfies vertical bar f vertical bar = vertical bar g vertical bar on the unit circle. The theory and answers to these questions suggest an approach to identifying interpolants of a given degree and of a given approximate shape.
Place, publisher, year, edition, pages
2006. 559-564 p.
, IEEE Conference on Decision and Control, ISSN 0191-2216
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-41756DOI: 10.1109/CDC.2006.376827ISI: 000252251603123ScopusID: 2-s2.0-39649118367ISBN: 978-1-4244-0170-3OAI: oai:DiVA.org:kth-41756DiVA: diva2:445117
45th IEEE Conference on Decision and Control 2006, CDC; San Diego, CA; 13 December 2006 through 15 December 2006
QC 201110032011-10-032011-09-302012-01-25Bibliographically approved