3阶不可约符号模式的精细惯量极小临界集

Let S be a nonempty, proper subset of all possible refined inertias of real matrices of order n. The set S is a critical set of refined inertias for irreducible sign patterns of order n,if for each n × n irreducible sign pattern A, the condition S ? ri(A) is sufficient for A to be refined inertially arbitrary. If no proper subset of S is a critical set of refined inertias, then S is a minimal critical set of refined inertias for irreducible sign patterns of order n.All minimal critical sets of refined inertias for full sign patterns of order 3 have been identified in [Wei GAO, Zhongshan LI, Lihua ZHANG, The minimal critical sets of refined inertias for 3×3 full sign patterns, Linear Algebra Appl. 458(2014), 183–196]. In this paper, the minimal critical sets of refined inertias for irreducible sign patterns of order 3 are identified.     

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

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

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

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

关于求解实对称非负定矩阵之g—逆的一个算法

我们约定,若对矩阵A=(a_(i.i)n×n进行T_h变换的累计次数为奇数,则称对a_(k.k)进行了有效变换,否则称对a_(k.k)进行了无效变换。若已对个m不同的对角元分别进行了有效变换,则称已对A进行了m次有效变换。若对A进行了一系列变换后,结果矩阵仍存在没有进行有效变换的非零对角元,则称此时消去变换是“可继续的”。选择一个尚未进行有效变换的主对角元进行消去变换,称为选择一个可行方向。若对A沿某可行方向进行了一系列有效变换后,结果矩阵中所有非零主对角元均已进行了有效变换,则称此时巳对A沿此可行方向进行了“无后续的变换”。     

K-非负矩阵及其基于矩阵分裂的迭代矩阵比较定理(英文)

本文研究两个迭代矩阵的渐近收敛率比较问题.基于K-非负矩阵理论,给出了关于两个K-弱分裂的比较定理,并指出这些结论是文献[Numer.Math.,2002,92(3):563-591]中相对应的结论的推广.     

三幂等符号模式矩阵的结构

Abstract. A matrix whose entries are , -, and 0 is called a sign pattern matrix. For a signpattern matrix A,if A3 =A, then A is said to be sign tripotent. In this paper, the characteriza-tion of the n by n(n≥2) sign pattern matrices A which are sign tripotent has been given out.Furthermore, the necessary and sufficient condition of A3=A but A2≠A is obtained, too.     

关于非负对称矩阵的近似逆矩阵

本文研究了非负对称矩阵的近似逆矩阵问.利用矩阵S=(s_i,j)去近似它的逆矩阵方法,获得了近似误差的一个显式上界,并且证明了近似逆的误差对于很大的n一致地具有阶1/（n-1）².     

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

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

对称非负定矩阵反问题解存在的条件

R~(n×m)表示所有n×m阶实阵集合,R_r~(n×m)表示R~(n×m)中秩为r的子集.R_K表示所有K阶对称非负定阵集合.A≥0(>0)表示方阵A对称非负定(正定).R(A),N(A),A~+分别表示A的列空间,零空间和Moore-Penrose广义逆.dim(·)表示子空间维数,I_K表示K阶单位阵.||·||表示Frobenius范数.现考虑如下问题:     

平方非正的符号矩阵的平方中负元个数

本文给出了一个符号矩阵A当A^2非正时A^2中负元个数N－(A^2)的上,下界,并确定相应的极矩阵。     

The Inertia Set of Nonnegative Symmetric Sign Pattern with Zero Diagonal

The inertia set of a symmetric sign pattern A is the set i(A) = {i(B) | B = B ^T ∈ Q(A)}, where i(B) denotes the inertia of real symmetric matrix B, and Q(A) denotes the sign pattern class of A. In this paper, a complete characterization on the inertia set of the nonnegative symmetric sign pattern A in which each diagonal entry is zero and all off-diagonal entries are positive is obtained. Further, we also consider the bound for the numbers of nonzero entries in the nonnegative symmetric sign patterns A with zero diagonal that require unique inertia.     

On the number of P-vertices of some graphs

We provide positive answers to some open questions presented recently by Kim and Shader on a continuity-like property of the P-vertices of nonsingular matrices whose graph is a path. A criterion for matrices associated with more general trees to have at most n − 1 P-vertices is established. The cases of the cycles and stars are also analyzed. Several algorithms for generating matrices with a given number of P-vertices are proposed.     

Eigenvalues and colorings of digraphs

Wilf’s eigenvalue upper bound on the chromatic number is extended to the setting of digraphs. The proof uses a generalization of Brooks’ Theorem to digraph colorings.     

The algebraic connectivity of graphs under perturbation

In this paper, we investigate how the algebraic connectivity of a connected graph behaves when the graph is perturbed by separating or grafting an edge.     

Sign patterns allowing nilpotence of index 3

Suppose P is a property referring to a real matrix. We say that a sign pattern A allows P if there exists at least one matrix with the same sign pattern as A that has the property P. In this paper, we study sign patterns allowing nilpotence of index 3. Four methods for constructing sign patterns that allow nilpotence of index 3 are obtained. All tree sign patterns that allow nilpotence of index 3 are characterized. Sign patterns of order 3 that allow nilpotence are identified.     

The copositive completion problem: Unspecified diagonal entries

In [L. Hogben, C.R. Johnson, R. Reams, The copositive matrix completion problem, Linear Algebra Appl. 408 (2005) 207-211] it was shown that any partial (strictly) copositive matrix all of whose diagonal entries are specified can be completed to a (strictly) copositive matrix. In this note we show that every partial strictly copositive matrix (possibly with unspecified diagonal entries) can be completed to a strictly copositive matrix, but there is an example of a partial copositive matrix with an unspecified diagonal entry that cannot be completed to a copositive matrix.     

Generalized competition index of a primitive digraph

For positive integers k and m, and a digraph D, the k-step m-competition graph of D has the same set of vertices as D and an edge between vertices x and y if and only if there are distinct m vertices v₁,v₂,…,v_m in D such that there are directed walks of length k from x to v_i and from y to v_i for 1?i?m. In this paper, we present the definition of m-competition index for a primitive digraph. The m-competition index of a primitive digraph D is the smallest positive integer k such that is a complete graph. We study m-competition indices of primitive digraphs and provide an upper bound for the m-competition index of a primitive digraph.     

Energy of line graphs

The energy of a graph is equal to the sum of the absolute values of its eigenvalues. The energy of a matrix is equal to the sum of its singular values. We establish relations between the energy of the line graph of a graph G and the energies associated with the Laplacian and signless Laplacian matrices of G.     

A bound on the generalized competition index of a primitive matrix using Boolean rank

For a positive integer m where 1?m?n, the m-competition index (generalized competition index) of a primitive digraph is the smallest positive integer k such that for every pair of vertices x and y, there exist m distinct vertices v₁,v₂,…,v_m such that there are directed walks of length k from x to v_i and from y to v_i for 1?i?m. The m-competition index is a generalization of the scrambling index and the exponent of a primitive digraph. In this study, we determine an upper bound on the m-competition index of a primitive digraph using Boolean rank and give examples of primitive Boolean matrices that attain the bound.     

A generalized characteristic polynomial of a graph having a semifree action

For an abelian group Γ, a formula to compute the characteristic polynomial of a Γ-graph has been obtained by Lee and Kim [Characteristic polynomials of graphs having a semi-free action, Linear algebra Appl. 307 (2005) 35-46]. As a continuation of this work, we give a computational formula for generalized characteristic polynomial of a Γ-graph when Γ is a finite group. Moreover, after showing that the reciprocal of the Bartholdi zeta function of a graph can be derived from the generalized characteristic polynomial of a graph, we compute the reciprocals of the Bartholdi zeta functions of wheels and complete bipartite graphs as an application of our formula.