非负矩阵Perron根的下界序列

非负矩阵Perron根的估计是非负矩阵理论研究的重要课题之一.如果其上下界能够表示为非负矩阵元素的易于计算的函数,那么这种估计价值更高.本文结合非负矩阵的迹分两种情况给出Perron根的下界序列,并且给出数值例子加以说明.     

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

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

非负矩阵Perron根上界序列

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

非负不可约矩阵Perron根的估计

给出了非负不可约矩阵Perron根的一些上下界估计,设A为任意非负不可约矩阵,ρ(A)为其Perron根,则ρ(A)≤max{D_k,(r_1+r_2+…r_k)/k}其中D_k为矩阵A所有k阶主子阵之列和最大值,r_1≥r_2≥…≥r_n为从大到小排序的行和,所得结果易于计算且较经典的Frobienus界值精确.同时也得到一个类似下界.     

逆N_0-矩阵Perron余的相关结果

1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵Perron余的概念.将非负不可约矩阵Perron余的概念推广到逆N_0-矩阵的Perron余,并给出关于N_0-矩阵和逆N_0-矩阵的相关不等式.     

非负不可约矩阵的广义Perron补矩阵

1989年Meyor为计算马尔可夫链的平稳分布向量构造了一个算法，首次提出非负不可约矩阵的Perron补矩阵的概念，本给出非负不可约矩阵A的广义Perron补矩阵若干性质，并且证明若矩阵A是不可约逆M-矩阵，其广义Perron补矩阵也是不可约逆M-矩阵。     

关于非负不可约矩阵的广义Perron补的一些性质

1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法，首次提出非负不可约矩阵的Perron补的概念。本文给出非负不可约矩阵A的广义Perron补若干性质，并且证明当矩阵A是不可约逆M-矩阵，其广义Perron补也是不可约逆M-矩阵。     

非负矩阵Perron根的上界

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

计算非负不可约矩阵Perron根的对角变换(英文)

计算非负矩阵Perron根一般通过矩阵的对角变换,但是有的时候是不可行的.本文为非负不可约矩阵的计算给了一列对角变换.此种变换对所有的非负不可约矩阵实用,并且方便计算,最后给出了数值例子.     

不可约逆M-矩阵的广义Perron补

1989年,Meyor为计算马尔可夫链的平稳分布向量构造了一个算法,提出了非负不可约矩阵的Perron补矩阵的概念,2002年Linzhang Lu提出了的广义Perron补矩阵.本文推广了Neuman的结果得到了关于不可约逆M-矩阵广义Perron补矩阵的几个性质.     

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.     

非负不可约矩阵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.     

Bounds for the Perron root, singularity/nonsingularity conditions, and eigenvalue inclusion sets

Using a unified approach based on the monotonicity property of the Perron root and its circuit extension, a series of exact two-sided bounds for the Perron root of a nonnegative matrix in terms of paths in the associated directed graph is obtained. A method for deriving the so-called mixed upper bounds is suggested. Based on the upper bounds for the Perron root, new diagonal dominance type conditions for matrices are introduced. The singularity/nonsingularity problem for matrices satisfying such conditions is analyzed, and the associated eigenvalue inclusion sets are presented. In particular, a bridge connecting Gerschgorin disks with Brualdi eigenvalue inclusion sets is found. Extensions to matrices partitioned into blocks are proposed.