Characterization of joint spectral radius via trace (Q1583724): Difference between revisions
From MaRDI portal
Latest revision as of 16:00, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterization of joint spectral radius via trace |
scientific article |
Statements
Characterization of joint spectral radius via trace (English)
0 references
15 October 2001
0 references
For a bounded set \(\Sigma\) of square matrices the joint spectral radius \(\rho(\Sigma)\) is defined as the limit superior of the supremum over the set \({\mathcal {L}}_n\) of all matrix products of length \(n\) from the collection \(\Sigma\) of the \(n^{th}\) root of the product matrix norm, while the joint generalized spectral radius \(\widetilde \rho(\Sigma)\) is the same expression involving the spectral radii of the matrix products instead. Inequalities such as \(\sup \rho (A)^{1/n} \leq \widetilde \rho(\Sigma) \leq \rho(\Sigma) \leq \sup \|A\|^{1/n}\) are known. For a finite set \(\Sigma\) of matrices this paper establishes that \(\rho(\Sigma) = \limsup\limits _{n \to \infty} \sup \limits_{A \in {\mathcal {L}}_n} |{trace}(A)|^{1/n}\) and gives estimates for the joint spectral radius for sets generated by two matrices in terms of the trace. These concepts apply to cascade algorithms for wavelets with compact support.
0 references
joint spectral radius
0 references
trace
0 references
wavelet
0 references
matrix products
0 references
inequalities
0 references
cascade algorithms
0 references
0 references
0 references