Fast Methods for Computing thep-Radius of Matrices

DOI10.1137/090777906zbMath1236.65036OpenAlexW1992482642MaRDI QIDQ3103513

Vladimir Yu. Protasov, Raphaël M. Jungers

Publication date: 7 December 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090777906

zbMATH Keywords

approximation algorithmjoint spectral radiusconic programming\(p\)-radiussmoothness in \(L_p\) spaces

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Semidefinite programming (90C22) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Related Items (6)

Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems ⋮ An inequality for the matrix pressure function and applications ⋮ Generalized joint spectral radius and stability of switching systems ⋮ Monetary policy switching and indeterminacy ⋮ A limit formula for joint spectral radius with \(p\)-radius of probability distributions ⋮ Fast Approximation of the $p$-Radius, Matrix Pressure, or Generalized Lyapunov Exponent for Positive and Dominated Matrices

This page was built for publication: Fast Methods for Computing thep-Radius of Matrices