Abstract
An efficient computational solution of the pole assignment problem of linear single-input systems is presented. It is based on orthogonal reduction of the closed-loop system matrix to upper (quasi-) triangular form whose 1 × 1 or 2 × 2 diagonal blocks correspond to the desired poles. The algorithm proposed is numerically stable and performs equally well with real and complex, distinct, and multiple desired poles. The number of the computational operations is less than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">6n^{3}</tex> , the necessary array storage being <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2n^{2} + 6n</tex> working precision words, where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> is the order of the system.
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.
