On the accuracy of the ellipsoid norm approximation of the joint spectral radius
โ Scribed by Vincent D. Blondel; Yurii Nesterov; Jacques Theys
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 260 KB
- Volume
- 394
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is notoriously difficult to compute and to approximate. We introduce in this paper an approximation ฯ that is based on ellipsoid norms, that can be computed by convex optimization, and that is such that the joint spectral radius belongs to the interval [ ฯ/ โ n, ฯ], where n is the dimension of the matrices. We also provide a simple approximation for the special case where the entries of the matrices are non-negative; in this case the approximation is proved to be within a factor at most m (m is the number of matrices) of the exact value.
๐ SIMILAR VOLUMES
The notion of spectral radius of a set of matrices is a natural extension of spectral radius of a single matrix. The finiteness conjecture (FC) claims that among the infinite products made from the elements of a given finite set of matrices, there is a certain periodic product, made from the repetit
Let M + n be the set of entrywise nonnegative n ร n matrices. Denote by r(A) the spectral radius (Perron root) of A โ M + n . Characterization is obtained for maps f : In particular, it is shown that such a map has the form for some S โ M + n with exactly one positive entry in each row and each co