Ann. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
|
|
- Amber Bradley
- 5 years ago
- Views:
Transcription
1 Ann Funct Anal 5 (2014), no 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:wwwemisde/journals/AFA/ THE ROOTS AND LINKS IN A CLASS OF M-MATRICES XIAO-DONG ZHANG This paper is dedicated to Professor Tsuyoshi Ando Communicated by Q-W Wang Abstract In this paper, we discuss exiting roots of sub-kernel transient matrices P associated with a class of M matrices which are related to generalized ultrametric matrices Then the results are used to describe completely all links of the class of matrices in terms of structure of the supporting tree 1 Introduction Let I be a finite set and I = n U = (U ij, i, j I) is ultrametric matrix if it is symmetric, nonnegative and satisfies the ultrametric inequality U ij min{u ik, U kj } for all i, j, k I The ultrametric matrices have an important property that if U is nonsingular ultrametric matrix, then the inverse of U is row and column diagonally dominant M matrix (see [7] and [13]) A construction also was given in [13] to describe all such ultrametric matrices Later, nonsymmetric ultrametric matrices were independently defined by McDonald, Neumann, Schneider and Tsatsomeros in [11] and Nabben and Varge in [14], ie, nested block form(nbf) matrices and generalized ultrametric(gu) matrices After a suitable permutation, every GU matrix can be put in NBF They satisfy ultrametric inequality and are described with dyadic trees in [11], [14] and [4] On the inequality of M matrices and inverse M matrices, Ando in [1] presents many nice and excellent inequalities which play an key role in the nonnegative matrix theory Zhang [15] characterized equality cases in Fisher, Oppenheim and Ando inequalities For more detail information on inverse M and Z matrices, the reader is referred to [6], [8], Date: Received: September 23, 2013; Accepted: December 4, Mathematics Subject Classification Primary 15B48; Secondary 47B99, 6010 Key words and phrases Inverse M matrix, tree, exiting root, link 127
2 128 X-D ZHANG [9], [10], [16] and the references in there In this paper, we follows closely the global frame work and notation on generalized ultrametric matrices supplied by Dellacherie, Martínez and Martín in [4] Recently, Nabben was motivated by the result of Fiedler in [5] and defined a new class of matrices: U-matrices (see Section 2) which satisfy ultrametric inequality and are related to GU matrices There is a common characterization in these matrices that if they are nonsingular, then their inverses are column diagonally dominant M matrices For each η η(u) = max{(u 1 ) ii, i I}, define matrix P = E η 1 U 1, where E is the identity matrix Then P is sub-markov kernel: P ij 0, for all i, j I and 1 t P 1 t (entry-wise), where 1 is the column vector of all ones Therefore ηu = (E P ) 1 = m 0 and U is proportional to the potential matrix associated to the transient kernel P Since P ij > 0 if and only if (U 1 ) ij < 0 for i j, the existence of links between different points does not depend on η, while the condition P ii > 0 depends on the value of η Define the potential vector µ = µ U associated to U by µ := U 1 1 and its total mass µ := 1 t µ Note that the following equivalence holds P m µ i > 0 (U 1 1) i > 0 (P 1) i < 1 Every i satisfying this property is called an exiting root of U(or of P ) The set of them is denoted by R := R U The potential vector ν := ν U associated to U t is given by ν := (U t ) 1 1 and ν := 1 t ν Notice that µ = ν, since 1 t ν = 1 t (U t ) 1 1 = 1 t µ Our main results in this paper are to characterize the following properties (which do not depend on η) i is a exiting root of P and P t ; and link of P, ie, for a given couple i j, whether P ij > 0 for U-matrices These properties and other related problems were completely investigated for symmetric ultrametric matrices and GU matrices in [3] and [4], respectively In Section 2, we revisit U- matrices by means of dyadic tree and give some preliminary results which are very useful In Section 3, we describe exiting root of P and P t with associated trees In Section 4, we characterize completely the links of P 2 U matrices A tree (T, ) is a finite unoriented and connected acyclic graph For (t, s) T T, t s, there is a unique path geod(t, s) of minimum length, which is called the geodic between t and s, while geod(t, t) = {t} which is of length 0 Sometime, we use geod(t, s) to stand for its edge set Fixed r T, we call it the root of tree T If s geod(t, r), we denote s t, which is a partial order relation on T For s, t T, s t = sup{v, v geod(s, r) geod(t, r)} denotes the closest common ancestor of s and t The set of successors of t is s(t) = {s T, s t, (s, t) } Then I( ) = {i T, s(i) = } is the set of leaves of the tree T A tree is said dyadic if s(t) = 2 for t / I( ) The successors of t are denoted by t and t + For t T, the set L(t) := {i I( ), t geod(i, r)} completely characterizes t Hence we can identify t and L(t) In particular, r is identified with L(r) = I( ) and i I( ) with the singleton i Hence we can assume that each vertex of T
3 THE ROOTS AND LINKS IN A CLASS OF M-MATRICES 129 is a subset of the set of leaves I( ) The distinction between the roles of L, as L T (mean that L is a vertex of tree T ) and L I (mean that L is regarded as the subset of I( ) corresponding to the vertex of T ), will be clear in the context when we use them By the above notations and definition of GU matrices in [4], The definition of U matrices in [12] may be restated in the following way Definition 21 U = (U ij : i, j I) is a U matrix if there exists a dyadic tree (T, ) with fixed a root r and a leaf n I, and nonnegative real vectors α = (αt : t T ), β = (β t : t T ) satisfying (i) I = I( ), α I = β I ; and α t = α t n for t r +, t / I; (ii) α t β t for t T ; (iii) α and β are - increasing, ie, t s implies α t α s and β t β s ; (iv) t + geod(r, n) for t geod(r, n) and t n; and α t = β t for t geod(r, n) (v) U ij = α t if (i, j) (t, t + ) and U ij = β s if (i, j) (t +, t ), where t = i j and s = max{i j, i n}; U ii = α i = β i for i I We say that (T, ) support U and U is U associated with tree (T, ) It is easy to show that this definition is equivalent to Definition 21 in [12] Observe that for each L T, the matrix U L L is either GU or U matrix, where the GU matrix consistent with the definition of GU matrix in [4] The tree supporting it, denoted by (T L, L ), is the restriction of (T, ) on L and the associated vectors which are the restrictions of α and β on T L In other words, (T L, L ) is the subtree of (T, ) with the root L and the leaves set L The potential vectors and the exiting roots of U L, U t L are denoted, respectively by µ L, ν L, R L, R t L The sub-kernel corresponding to U L, U t L is denoted by P L, (P t ) L If U is nonsingular U matrix, it can be shown that U L is also nonsingular GU or U matrix by Schur decomposition and induction argument We now introduce the following relation in the set of leaves I For i j, we say i < j if i t, j t + with t = i j Assume that I = {1, 2,, n} By permuting I, we can suppose is the usual relation on I Therefore, we will assume that this is standard presentation of U matrices in this paper In the other words, Let U U and I = I I + Denote := I and K := I + Thus ( ) U α U = I 1 1 t K b K 1 t, U K where α I = min{u ij : i, j I} and b K = U K e K with e K = (0,, 0, 1) t unit vector, ie, b K is the last column of U K Note that in here, U is GU matrix and U K is still U matrix also, which has a similar 2 2 block structure, and its the first diagonal block is a special GU matrix We begin with the following theorem in which we re-prove some known result in [12] Theorem 22 [12] If U is nonsingular U matrix, then (i) α I µ < 1 and ( ) C D U 1 =, E F where
4 130 X-D ZHANG (ii) C = E = U 1 + α I 1 α I µ µ ν t, D = α I µ ν t K, µ I = 1 1 α I e µ K ν t, ( 1 α I µ K 1 α I µ µ µ K µ (1 α Iµ K ) 1 α I µ F = U 1 K + α Iµ e K ν t K e K ) ( 0 ; ν I = νk (iii) µ I = µ K (iv) (µ I ) i 0 for i = 1, 2,, n 1 (v) (ν I ) i = 0 for i = 1, 2,, n 1; and (ν I ) n = µ I = 1 Proof Since U is nonsingular, U is nonsingular GU matrix By Theorem 36(i) in [11], α µ 1, where α is smallest entry in U Hence α I µ α µ 1 Suppose that α I µ = 1, by theorem 36(ii) in [11], U has a row whose entries are all equal to α I Noting that the last row whose entries are equal to, there are two rows which are proportional, which implies U is singular, a contradiction Therefore α I µ < 1 By Schur decomposition and the inverse of matrix formula, it is not difficult to show that the rest of (i) holds Since µ = ν and µ K = ν K, C1 + D1 K = U 1 1 α I + µ ν 1 α I µ 1 t + α I µ ν 1 α I µ K1 t K E1 + F 1 K = = 1 α Iµ K µ, ) 1 e K ν 1 α I µ 1 t + U 1 K 1 K + α Iµ e K ν 1 α I µ K1 t K = µ K µ (1 α I µ K ) e K, 1 t C + 1 t KE = 1 t U 1 + = 0, 1 t D + 1 t KF = α I 1 t 1 α I µ µ νk t + 1 t KU 1 K = νk t So (ii) holds Furthermore, α I 1 t 1 α I µ µ ν t + 1 t 1 K e K ν t + 1t K µ I = 1 α Iµ K µ + µ K µ (1 α I µ K ) = µ K α I µ e K νk t 1 Thus (iii) holds Since e t I U = 1t, ν I = 1 e I which implies µ I = ν I = 1 By (iii), we have 1 α I µ K = 1 α I µ I 1 α I 0 Hence it is easy to show that (iv) and (v) hold by using the induction on the dimension of U
5 THE ROOTS AND LINKS IN A CLASS OF M-MATRICES Exiting roots of P In order to characterize the exiting roots of P, we introduce some notations and symbols Let U be a U matrix with supporting tree (T, ) and fixed a root r and a leaf n For i I( ), denote by N + i = {L T : L i, α L = α i } and N i = {L T : L i, β L = β i } Now we can construct the set Γ t : for L / geod(r, n), (L, L ) Γ t if and only if there exists a i L + such that L N i ; (L, L+ ) Γ t if and only if there exists a i L such that L N + i For L geod(r, n), (L, L ) Γ t and (L, L + ) / Γ t Theorem 31 Let U be nonsingular U Then (i) R t I = {n} (ii) For L T, i R t L if and only if geod(i, L) Γt = Proof (i) follows from Theorem 22 (v) We prove the assertion (ii) by using an induction on the dimension n of U It is trivial for n = 1, 2 Assume that ( ) U α U = I 1 1 t K b K 1 t U K If L I, then U L = (U ) L is GU matrix By Theorem 3 in [4] and (r, r ) / geod(i, L), the assertion (ii) holds If L I +, then U L = (U K ) L is still U matrix By the hypothesis and (r, r + ) / geod(i, L), i R t L if and only if geod(i, L) Γt = If L = I, then for i n, (i n, (i n) ) Γ t and geod(i, L) Γ t ; for i = n, geod(i, L) Γ t = Hence by (i), L T, i R t L if and only if geod(i, L) Γ t = In order to describe the exiting of P, we construct the set Γ: For each L T, (L, L ) Γ, (L, L + ) Γ, if and only if there exists i L +, i L, such that L N + i, L N, respectively Theorem 32 Let U = (U ij, i, j I) be a nonsingular U matrix Then (i) n i R if and only if geod(i, I) Γ = (ii) If L T, then n i R L if and only if geod(i, I) Γ = Proof (i) We prove the assertion by the induction It is trivial for n = 1, 2 We assume that ( ) U α U = I 1 1 t K b K 1 t, U K where α I = min{u ij : i, j I}, b K = U K e K with e K = (0,, 0, 1) t unit vector, U is GU matrix and U K is U matrix By Theorem 22(ii), we have ( ) µ I = 1 α I µ K 1 α I µ µ µ K µ (1 α Iµ K ) 1 α I µ Now we consider the following two cases Case 1: i I Then i R if and only if i R and 1 α I µ K > 0 by Theorem 22 (ii) Note that µ I = µ K from Theorem 22 (iii) 1 α I µ K = 0 if and only if α I = α n if and only if (I, I ) Γ because it follows from the definition of Γ, and if there exists an n q I + such that I N q + which implies α I = α q by definition of 21(i) Therefore each entries of the q th row is α q which implies e K
6 132 X-D ZHANG that U is singular Hence 1 α I µ K > 0 if and only if (I, I ) / Γ By the induction hypothesis, n i R if and only if geod(i, I) Γ = Case 2: i I + Suppose that (I, I + ) Γ Then there exists j 0 I such that I N j 0 which implies β I = β j0 Hence β j0 = α I follows from α I = β I So U is singular, a contradiction Therefore (I, I + ) / Γ By Theorem 22 (ii), n i R if and only if n i R K Because U K is U matrix, n i R if and only if geod(i, I + ) Γ = by the induction hypothesis, so if and only geod(i, I) Γ = (ii) Since U L is GU matrix or U matrix, the assertion follows from Theorem 3 in [4] or (i) Theorem 33 Let U be a U matrix Then (i) U 1 is row diagonal dominant M matrix if and only if µ µ n L (1 α L µ L +) (31) 1 α L µ L L geod(r,n),l n (ii) n R if and only if (31) becomes strict inequality Proof From Theorem 22 (ii), the sum of n th row of U 1 is (µ K ) n µ I (1 α Iµ I +), 1 α I µ I where (µ K ) n is the last component of µ K Hence by the induction hypothesis, the sum of n th row of U 1 is µ µ n L (1 α L µ L +) 1 α L µ L L geod(r,n),l n Therefore (i) follows from Theorem 22 (iii) (ii) is just a consequence of (i) and the definition of exiting Lemma 34 Let U = (U ij, i, j I) a nonsingular GU matrix Then U ii µ I 1 for all i I Moreover, max{u ii, i I}µ I = 1 if and only if there exist a column whose entries are equal to max{u ii, i I} Proof Since U is a GU matrix and 1 = UU 1 1 = Uµ, 1 = n j=1 U ij(µ I ) j n j=1 U ii(µ I ) j Hence we have U ii µ I 1 for i I Let max{u ii } = U qq and suppose that U qq µ I = 1 Then 1 = n j=1 U ij(µ I ) j n j=1 U ii(µ I ) j U qq µ I = 1 Hence n j=1 (U ij U qq )µ j = 0 for i I, which yields the result Conversely, let 1 max{u ii } = U qq and e q = (0,, U qq,, 0) t Then Ue q = 1 Hence µ = e q and U qq µ I = 1 Theorem 35 Let U be a nonsingular U matrix If there exists i with i n such that U ii < Then U is not a row diagonally dominant matrix, neither n is a root of P Proof We prove the assertion by the induction on the dimension of matrix U It is easy to show that the assertion holds for order n = 1, 2 Now we assume that ( ) U α U = I 1 1 t K b K 1 t U K
7 THE ROOTS AND LINKS IN A CLASS OF M-MATRICES 133 If there exists a i K such that (U) ii <, then by the induction hypothesis, the last component of µ K is less than 0 So (µ I ) n < 0 by theorem 22(ii) Hence we assume that there exists a i such that U ii < Then by Lemma 34, µ 1 (U ) ii = 1 U ii Hence i K (µ I ) i = µ K µ (1 α I µ K ) = µ K µ 1 ( 1 1 ) < 0, U ii since µ K = µ I = 1 by Theorem 22 (iii) and (v) On the other hand, (µ I ) j 0 for i K \ {n} Therefore, (µ I ) n < 0 So the assertion holds Corollary 36 Let U be a nonsingular U matrix If there exists a i with i n such that U ii then n is not root of P Proof It follows from Theorem 35 and its proof Lemma 37 Let U be a U matrix If j I U nj j I U ij for i = 1, 2,, n 1 Then U is a row and column diagonally dominant M-matrix and n is an exiting of P Proof From U 1 U = I n, 1 = j I l I (U 1 ) nl U lj = l I, l n j I U lj(u 1 ) nl + j I U nj(u 1 ) nn Since (U 1 ) nl 0 for l n and j I U nj j I U lj for l n, 1 l I, l n j I U nj(u 1 ) nl + j I U nj(u 1 ) nn = j I U nj l I (U 1 ) nl Hence l I (U 1 1 ) nl P > 0 Hence the result follows form theorem j I U nj 22 4 Links of P In this section, we describe completely the links of transient kernel P associated with a class of U matrices Firstly we give some lemmas Lemma 41 Let U be a nonsingular U matrix Then for i, j I =, i j, (U 1 ) ij < 0 if and only if (U 1 ) ij < 0 and U ij > α I Proof Necessity By Theorem 22, we have (U 1 ) = U 1 α I + µ ν t = (U (α I )) 1, where U (α I ) = U α I 1 1 t is a nonsingular GU matrix Hence for i, j I =, (U 1 ) ij < 0 implies (U 1 ) ij < 0 Further, by Theorem 36 in [14], (U 1 ) ij = (U (α I )) 1 ij < 0 implies that (U (α I )) ij > 0 So U ij > α I Sufficiency Note that α I < min{(u ) ii } (otherwise every entries of some row rather than n is α I which yields U is singular) Note that U is a GU matrix By Theorem 6 in [4], (U 1 ) ij < 0 implies that (U 1 ) ij = (U (α I ) 1 ) ij < 0 Lemma 42 Let U be a nonsingular U matrix of order n Then (i) for i I =, j I + = K, (U 1 ) ij < 0 if and only if i R and j = n (ii) for i I +, j I, (U 1 ) ij < 0 if and only if i = n and j R
8 134 X-D ZHANG Proof (i) For i I =, j I + = K, by Theorem 22 (i), (U 1 ) ij = ( α I 1 α I µ µ ν t K ) ij < 0 if and only if (µ ) i > 0 and (ν K ) j > 0 if and only if i R and j = n (ii) For i I =, j I + = K, by Theorem 22, (U 1 ) ij < 0 if and only if 1 ( 1 α I e µ K ν t ) ij < 0 if and only if i = n and j R Lemma 43 Let U be a nonsingular U matrix Then for i I + = K, j I + and i j, (U 1 ) ij < 0 if and only if (U 1 K ) ij < 0 Proof The assertion follows from Theorem 22 (V) Now we can state the main result in this section Theorem 44 Let U be a nonsingular U matrix associated supporting tree (T, T ) with fixed the leaf n Suppose that i j and i j = L (i) If L geod(i, n), then P ij > 0 if and only if (P L ) ij > 0; ie, if and only if (ia) for i L, j L +, i R L and j = n (ib) for i I +, j I, i = n and j R L (ii) If L / geod(i, n) and L 1 = (i j) n, then (iia) (P L ) ij > 0 if and only if i R L and j R L + for i L, j L + ; and i R L + and j R L for i L +, j L (iib) (P L 1 )ij > 0 if and only if (P L ) ij > 0; and either U ij > α L, or U ij = α ij and for every M L such that α M = α L implies that (M, M ) / Γ t for {i, j} M, (M, M + ) / Γ for {i, j} M + hold (iic) P ij > 0 if and only if (P L 1 )ij > 0 and U ij > α L1 Proof We prove the assertion by the dimension of the matrix U It is trivial for n = 1, 2 Now assume that i j and i j = L Case 1: L geod(i, n) If L = I, then i I (or I + ) and j I + ( or I ) Hence by Lemma 42 and (2), the assertion (i) holds If L I, then L I + and i, j I + So by Lemma 43, we have P ij > 0 if and only if (U 1 ) ij < 0 if and only if (U 1 I ) + ij < 0 Since U I + is a U matrix, by the induction hypothesis, we have (U 1 ) ij < 0 if and only if (P L ) ij > 0 Moreover, the rest of (i) follows from Lemma 42 Case 2: L / geod(i, n) If L 1 = I, then i, j L I and U is a GU matrix Hence (iia) and (iib) follow from Theorem 4 in [4] At the same time, (iic) follows from Lemma 41 and (2) that P ij > 0 if and only if (U 1 I ) ij < 0 and U ij > α L1 If L 1 I, then P ij > 0 if and only if (U 1 ) ij < 0 if and only if (U 1 I ) + ij < 0 if and only if (P I+ ) ij > 0 By the induction hypothesis and Theorem 4 in [4], the assertions of (i) and (ii) hold Corollary 45 Let U be a nonsingular U matrix A B n, then (U 1 ) ij = 0 for i A and j B If A, B geod(i, n) and Proof Since A B = A or B, The result follows from Theorem 44 (i)
9 THE ROOTS AND LINKS IN A CLASS OF M-MATRICES 135 Corollary 46 Let U be nonsingular U matrix with supporting tree If β i = β t for all t i and all i I, then the inverse of U has the following structure: W W 1s U 1 = 0 W 22 0 W 2s, W s1 W s2 W s,s 1 W ss where W ii is a lower triangular matrix for i = 2, 3, s 1; W ss is a 1 1 matrix Moreover, if β i > β t for all t i and all i I; and both α I > α I and β A > β A for A geod(i, n); then each entry of W 11 is nonzero, each entry of W is and W si is nonzero for i = 1,, s; and each each entry of the lower part of lower triangular matrix W ii is zero for i = 2,, s 1 Proof We partition the blocks of U 1 = (W ij ) corresponding to the leaves sets of vertices of geod(i, n) In particular, W ss is corresponding to fixed vertex n By Corollary 45, W ij = 0 for i j s Further, it follows from Theorem 44(iic) that W ii is a lower triangular matrix for i = 2,, s 1, since for A I +, α A = α A n Let n A geod(a, n) Since β i > β t for all t i and all i I, U A is a strictly generalized ultrametric matrix Hence by Theorem 44(iia) and (iib) or Theorem 35 in [14], each entry of W 11 is nonzero, since α I > α I ; and each entry of the lower part of the lower triangular matrix W ii is nonzero for i = 2,, s 1, since β A > β A = α A Moreover, since R A = A, each entry of W is and W si is nonzero by Theorem 44 (i) The proof is finished Remark 47 From Theorem 44, it is easy to see that the links of U U are not involved in whether n R or not Hence we may directly determine whether each entries of U 1 is zero or not from the structure of support tree Let us give an example to illustrate Theorems 32 31, 44 Example 48 Let U be a U matrix of order 7 with support tree (T, ) as in the Figure 1, where I is root and 6 is fixed leaf 1(3, 3) 2(3, 3) 3(4, 4) 4(4, 4) 5(4, 4) 6(4, 4) C(2, 4) D(3, 3) A(2, 3) + B(2, 2) + I(1, 1) Fig 1 Then the matrix U and inverse of U are
10 136 X-D ZHANG U = U 1 = 1 8 It is easy to see that Γ = {(A, 2), (C, 4)} and Γ t = {(A, 1), (C, 3), (I, A), (B, C), (D, 5)} By Theorem 32 and Corollary 33, we have R = {1, 3, 5} Further, we determine all links of P by Theorem 44 For instance, in order to determine P 43, we consider 3 4 = C / geod(i, 6) and (3 4) 6 = B By Theorems 32 and 31, 4 R C, 3 R t C + Hence by Theorem 44 (iia), (P C ) 43 > 0 Further, by Theorem 44(iib) and U 43 = 4 > α C = 2, (P B ) 43 > 0 Therefore P 43 > 0 follows from Theorem 44(iic) and U 43 = 4 > α B = 2 Acknowledgement The research is supported by National Natural Science Foundation of China (No ), Innovation Program of Shanghai Municipal Education Commission (No14ZZ016)and Specialized Research Fund for the Doctoral Program of Higher Education (No ) The author would like to thank anonymous referees for their comments and suggestions References 1 T Ando, Inequalities for M -matrices, Linear Multilinear Algebra 8 (1979/80), no 4, A Berman and RS Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic 1979, SIAM 1994, New York 3 C Dellacherie, S Martínez and S Martín, Ultrametric matrices and induced Markov chains, Adv in Appl Math 17 (1996), C Dellacherie, S Martínez and S Martín, Description of the sub-markov kernel associated to generalized ultrametric matrices: an algorithmic approach, Linear Algebra Appl 318 (2000), M Fiedler, Special ultrametric matrices and graphs, SIAM Matrix Anal Appl 22 (2000), CR ohnson and RL Smith, Inverse M -matrices, II, Linear Algebra Appl 435 (2011), no 5, S Martínez, G Michon and S Martín, Inverses of ultrametric matrices are of Stieltjes types, SIAM Matrix Anal Appl 15 (1994), S Martínez, S Martín and X-D Zhang,A new class of inverse M-matrices of tree-like type, SIAM Matrix Anal Appl 24 (2003), no 4, S Martínez, S Martín and X-D Zhang, A class of M matrices whose graphs are trees, Linear Multilinear Algebra 52 (2004), no 5, McDonald, R Nabben, M Neumann, H Schneider and M Tsatsomeros, Inverse tridiagonal Z matrices, Linear Multilinear Algebra 45 (1998), McDonald, M Neumann, H Schneider and M Tsatsomeros, Inverse M-matrix inequalities and generalized ultrametric matrices, Linear Algebra Appl 220 (1995), R Nabben, A class of inverse M-matrices, Electron Linear Algebra 7 (2000),
11 THE ROOTS AND LINKS IN A CLASS OF M-MATRICES R Nabben and RS Varga, A linear algebra proof that the inverses of strictly ultrametric matrix is a strictly diagonally dominant are of Stieljes types, SIAM Matrix Anal Appl 15 (1994), R Nabben and RS Varga, Generalized ultrametric matrices- a class of inverse M- matrices, Linear Algebra Appl 220 (1995), X-D Zhang, The equality cases for the inequalities of Fischer, Oppenheim, and Ando for general M-matrices, SIAM Matrix Anal Appl 25 (2003), no 3, X-D Zhang, A note on ultrametric matrices, Czechoslovak Math 54(129) (2004), no 4, Department of Mathematics and MOE-LSC, Shanghai iao Tong University, Shanghai , PRChina address: xiaodong@sjtueducn
On The Inverse Mean First Passage Matrix Problem And The Inverse M Matrix Problem
On The Inverse Mean First Passage Matrix Problem And The Inverse M Matrix Problem Michael Neumann Nung Sing Sze Abstract The inverse mean first passage time problem is given a positive matrix M R n,n,
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationThe Laplacian spectrum of a mixed graph
Linear Algebra and its Applications 353 (2002) 11 20 www.elsevier.com/locate/laa The Laplacian spectrum of a mixed graph Xiao-Dong Zhang a,, Jiong-Sheng Li b a Department of Mathematics, Shanghai Jiao
More informationINVERSE TRIDIAGONAL Z MATRICES
INVERSE TRIDIAGONAL Z MATRICES (Linear and Multilinear Algebra, 45() : 75-97, 998) J J McDonald Department of Mathematics and Statistics University of Regina Regina, Saskatchewan S4S 0A2 M Neumann Department
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationELA 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 informationVertex Degrees and Doubly Stochastic Graph Matrices
Vertex Degrees and Doubly Stochastic Graph Matrices Xiao-Dong Zhang DEPARTMENT OF MATHEMATICS, SHANGHAI JIAO TONG UNIVERSITY 800 DONGCHUAN ROAD, SHANGHAI, 200240, P. R. CHINA E-mail: xiaodong@sjtu.edu.cn
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 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 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 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 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 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 informationH-matrix theory vs. eigenvalue localization
Numer Algor 2006) 42: 229 245 DOI 10.1007/s11075-006-9029-3 H-matrix theory vs. eigenvalue localization Ljiljana Cvetković Received: 6 February 2006 / Accepted: 24 April 2006 / Published online: 31 August
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 informationAnn. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:www.emis.
Ann. Funct. Anal. 5 (2014), no. 2, 147 157 A nnals of F unctional A nalysis ISSN: 2008-8752 (electronic) URL:www.emis.de/journals/AFA/ ON f-connections OF POSITIVE DEFINITE MATRICES MAREK NIEZGODA This
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 informationTensor Complementarity Problem and Semi-positive Tensors
DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New
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 the spectra of striped sign patterns
On the spectra of striped sign patterns J J McDonald D D Olesky 2 M J Tsatsomeros P van den Driessche 3 June 7, 22 Abstract Sign patterns consisting of some positive and some negative columns, with at
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 informationk 2r n k n n k) k 2r+1 k 2r (1.1)
J. Number Theory 130(010, no. 1, 701 706. ON -ADIC ORDERS OF SOME BINOMIAL SUMS Hao Pan and Zhi-Wei Sun Abstract. We prove that for any nonnegative integers n and r the binomial sum ( n k r is divisible
More informationarxiv: v1 [math.ra] 11 Aug 2014
Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091
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 informationA property concerning the Hadamard powers of inverse M-matrices
Linear Algebra and its Applications 381 (2004 53 60 www.elsevier.com/locate/laa A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University,
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 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 informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
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 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 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 informationThe third smallest eigenvalue of the Laplacian matrix
Electronic Journal of Linear Algebra Volume 8 ELA Volume 8 (001) Article 11 001 The third smallest eigenvalue of the Laplacian matrix Sukanta Pati pati@iitg.ernet.in Follow this and additional works at:
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 informationInverse Eigenvalue Problems for Two Special Acyclic Matrices
mathematics Communication Inverse Eigenvalue Problems for Two Special Acyclic Matrices Debashish Sharma, *, and Mausumi Sen, Department of Mathematics, Gurucharan College, College Road, Silchar 788004,
More informationHIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION
ISSN 2066-6594 Ann Acad Rom Sci Ser Math Appl Vol 10, No 1/2018 HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION Mircea Merca Dedicated to Professor Mihail Megan on
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 informationDeterminants of Partition Matrices
journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised
More informationA Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations
A Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations Jin Yun Yuan Plamen Y. Yalamov Abstract A method is presented to make a given matrix strictly diagonally dominant
More informationResearch Article Completing a 2 2Block Matrix of Real Quaternions with a Partial Specified Inverse
Applied Mathematics Volume 0, Article ID 7978, 5 pages http://dx.doi.org/0.55/0/7978 Research Article Completing a Block Matrix of Real Quaternions with a Partial Specified Inverse Yong Lin, and Qing-Wen
More informationON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix
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 Operators Preserving the Numerical Range (Radius) on Triangular Matrices
Linear Operators Preserving the Numerical Range (Radius) on Triangular Matrices Chi-Kwong Li Department of Mathematics, College of William & Mary, P.O. Box 8795, Williamsburg, VA 23187-8795, USA. E-mail:
More informationCONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
J. Appl. Math. & Computing Vol. 182005 No. 1-2 pp. 59-72 CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX JAE HEON YUN SEYOUNG OH AND EUN HEUI KIM Abstract. We study convergence
More informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
More informationBOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 4, P AGES 655 664 BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION Guang-Da Hu and Qiao Zhu This paper is concerned with bounds of eigenvalues of a complex
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 informationssm (94)00077-Q J. J. McDonald * Inverse M -Matrix Inequalities and Generalized Ultrametric Matrices
NORm-HOlLAND Inverse M -Matrix Inequalities and Generalized Ultrametric Matrices J. J. McDonald * Department of Mathematics and Statistics University of Regina Regina, Saskatchewan S4S OA2 M. Neumann t
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 informationApplicable Analysis and Discrete Mathematics available online at
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. 8 (2014), 330 345. doi:10.2298/aadm140715008z LAPLACIAN COEFFICIENTS OF UNICYCLIC GRAPHS
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationGeneralizations of M-matrices which may not have a nonnegative inverse
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 2435 2450 www.elsevier.com/locate/laa Generalizations of M-matrices which may not have a nonnegative inverse Abed
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 informationarxiv: v2 [math.co] 6 Oct 2016
ON THE CRITICAL GROUP OF THE MISSING MOORE GRAPH. arxiv:1509.00327v2 [math.co] 6 Oct 2016 JOSHUA E. DUCEY Abstract. We consider the critical group of a hypothetical Moore graph of diameter 2 and valency
More informationAbed Elhashash and Daniel B. Szyld. Report August 2007
Generalizations of M-matrices which may not have a nonnegative inverse Abed Elhashash and Daniel B. Szyld Report 07-08-17 August 2007 This is a slightly revised version of the original report dated 17
More informationPermutation transformations of tensors with an application
DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn
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 information1 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 )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES
olume 10 2009, Issue 2, Article 41, 10 pp. ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG, AND HUA SHAO COLLEGE OF MATHEMATICS AND PHYSICS CHONGQING UNIERSITY
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationThe Strong Largeur d Arborescence
The Strong Largeur d Arborescence Rik Steenkamp (5887321) November 12, 2013 Master Thesis Supervisor: prof.dr. Monique Laurent Local Supervisor: prof.dr. Alexander Schrijver KdV Institute for Mathematics
More informationPositive definite preserving linear transformations on symmetric matrix spaces
Positive definite preserving linear transformations on symmetric matrix spaces arxiv:1008.1347v1 [math.ra] 7 Aug 2010 Huynh Dinh Tuan-Tran Thi Nha Trang-Doan The Hieu Hue Geometry Group College of Education,
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More informationApplied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices
Applied Mathematics Letters 25 (202) 2339 2343 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Comparison theorems for a subclass
More informationarxiv: v1 [math.rt] 4 Dec 2017
UNIFORMLY COLUMN SIGN-COHERENCE AND THE EXISTENCE OF MAXIMAL GREEN SEQUENCES PEIGEN CAO FANG LI arxiv:1712.00973v1 [math.rt] 4 Dec 2017 Abstract. In this paper, we prove that each matrix in M m n (Z 0
More informationDeterminant of the distance matrix of a tree with matrix weights
Determinant of the distance matrix of a tree with matrix weights R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract Let T be a tree with
More informationComputers and Mathematics with Applications. Convergence analysis of the preconditioned Gauss Seidel method for H-matrices
Computers Mathematics with Applications 56 (2008) 2048 2053 Contents lists available at ScienceDirect Computers Mathematics with Applications journal homepage: wwwelseviercom/locate/camwa Convergence analysis
More informationELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n
Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this
More informationImproved Upper Bounds for the Laplacian Spectral Radius of a Graph
Improved Upper Bounds for the Laplacian Spectral Radius of a Graph Tianfei Wang 1 1 School of Mathematics and Information Science Leshan Normal University, Leshan 614004, P.R. China 1 wangtf818@sina.com
More informationGENERALIZED POWER SYMMETRIC STOCHASTIC MATRICES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 27, Number 7, Pages 987 994 S 0002-9939(99)0526-6 Article electronically published on March 7, 999 GENERALIZED POWER SYMMETRIC STOCHASTIC MATRICES
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 informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationDedicated to the late Professors David Hawkins and Hukukane Nikaido
TWO CHARACTERIZATIONS OF INVERSE-POSITIVE MATRICES: THE HAWKINS-SIMON CONDITION AND THE LE CHATELIER-BRAUN PRINCIPLE TAKAO FUJIMOTO AND RAVINDRA R RANADE Dedicated to the late Professors David Hawkins
More informationThe domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
More informationGeometric Mapping Properties of Semipositive Matrices
Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices
More informationOn the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination
On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination J.M. Peña 1 Introduction Gaussian elimination (GE) with a given pivoting strategy, for nonsingular matrices
More informationSpectral radii of graphs with given chromatic number
Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong
More informationSOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX
Iranian Journal of Fuzzy Systems Vol 5, No 3, 2008 pp 15-29 15 SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX M S HASHEMI, M K MIRNIA AND S SHAHMORAD
More informationResearch Article Constrained Solutions of a System of Matrix Equations
Journal of Applied Mathematics Volume 2012, Article ID 471573, 19 pages doi:10.1155/2012/471573 Research Article Constrained Solutions of a System of Matrix Equations Qing-Wen Wang 1 and Juan Yu 1, 2 1
More informationBlock Diagonal Majorization on C 0
Iranian Journal of Mathematical Sciences and Informatics Vol. 8, No. 2 (2013), pp 131-136 Block Diagonal Majorization on C 0 A. Armandnejad and F. Passandi Department of Mathematics, Vali-e-Asr University
More informationSpectral Properties of Matrix Polynomials in the Max Algebra
Spectral Properties of Matrix Polynomials in the Max Algebra Buket Benek Gursoy 1,1, Oliver Mason a,1, a Hamilton Institute, National University of Ireland, Maynooth Maynooth, Co Kildare, Ireland Abstract
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A Spielman September 9, 202 7 About these notes These notes are not necessarily an accurate representation of what happened in
More informationORIE 6300 Mathematical Programming I August 25, Recitation 1
ORIE 6300 Mathematical Programming I August 25, 2016 Lecturer: Calvin Wylie Recitation 1 Scribe: Mateo Díaz 1 Linear Algebra Review 1 1.1 Independence, Spanning, and Dimension Definition 1 A (usually infinite)
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 informationBOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
Volume 115 No. 9 017, 343-351 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
More informationInequalities for the spectra of symmetric doubly stochastic matrices
Linear Algebra and its Applications 49 (2006) 643 647 wwwelseviercom/locate/laa Inequalities for the spectra of symmetric doubly stochastic matrices Rajesh Pereira a,, Mohammad Ali Vali b a Department
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 informationReachability and controllability of time-variant discrete-time positive linear systems
Control and Cybernetics vol. 33 (2004) No. 1 Reachability and controllability of time-variant discrete-time positive linear systems by Ventsi G. Rumchev 1 and Jaime Adeane 2 1 Department of Mathematics
More informationImproved Newton s method with exact line searches to solve quadratic matrix equation
Journal of Computational and Applied Mathematics 222 (2008) 645 654 wwwelseviercom/locate/cam Improved Newton s method with exact line searches to solve quadratic matrix equation Jian-hui Long, Xi-yan
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationConditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina
Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic
More informationLinear estimation in models based on a graph
Linear Algebra and its Applications 302±303 (1999) 223±230 www.elsevier.com/locate/laa Linear estimation in models based on a graph R.B. Bapat * Indian Statistical Institute, New Delhi 110 016, India Received
More informationComparison of perturbation bounds for the stationary distribution of a Markov chain
Linear Algebra and its Applications 335 (00) 37 50 www.elsevier.com/locate/laa Comparison of perturbation bounds for the stationary distribution of a Markov chain Grace E. Cho a, Carl D. Meyer b,, a Mathematics
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 informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationPositive entries of stable matrices
Positive entries of stable matrices Shmuel Friedland Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago Chicago, Illinois 60607-7045, USA Daniel Hershkowitz,
More informationINTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE
INTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE C M DA FONSECA Abstract We extend some interlacing properties of the eigenvalues of tridiagonal matrices to Hermitian matrices
More informationExtremal trees with fixed degree sequence for atom-bond connectivity index
Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree
More information