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
|
|
- Frank Shields
- 5 years ago
- Views:
Transcription
1 The Symmetric Antipersymmetric Soutions of the Matrix Equation A 1 X 1 B 1 + A 2 X 2 B 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 antipersymmetric matrix if a ij a ji a n j+1n i+1 for a 1 i j n Peng gave the bisymmetric soutions of the matrix equation A 1X 1B 1+A 2X 2B 2+ +A X B C where [X 1 X 2 X ] is a rea matrices group Based on this work an adjusted iterative method is proposed to find the symmetric antipersymmetric soutions of the above matrix equation When the matrix equation is consistent for any initia symmetric antipersymmetric matrix group [X 1 X 2 X ] the east norm symmetric antipersymmetric soution group can be obtained In addition for a given symmetric antipersymmetric matrix group [ X 1 X 2 X ] the optima approximation symmetric antipersymmetric soution group can be obtained Given numerica exampes show that the iterative method is efficient Index Terms Iterative method Matrix equation Symmetric antipersymmetric Least-norm soution group Optima approximation soution I INTRODUCTION AMatrix A (a ij ) R n n is said to be symmetric antipersymmetric matrix if a ij a ji a n j+1n i+1 for a 1 i j n Let R m n SR n n SA n denote the set of m n rea matrices n n rea symmetric matrices n n rea symmetric antipersymmetric matrices respectivey S n (S n (e n e n 1 e 1 )) denotes the n n reverse unit matrix (e i denotes ith coumn of n n unit matrix) The superscripts T represents the transpose of a matrix In space R m n we define inner products as: < A B > trace(b T A) for a A B R m n Then the norm of A generated by this inner product is Frobenius norm denoted by A Probem I (See [1]) Given A i R p ni B i R ni q (i 1 2 ) C R p q find matrix group [X 1 X 2 X ] with X i SA ni i 1 2 such that A 1 X 1 B 1 + A 2 X 2 B A X B C (1) Probem II (See [2]) When Probem I is consistent et S E denote its soution group set for given matrix group [ X 1 X 2 X ] with X i SA ni (i 1 2 ) find Manuscript received 19 Oct 2016; revised 25 Nov 2016 This work was supported by the Nationa Natura Science Foundation of China under Grant Nos Liaoning Province Nature Science Foundation under Grant Nos the Fundamenta Research Funds for the Centra Universities under Grant Nos Y Zhang is with the Department of Mathematics Daian Maritime University Daian Liaoning China e-mai: zhgyg77@sinacom [ X 1 X 2 X ] S E with X i SA ni such that X 1 X X 2 X X X 2 min [X 1X 2X ] S E [ X 1 X X 2 X X X 2 ] (2) In [3] an iterative method is constructed to find the bisymmetric soutions of matrix equation A 1 X 1 B 1 + A 2 X 2 B A X B C where [X 1 X 2 X ] is rea matrices group In this paper by adjusting the agorithm in [3] we can find symmetric antipersymmetric soutions of the above matrix equation In eectricity contro theory processing of digita signas symmetric antipersymmetric matrices have wide appication II ITERATIVE METHODS FOR SOLVING PROBLEM I AND II Firsty we introduce some emmas used to sove Probem I Lemma 21(see [4]) A matrix X SA n if ony if X X T S n XS n Lemma 22 Suppose that a matrix X SR n n then X S n XS n SA n Lemma 23 Suppose that A R n n X SA n then Proof < A X > 1 4 [A + AT S n (A + A T )S n ] X 1 [A + 4 AT S n(a + A T )S n] X 1 [ A X + 4 AT X S nas n X S na T S n X ] 1 [ A X + 4 AT X T A S nxs n A T S nxs n ] A X (3) Next by adjusting the method in [3] an iterative method to obtain the symmetric antipersymmetric soution groups of Probem I Agorithm 21 Step 1 Input matrices A i R p ni B i R ni q X i SA ni ni (i 1 2 ) C R p q ; Step 2 Cacuate R 0 C i1 A ix i B i ; Y 0i A T i R 0Bi T i 1 2 ; P 0i 1 4 [Y 0i + Y0i T S n i Y 0i S ni S ni Y0i T S n i ]; i 1 2 ; k:0; Step 3 If R k 0 then stop; ese k : k + 1; Step 4 Cacuate X (k) i X (k 1) i + R k 1 2 P k 1j 2 P k 1i i 1 ;
2 R k C i1 A ix (k) i B i R R k 1 k 1 2 ( P k 1j 2 i1 A ip k 1i B i ); Y ki A T i R kbi T i 1 2 ; P ki 1 4 [Y ki + Yki T S n i Y ki S ni S ni Yki T S n i ] + R k 2 R k 1 P 2 k 1i i 1 2 ; Step 5 goto step 3 Simiar with the discussions in [3] we need verify whether Agorithm 21 has the foowing basic properties Lemma 24 Suppose that the sequences {R i } {P ir }(R i 0 i k r 1 2 ) are generated by Agorithm 21 then R i R j 0 P ir P jr 0 (i j k i j) Proof We verify the concusion by induction with the method of [3] Step 1 Show that < R 0 R 1 > 0 0 when k 1 < R 0 R 1 >< R 0 R 0 R 0 2 R 0 2 R 0 2 P 0r 2 P 0r 2 < 1 4 [Y0r + Y T 0r S nr (Y 0r + Y0r)S T nr ] P 0r > 0 < P 0r P 1r > < P 0r 1 4 [Y1r + Y 1r T S nr Y 1rS nr (4) < P 0r P 1r > A rp 0rB r > S nr Y1rS T nr ] + R 1 2 R 0 P 2 0r > < P 0r 1 4 [Y1r + Y 1r T S nr Y 1rS nr S nr Y1rS T nr ] > + R 1 2 R 0 P 0r Step 2 Suppose that (4) hods when k s then when k s + 1 < R s R s+1 > < R s R s R s 2 P sr 2 P sr 2 A rp srb r > < 1 4 [Ysr + Y T sr S nr (Y sr + Ysr)S T nr ] P sr > 0 < P sr P s+1r > < P sr 1 4 [Y s+1r + Y T s+1r S nr Y s+1r S nr S nr Ys+1rS T nr ] + Rs+1 2 R s P 2 sr > < P sr 1 4 [Y s+1r + Ys+1r T S nr Y s+1r S nr S nr Ys+1rS T nr ] > + Rs+1 2 R s P 2 sr 2 0 (5) (6) (7) (8) For j 1 2 s 1 we have that < R j R s+1 > < R j R s P sr 2 P sr 2 A rp srb r > < 1 4 [Yjr + Y T jr S nr (Y jr + Yjr)S T nr ] P sr > 0 < P jr P s+1r > < P jr 1 4 [Ys+1r + Y s+1r T S nr Y s+1rs nr S nr Ys+1rS T nr ] > + R s+1 2 R s 2 < P jr P sr > 0 (9) (10) From steps 1 2 the concusion < R i R j > 0 < P ir P jr > 0 hod for a i j k(i j) by the principe of induction Next we verify that if Probem I is consistent for any initia symmetric antipersymmetric matrix group [X 1 X 2 X ] the matrix group sequences [X (k) 1 X (k) 2 X (k) ] generated by the iterative method converge to a symmetric antipersymmetric soution group within at most pq iterative steps in the absence of roundoff errors Lemma 25 Suppose that Probem I is consistent [X1 X2 X ] is a symmetric antipersymmetric soution group For any initia symmetric antipersymmetric matrix group [X 1 X 2 X ] the sequences {X (i) j }{R i } {P ij }(j 1 2 ) generated by Agorithm 21 satisfy < P ij Xj X (i) j > R i 2 (i ) (11) Proof We prove the concusion by induction with the method in [3] When i 0 < P 0j Xj X j > < 1 4 [Y0j + Y T 0j S nj Y 0jS nj S nj Y T 0jS nj ] Xj X j > R 0 2 (12) Suppose that the concusion hods for i s(s 0) that is < P sj X j X (s) j > R s 2 (13) then when i s + 1 < P s+1j Xj X(s+1) j > < 1 4 [Y s+1j + Ys+1j T S n j Y s+1j S nj S nj Ys+1j T S n j ] + Rs+1 2 R s P 2 sj Xj X(s+1) j > R s+1 2 By the principe of induction the concusion P ij X j X(i) j > R i 2 hods for a i (14) <
3 Theorem 21 Suppose that Probem I is consistent then for any initia symmetric an antipersymmetric matrix group [X 1 X 2 X ] a symmetric an antipersymmetric soution group can be obtained within at most pq iteration steps for Agorithm 21 Theorem 22 Probem I is consistent if ony if there exists a nonnegative integer number k such that R k 0 or P kj 0 for some j {1 2 } The proofs of the two theorems are simiar with the proofs of Theorem in [3] so they are omitted From Lemma 25 if there exists a nonnegative integer number k such that P kj 0 for a j {1 2 } but R k 0 then Probem I is inconsistent Hence the sovabiity of Probem I can be judged automaticay by Agorithm 21 Lemma 26 Probem I has a symmetric antipersymmetric soution groups if ony if the foowing inear matrix equations is consistent A 1X 1B 1 + A 2X 2B A X B C B1 T X 1A T 1 + B2 T X 2A T B T X A T C T (15) A 1S n1 X 1S n1 B A S n X S n B C B1 T S n1 X 1S n1 A T B T S n X S n A T C T Proof Suppose that Probem I has a symmetric antipersymmetric soution group [Y 1 Y 2 Y ] then Y i Yi T S ni Y i S ni (i 1 2 ) A 1 Y 1 B 1 + A 2 Y 2 B A Y B C B1 T Y 1 A T 1 + B2 T Y 2 A T B T Y A T (A 1 Y1 T B 1 + A 2 Y2 T B A Y T B ) T C T A 1 S n1 Y 1 S n1 B A S n Y S n B (A 1 Y 1 B A Y B ) C B1 T S n1 Y 1 S n1 A T B T S n Y S n A T (B1 T Y 1 A T B T Y A T ) CT (16) Hence the symmetric antipersymmetric soution group [Y 1 Y 2 Y ] is a soution group of the inear matrix equations (15) namey the inear matrix equations (15) is consistent Conversey suppose that the inear matrix equations (15) is consistent then there exists a matrix group [Ȳ1 Ȳ2 Ȳ](Ȳi R ni ni i 1 2 ) such that A 1 Ȳ 1B 1 + A 2 Ȳ 2B A Ȳ B C B1 T Ȳ1AT 1 + B2 T Ȳ2AT B T Ȳ A T C T (17) A 1S n1 Ȳ 1S n1 B A S n Ȳ S n B C B1 T S n1 Ȳ 1S n1 A T B T S n Ȳ S n A T C T Let Y i Ȳi+Ȳ T i Sn i (Ȳi+Ȳ T i )Sn i 4 then Y i SA n n A 1Y 1B 1 + A 2Y 2B A Y B A 1 Ȳ1+Ȳ 1 T Sn 1 (Ȳ1+Ȳ 1 T )Sn 1 B A 2 Ȳ2+Ȳ 2 T Sn 2 (Ȳ2+Ȳ 2 T (18) )Sn 2 B A Ȳ+Ȳ T Sn (Ȳ+Ȳ T )Sn B 4 C Therefore [Y 1 Y 2 Y ] is a symmetric antipersymmetric soution group of Probem I Remark From the proof process of Lemma 26 any symmetric antipersymmetric soution groups of Probem I must be the soution groups of the inear matrix equations (15) Let S E denote the soution group set of the inear matrix equations (15) then S E S E where S E is the soution group set of Probem I Simiar with the discussions in [3] checking [X1 X2 X ] being the east Frobenius norm symmetric antipersymmetric soution group of probem I is equivaent to verify that [X1 X2 X ] is the east Frobenius norm symmetric antipersymmetric soution group of the inear matrix equation (15) Lemma 27 (see [3]) Suppose that the consistent systems of the inear equations Ax b has a soution x R(A T ) the x is an unique east Frobenius norm soution of the systems of inear equations Next we verify that if et the initia symmetric antipersymmetric matrices be X j A T j HBT j +B jh T A j S nj (A T j HBT j + B jh T A j )S nj j 1 2 where H is arbitrary then the symmetric antipersymmetric soution group [X1 X2 X ] obtained by the iterative method is the east Frobenius norm symmetric antipersymmetric soution group Theorem 23 Suppose that Probem I is consistent If we choose the initia symmetric antipersymmetric matrices X j A T j HBT j + B j H T A j S nj (A T j HBT j + B j H T A j )S nj j 1 2 H is arbitrary Let X 1 0 X 2 0 X 0 then the symmetric antipersymmetric soution group [X1 X2 X ] obtained by Agorithm 21 is the unique east Frobenius norm symmetric antipersymmetric soution group of Probem I Proof With the proof method in [3] in term of Theorem 21 if we take X i A T i HBT i +B ih T A i S ni (A T i HBT i + B i H T A i )S ni (i 1 2 ) We can obtain the symmetric antipersymmetric soution group [X1 X2 X ] of probem I in finite iteration steps Xi (i 1 2 ) can be expressed as X i A T i Y B T i +B iy T A i S ni (A T i Y B T i +B iy T A i)s ni (19) where Y R p q Next we wi verify that [X1 X2 X ] is the unique east Frobenius norm symmetric antipersymmetric soution group of Probem I From the Remark we ony need show that [X1 X2 X ] is the east Frobenius norm symmetric antipersymmetric soution group of the inear matrix equation (15) For matrix A R m n et vec(a) denote the foowing mn vector containing a the entries of matrix A: vec(a) (A(: 1) T A(: 2) T A(: n) T ) R mn (20) where A(: i) denote ith coumn of matrix A A B denote the Kronecker product of matrices A B Then inear matrix equation (15) is equivaent to the system of inear matrix equations B T A A B T (B T Sn ) (A S n ) (A S n ) (B T Sn ) Noting that vec(x 1 ) vec(x 2 ) vec(x ) B T 1 A1 BT 2 A2 A 1 B T 1 A 2 B T 2 (B T 1 Sn 1 ) (A1Sn 1 ) (BT 2 Sn 2 ) (A2Sn 2 ) (21) (A 1S n1 ) (B T 1 Sn 1 ) (A2Sn 2 ) (BT 2 Sn 2 ) vec(x 1) vec(x 2) vec(x ) vec(c) vec(c T ) vec(c) vec(c T ) vec(a T 1 Y BT 1 + B1Y T A 1 S n1 (A T 1 Y BT 1 + B1Y T A 1)S n1 ) vec(a T 2 Y BT 2 + B2Y T A 2 S n2 (A T 2 Y BT 2 + B2Y T A 2)S n2 ) vec(a T Y BT + B Y T A S n (A T Y BT + B Y T A )S n )
4 B 1 A T 1 A T 1 B1 (Sn 1 B1) (Sn 1 AT 1 ) B 2 A T 2 A T 2 B2 (Sn 2 B2) (Sn 2 AT 2 ) B A T A T B (S n B ) (S n A T ) (S n1 A T 1 ) (Sn 1 B1) (S n2 A T 2 ) (Sn 2 B2) (S n A T ) (Sn B ) vec(y ) vec(y T ) vec(y ) vec(y T ) B T 1 A1 BT 2 A2 A 1 B T 1 A 2 B T 2 (B T 1 Sn 1 ) (A1Sn 1 ) (BT 2 Sn 2 ) (A2Sn 2 ) (A 1S n1 ) (B T 1 Sn 1 ) (A2Sn 2 ) (BT 2 Sn 2 ) T B T A A B T (B T Sn ) (A S n ) (A S n ) (B T Sn ) R vec(y ) vec(y T ) vec(y ) vec(y T ) B T 1 A1 BT 2 A2 A 1 B T 1 A 2 B T 2 (B T 1 Sn 1 ) (A1Sn 1 ) (BT 2 Sn 2 ) (A2Sn 2 ) (A 1S n1 ) (B T 1 Sn 1 ) (A2Sn 2 ) (BT 2 Sn 2 ) T B T A A B T (B T Sn ) (A S n ) (A S n ) (B T Sn ) Hence from Lemma 27 [vec(x1 ) vec(x2 ) vec(x )] is the unique east Frobenius norm symmetric antipersymmetric soution group of the matrix equation (21) Since vec operator is isomorphic [X1 X2 X ] is the unique east Frobenius norm symmetric antipersymmetric soution group of the inear marix equation (15) thus it is aso the unique east Frobenius norm symmetric antiperwymmetric soution group of Probem I When Probem I is consistent its symmetric antipersymmetric soution group set S E is nonempty then Let A 1 X 1 B 1 + A 2 X 2 B A X B C A 1 (X 1 X 1 )B A (X X )B C A 1 X1 B 1 A 2 X2 B 2 A X B X 1 X 1 X 1 X 2 X 2 X 2 X X X C C A 1 X1 B 1 A 2 X2 B 2 A X B (22) then Probem II is equivaent to find the east Frobenius norm symmetric antipersymmetric soution group of the inear matrix equation A 1 X1 B 1 + A 2 X2 B A X B C (23) III EXAMPLE Let n 3 A 1 A 2 B 1 B 2 A 3 B 3 (see [5]) C as foows: B A B 2 A B A C (24) (25) (26) (27) Let X 1 0 X 2 0 X 0 with the precision of Using the Agorithm 21 we can obtain the unique east Frobenius norm symmetric antipersymmetric soution group in 40 iteration steps as foows: X (43) (28) By using the Agorithm 21 et initia matrices X j A T j HBT j + B jh T A j S nj (A T j HBT j + B jh T A j )S nj j 1 2 where H is arbitrary et X1 0 X2 0 X 0 we can obtain the unique east Frobenius norm symmetric antipersymmetric soution group [ X 1 X2 X ] of the inear matrix equation (23) Once above symmetric antipersymmetric matrix group [ X 1 X2 X ] is obtained the unique symmetric antipersymmetric soution group [ ˆX 1 ˆX 2 ˆX ] of probem II can be obtained So ˆX 1 ˆX 2 ˆX can be denoted as ˆX 1 X 1 + X1 ˆX 2 X 2 + X2 ˆX X + X X (43) (29)
5 X (43) (30) R 43 C A 1 X (43) 1 B 1 A 2 X (43) 2 B 2 A 3 X (43) 3 B (31) Let X 3 X 1 X (32) (33) (34) Using the Agorithm 21 we can obtain the unique east Frobenius norm symmetric antipersymmetric soution group of the inear matrix equation (23) in 43 iteration steps as foows: X 1 X (35) (36) X (37) R 49 C A 1 X1 B1 A 2 X2 B2 A 3 X3 B So the symmetric antipersymmetric soution group of Probem II can be obtained as foows: ˆX 1 ˆX 2 (40) ˆX (38) (39) (40) min [ X 1 X X 2 X X 3 X 3 2 ] [X 1 X 2 X 3 ] S E ˆX 1 X1 2 + ˆX 2 X2 2 + ˆX 3 X e + 04 (41)
6 IV CONCLUSION In this paper an iterative method is constructed to find the symmetric antisymmetric soutions of matrix equation A 1 X 1 B 1 + A 2 X 2 B A X B C When the matrix equation is consistent for any initia symmetric antipersymmetric matrix group [X 1 X 2 X ] a symmetric antipersymmetric soution group can be obtained in finite iteration steps the east norm symmetric antipersymmetric soution group can be obtained by choosing a specia kind of initia symmetric antipersymmetric matrix group In addition for a given symmetric antipersymmetric group [ X 1 X 2 X ] the optima approximation symmetric antipersymmetric soution group can be obtained by finding the east norm symmetric antipersymmetric soution group of matrix equation A 1 X1 B 1 + A 2 X2 B A X B C where C C A 1 X1 B 1 A 2 X2 B 2 A X B Given numerica exampes show that the iterative method is efficient REFERENCES [1] Zhen-yun Peng The nearest bisymmetric soutions of inear matrix equations J Comput Math 22(6) 2004 pp [2] K T Jeseph Inverse eigenvaue probem in structura design AIAA J pp [3] Zhuo-hua Peng Xi-yan Hu Lei Zhang The bisymmetric soutions of the matrix equation A 1 X 1 B 1 + A 2 X 2 B A X B C its optima approximation Linear Agebra its Appications pp [4] Dongxiu Xie Yanping Sheng The east-squares soutions of inconsistent matrix equation over symmetric antipersymmetric matrices Appid Mathematics Letters pp [5] Zhuo-hua Peng Xi-yan Hu Lei Zhang The centrosymmetric soutions of matrix equation A 1 X 1 B 1 + A 2 X 2 B A X B C its optima approximation Acta Mathematica Scientia 29A(1) 2009 pp
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 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 informationLecture Note 3: Stationary Iterative Methods
MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or
More informationTHE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1) 1. Introduction
Journal of Computational Mathematics, Vol22, No4, 2004, 535 544 THE INVERSE PROBLEM OF CENTROSYMMETRIC MATRICES WITH A SUBMATRIX CONSTRAINT 1 Zhen-yun Peng Department of Mathematics, Hunan University of
More information#A48 INTEGERS 12 (2012) ON A COMBINATORIAL CONJECTURE OF TU AND DENG
#A48 INTEGERS 12 (2012) ON A COMBINATORIAL CONJECTURE OF TU AND DENG Guixin Deng Schoo of Mathematica Sciences, Guangxi Teachers Education University, Nanning, P.R.China dengguixin@ive.com Pingzhi Yuan
More informationFitting affine and orthogonal transformations between two sets of points
Mathematica Communications 9(2004), 27-34 27 Fitting affine and orthogona transformations between two sets of points Hemuth Späth Abstract. Let two point sets P and Q be given in R n. We determine a transation
More informationMinimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch
The Eighth Internationa Symposium on Operations Research and Its Appications (ISORA 09) Zhangiaie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 402 408 Minimizing Tota Weighted Competion
More informationORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION
J. Korean Math. Soc. 46 2009, No. 2, pp. 281 294 ORHOGONAL MLI-WAVELES FROM MARIX FACORIZAION Hongying Xiao Abstract. Accuracy of the scaing function is very crucia in waveet theory, or correspondingy,
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationICS 6N Computational Linear Algebra Matrix Algebra
ICS 6N Computational Linear Algebra Matrix Algebra Xiaohui Xie University of California, Irvine xhx@uci.edu February 2, 2017 Xiaohui Xie (UCI) ICS 6N February 2, 2017 1 / 24 Matrix Consider an m n matrix
More informationMatrix Arithmetic. a 11 a. A + B = + a m1 a mn. + b. a 11 + b 11 a 1n + b 1n = a m1. b m1 b mn. and scalar multiplication for matrices via.
Matrix Arithmetic There is an arithmetic for matrices that can be viewed as extending the arithmetic we have developed for vectors to the more general setting of rectangular arrays: if A and B are m n
More informationMath 124B January 31, 2012
Math 124B January 31, 212 Viktor Grigoryan 7 Inhomogeneous boundary vaue probems Having studied the theory of Fourier series, with which we successfuy soved boundary vaue probems for the homogeneous heat
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
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 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 informationLecture Notes 4: Fourier Series and PDE s
Lecture Notes 4: Fourier Series and PDE s 1. Periodic Functions A function fx defined on R is caed a periodic function if there exists a number T > such that fx + T = fx, x R. 1.1 The smaest number T for
More informationAlgorithms to solve massively under-defined systems of multivariate quadratic equations
Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations
More information(f) is called a nearly holomorphic modular form of weight k + 2r as in [5].
PRODUCTS OF NEARLY HOLOMORPHIC EIGENFORMS JEFFREY BEYERL, KEVIN JAMES, CATHERINE TRENTACOSTE, AND HUI XUE Abstract. We prove that the product of two neary hoomorphic Hece eigenforms is again a Hece eigenform
More informationSmoothers for ecient multigrid methods in IGA
Smoothers for ecient mutigrid methods in IGA Cemens Hofreither, Stefan Takacs, Water Zuehner DD23, Juy 2015 supported by The work was funded by the Austrian Science Fund (FWF): NFN S117 (rst and third
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 informationInvestigation on spectrum of the adjacency matrix and Laplacian matrix of graph G l
Investigation on spectrum of the adjacency matrix and Lapacian matrix of graph G SHUHUA YIN Computer Science and Information Technoogy Coege Zhejiang Wani University Ningbo 3500 PEOPLE S REPUBLIC OF CHINA
More informationUNIFORM CONVERGENCE OF MULTIPLIER CONVERGENT SERIES
royecciones Vo. 26, N o 1, pp. 27-35, May 2007. Universidad Catóica de Norte Antofagasta - Chie UNIFORM CONVERGENCE OF MULTILIER CONVERGENT SERIES CHARLES SWARTZ NEW MEXICO STATE UNIVERSITY Received :
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 informationThe 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 informationMaximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR
1 Maximizing Sum Rate and Minimizing MSE on Mutiuser Downink: Optimaity, Fast Agorithms and Equivaence via Max-min SIR Chee Wei Tan 1,2, Mung Chiang 2 and R. Srikant 3 1 Caifornia Institute of Technoogy,
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
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 informationMA 201: Partial Differential Equations Lecture - 10
MA 201: Partia Differentia Equations Lecture - 10 Separation of Variabes, One dimensiona Wave Equation Initia Boundary Vaue Probem (IBVP) Reca: A physica probem governed by a PDE may contain both boundary
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
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 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 informationMatrix Algebra & Elementary Matrices
Matrix lgebra & Elementary Matrices To add two matrices, they must have identical dimensions. To multiply them the number of columns of the first must equal the number of rows of the second. The laws below
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationA Solution to the 4-bit Parity Problem with a Single Quaternary Neuron
Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria
More informationCONSTRUCTION AND APPLICATION BASED ON COMPRESSING DEPICTION IN PROFILE HIDDEN MARKOV MODEL
CONSRUCON AND APPCAON BASED ON COPRESSNG DEPCON N PROFE HDDEN ARKOV ODE Zhijian Zhou, 1, Daoiang i, 3, 3, i i,3,*, Zetian Fu 1 Coege of Science, China Agricuture University, Beijing, China, 100083 Key
More informationProduct Cosines of Angles between Subspaces
Product Cosines of Anges between Subspaces Jianming Miao and Adi Ben-Israe Juy, 993 Dedicated to Professor C.R. Rao on his 75th birthday Let Abstract cos{l,m} : i cos θ i, denote the product of the cosines
More informationIntegrating Factor Methods as Exponential Integrators
Integrating Factor Methods as Exponentia Integrators Borisav V. Minchev Department of Mathematica Science, NTNU, 7491 Trondheim, Norway Borko.Minchev@ii.uib.no Abstract. Recenty a ot of effort has been
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 informationWeek 6 Lectures, Math 6451, Tanveer
Fourier Series Week 6 Lectures, Math 645, Tanveer In the context of separation of variabe to find soutions of PDEs, we encountered or and in other cases f(x = f(x = a 0 + f(x = a 0 + b n sin nπx { a n
More informationConstruct non-graded bi-frobenius algebras via quivers
Science in China Series A: Mathematics Mar., 2007, Vo. 50, No. 3, 450 456 www.scichina.com www.springerink.com Construct non-graded bi-frobenius agebras via quivers Yan-hua WANG 1 &Xiao-wuCHEN 2 1 Department
More informationResearch Article The Diagonally Dominant Degree and Disc Separation for the Schur Complement of Ostrowski Matrix
Hindawi Pubishing Corporation Journa of Appied Mathematics Voume 2013, Artice ID 973152, 10 pages http://dxdoiorg/101155/2013/973152 Research Artice The Diagonay Dominant Degree and Disc Separation for
More informationOn prime divisors of remarkable sequences
Annaes Mathematicae et Informaticae 33 (2006 pp. 45 56 http://www.ektf.hu/tanszek/matematika/ami On prime divisors of remarkabe sequences Ferdinánd Fiip a, Kámán Liptai b1, János T. Tóth c2 a Department
More informationGlobal Optimality Principles for Polynomial Optimization Problems over Box or Bivalent Constraints by Separable Polynomial Approximations
Goba Optimaity Principes for Poynomia Optimization Probems over Box or Bivaent Constraints by Separabe Poynomia Approximations V. Jeyakumar, G. Li and S. Srisatkunarajah Revised Version II: December 23,
More informationAn Algorithm for Pruning Redundant Modules in Min-Max Modular Network
An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai
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 informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More informationA natural differential calculus on Lie bialgebras with dual of triangular type
Centrum voor Wiskunde en Informatica REPORTRAPPORT A natura differentia cacuus on Lie biagebras with dua of trianguar type N. van den Hijigenberg and R. Martini Department of Anaysis, Agebra and Geometry
More informationMath 124B January 17, 2012
Math 124B January 17, 212 Viktor Grigoryan 3 Fu Fourier series We saw in previous ectures how the Dirichet and Neumann boundary conditions ead to respectivey sine and cosine Fourier series of the initia
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 informationResearch Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
Appied Mathematics and Stochastic Anaysis Voume 007, Artice ID 74191, 8 pages doi:10.1155/007/74191 Research Artice On the Lower Bound for the Number of Rea Roots of a Random Agebraic Equation Takashi
More informationELA INTERVAL SYSTEM OF MATRIX EQUATIONS WITH TWO UNKNOWN MATRICES
INTERVAL SYSTEM OF MATRIX EQUATIONS WITH TWO UNKNOWN MATRICES A RIVAZ, M MOHSENI MOGHADAM, AND S ZANGOEI ZADEH Abstract In this paper, we consider an interval system of matrix equations contained two equations
More informationData Search Algorithms based on Quantum Walk
Data Search Agorithms based on Quantum Wak Masataka Fujisaki, Hiromi Miyajima, oritaka Shigei Abstract For searching any item in an unsorted database with items, a cassica computer takes O() steps but
More informationALGORITHMIC SUMMATION OF RECIPROCALS OF PRODUCTS OF FIBONACCI NUMBERS. F. = I j. ^ = 1 ^ -, and K w = ^. 0) n=l r n «=1 -*/!
ALGORITHMIC SUMMATIO OF RECIPROCALS OF PRODUCTS OF FIBOACCI UMBERS Staney Rabinowitz MathPro Press, 2 Vine Brook Road, Westford, MA 0886 staney@tiac.net (Submitted May 997). ITRODUCTIO There is no known
More informationKevin James. MTHSC 3110 Section 2.1 Matrix Operations
MTHSC 3110 Section 2.1 Matrix Operations Notation Let A be an m n matrix, that is, m rows and n columns. We ll refer to the entries of A by their row and column indices. The entry in the i th row and j
More informationMATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES
MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is
More informationHomework #04 Answers and Hints (MATH4052 Partial Differential Equations)
Homework #4 Answers and Hints (MATH452 Partia Differentia Equations) Probem 1 (Page 89, Q2) Consider a meta rod ( < x < ), insuated aong its sides but not at its ends, which is initiay at temperature =
More informationLecture 9. Stability of Elastic Structures. Lecture 10. Advanced Topic in Column Buckling
Lecture 9 Stabiity of Eastic Structures Lecture 1 Advanced Topic in Coumn Bucking robem 9-1: A camped-free coumn is oaded at its tip by a oad. The issue here is to find the itica bucking oad. a) Suggest
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationOn the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type mappings in Banach spaces
Computers and Mathematics with Applications 53 (2007) 1847 1853 www.elsevier.com/locate/camwa On the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type
More informationNumerical methods for PDEs FEM - abstract formulation, the Galerkin method
Patzhater für Bid, Bid auf Titefoie hinter das Logo einsetzen Numerica methods for PDEs FEM - abstract formuation, the Gaerkin method Dr. Noemi Friedman Contents of the course Fundamentas of functiona
More informationDisturbance decoupling by measurement feedback
Preprints of the 19th Word Congress The Internationa Federation of Automatic Contro Disturbance decouping by measurement feedback Arvo Kadmäe, Üe Kotta Institute of Cybernetics at TUT, Akadeemia tee 21,
More information14 Separation of Variables Method
14 Separation of Variabes Method Consider, for exampe, the Dirichet probem u t = Du xx < x u(x, ) = f(x) < x < u(, t) = = u(, t) t > Let u(x, t) = T (t)φ(x); now substitute into the equation: dt
More informationResearch Article Numerical Range of Two Operators in Semi-Inner Product Spaces
Abstract and Appied Anaysis Voume 01, Artice ID 846396, 13 pages doi:10.1155/01/846396 Research Artice Numerica Range of Two Operators in Semi-Inner Product Spaces N. K. Sahu, 1 C. Nahak, 1 and S. Nanda
More informationSystems & Control Letters. State and output feedback boundary control for a coupled PDE ODE system
Systems & Contro Letters 6 () 54 545 Contents ists avaiabe at ScienceDirect Systems & Contro Letters journa homepage: wwweseviercom/ocate/syscone State output feedback boundary contro for a couped PDE
More informationSUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS
ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia
More informationStatistics for Applications. Chapter 7: Regression 1/43
Statistics for Appications Chapter 7: Regression 1/43 Heuristics of the inear regression (1) Consider a coud of i.i.d. random points (X i,y i ),i =1,...,n : 2/43 Heuristics of the inear regression (2)
More informationConsistent initial values for DAE systems in circuit simulation D. Estevez Schwarz Abstract One of the diculties of the numerical integration methods
Consistent initia vaues for DAE systems in circuit simuation D. Estevez Schwarz Abstract One of the dicuties of the numerica integration methods for dierentia-agebraic equations (DAEs) is computing consistent
More informationGroup, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,
Group, Rings, and Fields Rahul Pandharipande I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ
More informationIndirect Optimal Control of Dynamical Systems
Computationa Mathematics and Mathematica Physics, Vo. 44, No. 3, 24, pp. 48 439. Transated from Zhurna Vychisite noi Matematiki i Matematicheskoi Fiziki, Vo. 44, No. 3, 24, pp. 444 466. Origina Russian
More informationTHE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES
THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES by Michae Neumann Department of Mathematics, University of Connecticut, Storrs, CT 06269 3009 and Ronad J. Stern Department of Mathematics, Concordia
More informationBP neural network-based sports performance prediction model applied research
Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied
More informationEquivalence constants for certain matrix norms II
Linear Algebra and its Applications 420 (2007) 388 399 www.elsevier.com/locate/laa Equivalence constants for certain matrix norms II Bao Qi Feng a,, Andrew Tonge b a Department of Mathematical Sciences,
More informationGauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law
Gauss Law 1. Review on 1) Couomb s Law (charge and force) 2) Eectric Fied (fied and force) 2. Gauss s Law: connects charge and fied 3. Appications of Gauss s Law Couomb s Law and Eectric Fied Couomb s
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More informationDistributed average consensus: Beyond the realm of linearity
Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,
More informationConvergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems
Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,
More informationEE/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 informationOn 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 informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
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 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 informationHILBERT? What is HILBERT? Matlab Implementation of Adaptive 2D BEM. Dirk Praetorius. Features of HILBERT
Söerhaus-Workshop 2009 October 16, 2009 What is HILBERT? HILBERT Matab Impementation of Adaptive 2D BEM joint work with M. Aurada, M. Ebner, S. Ferraz-Leite, P. Godenits, M. Karkuik, M. Mayr Hibert Is
More informationWorst Case Analysis of the Analog Circuits
Proceedings of the 11th WSEAS Internationa Conference on CIRCUITS, Agios Nikoaos, Crete Isand, Greece, Juy 3-5, 7 9 Worst Case Anaysis of the Anaog Circuits ELENA NICULESCU*, DORINA-MIOARA PURCARU* and
More informationHomogeneity properties of subadditive functions
Annaes Mathematicae et Informaticae 32 2005 pp. 89 20. Homogeneity properties of subadditive functions Pá Burai and Árpád Száz Institute of Mathematics, University of Debrecen e-mai: buraip@math.kte.hu
More informationLinear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations
More informationSupplementary Appendix (not for publication) for: The Value of Network Information
Suppementary Appendix not for pubication for: The Vaue of Network Information Itay P. Fainmesser and Andrea Gaeotti September 6, 03 This appendix incudes the proof of Proposition from the paper "The Vaue
More informationWave Equation Dirichlet Boundary Conditions
Wave Equation Dirichet Boundary Conditions u tt x, t = c u xx x, t, < x 1 u, t =, u, t = ux, = fx u t x, = gx Look for simpe soutions in the form ux, t = XxT t Substituting into 13 and dividing
More informationThe Group Structure on a Smooth Tropical Cubic
The Group Structure on a Smooth Tropica Cubic Ethan Lake Apri 20, 2015 Abstract Just as in in cassica agebraic geometry, it is possibe to define a group aw on a smooth tropica cubic curve. In this note,
More informationBALANCING REGULAR MATRIX PENCILS
BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity
More informationSTABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM 1. INTRODUCTION
Journa of Sound and Vibration (996) 98(5), 643 65 STABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM G. ERDOS AND T. SINGH Department of Mechanica and Aerospace Engineering, SUNY at Buffao,
More informationReliability: Theory & Applications No.3, September 2006
REDUNDANCY AND RENEWAL OF SERVERS IN OPENED QUEUING NETWORKS G. Sh. Tsitsiashvii M.A. Osipova Vadivosto, Russia 1 An opened queuing networ with a redundancy and a renewa of servers is considered. To cacuate
More informationFourier Series. 10 (D3.9) Find the Cesàro sum of the series. 11 (D3.9) Let a and b be real numbers. Under what conditions does a series of the form
Exercises Fourier Anaysis MMG70, Autumn 007 The exercises are taken from: Version: Monday October, 007 DXY Section XY of H F Davis, Fourier Series and orthogona functions EÖ Some exercises from earier
More informationStructured 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 informationMonomial Hopf algebras over fields of positive characteristic
Monomia Hopf agebras over fieds of positive characteristic Gong-xiang Liu Department of Mathematics Zhejiang University Hangzhou, Zhejiang 310028, China Yu Ye Department of Mathematics University of Science
More informationSmoothness equivalence properties of univariate subdivision schemes and their projection analogues
Numerische Mathematik manuscript No. (wi be inserted by the editor) Smoothness equivaence properties of univariate subdivision schemes and their projection anaogues Phiipp Grohs TU Graz Institute of Geometry
More information6 Wave Equation on an Interval: Separation of Variables
6 Wave Equation on an Interva: Separation of Variabes 6.1 Dirichet Boundary Conditions Ref: Strauss, Chapter 4 We now use the separation of variabes technique to study the wave equation on a finite interva.
More informationJackson 4.10 Homework Problem Solution Dr. Christopher S. Baird University of Massachusetts Lowell
Jackson 4.10 Homework Probem Soution Dr. Christopher S. Baird University of Massachusetts Lowe PROBLEM: Two concentric conducting spheres of inner and outer radii a and b, respectivey, carry charges ±.
More informationResearch of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance
Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient
More informationCONGRUENCES. 1. History
CONGRUENCES HAO BILLY LEE Abstract. These are notes I created for a seminar tak, foowing the papers of On the -adic Representations and Congruences for Coefficients of Moduar Forms by Swinnerton-Dyer and
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 information