The formulation and numerical method for partial quadratic eigenvalue assignment problems

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 (C) 2010 John Wiley & Sons, Ltd.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000292548100002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Mathematics, AppliedMathematicsSCI(E)5ARTICLE4637-6521