Graphs and controllability completion problems

Authors
Jordan, C Torregrosa, JR Urbano, AM
Citation
C. Jordan et al., Graphs and controllability completion problems, LIN ALG APP, 332, 2001, pp. 355-370
Citations number
5
Categorie Soggetti
Mathematics
Journal title
LINEAR ALGEBRA AND ITS APPLICATIONS
ISSN journal
00243795 → ACNP
Volume
332
Year of publication
2001
Pages
355 - 370
Database
ISI
SICI code
0024-3795(20010801)332:<355:GACCP>2.0.ZU;2-O
Abstract
In this paper we are interested in the controllability completion problem w hen some assumptions about the graph associated with the specified entries of the partial matrix are made. We analyze combinatorially and noncombinato rially symmetric partial matrices when their graphs are cycles or paths. No ncombinatorially symmetric partial matrices with acyclic directed graphs ar e also studied. (C) 2001 Elsevier Science Inc. All rights reserved.