Abstract
AbstractIn this note, we introduce the asymptotic subspace confinement problem, generalizing the usual concept of convergence in discrete-time linear systems. Instead of precise convergence, subspace confinement only requires the convergence of states to a certain subspace of the state space, offering useful flexibility and applicability. We establish a criterion for deciding the asymptotic subspace confinement, drawing upon a general finiteness result for the infinite product of matrices. Our results indicate that the asymptotic subspace confinement problem is algorithmically decidable when an invariant subspace for the set of matrices and some polytope norms are given.
Funder
National Natural Science Foundation of China
Science and Technology Commission of Shanghai Municipality
Subject
Applied Mathematics,General Mathematics
Reference40 articles.
1. L1${L^{1}}$ group consensus of multi-agent systems with switching topologies and stochastic inputs;Phys. Lett. A,2013
2. Finding extremal complex polytope norms for families of real matrices;SIAM J. Matrix Anal. Appl.,2009
3. A switched system approach to the decidability of consensus;21st International Symposium on Mathematical Theory of Networks and Systems,2014
4. On the degree sequence of random geometric digraphs;Appl. Math. Sci.,2010
5. Finding extremal complex polytope norms for families of real matrices;SIAM J. Matrix Anal. Appl.,2009
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献