Let A∈C<sup>m×n</sup>,set eigenvalues of matrix A with |λ<sub>1</sub> （A）|≥|λ<sub>2</sub>（A）|≥…≥|λ<sub>n</sub>（A）|,write A≥0 if A is a positive semid...Let A∈C<sup>m×n</sup>,set eigenvalues of matrix A with |λ<sub>1</sub> （A）|≥|λ<sub>2</sub>（A）|≥…≥|λ<sub>n</sub>（A）|,write A≥0 if A is a positive semidefinite Hermitian matrix, and denote∧<sub>k</sub> （A）=diag （λ<sub>1</sub>（A）,…,λ<sub>k</sub>（A））,∧<sub>(</sub>（n-k）.（A）=diag (λ<sub>k+1</sub>（A）,…,λ<sub>n</sub>（A）)for any k=1, 2,...,n if A≥0. Denote all n order unitary matrices by U<sup>n×n</sup>.Problem of equalities to hold in eigenvalue inequalities for products of matrices展开更多
In 2011,Liu,et al.investigated the structural controllability of directed networks.They proved that the minimum number of input signals,driver nodes,can be determined by seeking a maximum matching in the directed netw...In 2011,Liu,et al.investigated the structural controllability of directed networks.They proved that the minimum number of input signals,driver nodes,can be determined by seeking a maximum matching in the directed network.Thus,the algorithm for seeking a maximum matching is the key to solving the structural controllability problem of directed networks.In this study,the authors provide algebraic expressions for matchings and maximum matchings proposed by Liu,et al.(2011)via a new matrix product called semi-tensor product,based on which the corresponding algorithms are established to seek matchings and maximum matchings in digraphs,which make determining the number of driver nodes tractable in computer.In addition,according to the proposed algorithm,the authors also construct an algorithm to distinguish critical arcs,redundant arcs and ordinary arcs of the directed network,which plays an important role in studying the robust control problem.An example of a small network from Liu’s paper is used for algorithm verification.展开更多
基金Supported partly by National Natural Science Foundation of China
文摘Let A∈C<sup>m×n</sup>,set eigenvalues of matrix A with |λ<sub>1</sub> （A）|≥|λ<sub>2</sub>（A）|≥…≥|λ<sub>n</sub>（A）|,write A≥0 if A is a positive semidefinite Hermitian matrix, and denote∧<sub>k</sub> （A）=diag （λ<sub>1</sub>（A）,…,λ<sub>k</sub>（A））,∧<sub>(</sub>（n-k）.（A）=diag (λ<sub>k+1</sub>（A）,…,λ<sub>n</sub>（A）)for any k=1, 2,...,n if A≥0. Denote all n order unitary matrices by U<sup>n×n</sup>.Problem of equalities to hold in eigenvalue inequalities for products of matrices
基金supported by the National Natural Science Foundation of China under Grant Nos.61573288,12071370,U1803263,71973103Key Programs in Shaanxi Province of China under Grant No.2021JZ-12。
文摘In 2011,Liu,et al.investigated the structural controllability of directed networks.They proved that the minimum number of input signals,driver nodes,can be determined by seeking a maximum matching in the directed network.Thus,the algorithm for seeking a maximum matching is the key to solving the structural controllability problem of directed networks.In this study,the authors provide algebraic expressions for matchings and maximum matchings proposed by Liu,et al.(2011)via a new matrix product called semi-tensor product,based on which the corresponding algorithms are established to seek matchings and maximum matchings in digraphs,which make determining the number of driver nodes tractable in computer.In addition,according to the proposed algorithm,the authors also construct an algorithm to distinguish critical arcs,redundant arcs and ordinary arcs of the directed network,which plays an important role in studying the robust control problem.An example of a small network from Liu’s paper is used for algorithm verification.
