The reflexive and anti-reflexive solutions of the matrix equation A H XB =C
|
|
- Andrea Bond
- 5 years ago
- Views:
Transcription
1 Journal of Computational and Applied Mathematics 200 (2007) The reflexive and anti-reflexive solutions of the matrix equation A H XB =C Xiang-yang Peng a,b,, Xi-yan Hu a, Lei Zhang a a College of Mathematics and Econometrics, Hunan University, Changsha , PR China b Department of Information and Computing Science, ChangSha University, Changsha , PR China Received 10 June 2005; received in revised form 19 ctober 2005 Abstract In this paper, the necessary and sufficient conditions for the solvability of matrix equation A H XB = C over the reflexive or anti-reflexive matrices are given, and the general expression of the solution for a solvable case is obtained. Moreover, the relative optimal approximation problem is considered. The explicit expressions of the optimal approximation solution and the minimum norm solution are both provided Published by Elsevier B.V. MSC: 15A24 Keywords: Reflexive matrix; Anti-reflexive matrix; Matrix equation; ptimal approximation matrix; Minimum norm solution 1. Introduction Throughout the paper, we denote the complex n-vector space by C n, the set of m n complex matrices by C m n, the set of n n nonsingular matrices by Cn n n, and the conjugate transpose of a complex matrix A by A H. We define an inner product A, B = trace(b H A) for all A, B C m n. Then C m n is a Hilbert inner product space and the norm generated by this inner product is Frobenius norm. Let A be the Frobenius norm of matrix A. The notation A B = (a ij b ij ) m n represents the Hadamard product for any A = (a ij ) m n,b = (b ij ) m n. Chen and Chen [1], Chen [2,3], and Chen and Sameh [4] introduce the following two special classes of subspaces in C m n Cr n n (P ) ={X C n n X = PXP}, Ca n n (P ) ={X C n n X = PXP}, where P is a generalized reflection matrix of size n, that is P H = P and P 2 = I. Research supported by National Natural Science Foundation of China ( ). Corresponding author. Department of Information and Computing Science of Changsha University, Changsha, Hunan 41003, PR China. Tel.: address: pxy396@yahoo.com.cn (X.-y. Peng) /$ - see front matter 2006 Published by Elsevier B.V. doi: /j.cam
2 750 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) Let HC n n ={P C n n P H = P, P 2 = I}. Matrix X Cr n n (P ) (or Y Ca n n (P )) is said to be a reflexive (or anti-reflexive) matrix with respect to the generalized reflection matrix P, respectively (abbreviated reflexive (or anti-reflexive) matrix in the paper). The reflexive and anti-reflexive matrices have many special properties and are widely used in engineering and scientific computation [1 4]. In this paper, we mainly consider the following two problems. Problem I. Given matrices A C n m, B C n l, C C m l, find X C n n r (P ) (or C n n (P )) such that A H XB = C. (1.1) Denote the solution set of Problem I by S re (or S ae ). If S re (or S ae ) is nonempty, we consider the relative optimal approximation problem, namely Problem II. Given X C n n, find a n n matrix ˆX S re (or S ae ) such that ˆX X = min X X S re (ors ae ) X. (1.2) The matrix equation A T XA = B, one special form of A H XB = C, was discussed in many papers with the unknown matrix X be symmetric, symmetric positive, central-symmetric, symmetric ortho-symmetric (see, for instance, Chu [5,6], Dai [8], He[10], Peng [12], Peng and Hu [14]) and the matrix equation AX = B, another special form of A H XB = C, was discussed too with the unknown matrix X be reflexive, anti-reflexive, symmetric and re-positive define and etc., (see, for instance, [13,7,9,15]). Matrix equation A H XB = C with unknown X be only symmetric was studied in Dai [7]. In these papers, by using the structure properties of matrices in required subset of C m n and the generalized singular value decomposition (GSVD), the necessary and sufficient conditions for the existence and the expressions of the solution for the matrix equation were given. The reflexive and anti-reflexive matrices have extensive applications in engineering and scientific computation. However, the reflexive and anti-reflexive solutions of matrix equation A H XB = C have not been considered yet. This Problem I is to be settled. The optimal approximation problem is initially proposed in the processes of test or recovery of linear systems due to incomplete dates or revising given dates. A preliminary estimate X of the unknown matrix X can be obtained by the experimental observation values and the information of statistical distribution and that is the Problem II we shall discuss in this paper. Finally, we will obtain the expression of the minimum norm solution which satisfies min X SrE X (or min X SaE X ). The paper is organized as follows. In Section 2, the necessary and sufficient conditions for the existence of and the expressions for the reflexive and anti-reflexive solutions of Eq. (1.1) will be derived. In Section 3, the expressions for the optimal approximation solution of Problem II and the minimum norm solution of Problem I will be obtained. In Section 4, we have given a numerical example to illustrate our results. a 2. Solutions of Problem I In this section, we first introduce some structure properties of the generalized reflection matrix P and subsets Cr n n (P ) and Ca n n (P ) of C n n. We then give the necessary and sufficient conditions for the existence of and the expressions for the reflexive and anti-reflexive solutions with respect to a generalized reflection matrix P of Eq. (1.1). Lemma 2.1 (Peng et al. [14]). If r = rank(i n + P), n r = rank(i n P), then there exist unit orthogonal column matrices U 1 C n r and U 2 C n (n r) such that 2 1 (I n + P)= U 1 U1 H, 2 1 (I n P)= U 2 U2 H and U 1 H U 2 = 0. Let U = (U 1,U 2 ), it can be easily verified from Lemma 2.1 that U is an unitary matrix, and P can be expressed as ( ) Ir P = U U H. (2.1) I n r
3 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) Lemma 2.2 (Peng et al. [14]). X Cr n n (P ) if and only if X can be expressed as ( ) X 11 X = U U X H, (2.2) 22 where X 11 C r r, X 22 C (n r) (n r), and U is the same as (2.1). Lemma 2.3 (Peng et al. [14]). X Ca n n (P ) if and only if X can be expressed as ( ) X 12 X = U U H, (2.3) X 21 where X 12 C r (n r), X 21 C (n r) r, and U is the same as (2.1). Denote U H A = U H B = ( A1 A 2 ( B1 B 2 ), A 1 C r m,a 2 C (n r) m, (2.4) ), B 1 C r l,b 2 C (n r) l. (2.5) Using GSVD [11] on matrix pair [A H 1,AH 2 ], we obtain A H 1 = W AΣ 1A U H A, AH 2 = W AΣ 2A V H A, (2.6) where W A Cm m m is a nonsingular matrix, U A C r r and V A C (n r) (n r) are unitary matrices, and I 1A k 1 2A k 1 D 1A D 2A Σ 1A = 1A r k 1, Σ 2A = I 2A t 1 k 1, m r m t 1 k 1 r k 1 n r + k 1 t 1 t 1 k 1 (2.7) where t 1 = rank(a H 1,AH 2 ), k 1 = t 1 rank(a H 2 ), = rank(a H 1 ) + rank(ah 2 ) t 1, I 1A and I 2A are identity matrices, 1A, 2A and are zero matrices, D 1A = diag(λ 1A, λ 2A,...,λ s1 A)>0, D 2A = diag(μ 1A, μ 2A,...,μ s1 A)>0 with 1 > λ 1A λ 2A λ s1 A > 0, 0 < μ 1A μ 2A μ s1 A < 1 and λ 2 ia + μ2 ia = 1, (i = 1, 2,...,). Similarly, the GSVD of matrix pair [B H 1,BH 2 ] is B H 1 = W BΣ 1B U H B, BH 2 = W BΣ 2B V H B, (2.8) where W B Cl l l is a nonsingular matrix, U B C r r and V B C (n r) (n r) are unitary matrices, I 1B k 2 2B D 1B s 2 D 2B Σ 1B = 1B r k 2 s 2, Σ 2B = I 2B l r k 2 s 2 r k 2 s 2 n r + k 2 t 2 s 2 t 2 k 2 s 2 k 2 s 2 t 2 k 2 s 2, l t 2 (2.9) where t 2 = rank(b H 1,BH 2 ), k 2 = t 2 rank(b H 2 ), s 2 = rank(b H 1 ) + rank(bh 2 ) t 2, I 1B and I 2B are identity matrices, 1B, 2B and are zero matrices. D 1B = diag(λ 1B, λ 2B,...,λ s2 B)>0, D 2B = diag(μ 1B, μ 2B,...,μ s2 B)>0 with 1 > λ 1B λ 2B λ s2 B > 0, 0 < μ 1B μ 2B μ s2 B < 1, and λ 2 ib + μ2 ib = 1, (i = 1, 2,...,s 2).
4 752 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) We now state the following results. Let C 11 C 12 C 13 C 14 C 21 C 22 C 23 C 24 WA 1 CW H B = C 31 C 32 C 33 C 34 C 41 C 42 C 43 C 44 k 1 t 1 k 1. (2.10) m t 1 k 2 s 2 t 2 k 2 s 2 l t 2 Theorem 2.1. Given A C n m, B C n l, C C m l in Problem I, P HC n n which can be expressed as (2.1). Partition U H A and U H B as (2.4) and (2.5). The GSVD of matrix pairs [A H 1,AH 2 ] and [BH 1,BH 2 ] areasin(2.6) and (2.8), respectively, the partition form of WA 1 CW H B is (2.10). Then Eq. (1.1) has a solution X Cr n n (P ), if and only if C 14 =, C 24 =, C 34 =, C 13 =, C 31 =, C 41 =, C 42 =, C 43 =, C 44 =. (2.11) In that case, the general solution can be expressed as C 11 C 12 D1B 1 X 13 U A D1A 1 C 21 X 22 X 23 UB H X = U X 31 X 32 X 33 X 44 X 45 X 46 V A X 54 D2A 1 (C 22 D 1A X 22 D 1B )D2B 1 D 1 X 64 C 32 D2B 1 C 33 2A C 23 VB H U H, (2.12) where X 13 C k 1 (r k 2 s 2 ), X 22 C s 2, X 23 C (r k 2 s 2 ), X 31 C (r k 1 ) k 2, X 32 C (r k 1 ) s 2, X 33 C (r k 1 ) (r k 2 s 2 ), X 44 C (n r+k 1 t 1 ) (n r+k 2 t 2 ), X 45 C (n r+k 1 t 1 ) s 2, X 46 C (n r+k 1 t 1 ) (t 2 +k 2 s 2 ), X 54 C (n r+k 2 t 2 ), and X 64 C (t 1 k 1 ) (n r+k 2 t 2 ) are arbitrary matrices. Proof. We first prove the necessity of (2.11). If Eq. (1.1) has a reflexive solution X, then X satisfies (2.2), so Eq. (1.1) is equivalent to ( ) X (U H A) H 11 U X H B = C. (2.13) 22 Substituting (2.4) and (2.5) into (2.13), we obtain A H 1 X 11 B 1 + A H 2 X 22 B 2 = C. (2.14) Note that W A and W B are nonsingular matrices. From (2.6) and (2.8), we get Σ 1A (UA H X 11 U B )Σ H 1B + Σ 2A(VA H X 22 V B )Σ H 2B = W A 1 CW H B. (2.15) Let X 11 X 12 X 13 k 1 UA H X X 21 X 22 X U B = (2.16) X 31 X 32 X 33 r k 1 and k 2 s 2 r k 2 s 2 X 44 X 45 X 46 VA H X X 54 X 55 X V B = X 64 X 65 X 66 n r+k 2 t 2 s 2 t 2 k 2 s 2 n r + k 1 t 1 t 1 k 1. (2.17)
5 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) Substituting (2.16) and (2.17) into (2.15), we obtain X 11 X 12 D 1B C 11 C 12 C 13 C 14 D 1A X 21 D 1A X 22 D 1B + D 2A X 55 D 2B D 2A X 56 X 65 D 2B X 66 = C 21 C 22 C 23 C 24 C 31 C 32 C 33 C 34. (2.18) C 41 C 42 C 43 C 44 Therefore (2.18) holds if and only if (2.13) holds and X 11 = C 11, X 12 = C 12 D1B 1, X 21 = D1A 1 C 21, X 56 = D2A 1 C 23, X 65 = C 32 D2B 1, X 66 = C 33, X 55 = D2A 1 (C 22 D 1A X 22 D 1B )D2B 1. Substituting the above into (2.16), (2.17) and (2.2), thus we have formulation (2.12). Now we prove the sufficiency of (2.11). Let 11 = U A X (0) X (0) C 11 D 1 C 12 D 1 1B 1A C 21 UB H, 22 = V A D2A 1 C 22D2B 1 D 1 C 32 D2B 1 C 33 2A C 23 VB H. bviously, X (0) 11 Cr r, X (0) 22 C(n r) (n r). By Lemma 2.2 and X 0 = U ( X (0) 11 X (0) 22 ) U H, we have X 0 Cr n n (P ). Hence ( (0) X 11 A H X 0 B = A H U X (0) 22 ) U H B = A H 1 X(0) 11 B 1 + A H 2 X(0) 22 B 2 = C, thus X 0 is the reflection solution with respect to generalized reflection matrix P of Eq. (1.1). The proof is completed. Similarly, according to Lemma 2.3 and formulations (2.4) (2.10), we conclude the followings. Theorem 2.2. Given A C n m, B C n l, C C m l in Problem I, P HC n n which can be expressed as (2.1). Partition U H A and U H B as (2.4) and (2.5). The GSVD of matrix pairs [A H 1,AH 2 ] and [BH 1,BH 2 ] areasin(2.6) and (2.8), respectively. The partition form of WA 1 CW H B is (2.10). Then Eq. (1.1) has a solution X Ca n n (P ), if and only if C 11 =, C 14 =, C 24 =, C 34 =, C 33 =, C 41 =, C 42 =, C 43 =, C 44 =. (2.19) In that case the general solution can be expressed as X = U X 41 X 42 X 43 V A D2A 1 C 21 D2A 1 (C 22 D 1A X 25 D 2B )D1B 1 X 53 UB T C 31 C 32 D1B 1 X 63 U A X 14 C 12 D2B 1 C 13 X 24 X 25 D 1 1A C 23 X 34 X 35 X 36 VB T U T, (2.20)
6 754 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) where X 14 C k 1 (n r+k 2 t 2 ), X 24 C (n r+k 2 t 2 ), X 34 C (r k 1 ) (n r+k 2 t 2 ), X 35 C (r k 1 ) s 2, X 36 C (r k 1 ) (t 2 k 2 s 2 ), X 41 C (n r+k 1 t 2 ) k 2, X 42 C (n r+k 1 t 1 ) s 2, X 43 C (n r+k 1 t 1 ) (r k 2 s 2 ), X 53 C (r k 2 s 2 ), X 63 C (t 1 k 1 ) (r k 2 s 2 ) and X 25 C s 2 are arbitrary matrices. 3. The solutions of Problem II In this section, we first introduce a lemma, then get the general expression of the solutions for Problem II. Finally, we deduce the minimum norm solution X with min X X subjected to A H XB = C. Lemma 3.1. Given E C m n, F C m n, D 1 = diag(λ 1, λ 2,...,λ m )>0, D 2 = diag(μ 1, μ 2,...,μ n )>0. Let h(g) = G E 2 + D 1 GD 2 F 2. Then there exists an unique matrix Ĝ C m n satisfy h(ĝ) = min G C m n h(g). Here Ĝ = Φ (E + D 1 FD 2 ), (3.1) where Φ = (φ ij ) C m n, φ ij = 1/(1 + λ 2 i μ2 j ), (i = 1, 2,...,m; j = 1, 2,...,n). Proof. Assume G = (g ij ) C m n.givene = (e ij ) C m n, F = (f ij ) C m n.wehave h(g) = n ((g ij e ij ) 2 + (λ i μ j g ij f ij ) 2 ). (3.2) i,j=1 In Eq. (3.2), h(g) is a continuously differentiable function of m n variables g ij (i = 1, 2,...,m; j = 1, 2,...,n). According to the necessary condition of function which is minimizing at a point, we obtain the following expression 1 g ij = 1 + λ 2 i μ2 j (e ij + λ i f ij μ j ). (3.3) Then, Eq. (3.1) is obtained from Eq. (3.3). The proof is completed. Theorem 3.1. Suppose that the matrices A, B and C are those given in Problem I. Assume that the solution set S re Cr n n (P ) of A H XB = C is nonempty and that X C n n is given. Let ( K U H X 11 K ) 12 r U = K21 K22 n r, (3.4) X11 X12 X 13 k 1 UA H K 11 U X21 X22 X23 B =, (3.5) X31 X32 X33 r k 1 k 2 s 2 r k 2 s 2 X44 X45 X 46 VA H K 22 V X54 X55 X 56 B = X64 X65 X66 n r + k 1 t 1 t 1 k 1 (3.6) n r+k 2 t 2 s 2 t 2 k 2 s 2
7 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) then ˆX X =min X SrE X X has an unique solution ˆX S re which can be expressed as C 11 C 12 D1B 1 X 13 U A D1A 1 C 21 ˆX 22 X 23 UB H ˆX = U X31 X32 X33 X44 X45 X46 V A X54 D2A 1 (C 22 D 1A ˆX 22 D 1B )D2B 1 D 1 X64 C 32 D2B 1 C 33 and 2A C 23 VB H ˆX 22 = Ψ (D 1A C 22 D 1B + D 2 2A X 22 D2 2B D 1AD 2A X 55 D 1BD 2B ), (3.8) where Ψ = (ψ ij ) C s 2, ψ ij = 1/(λ 2 ia λ2 jb + μ2 ia μ2 jb ), (i = 1, 2,...,; j = 1, 2,...,s 2 ). Proof. Using the invariance of the Frobenius norm under the unitary transformations, from (2.12), (3.5) and (3.6), we have that ˆX X =min X SrE X X is equivalent to ˆX 13 X13 2 = min X 13 X13 2, ˆX 31 X31 2 = min X 31 X31 2, ˆX 32 X 32 2 = min X 32 X 32 2, ˆX 23 X 23 2 = min X 23 X 23 2, ˆX 33 X 33 2 = min X 33 X 33 2, ˆX 44 X 44 2 = min X 44 X 44 2, ˆX 45 X 45 2 = min X 45 X 45 2, ˆX 46 X 46 2 = min X 46 X 46 2, ˆX 54 X54 2 = min X 54 X54 2, ˆX 64 X64 2 = min X 64 X64 2 (3.9) and h( ˆX 22 ) = min X 22 C s 2 h(x 22 ), (3.10) where h(x 22 ) = D2A 1 22 D 1A ˆX 22 D 1B )D2B ˆX 22 X22 2. From (3.9), we have ˆX 13 = X13, ˆX 31 = X31, ˆX 32 = X32, ˆX 33 = X33, ˆX 23 = X23, ˆX 44 = X44, ˆX 45 = X45, ˆX 46 = X46, ˆX 54 = X54, ˆX 64 = X64. From (3.10), we have h(x 22 ) = D2A 1 D 1A ˆX 22 D 1B D2B 1 (D 1 2A C 22D2B 1 X 55 ) 2 + ˆX 22 X22 2. (3.11) From Lemma 3.1, (3.10) and (3.11), (3.8) holds. Thus, (3.7) and (3.8) hold. When X is a zero matrix in Theorem 4, we can straightforward deduce Corollary 3.1. The expression of minimum norm solution ˆX min S re Cr n n (P ) which satisfies ˆX min = min X SrE X (A H ˆX min B = C) is C 11 C 12 D 1 1B U A D1A 1 C 21 ˆX 22 UB H ˆX min =U U H, where ˆX 22 = Ψ (D 1A C 22 D 1B ). V A D2A 1 (C 22 D 1A ˆX 22 D 1B )D2B 1 D2A 1 C 23 C 32 D 1 2B C 33 VB H U H (3.7)
8 756 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) In a similar way, we can deduce the following. Theorem 3.2. Given X C n n, let assume that the solution set S ae Ca n n (P ) of A H XB = C be nonempty. From (3.4), let X14 X15 X 16 k 1 UA T K 12 V X24 X25 X26 B = X34 X35 X36, (3.12) t 2 k 1 n r + k 2 t 2 s 2 t k 2 s 2 X41 X42 X 43 VA H K 22 U X51 X52 X 53 B = X61 X62 X63 k 2 s 2 r k 2 s 2 n r + k 1 t 1 t 1 k 1 (3.13) then X X =min has an unique solution ˆX S ae which can be expressed as X14 C 12 D2B 1 C 13 U A X 24 ˆX 25 D 1 ˆX A =U X34 X35 X36 X41 X42 X 43 V A D2A 1 C 21 D2A 1 (C 22 D 1A ˆX 25 D 12B )D1B 1 X53 U H C 31 C 32 D1B 1 X63 B 1A C 23 VB H U H (3.14) where ˆX 25 =Ω (D 1A C 22 D 2B +D2A 2 X 25 D2 1B D 1AD 2A X52 D 1BD 2B ), Ω=(ω ij ) R s 2, ω ij =1/(λ 2 ia μ2 jb +μ2 ia λ2 jb ), λ 2 ia + μ2 ia = 1, λ2 jb + μ2 jb = 1, (i = 1, 2,...,; j = 1, 2,...,s 2 ). If X is a zero matrix in Theorem 3.2, we can straightforward obtain the following. Corollary 3.2. The expression of minimum norm solution ˆX min S ae Ca n n (P ) which satisfies ˆX min = min X SaE X (A H ˆX min B = C) is ˆX A min =U V A D2A 1 22 D 1A ˆX 25 D 2B )D1B 1 UB H C 32 D1B 1 D 1 2A C 21 C 31 U A C 12 D2B 1 C 13 ˆX 25 D1A 1 C 23 VB H where ˆX 25 = Ω (D 1A C 22 D 2B ), Ω = (ω ij ) R s 2, ω ij = 1/(λ 2 ia μ2 jb + μ2 ia λ2 jb ), λ2 ia + μ2 ia = 1, λ2 jb + μ2 jb = 1, (i = 1, 2,..., ; j = 1, 2,...,s 2 ). Based on Theorems 3.1 and 3.2, we propose the following algorithm for solving Problem II over sets S re or S ae. Algorithm. 1. Input X C n n and a generalized reflection matrix P of size n. 2. Compute r and U by (2.1). 3. Compute A 1, A 2, B 1 and B 2 by (2.4) and (2.5). 4. Compute W A, Σ 1A, Σ 2A, U A and V A by (2.6). 5. Compute W B, Σ 1B, Σ 2B, U B and V B by (2.8). 6. Compute Xij (i, j = 1, 2,...,6) by (3.4), (3.5), (3.6), (3.12), and (3.13). U H
9 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) Compute partition matrix (C ij ) 4 4 by (2.10). 8. If C i4 = 0 (i = 1, 2, 3, 4) and C 4j = 0 (j = 1, 2, 3) and C 13 = 0 and C 31 = 0 then go to step 9, else go to step Compute ˆX S re by (3.7) and ˆX min S re by Corollary Go to step If C i4 = 0(i = 1, 2, 3, 4) and C 4j = 0(j = 1, 2, 3) and C 11 = 0 and C 33 = 0 then go to step 12, else go to step Compute ˆX A S ae by (3.14) and ˆX A min S ae by Corollary Stop. 4. Numerical experiments In this section, we will give a numerical example to illustrate our results. All the tests are performed by MATLAB6.5. Example. The matrices P, A, B and X are given by following P =, A =, B = ,
10 758 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) X = If C = then partition matrix satisfies (2.11). Thus reflexive solution set S re of Eq. (1.1) is nonempty. The optimal approximation reflexive solution ˆX to X in reflexive solution set S re is ˆX=
11 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) and ˆX X = The minimum norm reflexive solution is ˆX min = and ˆX min = If C = pt then partition matrix satisfies (2.19). Thus anti-reflexive solution set S ae of Eq. (1.1) is nonempty. The optimal approximation anti-reflexive solution ˆX A to X in anti-reflexive solution set S ae is ˆX A =
12 760 X.-y. Peng et al. / Journal of Computational and Applied Mathematics 200 (2007) and ˆX A X = The minimum norm anti-reflexive solution is ˆX A,min = and ˆX A,min = Conclusions In this paper, we obtained the equation s solution sets of reflexive and anti-reflexive matrices with respect to a given generalized reflection matrix P. We also obtained, in corresponding solution set, the nearest solution to a given matrix in Frobenius norm. The solvability conditions and the explicit formula for the solution are given. Given matrix, we have obtained some of the nearest matrices to the matrix and minimum norm matrices in the given solution set by computing. References [1] J.L. Chen, X.H. Chen, Special Matrices, Qinghua University Press, Beijing, China, 2001 (in Chinese). [2] H.C. Chen, Generalized reflexive matrices special properties and applications, SIAM J. Matrix Anal. Appl. 19 (1998) [3] H.C. Chen, The SAS Domain Decomposition Method for StructuralAnalysis, CSRD Technical Report 754, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, [4] H.C. Chen, A. Sameh, Numerical linear algebra algorithms on the coder system, in: A.K. Noor (Ed.), Parallel Computations and Their Impact on Mechanics, AMD-vol. 86, The American Society of Mechanical Engineers, 1987, pp [5] K.W.E. Chu, Symmetric solutions of linear matrix equation by matrix decompositions, Linear Algebra Appl. 119 (1989) [6] K.W.E. Chu, Singular value and generalized singular value decompositions and the solution of linear matrix equations, Linear Algebra Appl. 88 (1987) [7] H. Dai, n the symmetric solutions of linear matrix equations, Linear Algebra Appl. 131 (1990) 1 7. [8] H. Dai, Linear matrix equations from an inverse problem of vibration theory, Linear Algebra Appl. 246 (1996) [9] F.J.H. Don, n the symmetric solutions of a linear matrix equation, Linear Algebra Appl. 93 (1987) 1 7. [10] C.N. He, Positive and symmetric solutions of linear matrix equation, Hunan Mathematic Annual. 2 (1996) (in Chinese). [11] C.C. Paige, M.A. Saunders, Towards a generalized singular value decomposition, SIAM J. Numer. Anal. 18 (1981) [12] Z.Y. Peng, Central symmetric solutions and the optimal approximation of equation A T XA = B, J. Changsha Electric Power College 2 (2002) 3 6 (in Chinese). [13] Z.Y. Peng, X.Y. Hu, The reflexive and anti-reflexive solutions of the matrix equation AX = B, Linear Algebra Appl. 375 (2003) [14] Y.X. Peng, X.Y. Hu, L. Zhang, Symmetric ortho-symmetric solutions and the optimal approximation of equation A T XA = B, Numer. Math. J. Chinese Univ. 4 (2003) (in Chinese). [15] L. Wu, The re-positive definite solutions to the matrix inverse problem AX = B, Linear Algebra Appl. 174 (1992)
The Skew-Symmetric Ortho-Symmetric Solutions of the Matrix Equations A XA = D
International Journal of Algebra, Vol. 5, 2011, no. 30, 1489-1504 The Skew-Symmetric Ortho-Symmetric Solutions of the Matrix Equations A XA = D D. Krishnaswamy Department of Mathematics Annamalai University
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 informationTHE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1) 1. Introduction
Journal of Computational Mathematics, Vol22, No4, 2004, 535 544 THE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1 Zhen-yun Peng Department of Mathematics, Hunan University of
More informationThe skew-symmetric orthogonal solutions of the matrix equation AX = B
Linear Algebra and its Applications 402 (2005) 303 318 www.elsevier.com/locate/laa The skew-symmetric orthogonal solutions of the matrix equation AX = B Chunjun Meng, Xiyan Hu, Lei Zhang College of Mathematics
More informationAn iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB =C
Journal of Computational and Applied Mathematics 1 008) 31 44 www.elsevier.com/locate/cam An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation
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 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 informationAN INVERSE EIGENVALUE PROBLEM AND AN ASSOCIATED APPROXIMATION PROBLEM FOR GENERALIZED K-CENTROHERMITIAN MATRICES
AN INVERSE EIGENVALUE PROBLEM AND AN ASSOCIATED APPROXIMATION PROBLEM FOR GENERALIZED K-CENTROHERMITIAN MATRICES ZHONGYUN LIU AND HEIKE FAßBENDER Abstract: A partially described inverse eigenvalue problem
More informationImproved Newton s method with exact line searches to solve quadratic matrix equation
Journal of Computational and Applied Mathematics 222 (2008) 645 654 wwwelseviercom/locate/cam Improved Newton s method with exact line searches to solve quadratic matrix equation Jian-hui Long, Xi-yan
More 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 informationJournal of Computational and Applied Mathematics. New matrix iterative methods for constraint solutions of the matrix
Journal of Computational and Applied Mathematics 35 (010 76 735 Contents lists aailable at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elseier.com/locate/cam New
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 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 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 informationResearch Article On the Hermitian R-Conjugate Solution of a System of Matrix Equations
Applied Mathematics Volume 01, Article ID 398085, 14 pages doi:10.1155/01/398085 Research Article On the Hermitian R-Conjugate Solution of a System of Matrix Equations Chang-Zhou Dong, 1 Qing-Wen Wang,
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 informationNonsingularity and group invertibility of linear combinations of two k-potent matrices
Nonsingularity and group invertibility of linear combinations of two k-potent matrices Julio Benítez a Xiaoji Liu b Tongping Zhu c a Departamento de Matemática Aplicada, Instituto de Matemática Multidisciplinar,
More informationInverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with J-(Skew) Centrosymmetry
Inverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with -(Skew) Centrosymmetry Zhong-Yun Liu 1 You-Cai Duan 1 Yun-Feng Lai 1 Yu-Lin Zhang 1 School of Math., Changsha University
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 informationDiagonal and Monomial Solutions of the Matrix Equation AXB = C
Iranian Journal of Mathematical Sciences and Informatics Vol. 9, No. 1 (2014), pp 31-42 Diagonal and Monomial Solutions of the Matrix Equation AXB = C Massoud Aman Department of Mathematics, Faculty 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 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 informationYimin Wei a,b,,1, Xiezhang Li c,2, Fanbin Bu d, Fuzhen Zhang e. Abstract
Linear Algebra and its Applications 49 (006) 765 77 wwwelseviercom/locate/laa Relative perturbation bounds for the eigenvalues of diagonalizable and singular matrices Application of perturbation theory
More 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 informationAN ITERATIVE METHOD FOR THE GENERALIZED CENTRO-SYMMETRIC SOLUTION OF A LINEAR MATRIX EQUATION AXB + CY D = E. Ying-chun LI and Zhi-hong LIU
Acta Universitatis Apulensis ISSN: 158-539 No. 9/01 pp. 335-346 AN ITERATIVE METHOD FOR THE GENERALIZED CENTRO-SYMMETRIC SOLUTION OF A LINEAR MATRIX EQUATION AXB + CY D = E Ying-chun LI and Zhi-hong LIU
More informationof a Two-Operator Product 1
Applied Mathematical Sciences, Vol. 7, 2013, no. 130, 6465-6474 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.39501 Reverse Order Law for {1, 3}-Inverse of a Two-Operator Product 1 XUE
More informationBOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 4, P AGES 655 664 BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION Guang-Da Hu and Qiao Zhu This paper is concerned with bounds of eigenvalues of a complex
More 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 informationOptimization 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 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 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 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 informationResearch Article Finite Iterative Algorithm for Solving a Complex of Conjugate and Transpose Matrix Equation
indawi Publishing Corporation Discrete Mathematics Volume 013, Article ID 17063, 13 pages http://dx.doi.org/10.1155/013/17063 Research Article Finite Iterative Algorithm for Solving a Complex of Conjugate
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 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 informationResearch Article Constrained Solutions of a System of Matrix Equations
Journal of Applied Mathematics Volume 2012, Article ID 471573, 19 pages doi:10.1155/2012/471573 Research Article Constrained Solutions of a System of Matrix Equations Qing-Wen Wang 1 and Juan Yu 1, 2 1
More 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 informationGroup inverse for the block matrix with two identical subblocks over skew fields
Electronic Journal of Linear Algebra Volume 21 Volume 21 2010 Article 7 2010 Group inverse for the block matrix with two identical subblocks over skew fields Jiemei Zhao Changjiang Bu Follow this and additional
More informationA Note on Simple Nonzero Finite Generalized Singular Values
A Note on Simple Nonzero Finite Generalized Singular Values Wei Ma Zheng-Jian Bai December 21 212 Abstract In this paper we study the sensitivity and second order perturbation expansions of simple nonzero
More informationOn the Eigenstructure of Hermitian Toeplitz Matrices with Prescribed Eigenpairs
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp 298 305 On the Eigenstructure of Hermitian
More informationOn the eigenvalues of specially low-rank perturbed matrices
On the eigenvalues of specially low-rank perturbed matrices Yunkai Zhou April 12, 2011 Abstract We study the eigenvalues of a matrix A perturbed by a few special low-rank matrices. The perturbation is
More informationAN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS
AN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS DAVOD KHOJASTEH SALKUYEH and FATEMEH PANJEH ALI BEIK Communicated by the former editorial board Let A : R m n R m n be a symmetric
More information76. LIO ND Z. I vector x 2 R n by a quasi-newton-type algorithm. llwright, Woodgate[2,3] and Liao[4] gave some necessary and sufficient conditions for
Journal of Computational Mathematics, Vol.2, No.2, 23, 75 82. LEST-SQURES SOLUTION OF X = D OVER SYMMETRIC POSITIVE SEMIDEFINITE MTRICES X Λ) nping Liao (Department of Mathematics, Hunan Normal University,
More informationThe Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment
he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State
More informationDisplacement rank of the Drazin inverse
Available online at www.sciencedirect.com Journal of Computational and Applied Mathematics 167 (2004) 147 161 www.elsevier.com/locate/cam Displacement rank of the Drazin inverse Huaian Diao a, Yimin Wei
More informationPreliminary Linear Algebra 1. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 100
Preliminary Linear Algebra 1 Copyright c 2012 Dan Nettleton (Iowa State University) Statistics 611 1 / 100 Notation for all there exists such that therefore because end of proof (QED) Copyright c 2012
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 Residual Spectrum and the Continuous Spectrum of Upper Triangular Operator Matrices
Filomat 28:1 (2014, 65 71 DOI 10.2298/FIL1401065H Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat The Residual Spectrum and the
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationA CHARACTERIZATION OF THE OPERATOR-VALUED TRIANGLE EQUALITY
J. OPERATOR THEORY 58:2(2007), 463 468 Copyright by THETA, 2007 A CHARACTERIZATION OF THE OPERATOR-VALUED TRIANGLE EQUALITY TSUYOSHI ANDO and TOMOHIRO HAYASHI Communicated by William B. Arveson ABSTRACT.
More informationSEMI-CONVERGENCE ANALYSIS OF THE INEXACT UZAWA METHOD FOR SINGULAR SADDLE POINT PROBLEMS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 53, No. 1, 2012, 61 70 SEMI-CONVERGENCE ANALYSIS OF THE INEXACT UZAWA METHOD FOR SINGULAR SADDLE POINT PROBLEMS JIAN-LEI LI AND TING-ZHU HUANG Abstract. Recently,
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2017) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal
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 informationPRODUCT OF OPERATORS AND NUMERICAL RANGE
PRODUCT OF OPERATORS AND NUMERICAL RANGE MAO-TING CHIEN 1, HWA-LONG GAU 2, CHI-KWONG LI 3, MING-CHENG TSAI 4, KUO-ZHONG WANG 5 Abstract. We show that a bounded linear operator A B(H) is a multiple of a
More informationON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS
ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS Fatemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan,
More informationMATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006
MATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006 Sherod Eubanks HOMEWORK 2 2.1 : 2, 5, 9, 12 2.3 : 3, 6 2.4 : 2, 4, 5, 9, 11 Section 2.1: Unitary Matrices Problem 2 If λ σ(u) and U M n is unitary, show that
More informationAbstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization relations.
HIROSHIMA S THEOREM AND MATRIX NORM INEQUALITIES MINGHUA LIN AND HENRY WOLKOWICZ Abstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization
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 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 Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationA property concerning the Hadamard powers of inverse M-matrices
Linear Algebra and its Applications 381 (2004 53 60 www.elsevier.com/locate/laa A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University,
More informationINVESTIGATING THE NUMERICAL RANGE AND Q-NUMERICAL RANGE OF NON SQUARE MATRICES. Aikaterini Aretaki, John Maroulas
Opuscula Mathematica Vol. 31 No. 3 2011 http://dx.doi.org/10.7494/opmath.2011.31.3.303 INVESTIGATING THE NUMERICAL RANGE AND Q-NUMERICAL RANGE OF NON SQUARE MATRICES Aikaterini Aretaki, John Maroulas Abstract.
More informationEstimation of the Response Mean. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 27
Estimation of the Response Mean Copyright c 202 Dan Nettleton (Iowa State University) Statistics 5 / 27 The Gauss-Markov Linear Model y = Xβ + ɛ y is an n random vector of responses. X is an n p matrix
More informationThe semi-convergence of GSI method for singular saddle point problems
Bull. Math. Soc. Sci. Math. Roumanie Tome 57(05 No., 04, 93 00 The semi-convergence of GSI method for singular saddle point problems by Shu-Xin Miao Abstract Recently, Miao Wang considered the GSI method
More informationSection 3.3. Matrix Rank and the Inverse of a Full Rank Matrix
3.3. Matrix Rank and the Inverse of a Full Rank Matrix 1 Section 3.3. Matrix Rank and the Inverse of a Full Rank Matrix Note. The lengthy section (21 pages in the text) gives a thorough study of the rank
More informationSome inequalities for unitarily invariant norms of matrices
Wang et al Journal of Inequalities and Applications 011, 011:10 http://wwwjournalofinequalitiesandapplicationscom/content/011/1/10 RESEARCH Open Access Some inequalities for unitarily invariant norms of
More informationj=1 [We will show that the triangle inequality holds for each p-norm in Chapter 3 Section 6.] The 1-norm is A F = tr(a H A).
Math 344 Lecture #19 3.5 Normed Linear Spaces Definition 3.5.1. A seminorm on a vector space V over F is a map : V R that for all x, y V and for all α F satisfies (i) x 0 (positivity), (ii) αx = α x (scale
More informationarxiv: v3 [math.ra] 22 Aug 2014
arxiv:1407.0331v3 [math.ra] 22 Aug 2014 Positivity of Partitioned Hermitian Matrices with Unitarily Invariant Norms Abstract Chi-Kwong Li a, Fuzhen Zhang b a Department of Mathematics, College of William
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 informationMeans of unitaries, conjugations, and the Friedrichs operator
J. Math. Anal. Appl. 335 (2007) 941 947 www.elsevier.com/locate/jmaa Means of unitaries, conjugations, and the Friedrichs operator Stephan Ramon Garcia Department of Mathematics, Pomona College, Claremont,
More information4.6. Linear Operators on Hilbert Spaces
4.6. Linear Operators on Hilbert Spaces 1 4.6. Linear Operators on Hilbert Spaces Note. This section explores a number of different kinds of bounded linear transformations (or, equivalently, operators
More informationarxiv: v1 [math.na] 13 Mar 2019
Relation between the T-congruence Sylvester equation and the generalized Sylvester equation Yuki Satake, Masaya Oozawa, Tomohiro Sogabe Yuto Miyatake, Tomoya Kemmochi, Shao-Liang Zhang arxiv:1903.05360v1
More informationarxiv: v1 [math.fa] 1 Oct 2015
SOME RESULTS ON SINGULAR VALUE INEQUALITIES OF COMPACT OPERATORS IN HILBERT SPACE arxiv:1510.00114v1 math.fa 1 Oct 2015 A. TAGHAVI, V. DARVISH, H. M. NAZARI, S. S. DRAGOMIR Abstract. We prove several singular
More informationThe Symmetric and Antipersymmetric Solutions of the Matrix Equation A 1 X 1 B 1 + A 2 X 2 B A l X l B l = C and Its Optimal Approximation
The Symmetric Antipersymmetric Soutions of the Matrix Equation A 1 X 1 B 1 + A 2 X 2 B 2 + + A X B C Its Optima Approximation Ying Zhang Member IAENG Abstract A matrix A (a ij) R n n is said to be symmetric
More informationELA ON THE GROUP INVERSE OF LINEAR COMBINATIONS OF TWO GROUP INVERTIBLE MATRICES
ON THE GROUP INVERSE OF LINEAR COMBINATIONS OF TWO GROUP INVERTIBLE MATRICES XIAOJI LIU, LINGLING WU, AND JULIO BENíTEZ Abstract. In this paper, some formulas are found for the group inverse of ap +bq,
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationApplied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University
Applied Matrix Algebra Lecture Notes Section 22 Gerald Höhn Department of Mathematics, Kansas State University September, 216 Chapter 2 Matrices 22 Inverses Let (S) a 11 x 1 + a 12 x 2 + +a 1n x n = b
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 informationAnalytical formulas for calculating the extremal ranks and inertias of A + BXB when X is a fixed-rank Hermitian matrix
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 100081, China
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationPermutation transformations of tensors with an application
DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn
More informationAn inverse eigenproblem for generalized reflexive matrices with normal $k+1$-potencies
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 9 2016 An inverse eigenproblem for generalized reflexive matrices with normal $k+1$-potencies Wei-Ru Xu East China Normal University,
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 informationOn generalized Schur complement of nonstrictly diagonally dominant matrices and general H- matrices
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 57 2012 On generalized Schur complement of nonstrictly diagonally dominant matrices and general H- matrices Cheng-Yi Zhang zhangchengyi2004@163.com
More informationAn Iterative Method for the Least-Squares Minimum-Norm Symmetric Solution
Copyright 2011 Tech Science Press CMES, vol.77, no.3, pp.173-182, 2011 An Iterative Method for the Least-Squares Minimum-Norm Symmetric Solution Minghui Wang 1, Musheng Wei 2 and Shanrui Hu 1 Abstract:
More informationISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION
ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION Harald K. Wimmer 1 The set of all negative-semidefinite solutions of the CARE A X + XA + XBB X C C = 0 is homeomorphic
More informationOn Solving Large Algebraic. Riccati Matrix Equations
International Mathematical Forum, 5, 2010, no. 33, 1637-1644 On Solving Large Algebraic Riccati Matrix Equations Amer Kaabi Department of Basic Science Khoramshahr Marine Science and Technology University
More informationMath Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p
Math Bootcamp 2012 1 Review of matrix algebra 1.1 Vectors and rules of operations An p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the
More informationWeak Monotonicity of Interval Matrices
Electronic Journal of Linear Algebra Volume 25 Volume 25 (2012) Article 9 2012 Weak Monotonicity of Interval Matrices Agarwal N. Sushama K. Premakumari K. C. Sivakumar kcskumar@iitm.ac.in Follow this and
More informationMinkowski Inverse for the Range Symmetric Block Matrix with Two Identical Sub-blocks Over Skew Fields in Minkowski Space M
International Journal of Mathematics And its Applications Volume 4, Issue 4 (2016), 67 80. ISSN: 2347-1557 Available Online: http://ijmaa.in/ International Journal 2347-1557 of Mathematics Applications
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationApplied Mathematics Letters. A reproducing kernel method for solving nonlocal fractional boundary value problems
Applied Mathematics Letters 25 (2012) 818 823 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml A reproducing kernel method for
More informationSOME INEQUALITIES FOR THE KHATRI-RAO PRODUCT OF MATRICES
SOME INEQUALITIES FOR THE KHATRI-RAO PRODUCT OF MATRICES CHONG-GUANG CAO, XIAN ZHANG, AND ZHONG-PENG YANG Abstract. Several inequalities for the Khatri-Rao product of complex positive definite Hermitian
More informationEXPLICIT SOLUTION TO MODULAR OPERATOR EQUATION T XS SX T = A
EXPLICIT SOLUTION TO MODULAR OPERATOR EQUATION T XS SX T A M MOHAMMADZADEH KARIZAKI M HASSANI AND SS DRAGOMIR Abstract In this paper by using some block operator matrix techniques we find explicit solution
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More 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 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 information2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian
FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian
More information