关于几类矩阵的特征值分布

<正> 在矩阵论中以及应用矩阵工具的各类问题中,估计矩阵的特征值大小与分布十分重要.在[1]中,我们给出了非负矩阵(元素全非负的矩阵)最大特征值的计算与估计方法,并将此结果推广到更广的一类矩阵.在本文中,我们将对实用中几类重要矩阵给出它们特征值分布的估计.     

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

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

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

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

非负矩阵最大特征值的估计法

通过构造一个新的矩阵,从而得到一个非负矩阵最大特征值的估计法,该方法将适用范围推广到一般非负矩阵,并通过实例验证了这种新方法精确度更高.     

非负矩阵谱半径的新界值

非负矩阵谱半径的估计是非负矩阵理论研究的重要组成部分.如果上下界能够表示为非负矩阵元素的易于计算的函数,那么这种估计价值更高.通过构造两个收敛的序列得到非负矩阵谱半径的新界值.数值算例表明其结果比有关结论更加精确.     

一类恰含一个3-圈的三色本原有向图指数上界

在传统(单个)非负本原矩阵的基础上,将非负本原矩阵对的研究推广到非负本原矩阵簇,是组合矩阵论中一个崭新的研究内容.事实上,非负矩阵簇可以与多色有向图建立一一对应关系,从而把矩阵的问题转化为图的问题进行研究.该文研究了一类三色本原有向图,它的未着色图中包含n个顶点,一个n-圈、一个(n-1)-圈和一个3-圈,给出本原条件和指数上界.     

逆M矩阵模型的完备及其算法设计

1 引 言 M矩阵是具有非负对角元和非正非对角元且其逆是非负矩阵的一类矩阵.逆M矩阵即逆为M矩阵的一类非负矩阵.逆M矩阵在物理学,生物学,控制理论,神经网络方面有着重要的应用.所以对逆M矩阵的研究一直在持续不断的进行.一个“部分矩阵”是指在一个矩阵中,一些元素已经给定了,而另一些元素待定的矩阵.而一个矩阵的完     

非负矩阵谱半径的新估计

非负矩阵谱半径的估计是非负矩阵理论研究中的重要课题.如果谱半径的上下界能够表示为非负矩阵元素的易于计算的函数,那么这种估计价值更高.通过构造两个收敛的序列得到非负矩阵谱半径的新界值.数值算例表明其结果比有关结论更加精确.     

线性规划求基可行解的一种方法

本文通过增加一个特殊约束，贯彻对偶单纯形法检验数全非正的思想，迭代求优；然后再去掉该约束，结果却可得到一个基可行解。上述过程经简化处理后，增减约束可以不必出现，它仅使单纯形表矩阵增加几次初等变换而已，足见其方法之简捷及有效性。     

立方非负的不可约符号模式

以 ，-，0为元素的矩阵称为符号模式矩阵．本文考虑符号模式矩阵的立方模式，给出了至少含一个负元的不可约符号模式的立方模式是非负的充要条件及在置换相似下的标准型；得到了立方非负的符号模式矩阵中出现的正元素的个数的最大(小)值及给出了达到这些最大(小)值的不可约符号模式矩阵的完整刻画．     

The completable digraphs for the totally nonnegative completion problem

In this paper, we study the totally nonnegative completion problem when the partial totally nonnegative matrix is non-combinatorially symmetric. In general, this type of partial matrix does not have a totally nonnegative completion. Here, we give necessary and sufficient conditions for completion of a partial totally nonnegative matrix to a totally nonnegative matrix in the cases where the digraph of the off-diagonal specified entries takes certain forms as path, cycles, alternate paths, block graphs, etc., distinguishing between the monotonically and non-monotonically labeled case.     

Totally nonnegative cells and matrix Poisson varieties

We describe explicitly the admissible families of minors for the totally nonnegative cells of real matrices, that is, the families of minors that produce nonempty cells in the cell decompositions of spaces of totally nonnegative matrices introduced by A. Postnikov. In order to do this, we relate the totally nonnegative cells to torus orbits of symplectic leaves of the Poisson varieties of complex matrices. In particular, we describe the minors that vanish on a torus orbit of symplectic leaves, we prove that such families of minors are exactly the admissible families, and we show that the nonempty totally nonnegative cells are the intersections of the torus orbits of symplectic leaves with the spaces of totally nonnegative matrices.     

An inverse eigenvalue problem for totally nonnegative matrices

In a previous paper we proved that the diagonal elements of a totally nonnegative matrix are majorized by its eigenvalues. In this note we show that the majorization of a vector of nonnegative real numbers by another vector of nonnegative real numbers is not sufficient for the existence of a totally nonnegative matrix with diagonal elements taken from the entries of the majorized vector and eigenvalues taken from the entries of the majorizing vector.     

Efficient Recognition of Totally Nonnegative Matrix Cells

The space of m×p totally nonnegative real matrices has a stratification into totally nonnegative cells. The largest such cell is the space of totally positive matrices. There is a well-known criterion due to Gasca and Peña for testing a real matrix for total positivity. This criterion involves testing mp minors. In contrast, there is no known small set of minors for testing for total nonnegativity. In this paper, we show that for each of the totally nonnegative cells there is a test for membership which only involves mp minors, thus extending the Gasca and Peña result to all totally nonnegative cells.     

Nonnegative tensors revisited: plane stochastic tensors

In this paper, we develop and enrich the theory of nonnegative tensors. We define the sign nonsingular tensors and establish the relationship between the combinatorial determinant and the permanent of nonnegative tensors. We generalize the results from doubly stochastic matrices to totally plane stochastic tensors and obtain a probabilistic algorithm for locating a positive diagonal in a nonnegative tensor under certain conditions. We form a normalization algorithm to convert some nonnegative tensors to plane stochastic tensors. We obtain a lower bound for the minimum of the axial N-index assignment problem by means of the set of plane stochastic tensors.     

New lower bound of the determinant for Hadamard product on some totally nonnegative matrices

Applying the properties of Hadamard core for totally nonnegative matrices, we give new lower bounds of the determinant for Hadamard product about matrices in Hadamard core and totally nonnegative matrices, the results improve Oppenheim inequality for tridiagonal oscillating matrices obtained by T. L. Markham.     

三对角的完全非负矩阵上的Schur-Oppenheim严格不等式

应用完全非负矩阵的 Hadamard中心的性质 ,给出了非奇异三对角完全非负矩阵的Hadamard乘积的行列式的下界估计满足 Schur- Oppenheim严格不等式的充分条件 ,改进了 T.L .Markham的关于三对角的振荡矩阵的相应结果 .     

On the geometry of linear Weingarten hypersurfaces in the hyperbolic space

In this paper, we apply some forms of generalized maximum principles in order to study the geometry of complete linear Weingarten hypersurfaces with nonnegative sectional curvature immersed in the hyperbolic space. In this setting, under the assumption that the mean curvature attains its maximum, we prove that such a hypersurface must be either totally umbilical or isometric to a hyperbolic cylinder.     

Subdirect sums of P(P0)-matrices and totally nonnegative matrices

In this paper, the problem of when the sub-direct sum of two strictly diagonally dominant P-matrices is a strictly diagonally dominant P-matrix is studied. In particular, it is shown that the subdirect sum of overlapping principal submatrices of strictly diagonally dominant P-matrices is a strictly diagonally dominant P-matrix. It is also established that the 2-subdirect sum of two totally nonnegative matrices is a totally nonnegative matrix under some conditions. It is obtained that a partial totally nonnegative matrix, whose graph of the specified entries is a monotonically labeled 2-chordal graph, has a totally nonnegative completion. Finally, a positive answer to the question (IV) in Fallat and Johnson [Shaun M. Fallat, C.R. Johnson, J.R. Torregrosa, A.M. Urbano, P-matrix completions under weak symmetry assumptions, Linear Algebra Appl. 312 (2000) 73-91] is given for P₀-matrices.     

Intervals of totally nonnegative matrices

Totally nonnegative matrices, i.e., matrices having all their minors nonnegative, and matrix intervals with respect to the checkerboard ordering are considered. It is proven that if the two bound matrices of such a matrix interval are nonsingular and totally nonnegative (and in addition all their zero minors are identical) then all matrices from this interval are also nonsingular and totally nonnegative (with identical zero minors).