Abstract
We study the finite-step realizability of the joint/generalized spectral radius of a pair of real matrices, one of which has rank 1. Then we prove that there always exists a finite-length word for which there holds the spectral finiteness property for the set of matrices under consideration. This implies that stability is algorithmically decidable in our case.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.