Graphs and controllability completion problems

DOI10.1016/S0024-3795(01)00236-1MaRDI QIDQ5946188zbMATH OpenFDO

Authors Cristina Jordán, Juan Ramón Torregrosa Sánchez, Ana M. Urbano

Publication date 10 April 2002

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(01)00236-1

zbMATH Keywords

completioncontrollabilitygraph theorypartial matrix

Mathematics Subject Classification ID

Applications of graph theory (05C90) Basic linear algebra (15A99) Controllability (93B05)

Review text

Suppose \(A=[a_{ij}]\) is an \(n\times n\) partially specified matrix (some entries are unspecified) and \(b\) is an \(n\times 1\) vector. In this instance, the controllability completion problem concerns the ability to choose values for the unspecified entries of \(A\), thus obtaining a completion \(A_c\) of \(A\), such that \((A_c,b)\) is a completely controllable pair. Let \(G_A\) be the graph on \(n\) vertices having edges \((i,j)\) if and only if \(a_{ij}\) is specified. The authors find sufficient conditions for the existence of \(A_c\) when the specified entries of \(A\) are symmetrically placed and \(G_A\) is a path, cycle or, more generally, a graph whose vertices have degree at most \(2\). Analogous results are obtained in the non-symmetric case of specified entries.

Recommendations

• Controllability by completions of partial upper triangular matrices
• Controllability of partially prescribed matrices
• On controllability of partially prescribed matrices
• Characteristic polynomials and controllability of partially prescribed matrices
• Controllability completion problems of partial upper triangular matrices^∗

Cites work

• Controllability by completions of partial upper triangular matrices
• Controllability completion problems of partial upper triangular matrices^∗
• scientific article; zbMATH DE number 486483 (Why is no real title available?)

Cited in

(11)

• Controllability and completion of partial upper triangular matrices over rings
• \(r\)-numbers completion problems of partial upper canonical form. I
• Constructing a controllable graph under edge constraints
• Linear control of live marked graphs
• scientific article; zbMATH DE number 3943036 (Why is no real title available?)
• scientific article; zbMATH DE number 4090811 (Why is no real title available?)
• scientific article; zbMATH DE number 3693175 (Why is no real title available?)
• scientific article; zbMATH DE number 1182741 (Why is no real title available?)
• Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
• Controllability of certain real symmetric matrices with application to controllability of graphs
• Further results on almost controllable graphs

This page was built for publication: Graphs and controllability completion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946188)