Abstract
Abstract In 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
