The Schur complement of strictly doubly diagonally dominant matrices and its application

It is known that the Schur complements of doubly diagonally dominant matrices are doubly diagonally dominant. In this paper, we obtain an estimate for the doubly diagonally dominant degree on the Schur complement of strictly doubly diagonally dominant matrices. Then, as an application we obtain that the eigenvalues of the Schur complements are located in the Brauer Ovals of Cassini of the original matrices under certain conditions. As another application, we obtain an upper bound for the infinity norm on the inverse on the Schur complement of strictly doubly diagonally dominant matrices. Further, based on the derived results, we give a kind of iteration called the Schur-based iteration, which can solve large scale linear systems though reducing the order by the Schur complement and can compute out the results faster.     

Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices

In this paper, we prove that the diagonal-Schur complement of a strictly doubly diagonally dominant matrix is strictly doubly diagonally dominant matrix. The same holds for the diagonal-Schur complement of a strictly generalized doubly diagonally dominant matrix and a nonsingular H-matrix. We point out that under certain assumptions, the diagonal-Schur complement of a strictly doubly (doubly product) γ-diagonally dominant matrix is also strictly doubly (doubly product) γ-diagonally dominant. Further, we provide the distribution of the real parts of eigenvalues of a diagonal-Schur complement of H-matrix. We also show that the Schur complement of a γ-diagonally dominant matrix is not always γ-diagonally dominant by a numerical example, and then obtain a sufficient condition to ensure that the Schur complement of a γ-diagonally dominant matrix is γ-diagonally dominant.     

More results on Schur complements in Euclidean Jordan algebras

In a recent article Gowda and Sznajder (Linear Algebra Appl 432:1553–1559, 2010) studied the concept of Schur complement in Euclidean Jordan algebras and described Schur determinantal and Haynsworth inertia formulas. In this article, we establish some more results on the Schur complement. Specifically, we prove, in the setting of Euclidean Jordan algebras, an analogue of the Crabtree-Haynsworth quotient formula and show that any Schur complement of a strictly diagonally dominant element is strictly diagonally dominant. We also introduce the concept of Schur product of a real symmetric matrix and an element of a Euclidean Jordan algebra when its Peirce decomposition with respect to a Jordan frame is given. An Oppenheim type inequality is proved in this setting.     

广义严格对角占优阵的判定程序

1 引言和符号 在本文中,均采用下列符号而不再重申.恒用N表示前n个自然数的集合;而用Mn(C)和Mn(R)分别表示所有n阶复矩阵和所有n阶实矩阵的集合. Z_N={A|A=(a_(ij))_(n×n)∈Mn(R),a_(ij)≤0,i,j∈N,i≠j},I恒表示单位矩阵. 如果A∈Mn(R)且A的所有元素都为非负实数,则称A为非负方阵,并记为A≥0;若A的所有元素都为正数,则称A为正矩阵,并记为A>0. 对A=(a_(ij))(n×n)∈Mn(C),令A_i(A)=sum from j=1 j≠i to n (|a_(ij)|(i=1、2…… n)) ;若把A的非零元用1代替 而得到—个n阶(0,1)矩阵。称为A的导出矩阵。记为;而把A的比较矩阵记为 u(A)=(b_(ij))_(n×n))其中b_(ij)=|a_(ij)|,b_(ij)=-|a_(ij)|(i,j∈N i≠j)     

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.     

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.     

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     

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.     

Strict double diagonal dominance in Euclidean Jordan algebras

In the first part of the paper, we deal with Euclidean Jordan algebraic generalizations of some results of Brualdi on inclusion regions for the eigenvalues of complex matrices using directed graphs. As a consequence, the theorems of Brauer–Ostrowski and Brauer on the location of eigenvalues are extended to the setting of Euclidean Jordan algebras. In the second part, motivated by the work of Li and Tsatsomeros on the class of doubly diagonally dominant matrices with complex entries and its subclasses, we present some inter-relations between the H-property, generalized strict diagonal dominance, invertibility, and strict double diagonal dominance in Euclidean Jordan algebras. In addition, we show that in a Euclidean Jordan algebra, the Schur complements of a strictly doubly diagonally dominant element inherit this property.     

The generalized Schur complement in group inverses and (k 1)-potent matrices

In this article, two facts related to the generalized Schur complement are studied. The first one is to find necessary and sufficient conditions to characterize when the group inverse of a partitioned matrix can be expressed in the Schur form. The other one is to develop a formula for any power of the generalized Schur complement of an idempotent partitioned matrix and then to characterize when this generalized Schur complement is a (k+1)-potent matrix. In addition, some spectral theory related to this complement is analyzed.     

On the parallel GSAOR method for block diagonally dominant matrices

In this paper we consider the parallel generalized SAOR iterative method based on the generalized AOR iterative method presented by James for solving large nonsingular system. We obtain some convergence theorems for the case when coefficient matrix is a block diagonally dominant matrix or a generalized block diagonal dominant matrix. A numerical example is given to illustrate to our results.     

广义严格对角占优矩阵的充分条件

1 引言 广义严格对角占优矩阵是一类在数值代数、数学物理和控制论等领域有着广泛应用的特殊矩阵,例如:线性方程组Ax=b,当系数矩阵A为广义严格对角占优矩阵时,许多经典的迭代算法均是收敛的,同时对目前提出的一些修正算法也是收敛的.     

Criteria and Schur complements of H-matrices

The purpose of this paper is twofold: We first present a sufficient condition for testing strictly generalized diagonally dominant matrices (i.e., H-matrices) and we claim that our criterion is superior to the existing ones. We then show that the proper subset of the H-matrices determined by the condition preserves the closure property under the Schur complement operation.     

广义严格对角占优矩阵的几个判定条件

广义严格对角占优矩阵在计算数学、数学物理、控制论等众多领域有着广泛而重要的应用.但实际判断一个矩阵是否为广义严格对角占优矩阵却是困难的.本文利用α-对角占优矩阵的性质,给出了广义严格对角占优矩阵的几个判定条件,扩大了判别范围.     

Relationship Between Geršgorin‐type Theorems for Certain Subclasses of H‐Matrices

It is well known that the eigenvalue inclusion domain can be obtained by Geršgorin theorem. It is also known that the Geršgorin theorem is equivalent to the statement that each strictly diagonally dominant (SDD) matrix is nonsingular. Similarly, statements about nonsingularity of some classes of matrices, which are generalizations of SDD class, produce new Geršgorin‐type theorems for eigenvalue inclusion domain. In this paper we will consider some subclasses of H‐matrices and corresponding (Geršgorin‐type) eigenvalue inclusion theorems. Finally, we will establish relationship between given inclusion domains.     

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.     

On the use of dense matrix techniques within sparse simplex

In this paper we discuss some instances where dense matrix techniques can be utilized within a sparse simplex linear programming solver. The main emphasis is on the use of the Schur complement matrix as a part of the basis matrix representation. This approach enables to represent the basis matrix as an easily invertible sparse matrix and one or more dense Schur complement matrices. We describe our variant of this method which uses updating of the QR factorization of the Schur complement matrix. We also discuss some implementation issues of the LP software package which is based on this approach.     

On modified block SSOR iteration methods for linear systems from steady incompressible viscous flow problems

In order to solve the large sparse systems of linear equations arising from numerical solutions of two-dimensional steady incompressible viscous flow problems in primitive variable formulation, we present block SSOR and modified block SSOR iteration methods based on the special structures of the coefficient matrices. In each step of the block SSOR iteration, we employ the block LU factorization to solve the sub-systems of linear equations. We show that the block LU factorization is existent and stable when the coefficient matrices are block diagonally dominant of type-II by columns. Under suitable conditions, we establish convergence theorems for both block SSOR and modified block SSOR iteration methods. In addition, the block SSOR iteration and AF-ADI method are considered as preconditioners for the nonsymmetric systems of linear equations. Numerical experiments show that both block SSOR and modified block SSOR iterations are feasible iterative solvers and they are also effective for preconditioning Krylov subspace methods such as GMRES and BiCGSTAB when used to solve this class of systems of linear equations.     

改进的分块模方法求解对角占优线性互补问题

为了高效求解中小型线性互补问题,本文提出了改进的分块模方法,并证明了关于严格对角占优(对角元素均为正数)线性互补问题的收敛性.对于广义对角占优线性互补问题,先将其转化为严格对角占优线性互补问题,再采用改进的分块模方法求解.数值结果表明,改进的分块模方法在求解广义对角占优线性互补问题时在内迭代次数和计算时间上均明显优于分...