Abstract
In this paper, we consider the minimum norm and robust partial quadratic eigenvalue assignment problems (PQEVAP). A complete theory on the existence of solutions for the PQEVAP is established. It is shown that solving the PQEVAP is essentially solving an eigenvalue assignment for a linear system of a much lower order, and the minimum norm and robust PQEVAPs are then concerning the minimum norm and robust eigenvalue assignment problems associated with this linear system. Based on this theory, an algorithm for solving the minimum norm and robust PQEVAPs is proposed, and its efficient behaviors are illustrated by some numerical examples. Copyright © 2010 John Wiley & Sons, Ltd.
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.
