判定广义严格对角占优矩阵的新准则（英文）

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 CLASS OF ASYNCHRONOUS PARALLEL MULTISPLITTING RELAXATION METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive diagonal elements. Moreover, block and multi-parameter variants of the new methods, together with their convergence properties,are investigated in detail. Numerical results show that these new methods can achieve high parallel efficiency for solving the large sparse linear complementarity problems on multiprocessor systems.     

GENERALIZED NEKRASOV MATRICES AND APPLICATIONS

In this paper,the concpet of generalized Nekrasov matrices in introduced,some prop-erties of these matrices are discussed,obtained equivalent representation of generalized diagonally dominant matrices.     

SIMPLE SUFFICIENT CONDITIONS OF NONSINGULAR H-MATRICES

1 IntroductionH-matrices have important role in numerical analysis and matrix theory,etc.In thispaper,several practical criteria for H-matrices are obtained,to which the matrix is notnecessary be a diagonally dominant matrix,and the numbers of rows which are not diago-nal dominant can be n-1.We introduce the concept of α-diagonally dominant matrix,andby using the concept to investigate H-matrices.     

UNCONDITIONAL CAUCHY SERIES AND UNIFORM CONVERGENCE ON MATRICES

The authors obtain new characterizations of unconditional Cauchy series in termsof separation properties of subfamilies of P(N), and a generalization of the Orlicz-PettisTheorem is also obtained. New results on the uniform convergence on matrices anda new version of the Hahn-Schur summation theorem are proved. For matrices whoserows define unconditional Cauchy series, a better sufficient condition for the basicMatrix Theorem of Antosik and Swartz, new necessary conditions and a new proof ofthat theorem are given.     

General H-matrices and their Schur complements

The definitions of θ-ray pattern proposed to establish some new results matrix and θ-ray matrix are firstly on nonsingularity/singularity and convergence of general H-matrices. Then some conditions on the matrix A ∈ C^n×n and nonempty α （n） = {1,2,... ,n} are proposed such that A is an invertible H-matrix if A（α） and A/α are both invertible H-matrices. Furthermore, the important results on Schur complement for general H-matrices are presented to give the different necessary and sufficient conditions for the matrix A E HM and the subset α C （n） such that the Schur complement matrix A/α∈ HI^n-｜α｜ or A/α ∈ Hn-｜α｜^M or A/α ∈ H^n-｜ α｜^S.     

广义严格对角占优矩阵与M矩阵的充分判据

In this paper, some criteria for generalized strictly diagonally dominant matrices and M-matrices are given. Some previous results are improved and generalized.     

MODIFIED BERNOULLI ITERATION METHODS FOR QUADRATIC MATRIX EQUATION

We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX^2 ＋ BX ＋ C = 0, where A, B and C are square matrices. This method is motivated from the Gauss-Seidel iteration for solving linear systems and the ShermanMorrison-Woodbury formula for updating matrices. Under suitable conditions, we prove the local linear convergence of the new method. An algorithm is presented to find the solution of the quadratic matrix equation and some numerical results are given to show the feasibility and the effectiveness of the algorithm. In addition, we also describe and analyze the block version of the modified Bernoulli iteration method.     

On invertible nonnegative Hamiltonian operator matrices

Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operator to be invertible are obtained, so that the main results in the previously published papers are corollaries of the new theorems. Most of all we want to stress the method of proof. It is based on the connections between Pauli operator matrices and nonnegative Hamiltonian matrices.     

对称矩阵的β-性质及其Scaling稳定性分析

In this paper, a concept of the β-property of symmetric matrices is presented which is useful in the perturbation theory for matrices. A necessary and sufficient condition for a symmetric matrix to have the β-property, and the constant β,when it exists, are given. Further, the scaling stability of the symmetric matrix which has the β-property is investigated.     

H-MATRICES AND S-DOUBLY DIAGONALLY DOMINANT MATRICES

§1　IntroductionSpecial matrices,especially H-matricesand M-matrices,have very wide applications innumerical calculations,control theory,mathematical physics,optimization techniques andso on.In recenttwo orthree decades,the studies in these matrices are fruitful,and manygraceful equivalentconditions to M-matrices have been proposed.By contrast,though theH-matrices are closely related with M-matrices,researches on H-matrices show that theproblems in H-matrices are more difficultand some res…     

On diagonal-Schur complements of block diagonally dominant matrices

It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices.     

Notes on matrices with diagonally dominant properties

In this paper, we analyze the relation between some classes of matrices with variants of the diagonal dominance property. We establish a sufficient condition for a generalized doubly diagonally dominant matrix to be invertible. Sufficient conditions for a matrix to be strictly generalized diagonally dominant are also presented. We provide a sufficient condition for the invertibility of a cyclically diagonally dominant matrix. These sufficient conditions do not assume the irreducibility of the matrix.     

基于严格α-双链对角占优矩阵的非奇H-矩阵的判定准则

研究了非奇H-矩阵的判定问题.先给出了几个判定严格α-双链对角占优矩阵的充要条件,进一步利用矩阵对角占优理论得到了判定非奇H-矩阵的一些充分条件,推广和改进了已有的相关结果,并用数值算例说明了这些判定方法的有效性.     

An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric

Summary It was recently shown that the inverse of a strictly ultrametric matrix is a strictly diagonally dominant Stieltjes matrix. On the other hand, as it is well-known that the inverse of a strictly diagonally dominant Stieltjes matrix is a real symmetric matrix with nonnegative entries, it is natural to ask, conversely, if every strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse. Examples show, however, that the converse is not true in general, i.e., there are strictly diagonally dominant Stieltjes matrices in ^n×n (for everyn3) whose inverses are not strictly ultrametric matrices. Then, the question naturally arises if one can determine which strictly diagonally dominant Stieltjes matrices, in ^n×n (n3), have inverses which are strictly ultrametric. Here, we develop an algorithm, based on graph theory, which determines if a given strictly diagonally dominant Stieltjes matrixA has a strictly ultrametric inverse, where the algorithm is applied toA and requires no computation of inverse. Moreover, if this given strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse, our algorithm uniquely determines this inverse as a special sum of rank-one matrices.Research supported by the National Science FoundationResearch supported by the Deutsche Forschungsgemeinschaft     

区间AOR方法的收敛性

设A∈I(R~(n×n)是一个区间矩阵,b∈I(R~n)是区间向量.将A分解成 A=D-L-U,其中D,-L和-U分别是A的对角矩阵、严格下和上三角矩阵.假定A的每个对角元均不为零,则可引进求解区间线性方程组     

AOR方法的收敛性定理

获得了著名的AOR方法收敛的实用条件和H矩阵的实用判别条件。所得AOR方法的收敛条件便于实际计算应用,适用范围不要求方程组系数矩阵对角占优,适用于数学物理问题中广泛的矩阵类。给出的数值例子表明了所得结果的实用性。     

非奇异H-矩阵新的含参数细分迭代判别法

结合矩阵自身的元素,构造了含参数的迭代公式,进而细分了矩阵非对角占优行指标集.利用广义严格α-对角占优矩阵与非奇异H-矩阵的关系,给出了非奇异H-矩阵一组新的细分迭代判定准则,推广和改进了已有的结果,通过数值算例说明了结果的优越性.     

非奇H矩阵与M-矩阵的等价条件

本文引进了局部对角占优矩阵的概念，得到了非奇Ｈ矩阵与Ｍ－矩阵的等价条件与判定准则，改进了文［１］的主要结果．     

Construction of full H-matrices with the given eigenvalues based on the Givens matrices

The inverse eigenvalue problem is about how to construct a desired matrix whose spectrum is the given number set. In this paper, in view of the Givens matrices, we prove that there exist three classes of full H-matrices which include strictly diagonally dominant full matrix, $\alpha$-strictly diagonally dominant full matrix and $\alpha$-double strictly diagonally dominant full matrix, and their spectrum are all the given number set. In addition, we design some numerical algorithms to explain how to construct the above-mentioned full H-matrices.