On accuracy of approximation of the spectral radius by the Gelfand formula

Abstract

The famous Gelfand formula $\rho (A)={\mathrm{limsup}}_{n\to \infty }\Vert A^n{\Vert }^{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 substantially restricted by a lack of estimates for the rate of convergence of the quantities $\Vert A^n{\Vert }^{1/n}$ to $\rho (A)$. In the paper this deficiency is made up to some extent. By using the Bochi inequalities we establish explicit computable estimates for the rate of convergence of the quantities $\Vert A^n{\Vert }^{1/n}$ to $\rho (A)$. The obtained estimates are then extended for evaluation of the joint spectral radius of matrix sets.

Corrected typos, improved estimate for the kay constant in the paper, added references

References in corpus (1)

• Approximation of the joint spectral radius using sum of squares

Cited by in corpus (9)

• Faster Least Squares Optimization
• Tight last-iterate convergence rates for no-regret learning in multi-player games
• Skip-Sliding Window Codes
• On the joint spectral radius of nonnegative matrices
• SLIP: Learning to Predict in Unknown Dynamical Systems with Long-Term Memory
• Neural Multigrid Architectures
• Fast Convex Quadratic Optimization Solvers with Adaptive Sketching-based Preconditioners
• Stability of linear switching systems and Markov-Bernstein inequalities for exponents
• Direct optimization of BPX preconditioners