Abstract
This paper provides a unifying algorithm for computing any analytic interpolant of bounded complexity. Such computation can be performed by solving an optimization problem, due to a theorem by Georgiou and Lindquist. This optimization problem is numerically solvable by a continuation method. The proposed numerical algorithm is useful, among other cases, for designing a low-degree controller for a benchmark problem in robust control. The algorithm unifies previously developed algorithms for the Carathéodory extension and the Nevanlinna–Pick interpolation to one for more general interpolation problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
