A butterfly subdivision scheme for surface interpolation with tension control
ACM Transactions on Graphics (TOG)
Ten lectures on wavelets
Two-scale difference equations II. local regularity, infinite products of matrices and fractals
SIAM Journal on Mathematical Analysis
Characterization of Lp-solutions for the two-scale dilation equations
SIAM Journal on Mathematical Analysis
Convex Optimization
Computationally Efficient Approximations of the Joint Spectral Radius
SIAM Journal on Matrix Analysis and Applications
Optimality of multilevel preconditioning for nonconforming P1 finite elements
Numerische Mathematik
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
SIAM Journal on Matrix Analysis and Applications
Analysis of the joint spectral radius via lyapunov functions on path-complete graphs
Proceedings of the 14th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
The $p$-radius characterizes the average rate of growth of norms of matrices in a multiplicative semigroup. This quantity has found several applications in recent years. We raise the question of its computability. We prove that the complexity of its approximation increases exponentially with $p$. We then describe a series of approximations that converge to the $p$-radius with a priori computable accuracy. For nonnegative matrices, this gives efficient approximation schemes for the $p$-radius computation.