具有中心对称结构的非负张量的谱半径(英文)

The matrix with centrosymmetric structure is an important kind of structured matrices with many applications in various physics and engineering problems.The eigenvalue problem for a centrosymmetric matrix can be reduced to the other eigenvalue problems of lower order.We introduce the centrosymmetric structure to the tensor field and focus on the spectral radius of this particular tensor.Then we show that properties of centrosymmetric matrices hold true for tensors situation.     

迭代矩阵谱半径的上界估计

该文对一类广义对角占优矩阵Ｍ,给出了迭代矩阵Ｍ－１Ｎ 的谱半径的上界．特别,当Ｍ是严格对角占优时,证明了所得到的估计值总比通常用作谱半径的估计值要好．     

Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications

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.     

非负矩阵与有向图的谱半径

本文给出非负矩阵的谱半径的上界、下界,由此给出有向图的谱半径的界.     

Spectral Radius of Non-negative Matrices and Digraphs

We present an upper and a lower bound for the spectral radius of non-negative matrices. Then we give the bounds for the spectral radius of digraphs. Received February 10, 1999, Revised November 13, 2000, Accepted March 5, 2001     

图的特征值交错方法的几个应用

本文利用特征值交错方法研究了图的谱半径下界等问题,得到了图谱半径的两个新的紧下界,以及图的Laplace谱与四边形个数的一个关系式.     

非正则图的最大特征值

通过对图的最大特征分量与顶点度之间的关系的刻画,得到了图的谱半径与参数最大度和次大度之间的不等关系,进而获得了简单连通非正则图的谱半径的若干上界.     

The Linear Unicyclic Hypergraph with the Second or Third Largest Spectral Radius

The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor of the hypergraph. It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph, and the unique linear unicyclic hypergraph with the largest spectral radius is a power hypergraph. In this paper we determine the unique linear unicyclic hypergraph with the second or third largest spectral radius, where the former hypergraph is a power hypergraph and the latter hypergraph is a non-power hypergraph.     

Lower Bounds on the (Laplacian) Spectral Radius of Weighted Graphs

The weighted graphs, where the edge weights are positive numbers, are considered. The authors obtain some lower bounds on the spectral radius and the Laplacian spectral radius of weighted graphs, and characterize the graphs for which the bounds are attained. Moreover, some known lower bounds on the spectral radius and the Laplacian spectral radius of unweighted graphs can be deduced from the bounds.     

The new upper bounds on the spectral radius of weighted graphs

Let us consider weighted graphs, where the weights of the edges are positive definite matrices. The eigenvalues of a weighted graph are the eigenvalues of its adjacency matrix and the spectral radius of a weighted graph is also the spectral radius of its adjacency matrix. In this paper, we obtain two upper bounds for the spectral radius of weighted graphs and compare with a known upper bound. We also characterize graphs for which the upper bounds are attained.     

有向图的Laplace谱半径

Laplace矩阵的谱半径一直是近年来谱图理论的研究热点.本文主要讨论有向图Laplace矩阵的谱半径,用顶点的出度和公共邻域数给出了谱半径上界,用图的最大出度给出了一些特殊图类谱半径的下界.     

Spectral radius inequalities for Hilbert space operators

We prove several spectral radius inequalities for sums, products, and commutators of Hilbert space operators. Pinching inequalities for the spectral radius are also obtained.

     

双圈图的距离无符号拉普拉斯谱半径

连通图$G$的距离无符号拉普拉斯矩阵定义为$\mathcal{Q}(G)=Tr(G)+D(G)$, 其中$Tr(G)$和$D(G)$分别为连通图$G$的点传输矩阵和距离矩阵. 图$G$的距离无符号拉普拉斯矩阵的最大特征值称为$G$的距离无符号拉普拉斯谱半径. 本文确定了给定点数的双圈图中具有最大的距离无符号拉普拉斯谱半径的图.     

随机矩阵函数Kronecker积的谱半径的不等式

证明了随机矩阵函数Kronecker积的谱半径的几个不等式.     

关于Z－矩阵的弱正则分裂

本文主要考虑一类Ｚ－矩阵弱正则分裂的迭代矩阵的谱半径和特征值１的指数问题，推广了Ｒｏｓｅ在１９８４年得到的一个定理．     

关于矩阵Kronecker积的谱半径的不等式

本文证明了矩阵的 Kronecker积的谱半径的两个不等式     

Convergence of GAOR method for doubly diagonally dominant matrices

In this paper, we obtain bounds for the spectral radius of the matrix l_ω,r which is the iterative matrix of the generalized accelerated overrelaxation (GAOR) iterative method. Moreover, we present one convergence theorem of the GAOR method. Finally, we present two numerical examples.     

Convergences of splitting iterative methods for symmetric indefinite linear systems

In this paper, we generalize the saddle point problem to general symmetric indefinite systems, we also present a kind of convergent splitting iterative methods for the symmetric indefinite systems. A special divergent splitting is introduced. The sufficient condition is discussed that the eigenvalues of the iteration matrix are real. The spectral radius of the iteration matrix is discussed in detail, the convergence theories of the splitting iterative methods for the symmetric indefinite systems are obtained. Finally, we present a preconditioner and discuss the eigenvalues of preconditioned matrix.