共查询到18条相似文献,搜索用时 93 毫秒
1.
计算非负矩阵Perron根一般通过矩阵的对角变换,但是有的时候是不可行的.本文为非负不可约矩阵的计算给了一列对角变换.此种变换对所有的非负不可约矩阵实用,并且方便计算,最后给出了数值例子. 相似文献
2.
李华 《数学的实践与认识》2007,37(13)
1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵的Perron补的概念.在非负不可约矩阵的广义Perron补若干性质的基础上,给出逆N0-矩阵的几个性质. 相似文献
3.
李华 《数学的实践与认识》2007,37(13):163-166
1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵的Perron补的概念.在非负不可约矩阵的广义Perron补若干性质的基础上,给出逆N0-矩阵的几个性质. 相似文献
4.
钟琴 《数学的实践与认识》2010,40(19)
1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵Perron余的概念.将非负不可约矩阵Perron余的概念推广到逆N_0-矩阵的Perron余,并给出关于N_0-矩阵和逆N_0-矩阵的相关不等式. 相似文献
5.
1989年Meyor为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵的Perron补矩阵的概念,本给出非负不可约矩阵A的广义Perron补矩阵若干性质,并且证明若矩阵A是不可约逆M-矩阵,其广义Perron补矩阵也是不可约逆M-矩阵。 相似文献
6.
关于非负不可约矩阵的广义Perron补的一些性质 总被引:2,自引:0,他引:2
1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵的Perron补的概念。本文给出非负不可约矩阵A的广义Perron补若干性质,并且证明当矩阵A是不可约逆M-矩阵,其广义Perron补也是不可约逆M-矩阵。 相似文献
7.
1989年,Meyor为计算马尔可夫链的平稳分布向量构造了一个算法,提出了非负不可约矩阵的Perron补矩阵的概念,2002年Linzhang Lu提出了的广义Perron补矩阵.本文推广了Neuman的结果得到了关于不可约逆M-矩阵广义Perron补矩阵的几个性质. 相似文献
8.
9.
非负矩阵谱半径的新界值 总被引:2,自引:0,他引:2
岳嵘 《数学的实践与认识》2009,39(17)
讨论n×n阶非负矩阵的谱半径估计,给出估计其界值的新方法,该方法易于计算且能得到比"非负不可约矩阵谱半径的估计"一文中精确度更高的界,并用数值例子验证了这种方法的有效性. 相似文献
10.
11.
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. 相似文献
12.
L.Yu. Kolotilina 《Linear algebra and its applications》2008,429(10):2521-2539
The paper considers the sharpness problem for certain two-sided bounds for the Perron root of an irreducible nonnegative matrix. The results obtained are applied to prove the sharpness of the related eigenvalue inclusion sets in classes of matrices with fixed diagonal entries, bounded above deleted absolute row sums, and a partly specified irreducible sparsity pattern. 相似文献
13.
We give upper and lower bounds for the spectral radius of a nonnegative matrix using its row sums and characterize the equality cases if the matrix is irreducible. Then we apply these bounds to various matrices associated with a graph, including the adjacency matrix, the signless Laplacian matrix, the distance matrix, the distance signless Laplacian matrix, and the reciprocal distance matrix. Some known results in the literature are generalized and improved. 相似文献
14.
Local bases of primitive non-powerful signed digraphs 总被引:3,自引:0,他引:3
In 1994, Z. Li, F. Hall and C. Eschenbach extended the concept of the index of convergence from nonnegative matrices to powerful sign pattern matrices. Recently, Jiayu Shao and Lihua You studied the bases of non-powerful irreducible sign pattern matrices. In this paper, the local bases, which are generalizations of the base, of primitive non-powerful signed digraphs are introduced, and sharp bounds for local bases of primitive non-powerful signed digraphs are obtained. Furthermore, extremal digraphs are described. 相似文献
15.
Jianxing Zhao 《Linear and Multilinear Algebra》2018,66(7):1333-1350
Two singular value inclusion sets for rectangular tensors are given. These sets provide two upper bounds and lower bounds for the largest singular value of nonnegative rectangular tensors, which can be taken as a parameter of an algorithm presented by Zhou et al. (Linear Algebra Appl. 2013; 438: 959–968) such that the sequences produced by this algorithm converge rapidly to the largest singular value of an irreducible nonnegative rectangular tensor. 相似文献
16.
关于非负矩阵优势比的界 总被引:1,自引:0,他引:1
令A为一n×n复矩阵,且令这个比率d称为矩阵A的优势比.1964年,Ostrowski得到正矩阵优势比的一个界.1974年,Ostrowski又得到既约非负矩阵优势比的一个界. 在本文中,我们得一个比[4]更好的界,我们的结果还推广到类似于既约非负矩阵的另一类矩阵,即在[1]中定义的准非负矩阵.此外,我们还给出确定本原指标v(A)的一个简单方法,这样可以得到优势比的更佳界. 相似文献
17.
18.
In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known results about various spectral radii, including the adjacency spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance signless Laplacian spectral radius of a graph or a digraph. 相似文献