THE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1) 1. Introduction
|
|
- Della Avice Higgins
- 5 years ago
- Views:
Transcription
1 Journal of Computational Mathematics, Vol22, No4, 2004, THE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1 Zhen-yun Peng Department of Mathematics, Hunan University of Science and Technology, Xiangtan , China Xi-yan Hu Lei Zhang College of Mathematics and Econometrics, Hunan University, Changsha , China Abstract By using Moore-Penrose generalized inverse and the general singular value decomposition of matrices, this paper establishes the necessary and sufficient conditions for the existence of and the expressions for the centrosymmetric solutions with a submatrix constraint of matrix inverse problem AX = B In addition, in the solution set of corresponding problem, the expression of the optimal approximation solution to a given matrix is derived Mathematics subject classification: 65F15, 65H15 Key words: Matrix norm, Centrosymmetric matrix, Inverse problem, Optimal approximation 1 Introduction Inverse eigenvalue problem has widely used in control theory [1, 2], vibration theory [3, 4], structural design [5], molecular spectroscopy [6] In recent years, many authors have been devoted to the study of this kind of problem and a serial of good results have been made [7, 8, 9] Centrosymmetric matrices have practical application in information theory, linear system theory and numerical analysis theory However, inverse problems of centrosymmetric matrices, specifically centrosymmetric matrices with a submartix constraint, have not be concerned with In this paper, we will discuss this problem Denote the set of all n-by-m real matrices by R n m and the set of all n-by-n orthogonal matrices in R n n by OR n n Denote the column space, the null space, the Moore-Penrose generalized inverse and the Frobenius norm of a matrix A by RA,NA,A + and A, respectively I n denotes the n n unit matrix and S n denotes the n n reverse unit matrix We define the inner product in space R n m by A, B = traceb H A, A, B R n m Then R n m is a Hilbert inner product space The norm of a matrix generated by this inner product space is the Frobenius norm For A =a ij,b =b ij R n m, we using the notation A B =a ij b ij R n n denotes the Hadmard product of matrices A and B Definition 1 [10,15] A =a ij R n n is termed a Centrosymmetric matrix if a ij = a n+1 j,n+1 i i, j =1, 2,,n Received January 27, Research supported by National Natural Science Foundation of China , and by Hunan Province Educational Foundation 02C025
2 536 ZY PENG, XY HU AND L ZHANG The set of n n centrosymmetric matrices denoted by CSR n n In this paper, we consider the following two problems: Problem 1 Given X, B R n m,a 0 R r r, find A CSR n n such that AX = B, A 0 = A[1,r], where A[1,r] is a leading r r principal submatrix of matrix A Problem 2 Given A R n n, find  S E such that where S E is the solution set of Problem 1 A  = min A A, A S E In Section 2, we first discuss the structure of the set CSR n n, and then present the solvability conditions and provide the general solution formula for Problem 1 In Section 3, we first show the existence and uniqueness of the solution for Problem 2, and then derive an expression of the solution when the solution set S E is nonempty Finally, in section 4, we first give an algorithm to compute the solution to Problem 2, and then give a numerical example to illustrate the results obtained in this paper are correction 2 Solving Problem 1 We first characterize the set of all centrosymmetric matrices For all positive integers k, let D 2k = 1 Ik I k 2 S k S k Clearly, D n is orthogonal for all n Lemma 1 [10] A CSR n n if and only if A = S n AS n,d 2k+1 = 1 I k 0 I k S k 0 S k Lemma 2 A CSR n n if and only if A can be expressed as where A 1 R n k n k,a 2 R k k A = D n 1 D T n, 2 Proof We only prove the case for n =2k, thecaseforn =2k + 1 can be discussed similarly Partition the matrix A into the following form A11 A A = 12 A 21 A 22,A 11,A 22 R k k If A CSR 2k 2k,thenwehavefromLemma1that 0 Sk S k 0 A11 A 12 A 21 A 22 0 Sk S k 0 A11 A 12 = A 21 A 22,
3 The Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint 537 which is equivalent to Hence A 22 = S k A 11 S k, A 12 = S k A 21 S k Ik S k A11 S k A 21 S k Ik I k Let D T n AD n = 1 2 I k S k A 21 S k A 11 S k A11 + S k A 21 0 = 0 A 11 S k A 21 A 1 = A 11 + S k A 21,A 2 = A 11 S k A 21, and note that D n is a orthogonal matrix, we have 2 Conversely, for every A 1,A 2 R k k,wehave 0 Sk S k 0 D n 0 Dn T Sk S k 0 S k S k = D n D T n It follows from Lemma 1 that A = D n Dn T 0 A CSR2k 2k 2 Next, we give some lemmas According to [7], the following lemma is easy to verify Lemma 3 Given Z R m s,y R n s, then the matrix equation AZ = Y has a solution A R n m if and only if YZ + Z = Y In that case the general solution can be expressed as A = YZ + + GP T,whereP R n n t is an unit column-orthogonal matrix, RP =NZ T and t = rankz Let Γ={A CSR n n AX = B,X,B R n m } 3 Partitioning D T n X and D T n B into to the following form D T n X = X1 X 2,D T n B = B1 B 2 where X 1,B 1 R n k m,x 2,B 2 R k m We have the following lemma, 4 Lemma 4 Γ is nonempty if and only if B 1 X + 1 X 1 = B 1 and B 2 X + 2 X 2 = B 2 Furthermore, any matrix A Γ can be expressed as A = D n B1 X G 1U T B 2 X G 2P T 2 D T n, 5 where G 1 R n k n k r1,g 2 R k k r2 are arbitrary matrices, r 1 = rankx 1,r 2 = rankx 2, RU 2 =NX T 1, RP 2 =NX T 2 Proof If Γ is nonempty, we have from Lemma 2 and D n being an orthogonal matrix that A = D n D T n, 6
4 538 ZY PENG, XY HU AND L ZHANG with A 1 R n k n k,a 2 R k k satisfy It follows from Lemma 3 that and A 1 X 1 = B 1, A 2 X 2 = B 2 7 B 1 X + 1 X 1 = B 1,B 2 X + 2 X 2 = B 2 8 A 1 = B 1 X G 1U T 2,A 2 = B 2 X G 2P T 2, 9 where G 1 R n k n k r1, G 2 R k k r2 are arbitrary matrix, r 1 =rankx 1,r 2 =rankx 2, RU 2 =NX1 T, RP 2=NX2 T Substituting 9 into 6, we have 5 Conversely, if B 1 X 1 + X 1 = B 1 and B 2 X 2 + X 2 = B 2, then we have from Lemma 3 that there exist A 1 R n k n k and A 2 R k k such that which is equivalent to It in turn is equivalent to A 1 X 1 = B 1, A 2 X 2 = B 2, X1 X 2 = B1 B 2 D T n X = B D n Dn T Γ And this illustrate Γ is nonempty So the matrix A = D n Now, we investigate the consistency of Problem 1 with a centrosymmetric condition on the solution Obviously, solving Problem 1 is equivalent to find A Γ such that A 0 is a leading principal submatrix of A, ie, find A Γ such that I r, 0AI r, 0 T = A 0, 10 where I r, 0 R r n Note that any matrix A Γ can be expressed as 5, we partition the matrix I r, 0D n into the following form Let I r, 0D n =W 1,W 2,W 1 R r n k,w 2 R r k 11 Ẽ = A 0 W 1 B 1 X + 1 W T 1 W 2 B 2 X + 2 W T 2 12 Then equation 10 is equivalent to find G 1 and G 2 as in 5 such that W 1 G 1 N 1 + W 2 G 2 N 2 = Ẽ, 13 where N 1 = U T 2 W T 1,N 2 = P T 2 W T 2 Decomposing the matrix pairs W T 1,W T 2 andn 1,N 2 using the General Singular-Value Decomposition GSV D see[12, 13, 14]: W T 1 = ŨΣ 1M 1, W T 2 = Ṽ Σ 2M 1, N 1 = P Σ 3 M 2, N 2 = QΣ 4 M 2, 14
5 The Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint 539 where Ũ,Ṽ, P and Q are orthogonal matrices, and M 1 and M 2 are nonsingular matrices of order r, Σ 1 R n k r,σ 2 R k r,σ 3 R n k r1 r,σ 4 R k r2 r,with Σ 1 = I 1 S Σ 2 = 0 2 S 2 0 I 2 15 r 3 r 4 p 1 r 3 r 4 r p 1 r 3 r 4 p 1 r 3 r 4 r p 1 Σ 3 = I 3 S Σ 4 = 0 4 S 4 0 I 4 16 r 5 r 6 p 2 r 5 r 6 r p 2 r 5 r 6 p 2 r 5 r 6 r p 2 here I 1,I 2,I 3 and I 4 are identity matrices, 0 1, 0 2, 0 3 and 0 4 are zero matrices, p 1 =rankc 1 =rankw 1,W 2, p 2 =rankc 2 =rankn 1,N 2, and S 1 = diagα 1,,α r4,s 2 = diagβ 1,,β r4, 17 S 3 = diagσ 1,,σ r6,s 4 = diagδ 1,,δ r6, 18 with 1 >α 1 α r4 > 0, 0 <β 1 β r4 < 1, 1 >σ 1 σ r6 > 0, 0 <δ 1 δ r6 < 1, and α 2 i + β2 i =1, i =1,,r 4, σi 2 + δ2 i =1, i =1,,r 6 Some submatrices in equations 15 and 16 may disappear, depending on the structure of the matrices W 1,W 2,N 1 and N 2 Define Y = Ũ T G 1 P,Z = Ṽ T G 2 Q and E = M T 1 ẼM 1 2 Equation 13 now reads Σ T 1 Y Σ 3 +Σ T 2 ZΣ 4 = E 19 Note that transforming equation 13 to 19 does not change the equation s consistency Partitioning the matrices Y,Z and E according to the Σ s, equation 19 is equivalent to Y 11 Y 12 S S 1 Y 21 S 1 Y 22 S 3 + S 2 Z 22 S 4 S 2 Ỹ Z 32 S 4 Z = From the above discussion, we can prove the following theorem: Theorem 1 Problem 1 is solvable if and only if a B i X + i X i = B i i =1, 2 E 11 E 12 E 13 E 14 E 21 E 22 E 23 E 24 E 31 E 32 E 33 E 34 E 41 E 42 E 43 E 44 b E 13 =0,E 31 =0,E 14 =0,E 24 =0,E 34 =0,E 41 =0,E 42 =0,E 43 =0,E 44 =0 When the conditions a and b are satisfied, the general solution can be expressed as 20 A = D n B1 X G 1U T B 2 X G 2P T 2 D T n, 21
6 540 ZY PENG, XY HU AND L ZHANG where G 1 = Ũ E 11 E 12 S3 1 Y 13 S S S 2 Z 22 S 4 S3 1 Y 23 Y 31 Y 32 Y 33 Z 11 Z 12 Z 13 G 2 = Ṽ Z 21 Z 22 S2 1 E 23 Z 31 E 32 S4 1 E 33 with Y 13,Y 23,Y 31,Y 32,Y 33,Z 11,Z 12,Z 13,Z 21,Z 22,Z 31 are arbitrary matrices P T, 22 QT, 23 Proof Problem 1 having a solution A CSR n n is equivalent to there exists A Γsuch that 10 holds Condition a is the necessary and sufficient conditions for Γ is nonempty Condition b is the necessary and sufficient conditions for equation 10 has centrosymmetric solution with the given matrix as its submatrix The general solution can be obtained by the definition of Y and Z and the Equations 5 and 20 Letusfirstintroducealemma 3 Solving Problem 2 Lemma 5 [11] Given E,F R n n, Ω 1 =diaga 1,,a n > 0, Ω 2 =diagb 1,,b n > 0, Φ= 1 R n n, then there exists an unique matrix 1+a Ŝ 2 Rn n such that S E 2 + Ω 1 SΩ 2 i b2 j F 2 = min, andŝ can be expressed as Ŝ =Φ E +Ω 1F Ω 2 Partition the matrix Dn T A D n intoa2 2 block matrix A ij 2 2 with A 11 R n k n k, A 22 Rk k Partition matrices Ũ T A 11 U 2 P and Ṽ T A 22 P 2 Q into 3 3 block matrices Ỹij 3 3 with Ỹ11 R r3 r5, Ỹ22 R r4 r6, Ỹ33 R n k r3 r4 n k r1 r5 r6, and Z ij 3 3 with Z 11 R k+r3 p1 k r2+r3 p2, Z 22 R r4 r6, Z 33 R p1 r3 r4 p2 r5 r6, respectively Then we have the following theorem Theorem 2 Given X, B R n m,a 0 R r r and A R n n X, B, A 0 satisfy conditions of Theorem 1 Then Problem 2 has an unique optimal approximate solution which can be expressed as B 1 X 1 + Â = D + Ĝ1U2 T 0 n 0 B 2 X Ĝ2P2 T Dn T 24 where Ĝ 1 = Ũ E 11 E 12 S3 1 Ỹ 13 S1 1 E 21 S1 1 E 22 S 2 Ẑ 22 S 4 S3 1 Ỹ 23 Ỹ 31 Ỹ 32 Ỹ 33 Ĝ 2 = Ṽ Z 11 Z12 Z13 Z 21 Ẑ 22 S2 1 E 23 Z 31 E 32 S4 1 E 33 P T, 25 QT, 26 Z 22 =Φ [ Z 22 + S 1 1 S 2Ỹ22 S 1 1 E 22S 1 3 S 4S 1 3 ] 27 with Φ=ϕ ij R r4 r6,ϕ ij = the same as 14 α 2 i δ2 j α 2 i δ2 j +β2 i σ2 j, U 2,P 2 are the same as 5, and Ũ,Ṽ, P and Q are
7 The Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint 541 Proof Because X, B and A 0 satisfy the conditions of the Theorem 1, the solution set S E of Problem 1 is nonempty According to the proof of theorem 74 in [7], it is easy to verify that S E is a closed convex cone Hence, the corresponding Problem 2 has an unique optimal approximate solution Choose U 1 and P 1 such that U =U 1,U 2 andp =P 1,P 2 are orthogonal matrices Attention to U, P, D, Ũ,Ṽ, P and Q are orthogonal matrices, and RU 2 =NX1 T,RP 2=NX2 T, we have from that A A 2 = B 1 X G 1U T 2 A B 2 X G 2P T 2 A A A 21 2 = G 1 A 11U G 2 A 22P B 1 X + 1 A 11U B 2 X 2 + A 22 P A A 21 2 E 11 E 12 S 1 3 Y 13 = S1 1 E 21 S1 1 E 22 S 2 Z 22 S 4 S3 1 Y 23 Ũ T A 11U 2 P Y 31 Y 32 Y 33 2 Z 11 Z 12 Z 13 + Z 21 Z 22 S2 1 E 23 Ṽ T A 22P 2 Q Z 31 E 32 S4 1 E 33 + B 1 X + 1 U 1 A 11 U B 2 X + 2 P 1 A 22 P A A Hence, there exists A S E such that A A = min is equivalent to Y i3 Ỹi3 =min, Y 3j Ỹ3j =min, Z i1 Z i1 =min, i =1, 2, 3,j =1, 2, Z 12 Z 12 =min, Z 22 Z S1 1 E 22 S 2 Z 22 S 4 S3 1 Ỹ22 2 =min 28 It follow from Lemma 5 that Y i3 = Ỹi3,Y 3j = Ỹ3j,Z i1 = Z i1, i =1, 2, 3,j =1, 2,Z 12 = Z and Z 22 =Φ Z 22 + S1 1 S 2Ỹ22 S1 1 E 22S3 1 S 4S Substituting 29 and 30 into 21-23, we obtain The Algorithm Description and Numerical Example According to discuss in section 2 and 3, we now give a method for solving Problem 2 as following steps: step 1 According to 4 calculate X i,b i i =1, 2, furthermore calculate B i X i + X i i =1, 2 step 2 If B i X i + X i = B i i =1, 2, then the set Γ is nonempty and we continue Otherwise we stop step 3 According to 11 calculate W 1,W 2 According to 12 calculate Ẽ step 4 Find unit column orthogonal matrices U 2,P 2 basis of linear equations X1 T u =0 and X2 T v =0 ChosenU 1,P 1 such that U =U 1,U 2,P =P 1,P 2 are orthogonal matrices step 5 According to 14 decomposing the matrix pairs W1 T,WT 2 andn 1,N 2 usingthe GSV D step 6 Partitioning the matrix E according to the right side of 20
8 542 ZY PENG, XY HU AND L ZHANG step 7 If E 13 =0,E 31 =0,E 14 =0,E 24 =0,E 34 =0,E 41 =0,E 42 =0,E 43 =0,E 44 =0, then the solution set S E to Problem 1 is nonempty and we continue Otherwise we stop step 8 Partition the matrices Dn T A D n, Ũ T A 11U 2 P and Ṽ T A 22P 2 Q into block matrices according to Dn T AD n in 21, Ũ T G 1 P in 22 and Ṽ T G 2 Q in 23, respectively step 9 According to calculate  Example 1 Taking A 0 = X = A = we obtain X + 1,X+ 2,B 1 and B 2 are,respectively,,b = , By a direct computing, we know that B i X + i X i = B i i =1, 2 According to step 4, we get two orthogonal matrices U =U 1,U 2,P =P 1,P 2 as follow U 1 = U 2 =
9 The Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint 543 P 1 = P 2 = After calculating according to step 5 and 6, the condition b of Theorem 1 is satisfied Hence, the conditions of Theorem 1 are satisfied, and the corresponding problem 2 has an unique solution  After calculating by 24-27, we have  as follow: References [1] LR Fletcher, An Inverse Eigenvalue Problem from Control Theory, in Numerical Treatment of Inverse problems for Differential and Integral Equations, eds P Deuflhard and E Hairer, Birkhauser, Beston, 1983, [2] WM Wonham, Linear Multivariable Control: A Geometric Approach, Springer-Verlag, 1979 [3] V Barcilon, Inverse Problem for a Vibrating Beam, J Appl Math Phys, , [4] GML Gladwell, Inverse Problems in Vibration, Martinus Nijhoff, Dordrecht, The Netherlands, Boston, MA, 1986 [5] KT Jeseph, Inverse Eigenvalue Problem in Structural design, AIAA J, , [6] S Friedland, The Reconstruction of a Symmetric Matrix from the spectral data, J Math Anal Applic, , [7] SQ Zhou, HDai, The Algebraic Inverse Eigenvalue Problem in Chinese, Henan Science and Technology Press, Zhengzhou, China, 1991 [8] JG Sun, Some New Result on Algebraic Inverse Eigenvalue Problems, in Proceedings of the First Chinese National Conference on Inverse Eigenvalue Problems, 1986 [9] SF Xu, An Introduction to Inverse Eigenvalue Problems, Peking University Press, Beijing, China, 1998 [10] JL Zhen, XH Zhen, Special Matrices in Chinese, Qinghua University Press, Beijing, China, 2001 [11] AP Liao, A Generalization of a Class of Inverse Eigenvalue Problems, Journal of Hunan University, , 7-10 [12] CC Paige and MA Saunders, Towards a Generalized Singular Value Decomposition, SIAMJ Numer Anal, 18:1 1981, [13] GH Golub and CF Van Loan, Matrix Computations, The Johns Hopkins University Press, American, 1983 [14] GW Stewart, Computing the CS-decomposition of a partitional orthogonal matrix, Numer Math, ,
10 544 ZY PENG, XY HU AND L ZHANG [15] Z Xu, KY Zhang and Q Lu, The fast algorithm for solving Toeplitz matrices in Chinese, Xibei Industry University Press, 1999
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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationELA
POSITIVE DEFINITE SOLUTION OF THE MATRIX EQUATION X = Q+A H (I X C) δ A GUOZHU YAO, ANPING LIAO, AND XUEFENG DUAN Abstract. We consider the nonlinear matrix equation X = Q+A H (I X C) δ A (0 < δ 1), where
More informationELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n
Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this
More informationImproved 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 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 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 informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationA Note on the Pin-Pointing Solution of Ill-Conditioned Linear System of Equations
A Note on the Pin-Pointing Solution of Ill-Conditioned Linear System of Equations Davod Khojasteh Salkuyeh 1 and Mohsen Hasani 2 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P. O. Box.
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 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 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 informationOn the Local Convergence of an Iterative Approach for Inverse Singular Value Problems
On the Local Convergence of an Iterative Approach for Inverse Singular Value Problems Zheng-jian Bai Benedetta Morini Shu-fang Xu Abstract The purpose of this paper is to provide the convergence theory
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 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 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 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 informationThe Reconstruction of An Hermitian Toeplitz Matrices with Prescribed Eigenpairs
The Reconstruction of An Hermitian Toeplitz Matrices with Prescribed Eigenpairs Zhongyun LIU Lu CHEN YuLin ZHANG Received: c 2009 Springer Science + Business Media, LLC Abstract Toeplitz matrices have
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 informationAn algorithm for symmetric generalized inverse eigenvalue problems
Linear Algebra and its Applications 296 (999) 79±98 www.elsevier.com/locate/laa An algorithm for symmetric generalized inverse eigenvalue problems Hua Dai Department of Mathematics, Nanjing University
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 informationResearch Article Inverse Eigenvalue Problem of Unitary Hessenberg Matrices
Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 009, Article ID 65069, pages doi:0.55/009/65069 Research Article Inverse Eigenvalue Problem of Unitary Hessenberg Matrices
More information2 Computing complex square roots of a real matrix
On computing complex square roots of real matrices Zhongyun Liu a,, Yulin Zhang b, Jorge Santos c and Rui Ralha b a School of Math., Changsha University of Science & Technology, Hunan, 410076, China b
More informationSymmetric inverse generalized eigenvalue problem with submatrix constraints in structural dynamic model updating
Electronic Journal of Linear Algebra Volume Volume 011 Article 48 011 Symmetric inverse generalized eigenvalue problem with submatrix constraints in structural dynamic model updating Meixiang Zhao Zhigang
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 informationOn the Schur Complement of Diagonally Dominant Matrices
On the Schur Complement of Diagonally Dominant Matrices T.-G. Lei, C.-W. Woo,J.-Z.Liu, and F. Zhang 1 Introduction In 1979, Carlson and Markham proved that the Schur complements of strictly diagonally
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 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 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 informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationEfficient algorithms for finding the minimal polynomials and the
Efficient algorithms for finding the minimal polynomials and the inverses of level- FLS r 1 r -circulant matrices Linyi University Department of mathematics Linyi Shandong 76005 China jzh108@sina.com Abstract:
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 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 informationSemismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones
to appear in Linear and Nonlinear Analysis, 2014 Semismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones Jein-Shan Chen 1 Department of Mathematics National
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More 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 informationInverse eigenvalue problems involving multiple spectra
Inverse eigenvalue problems involving multiple spectra G.M.L. Gladwell Department of Civil Engineering University of Waterloo Waterloo, Ontario, Canada N2L 3G1 ggladwell@uwaterloo.ca URL: http://www.civil.uwaterloo.ca/ggladwell
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 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 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 informationMULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 217 221 217 MULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES N. CRAINIC Abstract. In this paper we study the relevance
More informationS.F. Xu (Department of Mathematics, Peking University, Beijing)
Journal of Computational Mathematics, Vol.14, No.1, 1996, 23 31. A SMALLEST SINGULAR VALUE METHOD FOR SOLVING INVERSE EIGENVALUE PROBLEMS 1) S.F. Xu (Department of Mathematics, Peking University, Beijing)
More informationMultiplicative Perturbation Analysis for QR Factorizations
Multiplicative Perturbation Analysis for QR Factorizations Xiao-Wen Chang Ren-Cang Li Technical Report 011-01 http://www.uta.edu/math/preprint/ Multiplicative Perturbation Analysis for QR Factorizations
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 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 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 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 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 informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
More informationZhaoxing Gao and Ruey S Tsay Booth School of Business, University of Chicago. August 23, 2018
Supplementary Material for Structural-Factor Modeling of High-Dimensional Time Series: Another Look at Approximate Factor Models with Diverging Eigenvalues Zhaoxing Gao and Ruey S Tsay Booth School of
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 informationOUTLINE 1. Introduction 1.1 Notation 1.2 Special matrices 2. Gaussian Elimination 2.1 Vector and matrix norms 2.2 Finite precision arithmetic 2.3 Fact
Computational Linear Algebra Course: (MATH: 6800, CSCI: 6800) Semester: Fall 1998 Instructors: { Joseph E. Flaherty, aherje@cs.rpi.edu { Franklin T. Luk, luk@cs.rpi.edu { Wesley Turner, turnerw@cs.rpi.edu
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 informationMATH 5640: Functions of Diagonalizable Matrices
MATH 5640: Functions of Diagonalizable Matrices Hung Phan, UMass Lowell November 27, 208 Spectral theorem for diagonalizable matrices Definition Let V = X Y Every v V is uniquely decomposed as u = x +
More informationLecture 5 Singular value decomposition
Lecture 5 Singular value decomposition Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationThe Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix
The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix Chun-Yueh Chiang Center for General Education, National Formosa University, Huwei 632, Taiwan. Matthew M. Lin 2, Department of
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationOn the 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 informationarxiv: v1 [math.na] 26 Nov 2018
arxiv:1811.10378v1 [math.na] 26 Nov 2018 Gradient-based iterative algorithms for solving Sylvester tensor equations and the associated tensor nearness problems Maolin Liang, Bing Zheng School of Mathematics
More informationApplications of Controlled Invariance to the l 1 Optimal Control Problem
Applications of Controlled Invariance to the l 1 Optimal Control Problem Carlos E.T. Dórea and Jean-Claude Hennet LAAS-CNRS 7, Ave. du Colonel Roche, 31077 Toulouse Cédex 4, FRANCE Phone : (+33) 61 33
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 informationSTRUCTURAL AND SPECTRAL PROPERTIES OF k-quasi- -PARANORMAL OPERATORS. Fei Zuo and Hongliang Zuo
Korean J Math (015), No, pp 49 57 http://dxdoiorg/1011568/kjm01549 STRUCTURAL AND SPECTRAL PROPERTIES OF k-quasi- -PARANORMAL OPERATORS Fei Zuo and Hongliang Zuo Abstract For a positive integer k, an operator
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 informationStrictly nonnegative tensors and nonnegative tensor partition
SCIENCE CHINA Mathematics. ARTICLES. January 2012 Vol. 55 No. 1: 1 XX doi: Strictly nonnegative tensors and nonnegative tensor partition Hu Shenglong 1, Huang Zheng-Hai 2,3, & Qi Liqun 4 1 Department of
More informationbe a Householder matrix. Then prove the followings H = I 2 uut Hu = (I 2 uu u T u )u = u 2 uut u
MATH 434/534 Theoretical Assignment 7 Solution Chapter 7 (71) Let H = I 2uuT Hu = u (ii) Hv = v if = 0 be a Householder matrix Then prove the followings H = I 2 uut Hu = (I 2 uu )u = u 2 uut u = u 2u =
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 informationSubmatrices and Partitioned Matrices
2 Submatrices and Partitioned Matrices Two very important (and closely related) concepts are introduced in this chapter that of a submatrix and that of a partitioned matrix. These concepts arise very naturally
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 informationInequalities Involving Khatri-Rao Products of Positive Semi-definite Matrices
Applied Mathematics E-Notes, (00), 117-14 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Inequalities Involving Khatri-Rao Products of Positive Semi-definite Matrices
More informationInverse Eigenvalue Problems for Two Special Acyclic Matrices
mathematics Communication Inverse Eigenvalue Problems for Two Special Acyclic Matrices Debashish Sharma, *, and Mausumi Sen, Department of Mathematics, Gurucharan College, College Road, Silchar 788004,
More 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 informationChapter 3. Matrices. 3.1 Matrices
40 Chapter 3 Matrices 3.1 Matrices Definition 3.1 Matrix) A matrix A is a rectangular array of m n real numbers {a ij } written as a 11 a 12 a 1n a 21 a 22 a 2n A =.... a m1 a m2 a mn The array has m rows
More informationarxiv: v1 [math.ra] 11 Aug 2014
Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationError estimates for the ESPRIT algorithm
Error estimates for the ESPRIT algorithm Daniel Potts Manfred Tasche Let z j := e f j j = 1,..., M) with f j [ ϕ, 0] + i [ π, π) and small ϕ 0 be distinct nodes. With complex coefficients c j 0, we consider
More informationExpressions and Perturbations for the Moore Penrose Inverse of Bounded Linear Operators in Hilbert Spaces
Filomat 30:8 (016), 155 164 DOI 10.98/FIL1608155D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Expressions and Perturbations
More informationLinear Algebra & Analysis Review UW EE/AA/ME 578 Convex Optimization
Linear Algebra & Analysis Review UW EE/AA/ME 578 Convex Optimization January 9, 2015 1 Notation 1. Book pages without explicit citation refer to [1]. 2. R n denotes the set of real n-column vectors. 3.
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationCharacterization of half-radial matrices
Characterization of half-radial matrices Iveta Hnětynková, Petr Tichý Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Prague 8, Czech Republic Abstract Numerical radius r(a) is the
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 informationCONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
J. Appl. Math. & Computing Vol. 182005 No. 1-2 pp. 59-72 CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX JAE HEON YUN SEYOUNG OH AND EUN HEUI KIM Abstract. We study convergence
More informationA Divide-and-Conquer Method for the Takagi Factorization
A Divide-and-Conquer Method for the Takagi Factorization Wei Xu 1 and Sanzheng Qiao 1, Department of Computing and Software, McMaster University Hamilton, Ont, L8S 4K1, Canada. 1 xuw5@mcmaster.ca qiao@mcmaster.ca
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
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 informationTensor Complementarity Problem and Semi-positive Tensors
DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New
More informationProlongation structure for nonlinear integrable couplings of a KdV soliton hierarchy
Prolongation structure for nonlinear integrable couplings of a KdV soliton hierarchy Yu Fa-Jun School of Mathematics and Systematic Sciences, Shenyang Normal University, Shenyang 110034, China Received
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 information