Abstract
In a previous paper [SIAM J. Matrix Anal. Appl., 10 (1989), pp. 446–456], Cox and Moss proved that the pole assignment algorithm of Petkov, Christov, and Konstantinov [IEEE Trans. Automat. Control, AC-29 (1984), pp. 1045–1048] is numerically stable for the real case. In this paper, a modified version of the algorithm of Petkov, Christov, and Konstantinov for the complex case is analyzed and the full algorithm (real and complex) is shown to be numerically stable.
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.
