The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate (Q1367098): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01219774 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978242229 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate |
scientific article |
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
