Related papers: Recursive determinantal framework for testing D-st…
In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for…
Machine-learning technologies for learning dynamical systems from data play an important role in engineering design. This research focuses on learning continuous linear models from data. Stability, a key feature of dynamic systems, is…
The E(xplicit)I(implicit)N(null) method was developed recently to remove numerical instability from PDEs, adding and subtracting an operator $\mathcal{D}$ of arbitrary structure, treating the operator implicitly in one case, and explicitly…
The fastest known algorithms for dealing with structured matrices, in the sense of the displacement rank measure, are randomized. For handling classical displacement structures, they achieve the complexity bounds…
We propose matrix commutator based stability characterization for discrete-time switched linear systems under restricted switching. Given an admissible minimum dwell time, we identify sufficient conditions on subsystems such that a switched…
A discrete-time linear dynamical system (LDS) is given by an update matrix $M \in \mathbb{R}^{d\times d}$, and has the trajectories $\langle s, Ms, M^2s, \ldots \rangle$ for $s \in \mathbb{R}^d$. Reachability-type decision problems of…
Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…
We discuss in details a modified variational matrix-product-state algorithm for periodic boundary conditions, based on a recent work by P. Pippan, S.R. White and H.G. Everts, Phys. Rev. B 81, 081103(R) (2010), which enables one to study…
Learning a stable Linear Dynamical System (LDS) from data involves creating models that both minimize reconstruction error and enforce stability of the learned representation. We propose a novel algorithm for learning stable LDSs. Using a…
In this paper, we mainly study the robust stability of linear continuous systems with parameter uncertainties, a more general kind of uncertainties for system matrices is considered, i.e., entries of system matrices are rational functions…
Two new concepts, generic regular decomposition and regular-decomposition-unstable (RDU) variety for generic zero-dimensional systems, are introduced in this paper and an algorithm is proposed for computing a generic regular decomposition…
Detectability has been introduced as a generalization of state-estimation properties of discrete event systems studied in the literature. It asks whether the current and subsequent states of a system can be determined based on observations.…
In this paper we study the matrix completion problem: Suppose $X \in {\mathbb R}^{n_r \times n_c}$ is unknown except for a known upper bound $r$ on its rank. By measuring a small number $m \ll n_r n_c$ of elements of $X$, is it possible to…
We consider a class of matrices with a specific structure that arises, among other examples, in dynamic models for biological regulation of enzyme synthesis (Tyson and Othmer, 1978). We first show that a stability condition given in (Tyson…
In this work, we propose a novel dimensionality reduction technique, DiffRed, which first projects the data matrix, A, along first $k_1$ principal components and the residual matrix $A^{*}$ (left after subtracting its $k_1$-rank…
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…
Can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories? We tackle this black-box problem for switched linear systems. We show that, for any given random set of…
This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a…
We investigate the recovery of vectors from magnitudes of frame coefficients when the frames have a low redundancy, meaning a small number of frame vectors compared to the dimension of the Hilbert space. We first show that for vectors in d…
We propose a new technique for obtaining reduced order models for nonlinear dynamical systems. Specifically, we advocate the use of the recently developed Dynamic Mode Decomposition (DMD), an equation-free method, to approximate the…