Analytical formulas for calculating the extremal ranks and inertias of A + BXB when X is a fixed-rank Hermitian matrix
|
|
- Jeffrey May
- 5 years ago
- Views:
Transcription
1 Analytical formulas for calculating the extremal ranks and inertias of A + BXB when X is a fixed-rank Hermitian matrix Yongge Tian CEMA, Central University of Finance and Economics, Beijing , China Abstract. The rank of a matrix and the inertia of a square matrix are two of the most generic concepts in matrix theory for describing the dimension of the row/column vector space and the sign distribution of the eigenvalues of the matrix. Matrix rank and inertia optimization problems are a class of discontinuous optimization problems, in which decision variables are matrices running over certain matrix sets, while the ranks and inertias of the variable matrices are taken as integer-valued objective functions. In this paper, we first establish several groups of explicit formulas for calculating the imal and imal ranks and inertias of matrix expression A+X subject to a Hermitian matrix X that satisfies a fixed-rank and semi-definiteness restrictions by using some discrete and matrix decomposition methods. We then derive formulas for calculating the imal and imal ranks and inertias of matrix expression A+BXB subject to a Hermitian matrix X that satisfies a fixed-rank and semi-definiteness restrictions and use the formulas obtained to characterize behaviors of A + BXB. Key words: Hermitian matrix; matrix-valued function; rank; inertia; imization; imization; Moore Penrose inverse; equality; inequality; Löwner partial ordering AMS Classifications: 15A03; 15A09; 15A24; 15B57; 65K10; 65K15 1 Introduction A matrix-valued function for complex matrices is a map between matrix spaces, which can generally be written as Y = f(x) for Y C m n and X C p q, or briefly, f : C m n C p q, where C m n and C p q are two two complex matrix spaces. As usual, linear matrix-valued functions, as ordinary representatives of all matrix-valued functions, are extensively studied from theoretical and applied points of view. Throughout this paper, C m n stands for the set of all m n complex matrices; C m H stands for the set of all m m complex Hermitian matrices; A, A T, r(a) and R(A) stand for the conjugate transpose, transpose, rank and range (column space) of a matrix A C m n, respectively; I m denotes the identity matrix of order m; A, B denotes a row block matrix consisting of A and B; the Moore Penrose inverse of A C m n, denoted by A, is defined to be the unique solution X satisfying the four matrix equations AXA = A, XAX = X, (AX) = AX and (XA) = XA; the symbols E A and F A stand for E A = I m AA and F A = I n A A, their ranks are r(e A ) = m r(a) and r(f A ) = n r(a); i + (A) and i (A), called the partial inertia of A C m H, are defined to be the numbers of the positive and negative eigenvalues of A counted with multiplicities, respectively; A 0 (A 0, 0, 0) means that A is Hermitian positive definite (positive semi-definite, negative definite, negative semi-definite); two A, B C m H are said to satisfy the inequality A B (A B) in the Löwner partial ordering if A B is positive definite (positive semi-definite). yongge.tian@gmail.com 1
2 Like the simplest linear expression a + bx in elementary mathematics, people can define various linear expressions for matrices and their operations, which we call linear matrix-valued functions (LMFs). It is easy to see that one of the generic linear expressions with symmetric patterns is given by φ(x) = A + BXB, (1.1) where A C m H and B Cm n are given, and X C n H is a variable matrix. We treat (1.1) as an LMF: φ : X C n H C m H. (1.2) This basic LMF and its variations were extensively studied in the literature from theoretical and applied points of view, and many results on behaviors of (1.1) were posed and were obtained, for instance, (i) Expansion formulas for calculating the (global extremal) ranks and inertias of φ(x) when X running over C n H 6, 13, 21. (ii) Nonsingularity, positive definiteness, rank and inertia invariance, etc., of φ(x) 13, 21. (iii) Canonical forms of φ(x) under generalized singular value decompositions and their algebraic properties 6. (iv) Solutions and least-squares solutions of the matrix equation φ(x) = 0 and their algebraic properties 5, 6, 9, 16, 18, 20. (v) Solutions of the matrix inequalities φ(x) (,, ) 0 and their properties 13, 17. (vi) Formulas for calculating the extremal ranks and inertias of φ(x) under X C n H, r(x) q and/or ±X 0 13, 21. (vii) Formulas for calculating the extremal ranks and inertias of φ(x) subject to the Hermitian solution of a consistent matrix equation CXC = D 7. (viii) Formulas for calculating the extremal ranks and inertias of A + BC B, where C is a Hermitian generalized inverse of a Hermitian matrix C, 7, 19. In this paper, we take the rank and inertia of A + BXB as integer-valued objective functions, and study the following constrained optimization problems: Problem 1.1 For the function in (1.1), solve the following constrained rank and inertia optimization problems imize r( A + BXB ) s.t. X C n H and r(x) = q, (1.3) imize r( A + BXB ) s.t. X C n H and r(x) = q, (1.4) imize i ± ( A + BXB ) s.t. X C n H and r(x) = q, (1.5) imize i ± ( A + BXB ) s.t. X C n H and r(x) = q, (1.6) imize r( A + BXB ) s.t. X C n H, ±X 0 and r(x) = q, (1.7) imize r( A + BXB ) s.t. X C n H, ±X 0 and r(x) = q, (1.8) imize i ± ( A + BXB ) s.t. X C n H, ±X 0 and r(x) = q, (1.9) imize i ± ( A + BXB ) s.t. X C n H, ±X 0 and r(x) = q. (1.10) Problem 1.2 For the function in (1.1), solve the following constrained rank and inertia optimization problems imize r( A + BXB ) s.t. X C n H and p r(x) q, (1.11) imize r( A + BXB ) s.t. X C n H and p r(x) q (1.12) imize i ± ( A + BXB ) s.t. X C n H and p r(x) q, (1.13) imize i ± ( A + BXB ) s.t. X C n H and p r(x) q, (1.14) imize r( A + BXB ) s.t. X C n H, ±X 0 and p r(x) q, (1.15) imize r( A + BXB ) s.t. X C n H, ±X 0 and p r(x) q, (1.16) imize i ± ( A + BXB ) s.t. X C n H, ±X 0 and p r(x) q, (1.17) imize i ± ( A + BXB ) s.t. X C n H, ±X 0 and p r(x) q. (1.18) 2
3 The rank and inertia of a Hermitian matrix are two generic concepts in matrix theory for describing the dimension of the row/column vector space and the sign distribution of the eigenvalues of the matrix, which are well understood and are easy to compute by the well-known elementary or congruent matrix operations and play an essential role in characterizing algebraic properties of matrices. These two integer indices occur only in finite-dimensional algebras and are not replaceable and cannot be approximated by other continuous quantities. Because the rank and inertia of a matrix are always finite nonnegative integers less than or equal to the dimensions of the matrix, it is not hard to give upper and lower bounds for ranks and inertias of matrices, and the global imal and imal values of the objective rank and inertia functions always exist, no matter what the decision domain S is given. Also, due to the integer feature of rank and inertia, inexact or approximate values of imal and imal ranks and inertias are less valuable, so that no approximation methods can be used to find exact values of the imal and imal possible ranks and inertias of a matrix-valued function. This fact means that solving methods of matrix rank and inertia optimization problems are not consistent with any of the ordinary continuous and discrete problems in optimization theory. It has been known that matrix rank and inertia optimization problems are NP-hard in general due to the discontinuity and combinational nature of rank and inertia of a matrix and the algebraic structure of S, but only a few has analytical solutions. Generally speaking, matrix rank-optimization problems are a class of discontinuous optimization problems, in which the decision variables are matrices running over certain matrix sets, while the ranks of the variable matrices are taken as integer-valued objective functions. So that analytical formulas for calculating the imal and imal ranks of A X cannot be derived by numerical approximation methods. This fact means that solving methods of matrix rank optimization problems are not consistent with any of the ordinary continuous and discrete problems in optimization theory, so that we cannot apply various common methods of solving continuous optimization problems, such as the well-known differential and Lagrangian methods, to approach these constrained optimization problems. Instead, we can only find the exact imal and imal ranks through pure algebraic operations of matrices. It has been known that matrix rank-optimization problems are NP-hard in general due to the discontinuity and combinational nature of rank of a matrix and the algebraic structure of S. Many new researches were conducted on this kind of matrix rank-optimization problems from theory and applied points of view in the past decades; see, e.g., and the references therein. Because the rank of a matrix can only take finite integers between 0 and the dimensions of the matrix, it is really expected to establish certain analytical formulas for calculating the imal and imal ranks for curiosity. Also, note that for any two integers p and q satisfying 0 p q m, the following decompositions of the generalized Stiefel manifolds X C m H p r(x) q = X C m H r(x) = p X C m H r(x) = p + 1 X C m H r(x) = q, (1.19) 0 X C m H p r(x) q = 0 X C m H r(x) = p 0 X C m H r(x) = p X C m H r(x) = q (1.20) hold. So that, once Problem 1.1 is solved, solutions of Problem 1.2 can be obtained consequently from the above matrix set decompositions. The constrained optimization problems listed in (1.3) (1.18) consist of detering the global imal and imal ranks and inertias of (1.1), and finding the constrained variable matrix X such that the corresponding (1.1) attains the extremal ranks and inertias. Note that the ranks and inertias of BXB and A + BXB may vary with respect to the choice of X, which are neither continuous or convex. Also note that the Hermitian matrix X with r(x) = q is not unique, which can be characterized by the canonical decompositions of X under congruence transformation: X = Udiag I s, I q s, 0 U, (1.21) where U is any nonsingular matrix, and 0 s q. This canonical decomposition shows that a Hermitian matrix X with rank q is characterized by both a variable integer s with 0 s q and an arbitrary nonsingular matrix U. So that both BXB and A + BXB depend on the choice of both s and U, and the variation of the rank and inertia of (1.2) with respect to a fixed-rank Hermitian matrix X is quite complicated, while (1.3) (1.18) can be classified as some special types of constrained integer optimization problems. Int this case, we can only find the global imal and imal ranks and inertias through pure algebraic operations of matrices. Although the task of establishing explicit formulas for calculating the extremal ranks and inertias in (1.3) (1.18) are challenging, fortunately, we now are able to solve (1.3) (1.18) by using many new known results on ranks and inertias of matrices and some tricky matrix operations. 2 Preliary results The following are some known results on ranks and inertias of matrices, which will be used in the latter part of this paper for solving the previous problems. 3
4 Lemma 2.1 (13) Let S be a set consisting of matrices over C m n, and let H be a set consisting of Hermitian matrices over C m H. Then, (a) Under m = n, S has a nonsingular matrix if and only if X S r(x) = m. (b) Under m = n, all X S are nonsingular if and only if X S r(x) = m. (c) 0 S if and only if X S r(x) = 0. (d) S = 0 if and only if X S r(x) = 0. (e) H has a matrix X 0 (X 0) if and only if X H i + (X) = m ( X H i (X) = m). (f) All X H satisfy X 0 (X 0) if and only if X H i + (X) = m ( X H i (X) = m). (g) H has a matrix X 0 (X 0) if and only if X H i (X) = 0 ( X H i + (X) = 0). (h) All X H satisfies X 0 (X 0) if and only if X H i (X) = 0 ( X H i + ( X) = 0). This lemma indicates that rank and inertia of matrices can be used quantitative tools to characterize some fundamental algebraic properties of a given matrix set. In particular, whether a given matrix-valued function is semi-definite everywhere is ubiquitous in matrix theory and applications. Lemma 2.1(e) (h) assert that if certain explicit formulas for calculating the global imal and imal inertias of Hermitian matrix-valued functions are established, we can use them, as demonstrated in Sections 2 7 below, to derive explicit necessary and sufficient conditions for the matrix-valued functions to be definite or semi-definite. In addition, we are able to use these inertia formulas to establish various matrix inequalities in the Löwner partial ordering, and to solve many matrix optimization problems in the Löwner partial ordering. Lemma 2.2 Let A, B C m H. Then, If B 0, then r( A + B ) r(a) + r(b), (2.1) i ± ( A + B ) i ± (A) + i ± (B), (2.2) r( A + B ) r(a) r(b), (2.3) i ± ( A + B ) i ± (A) i (B). (2.4) r( A + B ) i + ( A + B ) i + (A), (2.5) r( A B ) i ( A B ) i (A). (2.6) Eq. (2.1) is a well-known rank inequality in elementary linear algebra. Eq. (2.2) was given in 2, 11. Applying (2.1) and (2.2) to A = ( A + B ) + ( B) yields (2.3) and (2.4). Eqs. (2.5) and (2.6) follow from (2.4). Lemma 2.3 (13) Let A C m H, B Cn H, Q Cm n, and assume that P C m m is nonsingular. Then, i ± (P AP ) = i ± (A), (2.7) i ± (A ) = i ± (A), (2.8) i± (A) if λ > 0 i ± (λa) = i (A) if λ < 0, (2.9) A 0 i ± = i 0 B ± (A) + i ± (B), (2.10) 0 Q 0 Q i + Q = i 0 Q = r(q). (2.11) 0 Lemma 2.4 (10) Let A C m n, B C m k and C C l n. Then, the following rank expansion formulas hold r A, B = r(a) + r(e A B) = r(b) + r(e B A), (2.12) A r = r(a) + r(cf C A ) = r(c) + r(af C ). (2.13) 4
5 Lemma 2.5 (13) Let A C m H, B Cm n, D C n H, and let A B A B M 1 = B, M 0 2 = B. D Then, the following expansion formulas hold In particular, i ± (M 1 ) = r(b) + i ± (E B AE B ), r(m 1 ) = 2r(B) + r(e B AE B ), (2.14) 0 E i ± (M 2 ) = i ± (A) + i A B 0 E ± B E A D B A, r(m B 2 ) = r(a) + r A B B E A D B A. (2.15) B (a) If A 0, then (b) If A 0, then (c) If R(B) R(A), then i + (M 1 ) = r A, B, i (M 1 ) = r(b), r(m 1 ) = r A, B + r(b). (2.16) i + (M 1 ) = r(b), i (M 1 ) = r A, B, r(m 1 ) = r A, B + r(b). (2.17) i ± (M 2 ) = i ± (A) + i ± ( D B A B ), r(m 2 ) = r(a) + r( D B A B ). (2.18) (d) i ± (M 2 ) i ± (A) + i ± ( D B A B ) i ± (A). (e) i ± (M 1 ) = m i (E B AE B ) = 0 and r(e B AE B ) = r(e B ). (f) i + (M 2 ) = i + (A) R(B) R(A) and D B A B 0. (g) i (M 2 ) = i (A) R(B) R(A) and D B A B 0. (h) M 2 0 A 0, R(B) R(A) and D B A B 0 D 0, R(B ) R(D) and A BD B 0. (i) M 2 0 A 0 and D B A 1 B 0 D 0 and A BD 1 B 0. Some useful expansion formulas derived from (2.14) and (2.15) are i ± ( D B A A B ) = i AA A B ± B A i D ± (A), (2.19) i ± ( D B A A B B ) = i ± B i D ± (A) if R(B) R(A), (2.20) A B 0 A BF i P ± F P B = i 0 ± B 0 P r(p ). (2.21) 0 P 0 We shall use them to simplify the inertias of block Hermitian matrices involving Moore Penrose inverses of matrices. Lemma 2.6 Let A C m H be given, and X Cm n and Y C n H be two variable matrices. Also define 0 X φ(x, Y ) = X. (2.22) Y Then, (a) The following equalities hold rφ(x, Y ) = m + n, 2n, (2.23) X C m n, Y C n H X C m n, Y C n H rφ(x, Y ) = 0, (2.24) i ± φ(x, Y ) = n, (2.25) X C m n, Y C n H X C m n, Y C n H i ± φ(x, Y ) = 0. (2.26) 5
6 (b) For any integer q with 0 q m + n, 2n, there exist X C m n and Y C n H such that rφ(x, Y ) = q. (2.27) (c) For any integer q with 0 q n, there exist X 1, X 2 C m n and Y 1, Y 2 C n H such that i + φ(x 1, Y 1 ) = q, i φ(x 2, Y 2 ) = q (2.28) hold, respectively. (d) The following equalities hold rφ(x, Y ) = m + n, 2n, (2.29) rφ(x, Y ) = 0, (2.30) i + φ(x, Y ) = n, (2.31) i + φ(x, Y ) = 0, (2.32) i φ(x, Y ) = m, n, (2.33) i φ(x, Y ) = 0. (2.34) (e) For any integer q with 0 q m + n, 2n, there exist X C m n and 0 Y C n H such that rφ(x, Y ) = q. (2.35) (f) For any integer q with 0 q n, there exist X C m n and 0 Y C n H such that i + φ(x, Y ) = q. (2.36) (g) For any integer q with 0 q m, n, there exist X C m n and 0 Y C n H such that i φ(x, Y ) = q. (2.37) Proof. Let r(x) = m, n and Y = I n. Then, we find from (2.16) that rm(x, Y ) = r X, Y + r(x) = n + r(x) = m + n, 2n, establishing (2.23). Setting X = 0 and Y = 0 leads to (2.24). Setting Y = I n, we find from (2.16) that setting Y = I n, we find from (2.16) that i + M(X, Y ) = r X, Y = n; i M(X, Y ) = r X, Y = n, establishing (2.25). Set X = 0 and Y = 0 leads to rm(x, Y ) = i + M(X, Y ) = i M(X, Y ) = 0, establishing (2.26). For any integer 0 q n, setting X = 0 and r(y ) = q leads to rφ(x, Y ) = r(y ) = q; for any integer n < q m + n, 2n, setting r(x) = q n and Y = I n and applying (2.16) lead to rm(x, Y ) = r X, Y + r(x) = n + ( q n ) = q, establishing (2.27). For any integer 0 q n, setting X = 0 and Y 1 = diag I q, 0 and Y 2 = diag I q, 0 and applying (2.16) leads to i + φ(x, Y 1 ) = r(y 1 ) = q, i φ(x, Y 2 ) = r(y 2 ) = q, establishing (2.28). Let r(x) = m, n and Y = I n 0. Then, we find from (2.16) that rm(x, Y ) = r X, Y + r(x) = n + r(x) = m + n, 2n, 6
7 establishing (2.29). Setting X = 0 and Y = 0 leads to (2.30). For any X and Y = I n 0, we find from (2.16) that i + M(X, Y ) = r X, Y = n, establishing (2.31). Setting X = 0 and any Y = 0 leads to (2.32). Setting r(x) = m, n and Y 0, we find from (2.16) that i M(X, Y ) = r(x) = m, n, establishing (2.33). Setting X = 0 and Y = 0 leads to (2.34). For any integer 0 q n, setting X = 0 and Y = diag I q, 0 0 leads to rφ(x, Y ) = r(y ) = q; for any integer n < q m + n, 2n, setting r(x) = q n and Y = I n 0 and applying (2.16) lead to rm(x, Y ) = r X, Y + r(x) = n + ( q n ) = q, establishing (2.35). For any integer 0 q n, setting X = 0 and Y = diag I q, 0 0 leads to i + φ(x, Y ) = r(y ) = q; establishing (2.36). For any integer 0 q m, n, setting r(x) = q and Y = 0 and applying (2.16) lead to i M(X, Y ) = r(x) = q, establishing (2.37). Lemma 2.7 Let A C m H be given, X Cm n and Y C n H be two variable matrices, and define A X φ(x, Y ) = X. (2.38) Y Then, (a) The following equalities hold rφ(x, Y ) = m + n, r(a) + 2n, (2.39) X C m n, Y C n H X C m n, Y C n H rφ(x, Y ) = r(a), (2.40) i ± φ(x, Y ) = i ± (A) + n, (2.41) X C m n, Y C n H X C m n, Y C n H i ± φ(x, Y ) = i ± (A). (2.42) (b) For any integer q with r(a) q m + n, that rφ(x, Y ) = q. r(a) + 2n, there exist X C m n and Y C n H such (c) For any integer q with i + (A) q i + (A)+n, there exist X C m n and Y C n H such that i +φ(x, Y ) = q. (d) For any integer q with i (A) q i (A)+n, there exist X C m n and Y C n H such that i φ(x, Y ) = q. (e) The following equalities hold rφ(x, Y ) = m + n, r(a) + 2n, (2.43) rφ(x, Y ) = r(a), (2.44) i + φ(x, Y ) = i + (A) + n, (2.45) i + φ(x, Y ) = i + (A), (2.46) i φ(x, Y ) = m, i (A) + n, (2.47) i φ(x, Y ) = i (A). (2.48) 7
8 (f) For any integer q with r(a) q m + n, that rφ(x, Y ) = q. r(a) + 2n, there exist X C m n and 0 Y C n H such (g) For any integer q with i + (A) q i + (A) + n, there exist X C m n and 0 Y C n H i + φ(x, Y ) = q. such that (h) For any integer q with i (A) q m, that i φ(x, Y ) = q. i (A) + n there exist X C m n and 0 Y C n H such (i) Under A 0, the following equalities hold rφ(x, Y ) = m + n, r(a) + 2n, (2.49) X C m n, Y C n H rφ(x, Y ) = r(a), (2.50) X C m n, Y C n H i + φ(x, Y ) = r(a) + n, (2.51) X C m n, Y C n H i + φ(x, Y ) = r(a), (2.52) X C m n, Y C n H i φ(x, Y ) = n, (2.53) X C m n, Y C n H X C m n, Y C n H i φ(x, Y ) = 0, (2.54) rφ(x, Y ) = m + n, r(a) + 2n, (2.55) rφ(x, Y ) = r(a), (2.56) i +φ(x, Y ) = r(a) + n, (2.57) i + φ(x, Y ) = r(a), (2.58) i φ(x, Y ) = m, n, (2.59) i φ(x, Y ) = 0. (2.60) (j) Under A 0, for any integer q with r(a) q m + n, Y C n H such that rφ(x, Y ) = q. r(a) + 2n, there exist X C m n and (k) Under A 0, for any integer q with r(a) q r(a) + n, there exist X C m n and Y C n H i + φ(x, Y ) = q. such that (l) Under A 0, for any integer q with 0 q n, there exist X C m n and Y C n H such that i φ(x, Y ) = q. (m) Under A 0, for any integer q with r(a) q m + n, Y 0 such that rφ(x, Y ) = q. r(a) + 2n, there exist X C m n and (n) Under A 0, for any integer q with r(a) q r(a) + n, there exist X C m n and Y 0 such that i + φ(x, Y ) = q. (o) Under A 0, for any integer q with 0 q m, i φ(x, Y ) = q. n, there exist X C m n and Y 0 such that (p) Under A 0, the following equalities hold rφ(x, Y ) = r(a) + n, (2.61) φ(x, Y ) 0 rφ(x, Y ) = r(a). (2.62) φ(x, Y ) 0 (q ) Under A 0, for any integer q with r(a) q r(a) + n, there exist X C m n and Y 0 such that φ(x, Y ) 0 and rφ(x, Y ) = q. Proof. Without lost generality, we assume that A is given by A = diag I s, I t, 0. (2.63) 8
9 Correspondingly, M(X, Y ) can be written as M(X, Y ) = I s 0 0 X1 0 I t 0 X X3. (2.64) Y X 1 X 2 X 3 Applying (2.15) to (2.64) leads to Applying Lemma 2.5(a) to (2.65) (2.67) leads to 0 X3 rm(x, Y ) = s + t + r X 3 Y X 1 X 1 + X 2 X, (2.65) 2 0 X3 i + M(X, Y ) = s + i + X 3 Y X 1 X 1 + X 2 X, (2.66) 2 0 X3 i M(X, Y ) = t + i X 3 Y X 1 X 1 + X 2 X. (2.67) 2 0 X3 r X C m n, Y C X n H 3 Y X 1 X 1 + X 2 X = m r(a) + n, 2n, (2.68) 2 0 X3 r X C m n, Y C X n H 3 Y X 1 X 1 + X 2 X = 0, (2.69) 2 i ± X C m n, Y C n H i ± X C m n, Y C n H Substituting (2.68) (2.71) into (2.65) (2.67) yields (2.39) (2.42). Applying Lemma 2.5(b) and (c) to (2.39) (2.42) leads to (b) (d). Applying Lemma 2.5(e) to (2.65) (2.67) leads to 0 X3 X 3 Y X 1 X 1 + X 2 X = n, (2.70) 2 0 X3 X 3 Y X 1 X 1 + X 2 X = 0. (2.71) 2 0 X3 r X 3 Y X 1 X 1 + X 2 X = m r(a) + n, 2n, (2.72) 2 0 X3 r X 3 Y X 1 X 1 + X 2 X = 0, (2.73) 2 i + i i ± Substituting (2.72) (2.76) into (2.65) (2.67) yields (2.43) (2.48). Applying Lemma 2.5(e) (g) to (2.43) (2.48) leads to (f) (h). Setting A 0 in (2.39) (2.48) leads to (2.49) (2.60). Results (j) (o) follow from (2.49) (2.60). It is easy to verify that under A 0 with r(a) = s, 0 X3 X 3 Y X 1 X 1 + X 2 X = n, (2.74) 2 0 X3 X 3 Y X 1 X 1 + X 2 X = m t, n, (2.75) 2 0 X3 X 3 Y X 1 X 1 + X 2 X = 0. (2.76) 2 I s 0 X1 M(X, Y ) = 0 0 X3 0 X 3 = 0 and Y X X 1 1. (2.77) Y X 1 X 3 9
10 So that rφ(x, Y ) = φ(x, Y ) 0 rφ(x, Y ) = φ(x, Y ) 0 r φ(x, Y ) 0 r φ(x, Y ) 0 I s X 1 I s X 1 X1 Y X1 Y = s + Y X 1 X 1 r( Y X 1 X 1 ) = r(a) + n, (2.78) = s + Y X 1 X 1 r( Y X 1 X 1 ) = r(a), (2.79) establishing (2.61) and (2.62). Result (q) follows from (2.78) and (2.79). Lemma 2.8 Let A C m H and B Cm n be given. Then, there exist a unitary matrix U C n n and a nonsingular matrix P C m m such that A = P D A P and B = P D B U, (2.80) where where and 1 = 0 I f I f D A = t , k (2.81) l t m (2f + l + k) f f t k l t m (2f + l + k) I f f D B = 0 Σ 0 0 t k, (2.82) 0 0 I 0 l t m (2f + l + k) f t l t n (f + l) Is1 0 Is2 0, 0 I 2 =, (2.83) t s1 0 I k s2 Σ = diagσ 1,, σ s1, λ s1+1,, λ t, σ 1 σ s1 > 0, λ s1+1 λ t > 0, (2.84) A B f = r(b) + r A, B r B, (2.85) 0 A B k = r B 2r(B), (2.86) 0 A B l = r B r A, B, (2.87) 0 A B t = r(a) + r B 2r A, B, (2.88) 0 f + s 1 + s 2 = i + (A), (2.89) f + t + k s 1 s 2 = i (A), (2.90) A B f + l + s 2 = i + B, (2.91) 0 A B f + l + k s 2 = i B. (2.92) 0 The structures of the blocks in (2.80) (2.84) and the parameters in (2.85) (2.92) are formulated more explicitly, which improve the results in 22 and 4. In fact, the blocks in (2.80) (2.84) can be derived from those of Lemma 2.1 in 4 through a series of elementary transformations, and (2.89) (2.92) follow from applying Lemma 2.3 to (2.81) (2.84). 10
11 3 The rank and inertia of A + X subject to rank and semi-definite restrictions One of the special cases in (1.1) is the ordinary sum A + X. Many results on ranks and inertias of sum of two Hermitian matrices were established; see, e.g., 1, 3, 13. Note that the rank and inertia of A + X may vary with respect to the choice of the Hermitian matrix X. In this section, we derive explicit formulas for calculating the extremal ranks and inertias A + X subject to X C m H and X 0, respectively. The formulas obtained will be used in Sections 4 and 5. Theorem 3.1 Let A C m H be given, X Cm H satisfying be a variable matrix, and assume that p and q are two integers 0 p q m. (3.1) Then, (a) The following equalities hold (b) The following statements hold. r( A + X ) = m, r(a) + q, (3.2) X C m H, r(x)=q r( A + X ) = r(a) q, (3.3) X C m H, r(x)=q i +( A + X ) = m, i + (A) + q, (3.4) X C m H, r(x)=q i +( A + X ) = 0, i + (A) q, (3.5) X C m H, r(x)=q i ( A + X ) = m, i (A) + q, (3.6) X C m H, r(x)=q i ( A + X ) = 0, i (A) q. (3.7) X C m H, r(x)=q (i) For any integer t 1 between the two quantities on the right-hand sides of (3.2) and (3.3), there exists an X C m m H with r(x) = q such that r( A + X ) = t 1. (ii) For any integer t 2 between the two quantities on the right-hand sides of (3.4) and (3.5), there exists an X C m m H with r(x) = q such that i + ( A + X ) = t 2. (iii) For any integer t 3 between the two quantities on the right-hand sides of (3.6) and (3.7), there exists an X C m m H with r(x) = q such that i ( A + X ) = t 3. (iv) There exists an X C m H with r(x) = q such that A + X is nonsingular if and only if r(a) m q. (v) There exists an X C m H with r(x) = q such that A + X = 0 if and only if r(a) = q. (vi) There exists an X C m H with r(x) = q such that A + X 0 if and only if i +(A) m q. (vii) There exists an X C m H with r(x) = q such that A + X 0 if and only if i (A) q. (viii) There exists an X C m H with r(x) = q such that A + X 0 if and only if i (A) m q. (ix) There exists an X C m H with r(x) = q such that A + X 0 if and only if i +(A) q. (b) The following equalities hold X C m H X C m H (b) The following statements hold. A + X ) = m, r(a) + q, (3.8), p r(x) qr( A + X ) = 0, p r(a), r(a) q, (3.9), p r(x) qr( X C m H, p r(x) qi +( A + X ) = m, i + (A) + q, (3.10) X C m H, p r(x) qi +( A + X ) = 0, i + (A) q, (3.11) X C m H, p r(x) qi ( A + X ) = m, i (A) + q, (3.12) X C m H, p r(x) qi ( A + X ) = 0, i (A) q. (3.13) 11
12 (i) For any integer t 1 between the two quantities on the right-hand sides of (3.8) and (3.9), there exists an X C m m H with p r(x) q such that r( A + X ) = t 1. (ii) For any integer t 2 between the two quantities on the right-hand sides of (3.10) and (3.11), there exists an X C m m H with p r(x) q such that i + ( A + X ) = t 2. (iii) For any integer t 3 between the two quantities on the right-hand sides of (3.12) and (3.13), there exists an X C m m H with p r(x) q such that i ( A + X ) = t 3. (iv) There exists an X C m H with p r(x) q such that A+X is nonsingular if and only if r(a) m q. (v) There exists an X C m H with p r(x) q such that A + X = 0 if and only if p r(a) q. (vi) There exists an X C m H with p r(x) q such that A + X 0 if and only if i +(A) m q. (vii) There exists an X C m H with p r(x) q such that A + X 0 if and only if i (A) q. (viii) There exists an X C m H with p r(x) q such that A + X 0 if and only if i (A) m q. (ix) There exists an X C m H with p r(x) q such that A + X 0 if and only if i +(A) q. (c) The following equalities hold (d) The following equalities hold X C m H X C m H r( A + X ) = m, r(a) + q, (3.14), 0 r(x) q r( A + X ) = 0, r(a) q, (3.15), 0 r(x) q i +( A + X ) = m, i + (A) + q, (3.16) X C m H, 0 r(x) q i +( A + X ) = 0, i + (A) q, (3.17) X C m H, 0 r(x) q i ( A + X ) = m, i (A) + q, (3.18) X C m H, 0 r(x) q i ( A + X ) = 0, i (A) q. (3.19) X C m H, 0 r(x) q X C m H X C m H r( A + X ) = m, (3.20), p r(x) m r( A + X ) = 0, p r(a), (3.21), p r(x) m i +( A + X ) = m, (3.22) X C m H, p r(x) m i +( A + X ) = 0, (3.23) X C m H, p r(x) m i ( A + X ) = m, (3.24) X C m H, p r(x) m i ( A + X ) = 0. (3.25) X C m H, p r(x) m The Hermitian matrices Xs satisfying these equalities can be formulated from the canonical form of certain operations A and B under the Hermitian congruence. Proof. It is easy to see from (2.1) (2.4) that the right-hand sides of (3.2), (3.4) are (3.6) are upper bounds, while the right-hand sides of (3.3), (3.5) are (3.7) are lower bounds. Without loss of generality, we assume that A is of the form A 1 = diag I s, I t, 0 or A 2 = diag I t, I s, 0. (3.26) The establishments of (3.2) (3.7) are based on the following assertions: (i) Let X = diag 0 n q, 2I q. If m r(a) + q, then r( A 1 + X ) = m; if m > r(a) + q, then r( A 1 + X ) = r(a) + r(x) = r(a) + q, so that (3.2) holds. (ii) If r(a) q, then setting X = diag I s, I t, I q r(a), 0 n q gives r( A + X ) = q r(a); if r(a) > q and s > q, then setting X = diag I q, 0 n q gives r( A + X ) = r(a) q, so that (3.3) holds; if r(a) > q s, then setting X = diag I s, I q s, 0 n q gives r( A + X ) = r(a) q, so that (3.3) holds. (iii) If m i + (A) + q, then setting X = diag 0 n q, 2I q gives r( A + X ) = m; if m > i + (A) + q, then setting X = diag 0 n q, 2I q gives i + ( A + X ) = i + (A) + r(x) = i + (A) + q, so that (3.4) holds. 12
13 (iv) If i + (A) q, then setting X = diag 2I q, 0 n q gives i ( A + X ) = 0; if i + (A) > q, then setting X = diag I q, 0 n q gives i + ( A + X ) = i + (A) q, so that (3.5) holds. (v) If m i (A) + q, then setting X = diag 2I s, 0 n q, 2I q s gives i ( A 2 + X ) = m; if m > i (A) + q, then setting X = diag 2I s k, 0 n q, 2I q s+k gives i ( A + X ) = i (A) + r(x) = i (A) + q, so that (3.6) holds. (vi) If i (A) q, then setting X = diag 0 s, I q, 0 n s q gives i ( A 2 + X ) = 0; if i (A) > q, then setting X = diag 0 s, I q, 0 n s q gives i + ( A + X ) = i (A) q, so that (3.7) holds. It can be seen from (1.19) that X C m H, p r(x) qr( A + X ) = A + X ), X C m H, r(x)=pr( A + X ),..., X C m H, r(x)=p+1r( X C m H, r(x)=qr( A + X ), (3.27) X C m H, p r(x) qr( A + X ) = A + X ), X C m H, r(x)=pr( A + X ),..., X C m H, r(x)=p+1r( X C m H, r(x)=qr( A + X ), (3.28) X C m H, p r(x) qi +( A + X ) = X C m H, r(x)=pi +( A + X ), i +( A + X ),..., i +( A + X ), (3.29) r(x)=p+1 X C m H, r(x)=q X C m H, p r(x) qi +( A + X ) = X C m H, r(x)=pi +( A + X ), X C m H, r(x)=p+1i +( A + X ),..., X C m H, r(x)=qi +( A + X ), (3.30) X C m H, p r(x) qi ( A + X ) = X C m H, r(x)=pi ( A + X ), X C m H, r(x)=p+1i ( A + X ),..., X C m H, r(x)=qi ( A + X ), (3.31) X C m H, p r(x) qi ( A + X ) = X C m H, r(x)=pi ( A + X ), X C m H, r(x)=p+1i ( A + X ),..., X C m H, r(x)=qi ( A + X ). (3.32) Substituting (3.2) (3.7) for r(x) = p, p + 1,..., q into (3.27) (3.32) and making the - comparison, we obtain X C m H X C m H A + X ) = m, r(a) + p, m, r(a) + p + 1,..., m, r(a) + q, p r(x) qr( = m, r(a) + q, (3.33) A + X ) = r(a) p, r(a) p 1,..., r(a) q, p r(x) qr( = 0, p r(a), r(a) q, (3.34) X C m H, p r(x) qi +( A + X ) = m, i + (A) + p, m, i + (A) + p + 1,..., m, i + (A) + q = m, i + (A) + q, (3.35) X C m H, p r(x) qi +( A + X ) = 0, i + (A) p, 0, i + (A) p 1,..., 0, i + (A) q = 0, i + (A) q, (3.36) X C m H, p r(x) qi ( A + X ) = m, i (A) + p, m, i (A) + p + 1,..., m, i (A) + q = m, i (A) + q, (3.37) X C m H, p r(x) qi ( A + X ) = 0, i (A) p, 0, i (A) p 1,..., 0, i (A) q = 0, i (A) q, (3.38) as required for (3.8) (3.13). Results (c) and (d) follow directly from (b). 13
14 It is easy to see that (3.8) (3.13) also hold for any p < 0 and q > m. So that we can use (3.8) (3.13) under the condition p m, 0 q, p q. (3.39) Theorem 3.2 Let A C m H be given, X Cm H satisfying 0 p q m. Then, be a variable matrix, and assume that p and q are two integers (a) The following equalities hold (b) The following statements hold. r( A + X ) = m, r(a) + q, (3.40) r( A + X ) = i +(A), q i (A), r(a) q, (3.41) i +( A + X ) = m, i + (A) + q, (3.42) i +( A + X ) = i + (A), q i (A), (3.43) i ( A + X ) = i (A), (3.44) i ( A + X ) = 0, i (A) q, (3.45) r( A X ) = m, r(a) + q, (3.46) r( A X ) = i (A), q i + (A), r(a) q, (3.47) i +( A X ) = i + (A), (3.48) i +( A X ) = 0, i + (A) q, (3.49) i ( A X ) = m, i (A) + q, (3.50) i ( A X ) = i (A), q i + (A). (3.51) (i) For any integer t 1 between the two quantities on the right-hand sides of (3.40) and (3.41), there exists a 0 X C m m H with r(x) = q such that r( A + X ) = t 1. (ii) For any integer t 2 between the two quantities on the right-hand sides of (3.42) and (3.43), there exists a 0 X C m m H with r(x) = q such that i + ( A + X ) = t 2. (iii) For any integer t 3 between the two quantities on the right-hand sides of (3.44) and (3.45), there exists a 0 X C m m H with r(x) = q such that i ( A + X ) = t 3. (iv) For any integer t 4 between the two quantities on the right-hand sides of (3.46) and (3.47), there exists a 0 X C m m H with r(x) = q such that r( A X ) = t 4. (v) For any integer t 5 between the two quantities on the right-hand sides of (3.48) and (3.49), there exists a 0 X C m m H with r(x) = q such that i + ( A X ) = t 5. (vi) For any integer t 3 between the two quantities on the right-hand sides of (3.50) and (3.51), there exists a 0 X C m m H with r(x) = q such that i ( A X ) = t 6. (vii) There exists a 0 X C m H with r(x) = q such that A+X is nonsingular if and only if r(a) m q. (viii) A + X is nonsingular for all 0 X C m H with r(x) = q such if and only if A 0, or A 0 and q = m, or r(a) = m and q = 0. (ix) There exists a 0 X C m H with r(x) = q such that A + X = 0 if and only if A 0 and r(a) = q. (x) There exists a 0 X C m H with r(x) = q such that A + X 0 if and only if i +(A) m q. (xi) A + X 0 holds for all 0 X C m H with r(x) = q such if and only if A 0, or A 0 and q = m. (xii) There exists a 0 X C m H with r(x) = q such that A + X 0 if and only if i (A) q. (xiii) A + X 0 holds for all 0 X C m H with r(x) = q such if and only if A 0. (xiv) There exists a 0 X C m H with r(x) = q such that A + X 0 if and only if A 0. (xv) A + X 0 holds for all 0 X C m H with r(x) = q such if and only if A 0 and q = 0. (xvi) There exists a 0 X C m H with r(x) = q such that A + X 0 if and only if A 0 and r(a) q. 14
15 (xvii) A + X 0 holds for all 0 X C m H with r(x) = q such if and only if A 0 and q = 0. (xviii) There exists a 0 X C m H with r(x) = q such that A X is nonsingular if and only if r(a) m q. (xix) A X is nonsingular for all X C m H with r(x) = q and X 0 such if and only if A 0, or A 0 and q = m, or r(a) = m and q = 0. (xx) There exists a 0 X C m H with r(x) = q such that A X = 0 if and only if A 0 and r(a) = q. (xx) There exists a 0 X C m H with r(x) = q such that A X 0 if and only if A 0. (xxii) A X 0 holds for all 0 X C m H with r(x) = q such if and only if A 0 and q = 0. (xxiii) There exists a 0 X C m H with r(x) = q such that A X 0 if and only if A 0 and r(a) q. (xxvi) A X 0 holds for all 0 X C m H with r(x) = q such that if and only if A 0 and q = 0. (xxv) There exists a 0 X C m H with r(x) = q such that A X 0 if and only if i (A) m q. (xxvi) A X 0 holds for all 0 X C m H with r(x) = q such that if and only if A 0 and q = 0. (xxvii) There exists a 0 X C m H with r(x) = q such that A X 0 if and only if i +(A) q. (xxviii) A X 0 holds for all 0 X C m H (c) The following equalities hold In consequence, the following hold. (i) There exists a 0 X C m H r(a) m q. with r(x) = q if and only if A 0. r( A + X ) = m, r(a) + q, (3.52) r( A + X ) = i +(A), p i (A), r(a) q, (3.53) i +( A + X ) = m, i + (A) + q, (3.54) i +( A + X ) = i + (A), p i (A), (3.55) i ( A + X ) = i (A), (3.56) i ( A + X ) = 0, i (A) q, (3.57) r( A X ) = m, r(a) + q, (3.58) r( A X ) = i (A), p i + (A), r(a) q, (3.59) i +( A X ) = i + (A), (3.60) i +( A X ) = 0, i + (A) q, (3.61) i ( A X ) = m, i (A) + q, (3.62) i ( A X ) = i (A), p i + (A). (3.63) with p r(x) q such that A + X is nonsingular if and only if (ii) A + X is nonsingular for all 0 X C m H with p r(x) q such if and only if A 0, or A 0 and q = m, or r(a) = m and q = 0. (iii) There exists a 0 X C m H p r(a) q. with p r(x) q such that A + X = 0 if and only if A 0 and (iv) There exists a 0 X C m H with p r(x) q such that A + X 0 if and only if i +(A) m q. (v) A + X 0 holds for all 0 X C m H p = q = m. with p r(x) q if and only if A 0, or A 0 and (vi) There exists a 0 X C m H with p r(x) q such that A + X 0 if and only if i (A) q. (vii) A + X 0 holds for all 0 X C m H with p r(x) q if and only if A 0. (viii) There exists a 0 X C m H with p r(x) q such that A + X 0 if and only if A 0. (ix) A + X 0 holds for all 0 X C m H with p r(x) q such if and only if A 0 and q = 0. (x) There exists a 0 X C m H with p r(x) q such that A + X 0 if and only if A 0 and r(a) p. 15
16 (xi) A + X 0 holds for all 0 X C m H with p r(x) q if and only if A 0 and q = 0. (xii) There exists a 0 X C m H r(a) m q. with p r(x) q such that A X is nonsingular if and only if (xiii) A X is nonsingular for all 0 X C m H q = m, or r(a) = m and q = 0. with p r(x) q if and only if A 0, or A 0 and (xiv) There exists a 0 X C m H r(a) = q. with p r(x) q such that A X = 0 if and only if A 0 and (xv) There exists a 0 X C m H with p r(x) q such that A X 0 if and only if A 0. (xvi) A X 0 holds for all 0 X C m H with p r(x) q if and only if A 0 and q = 0. (xvii) There exists a 0 X C m H r(a) p. with p r(x) q such that A X 0 if and only if A 0 and (xviii) A X 0 holds for all 0 X C m H with p r(x) q if and only if A 0 and q = 0. (xix) There exists a 0 X C m H with p r(x) q such that A X 0 if and only if i (A) m q. (xx) A X 0 holds for all 0 X C m H with p r(x) q if and only if A 0 and p = q = m. (xxi) There exists a 0 X C m H with p r(x) q such that A X 0 if and only if i +(A) q. (xxii) A X 0 holds for all 0 X C m H with p r(x) q if and only if A 0. (c) The following equalities hold r( A + X ) = m, r(a) + q, (3.64) r( A + X ) = i +(A), r(a) q, (3.65) i +( A + X ) = m, i + (A) + q, (3.66) i +( A + X ) = i + (A), (3.67) i ( A + X ) = i (A), (3.68) i ( A + X ) = 0, i (A) q, (3.69) r( A X ) = m, r(a) + q, (3.70) r( A X ) = i (A), r(a) q, (3.71) i +( A X ) = i + (A), (3.72) i +( A X ) = 0, i + (A) q, (3.73) i ( A X ) = m, i (A) + q, (3.74) i ( A X ) = i (A). (3.75) 16
17 (d) The following equalities hold r( A + X ) = m, (3.76) 0 X, p r(x) m r( A + X ) = i +(A), p i (A), (3.77) 0 X, p r(x) m i +( A + X ) = m, (3.78) 0 X, p r(x) m i +( A + X ) = i + (A), p i (A), (3.79) 0 X, p r(x) m i ( A + X ) = i (A), (3.80) 0 X, p r(x) m i ( A + X ) = 0, (3.81) 0 X, p r(x) m r( A X ) = m, (3.82) 0 X, p r(x) m r( A X ) = i (A), p i + (A), (3.83) 0 X, p r(x) m i +( A X ) = i + (A), (3.84) 0 X, p r(x) m i +( A X ) = 0, (3.85) 0 X, p r(x) m i ( A X ) = m, (3.86) 0 X, p r(x) m i ( A X ) = i (A), p i + (A). (3.87) 0 X, p r(x) m Proof. Without loss of generality, we assume that A is of the form (3.26). It is easy to see from (2.1) (2.6) that the right-hand sides of (3.40), (3.42) are (3.44) are upper bounds, while the right-hand sides of (3.41), (3.43) are (3.45) are lower bounds. The establishments of (3.40) (3.45) are based on the following assertions: (i) Set X = diag 0 n q, 2I q. If m r(a) + q, then r( A 1 + X ) = m; if m > r(a) + q, then r( A 1 + X ) = r(a) + r(x) = r(a) + q, so that (3.40) holds. (ii) Set X = diag I q, 0 n q. If q i (A), then r( A 2 + X ) = t q + s = r(a) q; if i (A) q r(a), then r( A 2 + X ) = s = i + (A); if q r(a), then r( A 2 + X ) = q t = q i (A), establishing (3.41). (iii) Set X = diag 0 n q, 2I q. If m i + (A)+q, then i + ( A 1 +X ) = m; if m > i + (A)+q, then i + ( A 1 +X ) = s + q = i + (A) + q, establishing (3.42). (iv) Set X = diag I q, 0 n q. If q r(a), then i + ( A 1 + X ) = s = i + (A); if q r(a), then r( A 1 + X ) = q t = q i (A), establishing (3.43). (v) Set X = diag I q /2, 0 n q. Then i ( A 1 + X ) = t = i (A), establishing (3.44). (vi) Set X = diag I q, 0 n q. If q i (A), then i ( A 2 + X ) = t q = i (A) q; if q > i (A), then i ( A 2 + X ) = 0, establishing (3.45). Eqs. (3.46) (3.51) can be shown similarly. Note that the following decomposition of the cone of positive semi-definite matrices holds 0 X C m H p r(x) q = 0 X C m H r(x) = p 0 X C m H r(x) = p X C m H r(x) = q. (3.88) 17
18 So that r( A + X ) = r( A + X ), 0 X, r(x)=p r( A + X ) = r( A + X ), 0 X, r(x)=p i +( A + X ) = i +( A + X ), 0 X, r(x)=p i +( A + X ) = i +( A + X ), 0 X, r(x)=p i ( A + X ) = i ( A + X ), 0 X, r(x)=p i ( A + X ) = i ( A + X ), 0 X, r(x)=p r( A + X ),..., 0 X, r(x)=p+1 r( A + X ),..., 0 X, r(x)=p+1 i +( A + X ),..., 0 X, r(x)=p+1 i +( A + X ),..., 0 X, r(x)=p+1 i ( A + X ),..., 0 X, r(x)=p+1 i ( A + X ),..., 0 X, r(x)=p+1 r( A + X ), (3.89) r( A + X ), (3.90) +( A + X ), (3.91) +( A + X ), (3.92) ( A + X ), (3.93) ( A + X ). (3.94) Substituting (3.40) (3.45) for r(x) = p, p+1,..., q into (3.89) (3.94) and making the - comparison, we obtain (3.52) (3.57). Eqs. (3.58) (3.63) hold by symmetry. Results (c) and (d) follow directly from (b). It is easy to see that (3.40) (3.51) also hold for any p < 0 and q > m. So that we can use (3.40) (3.51) under the condition p m, 0 q, p q. (3.95) Observe that all the results in this section are derived from the canonical forms with ±1 and 0 of A, while the variable matrix X are taken as ±1, ±j and 0. So that the completions of A + X with extremal ranks and inertias are in fact some special types of discrete optimization problems with both variables and objective functions being integers. 4 Rank and inertia formulas of A+BXB when X is Hermitian with a fixed rank Based on the results in the previous two sections, we are able to derive explicit solutions to Problems 1.1 and 1.2. To do so, we need the following known result on the canonical form of A + BXB (see 8). Lemma 4.1 Let A C m H and B Cm n be given, and X C n H be a variable matrix. Then, (i) A + BXB can be decomposed as A + BXB = P D A P + P D B UXU DBP T = P ( D A + D B Y DB T )P, (4.1) where P, D A and D B are as given in (2.80), and Y = UXU satisfies X C n H Y C n H. (4.2) (ii) The inertia and rank of A + BXB satisfy r( A + BXB ) = r( D A + D B Y DB T ), (4.3) i ± ( A + BXB ) = i ± ( D A + D B Y DB T ) (4.4) for Y = UXU and X C n H. 18
19 (iii) Partition the Hermitian matrix Y as Y 11 Y 12 Y 13 Y 14 f Y = Y12 Y 22 Y 23 Y 24 t Y13 Y23 Y 33 Y 34 l t Y14 Y24 Y34 Y 44 n (f + l) f t l t n (f + l), (4.5) where Y ii = Yii, i = 1, 2, 3, 4. Then, Y 11 I Y 12 Σ 0 Y 13 0 I D A + D B Y DB T = ΣY ΣY 22 Σ 0 ΣY (4.6) Y13 0 Y23Σ 0 Y and following expansion formulas hold r( A + BXB Y22 + Σ ) = 2f + k + r 1 1 Σ 1 Y 23 Y23 = 2f + k + r(  + Ŷ ), (4.7) Y 33 i + ( A + BXB Y22 + Σ ) = f + s 2 + i 1 1 Σ 1 Y 23 + Y23 = f + s Y 2 + i + (  + Ŷ ), (4.8) 33 i ( A + BXB Y22 + Σ ) = f + k s 2 + i 1 1 Σ 1 Y 23 Y23 = f + k s Y 2 + i (  + Ŷ ), (4.9) 33 where  = It can be seen from (4.7) (4.9) that X C n H Σ 1 1 Σ 1 0, Ŷ = 0 0 r( A + BXB ) = 2f + k + Ŷ C l H Y22 Y 23 Y23 Y 33. (4.10) r(  + Ŷ ), (4.11) r( A + BXB ) = 2f + k + r(  + Ŷ ), (4.12) X C n H Ŷ C l H X C n H i + ( A + BXB ) = f + s 2 + Ŷ C l H i + (  + Ŷ ), (4.13) i + ( A + BXB ) = f + s 2 + i + (  + Ŷ ), (4.14) X C n H Ŷ C l H X C n H So that the following result is obvious. i ( A + BXB ) = f + k s 2 + Ŷ C l H i (  + Ŷ ), (4.15) i ( A + BXB ) = f + k s 2 + i (  + Ŷ ). (4.16) X C n H Ŷ C l H Lemma 4.2 (13) Let A C m H and B Cm n be given, and X C n H be a variable matrix. Also define A B M = B. (4.17) 0 Then, the global imal and imal rank and inertias of A + BXB are given by r( A + BXB ) = r A, B, (4.18) X C n H r( A + BXB ) = 2r A, B r(m), (4.19) X C n H i ± ( A + BXB ) = i ± (M), (4.20) X C n H i ± ( A + BXB ) = r A, B i (M). (4.21) X C n H In what follows, we derive from (4.7) (4.9) the global imal and imal rank and inertias of A + BXB with rank restrictions on the rank of X. 19
20 Theorem 4.3 Let A C m H and B Cm n be given, X C n H be a variable matrix, M be the matrix in (4.17), and assume that q is an integer satisfying 0 q n. Then, the following equalities hold X C n H, r(x)=qr( A + BXB ) = r A, B, r(a) + q, (4.22) X C n H, r(x)=qr( A + BXB ) = 2r A, B r(m), 2r A, B r(a) + q 2n, r(a) q, (4.23) X C n H, r(x)=qi +( A + BXB ) = i + (M), i + (A) + q, (4.24) X C n H, r(x)=qi +( A + BXB ) = r A, B i (M), i + (A) q, (4.25) X C n H, r(x)=qi ( A + BXB ) = i (M), i (A) + q, (4.26) X C n H, r(x)=qi ( A + BXB ) = r A, B i + (M), i (A) q. (4.27) In particular, X C n H, r(x)=nr( A + BXB ) = r A, B, (4.28) X C n H, r(x)=nr( A + BXB ) = 2r A, B r(m), 2r A, B r(a) n, (4.29) X C n H, r(x)=ni +( A + BXB ) = i + (M), (4.30) X C n H, r(x)=ni +( A + BXB ) = r A, B i (M), i + (A) n, (4.31) X C n H, r(x)=ni ( A + BXB ) = i (M), (4.32) X C n H, r(x)=ni ( A + BXB ) = r A, B i + (M), i (A) n. (4.33) In consequence, the following hold. (i) There exists an X C n H with r(x) = q such that A + BXB is nonsingular if and only if r A, B = m and r(a) m q. (ii) A + BXB is nonsingular for all X C n H with r(x) = q if and only if r(a) = m and B A 1 B = 0, or 2r A, B r(a) + q 2n = m, or r(a) = m and q = 0. (iii) There exists an X C n H with r(x) = q such that A + BXB = 0 if and only if R(A) R(B) and r(a) q r(a) 2r(B) + 2n. (iv) There exists an X C n H with r(x) = q such that A + BXB 0 if and only if i + (M) = m and i + (A) m q, or i + (M) m and i + (A) = m q. (v) A + BXB 0 for all X C n H with r(x) = q if and only if A 0 and q = 0. (vi) There exists an X C n H with r(x) = q such that A + BXB 0 if and only if i + (M) = r A, B and i (A) q. (vii) A + BXB 0 for all X C n H with r(x) = q if and only if A 0 and B = 0, or A 0 and q = 0. (viii) There exists an X C n H with r(x) = q such that A + BXB 0 if and only if i (M) = m and i (A) m q, or i (M) m and i (A) = m q. (ix) A + BXB 0 for all X C n H with r(x) = q if and only if A 0 and q = 0. (x) There exists an X C n H with r(x) = q such that A + BXB 0 if and only if i (M) = r A, B and i + (A) q. (xi) A + BXB 0 for all X C n H with r(x) = q if and only if A 0 and B = 0, or A 0 and q = 0. Proof. It can be seen from (4.1) and (4.2) that X C n H and r(x) = q Y C n H and r(y ) = q. (4.34) 20
21 In this case, we derive from (4.7) (4.9) that X C n H, r(x)=qr( A + BXB ) = 2f + k + X C n H, r(x)=qr( A + BXB ) = 2f + k + X C n H, r(x)=qi +( A + BXB ) = f + s 2 + X C n H, r(x)=qi +( A + BXB ) = f + s 2 + Y C n H Y C n H X C n H, r(x)=qi ( A + BXB ) = f + k s 2 + X C n H, r(x)=qi ( A + BXB ) = f + k s 2 +  + Ŷ ), (4.35), r(y )=qr(  + Ŷ ), (4.36), r(y )=qr( Y C n H, r(y )=qi +(  + Ŷ ), (4.37) Y C n H, r(y )=qi +(  + Ŷ ), (4.38) Y C n H, r(y )=qi (  + Ŷ ), (4.39) Y C n H, r(y )=qi (  + Ŷ ). (4.40) Also note from Lemma 2.7(b) and (4.5) that Y C n H and r(y ) = q Y 11 = Y11, Y 44 = Y44, Ŷ C l H and q 2(n l) r(ŷ ) q. (4.41) Under 0 q 2(n l) q l, applying Lemma 2.7(b) to  + Ŷ in (4.35) (4.39) and simplifying by (2.81) and (2.83), we obtain  + Ŷ ) = Y C n H, r(y )=qr(  + Ŷ ) = Y C n H, r(y )=qr( q 2(n l) r(ŷ ) q r( q 2(n l) r(ŷ ) q r(  + Ŷ ) = l, r(â) + q = l, t + q, (4.42)  + Ŷ ) = 0, q 2(n l) r(â), r(â) q = 0, 2l t + q 2n, t q, (4.43) Y C n H, r(y )=qi +(  + Ŷ ) = i + (  + Ŷ ) = l, i +(Â) + q = l, s q 2(n l) r(ŷ ) q 1 + q, (4.44) Y C n H, r(y )=qi +(  + Ŷ ) = i + (  + Ŷ ) = 0, i +(Â) q = 0, s q 2(n l) r(ŷ ) q 1 q, (4.45) Y C n H, r(y )=qi (  + Ŷ ) = i (  + Ŷ ) = l, i (Â) + q = l, t s q 2(n l) r(ŷ ) q 1 + q, (4.46) Y C n H, r(y )=qi (  + Ŷ ) = i (  + Ŷ ) = 0, i (Â) q = 0, t s q 2(n l) r(ŷ ) q 1 q. (4.47) Substituting (4.42) (4.47) into (4.35) (4.40) and simplifying by (2.85) (2.92), we obtain (4.22) (4.27). Under q 2(n l) 0, applying Lemma 3.1(c) to  + Ŷ in (4.35) (4.39) and simplifying by (2.81) and (2.83), we obtain  + Ŷ ) = r(  + Ŷ ) = l, r(â) + q = l, t + q, (4.48) Y C n H, r(y )=qr( 0 r(ŷ ) q  + Ŷ ) = r(  + Ŷ ) = 0, r(â) q = 0, t q, (4.49) Y C n H, r(y )=qr( 0 r(ŷ ) q Y C n H, r(y )=qi +(  + Ŷ ) = 0 r(ŷ ) q i + (  + Ŷ ) = l, i +(Â) + q = l, s 1 + q, (4.50) Y C n H, r(y )=qi +(  + Ŷ ) = 0 r(ŷ ) q i + (  + Ŷ ) = 0, i +(Â) q = 0, s 1 q, (4.51) Y C n H, r(y )=qi (  + Ŷ ) = i (  + Ŷ ) = l, i (Â) + q = l, t s 0 r(ŷ ) q 1 + q, (4.52) Y C n H, r(y )=qi (  + Ŷ ) = i (  + Ŷ ) = 0, i (Â) q = 0, t s 0 r(ŷ ) q 1 q. (4.53) 21
22 Under l q, applying Lemma 3.1(d) to  + Ŷ in (4.35) (4.39) and simplifying by (2.81) and (2.83), we obtain  + Ŷ ) = Y C n H, r(y )=qr(  + Ŷ ) = Y C n H, r(y )=qr( q 2(n l) r(ŷ ) l r( q 2(n l) r(ŷ ) l r(  + Ŷ ) = l, (4.54)  + Ŷ ) = 0, q 2(n l) r(â) = 0, 2l t + q 2n, (4.55) Y C n H, r(y )=qi +(  + Ŷ ) = i + (  + Ŷ ) = l, (4.56) q 2(n l) r(ŷ ) l Y C n H, r(y )=qi +(  + Ŷ ) = i + (  + Ŷ ) = 0, (4.57) q 2(n l) r(ŷ ) l Y C n H, r(y )=qi (  + Ŷ ) = i (  + Ŷ ) = l, (4.58) q 2(n l) r(ŷ ) l Y C n H, r(y )=qi (  + Ŷ ) = i (  + Ŷ ) = 0. (4.59) q 2(n l) r(ŷ ) l These two groups of formulas are special cases (4.41) (4.46), so that (4.22) (4.27) hold for any q satisfying 0 q n. Corollary 4.4 Let φ(x) and M be as given in (1.1) and (4.17), and assume that p and q are two integer satisfying 0 p q n. Then, the following equalities hold where X C n H, p r(x) qr( A + BXB ) = r A, B, r(a) + q, (4.60) X C n H, p r(x) qr( A + BXB ) = u p, u p+1,..., u q, (4.61) X C n H, p r(x) qi +( A + BXB ) = i + (M), i + (A) + q, (4.62) X C n H, p r(x) qi +( A + BXB ) = r A, B i (M), i + (A) q, (4.63) X C n H, p r(x) qi ( A + BXB ) = i (M), i (A) + q, (4.64) X C n H, p r(x) qi ( A + BXB ) = r A, B i + (M), i (A) q, (4.65) u p = 2r A, B r(m), 2r A, B r(a) + p 2n, r(a) p, u p+1 = 2r A, B r(m), 2r A, B r(a) + p + 1 2n, r(a) p 1, In consequence, the following hold.. u q = 2r A, B r(m), 2r A, B r(a) + q 2n, r(a) q. (i) There exists an X C n H with p r(x) q such that A+BXB is nonsingular if and only if r A, B = m and r(a) m q. (ii) A + BXB is nonsingular for all X C n H with p r(x) q if and only if u p m, u p+1 m,..., u q m. (iii) There exists an X C n H with p r(x) q such that A + BXB = 0 if and only if R(A) R(B) and r(a) p q r(a) 2r(B) + 2n. (iv) There exists an X C n H with p r(x) q such that A + BXB 0 if and only if i + (M) = m and i + (A) m q, or i + (M) m and i + (A) = m q. (v) A + BXB 0 for all X C n H with p r(x) q if and only if A 0 and p = q = 0. (vi) There exists an X C n H with p r(x) q such that A + BXB 0 if and only if i + (M) = r A, B and i (A) q. (vii) A + BXB 0 for all X C n H p = q = 0. with p r(x) q if and only if A 0 and B = 0, or A 0 and 22
23 (viii) There exists an X C n H with p r(x) q such that A + BXB 0 if and only if i (M) = m and i (A) m q, or i (M) m and i (A) = m q. (ix) A + BXB 0 for all X C n H with p r(x) q if and only if A 0 and p = q = 0. (x) There exists an X C n H with p r(x) q such that A + BXB 0 if and only if i (M) = r A, B and i + (A) q. (xi) A + BXB 0 for all X C n H p = q = 0. with p r(x) q if and only if A 0 and B = 0, or A 0 and Proof. Note from (1.19) that X C n H, p r(x) qr( A + BXB ) = X C n H, r(x)=pr( A + BXB ), X C n H, r(x)=p+1r( A + BXB ),..., X C n H, r(x)=qr( A + BXB ), (4.66) X C n H, p r(x) qr( A + BXB ) = X C n H, r(x)=pr( A + BXB ), X C n H, r(x)=p+1r( A + BXB ),..., X C n H, r(x)=qr( A + BXB ), (4.67) X C n H, p r(x) qi +( A + BXB ) = X C n H, r(x)=pi +( A + BXB ), X C n H, r(x)=p+1i +( A + BXB ),..., i +( A + BXB ), X C n H, r(x)=q X C n H, p r(x) qi +( A + BXB ) = X C n H, r(x)=pi +( A + BXB ), X C n H, r(x)=p+1i +( A + BXB ),..., X C n H, r(x)=qi +( A + BXB ), X C n H, p r(x) qi ( A + BXB ) = X C n H, r(x)=pi ( A + BXB ), X C n H, r(x)=p+1i ( A + BXB ),..., X C n H, r(x)=qi ( A + BXB ), X C n H, p r(x) qi ( A + BXB ) = X C n H, r(x)=pi ( A + BXB ), X C n H, r(x)=p+1i ( A + BXB ),..., X C n H, r(x)=qi ( A + BXB ). (4.68) (4.69) (4.70) (4.71) Substituting (4.22) (4.27) for r(x) = p, p + 1,..., q into (4.66) (4.71) and making - comparisons, we obtain (4.60) (4.65). Corollary 4.5 Let φ(x) and M be as given in (1.1) and (4.17), and assume that p is an integer satisfying 0 p n. Then, the following equalities hold X C n H, p r(x) n r( A + BXB ) = r A, B, (4.72) X C n H, p r(x) n r( A + BXB ) = 2r A, B r(m), 2r A, B r(a) + p 2n, r(a) p,..., 2r A, B r(m), 2r A, B r(a) n, (4.73) X C n H, p r(x) n i +( A + BXB ) = i + (M), (4.74) i +( A + BXB ) = r A, B i (M), i + (A) n, (4.75) X C n H, p r(x) n i ( A + BXB ) = i (M), (4.76) X C n H, p r(x) n i ( A + BXB ) = r A, B i + (M), i (A) n. (4.77) X C n H, p r(x) n 23
Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications
Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications Yongge Tian China Economics and Management Academy, Central University of Finance and Economics,
More informationAnalytical formulas for calculating extremal ranks and inertias of quadratic matrix-valued functions and their applications
Analytical formulas for calculating extremal ranks and inertias of quadratic matrix-valued functions and their applications Yongge Tian CEMA, Central University of Finance and Economics, Beijing 100081,
More informationYongge Tian. China Economics and Management Academy, Central University of Finance and Economics, Beijing , China
On global optimizations of the rank and inertia of the matrix function A 1 B 1 XB 1 subject to a pair of matrix equations B 2 XB 2, B XB = A 2, A Yongge Tian China Economics and Management Academy, Central
More informationSolutions of a constrained Hermitian matrix-valued function optimization problem with applications
Solutions of a constrained Hermitian matrix-valued function optimization problem with applications Yongge Tian CEMA, Central University of Finance and Economics, Beijing 181, China Abstract. Let f(x) =
More informationRank and inertia optimizations of two Hermitian quadratic matrix functions subject to restrictions with applications
Rank and inertia optimizations of two Hermitian quadratic matrix functions subject to restrictions with applications Yongge Tian a, Ying Li b,c a China Economics and Management Academy, Central University
More informationA revisit to a reverse-order law for generalized inverses of a matrix product and its variations
A revisit to a reverse-order law for generalized inverses of a matrix product and its variations Yongge Tian CEMA, Central University of Finance and Economics, Beijing 100081, China Abstract. For a pair
More informationELA
Electronic Journal of Linear Algebra ISSN 181-81 A publication of te International Linear Algebra Society ttp://mat.tecnion.ac.il/iic/ela RANK AND INERTIA OF SUBMATRICES OF THE MOORE PENROSE INVERSE OF
More informationChapter 1. Matrix Algebra
ST4233, Linear Models, Semester 1 2008-2009 Chapter 1. Matrix Algebra 1 Matrix and vector notation Definition 1.1 A matrix is a rectangular or square array of numbers of variables. We use uppercase boldface
More informationRank and inertia of submatrices of the Moore- Penrose inverse of a Hermitian matrix
Electronic Journal of Linear Algebra Volume 2 Volume 2 (21) Article 17 21 Rank and inertia of submatrices of te Moore- Penrose inverse of a Hermitian matrix Yongge Tian yongge.tian@gmail.com Follow tis
More informationOn V-orthogonal projectors associated with a semi-norm
On V-orthogonal projectors associated with a semi-norm Short Title: V-orthogonal projectors Yongge Tian a, Yoshio Takane b a School of Economics, Shanghai University of Finance and Economics, Shanghai
More informationEP elements in rings
EP elements in rings Dijana Mosić, Dragan S. Djordjević, J. J. Koliha Abstract In this paper we present a number of new characterizations of EP elements in rings with involution in purely algebraic terms,
More informationMore on generalized inverses of partitioned matrices with Banachiewicz-Schur forms
More on generalized inverses of partitioned matrices wit anaciewicz-scur forms Yongge Tian a,, Yosio Takane b a Cina Economics and Management cademy, Central University of Finance and Economics, eijing,
More informationLecture notes: Applied linear algebra Part 1. Version 2
Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and
More informationThe symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009 Article 23 2009 The symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation Qing-feng Xiao qfxiao@hnu.cn
More informationMoore-Penrose-invertible normal and Hermitian elements in rings
Moore-Penrose-invertible normal and Hermitian elements in rings Dijana Mosić and Dragan S. Djordjević Abstract In this paper we present several new characterizations of normal and Hermitian elements in
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationMultiplicative Perturbation Bounds of the Group Inverse and Oblique Projection
Filomat 30: 06, 37 375 DOI 0.98/FIL67M Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Multiplicative Perturbation Bounds of the Group
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationClasses of Linear Operators Vol. I
Classes of Linear Operators Vol. I Israel Gohberg Seymour Goldberg Marinus A. Kaashoek Birkhäuser Verlag Basel Boston Berlin TABLE OF CONTENTS VOLUME I Preface Table of Contents of Volume I Table of Contents
More informationThe Hermitian R-symmetric Solutions of the Matrix Equation AXA = B
International Journal of Algebra, Vol. 6, 0, no. 9, 903-9 The Hermitian R-symmetric Solutions of the Matrix Equation AXA = B Qingfeng Xiao Department of Basic Dongguan olytechnic Dongguan 53808, China
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 17 LECTURE 5 1 existence of svd Theorem 1 (Existence of SVD) Every matrix has a singular value decomposition (condensed version) Proof Let A C m n and for simplicity
More informationReview Let A, B, and C be matrices of the same size, and let r and s be scalars. Then
1 Sec 21 Matrix Operations Review Let A, B, and C be matrices of the same size, and let r and s be scalars Then (i) A + B = B + A (iv) r(a + B) = ra + rb (ii) (A + B) + C = A + (B + C) (v) (r + s)a = ra
More informationMatrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...
Chapter Matrices We review the basic matrix operations What is a Matrix? An array of numbers a a n A = a m a mn with m rows and n columns is a m n matrix Element a ij in located in position (i, j The elements
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationMATH36001 Generalized Inverses and the SVD 2015
MATH36001 Generalized Inverses and the SVD 201 1 Generalized Inverses of Matrices A matrix has an inverse only if it is square and nonsingular. However there are theoretical and practical applications
More informationHands-on Matrix Algebra Using R
Preface vii 1. R Preliminaries 1 1.1 Matrix Defined, Deeper Understanding Using Software.. 1 1.2 Introduction, Why R?.................... 2 1.3 Obtaining R.......................... 4 1.4 Reference Manuals
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationOn the Hermitian solutions of the
Journal of Applied Mathematics & Bioinformatics vol.1 no.2 2011 109-129 ISSN: 1792-7625 (print) 1792-8850 (online) International Scientific Press 2011 On the Hermitian solutions of the matrix equation
More informationGATE Engineering Mathematics SAMPLE STUDY MATERIAL. Postal Correspondence Course GATE. Engineering. Mathematics GATE ENGINEERING MATHEMATICS
SAMPLE STUDY MATERIAL Postal Correspondence Course GATE Engineering Mathematics GATE ENGINEERING MATHEMATICS ENGINEERING MATHEMATICS GATE Syllabus CIVIL ENGINEERING CE CHEMICAL ENGINEERING CH MECHANICAL
More informationNew insights into best linear unbiased estimation and the optimality of least-squares
Journal of Multivariate Analysis 97 (2006) 575 585 www.elsevier.com/locate/jmva New insights into best linear unbiased estimation and the optimality of least-squares Mario Faliva, Maria Grazia Zoia Istituto
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 information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
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 informationOn the solvability of an equation involving the Smarandache function and Euler function
Scientia Magna Vol. 008), No., 9-33 On the solvability of an equation involving the Smarandache function and Euler function Weiguo Duan and Yanrong Xue Department of Mathematics, Northwest University,
More informationMatrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein
Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,
More informationON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES
ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG College of Mathematics and Physics Chongqing University Chongqing, 400030, P.R. China EMail: lihy.hy@gmail.com,
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationSPECIAL FORMS OF GENERALIZED INVERSES OF ROW BLOCK MATRICES YONGGE TIAN
Electronic Journal of Linear lgebra ISSN 1081-3810 publication of the International Linear lgebra Society EL SPECIL FORMS OF GENERLIZED INVERSES OF ROW BLOCK MTRICES YONGGE TIN bstract. Given a row block
More informationResearch Article Some Results on Characterizations of Matrix Partial Orderings
Applied Mathematics, Article ID 408457, 6 pages http://dx.doi.org/10.1155/2014/408457 Research Article Some Results on Characterizations of Matrix Partial Orderings Hongxing Wang and Jin Xu Department
More informationPartial isometries and EP elements in rings with involution
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 55 2009 Partial isometries and EP elements in rings with involution Dijana Mosic dragan@pmf.ni.ac.yu Dragan S. Djordjevic Follow
More informationEp Matrices and Its Weighted Generalized Inverse
Vol.2, Issue.5, Sep-Oct. 2012 pp-3850-3856 ISSN: 2249-6645 ABSTRACT: If A is a con s S.Krishnamoorthy 1 and B.K.N.MuthugobaI 2 Research Scholar Ramanujan Research Centre, Department of Mathematics, Govt.
More informationTHE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR
THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional
More informationABELIAN FUNCTIONS Abel's theorem and the allied theory of theta functions
ABELIAN FUNCTIONS Abel's theorem and the allied theory of theta functions H. F Baker St John's College, Cambridge CAMBRIDGE UNIVERSITY PRESS CHAPTER I. THE SUBJECT OF INVESTIGATION. I Fundamental algebraic
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationMassachusetts Institute of Technology Department of Economics Statistics. Lecture Notes on Matrix Algebra
Massachusetts Institute of Technology Department of Economics 14.381 Statistics Guido Kuersteiner Lecture Notes on Matrix Algebra These lecture notes summarize some basic results on matrix algebra used
More informationSummer Review Packet AP Calculus
Summer Review Packet AP Calculus ************************************************************************ Directions for this packet: On a separate sheet of paper, show your work for each problem in this
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationWI1403-LR Linear Algebra. Delft University of Technology
WI1403-LR Linear Algebra Delft University of Technology Year 2013 2014 Michele Facchinelli Version 10 Last modified on February 1, 2017 Preface This summary was written for the course WI1403-LR Linear
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 informationContents. Set Theory. Functions and its Applications CHAPTER 1 CHAPTER 2. Preface... (v)
(vii) Preface... (v) CHAPTER 1 Set Theory Definition of Set... 1 Roster, Tabular or Enumeration Form... 1 Set builder Form... 2 Union of Set... 5 Intersection of Sets... 9 Distributive Laws of Unions and
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University October 17, 005 Lecture 3 3 he Singular Value Decomposition
More informationChromatically Unique Bipartite Graphs With Certain 3-independent Partition Numbers III ABSTRACT
Malaysian Chromatically Journal of Mathematical Unique Biparte Sciences Graphs with 1(1: Certain 139-16 3-Independent (007 Partition Numbers III Chromatically Unique Bipartite Graphs With Certain 3-independent
More informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 13: Algorithmic Unsolvability The Halting Problem I In the last lecture we have shown
More information~ g-inverses are indeed an integral part of linear algebra and should be treated as such even at an elementary level.
Existence of Generalized Inverse: Ten Proofs and Some Remarks R B Bapat Introduction The theory of g-inverses has seen a substantial growth over the past few decades. It is an area of great theoretical
More informationSingular Value Inequalities for Real and Imaginary Parts of Matrices
Filomat 3:1 16, 63 69 DOI 1.98/FIL16163C Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Singular Value Inequalities for Real Imaginary
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 informationRe-nnd solutions of the matrix equation AXB = C
Re-nnd solutions of the matrix equation AXB = C Dragana S. Cvetković-Ilić Abstract In this article we consider Re-nnd solutions of the equation AXB = C with respect to X, where A, B, C are given matrices.
More informationTHE MOORE-PENROSE GENERALIZED INVERSE OF A MATRIX
THE MOORE-PENROSE GENERALIZED INVERSE OF A MATRIX A Dissertation Submitted For The Award of the Degree of Master of Philosophy In Mathematics Purva Rajwade School of Mathematics Devi Ahilya Vishwavidyalaya,
More informationMathematics for Economics and Finance
Mathematics for Economics and Finance Michael Harrison and Patrick Waldron B 375482 Routledge Taylor & Francis Croup LONDON AND NEW YORK Contents List of figures ix List of tables xi Foreword xiii Preface
More informationREAL LINEAR ALGEBRA: PROBLEMS WITH SOLUTIONS
REAL LINEAR ALGEBRA: PROBLEMS WITH SOLUTIONS The problems listed below are intended as review problems to do before the final They are organied in groups according to sections in my notes, but it is not
More informationA new algebraic analysis to linear mixed models
A new algebraic analysis to linear mixed models Yongge Tian China Economics and Management Academy, Central University of Finance and Economics, Beijing 100081, China Abstract. This article presents a
More informationAnalytical Mechanics for Relativity and Quantum Mechanics
Analytical Mechanics for Relativity and Quantum Mechanics Oliver Davis Johns San Francisco State University OXPORD UNIVERSITY PRESS CONTENTS Dedication Preface Acknowledgments v vii ix PART I INTRODUCTION:
More informationMoore Penrose inverses and commuting elements of C -algebras
Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationThe equalities of ordinary least-squares estimators and best linear unbiased estimators for the restricted linear model
The equalities of ordinary least-squares estimators and best linear unbiased estimators for the restricted linear model Yongge Tian a and Douglas P. Wiens b a School of Economics, Shanghai University of
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationarxiv: v1 [math.na] 1 Sep 2018
On the perturbation of an L -orthogonal projection Xuefeng Xu arxiv:18090000v1 [mathna] 1 Sep 018 September 5 018 Abstract The L -orthogonal projection is an important mathematical tool in scientific computing
More informationFactorization of weighted EP elements in C -algebras
Factorization of weighted EP elements in C -algebras Dijana Mosić, Dragan S. Djordjević Abstract We present characterizations of weighted EP elements in C -algebras using different kinds of factorizations.
More informationSkew-symmetric tensor decomposition
[Arrondo,, Macias Marques, Mourrain] University of Trento, Italy September 28, 2018 Warsaw Symmetric-rank C[x 0,..., x n ] d F = r λ i L d i i=1 S d C n+1 F = r i=1 λ i v d i this corresponds to find the
More informationELEMENTARY MATRIX ALGEBRA
ELEMENTARY MATRIX ALGEBRA Third Edition FRANZ E. HOHN DOVER PUBLICATIONS, INC. Mineola, New York CONTENTS CHAPTER \ Introduction to Matrix Algebra 1.1 Matrices 1 1.2 Equality of Matrices 2 13 Addition
More informationTwo Results About The Matrix Exponential
Two Results About The Matrix Exponential Hongguo Xu Abstract Two results about the matrix exponential are given. One is to characterize the matrices A which satisfy e A e AH = e AH e A, another is about
More informationAppendix A. Math Reviews 03Jan2007. A.1 From Simple to Complex. Objectives. 1. Review tools that are needed for studying models for CLDVs.
Appendix A Math Reviews 03Jan007 Objectives. Review tools that are needed for studying models for CLDVs.. Get you used to the notation that will be used. Readings. Read this appendix before class.. Pay
More informationDefinite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra
Definite versus Indefinite Linear Algebra Christian Mehl Institut für Mathematik TU Berlin Germany 10th SIAM Conference on Applied Linear Algebra Monterey Bay Seaside, October 26-29, 2009 Indefinite Linear
More information1. 4 2y 1 2 = x = x 1 2 x + 1 = x x + 1 = x = 6. w = 2. 5 x
.... VII x + x + = x x x 8 x x = x + a = a + x x = x + x x Solve the absolute value equations.. z = 8. x + 7 =. x =. x =. y = 7 + y VIII Solve the exponential equations.. 0 x = 000. 0 x+ = 00. x+ = 8.
More informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationDifferential Geometry, Lie Groups, and Symmetric Spaces
Differential Geometry, Lie Groups, and Symmetric Spaces Sigurdur Helgason Graduate Studies in Mathematics Volume 34 nsffvjl American Mathematical Society l Providence, Rhode Island PREFACE PREFACE TO THE
More informationThe reflexive re-nonnegative definite solution to a quaternion matrix equation
Electronic Journal of Linear Algebra Volume 17 Volume 17 28 Article 8 28 The reflexive re-nonnegative definite solution to a quaternion matrix equation Qing-Wen Wang wqw858@yahoo.com.cn Fei Zhang Follow
More informationFINITE-DIMENSIONAL LINEAR ALGEBRA
DISCRETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H ROSEN FINITE-DIMENSIONAL LINEAR ALGEBRA Mark S Gockenbach Michigan Technological University Houghton, USA CRC Press Taylor & Francis Croup
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationThe Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation
The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation Zheng-jian Bai Abstract In this paper, we first consider the inverse
More information(308 ) EXAMPLES. 1. FIND the quotient and remainder when. II. 1. Find a root of the equation x* = +J Find a root of the equation x 6 = ^ - 1.
(308 ) EXAMPLES. N 1. FIND the quotient and remainder when is divided by x 4. I. x 5 + 7x* + 3a; 3 + 17a 2 + 10* - 14 2. Expand (a + bx) n in powers of x, and then obtain the first derived function of
More information5 Years (10 Semester) Integrated UG/PG Program in Physics & Electronics
Courses Offered: 5 Years (10 ) Integrated UG/PG Program in Physics & Electronics 2 Years (4 ) Course M. Sc. Physics (Specialization in Material Science) In addition to the presently offered specialization,
More informationOn the Moore-Penrose and the Drazin inverse of two projections on Hilbert space
On the Moore-Penrose and the Drazin inverse of two projections on Hilbert space Sonja Radosavljević and Dragan SDjordjević March 13, 2012 Abstract For two given orthogonal, generalized or hypergeneralized
More informationMAT063 and MAT065 FINAL EXAM REVIEW FORM 1R x
Page NEW YORK CITY COLLEGE OF TECHNOLOGY of the City University of New York R DEPARTMENT OF MATHEMATICS Revised Spring 0 W. Colucci, D. DeSantis, and P. Deraney. Updated Fall 0 S. Singh MAT06 and MAT06
More informationUNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems
UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationNOTES ON MATRICES OF FULL COLUMN (ROW) RANK. Shayle R. Searle ABSTRACT
NOTES ON MATRICES OF FULL COLUMN (ROW) RANK Shayle R. Searle Biometrics Unit, Cornell University, Ithaca, N.Y. 14853 BU-1361-M August 1996 ABSTRACT A useful left (right) inverse of a full column (row)
More informationMATRIX AND LINEAR ALGEBR A Aided with MATLAB
Second Edition (Revised) MATRIX AND LINEAR ALGEBR A Aided with MATLAB Kanti Bhushan Datta Matrix and Linear Algebra Aided with MATLAB Second Edition KANTI BHUSHAN DATTA Former Professor Department of Electrical
More informationVector and Matrix Norms I
Vector and Matrix Norms I Scalar, vector, matrix How to calculate errors? Scalar: absolute error: ˆα α relative error: Vectors: vector norm Norm is the distance!! ˆα α / α Chih-Jen Lin (National Taiwan
More informationFundamentals of Differential Geometry
- Serge Lang Fundamentals of Differential Geometry With 22 luustrations Contents Foreword Acknowledgments v xi PARTI General Differential Theory 1 CHAPTERI Differential Calculus 3 1. Categories 4 2. Topological
More informationA Revised Denotational Semantics for the Dataflow Algebra. A. J. Cowling
Verification and Testing Research Group, Department of Computer Science, University of Sheffield, Regent Court, 211, Portobello Street, Sheffield, S1 4DP, United Kingdom Email: A.Cowling @ dcs.shef.ac.uk
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationVector and Matrix Norms I
Vector and Matrix Norms I Scalar, vector, matrix How to calculate errors? Scalar: absolute error: ˆα α relative error: Vectors: vector norm Norm is the distance!! ˆα α / α Chih-Jen Lin (National Taiwan
More informationSome inequalities for sum and product of positive semide nite matrices
Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,
More informationResearch Article Partial Isometries and EP Elements in Banach Algebras
Abstract and Applied Analysis Volume 2011, Article ID 540212, 9 pages doi:10.1155/2011/540212 Research Article Partial Isometries and EP Elements in Banach Algebras Dijana Mosić and Dragan S. Djordjević
More informationAlbert W. Marshall. Ingram Olkin Barry. C. Arnold. Inequalities: Theory. of Majorization and Its Applications. Second Edition.
Albert W Marshall Ingram Olkin Barry C Arnold Inequalities: Theory of Majorization and Its Applications Second Edition f) Springer Contents I Theory of Majorization 1 Introduction 3 A Motivation and Basic
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 information