NP-hardness of the stable matrix in unit interval family problem in discrete time

Authors
Mercado, A Liu, KJR
Citation
A. Mercado et Kjr. Liu, NP-hardness of the stable matrix in unit interval family problem in discrete time, SYST CONTR, 42(4), 2001, pp. 261-265
Citations number
10
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
SYSTEMS & CONTROL LETTERS
ISSN journal
01676911 → ACNP
Volume
42
Issue
4
Year of publication
2001
Pages
261 - 265
Database
ISI
SICI code
0167-6911(20010406)42:4<261:NOTSMI>2.0.ZU;2-G
Abstract
We show that to determine if a family of matrices, each with parameters in the unit interval, contains a matrix with all eigenvalues inside the unit c ircle is an NP-hard problem. We also discuss how this problem is closely re lated to the widespread problem of power control in wireless systems. (C) 2 001 Elsevier Science B.V. All rights reserved.