๐”– Bobbio Scriptorium
โœฆ   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

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

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