ISSN:
1435-568X
Schlagwort(e):
Lyapunov exponent
;
Lyapunov indicator
;
Joint spectral radius
;
Generalized spectral radius
;
Discrete differential inclusion
;
Computational complexity
;
NP-hard
;
Algorithmic solvability
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Elektrotechnik, Elektronik, Nachrichtentechnik
,
Mathematik
,
Technik allgemein
Notizen:
Abstract We analyze the computability and the complexity of various definitions of spectral radii for sets of matrices. We show that the joint and generalized spectral radii 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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01219774
Permalink