Abstract
This technical note deals with the robust exact pole placement problem: pole placement algorithms that guarantee a small variation of the assigned poles against possible perturbations. The solution to this problem is related to the solvability of a Sylvester-like equation. Thus, the main issue is to compute a well-conditioned solution to this equation. Also, the best candidate solution must possess the minimal condition number, to reduce sensitivity to perturbation. This problem is cast as a global optimization under linear matrix inequality constraints, for which a numerical convergent algorithm is provided and compared with the most attractive methods in the literature.
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.
