相关论文: On some properties of contracting matrices

The flow of contracting systems contracts 1-dimensional parallelotopes, i.e., line segments, at an exponential rate. One reason for the usefulness of contracting systems is that many interconnections of contracting sub-systems yield an…

In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms…

In this paper we show how questions about operator algebras constructed from stochastic matrices motivate new results in the study of harmonic functions on Markov chains. More precisely, we characterize coincidence of conditional…

Motivated by a need to characterize transient behaviors in large network systems in terms of relevant signal norms and worst-case input scenarios, we propose a novel approach based on existing theory for matrix pseudospectra. We extend…

We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…

Strongly contracting dynamical systems have numerous properties (e.g., incremental ISS), find widespread applications (e.g., in controls and learning), and their study is receiving increasing attention. This work starts with the simple…

The existing matrix completion methods focus on optimizing the relaxation of rank function such as nuclear norm, Schatten-p norm, etc. They usually need many iterations to converge. Moreover, only the low-rank property of matrices is…

In his recent research M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can…

Symplectic self-adjointness of Hamiltonian operator matrices is studied, which arises in symplectic elasticity and optimal control. For the cases of diagonal domain and off-diagonal domain, necessary and sufficient conditions are shown. The…

Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…

Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…

We obtain a perfect sampling characterization of weak ergodicity for backward products of finite stochastic matrices, and equivalently, simultaneous tail triviality of the corresponding nonhomogeneous Markov chains. Applying these ideas to…

We consider generic i.e., forming an everywhere dense massive subset classes of Markov operators in the space $L^2(X,\mu)$ with a finite continuous measure. Since there is a canonical correspondence that associates with each Markov operator…

We consider a class of iterative numerical methods and introduce the notion of semiglobally, practically, strictly pseudogradient (SPSP) search directions. We demonstrate the relevance of the SPSP property in modelling a variety of…

A class of non-Hermitian quadratic su(2) Hamiltonians having an anti-linear symmetry is constructed. This is achieved by analysing the possible symmetries of such systems in terms of automorphisms of the algebra. In fact, different…

In this paper, we propose matrix-scaled consensus algorithms for linear dynamical agents interacting over an undirected network. Under the proposed algorithms, the state vectors of all agents to asymptotically agree up to some matrix…

Motivated by the theory of inhomogeneous Markov chains, we determine a sufficient condition for the convergence to 0 of a general product formed from a sequence of real or complex matrices. When the matrices have a common invariant subspace…

Algorithms for decentralized optimization and learning rely on local optimization steps coupled with combination steps over a graph. Recent works have demonstrated that using a time-varying sequence of matrices that achieves finite-time…

Sketching is a probabilistic data compression technique that has been largely developed in the computer science community. Numerical operations on big datasets can be intolerably slow; sketching algorithms address this issue by generating a…

Distributed optimization algorithms have been studied extensively in the literature; however, underlying most algorithms is a linear consensus scheme, i.e. averaging variables from neighbors via doubly stochastic matrices. We consider…