Mathematics – Optimization and Control
Scientific paper
2011-06-05
Mathematics
Optimization and Control
14 pages, 61 bibliography references
Scientific paper
We study the finite-step realizability of the joint/generalized spectral
radius of a pair of real $d\times d$ 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.
No associations
LandOfFree
The finite-step realizability of the joint spectral radius of a pair of $d\times d$ matrices one of which being rank-one does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The finite-step realizability of the joint spectral radius of a pair of $d\times d$ matrices one of which being rank-one, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The finite-step realizability of the joint spectral radius of a pair of $d\times d$ matrices one of which being rank-one will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-307135