Abstract
We present a constructive theory for solving the Nevanlinna-Pick problem with a degree constraint. The theory relies on convex optimization, and the method generates all solutions with degree less than the number of interpolation conditions. The degree of the interpolant relates to the dimension of the feedback control system or of a modeling filter, depending on the context for the particular application.
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.
