AN ITERATIVE METHOD FOR SYMMETRIC SOLUTIONS OF THE MATRIX EQUATION AXB + CXD = F

Size: px
Start display at page:

Download "AN ITERATIVE METHOD FOR SYMMETRIC SOLUTIONS OF THE MATRIX EQUATION AXB + CXD = F"

Transcription

1 010 D 11 i ± Ψ E 7 3 "7 4 I Nov. 010 MATHEMATICA NUMERICA SINICA Vol.3 No.4 BD@: AXB + CXD = F >9A< =;C? * 867 Bο*c'Dfi $ΛDf ffl±fi 5300) 1 - meffi BΞ14OL) ψ_#1<*φnt»h~χstffi AXB + CXD = F 4E ρ» KffΨΨν. X<*ΦN χstffi AXB + CXD = F 4/_>&Om<*lffi Φ?EC. -χstffi AXB + CXD = F _Eρ»i m_4& RffC E R!nEρχs X 1 k<*φn ρl_ &0χsTffi4Eρ»; BVps4!n<*χs v&o<* #}5R Eρ». IR E R_>4χs X 0 χstffi AXB + CXD = F 4ffΨΨνEρ»&Oνl<*T»:4χsTffi A XB + C XD = F 4}5R Eρ»0. ψ 4 - xk1φn4_7>. νο : χstffi; <*ΦN; Eρ»; }5R»; ffψψν MR 000) 4%μff: 65F10 AN ITERATIVE METHOD FOR SYMMETRIC SOLUTIONS OF THE MATRIX EQUATION AXB + CXD = F Zhou Hailin Taizhou Inst of Sci&Tech NJUST Taizhou 5300 Jiangsu China) Abstract Motivated by the conjugate gradient method an iterative algorithm is presented to solve the linear matrix equation AXB + CXD = F over symmetric matrix X and its optimal approximation. By this method the solvability of the equation AXB + CXD = F over symmetric X can be determined automatically. When the equation AXB + CXD = F is consistent over symmetric X its solution can be obtained within finite iteration steps in the absence of round off errors for any initial symmetric matrix X 1 and its least-norm symmetric solution can be derived by choosing a suitable initial iterative matrix. Furthermore its optimal approximation to the given matrix X 0 can be obtained by choosing the least-norm symmetric solution of a new matrix equation A XB + C XD = F. Some numerical examples verify the efficiency of the algorithm. Keywords: matrix equation; iterative algorithm; symmetric solution; least-norm solution; optimal approximation 000 Mathematics Subject Classification: 65F10 * 009 D 11 i 30 v0.

2 414 Π Φ D 010 D 1. 0 R m n ffip m n jffir~o I n ffip n +ffiffir SR n n n ASR n n Wffl ffip R n n ~DßffirnODßffir~o. =S <AB>=trB T A) o ff`.3q fl Frobenius Q A = <AA>=trA T A) 1. Dffir A =a 1 a a n ) R m n J~ a i R m i =1 n veca) =a T 1 a T a T n ) T A B ffipffir A d B 3 Kronecker. ±χλj#6</!. )$ I. ^=ffir A C R m n BD R n p F R m p S X SR n n l1 AXB + CXD = F. 1) )$ II.! I.^h J ~ofl S E D^=3 X 0 R n n S X S E l1 X X 0 = min X S E X X 0. ) ffirsfl3s!^ J3)7QSnr 3WZffz. 8;3-=ffirSfl H` a) AX = B b) AX + XB = C c) AXB = C d) A 1 XB 1 + A XB + + A k XB k = C e) AX + YB = C 5 fl 1) Mßw/0@Gffir7n zw'cp3gξn t KU 10rGffj. lz3smλj^ltzw SVD) 3 hsltzw GSVD) 4 5 n flπ.gw CCD) 6 5. ldflffla conjugate gradient) Λ03NK FF9 7 fn;)mhff0ffirsfl AXB = C ffirsflψ A 1 XB 1 = C 1 A XB = C 3g} ; Peng 8 n Wang 5 9 Wffl S 0ffirSfl AXB + CY D = F flxffir n AXB + CX T D = E 3L Ω4 Jfi. ±χ^";) M S 0ffirSfl AXB + CXD = F 3Dß JΩΦΦμ. χ ~^"3 z±kwj0z M3^6=..!ß*& I # 1. 1) yaffir A R m n B R n p C R m n D R n p n F R m p U X 1 SR n n ; ) Ξ R 1 = F AX 1 B + CX 1 D) P 1 = A T R 1 B T + C T R 1 D T Q 1 = 1 P 1 + P1 T ) k := 1. 3) `j R k =0y R k 0 Q k =0 ; Xo Y k := k +1. 4) Ξ X k = X k 1 + R k 1 Q k 1 Q k 1 R k = F AX k B + CX k D) P k = A T R k B T + C T R k D T

3 4 I m: χstffi AXB + CXD = F Eρ»4<*ΦN 415 Q k = 1 P k + P T k ) trp kq k 1 ) Q k 1 Q k 1. 5) w/ 3). *X Q i SR n n X i SR n n i =1.». 1. Dffir MN R s t b trm T N)=0oßffir M N.tv. /fi 1. Dd ;) M 1 Ωμg3 R i Q i P j i j =1 ^ ψ. b Q T i = Q i o trr T i+1 R j) = trr T i R j) R i Q i trq ip j ). 3) trri+1 T R j)=trf AX i+1 B + CX i+1 D)) T R j = tr F A X i + R i ) Q i Q i B C X i + R i ) ) T Q i Q i D R j = tr R Ti R i ) Q i AQ ib + CQ i D) T R j = trri T R j) R i Q i trbt Q T i AT R j ) R i Q i trdt Q T i CT R j ) = trri T R j) R i Q i trqt i AT R j B T ) R i Q i trqt i CT R j D T ) = trr T i R j) R i Q i trq ip j ). /fi. D M 1 ;)kfl~μg3 R i Q j k ^ trr T i R j)=0 trq T i Q j)=0 ij =1 k i j. 4) ψ. Z CiAMw>. b trr T i R j)=trr T j R i) #;}?w> i>jh 7ff. %. D k =ΞQ/ Q T 1 = Q 1 V) 1 n M 1 ^ trr T R 1)=trR1 T R 1) R 1 Q 1 trq 1P 1 )= R 1 R 1 Q 1 tr P 1 + P1 T Q 1 = R 1 R 1 Q 1 trq 1Q 1 )=0 trr T R 1)=0. 5) trq T P + P Q 1 )=tr T Q 1 trp Q 1 ) Q 1 QT 1 Q 1 = trp Q 1 ) trp Q 1 )=0 P Q = tr 1 + P Q 1 ) T ) trp Q 1 ) trq T Q 1 )=0. 6)

4 416 Π Φ D 010 D Ωf 4) D k = s ff. ΞQ/ Q T s = Q s trq T s Q s 1 )=0 V) 1 n M 1 d 5). Π3w> #;^ trrs+1r T s )= R s R s Q s tr Q T s Q s + trp ) sq s 1 ) Q s 1 Q s 1 = R s R s Q s tr Q T s Q s )+ trp sq s 1 ) Q s 1 trqt s Q s 1 ) = R s R s Q s trqt s Q s )=0 d 6).Π3w> #;%1/ trq T s+1 Q s)=0. D j =1 V) 1 ^ trr T s+1 R j)=0. D j = 3 s 1 ΞQ/ trr T s R j )=0 trq T s Q j)=0trq T s Q j 1) =0 V) 1 n M 1 1/ trr T s+1 R j)=trr T s R j) R s = R s Q s tr Qs P j +Q s P j ) T = R s Q s tr = R s Q s Q T s D j =1 s 1 ^ Q s trq sp j ) ) = R s Q s tr Q j + trp jq j 1 ) Q j 1 ) Q j 1 trq T s Q j )+ trp jq j 1 ) Q j 1 trqt s Q j 1 ) Ps+1 trq T + Ps+1 s+1q j )=tr T Ps+1 + Ps+1 = tr T Q T s =0. trp )T s+1q s ) Q s Q s Q j P j + P T j ) Q j trp s+1q s ) Q s trq T s Q j ) Ps+1 Q = tr j +P s+1 Q j ) T ) = trp s+1 Q j )=trq j P s+1 ). ΞQ/ trr T s+1 R j)=0trr T s+1 R j+1) =0 V) 1 ^ trq T s+1 Q j)=trq j P s+1 )= Q j R j trr T j R s+1 ) trr T j+1 R s+1) = Q j R j trr T s+1 R j ) trr T s+1 R j+1) =0. U$ D k = s +14)off.. CiAMy V) 1/0w>. /fi 3. f X fl! I 3L o trx X k )Q k = R k k =1. 7) ) ψ. Z CiAMw>. k =1h b X X 1 ) T = X X 1 o trx X 1 )Q 1 =tr X X 1 ) P 1 + P1 T = trx X 1 )P 1 = trx X 1 )A T R 1 B T +trx X 1 )C T R 1 D T = trbr1 T AX X 1) + trdr1 T CX X 1)

5 4 I m: χstffi AXB + CXD = F Eρ»4<*ΦN 417 = trr1 T AX X 1 )B+trR1 T CX X 1 )D = trr1 T F AX 1B CX 1 D) = trr1 T R 1)= R 1 Kflr trx X 1 )Q 1 = R 1. 8) Ωf k = s h 7) ff.. Ufl trx X s+1 )Q s =tr X X s R s Q s Q s)q s = R s R s Q s trqt s Q s M 1 ^ trx X s+1 )Q s+1 =tr X Xs+1 )P = tr s+1 +X X s+1 )P s+1 ) T = trx X s+1 )P s+1. a 8) 3w>ρWΠ 1/ Ps+1 + Ps+1 T X X s+1 ) trp ) s+1q s ) Q s Q s trx X s+1 )Q s+1 =trx X s+1 )P s+1 = R s+1. trp s+1q s ) Q s tr X X s+1 )Q s U$ CiAMyV) 3 1w.»fi 1. Ω=! DQ3ψmffir X 1 SR n n! I 3 %Nμk^ + ;)1/. ψ. b R i 0i =1 mp o V) 3 ^ Q i 0i =1 M 1 %NΞ " X mp+1 R mp+1. V) ^ trrmp+1 T R i) = 0 i =1 mp N trri T R j)=0i =1 mp i j. U$ R 1 R R mp rffir'fi R m p 3LΨv z %H R mp+1 =0 X mp+1 r! I 3L.! I.^h %Nw>! I3 %NμkΩG οk t 0 t 0 = minmp n )) 1/. qjd b n mp n R i 0i =1 ;) M Q i 0i =1 n Q %NΞ X n +1 R n +1 Q n +1. ap<3w>3.π 1/ Q n +1 =0N R n +1 =0% H X n +1 flr! I 3L. %=) 1 r^p1/<3ß7. 'χ 1.! I.^3χJ»ffirl M 1 ~&l?vu k l1 R k 0HQ k =0. ψ. χw= b&l?vu k l1 R k 0H Q k =0 V) 3 y! I.^. ΩJ= b! I.^ odω^3vu i ^ R i 0. bdω^3vu Q i 0 =) 1 3w>kfly! I ^ d.^=9f. U$ ΩX&l?vu k l1 R k 0H Q k =0. /fi 4. ffirsfl 1).^Q ffirsflψ { AXB + CXD = F B T XA T + D T XC T = F T 9).^. ψ. bffirsfl 1) ^L X 0 SR n X T 0 = X 0 AX 0 B + CX 0 D = F B T X 0 A T + D T X 0 C T = B T X T 0 AT + D T X T 0 CT = F T. U$ X 0 KrSflΨ 9) 3L.

6 418 Π Φ D 010 D.O6 bffirsflψ 9) ^L X R n n l1 A XB + C XD = F B T XA T + D T XC T = F T Y ˆX = X + X ˆX SR n n Q A ˆXB + C ˆXD = A X + X T B + C X + X T D = A XB + C XD + A X T B + C X T D = 1 F + 1 F T ) T = F. Kflr ffirsfl 1) K^L ˆX. U$ ffirsfl 1) 3% =5ffbffirSflΨ 9) 3% =. %V) 4 3w>%y ffirsfl AXB + CXD = F 3Dß KrffirSflΨ 9) 3. ffirsflψ 9) Ω^3 3~ofl ŚE ffirsfl 1) 3Ω^ 3~ofl S S E ŚE. /fi 5 7. f.^-=sflψ My = b 3L y 0 RM T y 0 fl$.^-=sfl ΨfiL3 4Q.»fi. f! I r.^3 buψm;)ffir X 1 = A T H T B T + BHA + C T H T D T + DHC J~ H r R p m ~3Qffir flffl6 Y X 1 =0 R n n o M 1 μk^+ ;)%N1/! I fil3 4Q. ψ. M 1 n=) 1 y by X 1 = A T H T B T + BHA + C T H T D T + DHC J~ H r R p m ~Qffir oßk^+ ;)%1/! I 3 X Q X %NΠffipff X = A T Y T B T + BY A + C T Y T D T + DY C. V) 4 3w>y ffirsfl AXB + CXD = F 3Dß KrffirSflΨ 9) 3. U $ Jw> X r! I 3 4Q }?w> X rffirsflψ 9) 3 4Q %. vecx) =x vecx )=x vecy T )=y 1 vecy )=y vecf )=c 1 vecf T )=c o ffirsflψ 9) 5ffb`-=SflΨ B T A + D T C) ΞQ/ A B T + C D T ) y x = x =vecx )=veca T Y T B T + C T Y T D T + BY A + DY C) =B A T )y 1 +D C T )y 1 +A T B)y +C T D)y = B A T + D C T ) A T B + C T y 1 D) y T T B T A + D T C y 1 = R B T A + D T C A B T + C D T A B T + C D T c 1 c. 10) V) 5 y x r-=sflψ 10) 3 4Q. a vec ±rοf3 U$ X rffir SflΨ 9) fil3 4Q %H X Kr! I 3fiL 4Q. 3. *& II ß DQ^=3 X S E SR n n bdßffirdodßffir.tv o X X 0 = X X 0 + X0 T ) X 0 X0 T = X X 0 + X0 T + X 0 X0 T U$ flsfimfl %Ωf! II ~^=3 X 0 SR n n..

7 4 I m: χstffi AXB + CXD = F Eρ»4<*ΦN 419! I.^h! I 3 ~ S E V' D X S E *X AXB + CXD = F AX X 0 )B + CX X 0 )D = F AX 0 B CX 0 D. Y X = X X 0 F = F AX 0 B CX 0 D o! II 5ffbS.^ffirSfl A XB + C XD = F 3 4Q Dß X. `ψ M 1 Uψm;)ffir X 1 = A T H T B T + BHA + C T H T D T + DHC J~ H r R p m ~Qffir ypbflffl6y X 1 =0 R n n %1/ffirSfl A XB + C XD = F 3 fil 4Q Dß X %HKfl1/0! II 3 X Q X %ffipff X = X + X "3ffi5 N±@rμkff8 M χffil Matlab7.1 dj< Ω1 jwj0z M3^6=. fl 1. f A = C = B = D = F = I) S.^ffirSfl AXB + CXD = F 3Dß J 4Q Dß. II) ffirsfl AXB + CXD = F 3Ω^Dß ~ofl S E UU X 0 = S X S E l1 X X 0 = min X S E X X 0.

8 40 Π Φ D 010 D I) WZ M 1 %1/ffirSfl AXB + CXD = F Dß n 4Q Dß. b Ξ %»3Y l! 3;)kfl~ c3 R i i =1 ) L x5b3. U$ UχW43 ε H` ε =1.0e 010Matlab fla:u j~*p QΛr ) R k <ε=1.0e 010 h fl ;) t X k flffirsfl AXB + CXD = F 3L. ULψm;)ffir X 1 SR n n q+u X 1 = ;) M X 30 = R 30 =.1319e 01 <ε X 30 = U$ %1ffirSfl AXB + CXD = F 3LDß X 30. buψmffir X 1 = A T H T B T + BHA + C T H T D T + DHC J~ H= X 1 = %;)"ffirsfl AXB + CXD = F 3L 4Q Dß X = X 39 = Q R 39 =.8805e 011 <ε X 39 = bu X 1 =0K1/ffirSfl AXB + CXD = F 3 4Q Dß X = X 9 = Q R 9 =6.0085e 011 <ε X 9 = II) S X 0 l S E ~3ΩΦΦμh 4 X = X X 0 F = F AX0 B CX 0 D Uψm; )ffir X =01/ffirSfl A XB + C XD = F 3 4Q Dß X Q

9 4 I m: χstffi AXB + CXD = F Eρ»4<*ΦN X = X 9 = R 9 =6.399e 011 <ε X 9 = %H1/l S E ~D^=ffir X 0 3ΩΦΦμ ˆX Q ˆX = X + X 0 = fl. f A = C = B = D = F = =) 1 nß7 1 y `j;)kfl~^ R k =0offirSfl AXB + CXD = F ^Dß X k ; `j&l R k 0H Q k =0oSfl$Dß. bξ %»3Y l! 3;)k fl~ R i Q i i =1 ) L x5b3. L^=r43v ε H` ε =1.0e 007 R k <εyp R k >εh Q k <εh o;). Uψm;)ffir X 1 =0WZ±χ3; ) M 1/ R 11 = Q 11 =.407e 008 <ε. U$ ffirsfl AXB + CXD = F $Dß. Y5: MatlabeflA)8 function Solution=SFABCDFX0X1H\varepsilon) F=F-A*X0*B+C*X0*D); X1=A *H *B +B*H*A+C *H *D +D*H*C;

10 4 Π Φ D 010 D R1=F-A*X1*B+C*X1*D); P1=A *R1*B +C *R1*D ; Q1=P1+P1 )/; k=1; while tracer1 *R1)>\varepsilon trr1=tracer1 *R1); trq1=traceq1 *Q1); if traceq1 *Q1)<\varepsilon break end k=k+1 X=X1+traceR1 * R1)/traceQ1 *Q1))*Q1; R=F-A*X*B+C*X*D); P=A *R*B +C *R*D ; Q=P+P )/-tracep*q1)/traceq1 *Q1))*Q1; X1=X; R1=R; Q1=Q; trr1=tracer1 *R1); sqrttrr1) trq1=traceq1 *Q1); sqrt trq1) trx1=tracex1 *X1); sqrttrx1) end X1 out=x1+x0 times=k ffl ρ + 1 Roger A Horn Charles R. Johnson. Topics in Matrix AnalysisM. Ξο: Z=9#Λe Gene H Golub Charles F Van Loan. Matrix ComputationsM. Baltimore: The Johns Hpkins University Press fi u. * ffit P" M. qb: qb$dλz#λe Charles F Van Loan. Generalizing the singular value decompositionj. SIAM J. Numer Anal ): Moody T Chu Robert E Funderlic Gene H Golub. On a variational formulation of the generalized singular value decompositionj. SIAM J. Matrix Anal. Appl ): Gene H Golub Zha Hongyuan. Perturbation analysis of the canonical correlations of marix pairsj. Linear Algebra Appl ): GG:. T»h~χsTffi KffΨΨν4<*N4Ifi D. νc: sb'd Peng Zhenyun Peng Yaxin. An efficient iterative method for solving the matrix equation A B + CY D = EJ. Numer Linear Algebra Appl ): Wang Minghui Cheng Xuehan Wei Musheng. Iterative algorithms for solving the matrix equation A B + CX T D = EJ. Appl. Math. Comput. 187): 6-69.

An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB =C

An 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 information

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

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 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 information

The 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 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 information

An Iterative Method for the Least-Squares Minimum-Norm Symmetric Solution

An 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 information

The reflexive and anti-reflexive solutions of the matrix equation A H XB =C

The 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 information

An error estimate for matrix equations

An error estimate for matrix equations Applied Numerical Mathematics 50 (2004) 395 407 www.elsevier.com/locate/apnum An error estimate for matrix equations Yang Cao, Linda Petzold 1 Department of Computer Science, University of California,

More information

Approximate Low Rank Solution of Generalized Lyapunov Matrix Equations via Proper Orthogonal Decomposition

Approximate Low Rank Solution of Generalized Lyapunov Matrix Equations via Proper Orthogonal Decomposition Applied Mathematical Sciences, Vol. 4, 2010, no. 1, 21-30 Approximate Low Rank Solution of Generalized Lyapunov Matrix Equations via Proper Orthogonal Decomposition Amer Kaabi Department of Basic Science

More information

On Expected Gaussian Random Determinants

On Expected Gaussian Random Determinants On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose

More information

Positive Solution to a Generalized Lyapunov Equation via a Coupled Fixed Point Theorem in a Metric Space Endowed With a Partial Order

Positive Solution to a Generalized Lyapunov Equation via a Coupled Fixed Point Theorem in a Metric Space Endowed With a Partial Order Filomat 29:8 2015, 1831 1837 DOI 10.2298/FIL1508831B Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Positive Solution to a Generalized

More information

Journal of Computational and Applied Mathematics. New matrix iterative methods for constraint solutions of the matrix

Journal 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 information

A Note on Simple Nonzero Finite Generalized Singular Values

A 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 information

Computational Multilinear Algebra

Computational Multilinear Algebra Computational Multilinear Algebra Charles F. Van Loan Supported in part by the NSF contract CCR-9901988. Involves Working With Kronecker Products b 11 b 12 b 21 b 22 c 11 c 12 c 13 c 21 c 22 c 23 c 31

More information

On the solving of matrix equation of Sylvester type

On the solving of matrix equation of Sylvester type Computational Methods for Differential Equations http://cmde.tabrizu.ac.ir Vol. 7, No. 1, 2019, pp. 96-104 On the solving of matrix equation of Sylvester type Fikret Ahmadali Aliev Institute of Applied

More information

AN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS

AN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS AN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS DAVOD KHOJASTEH SALKUYEH and FATEMEH PANJEH ALI BEIK Communicated by the former editorial board Let A : R m n R m n be a symmetric

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 4

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 4 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 4 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 12, 2012 Andre Tkacenko

More information

Solvability of Linear Matrix Equations in a Symmetric Matrix Variable

Solvability of Linear Matrix Equations in a Symmetric Matrix Variable Solvability of Linear Matrix Equations in a Symmetric Matrix Variable Maurcio C. de Oliveira J. William Helton Abstract We study the solvability of generalized linear matrix equations of the Lyapunov type

More information

The Lanczos and conjugate gradient algorithms

The 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 information

Research Article Least Squares Pure Imaginary Solution and Real Solution of the Quaternion Matrix Equation AXB + CXD = E with the Least Norm

Research Article Least Squares Pure Imaginary Solution and Real Solution of the Quaternion Matrix Equation AXB + CXD = E with the Least Norm Applied Mathematics, Article ID 857081, 9 pages http://dx.doi.org/10.1155/014/857081 Research Article Least Squares Pure Imaginary Solution and Real Solution of the Quaternion Matrix Equation AXB + CXD

More information

Two special kinds of least squares solutions for the quaternion matrix equation AXB+CXD=E

Two special kinds of least squares solutions for the quaternion matrix equation AXB+CXD=E Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 18 2012 Two special kinds of least squares solutions for the quaternion matrix equation AXB+CXD=E Shi-fang Yuan ysf301@yahoocomcn

More information

ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS

ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS Fatemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan,

More information

Structured Condition Numbers of Symmetric Algebraic Riccati Equations

Structured Condition Numbers of Symmetric Algebraic Riccati Equations Proceedings of the 2 nd International Conference of Control Dynamic Systems and Robotics Ottawa Ontario Canada May 7-8 2015 Paper No. 183 Structured Condition Numbers of Symmetric Algebraic Riccati Equations

More information

Key words. conjugate gradients, normwise backward error, incremental norm estimation.

Key words. conjugate gradients, normwise backward error, incremental norm estimation. Proceedings of ALGORITMY 2016 pp. 323 332 ON ERROR ESTIMATION IN THE CONJUGATE GRADIENT METHOD: NORMWISE BACKWARD ERROR PETR TICHÝ Abstract. Using an idea of Duff and Vömel [BIT, 42 (2002), pp. 300 322

More information

arxiv: v1 [math.na] 13 Mar 2019

arxiv: v1 [math.na] 13 Mar 2019 Relation between the T-congruence Sylvester equation and the generalized Sylvester equation Yuki Satake, Masaya Oozawa, Tomohiro Sogabe Yuto Miyatake, Tomoya Kemmochi, Shao-Liang Zhang arxiv:1903.05360v1

More information

An iterative solution to coupled quaternion matrix equations

An iterative solution to coupled quaternion matrix equations Filomat 6:4 (01) 809 86 DOI 10.98/FIL104809S Published by Faculty of Sciences and Mathematics University of Niš Serbia Available at: http://www.pmf.ni.ac.rs/filomat An iterative solution to coupled quaternion

More information

Two Results About The Matrix Exponential

Two 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 information

Research Article Finite Iterative Algorithm for Solving a Complex of Conjugate and Transpose Matrix Equation

Research Article Finite Iterative Algorithm for Solving a Complex of Conjugate and Transpose Matrix Equation indawi Publishing Corporation Discrete Mathematics Volume 013, Article ID 17063, 13 pages http://dx.doi.org/10.1155/013/17063 Research Article Finite Iterative Algorithm for Solving a Complex of Conjugate

More information

A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem

A 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 information

KRONECKER PRODUCT AND LINEAR MATRIX EQUATIONS

KRONECKER PRODUCT AND LINEAR MATRIX EQUATIONS Proceedings of the Second International Conference on Nonlinear Systems (Bulletin of the Marathwada Mathematical Society Vol 8, No 2, December 27, Pages 78 9) KRONECKER PRODUCT AND LINEAR MATRIX EQUATIONS

More information

Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications

Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications 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 information

Cheng Soon Ong & Christian Walder. Canberra February June 2017

Cheng Soon Ong & Christian Walder. Canberra February June 2017 Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2017 (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 141 Part III

More information

Research Article Constrained Solutions of a System of Matrix Equations

Research 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 information

1. Structured representation of high-order tensors revisited. 2. Multi-linear algebra (MLA) with Kronecker-product data.

1. Structured representation of high-order tensors revisited. 2. Multi-linear algebra (MLA) with Kronecker-product data. Lect. 4. Toward MLA in tensor-product formats B. Khoromskij, Leipzig 2007(L4) 1 Contents of Lecture 4 1. Structured representation of high-order tensors revisited. - Tucker model. - Canonical (PARAFAC)

More information

ELA 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

ELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this

More information

Lecture 4. Tensor-Related Singular Value Decompositions. Charles F. Van Loan

Lecture 4. Tensor-Related Singular Value Decompositions. Charles F. Van Loan From Matrix to Tensor: The Transition to Numerical Multilinear Algebra Lecture 4. Tensor-Related Singular Value Decompositions Charles F. Van Loan Cornell University The Gene Golub SIAM Summer School 2010

More information

1. Introduction. We consider linear discrete ill-posed problems of the form

1. Introduction. We consider linear discrete ill-posed problems of the form AN EXTRAPOLATED TSVD METHOD FOR LINEAR DISCRETE ILL-POSED PROBLEMS WITH KRONECKER STRUCTURE A. BOUHAMIDI, K. JBILOU, L. REICHEL, AND H. SADOK Abstract. This paper describes a new numerical method for the

More information

ELA

ELA 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 information

Analytical 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 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 information

H 2 optimal model reduction - Wilson s conditions for the cross-gramian

H 2 optimal model reduction - Wilson s conditions for the cross-gramian H 2 optimal model reduction - Wilson s conditions for the cross-gramian Ha Binh Minh a, Carles Batlle b a School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Dai

More information

CO 602/CM 740: Fundamentals of Optimization Problem Set 7

CO 602/CM 740: Fundamentals of Optimization Problem Set 7 CO 602/CM 740: Fundamentals of Optimization Problem Set 7 Instructor: Henry Wolkowicz Fall 2016. Handed out: Sunday 2016-Nov-20. Due: Friday 2016-Nov-25 by 3PM. Contents 1 Derivatives 1 2 Matrix Rounding

More information

ENGG5781 Matrix Analysis and Computations Lecture 9: Kronecker Product

ENGG5781 Matrix Analysis and Computations Lecture 9: Kronecker Product ENGG5781 Matrix Analysis and Computations Lecture 9: Kronecker Product Wing-Kin (Ken) Ma 2017 2018 Term 2 Department of Electronic Engineering The Chinese University of Hong Kong Kronecker product and

More information

arxiv: v1 [math.na] 1 Sep 2018

arxiv: 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 information

arxiv: v1 [math.na] 26 Nov 2018

arxiv: 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 information

The Skew-Symmetric Ortho-Symmetric Solutions of the Matrix Equations A XA = D

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 information

Research Article Eigenvector-Free Solutions to the Matrix Equation AXB H =E with Two Special Constraints

Research 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 information

Second-Order Cone Program (SOCP) Detection and Transformation Algorithms for Optimization Software

Second-Order Cone Program (SOCP) Detection and Transformation Algorithms for Optimization Software and Second-Order Cone Program () and Algorithms for Optimization Software Jared Erickson JaredErickson2012@u.northwestern.edu Robert 4er@northwestern.edu Northwestern University INFORMS Annual Meeting,

More information

Re-nnd solutions of the matrix equation AXB = C

Re-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 information

Total least squares. Gérard MEURANT. October, 2008

Total least squares. Gérard MEURANT. October, 2008 Total least squares Gérard MEURANT October, 2008 1 Introduction to total least squares 2 Approximation of the TLS secular equation 3 Numerical experiments Introduction to total least squares In least squares

More information

Group inverse for the block matrix with two identical subblocks over skew fields

Group inverse for the block matrix with two identical subblocks over skew fields Electronic Journal of Linear Algebra Volume 21 Volume 21 2010 Article 7 2010 Group inverse for the block matrix with two identical subblocks over skew fields Jiemei Zhao Changjiang Bu Follow this and additional

More information

AN 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 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 information

Computing Real Logarithm of a Real Matrix

Computing Real Logarithm of a Real Matrix International Journal of Algebra, Vol 2, 2008, no 3, 131-142 Computing Real Logarithm of a Real Matrix Nagwa Sherif and Ehab Morsy 1 Department of Mathematics, Faculty of Science Suez Canal University,

More information

The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix

The 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 information

arxiv: v1 [math.ra] 27 Jul 2013

arxiv: v1 [math.ra] 27 Jul 2013 Additive and product properties of Drazin inverses of elements in a ring arxiv:1307.7229v1 [math.ra] 27 Jul 2013 Huihui Zhu, Jianlong Chen Abstract: We study the Drazin inverses of the sum and product

More information

The Drazin inverses of products and differences of orthogonal projections

The Drazin inverses of products and differences of orthogonal projections J Math Anal Appl 335 7 64 71 wwwelseviercom/locate/jmaa The Drazin inverses of products and differences of orthogonal projections Chun Yuan Deng School of Mathematics Science, South China Normal University,

More information

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

THE 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 information

MATH 387 ASSIGNMENT 2

MATH 387 ASSIGNMENT 2 MATH 387 ASSIGMET 2 SAMPLE SOLUTIOS BY IBRAHIM AL BALUSHI Problem 4 A matrix A ra ik s P R nˆn is called symmetric if a ik a ki for all i, k, and is called positive definite if x T Ax ě 0 for all x P R

More information

The skew-symmetric orthogonal solutions of the matrix equation AX = B

The 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 information

On the conservative multivariate multiple comparison procedure of correlated mean vectors with a control

On the conservative multivariate multiple comparison procedure of correlated mean vectors with a control On the conservative multivariate multiple comparison procedure of correlated mean vectors with a control Takahiro Nishiyama a a Department of Mathematical Information Science, Tokyo University of Science,

More information

Contour integral solutions of Sylvester-type matrix equations

Contour integral solutions of Sylvester-type matrix equations Contour integral solutions of Sylvester-type matrix equations Harald K. Wimmer Mathematisches Institut, Universität Würzburg, 97074 Würzburg, Germany Abstract The linear matrix equations AXB CXD = E, AX

More information

On the Solution of Constrained and Weighted Linear Least Squares Problems

On the Solution of Constrained and Weighted Linear Least Squares Problems International Mathematical Forum, 1, 2006, no. 22, 1067-1076 On the Solution of Constrained and Weighted Linear Least Squares Problems Mohammedi R. Abdel-Aziz 1 Department of Mathematics and Computer Science

More information

arxiv: v3 [math.ra] 22 Aug 2014

arxiv: v3 [math.ra] 22 Aug 2014 arxiv:1407.0331v3 [math.ra] 22 Aug 2014 Positivity of Partitioned Hermitian Matrices with Unitarily Invariant Norms Abstract Chi-Kwong Li a, Fuzhen Zhang b a Department of Mathematics, College of William

More information

The Hermitian R-symmetric Solutions of the Matrix Equation AXA = B

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 information

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY

OPTIMAL 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 information

Some inequalities for unitarily invariant norms of matrices

Some 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 information

Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system

Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Advances in Computational Mathematics 7 (1997) 295 31 295 Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Mihail Konstantinov a and Vera

More information

MINIMUM NORM LEAST-SQUARES SOLUTION TO GENERAL COMPLEX COUPLED LINEAR MATRIX EQUATIONS VIA ITERATION

MINIMUM NORM LEAST-SQUARES SOLUTION TO GENERAL COMPLEX COUPLED LINEAR MATRIX EQUATIONS VIA ITERATION MINIMUM NORM LEAST-SQUARES SOLUTION TO GENERAL COMPLEX COUPLED LINEAR MATRIX EQUATIONS VIA ITERATION Davod Khojasteh Salkuyeh and Fatemeh Panjeh Ali Beik Faculty of Mathematical Sciences University of

More information

arxiv: v1 [math.ra] 25 Jul 2013

arxiv: v1 [math.ra] 25 Jul 2013 Representations of the Drazin inverse involving idempotents in a ring Huihui Zhu, Jianlong Chen arxiv:1307.6623v1 [math.ra] 25 Jul 2013 Abstract: We present some formulae for the Drazin inverse of difference

More information

We first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix

We 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 information

arxiv: v1 [math.dg] 1 Jul 2014

arxiv: v1 [math.dg] 1 Jul 2014 Constrained matrix Li-Yau-Hamilton estimates on Kähler manifolds arxiv:1407.0099v1 [math.dg] 1 Jul 014 Xin-An Ren Sha Yao Li-Ju Shen Guang-Ying Zhang Department of Mathematics, China University of Mining

More information

Multiplicative Perturbation Bounds of the Group Inverse and Oblique Projection

Multiplicative 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 information

On the -Sylvester Equation AX ± X B = C

On the -Sylvester Equation AX ± X B = C Department of Applied Mathematics National Chiao Tung University, Taiwan A joint work with E. K.-W. Chu and W.-W. Lin Oct., 20, 2008 Outline 1 Introduction 2 -Sylvester Equation 3 Numerical Examples 4

More information

Formulas for the Drazin Inverse of Matrices over Skew Fields

Formulas for the Drazin Inverse of Matrices over Skew Fields Filomat 30:12 2016 3377 3388 DOI 102298/FIL1612377S Published by Faculty of Sciences and Mathematics University of Niš Serbia Available at: http://wwwpmfniacrs/filomat Formulas for the Drazin Inverse of

More information

Math 515 Fall, 2008 Homework 2, due Friday, September 26.

Math 515 Fall, 2008 Homework 2, due Friday, September 26. Math 515 Fall, 2008 Homework 2, due Friday, September 26 In this assignment you will write efficient MATLAB codes to solve least squares problems involving block structured matrices known as Kronecker

More information

Lecture 2. Tensor Unfoldings. Charles F. Van Loan

Lecture 2. Tensor Unfoldings. Charles F. Van Loan From Matrix to Tensor: The Transition to Numerical Multilinear Algebra Lecture 2. Tensor Unfoldings Charles F. Van Loan Cornell University The Gene Golub SIAM Summer School 2010 Selva di Fasano, Brindisi,

More information

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES Fatemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr

More information

The Moore-Penrose inverse of differences and products of projectors in a ring with involution

The Moore-Penrose inverse of differences and products of projectors in a ring with involution The Moore-Penrose inverse of differences and products of projectors in a ring with involution Huihui ZHU [1], Jianlong CHEN [1], Pedro PATRÍCIO [2] Abstract: In this paper, we study the Moore-Penrose inverses

More information

NOTES ON NEWLANDER-NIRENBERG THEOREM XU WANG

NOTES ON NEWLANDER-NIRENBERG THEOREM XU WANG NOTES ON NEWLANDER-NIRENBERG THEOREM XU WANG Abstract. In this short note we shall recall the classical Newler-Nirenberg theorem its vector bundle version. We shall also recall an L 2 -Hörmer-proof given

More information

The Global Krylov subspace methods and Tikhonov regularization for image restoration

The Global Krylov subspace methods and Tikhonov regularization for image restoration The Global Krylov subspace methods and Tikhonov regularization for image restoration Abderrahman BOUHAMIDI (joint work with Khalide Jbilou) Université du Littoral Côte d Opale LMPA, CALAIS-FRANCE bouhamidi@lmpa.univ-littoral.fr

More information

THE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1) 1. Introduction

THE 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 information

Inequalities Involving Khatri-Rao Products of Positive Semi-definite Matrices

Inequalities 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 information

ACI-matrices all of whose completions have the same rank

ACI-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 information

Symmetric inverse generalized eigenvalue problem with submatrix constraints in structural dynamic model updating

Symmetric 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 information

Reduced Synchronization Overhead on. December 3, Abstract. The standard formulation of the conjugate gradient algorithm involves

Reduced Synchronization Overhead on. December 3, Abstract. The standard formulation of the conjugate gradient algorithm involves Lapack Working Note 56 Conjugate Gradient Algorithms with Reduced Synchronization Overhead on Distributed Memory Multiprocessors E. F. D'Azevedo y, V.L. Eijkhout z, C. H. Romine y December 3, 1999 Abstract

More information

A Continuation Approach to a Quadratic Matrix Equation

A Continuation Approach to a Quadratic Matrix Equation A Continuation Approach to a Quadratic Matrix Equation Nils Wagner nwagner@mecha.uni-stuttgart.de Institut A für Mechanik, Universität Stuttgart GAMM Workshop Applied and Numerical Linear Algebra September

More information

Matrix Algebra, Class Notes (part 2) by Hrishikesh D. Vinod Copyright 1998 by Prof. H. D. Vinod, Fordham University, New York. All rights reserved.

Matrix Algebra, Class Notes (part 2) by Hrishikesh D. Vinod Copyright 1998 by Prof. H. D. Vinod, Fordham University, New York. All rights reserved. Matrix Algebra, Class Notes (part 2) by Hrishikesh D. Vinod Copyright 1998 by Prof. H. D. Vinod, Fordham University, New York. All rights reserved. 1 Converting Matrices Into (Long) Vectors Convention:

More information

PERTURBATION ANAYSIS FOR THE MATRIX EQUATION X = I A X 1 A + B X 1 B. Hosoo Lee

PERTURBATION ANAYSIS FOR THE MATRIX EQUATION X = I A X 1 A + B X 1 B. Hosoo Lee Korean J. Math. 22 (214), No. 1, pp. 123 131 http://dx.doi.org/1.11568/jm.214.22.1.123 PERTRBATION ANAYSIS FOR THE MATRIX EQATION X = I A X 1 A + B X 1 B Hosoo Lee Abstract. The purpose of this paper is

More information

A 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 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 information

ON SOLVING MATRIX EQUATIONS USING THE VEC OPERATOR"'" BU-620-M by July) 19T(

ON SOLVING MATRIX EQUATIONS USING THE VEC OPERATOR' BU-620-M by July) 19T( ON SOLVING MATRIX EQUATIONS USING THE VEC OPERATOR"'" BU-620-M by July) 19T( -.-.. H. V. Henderson 1, s. R. Searle and J. B. Kadane 2 Biometrics Unit, Cornell University, Ithaca, New Yor 1. Introduction

More information

An algorithm for symmetric generalized inverse eigenvalue problems

An 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 information

Journal of Computational and Applied Mathematics

Journal of Computational and Applied Mathematics Journal of Computational and Applied Mathematics 236 (212) 3218 3227 Contents lists available at SciVerse ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam

More information

From Matrix to Tensor. Charles F. Van Loan

From Matrix to Tensor. Charles F. Van Loan From Matrix to Tensor Charles F. Van Loan Department of Computer Science January 28, 2016 From Matrix to Tensor From Tensor To Matrix 1 / 68 What is a Tensor? Instead of just A(i, j) it s A(i, j, k) or

More information

On condition numbers for the canonical generalized polar decompostion of real matrices

On condition numbers for the canonical generalized polar decompostion of real matrices Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 57 2013 On condition numbers for the canonical generalized polar decompostion of real matrices Ze-Jia Xie xiezejia2012@gmail.com

More information

A Least Squares Formulation for Canonical Correlation Analysis

A Least Squares Formulation for Canonical Correlation Analysis A Least Squares Formulation for Canonical Correlation Analysis Liang Sun, Shuiwang Ji, and Jieping Ye Department of Computer Science and Engineering Arizona State University Motivation Canonical Correlation

More information

Diagonal and Monomial Solutions of the Matrix Equation AXB = C

Diagonal 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 information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematics http://jipam.vu.edu.au/ Volume 7, Issue 1, Article 34, 2006 MATRIX EQUALITIES AND INEQUALITIES INVOLVING KHATRI-RAO AND TRACY-SINGH SUMS ZEYAD AL

More information

and Union One end Inseparable." LOWELL. MICHIGAN. WEDNESDAY. JUNE HUMPHBHT'S HOMEOPATHIC SPECIFICS

and Union One end Inseparable. LOWELL. MICHIGAN. WEDNESDAY. JUNE HUMPHBHT'S HOMEOPATHIC SPECIFICS Y J B B BD Y DDY 8 B F B F x F D > q q j 8 8 J 4 8 8 24 B j 88 4 4 4 8 q 8 bb B 6 B q B b b b B 4 B D J B B b B

More information

Additional Mathematics Lines and circles

Additional Mathematics Lines and circles Additional Mathematics Lines and circles Topic assessment 1 The points A and B have coordinates ( ) and (4 respectively. Calculate (i) The gradient of the line AB [1] The length of the line AB [] (iii)

More information

The symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation

The 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 information

The symmetric linear matrix equation

The symmetric linear matrix equation Electronic Journal of Linear Algebra Volume 9 Volume 9 (00) Article 8 00 The symmetric linear matrix equation Andre CM Ran Martine CB Reurings mcreurin@csvunl Follow this and additional works at: http://repositoryuwyoedu/ela

More information

Multiple eigenvalues

Multiple eigenvalues Multiple eigenvalues arxiv:0711.3948v1 [math.na] 6 Nov 007 Joseph B. Keller Departments of Mathematics and Mechanical Engineering Stanford University Stanford, CA 94305-15 June 4, 007 Abstract The dimensions

More information

Second-order approximation of dynamic models without the use of tensors

Second-order approximation of dynamic models without the use of tensors Second-order approximation of dynamic models without the use of tensors Paul Klein a, a University of Western Ontario First draft: May 17, 2005 This version: January 24, 2006 Abstract Several approaches

More information