The Skew-Symmetric Ortho-Symmetric Solutions of the Matrix Equations A XA = D
|
|
- Helen Quinn
- 5 years ago
- Views:
Transcription
1 International Journal of Algebra, Vol. 5, 2011, no. 30, The Skew-Symmetric Ortho-Symmetric Solutions of the Matrix Equations A XA = D D. Krishnaswamy Department of Mathematics Annamalai University Annamalainagar India krishna swamy2004@yahoo.co.in G. Punithavalli Mathematics Wing Annamalai University Annamalainagar India Punithavarman@gmail.com Abstract In this paper, the following problems are discussed. Problem 1. Given matrices A C n m and D C m m,find X SSCp n such that A XA = D, where SSCp n = {X SSC n n /P X SC n n for given P OC n n satisfying P = P }. Problem 2. Given a matrix X C n n, find ˆX S E such that X X = inf X X, X S E where. is the robenius norm, and S E is the solution set of problem 1. Expressions for the general solution of problem 1 are derived. Necessary and sufficient conditions for the solvability of Problem 1 are determined. or problem 2, an expression for the solution is given. Mathematics Subject Classifications: 15A57, 6510, 6520 Keywords: Skew-symmetric ortho-symmetric matrix, Matrix Equation, Matrix nearness problem, Optimal approximation, Least-square solutions
2 1490 D. Krishnaswamy and G. Punithavalli 1 Introduction Let C n m denote the set of all n mcomplex matrices, and let OC n n,sc n n, SSC n n denote the set of alln northogonal matrices, the set of alln ncomplex symmetric matrices, the set of all n ncomplex skew-symmetric matrices, respectively. The symbol I K will stand for the identity matrix of order K,A for the Moore-penrose generalized inverse of a matrix A, and rk(a for the rank of matrix A. or matrices A, B C n m, the expression A B will be the Hadamard product of A and B; also. will denote the robenius norm. Defining the inner product (A, B=tr(B A for matrices A, B C n m, C n m becomes a Hilbert space. The norm of a matrix generated by this inner product is the robenius norm. If A =(a ij C n n, let L A =(l ij C n n be defined as follows: l ij = a ij whenever i>jand l ij = 0 otherwise (i, j =1.2..., n. Let e i be the i-th column of the identity matrix I n (i =1, 2,..., n and set S n =(e n,e n 1,..., e 1. It is easy to see that S n = S n, S ns n = I n. An inverse problem [2]-[6] arising in the structural modification of the dynamic behaviour of a structure calls for the solution of the matrix equation A XA = D, (1.1 where A C n m, D C m m, and the unknown X is required to be complex and symmetric, and positive semidefinite or possibly definite. No assumption is made about the relative sizes of m and n, and it is assumed throught that A 0 and D 0. Equation (1.1 is a special case of the matrix equation AXB = C. (1.2. Consistency conditions for equation (1.2 were given by Penrose[7] (see also [1]. When the equation is consistent, a solution can be obtained using generalized inverses. Khatri and Mitra [8] gave necessary and sufficient conditions for the existence of symmetric and positive semidefinite solutions as well as explicit formulae using generalized inverses. In [9],[10] solvability conditions for symmetric and positive definite solutions and general solutions of Equation (1.2 were obtained through the use of generalized singular value decomposition [11]-[13]. or important results on the inverse problem A XA = D associated with several kinds of different sets S, for instance, symmetric matrices, symmetric nonnegative definite matrices, bisymmetric (same as persymmetric matrices, bisymmetric nonnegative definite matrices and so on, We refer the reader to [14]-[17]. or the case the unknown A is skew-symmetric ortho-symmetric,[18] has discussed the
3 Skew-symmetric ortho-symmetric solutions 1491 inverse problem AX = B. However, for this case, the inverse problem A XA = D has not been dealt with yet. This problem will be considered here. Definition 1.1 A matrix P C n n is said to be a symmetric orthogonal matrix if P = P, P P = I n. In this paper, without special statement, we assume that P is a given symmetric orthogonal matrix. Definition 1.2 A Matrix X C n n is said to be a skew-symmetric ortho-symmetric matrix if X = X, (PX = PX. We denote the set of all n n skew-symmetric ortho-symmetric matrices by SSCp n. The problem studied in this paper can now be described as follows. Problem 1. Given matrices A C n m and D C m m, find a skew-symmetric orthosymmetric matrix X such that A XA = D. In this paper, we discuss the solvability of this problem and an expression for its solution is presented. The Optimal approximation problem of a matrix with the above-given matrix restriction comes up in the processes of test or recovery of a linear system due to incomplete data or revising given data. A preliminary estimate X of the unknown matrix X can be obtained by the experimental observation values and the information of statistical distribution. The optimal estimate of X is a matrix ˆX that satisfies the given matrix restriction for Xand is the best approximation of X, see [19]-[21]. In this paper, we will also considered the so-called optimal approximation problem associated with A XA = D. It reads as follows. Problem 2. Given matrix X C n n, find ˆX S E such that X X = inf X X, X S E where S E is the solution set of Problem 1. We point out that if Problem 1 is solvable, then Problem 2 has a unique solution, and in this case an expression for the solution can be derived. The paper is organized as follows. In section 2, we obtain the general form of S E and the sufficient and necessary conditions under which problem 1 is solvable mainly by using the structure of SSCp n and orthogonal projection matrices. In section 3, the expression for the solution of the matrix nearness problem 2 will be determined.
4 1492 D. Krishnaswamy and G. Punithavalli 2 The expression of the general solution of problem 1 In this section we first discuss some structure properties of symmetric orthogonal matrices. Then given such a matrix P, we consider structural properties of the subset SSC n p of Cn n. inally we present necessary and sufficient conditions for the existence of and the expressions for the skew-symmetric ortho-symmetric ( with respect to the given P solutions of problem 1. Lemma 2.1. Assume P is a symmetric orthogonal matrix of size n, and let P 1 = 1 2 (I n + P, P 2 = 1 2 (I n P. (2.1 Then P 1 and P 2 are orthogonal projection matrices satisfying P 1 + P 2 = I n,p 1 P 2 =0. Proof. Since P 1 = 1 2 (I n + P,P 2 = 1 2 (I n P. Then P 1 + P 2 = 1 2 (I n + P (I n P = 1 2 (I n + P + I n P = 1 2 (2I n=i n. P 1 P 2 = 1 2 (I n + P. 1 2 (I n P = 1 4 (I n P + P P 2 = 1 4 (I n P 2 = 1 4 (I n P.P = 1 4 (I n I n =0. Lemma 2.2. Assume P 1 and P 2 are defined as (2.1 and rank (P 1 =r. Then rank(p 2 = n r, and there exists unit column orthogonal matrices U 1 C n r and U 2 C n (n r such that P 1 = U 1 U 1,P 2 = U 2 U 2, and U 1 U 2 =0then P = U 1 U 1 U 2U 2. Proof. Since P 1 and P 2 are orthogonal projection matrices satisfying P 1 + P 2 = I n and P 1 P 2 =0, the column space R(P 2 of the matrix P 2 is the orthogonal complement of the column space R(P 1 of the matrix P 1, in other words, R n = R(P 1 R(P 2. Hence, if rank (P 1 =r, then rank (P 2 =n r. On the other hand, rank (P 1 =r, rank(p 2 =n r, and P 1,P 2 are orthogonal projection matrices. Thus there exists unit column orthogonal matrices U 1 C n r and U 2 C n (n r such that P 1 = U 1 U 1,P 2 = U 2 U 2. Using R n = R(P 1 R(P 2, we have U 1 U 2 =0. Substituting P 1 = U 1 U 1,P 2 = U 2 U 2, into (2.1, we have P = U 1 U 1 U 2 U 2.
5 Skew-symmetric ortho-symmetric solutions 1493 Elaborating on Lemma 2.2 and its proof, we note that U =(U 1,U 2 is an orthogonal matrix and that the symmetric orthogonal matrix P can be expressed as P = U ( I r 0 0 I n r U. (2.2 Lemma 2.3. The matrix X SSC n P if and only if X can be expressed as X = U ( 0 0 where C r (n r and U is the same as (2.2. U, (2.3 proof Assume X SSCP n. By lemma 2.2 and the definition of SSCn P, We choose p 1 = I+p,P 2 2 = I P 2 P 1 XP 1 = I + P 2 X I + P 2 = 1 (X + PX + XP + PXP 4 = 1 4 (U ( 0 0 U + PX + XP + U ( I r 0 0 I n r U U ( 0 0 U U ( I r 0 0 I n r U. = 1 4 (U ( 0 0 U + PX + XP + U ( I r ( 0 0 ( Ir 0 0 I n r 0 0 I n r U. = 1 4 (U ( 0 0 U + PX + XP + U ( 0 0 ( I r 0 0 I n r U. = 1 4 (U ( 0 0 U + PX + XP + U ( 0 0 U. P 1 XP 1 = 1 (XP + PX. 4 Similarly Hence, P 2 XP 2 = 1 (XP + PX. 4 X =(P 1 + P 2 X(P 1 + P 2 =P 1 XP 1 + P 1 XP 2 + P 2 XP 1 + P 2 XP 2
6 1494 D. Krishnaswamy and G. Punithavalli X = P 1 XP 2 + P 2 XP 1 (sincep 1 XP 1 + P 2 XP 2 =0. X = P 1 XP 2 + P 2 XP 1 = U 1 U 1 XU 2U 2 + U 2U 2 XU 1U 1 (sincep 1 = U 1 U 1 andp 2 = U 2 U 2 Let = U 1 XU 2 and G = U 2 XU 1. It is easy to verify that = G. = U 1 U 2 + U 2 GU 1 (since = U 1 XU 2, =(U 1 XU 2 = U 2 X U 1 = U X 2 U 1 = G Then we have X = U 1 U 2 + U 2GU 1 = U ( 0 G 0 U Conversely, for any C r (n r, Let It is easy to verify that X = X X = U ( 0 X = U ( U U X = U 1 U 2 + U 2GU 1, X =(U 1 U 2 +(U 2 GU 1 = U 2 U 1 + U 1G U 2 using (2.2, we have Thus = U 2 GU 1 U 1 U 2 = (U 1 U 2 + U 2 GU 1 = X. PXP = PU ( 0 0 U P = U ( I r 0 0 I n r U U ( 0 0 U U ( I r 0 0 I n r U = U ( I r ( 0 0 ( Ir 0 0 I n r 0 0 I n r U = U( 0 Ir 0 0 ( 0 I n r U = U( 0 0 U = X X = U ( 0 0 U SSC n P.
7 Skew-symmetric ortho-symmetric solutions 1495 Lemma 2.4. Let A C n n,d SSC n n and assume A A = D. Then there is precisely one G SC n n such that A = L D + G, and G = 1 2 (A + A 1 2 (L D + L D. Proof.or given A C n n,d SSC n n and A A = D. It is easy to verify that there exists unique and we have G = 1 2 (A + A 1 2 (L D + L D SCn n, A = 1 2 (A A (A + A = 1 2 (L D L D +1 2 (A + A A = 1 2 (A + A +L D 1 2 (L D + L D (sincel D = 1 2 (L D + L D +1 2 (L D L D A = L D + G. Let A C n m and D C m m,udefined in (2.2, Set U A = ( A 1 A 2,A1 C r m,a 2 C (n r m. (2.4 The generalized singular value decomposition (see [11],[12],[13] of the matrix pair [A 1,A 2 ] is A 1 = M A 1 W,A 2 = M A 2 V, (2.5 where W C m m is a nonsingular matrix, W OC r r,v OC (n r (n r and A1 = I k S 1... O O 1 k s t k s m t (2.6
8 1496 D. Krishnaswamy and G. Punithavalli A2 = O 2 S 2... O I t k s k s t k s m t (2.7 where t = rank(a 1,A 2,K = t rank(a 2, S = rank(a 1 +rank(a 2 t S 1 = diag(α 1,..., α s,s 2 = diag(β 1,..., β s, with 1 >α 1... α s > 0, 0 <β 1... β s < 1, and αi 2 + βi 2 =1,i=1,..., s. 0, 0 1 and 0 2 are corresponding zero submatrices. Theorem 2.5.Given A C n m and D C m m,u defined in (2.2, and U A has the partition form of (2.4, the generalized singular value decomposition of the matrix pair [A 1,A 2 ] as (2.5. Partition the matrix M 1 DM as D 11 D 12 D 13 D 14 k D 21 D 22 D 23 D 24 s M 1 DM = D 31 D 32 D 33 D 34 t k s D 41 D 42 D 43 D 44 m t k s t k s m t
9 Skew-symmetric ortho-symmetric solutions 1497 then the problem 1 has a solution X SSCP n if and only if D = D, D 11 =0, D 33 =0, D 41 =0, D 42 =0, D 43 =0, D 44 =0. In that case it has the general solution X = U ( 0 0 U, (2.9 where X 11 D 12 S2 1 D 13 = W X 21 S1 1 (L D22 + GS2 1 S 1 X 31 X 32 X 33 1 D 23 V, (2.10 with X 11 C r (n r+k t,x 21 C s (n r+k t,x 31 C (r k s (n r+k t,x 32 C (r k s s, X 33 C (r k s (t k s and G SC s s are arbitrary matrices. Proof. The Necessity : Assume the equation (1.1 has a solution X SSCP n. By the definition of SSCn P, it is easy to verify that D = D. Since D = A A D =(A A = A + A = (A A = D, and we have from lemma 2.3 that X can be expressed as X = U ( 0 0 U, (2.11 where C r (n r. Note that U is an orthogonal matrix, and the definition of A i (i =1, 2, Equation(1.1 is equivalent to A 1 A 2 A 2 A 1 = D. (2.12 Substituting (2.5 in (2.12, then we have M A 1 W A 2 M A 2 V A 1 = D M A 1 W V A 2 M M A 2 V A 1 = D M A 1 W V A 2 M M A 2 V W A 1 M = D M 1 M A 1 W V A 2 M M M 1 M A 2 V W A 1 M M = M 1 DM A 1 (W V A 2 A 2 (V W A 1 = M 1 DM A 1 (W V A 2 A 2 (W V A 1 = M 1 DM, (2.13
10 1498 D. Krishnaswamy and G. Punithavalli partition the matrix W V as X 11 X 12 X 13 W V = X 21 X 22 X 23, (2.14 X 31 X 32 X 33 where X 11 C r (n r+k t,x 22 C s s,x 33 C (r k s (t k s. Taking W V and M 1 DM, in (2.13, We have 0 X 12 S 2 X 13 0 D 11 D 12 D 13 D 14 S 2 X21 S 1 X 22 S 2 (S 1 X 22 S 2 S 1 X 23 0 D 21 D 22 D 23 D 24 = X 13 X 23 S D 31 D 32 D 33 D D 41 D 42 D 43 D 44 (2.15 Therefore (2.15holds if and only if (2.8 holds and and X 12 = D 12 S 1 2,X 13 = D 13,X 23 = S 1 1 D 23 S 1 X 22 S 2 (S 1 X 22 S 2 = D 22. It follows from Lemma 2.4 that X 22 = S 1 1 (L D22 + GS 1 2, where G SC S S is arbitrary matrix. Substituting the above into (2.14, (2.11, thus we have formulation (2.9 and (2.10. The sufficiency. Let X 11 D 12 S2 1 D 13 G = W X 21 S1 1 (L D 22 + GS2 1 S 1 X 31 X 32 X 33 1 D 23 V.
11 Skew-symmetric ortho-symmetric solutions 1499 obviously, G C r (n r. By Lemma 2.3 and We have X 0 SSC n P. Hence 0 G X O = U( G 0 U, 0 G A X 0 A = A UU X 0 UU A =(A 1 A 2 ( G 0 ( A 1 A 2 ( A 2 G A 1 G ( A 1 A 2 = A 2 GA 1 + A 1 G A 2 = D. This implies that ( X 0 = U 0 G G 0 U SSCP n is the skew-symmetric ortho-symmetric solution of equation (1.1. Hence the proof. 3 The expression of the solution of Problem 2. To prepare for an explicit expression for the solution of the matrix nearness problem 2, we first verify the following lemma. Lemma 3.1. Suppose that E, C s s, and let S a = diag(a 1,..., a s > 0,S b = diag(b 1,..., b s > 0. Then there exists a unique S s SC s s and a unique S r SSC s s such that and S a SS b E 2 + S a SS b 2 = min. (3.1 S s =Φ [S a (E + S b + S b (E + S a ], (3.2 S r =Φ [S a (E + S b S b (E + S a ], (3.3 where Φ=(ψ ij SC s s, Ψ ij = 1 2(a 2 i b2 j + 1 i, j s. (3.4 a2 j b2 i, Proof. We prove only the existence of S r and (3.3. or any S = (S ij SSC s s, E =(e ij,=(f ij C s s, since S ii =0,S ij = S ji, S a SS b E 2 + S a SS b 2 = [(a i b j S ij e ij 2 +(a i b j S ij f ij 2 ] 1 i,j s
12 1500 D. Krishnaswamy and G. Punithavalli = [(a i b j S ij e ij 2 +( a j b i S ij e ji 2 +(a i b j S ij f ij 2 +( a j b i S ij f ji 2 + (e 2 ij + f ij 2. 1 i<j s 1 i<s Using g(s S ij =0 (1 i, j n, We have =2(a i b j S ij e ij (a i b j +2( a j b i S ij e ji ( a j b i +2(a i b j S ij f ij (a i b j +2( a j b i S ij f ji ( a j b i =2a 2 i b2 j s ij 2a i b j e ij +2a 2 j b2 i S ij +2a j b i e ji +2a 2 i b2 j s ij 2a i b j f ij +2a 2 j b2 i S ij +2a j b i f ji =4a 2 i b 2 js ij +4a 2 jb 2 i S ij 2a i b j (e ij + f ij +2a j b i (e ji + f ji 4S ij (a 2 i b2 j + a2 j b2 i = 2a ib j (e ij + f ij +2a j b i (e ji + f ji S ij = a ib j (e ij + f ij a j b i (e ji + f ji 2(a 2 i b2 j + a2 j b2 i, 1 i, j s. Here Φ=(Ψ ij = 1 2(a 2 i b2 j + 1 i, j s a2 j b2 i, Hence there exists a unique solution S r = ˆ S ij SSC s s for (3.1 such that Sˆ ij = a ib j (e ij + fij a j b i (e ji + fji 2(a 2 i b2 j + a2 j b2 i, 1 i, j s. S r = φ [S a (E + S b S b (E + S a ]. Theorem 3.2. Let X C n n, the generalized singular value decomposition of the matrix pair [A 1, A 2 ] as (2.5, Let U Z XU =( 11 Z 12 Z, ( Z 22 W Z 12V = W Z 21 V = ( X 11 X 12 X 13 X 21 X 22 X 23 X 31 X 32 X 33 ( Y 11 Y12 Y 13 Y21 Y 22 Y 23 Y31 Y 32 Y 33,. (3.6
13 Skew-symmetric ortho-symmetric solutions 1501 If problem 1 is solvable, then problem 2 has a unique solution ˆX, which can be expressed as ( ˆX = U U, ( where 1 2 (X 11 Y 11 D 12S 1 = W 1 2 (X 21 Y 21 S 1 1 (L D D 13 GS 1 2 S 1 1 D (X 31 Y (X 32 Y (X 33 Y 33 V, G = φ [S 1 1 (X 22 Y 22 2S 1 1 L D22 S 1 2 S S 1 2 (X 22 Y 22 2S 1 1 L D22 S 1 2 S 1 1 ], with φ =(ψ ij SC s s,ψ ij = a 2 i a2 j b2 i b2 j 2(a 2 i b2 j + 1 i, j s. a2 j b2 i, Proof. Using the invariance of the robenius norm under unitary transformations, from (2.9, (3.5 and (3.6 we have, (2.9implies that X = U ( 0 U, 0 (3.5implies that (3.6implies that ( U Z XU = 11 Z12 Z21 Z 22 W Z 12V = ( X 11 X 12 X 13 X 21 X 22 X 23 X 31 X 32 X 33 X X = U ( 0 0 W Z 21 V = ( Y 11 Y12 Y 13 Y21 Y 22 Y 23 Y31 Y 32 Y 33 ( Z X = U 11 Z12 Z U 1 21 Z 22 U U ( Z 11 Z 12 Z 21 Z 22 ( U Z = U 11 Z12 Z U 21 Z 22
14 1502 D. Krishnaswamy and G. Punithavalli X X 2 = Z Z Z Z22 2 = Z ( X11 D 12 S 1 2 D 13 X 21 S 1 1 (L D 22 +GS 1 2 S 1 1 D 23 X 31 X 32 X 33 W Z12V 2 + ( X11 D 12 S 1 2 D 13 X 21 S 1 1 (L D 22 +GS 1 2 S 1 1 D 23 X 31 X 32 X 33 + W Z 21 V 2 + Thus X ˆX = inf X X X S E is equivalent to X 11 X X 11 + Y 11 2 = min, X 21 X X 21 + Y 21 2 = min, X 31 X X 31 + Y 31 2 = min, X 32 X X 32 + Y 32 2 = min, X 33 X X 33 + Y 33 2 = min, S 1 1 GS 1 2 (X 22 S 1 1 L D22 S S 1 1 GS 1 2 +(Y 22 ++S 1 1 L D22 S = min. rom Lemma 3.1. We have, X 11 = 1 2 (X 11 Y 11,X 21 = 1 2 (X 21 Y 21 and X 31 = 1 2 (X 31 Y 31,X 32 = 1 2 (X 32 Y 32, X 33 = 1 2 (X 33 Y 33 G =Φ [S 1 1 (X 22 Y 22 2S 1 1 L D22 S 1 2 S S 1 2 (X 22 Y 22 2S 1 1 L D22 S 1 2 S 1 1 ]. Taking X 11,X 21,X 31,X 32,X 33 and G into (2.9, (2.10, we obtain that the solution of (the matrix mearness Problem 2 can be expressed as ( ˆX = U U. 0 0
15 Skew-symmetric ortho-symmetric solutions 1503 References [1] A. Ben-Israel and T.N.E.Greville.Generalized Inverses: Theory and Applications. Wiley, New York, [2] A. Berman.Mass matrix correction using an incomplete set of measured modes. AIAA J.,17: , [3] A. Berman and E.J.Nagy.Improvement of a large analytical model using test data. AIAA J., 21: , [4].A.Gao,Z.H.Song, and R.Q.Liu.The classification and applications of inverse eigenvalue problems (in chinese.technical Report, presented at the irst Conference on Inverse Eigenvalue Problems, Xian, China,1986. [5] J.G.Sun,Two kinds of inverse eigenvalue problems for real symmetric matrices (in chinese. Math. Numer.Sinica., 10: , [6].S. Wei.Analytical dynamic model improvement using vibration test data. AIAA J.,28: ,1990. [7] R.Penrose.A generalized inverse for matrices. Proc. Cambridge Philos.Soc., 51: ,1955. [8] C.G. Khatri and S.K. Mitra.Hermitian and nonnegative definite solutions of linear matrix equations. SIAM J.Appl.Math.,31: ,1976. [9] K.W.E. Chu.Symmetric solutions of linear matrix equations by matrix decompositions. Linear Algebra Appl., 119:35-50,1989. [10] H. Dai.On the symmetric solutions of linear matrix equations. Linear Algebra Appl., 131:1-7,1990. [11] G.H. Golub and C.. Van Loan.Matrix Computations. Johns Hopkins U.P., Baltimore,1989. [12] C.C. Paige and M.A. Saunders.Towards a Generalized Singular Value Decomposition. SIAM J.Numer.Anal.,18: ,1981. [13] G,W. Stewart.Computing the CS-decomposition of a partitional orthogonal matrix. Numer. Math., 40: ,1982. [14] H. Dai and P. Lancaster.Linear matrix equations from an inverse problem of vibration theory. Linear Algebra Appl., 246:31-47, 1996.
16 1504 D. Krishnaswamy and G. Punithavalli [15] C.N. He.Positive definite and symmetric positive definite soltions of linear matrix equations(in Chinese.Hunan Annals of Mathematics,84-93,1996. [16] Z.Y. Peng, X.Y. Hu, and L. Zhang.One kind of inverse problem for the bisymmetric matrices. Math. Numer. Sinica., 27:81-95,2005. [17] C.P. Guo, X.Y. Hu, and L.Zhang.A class of inverse problems of matrix equation X AX = B. Numerical Mathematics: A Journal of Chinese University,26: ,2004. [18].Z. Zhou and X.Y.Hu.The inverse problem of anti-symmetric ortho-symmetric matrices. J.Math.(PRC,25: ,2005. [19] Z. jiang and Q. Lu.On optimal approximation of a matrix under spectral restriction. Math. Numer. Sinica., 1:47-52, [20] N.J. Highan.Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl., 103: ,1988. [21] L. Zhang.The approximation on the closed convex xone and its numerical application. Hunan Annals of Mathematics, 6:43-48, [22] Qing-eng Xiaq, Xi-Yan Hu, and Lei Zhang.The Anti-symmetric Ortho-symmetric solutions of the matrix equation A XA = DElectronic Journal of Linear Algebra.18: 21-29, Received: January, 2011
The 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 reflexive and anti-reflexive solutions of the matrix equation A H XB =C
Journal of Computational and Applied Mathematics 200 (2007) 749 760 www.elsevier.com/locate/cam The reflexive and anti-reflexive solutions of the matrix equation A H XB =C Xiang-yang Peng a,b,, Xi-yan
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 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 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 informationRe-nnd solutions of the matrix equation AXB = C
Re-nnd solutions of the matrix equation AXB = C Dragana S. Cvetković-Ilić Abstract In this article we consider Re-nnd solutions of the equation AXB = C with respect to X, where A, B, C are given matrices.
More informationThe 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 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 informationProduct of Range Symmetric Block Matrices in Minkowski Space
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 29(1) (2006), 59 68 Product of Range Symmetric Block Matrices in Minkowski Space 1
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 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 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 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 informationON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES
Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.
More informationOn V-orthogonal projectors associated with a semi-norm
On V-orthogonal projectors associated with a semi-norm Short Title: V-orthogonal projectors Yongge Tian a, Yoshio Takane b a School of Economics, Shanghai University of Finance and Economics, Shanghai
More 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 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 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 informationThe DMP Inverse for Rectangular Matrices
Filomat 31:19 (2017, 6015 6019 https://doi.org/10.2298/fil1719015m Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://.pmf.ni.ac.rs/filomat The DMP Inverse for
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 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 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 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 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 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 informationWe first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix
BIT 39(1), pp. 143 151, 1999 ILL-CONDITIONEDNESS NEEDS NOT BE COMPONENTWISE NEAR TO ILL-POSEDNESS FOR LEAST SQUARES PROBLEMS SIEGFRIED M. RUMP Abstract. The condition number of a problem measures the sensitivity
More informationYongge Tian. China Economics and Management Academy, Central University of Finance and Economics, Beijing , China
On global optimizations of the rank and inertia of the matrix function A 1 B 1 XB 1 subject to a pair of matrix equations B 2 XB 2, B XB = A 2, A Yongge Tian China Economics and Management Academy, Central
More 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 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 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 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 informationGeneralized Principal Pivot Transform
Generalized Principal Pivot Transform M. Rajesh Kannan and R. B. Bapat Indian Statistical Institute New Delhi, 110016, India Abstract The generalized principal pivot transform is a generalization of the
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 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 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 informationMATH36001 Generalized Inverses and the SVD 2015
MATH36001 Generalized Inverses and the SVD 201 1 Generalized Inverses of Matrices A matrix has an inverse only if it is square and nonsingular. However there are theoretical and practical applications
More informationMatrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein
Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,
More 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 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 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 informationOPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY
published in IMA Journal of Numerical Analysis (IMAJNA), Vol. 23, 1-9, 23. OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY SIEGFRIED M. RUMP Abstract. In this note we give lower
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 informationPositive definite preserving linear transformations on symmetric matrix spaces
Positive definite preserving linear transformations on symmetric matrix spaces arxiv:1008.1347v1 [math.ra] 7 Aug 2010 Huynh Dinh Tuan-Tran Thi Nha Trang-Doan The Hieu Hue Geometry Group College of Education,
More 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 the simplest expression of the perturbed Moore Penrose metric generalized inverse
Annals of the University of Bucharest (mathematical series) 4 (LXII) (2013), 433 446 On the simplest expression of the perturbed Moore Penrose metric generalized inverse Jianbing Cao and Yifeng Xue Communicated
More informationAn Introduction to Linear Matrix Inequalities. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
An Introduction to Linear Matrix Inequalities Raktim Bhattacharya Aerospace Engineering, Texas A&M University Linear Matrix Inequalities What are they? Inequalities involving matrix variables Matrix variables
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 informationA system of matrix equations and a linear matrix equation over arbitrary regular rings with identity
Linear Algebra and its Applications 384 2004) 43 54 www.elsevier.com/locate/laa A system of matrix equations and a linear matrix equation over arbitrary regular rings with identity Qing-Wen Wang Department
More informationEXPLICIT SOLUTION TO MODULAR OPERATOR EQUATION T XS SX T = A
Kragujevac Journal of Mathematics Volume 4(2) (216), Pages 28 289 EXPLICI SOLUION O MODULAR OPERAOR EQUAION XS SX A M MOHAMMADZADEH KARIZAKI 1, M HASSANI 2, AND S S DRAGOMIR 3 Abstract In this paper, by
More informationInterval solutions for interval algebraic equations
Mathematics and Computers in Simulation 66 (2004) 207 217 Interval solutions for interval algebraic equations B.T. Polyak, S.A. Nazin Institute of Control Sciences, Russian Academy of Sciences, 65 Profsoyuznaya
More informationPredrag S. Stanimirović and Dragan S. Djordjević
FULL-RANK AND DETERMINANTAL REPRESENTATION OF THE DRAZIN INVERSE Predrag S. Stanimirović and Dragan S. Djordjević Abstract. In this article we introduce a full-rank representation of the Drazin inverse
More informationON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION
J. Appl. Math. & Informatics Vol. 33(2015), No. 1-2, pp. 229-234 http://dx.doi.org/10.14317/jami.2015.229 ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION YOON J. SONG Abstract. In the setting
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 informationSubset selection for matrices
Linear Algebra its Applications 422 (2007) 349 359 www.elsevier.com/locate/laa Subset selection for matrices F.R. de Hoog a, R.M.M. Mattheij b, a CSIRO Mathematical Information Sciences, P.O. ox 664, Canberra,
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationResearch Article Eigenvector-Free Solutions to the Matrix Equation AXB H =E with Two Special Constraints
Applied Mathematics Volume 03 Article ID 869705 7 pages http://dx.doi.org/0.55/03/869705 Research Article Eigenvector-Free Solutions to the Matrix Equation AXB =E with Two Special Constraints Yuyang Qiu
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More 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 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 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 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 informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationSimultaneous Diagonalization of Positive Semi-definite Matrices
Simultaneous Diagonalization of Positive Semi-definite Matrices Jan de Leeuw Version 21, May 21, 2017 Abstract We give necessary and sufficient conditions for solvability of A j = XW j X, with the A j
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 informationA revisit to a reverse-order law for generalized inverses of a matrix product and its variations
A revisit to a reverse-order law for generalized inverses of a matrix product and its variations Yongge Tian CEMA, Central University of Finance and Economics, Beijing 100081, China Abstract. For a pair
More informationa Λ q 1. Introduction
International Journal of Pure and Applied Mathematics Volume 9 No 26, 959-97 ISSN: -88 (printed version); ISSN: -95 (on-line version) url: http://wwwijpameu doi: 272/ijpamv9i7 PAijpameu EXPLICI MOORE-PENROSE
More informationReal Symmetric Matrices and Semidefinite Programming
Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 17 LECTURE 5 1 existence of svd Theorem 1 (Existence of SVD) Every matrix has a singular value decomposition (condensed version) Proof Let A C m n and for simplicity
More 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 informationDragan S. Djordjević. 1. Introduction
UNIFIED APPROACH TO THE REVERSE ORDER RULE FOR GENERALIZED INVERSES Dragan S Djordjević Abstract In this paper we consider the reverse order rule of the form (AB) (2) KL = B(2) TS A(2) MN for outer generalized
More informationLecture 1 Review: Linear models have the form (in matrix notation) Y = Xβ + ε,
2. REVIEW OF LINEAR ALGEBRA 1 Lecture 1 Review: Linear models have the form (in matrix notation) Y = Xβ + ε, where Y n 1 response vector and X n p is the model matrix (or design matrix ) with one row for
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 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 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 informationEP elements and Strongly Regular Rings
Filomat 32:1 (2018), 117 125 https://doi.org/10.2298/fil1801117y Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat EP elements and
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 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 informationELA THE MINIMUM-NORM LEAST-SQUARES SOLUTION OF A LINEAR SYSTEM AND SYMMETRIC RANK-ONE UPDATES
Volume 22, pp. 480-489, May 20 THE MINIMUM-NORM LEAST-SQUARES SOLUTION OF A LINEAR SYSTEM AND SYMMETRIC RANK-ONE UPDATES XUZHOU CHEN AND JUN JI Abstract. In this paper, we study the Moore-Penrose inverse
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 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 informationApproximation algorithms for nonnegative polynomial optimization problems over unit spheres
Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More 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 informationTrace inequalities for positive semidefinite matrices with centrosymmetric structure
Zhao et al Journal of Inequalities pplications 1, 1:6 http://wwwjournalofinequalitiesapplicationscom/content/1/1/6 RESERCH Trace inequalities for positive semidefinite matrices with centrosymmetric structure
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 informationSection 3.9. Matrix Norm
3.9. Matrix Norm 1 Section 3.9. Matrix Norm Note. We define several matrix norms, some similar to vector norms and some reflecting how multiplication by a matrix affects the norm of a vector. We use matrix
More information~ g-inverses are indeed an integral part of linear algebra and should be treated as such even at an elementary level.
Existence of Generalized Inverse: Ten Proofs and Some Remarks R B Bapat Introduction The theory of g-inverses has seen a substantial growth over the past few decades. It is an area of great theoretical
More informationReview of Some Concepts from Linear Algebra: Part 2
Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set
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 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 informationSOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX
Iranian Journal of Fuzzy Systems Vol 5, No 3, 2008 pp 15-29 15 SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX M S HASHEMI, M K MIRNIA AND S SHAHMORAD
More informationIntroduction to Numerical Linear Algebra II
Introduction to Numerical Linear Algebra II Petros Drineas These slides were prepared by Ilse Ipsen for the 2015 Gene Golub SIAM Summer School on RandNLA 1 / 49 Overview We will cover this material in
More informationPrincipal pivot transforms of range symmetric matrices in indefinite inner product space
Functional Analysis, Approximation and Computation 8 (2) (2016), 37 43 Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/faac Principal pivot
More informationA Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem
A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Suares Problem Hongguo Xu Dedicated to Professor Erxiong Jiang on the occasion of his 7th birthday. Abstract We present
More informationIterative Solution of a Matrix Riccati Equation Arising in Stochastic Control
Iterative Solution of a Matrix Riccati Equation Arising in Stochastic Control Chun-Hua Guo Dedicated to Peter Lancaster on the occasion of his 70th birthday We consider iterative methods for finding the
More informationSymmetric Norm Inequalities And Positive Semi-Definite Block-Matrices
Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices 15
More informationLinGloss. A glossary of linear algebra
LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal
More informationApplied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices
Applied Mathematics Letters 25 (202) 2339 2343 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Comparison theorems for a subclass
More informationThe eigenvalue distribution of block diagonally dominant matrices and block H-matrices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 45 2010 The eigenvalue distribution of block diagonay dominant matrices and block H-matrices Cheng-Yi Zhang chengyizhang@yahoo.com.cn
More informationTHE REAL AND THE SYMMETRIC NONNEGATIVE INVERSE EIGENVALUE PROBLEMS ARE DIFFERENT
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 124, Number 12, December 1996, Pages 3647 3651 S 0002-9939(96)03587-3 THE REAL AND THE SYMMETRIC NONNEGATIVE INVERSE EIGENVALUE PROBLEMS ARE DIFFERENT
More information