Solutions of a system of mixed generalized Sylvester matrix equations
|
|
- Magdalene Greene
- 7 years ago
- Views:
Transcription
1 Dec Communication on Applied Mathematics and Computation Vol.28 No.4 DOI /j.issn Solutions of a system of mixed generalized Sylvester matrix equations XU Huan 1, ZHANG Yang 2 (1. College of Sciences, Shanghai University, Shanghai , China; 2. Department of Mathematics, University of Manitoba, Winnipeg, MB R3T 2N2, Canada) Abstract In this paper, we derive some necessary and sufficient conditions for the existence of a solution to the system of mixed generalized Sylvester matrix equations A1 X = B 1, Y A 2 = B 2, A 3 Z = B 3, C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2, where A i, B i, C j, D j, and E j (i = 1, 2, 3, j = 1, 2) are given complex matrices, and X, Y, and Z are variable matrices. We give an expression of the general solution to the above system when it is solvable. Moreover, we investigate the admissible ranks of the general solution to the system. This paper extends the known results in Wang and He s recent paper (Wang Q W, He Z H. Solvability conditions and general solution for mixed Sylvester equations. Automatica, 2013, 49: ). Key words Sylvester matrix equation; Moore-Penrose inverse; general solution 2010 Mathematics Subject Classification 15A24; 15A09; 15A03 Chinese Library Classification O ÇÆ Sylvester Ê Â ÁÎÉ 1, 2 (1. º º ; 2. ³µ ¼ µ MB R3T 2N2, ) Æ ± Sylvester ¹ ½ ű Sylvester ¾ ű Sylvester ± ² ÄÈÀ Sylvester Moore-Penrose ¾ 2010 Í ÃËÅ 15A24; 15A09; 15A03 Received ; Revised Corresponding author ZHANG Yang, research interests are computer algebra, analysis of matrix, and computation of polynomial. Yang.Zhang@umanitoba.ca
2 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations 403 ÏÃËÅ O Ì A Å (2014) Introduction Many problems in conventional linear control systems theory, such as neural network 1, robust control 2, feedback control 3-4, and pole/eigenstructure assignment design 5-6, are closely related with the generalized Sylvester matrix equation. Thus, many excellent work in this area have been done, for example, 2, 4, Recently, more and more people are getting interested in the mixed generalized Sylvester matrix equations A1 X Y B 1 = C 1, (1) A 2 Z Y B 2 = C 2, and A1 X Y B 1 = C 1, A 2 Y ZB 2 = C 2, (2) where A i, B i, and C i (i = 1, 2) are given complex matrices, X, Y, and Z are variable matrices. Lee and Vu 17 derived a necessary and sufficient solvability condition for the system (1). Liu 16 gave a solvability condition to (1). Very recently, Wang and He 23 considered a new necessary and sufficient solvability condition and the general solution to the mixed generalized Sylvester matrix equations (1). He and Wang 26 considered some necessary and sufficient solvability conditions and general solution to the system of mixed generalized Sylvester matrix equations (2). To our knowledge, there has been little information on the system of mixed generalized Sylvester matrix equations A1 X = B 1, Y A 2 = B 2, A 3 Z = B 3, C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2. (3) Motivated by the work mentioned above, as well as the wide application of Sylvester matrix equations, we consider the general solution to the system of mixed generalized Sylvester matrix equations (3). The paper is organized as follows. In Section 1, we review some known results and lemmas. In Section 2, some solvability conditions and the general solution to the system (3) are given. In Section 3, we derive the admissible ranks of the general solution to the system (3). Throughout this paper, we denote the complex number field by C. The notations C m n and C m m h stand for the sets of all m n complex matrices and all m m complex Hermitian matrices, respectively. The identity matrix with an appropriate size is denoted by I. For
3 404 Communication on Applied Mathematics and Computation Vol. 28 a complex matrix A, the symbols A and r(a) stand for the conjugate transpose and the rank of A, respectively. The Moore-Penrose inverse of A C m n, denoted by A, is defined to be the unique solution X to the following four matrix equations: AXA = A, XAX = X, (AX) = AX, (XA) = XA. Furthermore, L A and R A stand for the two projectors L A = I A A and R A = I AA induced by A, respectively. It is known that L A = L A and R A = RA. 1 Preliminaries In this section, we give some preliminary results which will be used in the rest part of this paper. Lemma 1 19 Let A, B, and C be given with appropriate sizes. Then, the following statements are equivalent. (i) Equation AXB = C (4) is consistent; (ii) R A C = 0 and CL B = 0; (iii) C r A C = r(a), r = r(b). B In this case, the general solution to the equation (4) can be expressed as X = A CB + L A V 1 + V 2 R B, where V 1 and V 2 are arbitrary matrices over C with appropriate sizes. Lemma 2 23 Let A i, B i, and C i (i = 1, 2) be given. Set D 1 = R B1 B 2, A = R A2, B = B 2 L D1, C = R A2 (R A1 C 1 B 1 B 2 C 2 )L D1. Then, the following statements are equivalent. (i) The mixed Sylvester matrix equations (1) are consistent; (ii) R A1 C 1 L B1 = 0, R A C = 0, CL B = 0. In this case, the general solution to the mixed Sylvester matrix equations (1) can be expressed as X = A 1 C 1 + U 1 B 1 + L A1 W 1, Y = R A1 C 1 B 1 + U 1 + V 1 R B1, Z = A 2 (C 2 R A1 C 1 B 1 B 2 + U 1 B 2 ) + W 4 D 1 + L A2 W 6,
4 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations 405 where U 1 =A CB +L A W 2 +W 3 R B, V 1 = R A2 (C 2 R A1 C 1 B 1 B 2+ U 1 B 2 )D 1 +A 2W 4 +W 5 R D1, and W 1, W 2,, W 6 are arbitrary matrices over C with appropriate sizes. Lemma 3 18 C m1 k, and P C l n1 be given. Then, Let A C m n, B C m k, C C l n, D C m p, E C q n, Q (i) r(a) + r(r A B) = r(b) + r(r B A) = r A B ; A (ii) r(a) + r(cl A ) = r(c) + r(al C ) = r ; C A B (iii) r(b) + r(c) + r(r B AL C ) = r. C 0 Lemma 4 27 Let f(x, Y ) = A BXD CY F be a matrix expression over C. Denote A A C A C A B C k min = r A B C + r D + max r r r D 0, D 0 D 0 0 F F 0 A B } A B A B C r r r D 0, F 0 F 0 0 F 0 and k max = min r A B A A B C, r D,r F 0 F, r } A C. D 0 Then, k min rf(x, Y ) k max. 2 Some solvability conditions and general solution to system (3) In this section, we derive some solvability conditions and the general solution to the system of mixed Sylvester matrix equations (3). Now, we give the fundamental theorem of this paper. Theorem 1 Let A i, B i, C j, D j, and E j (i = 1, 2, 3, j = 1, 2) be given. Set A 4 = C 1 L A1, B 4 = R A2 D 1, C 4 = E 1 C 1 A 1 B 1 + B 2 A 2 D 1, A 5 = C 2 L A3, B 5 = R A2 D 2, C 5 = E 2 C 2 A 3 B 3 + B 2 A 2 D 2, A = R A5 A 4, B = B 5 L (RB4 B 5), C = R A5 (R A4 C 4 B 4 B 5 C 5 )L (RB4 B 5).
5 406 Communication on Applied Mathematics and Computation Vol. 28 Then, the following statements are equivalent. (i) The system of mixed Sylvester matrix equations (3) is consistent; (ii) R Ak B k = 0 (k = 1, 3), B 2 L A2 = 0, R A4 C 4 L B4 = 0, CL B = 0, R A C = 0; (iii) r A k B k = r(a k ) (k = 1, 3), r B2 A 2 = r(a 2 ), E 1 C 1 B 2 r D 1 0 A 2 = r B 1 0 E 2 C 2 B 2 r D 2 0 A 2 = r C2 + r A 2 D 1, B 3 A 3 0 C 1 C 2 E 1 E 2 B D 1 D 2 A C 1 C 2 2 r 0 B = r 0 + r A 2 D 1 D 2. 0 B 3 0 A 3 + r A 2 D 2, In this case, the general solution to the system of mixed Sylvester matrix equations (3) can be expressed as where X = A 1 B 1 + L A1 U 1, Y = B 2 A 2 + U 2R A2, Z = A 3 B 3 + L A3 U 3, U 1 = A 4 C 4 + V 1 B 4 + L A4 W 1, U 2 = R A4 C 4 B 4 + A 4V 1 + V 2 R B4, (5) U 3 = A 5 (C 5 R A4 C 4 B 4 B 5 + A 4 V 1 B 5 ) + W 4 R B4 B 5 + L A5 W 6, (6) V 1 = A CB + L A W 2 + W 3 R B, V 2 = R A5 (C 5 R A4 C 4 B 4 B 5 + A 4 V 1 B 5 )(R B4 B 5 ) + A 5 W 4 + W 5 R (RB4 B 5), and W 1, W 2,, W 6 are arbitrary matrices over C with appropriate sizes. Proof (i) (ii): We separate the equations in the system of mixed Sylvester matrix equations (3) into two groups X = B 1, Y A 2 = B 2, A 3 Z = B 3, (7) C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2. (8)
6 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations 407 It follows from Lemma 1 that matrix equations in (7) are consistent, respectively, if and only if R A1 B 1 = 0, B 2 L A2 = 0, R A3 B 3 = 0. The general solutions to these matrix equations in (7) can be expressed as X = A 1 B 1 + L A1 U 1, Y = B 2 A 2 + U 2R A2, Z = A 3 B 3 + L A3 U 3, (9) where U 1, U 2, and U 3 are arbitrary. Substituting (9) into (8) gives L A1 U 1 U 2 R A2 D 1 = E 1 C 1 A 1 B 1 + B 2 A 2 D 1, C 2 L A3 U 3 U 2 R A2 D 2 = E 2 C 2 A 3 B 3 + B 2 A 2 D 2, i.e., A4 U 1 U 2 B 4 = C 4, A 5 U 3 U 2 B 5 = C 5. (10) Hence, the system (3) is consistent if and only if the matrix equations in (7) and (10) are consistent, respectively. It follows from Lemma 2 that the system of matrix equations (10) is consistent if and only if R A4 C 4 L B4 = 0, CL B = 0, R A C = 0. We know by Lemma 2 that the general solutions of the system of matrix equations (10) can be expressed as (5) (6). (ii) (iii): It follows from Lemma 2 that R Ak B k = 0 r(r Ak B k ) = 0 r A k B k = r(a k )(k = 1, 3), B 2 L A2 = 0 r(b 2 L A2 ) = 0 r B2 A 2 = r(a 2 ). From Lemma 1, R Ak B k = 0 (k = 1, 3), B 2 L A2 = 0, there exist X 0, Y 0, and Z 0 such that X 0 = B 1, Y 0 A 2 = B 2, and A 3 Z 0 = B 3. Applying Lemma 3 to R A4 C 4 L B4 = 0 gives C4 A 4 R A4 C 4 L B4 = 0 r(r A4 C 4 L B4 ) = 0 r = r(a 4 ) + r(b 4 ) B 4 0 C 4 C 1 L A1 r R A2 D 1 0 C 4 C 1 0 =r(c 1 L A1 )+r(r A2 D 1 ) r D 1 0 A 2 =r 0 0 +r A 2 D 1
7 408 Communication on Applied Mathematics and Computation Vol. 28 E 1 C 1 X 0 + Y 0 D 1 C 1 0 r D 1 0 A 2 = r 0 0 E 1 C 1 B 2 r D 1 0 A 2 = r B r A 2 D 1 + r A 2 D 1. Similarly, we have C5 A 5 CL B = 0 r(cl B ) = 0 r = r(a 5 ) + r(b 5 ) B 5 0 C 5 C 2 L A3 r R A2 D 2 0 E 2 C 2 Z 0 + Y 0 D 2 C 2 0 r D 2 0 A 2 = r 0 E 2 C 2 B 2 r D 2 0 A 2 = r B 3 A 3 0 = r(c 2 L A3 ) + r(r A2 D 2 ) C2 A 3 C2 A 3 + r A 2 D 2 + r A 2 D 2, A4 R A4 C 4 B 4 R A C = 0 r(r A C) = 0 r B 5 C 5 A 5 = r A 4 A 5 + r(r B4 B 5 ) 0 R B4 B 5 0 A4 A 5 C 5 C 4 r = r A 4 A 5 + r B 4 B B 5 B 4 C 1 C 2 E 1 E 2 B D 1 D 2 A C 1 C 2 2 r 0 B = r 0 + r A 2 D 1 D 2. 0 B 3 0 (i)= (iii): Assume that the system of mixed Sylvester matrix equations (3) has a solution, say, (X, Y, Z). Then, we have r B 1 = r X = r( ), ra 3 B 3 = ra 3 A 3 Z = r(a 3 ), B2 Y A2 r = r = r(a 2 ), A 2 A 2
8 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations 409 E 1 C 1 B 2 C 1 X Y D 1 C 1 Y A 2 r D 1 0 A 2 = r D 1 0 A 2 = r B 1 0 X 0 E 2 C 2 B 2 C 2 Z Y D 2 C 2 Y A 2 r D 2 0 A 2 = r D 2 0 A 2 = r B 3 A 3 0 A 3 Z A 3 0 C2 A 3 + r A 2 D 1, + r A 2 D 2, C 1 C 2 E 1 E 2 B 2 C 1 C 2 C 1 X Y D 1 C 2 Z Y D 2 Y A D 1 D 2 A 2 r 0 B = r 0 0 D 1 D 2 A 2 0 X B 3 0 Z 0 C 1 C 2 = r 0 + r A 2 D 1 D 2. In Theorem 1, assuming A 2 and B 2 vanish, we obtain the general solution to the system A1 X = B 1, A 3 Z = B 3, (11) C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2. Corollary 1 Let A i, B i, C j, D j, and E j (i = 1, 3, j = 1, 2) be given. Set A 4 = C 1 L A1, C 4 = E 1 C 1 A 1 B 1, A 5 = C 2 L A3, C 5 = E 2 C 2 A 3 B 3, A = R A5 A 4, B = B 2 L (RD1 D 2), C = R A5 (R A4 C 4 D 1 D 2 C 5 )L (RD1 D 2). Then, the following statements are equivalent. (i) The system (11) is consistent; (ii) (iii) R Ak B k = 0 (k = 1, 3), R A4 C 4 L D1 = 0, CL B = 0, R A C = 0; E 1 C 1 r D 1 0 = r B 1 r A k B k = r(a k )(k = 1, 3), E 2 C 2 + r(d 1 ), r D 2 0 = r B 3 A 3 C2 C 1 C 2 E 1 E D 1 D C 1 C 2 2 r 0 B 1 0 = r 0 + r D 1 D 2. 0 B 3 A 3 + r(d 2 ),
9 410 Communication on Applied Mathematics and Computation Vol. 28 In this case, the general solution to the system (11) can be expressed as X = A 1 B 1 + L A1 U, Y = R A4 C 4 D 1 + A 4U 1 + V 1 R D1, Z = A 3 B 3 + L A3 V, where U = A 4 C 4 + U 1 D 1 + L A4 W 1, V = A 5 (C 5 R A4 C 4 D 1 D 2 + A 4 U 1 D 2 ) + W 4 R D1 D 2 + L A5 W 6, U 1 = A CB + L A W 2 + W 3 R B, V 1 = R A5 (C 5 R A4 C 4 D 1 D 2 + A 4 U 1 D 2 )(R D1 D 2 ) + A 5 W 4 + W 5 R (RD1 D 2), and W 1, W 2,, W 6 are arbitrary matrices over C with appropriate sizes. 3 Admissible ranks of general solution of system (3) We now turn our attention to the admissible ranks of the general solution of (3). For convenience, we use the following notations: } J 1 = X C m n X = B 1, Y A 2 = B 2, A 3 Z = B 3,, C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2 J 2 = Z C p q X = B 1, Y A 2 = B 2, A 3 Z = B 3, C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2 Theorem 2 Let A i, B i, C j, D j, E j (i = 1, 2,, 5, j = 1, 2), A, B, and C be defined as in Theorem 1. Suppose the system of mixed Sylvester matrix equations (3) is consistent. Then, }. x min r(x) X J 1 x max, z min r(z) Z J 2 z max, where D 1 A 2 x max = min n, m + r(b 1) r( ), m + r E 1 B 2 r r(a 2 ), B 1 0 D 1 D 2 0 A 2 E 1 E 2 C 2 0 C 1 C 2 m+r B r 0 r A 2 D 2, (12) 0 B 3 0 0
10 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations 411 D 1 A 2 x min = r(b 1 )+r E 1 B 2 B 1 0 D 1 D 2 0 A 2 D 1 A 2 0 E 1 E 2 C 2 0 +r B r E 1 B 2 C 2 B r D1 D 2 A 2 B B D 2 A 2 z max = min q, p + r(b C2 3) r(a 3 ), p + r E 2 B 2 r r(a 2 ), A 3 B 3 0 D 2 D 1 0 A 2 E 2 E 1 C 1 0 C 1 C 2 p + r B r 0 r A 2 D 1, 0 B D 2 A 2 z min = r(b 3 ) + r E 2 B 2 B 3 0 D 2 D 1 0 A 2 D 2 A 2 0 E 2 E 1 C 1 0 +r B r E 2 B 2 C 1 B r D2 D 1 A 2 B B , (13) Proof By Theorem 1, the expression of X in the system of mixed Sylvester matrix equations (3) can be expressed as X = X 0 + L A1 L A4 W 1 + L A1 L A W 2 B 4 + L A1 W 3 R B B 4, (14). where X 0 is a special solution of (3), W 1, W 2, and W 3 are arbitrary matrices over C with appropriate sizes. Note that R(L A4 ) R(L A ). It follows from Lemma 4 that r X 0 X0 L A1 L A4 X0 L A1 L A L A1 + r + r B 4 0 R B B 4 0 X0 L A1 L A r B 4 0 r(x) X J 1 min r X0 L A1 n, r X 0 L A1,r r(l A1 L A4 ) R B B 4 0 X0 L A1 L A4 B 4 0, r X0 L A1 L A R B B 4 0 }. (15)
11 412 Communication on Applied Mathematics and Computation Vol. 28 Applying Lemma 3, using the block Gaussian elimination and X 0 = B 1, Y 0 A 2 = B 2, A 3 Z 0 = B 3, C 1 X 0 Y 0 D 1 = E 1, C 2 Z 0 Y 0 D 2 = E 2, we have r X 0 L A1 = m + r(b 1 ) r( ), r(l A1 L A4 ) = m r X0 L A1 L A4 r B 4 0 D 1 A 2 = m + r E 1 B 2 r B 1 0, (16) r(a 2 ), (17) D 1 D 2 0 A 2 X0 L A1 L A E 1 E 2 C 2 0 C 1 C 2 r = m + r R B B 4 0 B r 0 r A 2 D 2, (18) 0 B D 1 A 2 0 X0 L A1 L A E 1 B 2 C C 1 C 2 2 r = m + r B 4 0 B r(a 2) r 0, (19) 0 X0 L A1 r = m + r R B B 4 0 D1 D 2 A 2 B r( ) r A 2 D 2. (20) Substituting (16) (20) into (15) yields (12) and (13). Using A 3, B 3, C 2, D 2, and E 2 instead of, B 1, C 1, D 1, and E 1 in (12) and (13), we can obtain the admissible ranks of Z in (3). In Theorem 2, assuming A 2 and B 2 vanish, we obtain the admissible ranks of X and Z in the system (11). Corollary 2 Let A i, B i, C j, D j, and E j (i = 1, 3, j = 1, 2) be given. Suppose the system (11) is consistent. We take two matrix sets as Then, S 1 = S 2 = X C m n X = B 1, A 3 Z = B 3, C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2 Z C p q X = B 1, A 3 Z = B 3, C 1 X Y D 1 = E 1, C 2 Z Y D 2 = E 2 } }., x min r(x) X S 1 x max, z min r(z) Z S 2 z max,
12 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations 413 where x max =min n, m + r(b 1) r( ), m + r D 1 E 1 B 1 r, D 1 D 2 0 E 1 E 2 C C 1 C 2 2 m+r B r 0 r(d 2 ), 0 B 3 0 x min = r(b 1 ) + r D 1 E 1 B 1 D 1 D 2 0 D 1 0 E 1 E 2 C 2 + r B r E 1 C 2 B 1 0 r D1 D 2 B B 3 0 z max =min q, p + r(b 3) r(a 3 ), p + r z min = r(b 3 ) + r D 2 E 2 B 3 D 2 E 2 B 3 r C2 A 3, D 2 D 1 0 E 2 E 1 C C 1 C 2 1 p+r B r 0 r(d 1 ), 0 B 1 0 D 2 D 1 0 D 2 0 E 2 E 1 C 1 + r B r E 2 C 1 B 3 0 r D2 D 1 B B Corollary 3 Let A i, B i, and C i (i = 1, 2) be given. Suppose that the mixed pairs of Sylvester matrix equations (1) are consistent. Then, x min r(x) x max, ẑ min r(z) ẑ max, X Y B 1=C 1,A 2Z Y B 2=C 2 X Y B 1=C 1,A 2Z Y B 2=C 2 x max = min m, n, m + r B1 C 1 r A 2 r(b 2 ) B1 B 2 0 r( ), m + r C 1 C 2 A 2 },,. x min = r B1 C 1 B1 B r r B 1 C 1 C 2 A 2 B1 0 B 2 r, C 1 A 2
13 414 Communication on Applied Mathematics and Computation Vol. 28 ẑ max = min p, q, p + r B2 C 2 r A 2 r(b 1 ) B1 B 2 0 r(a 2 ), p + r C 1 C 2 }, ẑ min = r B2 C 2 B1 B r r B 1 C 1 C 2 B2 0 B 2 r. C 2 Remark 1 Corollary 3 is the main result of Conclusions We have derived some solvability conditions for the existence of the general solution to the system of mixed generalized pairs of Sylvester matrix equations (3). Based on the expression of the solution to (3), we have presented the the admissible ranks of the general solution of system (3). This paper extends the major results of 23. References 1 Zhang Y, Jiang D, Wang J. A recurrent neural network for solving Sylvester equation with time-varying coefficients J. IEEE Transactions on Neural Networks, 2002, 13(5): Iii R K, Bhattacharyya S P. Robust and well conditioned eigenstructure assignment via Sylvester s equation J. Optimal Control Applications and Methods, 1983, 4(3): Duan G R. Eigenstructure assignment and response analysis in descriptor linear systems with state feedback control J. International Journal of Control, 1998, 69(5): Syrmos V L, Lewis F L. Output feedback eigenstructure assignment using two Sylvester equations J. IEEE Transations on Automomic Control, 1993, 38(3): Duan G R. Solution to matrix equation AV + BW = EV F and eigenstructure assignment for descriptor systems J. Automatica, 1992, 28(3): Fletcher L R, Kautsky J, Nichols N K. Eigenstructure assignment in descriptor systems J. IEEE Transactions on Automatic Control, 1986, 31(12): Baksalary J K, Kala P. The matrix equation AX + Y B = C J. Linear Algebra Appl, 1979, 25: Bao L, Lin Y Q, Wei Y M. A new projection method for solving large Sylvester equations J. Appl Num Math, 2007, 57: Calvetti D, Lewis B, Reichel L. On the solution of large Sylvester-observer equation J. Numer Linear Algebra Appl, 2001, 8: Chen T, Francis B A. Optimal Sampled-data Control Systems M. London: Springer-Verlag, Castelan E B, da Silva V Gomes. On the solution of a Sylvester matrix equation appearing in descriptor systems control theory J. Syst Contr Lett, 2005, 54: Dehghan M, Hajarian M. Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations J. Appl Math Model, 2011, 35: Ding F, Chen T, Iterative least squares solutions of coupled Sylvester matrix equations J. Syst Contr Lett, 2005, 54: El Guennouni A, Jbilou K, Riquet J. Block Krylov subspace methods for solving large Sylvester equations J. Numer Algorithms, 2002, 29: Kägström B. A perturbation analysis of the generalized Sylvester equation (AR LB, DR LE) = (C,F) J. SIAM J Matrix Anal Appl, 1994, 15:
14 No. 4 XU Huan, et al.: Solutions of mixed generalized Sylvester matrix equations Liu Y H. Ranks of solutions of the linear matrix equation AX + Y B = C J. Comput Math Appl, 2006, 52: Lee S G, Vu Q P. Simultaneous solutions of matrix equations and simultaneous equivalence of matrices J. Linear Algebra Appl, 2012, 437: Marsaglia G, Styan G P H. Equalities and inequalities for ranks of matrices J. Linear and Multilinear Algebra, 1974, 2: Penrose R. A generalized inverse for matrices J. Proc Camb Philos Soc, 1955, 51: Roth W E. The equation AX Y B = C and AX XB = C in matrices J. Proc Amer Math Soc, 1952, 3: Tsui C C. A complete analytical solution to the equation T A F T = LC and its applications J. IEEE Trans Autom Control, 1987, 8: Wang Q W, Sun J H, Li S Z. Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra J. Linear Algebra Appl, 2002, 353: Wang Q W, He Z H. Solvability conditions and general solution for mixed Sylvester equations J. Automatica, 2013, 49: Wimmer H K. Consistency of a pair of generalized Sylvester equations J. IEEE Trans Autom Control, 1994, 39: Zhou B, Li Z Y, Duan G R, Wang Y. Weighted least squares solutions to general coupled Sylvester matrix equations J. J Comput Appl Math, 2009, 224: He Z H, Wang Q W. A pair of mixed generalized Sylvester matrix equations J. Journal of Shanghai University: Natural Science, 2014, 20(2). DOI: /j.issn Chu D L, Hung Y S, Woerdeman H J. Inertia and rank characterizations of some matrix expressions J. SIAM J Matrix Anal Appl, 2009, 31:
Continuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationOn the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationAn interval linear programming contractor
An interval linear programming contractor Introduction Milan Hladík Abstract. We consider linear programming with interval data. One of the most challenging problems in this topic is to determine or tight
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
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 informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationRINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
More informationBy choosing to view this document, you agree to all provisions of the copyright laws protecting it.
This material is posted here with permission of the IEEE Such permission of the IEEE does not in any way imply IEEE endorsement of any of Helsinki University of Technology's products or services Internal
More informationNon-unique factorization of polynomials over residue class rings of the integers
Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationFourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions
Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationSolving simultaneous equations using the inverse matrix
Solving simultaneous equations using the inverse matrix 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix
More informationMATRICES WITH DISPLACEMENT STRUCTURE A SURVEY
MATRICES WITH DISPLACEMENT STRUCTURE A SURVEY PLAMEN KOEV Abstract In the following survey we look at structured matrices with what is referred to as low displacement rank Matrices like Cauchy Vandermonde
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationCacti with minimum, second-minimum, and third-minimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationa 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.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS
ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie
More informationMatrices 2. Solving Square Systems of Linear Equations; Inverse Matrices
Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,
More informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationResearch Article The General Traveling Wave Solutions of the Fisher Equation with Degree Three
Advances in Mathematical Physics Volume 203, Article ID 65798, 5 pages http://dx.doi.org/0.55/203/65798 Research Article The General Traveling Wave Solutions of the Fisher Equation with Degree Three Wenjun
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More information8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationAbstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,
More informationWHEN DOES A CROSS PRODUCT ON R n EXIST?
WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationOn an algorithm for classification of binary self-dual codes with minimum distance four
Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory June 15-21, 2012, Pomorie, Bulgaria pp. 105 110 On an algorithm for classification of binary self-dual codes with minimum
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationDynamic Eigenvalues for Scalar Linear Time-Varying Systems
Dynamic Eigenvalues for Scalar Linear Time-Varying Systems P. van der Kloet and F.L. Neerhoff Department of Electrical Engineering Delft University of Technology Mekelweg 4 2628 CD Delft The Netherlands
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationLU Factoring of Non-Invertible Matrices
ACM Communications in Computer Algebra, LU Factoring of Non-Invertible Matrices D. J. Jeffrey Department of Applied Mathematics, The University of Western Ontario, London, Ontario, Canada N6A 5B7 Revised
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
This is the Pre-Published Version. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines Q.Q. Nong, T.C.E. Cheng, C.T. Ng Department of Mathematics, Ocean
More informationTHE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP
THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More informationAn inequality for the group chromatic number of a graph
Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,
More informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More informationComputing divisors and common multiples of quasi-linear ordinary differential equations
Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationCONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí
Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale
More informationSECRET sharing schemes were introduced by Blakley [5]
206 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 1, JANUARY 2006 Secret Sharing Schemes From Three Classes of Linear Codes Jin Yuan Cunsheng Ding, Senior Member, IEEE Abstract Secret sharing has
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationNilpotent Lie and Leibniz Algebras
This article was downloaded by: [North Carolina State University] On: 03 March 2014, At: 08:05 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials
Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from
More informationMarch 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationLinear Authentication Codes: Bounds and Constructions
866 IEEE TRANSACTIONS ON INFORMATION TNEORY, VOL 49, NO 4, APRIL 2003 Linear Authentication Codes: Bounds and Constructions Huaxiong Wang, Chaoping Xing, and Rei Safavi-Naini Abstract In this paper, we
More informationMatrix Differentiation
1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have
More informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More informationRoots of Polynomials
Roots of Polynomials (Com S 477/577 Notes) Yan-Bin Jia Sep 24, 2015 A direct corollary of the fundamental theorem of algebra is that p(x) can be factorized over the complex domain into a product a n (x
More informationTypical Linear Equation Set and Corresponding Matrices
EWE: Engineering With Excel Larsen Page 1 4. Matrix Operations in Excel. Matrix Manipulations: Vectors, Matrices, and Arrays. How Excel Handles Matrix Math. Basic Matrix Operations. Solving Systems of
More informationWe shall turn our attention to solving linear systems of equations. Ax = b
59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system
More informationLecture 2: August 29. Linear Programming (part I)
10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationLINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS
LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS LESLIE D. GATES, JR.1 1. Introduction. The main result of this paper is an extension of the analysis of Laurent Schwartz [l ] concerning the primitive of
More informationDuplicating and its Applications in Batch Scheduling
Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China
More informationFunctional-Repair-by-Transfer Regenerating Codes
Functional-Repair-by-Transfer Regenerating Codes Kenneth W Shum and Yuchong Hu Abstract In a distributed storage system a data file is distributed to several storage nodes such that the original file can
More informationLecture 1: Schur s Unitary Triangularization Theorem
Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationBounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 6 2010 Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices Roger A. Horn rhorn@math.utah.edu
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationJournal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics 226 (2009) 92 102 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam
More informationHW6 Solutions. MATH 20D Fall 2013 Prof: Sun Hui TA: Zezhou Zhang (David) November 14, 2013. Checklist: Section 7.8: 1c, 2, 7, 10, [16]
HW6 Solutions MATH D Fall 3 Prof: Sun Hui TA: Zezhou Zhang David November 4, 3 Checklist: Section 7.8: c,, 7,, [6] Section 7.9:, 3, 7, 9 Section 7.8 In Problems 7.8. thru 4: a Draw a direction field and
More informationSURVEY ON DYNAMICAL YANG-BAXTER MAPS. Y. Shibukawa
SURVEY ON DYNAMICAL YANG-BAXTER MAPS Y. Shibukawa Department of Mathematics, Faculty of Science, Hokkaido University, Sapporo 060-0810, Japan e-mail: shibu@math.sci.hokudai.ac.jp Abstract In this survey,
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationRelatively dense sets, corrected uniformly almost periodic functions on time scales, and generalizations
Wang and Agarwal Advances in Difference Equations (2015) 2015:312 DOI 10.1186/s13662-015-0650-0 R E S E A R C H Open Access Relatively dense sets, corrected uniformly almost periodic functions on time
More informationA SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More information