非负不可约矩阵Perron根的新下界

给出了非负不可约矩阵Perron根的一些新下界.特别的,若矩阵对角元素均相同,设为a,则(?)该结果易于计算且优于相关文献的下界.     

非负矩阵Perron根上界序列

给出了非负矩阵Perron根的一系列优化上界,即通过相似对角变换与Gerschgorin定理较好的估计了Perron根的上界,并且通过例子来说明这种方法的有效性．     

非负矩阵Perron根的上界序列

1引言本文讨论非负矩阵Perron根的上界。设     

非负不可约矩阵Perron根的上界序列

给出了非负不可约矩阵Perron根的新上界序列,并指出该序列是收敛到Perron根的,最后给出两个数值例子加以说明,并与文献[1,3,6]中的结论进行了比较．     

非负矩阵的Perron补与Perron根的估计

对于非负矩阵A,主要讨论其谱半径即Perron根的估计.这里提出了一种利用非负矩阵的Perron补矩阵与Perron根关系来估计其Perron根上下界的新方法,并且给出例子来说明这种方法的有效性.     

关于非负矩阵Perron特征值的上、下界

本文通过构造一可逆矩阵,对一类非负矩阵A进行若干次简单的相似变换,便可同时得到矩阵A之Perron特征值的较好的上、下界.     

非负矩阵Perron根上界序列(英文)

给出了非负矩阵Perron根的一系列优化上界,即通过相似对角变换与Gerschgorin定理较好的估计了Perron根的上界,并且通过例子来说明这种方法的有效性.     

非负不可约矩阵Perron根新的下界序列

Estimate bounds for the Perron root of a nonnegative matrix are important in theory of nonnegative matrices. It is more practical when the bounds are expressed as an easily calculated function in elements of matrices. For the Perron root of nonnegative irreducible matrices, three sequences of lower bounds are presented by means of constructing shifted matrices, whose convergence is studied. The comparisons of the sequences with known ones are supplemented with a numerical example.     

非负矩阵Perron根的上下界

1.引言 本文主要讨论非负矩阵,我们将用B≥0和B>0分别表示矩阵B是非负的和正的,也就是B的每一个元素是非负的和B的每一个元素是正的.用p(B)表示方阵B的谱半径,当B≥0时,p(B)也就是B的perron根. 设(n)={1,2,…,n},A=(ai,j)是n×n非负矩阵,我们称     

非负矩阵Perron根的上界

文章针对特殊的非负矩阵，应月简单的相似变换，使矩阵保持非负性且最大行和减小，从而得到行和为正非负矩阵Perron根的新上界．     

Upper and lower bounds for the Perron root of a nonnegative matrix

We derive upper and lower bounds for the Perron root of a nonnegative matrix by using generalized Gershgorin inclusion regions. Our bounds seem particularly effective for certain sparse matrices.     

A modified algorithm for the Perron root of a nonnegative matrix

An algorithm of diagonal transformation for the Perron root of nonnegative matrices is proposed by Duan and Zhang [F. Duan, K. Zhang, An algorithm of diagonal transformation for Perron root of nonnegative irreducible matrices, Appl. Math. Comput. 175 (2006) 762-772]. This method can be used for all nonnegative irreducible matrices. In this paper, an improved algorithm which is based on this method is proposed. The new algorithm inherits all the above-mentioned advantages of the original algorithm and has higher efficiency. It is testified by numerical testing that the efficiency of the new algorithm is improved greatly.     

New bounds for Perron root of a nonnegative matrix

In this paper, we obtain some new bounds for Perron root of a nonnegative matrix, which are expressed by easily calculated function in element of matrix. These new results generalize and improve the bounds of G. Frobenius [1] and H. Minc [2], and also extend the known results by Liu [6].