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 int
โฆ LIBER โฆ
On accuracy of approximation of the spectral radius by the Gelfand formula
โ Scribed by Victor Kozyakin
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 140 KB
- Volume
- 431
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the accuracy of the ellipsoid norm ap
โ
Vincent D. Blondel; Yurii Nesterov; Jacques Theys
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 260 KB
Approximation of the joint spectral radi
โ
Pablo A. Parrilo; Ali Jadbabaie
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 233 KB
On the spectral radius of graphs
โ
Aimei Yu; Mei Lu; Feng Tian
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 190 KB
The Spectral Radius of Graphs on Surface
โ
M.N. Ellingham; Xiaoya Zha
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 152 KB
This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th
On the accuracy of normal approximation
โ
V.V Sazonov; V.V Ulyanov
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 458 KB
On the spectral radius of (0,1)-matrices
โ
R.A. Brualdi; A.J. Hoffman
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 613 KB