The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate (Q1367098)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate |
scientific article; zbMATH DE number 1062600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate |
scientific article; zbMATH DE number 1062600 |
Statements
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate (English)
0 references
12 May 1998
0 references
The authors show that the joint spectral radius and the generalized spectral radius of two integer matrices are not approximable in polynomial time, and that two related quantities -- the lower spectral radius and the largest Lyapunov exponent -- are not algorithmically approximable. Some applications of these results are discussed.
0 references
Lyapunov exponent
0 references
joint spectral radius
0 references
generalized spectral radius
0 references
computational complexity
0 references
0 references
0 references
0.8660617470741272
0 references
0.836825966835022
0 references
0.8365275859832764
0 references
0.8178149461746216
0 references
