2011
DOI: 10.1137/090777906
|View full text |Cite
|
Sign up to set email alerts
|

Fast Methods for Computing thep-Radius of Matrices

Abstract: Abstract. 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 28 publications
0
12
0
Order By: Relevance
“…Thus, without being explicitly stated, we assume that probability distributions appearing in this paper have a bounded support. Though in general the computation of p-radius is a difficult problem [11], the next simple formula for p-radius is available under certain assumptions. .…”
Section: Joint Spectral Characteristicsmentioning
confidence: 99%
See 2 more Smart Citations
“…Thus, without being explicitly stated, we assume that probability distributions appearing in this paper have a bounded support. Though in general the computation of p-radius is a difficult problem [11], the next simple formula for p-radius is available under certain assumptions. .…”
Section: Joint Spectral Characteristicsmentioning
confidence: 99%
“…In this case there exists > 0 such that H(M, M r ) > for every r > 0. By the definition of the Hausdorff metric (11)…”
Section: Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper we propose novel lower bounds on the p-radius for integer values of p with no assumptions on the given set of matrices on the contrary to [2,8]. The lower bounds are given as the spectral radius of a weighted average of the given matrices and the weights are realized by Kronecker product of matrices.…”
Section: Introductionmentioning
confidence: 99%
“…For instance, for a two‐regime model, if the transition probabilities are symmetric (p11=p22=1false/2), the limit of uk when k tends to infinity exactly corresponds to the 1‐radius of false{normalΓ1−1,normalΓ2−1false}. We refer to Jungers and Protasov () for a detailed presentation of this quantity. The complexity of these concepts is therefore well known in control theory.…”
mentioning
confidence: 99%