On the Schur Complement of Diagonally Dominant Matrices

Similar documents
Matrix Inequalities by Means of Block Matrices 1

Some inequalities for sum and product of positive semide nite matrices

Properties for the Perron complement of three known subclasses of H-matrices

Z-Pencils. November 20, Abstract

Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices

c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March

Matrix Completion Problems for Pairs of Related Classes of Matrices

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES

Some bounds for the spectral radius of the Hadamard product of matrices

On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination

arxiv: v3 [math.ra] 22 Aug 2014

ELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES

Application of Theorems of Schur and Albert

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

HUA S MATRIX EQUALITY AND SCHUR COMPLEMENTS

Lecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky

On the adjacency matrix of a block graph

Sign Patterns with a Nest of Positive Principal Minors

SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX

Schur complements and matrix inequalities in the Löwner ordering

A Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations

A note on 5 5 Completely positive matrices

Key words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.

Generalized Schur complements of matrices and compound matrices

Spectral inequalities and equalities involving products of matrices

Math Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.

PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS

Completely positive matrices of order 5 with ĈP -graph

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

On generalized Schur complement of nonstrictly diagonally dominant matrices and general H- matrices

arxiv: v1 [math.co] 10 Aug 2016

Linear Algebra and its Applications

MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM

Some New Results on Lyapunov-Type Diagonal Stability

Fuzhen Zhang s Publication and Presentation List (updated Dec. 2007)

Interlacing Inequalities for Totally Nonnegative Matrices

The Kemeny Constant For Finite Homogeneous Ergodic Markov Chains

Topics in Applied Linear Algebra - Part II

The eigenvalue distribution of block diagonally dominant matrices and block H-matrices

Abed Elhashash and Daniel B. Szyld. Report August 2007

CAAM 454/554: Stationary Iterative Methods

EECS 275 Matrix Computation

Generalized Principal Pivot Transform

The following two problems were posed by de Caen [4] (see also [6]):

Intrinsic products and factorizations of matrices

SIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY. February 16, 2010

ELA

MINIMAL NORMAL AND COMMUTING COMPLETIONS

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

Math Matrix Algebra

G1110 & 852G1 Numerical Linear Algebra

Jordan Canonical Form of A Partitioned Complex Matrix and Its Application to Real Quaternion Matrices

Solution of Linear Equations

The doubly negative matrix completion problem

CHARACTERIZATIONS. is pd/psd. Possible for all pd/psd matrices! Generating a pd/psd matrix: Choose any B Mn, then

Copositive Plus Matrices

642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004

3.2 Gaussian Elimination (and triangular matrices)

Generalizations of M-matrices which may not have a nonnegative inverse

A Characterization of the Hurwitz Stability of Metzler Matrices

ACI-matrices all of whose completions have the same rank

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof

On Euclidean distance matrices

Direct Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le

Relationships between the Completion Problems for Various Classes of Matrices

Here is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J

Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras

INVERSE TRIDIAGONAL Z MATRICES

ELA

SENSITIVITY OF THE STATIONARY DISTRIBUTION OF A MARKOV CHAIN*

Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018

Two Results About The Matrix Exponential

GENERALIZED FINITE ALGORITHMS FOR CONSTRUCTING HERMITIAN MATRICES WITH PRESCRIBED DIAGONAL AND SPECTRUM

Solving Linear Systems

Convergence on Gauss-Seidel iterative methods for linear systems with general H-matrices

Fuzhen Zhang s Publication and Presentation List

Some bounds for the spectral radius of the Hadamard product of matrices

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

Inequalities of Generalized Matrix Functions via Tensor Products

Note on deleting a vertex and weak interlacing of the Laplacian spectrum

A property concerning the Hadamard powers of inverse M-matrices

Algebra C Numerical Linear Algebra Sample Exam Problems

Numerical Methods - Numerical Linear Algebra

Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer Homework 3 Due: Tuesday, July 3, 2018

Lectures on Linear Algebra for IT

Determinants Chapter 3 of Lay

Multiple eigenvalues

A Note on Eigenvalues of Perturbed Hermitian Matrices

arxiv: v3 [math.ra] 10 Jun 2016

Math 240 Calculus III

A generalization of the Gauss-Seidel iteration method for solving absolute value equations

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.

Numerical Linear Algebra And Its Applications

An Even Order Symmetric B Tensor is Positive Definite

RESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices

Compound matrices and some classical inequalities

AMS526: Numerical Analysis I (Numerical Linear Algebra)

DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular

InequalitiesInvolvingHadamardProductsof HermitianMatrices y

Transcription:

On the Schur Complement of Diagonally Dominant Matrices T.-G. Lei, C.-W. Woo,J.-Z.Liu, and F. Zhang 1 Introduction In 1979, Carlson and Markham proved that the Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant [1]. Their proof relies virtually on the Crabtree-Haynsworth quotient formula and mathematical induction. The importance of the result is two-fold. In numerical analysis, the convergence of the Gauss-Seidel iterations is guaranteed for a strictly diagonally dominant matrix (see, e.g., [4, p. 58] or [3, p. 508]). In combinatorial matrix theory, the diagonally dominant matrices, along with other type of matrices such as positive semidefinite matrices, M-matrices, inverse M-matrices, are to join the classes that possess the closure properties under the Schur complement. The purpose of this note is to present a conceptual proof, without using the quotient formula, to the existing result that the Schur complement of a diagonally dominant matrix is diagonally dominant. Let A be an n n complex matrix partitioned as ( ) A11 A A = 12, A 21 A 22 where A 11 is k k and nonsingular, 1 k<n.theschur complement of A 11 in A Funding for this paper furnished by the NSU Faculty Development Funds. National Natural Science Foundation of China, Beijing 100085, China. Department of Mathematics, City University of Hong Kong, Hong Kong, China. Department of Mathematics, Xiangtan University, Xiangtan, Hunan 411105, China. Division of Math, Science, and Technology, Nova Southeastern University, Fort Lauderdale, Florida 33314, USA and Shenyang Normal University, Shenyang, China.

is defined to be A/A 11 def = A 22 A 21 A 1 11 A 12. The definition of Schur complement may be generalized to singular A 11 by replacing the inverse A 1 11 with a generalized inverse of A 11 and to any (principal) submatrix of A via permutations. We shall consider the Schur complement of a k k nonsingular principal submatrix that is located in the upper left corner. It has been evident that the matrix identity (A/A 11 ) 1 =(A 1 ) 22 (see, e.g., [5, p. 184]), relating submatrices and Schur complements, plays a key role in proving the closure properties of the classes such as inverse M-matrices under the Schur complement. This approach does not work for diagonally dominant matrices. For an n n complex matrix A =(a ij ), we say that A is (row) diagonally dominant if for all i =1, 2,...,n a ii n a ij. j=1 j i A is further called strictly diagonally dominant if all the strict inequalities hold. It is well-known that strictly diagonally dominant matrices are nonsingular. Obviously, the principal submatrices of strictly diagonally dominant matrices are strictly diagonally dominant and thus nonsingular. The comparison matrix µ(a) =(c ij ) of a given matrix A =(a ij ) is defined by { aij if i = j c ij = a ij if i j We say that matrix A is an H-matrix if µ(a) isanm-matrix. Recall that a square matrix M is an M-matrix if it can be written in the form M = αi P, where P is a nonnegative matrix and α>ρ(m), the spectral radius of M. We shall adopt the following notations: C n n for the set of all n n complex matrices; D n for the set of all n n diagonally dominant matrices; SD n for the set of all n n strictly diagonally dominant matrices; M n for the set of all n nm-matrices; H n for the set of all n nh-matrices. 2 Theorem and the Proof For any matrix A =(a ij ), we denote A =( a ij ). If the entries of matrix A are all nonnegative, then we write A 0. For real matrices A and B of the same size, if A B is a nonnegative matrix, we write A B. We begin with two well-known results (see, e.g., [2, p. 117 or p. 131] and [2, p. 114, Theorem 2.5.3.13], respectively).

Lemma 1. Let A C n n and B M n.ifµ(a) B, thena H n and B 1 A 1 0. Lemma 2. Let A SD n.thenµ(a) M n ; that is, A H n. It follows immediately from Lemma 1 that A H n [µ(a)] 1 A 1. (1) Now we state and prove the main result. Theorem 3. Let A SD n and A 11 be a k k nonsingular leading principal submatrix of A. Then A/A 11 SD. In other words, if A is strictly diagonally dominant, then so is a Schur complement in A. Proof. Denote j i = k + i, i =1, 2,...,n k, and let the (s, t)-entry of A/A 11 be a st. By definition and upon computation, we have a tt a tu a 1jt = a jtj t (a jt1,,a jtk)a 1 11. a kjt a 1ju a jtj u (a jt1,,a jtk)a 1 11. a kju a 1ju a jtj t (a jt1,,a jtk)a 1. 11. u=1 a kju a jtj t ( a jt1,, a a 1ju jtk ) A 1 11. u=1 a kju a 1ju a jtj t ( a jt1,, a jtk )[µ(a 11 )] 1. u=1 a kju (by (1))

= def = 1 det µ(a 11 ) det 1 det B. det µ(a 11 ) a jtj t a j tj u a jt1 a jtk u=1 a 1j u. µ(a 11 ) u=1 a kj u We now show that B =(b st )isinsd n (or an M-matrix). Since A SD n, b v+1,v+1 = a vv > b 11 = a jtj t > 0, b v+1,v+1 = a vv > 0, b 11 = a jtj t > k w v v =1,...,k, k k+1 a jtv = b 1v, v=1 a vw + a vju = u=1 k+1 w v+1 v 1 b v+1,w, v =1,...,k. It follows that B(= µ(b)) is strongly diagonally dominant and thus is an M- matrix of size k + 1 (by Lemma 2). Therefore det B>0, along with det µ(a 11 ) > 0, yields a tt a tu > 0 for all t =1, 2,...,n k. We conclude that A/A 11 is strongly diagonally dominant. Corollary 4. Let A be an n n matrix with nonsingular submatrix A 11.Then A D n A/A 11 D. In other words, if A is diagonally dominant, so is a Schur complement in A. Proof. Let I ɛ be a diagonal matrix with diagonal entries ɛ i such that a ii + ɛ i > a ii for all i =1, 2,...,n.LetA ɛ = A + I ɛ.thena ɛ SD n since A D n. Use A ɛ in place of A in the proof of Theorem 3. A continuity argument yields the desired statement. Remark 1. As is known, the inverse of a strictly (row) diagonally dominant matrix is strictly diagonally dominant of its (column) entries (see, e.g., [2, p. 125]); the inverse need not be strictly diagonally dominant in the usual sense. Thus we see if A SD n, then, by Theorem 3 and the identity (A/A 11 ) 1 =(A 1 ) 22, the Schur complements A/A 11 and A 1 /(A 1 ) 11 are both strongly diagonally dominant of

(column) entries. That is, if we denote A/A 11 =(ω ij )anda 1 /(A 1 ) 11 =(γ ij ), then for all i and j, i j, ω ij < ω jj, γ ij < γ jj. Remark 2. We summarize that the following classes are closed under taking the principal submatrices and the Schur complements: Positive semidefinite matrices; Hermitian matrices; M-matrices; inverse M-matrices; H-matrices; strictly diagonally dominant matrices; strictly double-diagonally dominant matrices; P -matrices; Note that the Schur complement of Z-matrices (the matrices all whose off-diagonal entries are nonpositive) need not be a Z-matrix.

Bibliography [1] D. Carlson and T. Markham, Schur complements of diagonally dominant matrices, Czech. Math. J. 29(104), pp. 246 251, 1979. [2] R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, New York, 1991. [3] G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, 3rd edition, 1996. [4] R. Kress, Numerical Analysis, Springer, New York, 1998. [5] F. Zhang, Matrix Theory: Basic Results and Techniques, Springer, New York, 1999.