On accuracy of approximation of the spectral radius by the Gelfand formula
arXiv:0810.2856 · doi:10.1016/j.laa.2009.07.008
Abstract
The famous Gelfand formula 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 to . 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 to . The obtained estimates are then extended for evaluation of the joint spectral radius of matrix sets.
arXiv commentCorrected typos, improved estimate for the kay constant in the paper, added references
References in corpus (3)
Cited by in corpus (13)
- Iterative building of Barabanov norms and computation of the joint spectral radius for matrix sets
- Estimation of the Spatial Weighting Matrix for Spatiotemporal Data under the Presence of Structural Breaks
- Faster Least Squares Optimization
- Tight last-iterate convergence rates for no-regret learning in multi-player games
- Preconditioning complex symmetric linear systems
- On the joint spectral radius of nonnegative matrices
- Skip-Sliding Window Codes
- Neural Multigrid Architectures
- SLIP: Learning to Predict in Unknown Dynamical Systems with Long-Term Memory
- Max-relaxation iteration procedure for building of Barabanov norms: convergence and examples
- 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