A constraint optimization problem in singular control theory: Where is the nearest non-index-at-most-one matrix pencil?

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/102624

Title:	A constraint optimization problem in singular control theory: Where is the nearest non-index-at-most-one matrix pencil?
Authors:	Chu, D.
Keywords:	Distance Index Matrix pencil Optimization Perturbation Regularity
Issue Date:	Oct-2003
Citation:	Chu, D. (2003-10). A constraint optimization problem in singular control theory: Where is the nearest non-index-at-most-one matrix pencil?. Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms 10 (5) : 765-780. ScholarBank@NUS Repository.
Abstract:	In this paper the distance from a regular matrix pencil of index at most one to the pencils which are not regular or are regular but of index higher than one is considered. The algebraic characterizations of such distance with structured and unstructured perturbations are obtained as constraint optimization problems. The characterizations lead to some important bounds for the relevant distance.
Source Title:	Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms
URI:	http://scholarbank.nus.edu.sg/handle/10635/102624
ISSN:	14928760
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check