Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not gen...Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not generalized strictly diagonally dominant matrix.In this paper, by using the properties of α-chain diagonally dominant matrix, we obtain new criteria for judging generalized strictly diagonally dominant matrix, which enlarge the identification range.展开更多
A real square matrix whose non-diagonal elements are non-positive is called a Z-matrix. This paper shows a necessary and sufficient condition for non-singularity of two types of Z-matrices. The first is for the Z-matr...A real square matrix whose non-diagonal elements are non-positive is called a Z-matrix. This paper shows a necessary and sufficient condition for non-singularity of two types of Z-matrices. The first is for the Z-matrix whose row sums are all non-negative. The non-singularity condition for this matrix is that at least one positive row sum exists in any principal submatrix of the matrix. The second is for the Z-matrix which satisfies where . Let be the ith row and the jth column element of , and be the jth element of . Let be a subset of which is not empty, and be the complement of if is a proper subset. The non-singularity condition for this matrix is such that or such that for? . Robert Beauwens and Michael Neumann previously presented conditions similar to these conditions. In this paper, we present a different proof and show that these conditions can be also derived from theirs.展开更多
We introduce a class of structured tensors, called generalized row strictly diagonally dominant tensors, and discuss some relationships between it and several classes of structured tensors, including nonnegative tenso...We introduce a class of structured tensors, called generalized row strictly diagonally dominant tensors, and discuss some relationships between it and several classes of structured tensors, including nonnegative tensors, Btensors, and strictly copositive tensors. In particular, we give estimations on upper and lower bounds of solutions to the tensor complementarity problem (TCP) when the involved tensor is a generalized row strictly diagonally dominant tensor with all positive diagonal entries. The main advantage of the results obtained in this paper is that both bounds we obtained depend only on the tensor and constant vector involved in the TCP;and hence, they are very easy to calculate.展开更多
基金Supported by the National Natural Science Foundation of China(71261010)
文摘Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not generalized strictly diagonally dominant matrix.In this paper, by using the properties of α-chain diagonally dominant matrix, we obtain new criteria for judging generalized strictly diagonally dominant matrix, which enlarge the identification range.
文摘A real square matrix whose non-diagonal elements are non-positive is called a Z-matrix. This paper shows a necessary and sufficient condition for non-singularity of two types of Z-matrices. The first is for the Z-matrix whose row sums are all non-negative. The non-singularity condition for this matrix is that at least one positive row sum exists in any principal submatrix of the matrix. The second is for the Z-matrix which satisfies where . Let be the ith row and the jth column element of , and be the jth element of . Let be a subset of which is not empty, and be the complement of if is a proper subset. The non-singularity condition for this matrix is such that or such that for? . Robert Beauwens and Michael Neumann previously presented conditions similar to these conditions. In this paper, we present a different proof and show that these conditions can be also derived from theirs.
文摘We introduce a class of structured tensors, called generalized row strictly diagonally dominant tensors, and discuss some relationships between it and several classes of structured tensors, including nonnegative tensors, Btensors, and strictly copositive tensors. In particular, we give estimations on upper and lower bounds of solutions to the tensor complementarity problem (TCP) when the involved tensor is a generalized row strictly diagonally dominant tensor with all positive diagonal entries. The main advantage of the results obtained in this paper is that both bounds we obtained depend only on the tensor and constant vector involved in the TCP;and hence, they are very easy to calculate.