|Publisher version (open access)||162 KB||Adobe Acrobat PDF||View/Open
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/30029
- Generalizations of the Nevanlinna-Pick interpolation Problem
- This paper aims at generalizing the well-known Nevanlinna-Pick interpolation problem by considering additional constraints. The first type of constraints we consider requires the interpolation function to be of a given degree. Several results are provided for different degree constraints. These results offer feasibility tests via linear matrix inequalities. We have identified a number of degree constraints for which the feasibility tests are exact. For other degree constraints, we offer a relaxation scheme for checking the feasibility. The second type of constraints we study is about spectral zero assignment, which demands the zeros of the spectral factorization of the interpolation function to be at given locations. This problem can be solved using an iterative algorithm by Byrnes, Georgiou and Linquist. However, we provide a much faster iterative algorithm for this problem, although a proof of convergence is yet to be offered.
- 44th IEEE Conference on Decision and Control. Proceedings of the 44th IEEE Conference on Decision and Control (Seville, Spain 2005) p. 4299-4304
- Institute of Electrical and Electronics Engineers (IEEE)
Nevanlinna-Pick interpolation Problem;
spectral zero assignment
- Resource Type
- conference paper
- Copyright © 2005 IEEE. Reprinted from Proceedings of the 44th IEEE Conference on Decision and Control, 4299-4304. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text