首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
We study the finite-step realizability of the joint/generalized spectral radius of a pair of real square matrices S1 and S2, one of which has rank 1, where 2?d<+. Let ρ(A) denote the spectral radius of a square matrix A. Then we prove that there always exists a finite-length word (i11,,im1){1,2}m, for some finite m?1, such thatρSi11?Sim1m=supn?1max(i1,,in){1,2}nρ(Si1?Sin)n.In other words, there holds the spectral finiteness property for {S1,S2}. Explicit formula for computation of the joint spectral radius is derived. This implies that the stability of the switched system induced by {S1,S2} is algorithmically decidable in this case.  相似文献   

14.
The grand Furuta inequality has the following satellite (SGF;t[0,1]), given as a mean theoretic expression:A?B>0,t[0,1]?A-r+t#1-t+r(p-t)s+r(At?sBp)?Bforr?t;p,s?1,where #α is the α-geometric mean and ?s (s?[0,1]) is a formal extension of #α. It is shown that (SGF; t[0,1]) has the Löwner–Heinz property, i.e. (SGF; t=1) implies (SGF;t) for every t[0,1]. Furthermore, we show that a recent further extension of (GFI) by Furuta himself has also the Löwner–Heinz property.  相似文献   

15.
16.
17.
18.
Let R be an arbitrary integral domain, let ={λ1,,λn} be a multiset of elements of R, let σ be a permutation of {1,,k} let n1,,nk be positive integers such that n1+?+nk=n, and for r=1,,k let ArRnr×nσ(r). We are interested in the problem of finding a block matrix Q=Qrsr,s=1kRn×n with spectrum Λ and such that Qrσ(r)=Ar for r=1,,k. Cravo and Silva completely characterized the existence of such a matrix when R is a field. In this work we construct a solution matrix Q that solves the problem when R is an integral domain with two exceptions: (i) k=2; (ii) k3, σ(r)=r and nr>n/2 for some r.What makes this work quite unique in this area is that we consider the problem over the more general algebraic structure of integral domains, which includes the important case of integers. Furthermore, we provide an explicit and easy to implement finite step algorithm that constructs an specific solution matrix (we point out that Cravo and Silva’s proof is not constructive).  相似文献   

19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号