Related papers: Computationally efficient approximations of the jo…
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach is based on a search for an SOS polynomial that proves…
The problem of computation of the joint (generalized) spectral radius of matrix sets has been discussed in a number of publications. In the paper an iteration procedure is considered that allows to build numerically Barabanov norms for the…
In this paper we study the joint/generalized spectral radius of a finite set of matrices in terms of its rank-one approximation by singular value decomposition. In the first part of the paper, we show that any finite set of matrices with at…
The joint spectral radius (JSR) of a set of matrices characterizes the maximal asymptotic growth rate of an infinite product of matrices of the set. This quantity appears in a number of applications including the stability of switched and…
In distributed optimization or Nash-equilibrium seeking over directed graphs, it is crucial to find a matrix norm under which the disagreement of individual agents' states contracts. In existing results, the matrix norm is usually defined…
In various problems of control theory, non-autonomous and multivalued dynamical systems, wavelet theory and other fields of mathematics information about the rate of growth of matrix products with factors taken from some matrix set plays a…
The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this approach is evaluated in comparison to existing and related…
In this paper we show a characterization of the joint spectral radius of a set of matrices as the limit of the $p$-radius of an associated probability distribution when $p$ tends to $\infty$. Allowing the set to have infinitely many…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
Our aim is to study matrix polynomials over max-algebras and their growth in terms of a max-induced semi-norm. We investigate the relationship between the asymptotic growth of polynomial products and the joint spectral radius of the…
This paper studies the constrained switching (linear) system which is a discrete-time switched linear system whose switching sequences are constrained by a deterministic finite automaton. The stability of a constrained switching system is…
We address the problem of the exact computation of two joint spectral characteristics of a family of linear operators, the joint spectral radius (in short JSR) and the lower spectral radius (in short LSR), which are well-known different…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
In several papers of 2013 - 2016, Guglielmi and Protasov made a breakthrough in the problem of the joint spectral radius computation, developing the invariant polytope algorithm which for most matrix families finds the exact value of the…
The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being…
The famous Gelfand formula $\rho(A)= \limsup_{n\to\infty}\|A^{n}\|^{1/n}$ for the spectral radius of a matrix is of great importance in various mathematical constructions. Unfortunately, the range of applicability of this formula is…
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.
A new method of matrix spectral factorization is proposed which reliably computes an approximate spectral factor of any matrix spectral density that admits spectral factorization
The joint spectral radius (JSR) of a set of matrices characterizes the maximal asymptotic growth rate of an infinite product of matrices of the set. This quantity appears in a number of applications including the stability of switched and…