相关论文: Computationally efficient approximations of the jo…
In 2002 F. Wirth has proved that the joint spectral radius of irreducible compact sets of matrices is locally Lipschitz continuous as a function of the matrix set. In the paper, an explicit formula for the related Lipschitz constant is…
The numerical radius of a matrix is a scalar quantity that has many applications in the study of matrix analysis. Due to the difficulty in computing the numerical radius, inequalities bounding it have received a considerable attention in…
We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…
We study the finite-step realizability of the joint/generalized spectral radius of a pair of real $d\times d$ matrices, one of which has rank 1. Then we prove that there always exists a finite-length word for which there holds the spectral…
We give an effective bound of the joint spectral radius $\rho(\Sigma)$ for a finite set $\Sigma$ of nonnegative matrices: For every $n$, \[ \sqrt[n]{\left(\frac{V}{UD}\right)^{D} \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\in\Sigma}(A_1\dots…
To estimate the growth rate of matrix products $A_{n}\cdots A_{1}$ with factors from some set of matrices $\mathcal{A}$, such numeric quantities as the joint spectral radius $\rho(\mathcal{A})$ and the lower spectral radius…
Recently, several research efforts showed that the analysis of joint spectral characteristics of sets of matrices is greatly eased when these matrices share an invariant cone. In this short note we prove two new results in this direction.…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…
We consider the spectral radius of a large random matrix $X$ with independent, identically distributed entries. We show that its typical size is given by a precise three-term asymptotics with an optimal error term beyond the radius of the…
Consider a square random matrix with independent and identically distributed entries of mean zero and unit variance. We show that as the dimension tends to infinity, the spectral radius is equivalent to the square root of the dimension in…
In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral…
The competitive spectral radius extends the notion of joint spectral radius to the two-player case: two players alternatively select matrices in prescribed compact sets, resulting in an infinite matrix product; one player wishes to maximize…
This article presents an extended algorithm for computing the lower spectral radius of finite, non-negative matrix sets. Given a set of matrices $\mathcal{F} = \{A_1, \ldots, A_m\}$, the lower spectral radius represents the minimal growth…
We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is based on the analysis of the underlying switched system via inequalities imposed among multiple Lyapunov…
In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the…
In physics, it is sometimes desirable to compute the so-called \emph{Density Of States} (DOS), also known as the \emph{spectral density}, of a real symmetric matrix $A$. The spectral density can be viewed as a probability density…
The joint spectral radius of a finite set of real d x d matrices is defined to be the maximum possible exponential rate of growth of products of matrices drawn from that set. In previous work with K. G. Hare and J. Theys we showed that for…
We introduce the notion of \emph{joint spectrum} of a compact set of matrices $S \subset GL_d(\mathbb{C})$, which is a multi-dimensional generalization of the joint spectral radius. We begin with a thorough study of its properties (under…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
The joint spectral radius of a compact set of d-times-d matrices is defined ?to be the maximum possible exponential growth rate of products of matrices drawn from that set. In this article we investigate the ergodic-theoretic structure of…