A property concerning the Hadamard powers of inverse M-matrices
|
|
- Annabel Carson
- 5 years ago
- Views:
Transcription
1 Linear Algebra and its Applications 381 ( A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University, Fuzhou, Fujian , PR China Received 23 April 2003; accepted 22 September 2003 Submitted by R.A. Brualdi Abstract The main result of this paper is the following: if A = (a ij is an inverse M-matrix, A ( = (a ij denotes the th Hadamard power of A,thenA( is an inverse M-matrix for any positive integer >1. In the case = 2, this settles a conjecture of Neumann [Linear Algebra Appl. 285 ( ] affirmatively Published by Elsevier Inc. AMS classification: 15A09; 15A42 Keywords: M-matrix; Inverse M-matrix; Hadamard product 1. Introduction All matrices considered in this paper are real. A matrix is called nonnegative if every entry is nonnegative. For two m n matrices A = (a ij and B = (b ij, A B means that A B is nonnegative, the Hadamard product of A B is defined and denoted by A B = (a ij b ij.forα 0, we write A (α = (aij α for the αth Hadamard power of the matrix A. For a positive integer n, letn ={1, 2,...,n} throughout. To avoid triviality, we always assume that n>1. Given an n n matrix A, for nonempty index set α, β N,wedenotebyA(α, β that submatrix of A lying in the rows indicated by α and the columns indicated by Supported by Foundation to the Educational Committee of Fujian, China (grant no. JB02084 and the Science and Technical Development Foundation of Fuzhou University (2003-XQ-22. address: shencan@public.fz.fj.cn (S. Chen /$ - see front matter 2004 Published by Elsevier Inc. doi: /j.laa
2 54 S. Chen / Linear Algebra and its Applications 381 ( β; the principal submatrix A(α, α is abbreviated to A(α, and for brevity A(α, {i} and A({i},αare denoted by A(α, i and A(i, α respectively. Let A be an n n matrix. A is called a Z-matrix if all of whose off-diagonal entries are nonpositive; A is called an M-matrix if A is a Z-matrix and A 1 0; A is called an inverse M-matrix if A 1 is an M-matrix. It is well nown that an inverse M-matrix is nonnegative. It follows that a nonsingular nonnegative matrix is an inverse M-matrix if and only if its inverse is a Z-matrix. We shall mae frequent use of this observation. In [1, p. 278], Neumann conjectured a property concerning the Hadamard product of inverse M-matrices as follows: If A is an n n matrix which is an inverse of an M-matrix, then A A is an inverse of an M-matrix. It is nown, via an example due to Johnson, Marham, and Neumann (see [2], that the more general conjecture, that if A and B are inverse M-matrices of the same size, then A B is an inverse M-matrix, is false. Neumann [1] has showed that the conjecture is true for several well-nown classes of inverse M-matrices. In this paper, we obtain a special property concerning the Hadamard powers of inverse M-matrices: If A is an n n inverse M-matrix, then A ( is an inverse M-matrix for any positive integer >1. When = 2, this shows that the conjecture of Neumann is valid. 2. Main results Basic for our purpose is the following simple facts, we will use later. Lemma 2.1. Let A be an n n inverse M-matrix. Then: (a All principal minors of A are positive. (b Each principal submatrix of A is an inverse M-matrix. (c For any permutation matrix P of order n, P AP T is an inverse M-matrix. (d For any nonempty proper subset α of N, A(α 1 A(α, α c 0, A(α c,α A(α 1 0, where α c = N\α. Proof. The conclusions (a and (b can be found in [3]; the assertion (d can be found in [4, p. 254], and the result (c is obvious. Lemma 2.2 (a If A is an n n inverse M-matrix, then adj A(the adjoint of A is a Z-matrix. (b Let A = (a ij be an n n nonnegative matrix,n 3. Then the following conditions are equivalent:
3 S. Chen / Linear Algebra and its Applications 381 ( (i Each principal minor of A of order 2 is nonnegative, and adj B is a Z-matrix for any principal submatrix B of A of order 3. (ii a i a j a a ij for all i, j, in N. (1 Proof. (a If A is an inverse M-matrix, then A>0, by Lemma 2.1(a. Since A 1 = 1 Aadj A is an M-matrix, thus adj A is a Z-matrix. (b (ii (i: This is nearly trivial; (i (ii: Suppose the condition (i holds i, j, N, we distinguish the following two cases: Case 1: (i j(j ( i = 0. Since all principal minors of A of order 2 are nonnegative, it is easy to chec that (1 holds in this case. Case 2: (i j(j ( i /= 0. We set a ii a ij a i B = a ji a jj a j. a i a j a By our assumption, there exists a permutation matrix P of order 3 such that adj(p T BP is a Z-matrix. Since adj(p T BP = (adj P(adj B(adj P T = ( PP 1 (adj B(P T 1 P T = P T (adj BP,adjB = P [adj(p T BP]P T is also a Z-matrix. This yields that the (1, 2th entry of adj B is nonpositive, namely, (a ij a a i a j 0, therefore, a i a j a a ij. The condition (ii holds. This completes the proof. Given an n n nonnegative matrix A = (a ij, n 3. It is nown that the inequality (1 is necessary for A to be an inverse M-matrix [5, Theorem 1]. But if the inequality (1 holds, we cannot imply that A is an inverse M-matrix, as can be illustrated by the following matrix: A = (a ij with a ij = 1foralli, j in N. Thus Lemma 2.2(b represents an improvement of Willoughby s observation. It will be used to prove our Theorem 2.4. Lemma 2.3. Let A be an inverse M-matrix of order n, whose columns are denoted by α 1,α 2,...,α n. Then for any x = (x 1,x 2,...,x n T, the functions f(x= (α 1,α 2,...,α n 1,x and g(x = (x, α 2,...,α n 1,α n have the following properties: (a If x = (x 1,x 2,...,x n T y = (y 1,y 2,...,y n T, and x n = y n, then f(x f(y. (b If x = (x 1,x 2,...,x n T y = (y 1,y 2,...,y n T, and x 1 = y 1, then g(x g(y. Proof. Using Lemma 2.2(a, adj A (b ij is a Z-matrix. Observe that b ij 0 ( i, j N,i /= j, we have
4 56 S. Chen / Linear Algebra and its Applications 381 ( (a If x n = y n, x = (x 1,x 2,...,x n T y = (y 1,y 2,...,y n T,then n 1 n 1 f(x= x i b ni + x n b nn y i b ni + y n b nn = f(y. i=1 (b If x 1 = y 1, x = (x 1,x 2,...,x n T y = (y 1,y 2,...,y n T,then n n g(x = x i b 1i + x 1 b 11 y i b 1i + y 1 b 11 = g(y. i=2 i=1 i=2 Now we provide a new sufficient and necessary condition for a square nonnegative matrix to be an inverse M-matrix as follows. Theorem 2.4. Let A = (a ij be an n n nonnegative matrix, n 3. Then the following statements are equivalent: (a A is an inverse M-matrix. (b adj A is a Z-matrix, and each proper principal submatrix of A is an inverse M-matrix. Proof. In view of Lemma 2.1(b and Lemma 2.2(a, it suffices to show that (b implies (a. Indeed, if (b holds, then using Lemma 2.2(b, we now that a i a j a a ij ( i, j, N. Put δ = N\{1,n}, andleta be partitioned as a 11 A(1,δ a 1n A = A(δ, 1 A(δ A(δ, n. a n1 A(n, δ a nn Let adj A (b ij. Since adj A is a Z-matrix, we have b 1n = ( 1 n+1 A(1,δ a1n a1n A(1,δ = 0, A(δ A(δ, n A(δ, n A(δ b n1 = ( 1 1+n A(δ, 1 A(δ A(δ A(δ, 1 = 0. a n1 A(n, δ Hence a1n A(1,δ A(δ A(δ, 1 0, 0. A(δ, n A(δ Since a i1 a 1n a 11 a in, a in a n1 a nn a i1 ( i δ, we obtain a 1n A(δ, 1 a 11 A(δ, n, a n1 A(δ, n a nn A(δ, 1. Observe that each principal submatrix of A of order n 1isaninverseM-matrix, according to Lemma 2.3, we deduce that
5 S. Chen / Linear Algebra and its Applications 381 ( a11 A(1,δ a11 a a 1n = 1n A(1,δ A(δ, 1 A(δ a 1n A(δ, 1 A(δ a11 a 1n A(1,δ a 11 A(δ, n A(δ a1n A(1,δ = a 11 0, A(δ, n A(δ A(δ A(δ, n A(δ an1 A(δ, n a n1 = A(n, δ a nn a nn A(δ ann A(δ, 1 A(n, δ a nn a n1 = a nn A(δ A(δ, 1 0. By above obtained inequalities, we infer that A(1,δ a1n A(δ, 1 A(δ A(δ A(δ, n a n1 A(n, δ = ( 1 n 2 a1n A(1,δ ( 1 n 2 A(δ A(δ, 1 A(δ, n A(δ = 1 a1n A(1,δ A(δ A(δ, 1 a 11 a a 11 a nn A(δ, n A(δ nn a 1na n1 a11 A(1,δ A(δ A(δ, n. a 11 a nn A(δ, 1 A(δ A(n, δ a nn Applying Eq. (1.5 of [4], it follows that a11 A(1,δ A(δ A(δ, n A A(δ = A(δ, 1 A(δ A(n, δ a nn A(1,δ a1n A(δ, 1 A(δ A(δ A(δ, n a n1 A(n, δ ( 1 a 1na n1 a11 A(1,δ a 11 a nn A(δ, 1 A(δ A(δ A(δ, n A(n, δ a nn > 0 (by our assumption and Lemma 2.1(a Consequently, A>0. Since adj A is a Z-matrix, and A 1 = 1 is a Z-matrix. The proof is completed. A adj A,thenA 1
6 58 S. Chen / Linear Algebra and its Applications 381 ( Given a nonnegative matrix A = (a ij of order 3. By examining the nown proof of Theorem 1 of [5] carefully, we now that A is an inverse M-matrix if and only if the following conditions are satisfied for (i,j,any permutation of (1,2,3: (i a ii > 0; (ii a i a j a a ij ; (iii a ii a >a i a i. When n = 3, it is not difficult to see that above-mentioned conditions are equivalent to the condition (b of Theorem 2.4. Thus Theorem 2.4 denotes a generalization of Willoughby s result. To prove our main result Theorem 2.6, we must apply this criterion. Lemma 2.5. Let A = (a ij be an n n inverse M-matrix, whose columns are denoted by α 1,α 2,...,α n. For any positive integer >1, if A ( is an inverse M- matrix, then for all,i 2,...,i in N, (,i 2,...,i = ( α ( 1,α( 2,...,α( n 1,α α i2 α i 0. Proof. When n = 2, since a 11 a 2i a 21 a 1i 0 (i = 1, 2, wehave a (,i 2,...,i = 11 a 1i1 a 1i2 a 1i a 2i1 a 2i2 a 2i a 21 = (a 11 a 2i1 (a 11 a 2i2 (a 11 a 2i (a 21 a 1i1 (a 21 a 1i2 (a 21 a 1i 0 (,i 2,...,i N. Below we assume that n 3,,i 2,...,i N, wedefine B ( α ( 1,α( 2,...,α( n 1,α α i2 α i (bij. We consider two possibilities as follows: Case 1: a ni1 a ni2 a ni = 0 (1,i 2,...,i n Let S n be the set of all permutations of N. Forallσ S n, we claim that b 1σ(1 b 2σ(2 b nσ (n = 0. (2 In fact, if σ (n = n, thenb nσ (n = a ni1 a ni2 a ni = 0, thus (2 holds. If σ (n /= n, wetaes 1 = n, andletr = min{t : σ t (n = n, t N}, thenr>1, and form an r-cycle: σ(s 1 = s 2,...,σ(s r 1 = s r, σ(s r = s 1. Applying the inequality (1, repeatedly, we deduce that b s1 s 2 b sr 1 s r b sr s 1 = as 1 s 2 as r 1 s r (a sr a sr i 2 a sr i = (a s1 s 2 a sr 1 s r a sr (a s1 s 2 a sr 1 s r a sr i 2 (a s1 s 2 a sr 1 s r a sr i (a s2 s 2 a sr s r (a s1 a s1 i 2 a s1 i = 0.
7 S. Chen / Linear Algebra and its Applications 381 ( By our assumption, this implies that b s1 s 2 b sr 1 s r b sr s 1 = 0. Because σ is a product of some disjoint cycles, this means that (2 holds. Moreover, this gives rise to (,i 2,...,i = B = σ s n sgn(σ b 1σ(1 b 2σ(2 b nσ (n = 0. Case 2: a ni1 a ni2 a ni /= 0(1,i 2,...,i n We put c 1 = a n a ni2 a ni ani,c 2 = a n a ni2 a ni 1 ani,...,c = a n a ni2 a ni 2 ani. Applying the inequality of the arithmetic and geometric means, we have 1( c1 ali 1 + c 2 ali 2 + +c ali ali1 a li2 a li ( l N with equality for l = n. Soα i1 α i2 α i c 1 α ( + c 2 α ( i c α ( i. α ( n Observe that A ( is an inverse M-matrix, by Lemma 2.1(a, (α ( 1,α( >0. According to Lemma 2.3, we infer that (,i 2,...,i = t=1 ( α ( 1,...,α( n 1, c 1 We now turn to prove the main result. α( + c 2 α( i 2 c t ( α ( 1,...,α( n 1,α( i t 0. 2,..., + + c α( i Theorem 2.6. If A is an inverse M-matrix of order n, then A ( is an inverse M- matrix for any positive integer >1. Proof. We proceed by induction on n. It is not difficult to verify that our assertion is true for n = 2. Now we assume that n 3, and the assertion is true for all inverse M-matrices of size at most n 1. Let b ij denote the (i, jth entry of adj A (, then it is easy to see that ( [A(σ ] ( [A(σ, j] ( b ij = [A(i, σ ] (, a ij where i, j N, i/= j, σ = N\{i, j}. Define A(σ A(σ, i A(σ, j B =, A(i, σ a ii a ij
8 60 S. Chen / Linear Algebra and its Applications 381 ( and let β 1,β 2,...,β n 1,β n be the columns of B. By Lemma 2.1(c, the matrix A(σ A(σ, i A(σ, j H = A(i, σ a ii a ij A(j, σ a ji a jj is an inverse M-matrix. In view of Lemma 2.1(d, we have (β 1,β 2,...,β n 1 1 β n = (x 1,x 2,..., x n 1 T 0, thus, β n = n 1 i=1 x iβ i, and hence β ( n 1 n 1 n 1 x i1 β i1 x i2 β i2 x i β i n = = =1 1,i 2,...,i n 1 i 2 =1 i =1 x i1 x i2 x i (β i1 β i2 β i. (3 By the induction hypothesis, we now that each proper principal submatrix of H ( is an inverse M-matrix. In particular, the matrix (β ( 1,β( 2,...,β( n 2,β( n 1 is an inverse M-matrix of order n 1. Using Eq. (3, we deduce that b ij = ( β ( 1,β( 2,...,β( n 2,β( n = x i1 x i2 x i ( β ( 1,β( 2,...,β( n 2,β β i2 β i 1,i 2,...,i n 1 0 (by Lemma 2.5 whence adj A ( is a Z-matrix. Finally, Theorem 2.4 ensures that A ( is an inverse M-matrix, and the result follows. Acnowledgement I than the referee for many valuable suggestions which improved our presentation. References [1] M. Neumann, A conjecture concerning the Hadamard product of inverses of M-matrices, Linear Algebra Appl. 285 ( [2] C.R. Johnson, Closure properties of certain positivity classes of matrices under various algebraic operations, Linear Algebra Appl. 97 ( [3] C.R. Johnson, Inverse M-matrices, Linear Algebra Appl. 47 ( [4] C.R. Johnson, R.L. Smith, Almost principal minors of inverse M-matrices, Linear Algebra Appl. 337 ( [5] R.A. Willoughby, The inverse M-matrix problem, Linear Algebra Appl. 18 ( [6] B.Y. Wang, X.P. Zhang, F.Z. Zhang, On the Hadamard products of inverse M-matrices, Linear Algebra Appl. 305 (
ELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES
ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ZHONGPENG YANG AND XIAOXIA FENG Abstract. Under the entrywise dominance partial ordering, T.L. Markham
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationJurgen Garlo. the inequality sign in all components having odd index sum. For these intervals in
Intervals of Almost Totally Positive Matrices Jurgen Garlo University of Applied Sciences / FH Konstanz, Fachbereich Informatik, Postfach 100543, D-78405 Konstanz, Germany Abstract We consider the class
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationModified Gauss Seidel type methods and Jacobi type methods for Z-matrices
Linear Algebra and its Applications 7 (2) 227 24 www.elsevier.com/locate/laa Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices Wen Li a,, Weiwei Sun b a Department of Mathematics,
More informationOn the second Laplacian eigenvalues of trees of odd order
Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More informationb jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60
On the Hu-Hurley-Tam Conjecture Concerning The Generalized Numerical Range Che-Man Cheng Faculty of Science and Technology, University of Macau, Macau. E-mail: fstcmc@umac.mo and Chi-Kwong Li Department
More informationEquivalence constants for certain matrix norms II
Linear Algebra and its Applications 420 (2007) 388 399 www.elsevier.com/locate/laa Equivalence constants for certain matrix norms II Bao Qi Feng a,, Andrew Tonge b a Department of Mathematical Sciences,
More informationMatrix Completion Problems for Pairs of Related Classes of Matrices
Matrix Completion Problems for Pairs of Related Classes of Matrices Leslie Hogben Department of Mathematics Iowa State University Ames, IA 50011 lhogben@iastate.edu Abstract For a class X of real matrices,
More informationGeneralized Schur complements of matrices and compound matrices
Electronic Journal of Linear Algebra Volume 2 Volume 2 (200 Article 3 200 Generalized Schur complements of matrices and compound matrices Jianzhou Liu Rong Huang Follow this and additional wors at: http://repository.uwyo.edu/ela
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationRelationships between the Completion Problems for Various Classes of Matrices
Relationships between the Completion Problems for Various Classes of Matrices Leslie Hogben* 1 Introduction A partial matrix is a matrix in which some entries are specified and others are not (all entries
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard
More informationInterpolating the arithmetic geometric mean inequality and its operator version
Linear Algebra and its Applications 413 (006) 355 363 www.elsevier.com/locate/laa Interpolating the arithmetic geometric mean inequality and its operator version Rajendra Bhatia Indian Statistical Institute,
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationPerron eigenvector of the Tsetlin matrix
Linear Algebra and its Applications 363 (2003) 3 16 wwwelseviercom/locate/laa Perron eigenvector of the Tsetlin matrix RB Bapat Indian Statistical Institute, Delhi Centre, 7 SJS Sansanwal Marg, New Delhi
More informationarxiv: v1 [math.co] 10 Aug 2016
POLYTOPES OF STOCHASTIC TENSORS HAIXIA CHANG 1, VEHBI E. PAKSOY 2 AND FUZHEN ZHANG 2 arxiv:1608.03203v1 [math.co] 10 Aug 2016 Abstract. Considering n n n stochastic tensors (a ijk ) (i.e., nonnegative
More informationYimin Wei a,b,,1, Xiezhang Li c,2, Fanbin Bu d, Fuzhen Zhang e. Abstract
Linear Algebra and its Applications 49 (006) 765 77 wwwelseviercom/locate/laa Relative perturbation bounds for the eigenvalues of diagonalizable and singular matrices Application of perturbation theory
More informationHierarchical open Leontief models
Available online at wwwsciencedirectcom Linear Algebra and its Applications 428 (2008) 2549 2559 wwwelseviercom/locate/laa Hierarchical open Leontief models JM Peña Departamento de Matemática Aplicada,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationAnn. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
Ann Funct Anal 5 (2014), no 2, 127 137 A nnals of F unctional A nalysis ISSN: 2008-8752 (electronic) URL:wwwemisde/journals/AFA/ THE ROOTS AND LINKS IN A CLASS OF M-MATRICES XIAO-DONG ZHANG This paper
More informationPersistence and global stability in discrete models of Lotka Volterra type
J. Math. Anal. Appl. 330 2007 24 33 www.elsevier.com/locate/jmaa Persistence global stability in discrete models of Lotka Volterra type Yoshiaki Muroya 1 Department of Mathematical Sciences, Waseda University,
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J MATRIX ANAL APPL Vol 30, No 4, pp 1761 1772 c 2009 Society for Industrial and Applied Mathematics INTERVAL GAUSSIAN ELIMINATION WITH PIVOT TIGHTENING JÜRGEN GARLOFF Abstract We present a method
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationSome New Results on Lyapunov-Type Diagonal Stability
Some New Results on Lyapunov-Type Diagonal Stability Mehmet Gumus (Joint work with Dr. Jianhong Xu) Department of Mathematics Southern Illinois University Carbondale 12/01/2016 mgumus@siu.edu (SIUC) Lyapunov-Type
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 36 (01 1960 1968 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa The sum of orthogonal
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationPrimes in the Semigroup of Non-Negative Matrices
Linear and Multilinear Algebra, 1974, Vol. 2, pp. 135-140 Gordon and Breach Science Publishers Ltd. Printed in Great Britain Primes in the Semigroup of Non-Negative Matrices DANIEL J. RICHMAN and HANS
More informationELA
Volume 16, pp 171-182, July 2007 http://mathtechnionacil/iic/ela SUBDIRECT SUMS OF DOUBLY DIAGONALLY DOMINANT MATRICES YAN ZHU AND TING-ZHU HUANG Abstract The problem of when the k-subdirect sum of a doubly
More informationMatrices with convolutions of binomial functions and Krawtchouk matrices
Available online at wwwsciencedirectcom Linear Algebra and its Applications 429 (2008 50 56 wwwelseviercom/locate/laa Matrices with convolutions of binomial functions and Krawtchouk matrices orman C Severo
More informationSign Patterns with a Nest of Positive Principal Minors
Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationOrdering trees by their largest eigenvalues
Linear Algebra and its Applications 370 (003) 75 84 www.elsevier.com/locate/laa Ordering trees by their largest eigenvalues An Chang a,, Qiongxiang Huang b a Department of Mathematics, Fuzhou University,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationSign Patterns that Allow Diagonalizability
Georgia State University ScholarWorks @ Georgia State University Mathematics Dissertations Department of Mathematics and Statistics 12-10-2018 Sign Patterns that Allow Diagonalizability Christopher Michael
More informationThe following two problems were posed by de Caen [4] (see also [6]):
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the
More informationSufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof
Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof David M. Mandy Department of Economics University of Missouri 118 Professional Building Columbia, MO 65203 USA mandyd@missouri.edu
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationThe maximal determinant and subdeterminants of ±1 matrices
Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,
More informationThe effect on the algebraic connectivity of a tree by grafting or collapsing of edges
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing
More informationPossible numbers of ones in 0 1 matrices with a given rank
Linear and Multilinear Algebra, Vol, No, 00, Possible numbers of ones in 0 1 matrices with a given rank QI HU, YAQIN LI and XINGZHI ZHAN* Department of Mathematics, East China Normal University, Shanghai
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationReview of Vectors and Matrices
A P P E N D I X D Review of Vectors and Matrices D. VECTORS D.. Definition of a Vector Let p, p, Á, p n be any n real numbers and P an ordered set of these real numbers that is, P = p, p, Á, p n Then P
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationOn Euclidean distance matrices
Linear Algebra and its Applications 424 2007 108 117 www.elsevier.com/locate/laa On Euclidean distance matrices R. Balaji 1, R.B. Bapat Indian Statistical Institute, Delhi Centre, 7 S.J.S.S. Marg, New
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationLinear Algebra and its Applications
Linear Algebra its Applications 432 21) 394 41 Contents lists available at ScienceDirect Linear Algebra its Applications journal homepage: wwwelseviercom/locate/laa On the Perron exponents of discrete
More information(1) 0 á per(a) Í f[ U, <=i
ON LOWER BOUNDS FOR PERMANENTS OF (, 1) MATRICES1 HENRYK MINC 1. Introduction. The permanent of an «-square matrix A = (a^) is defined by veria) = cesn n II «"( j. If A is a (, 1) matrix, i.e. a matrix
More informationProperties for the Perron complement of three known subclasses of H-matrices
Wang et al Journal of Inequalities and Applications 2015) 2015:9 DOI 101186/s13660-014-0531-1 R E S E A R C H Open Access Properties for the Perron complement of three known subclasses of H-matrices Leilei
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 2889 2895 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Idempotent elements
More informationOn the Schur Complement of Diagonally Dominant Matrices
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
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationOn a refinement of Wilf-equivalence for permutations
On a refinement of Wilf-equivalence for permutations Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yaqiu Zhang Department of Mathematics
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (2009) 274 296 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Boolean inner-product
More informationThe skew-symmetric orthogonal solutions of the matrix equation AX = B
Linear Algebra and its Applications 402 (2005) 303 318 www.elsevier.com/locate/laa The skew-symmetric orthogonal solutions of the matrix equation AX = B Chunjun Meng, Xiyan Hu, Lei Zhang College of Mathematics
More informationThe Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size
Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of
More informationCospectral graphs and the generalized adjacency matrix
Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,
More informationMAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM
MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM OLGA SLYUSAREVA AND MICHAEL TSATSOMEROS Abstract. The principal pivot transform (PPT) is a transformation of a matrix A tantamount to exchanging
More informationRATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS. February 6, 2006
RATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS ATOSHI CHOWDHURY, LESLIE HOGBEN, JUDE MELANCON, AND RANA MIKKELSON February 6, 006 Abstract. A sign pattern is a
More informationON THE MONOTONICITY OF THE DITTERT FUNCTION ON CLASSES OF NONNEGATIVE MATRICES
Bull. Korean Math. Soc. 30 (993), No. 2, pp. 265 275 ON THE MONOTONICITY OF THE DITTERT FUNCTION ON CLASSES OF NONNEGATIVE MATRICES GI-SANG CHEON. Introduction Let n denote the set of all n n doubly stochastic
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
More informationInequalitiesInvolvingHadamardProductsof HermitianMatrices y
AppliedMathematics E-Notes, 1(2001), 91-96 c Availablefreeatmirrorsites ofhttp://math2.math.nthu.edu.tw/»amen/ InequalitiesInvolvingHadamardProductsof HermitianMatrices y Zhong-pengYang z,xianzhangchong-guangcao
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationINVERSE CLOSED RAY-NONSINGULAR CONES OF MATRICES
INVERSE CLOSED RAY-NONSINGULAR CONES OF MATRICES CHI-KWONG LI AND LEIBA RODMAN Abstract A description is given of those ray-patterns which will be called inverse closed ray-nonsingular of complex matrices
More informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More informationYet Another Proof of Sylvester s Identity
Yet Another Proof of Sylvester s Identity Paul Vrbik 1 1 University of Newcastle Australia Sylvester s Identity Let A be an n n matrix with entries a i,j for i, j [1, n] and denote by A i k the matrix
More informationHankel Operators plus Orthogonal Polynomials. Yield Combinatorial Identities
Hanel Operators plus Orthogonal Polynomials Yield Combinatorial Identities E. A. Herman, Grinnell College Abstract: A Hanel operator H [h i+j ] can be factored as H MM, where M maps a space of L functions
More informationTwo applications of the theory of primary matrix functions
Linear Algebra and its Applications 361 (2003) 99 106 wwwelseviercom/locate/laa Two applications of the theory of primary matrix functions Roger A Horn, Gregory G Piepmeyer Department of Mathematics, University
More informationInterlacing Inequalities for Totally Nonnegative Matrices
Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are
More informationOperations On Networks Of Discrete And Generalized Conductors
Operations On Networks Of Discrete And Generalized Conductors Kevin Rosema e-mail: bigyouth@hardy.u.washington.edu 8/18/92 1 Introduction The most basic unit of transaction will be the discrete conductor.
More informationSparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University
Sparsity of Matrix Canonical Forms Xingzhi Zhan zhan@math.ecnu.edu.cn East China Normal University I. Extremal sparsity of the companion matrix of a polynomial Joint work with Chao Ma The companion matrix
More informationMatrix Inequalities by Means of Block Matrices 1
Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,
More informationOn Expected Gaussian Random Determinants
On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose
More informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationSums of diagonalizable matrices
Linear Algebra and its Applications 315 (2000) 1 23 www.elsevier.com/locate/laa Sums of diagonalizable matrices J.D. Botha Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003
More informationON A CHARACTERIZATION OF THE KERNEL OF THE DIRICHLET-TO-NEUMANN MAP FOR A PLANAR REGION
ON A CHARACTERIZATION OF THE KERNEL OF THE DIRICHLET-TO-NEUMANN MAP FOR A PLANAR REGION DAVID INGERMAN AND JAMES A. MORROW Abstract. We will show the Dirichlet-to-Neumann map Λ for the electrical conductivity
More informationKey words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.
May 7, DETERMINING WHETHER A MATRIX IS STRONGLY EVENTUALLY NONNEGATIVE LESLIE HOGBEN 3 5 6 7 8 9 Abstract. A matrix A can be tested to determine whether it is eventually positive by examination of its
More informationDeterminants. Beifang Chen
Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,
More informationRANK-WIDTH AND WELL-QUASI-ORDERING OF SKEW-SYMMETRIC OR SYMMETRIC MATRICES
RANK-WIDTH AND WELL-QUASI-ORDERING OF SKEW-SYMMETRIC OR SYMMETRIC MATRICES SANG-IL OUM Abstract. We prove that every infinite sequence of skew-symmetric or symmetric matrices M, M 2,... over a fixed finite
More informationQuadratic Gauss sums on matrices
Linear Algebra and its Applications 384 (2004) 187 198 www.elsevier.com/locate/laa Quadratic Gauss sums on matrices Mitsuru Kuroda 410, Haitsu-hosha, 61, Nojiri-cho, Sakai, Osaka 599-8116, Japan Received
More informationThe total positivity interval
Linear Algebra and its Applications 393 (2004) 197 202 wwwelseviercom/locate/laa The total positivity interval GML Gladwell a,, K Ghanbari b a Department of Civil Engineering, University of Waterloo, Waterloo,
More informationPrepared by: M. S. KumarSwamy, TGT(Maths) Page
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 50 - CHAPTER 3: MATRICES QUICK REVISION (Important Concepts & Formulae) MARKS WEIGHTAGE 03 marks Matrix A matrix is an ordered rectangular array of numbers
More informationA gap result for the norms of semigroups of matrices
Linear Algebra and its Applications 402 (2005) 101 110 www.elsevier.com/locate/laa A gap result for the norms of semigroups of matrices Jason P. Bell Department of Mathematics, University of Michigan,
More informationMatrix rigidity and elimination theory
Matrix rigidity and elimination theory Abhinav Kumar joint work with Satya Lokam, Vijay Patankar and Jalayal Sarma M.N. MIT April 25, 2012 Abhinav Kumar (MIT) Matrix rigidity and elimination theory April
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 433 (2010) 476 482 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Nonsingularity of the
More informationarxiv:math/ v5 [math.ac] 17 Sep 2009
On the elementary symmetric functions of a sum of matrices R. S. Costas-Santos arxiv:math/0612464v5 [math.ac] 17 Sep 2009 September 17, 2009 Abstract Often in mathematics it is useful to summarize a multivariate
More information