Abstract
Of the six or so pole assignment algorithms currently available, several have been claimed to be numerically stable, but no proofs have been published to date. It is shown, by performing a backward error analysis, that one of these algorithms, due to Petkov, Christov, and Konstantinov [IEEE Trans. Automat. Control, AC–29 (1984), pp. 1045–10481 is numerically stable.
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.
