Related papers: Minimality and identifiability of discrete-time SA…
We present a procedure for reducing the number of continuous states of discrete-time linear switched systems, such that the reduced system has the same behavior as the original system for a subset of switching sequences. The proposed method…
This paper presents a system identification technique for systems whose output is asymptotically periodic under constant inputs. The model used for system identification is a discrete-time Lur'e model consisting of asymptotically stable…
This paper deals with dynamic networks in which the causality relations between the vertex signals are represented by linear time-invariant transfer functions (modules). Considering an acyclic network where only a subset of its vertices are…
We propose an extended framework for marginalized domain adaptation, aimed at addressing unsupervised, supervised and semi-supervised scenarios. We argue that the denoising principle should be extended to explicitly promote domain-invariant…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set…
We here characterize the minimality of realization of arbitrary linear time-invariant dynamical systems through (i) intersection of the spectra of the realization matrix and of the corresponding state submatrix and (ii) moving the poles by…
This paper proposes a novel method for designing finite-horizon discrete-valued switching signals in linear switched systems based on discreteness-promoting regularization. The inherent combinatorial optimization problem is reformulated as…
We investigate the stabilizability of discrete-time linear switched systems, when the sole control action of the controller is the switching signal, and when the controller has access to the state of the system in real time. Despite their…
This paper addresses a system identification for linear periodically time-varying plants in the discrete-time setting. A system identification algorithm for linear, periodically time-varying plants is introduced based on a cyclic…
The classical sparse parameter identification methods are usually based on the iterative basis selection such as greedy algorithms, or the numerical optimization of regularized cost functions such as LASSO and Bayesian posterior probability…
This paper leverages recent advances in high derivatives reconstruction from noisy-time series and sparse multivariate polynomial identification in order to improve the process of parsimoniously identifying, from a small amount of data,…
This paper proposes a general switching dynamical system model, and a custom majorization-minimization-based algorithm EM++ for identifying its parameters. For certain families of distributions, such as Gaussian distributions, this…
This paper studies controllability of a discrete-time linear dynamical system using nonnegative and sparse inputs. These constraints on the control input arise naturally in many real-life systems where the external influence on the system…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
Consider an n-dimensional linear system where it is known that there are at most k<n non-zero components in the initial state. The observability problem, that is the recovery of the initial state, for such a system is considered. We obtain…
The focus of this paper is on linear system identification in the setting where it is known that the underlying partially-observed linear dynamical system lies within a finite collection of known candidate models. We first consider the…
The problems of observability and identifiability have been of great interest as previous steps to estimating parameters and initial conditions of dynamical systems to which some known data (observations) are associated. While most works…
A space is called minimal if it admits a minimal continuous selfmap. We give examples of metrizable continua $X$ admitting both minimal homeomorphisms and minimal noninvertible maps, whose squares $X\times X$ are not minimal, i.e., they…