A hybrid approach to joint spectral radius computation

In this paper we propose a new method to determine the joint spectral radius of a finite set of real matrices by verifying that a given family of candidates actually consists of spectrum maximizing products. Our algorithm aims at constructing a finite set-valued tree according to the approach of Möl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Linear algebra and its applications
Hauptverfasser:	Mejstrik, Thomas, Reif, Ulrich
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.07.2025
Schlagworte:	Exact computation Finite tree algorithm Invariant polytope algorithm Joint spectral radius Pseudo spectral radius Pseudo spectral radius Finite tree algorithm 15-04 Joint spectral radius Invariant polytope algorithm 90C90 Exact computation 15A60 15A18
ISSN:	0024-3795
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper we propose a new method to determine the joint spectral radius of a finite set of real matrices by verifying that a given family of candidates actually consists of spectrum maximizing products. Our algorithm aims at constructing a finite set-valued tree according to the approach of Möller and Reif using a norm that is constructed in the spirit of the invariant polytope algorithm. This combines the broad range of applicability of the first algorithm with the efficiency of the latter. •Novel approach for joint spectral radius computation.•Algorithm remains rigorous.•Algorithm has more general termination guarantees than classical invariant polytope algorithm.
ISSN:	0024-3795
DOI:	10.1016/j.laa.2025.06.024