Fatemeh Panjeh Ali Beik, Davod Khojasteh Salkuyeh, and Mahmoud Mohseni Moghadam
|
|
- Neal Griffin
- 5 years ago
- Views:
Transcription
1 GRADIENT BASED ITERATIVE ALGORITHM FOR SOLVING THE GENERALIZED COUPLED SYLVESTER-TRANSPOSE AND CONJUGATE MATRIX EQUATIONS OVER REFLEXIVE (ANTI-REFLEXIVE) MATRICES Fatemeh Panjeh Al Bek, Davod Khojasteh Salkuyeh, and Mahmoud Mohsen Moghadam Department of Mathematcs, Val-e-Asr Unversty of Rafsanjan, Rafsanjan, Iran e-mal: Faculty of Mathematcal Scences, Unversty of Gulan, PO Box 1914, Rasht, Iran e-mal: Department of Mathematcs, Islamc Azad Unversty of Kerman, Kerman, Iran e-mal: Abstract Lnear matrx equatons play an mportant role n many areas, such as control theory, system theory, stablty theory and some other felds of pure and appled mathematcs In the present paper, we consder the generalzed coupled Sylvestertranspose and conjugate matrx equatons T ν(x) = F ν, ν = 1,,, N, where X = (X 1, X,, X p) s a group of unknown matrces and for ν = 1,,, N, s p 1 s s 3 s 4 T ν(x) = A νµx B νµ + C νµx T D νµ + M νµx N νµ + =1 H νµx H G νµ, n whch A νµ, B νµ, C νµ, D νµ, M νµ, N νµ, H νµ, G νµ and F ν are gven matrces wth sutable dmensons defned over complex number feld By usng the herarchcal dentfcaton prncple, an teratve algorthms s proposed for solvng the above coupled lnear matrx equatons over the group of reflexve (ant-reflexve) matrces Meanwhle, suffcent condtons are establshed whch guarantee the convergence of the presented algorthm Fnally, some numercal examples are gven to demonstrate the valdty of our theoretcal results and the effcency of the algorthm for solvng the mentoned coupled lnear matrx equatons Keywords: Generalzed Sylvester-transpose and conjugate matrx equaton, Iteratve algorthm, Reflexve (ant-reflexve) matrx AMS Subject Classfcaton: 15A4, 65F10 1 Introducton In ths paper, the followng notatons are utlzed We use tr(a), A T, A H, A to denote the trace, the transpose, the conjugate transposed, the conjugate of the matrx A, respectvely Moreover, C m n represents the set of all m n complex matrces The set of all symmetrc Correspondng author 1
2 F P A Bek, D K Salkuyeh and M M Moghadam orthogonal matrces, also known as reflecton matrces, n C n n s represented by SOC n n, e, P SOC n n f and only f P = P H = P 1 Defnton 11 [6] Consder two arbtrary gven matrces P, Q SOC n n The matrx A C n n s called a reflexve matrx, wth respect to P and Q, f A = P AQ The set of all n n reflexve, (P, Q)-reflexve, matrces s denoted by C n n r (P, Q) Defnton 1 [6] Consder two arbtrary gven matrces P, Q SOC n n The matrx A C n n s called an ant-reflexve matrx, wth respect to P and Q, f A = P AQ The set of all n n ant-reflexve, (P, Q)-ant-reflexve, matrces s denoted by C n n a (P, Q) In the lterature, the problem of fndng solutons of several lnear matrx equatons has been nvestgated wdely, for more detals see [1, 3, 4, 1, 13, 15, 16, 17, 1,, 4, 6, 8] and the references theren Before statng the man problems of ths paper, we brefly revew some of the works whch have been recently presented n the feld of lnear matrx equatons Recently, the dea of conjugate gradent (CG) method has been developed for constructng teratve algorthms to compute the solutons of dfferent knds of lnear matrx equatons over reflexve and ant-reflexve, generalzed bsymmetrc, generalzed centrosymmetrc, mrror-symmetrc, skew-symmetrc and (P, Q)-reflexve matrces, for more detals see [7, 8, 9, 14, 15, 17, 18, 19, 3, 5] Gradent based teratve algorthm s a dfferent common approach for solvng lnear matrx equatons For nstance, Dng et al [13] have consdered the soluton of AXB = F and AXB + CXD = F Dehghan and Hajaran [10] proposed two algorthms for solvng the followng the matrx equaton p q (11) A XB + C j Y D j = F, =1 j=1 over reflexve and ant-reflexve matrces In [11], n fact, the authors have employed the dea of the Gradent based teratve method to construct two teratve algorthms for computng the generalzed bsymmetrc and skew-symmetrc solutons of the lnear matrx equaton l (1) A Y B = C =1 Moreover, Song et al [] have consdered the followng coupled Sylvester-transpose matrx equatons p ( (13) Aη X η B η + C η Xη T ) D η = F, = 1,,, N, η=1 where A η R m l η, B η R nη p, C η R m n η, D η R lη p, F R m p, = 1,, N, η = 1,, p, are gven matrces and X η R lη nη, η I[1, p] are the matrces to be determned For smplcty, we use the followng lnear operator such that T ν (X) = p =1 s 1 A νµ X B νµ + T ν : C p 1 p 1 C pp pp C λν γν s C νµ X T D νµ + s 3 M νµ X N νµ + s 4 H νµ X H G νµ
3 On the generalzed Sylvester-transpose and conjugate matrx equatons 3 where X = (X 1, X,, X p ) and ν = 1,,, N In the present work, we wll construct a gradent based algorthm for solvng the followng coupled lnear matrx equatons (14) T ν (X) = F ν, ν I[1, N], over the group of reflexve (ant-reflexve) matrces Evdently, the coupled lnear matrx equatons (14) are extremely general and nclude many nvestgated lnear matrx equatons such as the generalzed (coupled) Sylvester and Lyapunov matrx equatons, Eqs (11), (1) and (13) 11 Problem reformulaton We wll focus on the followng problems and construct an teratve algorthm for obtanng the solutons of these problems Problem 1 Assume that the matrces A νµ C λν p, B νµ C p γ ν, µ I[1, s 1 ], C νµ C λν p, D νµ C p γ ν, µ I[1, s ], M νµ C λν p, N νµ C p γ ν, µ I[1, s 3 ], H νµ C λν p, G νµ C p γ ν, µ I[1, s 4 ], F ν C λν γν and R, Q SOC p p are gven Fnd the reflexve matrx group (X 1, X,, X p ) such that X C p p r (R, Q ) and satsfy (14) where I[1, p], ν I[1, N] Problem Assume that the matrces A νµ C λν p, B νµ C p γ ν, µ I[1, s 1 ], C νµ C λν p, D νµ C p γ ν, µ I[1, s ], M νµ C λν p, N νµ C p γ ν, µ I[1, s 3 ], H νµ C λν p, G νµ C p γ ν, µ I[1, s 4 ], F ν C λν γν and R, Q SOC p p are gven Fnd the ant-reflexve matrx group (X 1, X,, X p ) such that X C p p a (R, Q ) and satsfy (14) where I[1, p], ν I[1, N] The remnder of ths paper s organzed as follows In Secton, we recall some defntons and theorems whch are used for presentng our man theoretcal results In Secton 3, frst, we nvestgate the solvablty of Problems 1 and Then, an algorthm s proposed for solvng these problems Convergence analyss of the algorthm s also dscussed In order to llustrate the valdty and applcablty of our presented results, we gve some numercal examples n Secton 4 Fnally, the paper s ended wth a bref concluson n Secton 5 Prelmnares In ths secton, we revew some necessary prncples and defntons whch are utlzed throughout ths work Defnton 1 Suppose that Y = (Y 1, Y,, Y k ) and Z = (Z 1, Z,, Z k ) where Y, Z C r s for = 1,,, k We defne the nner product <, > as follows: (1) < Y, Z >= Re[ k =1 tr(y H j Z j )] Remark For Y = (Y 1, Y,, Y k ), Y C r s for I[1, k], the norm of Y s defned by Y = Re[ k tr(y H Y )] =1
4 4 F P A Bek, D K Salkuyeh and M M Moghadam Assume that A = [a j ] m s and B = [b j ] n q defned over complex (real) number feld, the Kronecker product of the matrces A and B s defned as the mn sq matrx A B = [a j B] The vec operator transforms a matrx A of sze m s to a vector a = vec(a) of sze ms 1 by stackng the columns of A In ths paper, the followng relaton s utlzed (See []) vec(axb) = (B T A)vec(X) Lemma 3 Let X R m n be an arbtrary matrx Then vec(x T ) = P (m, n)vec(x), where P (m, n) s unquely determned by the ntegers m and n Proof See [6] Remark 4 Let X C m n be an arbtrary matrx Then and vec(x T ) = P (m, n)vec(x), vec(x H ) = vec(x T ) = P (m, n)vec(x), where P (m, n) s unquely determned by the ntegers m and n Some propertes of the matrx P (m, n) are gven as follows ([6, 17, 7]): 1 For two arbtrary ntegers m and n, P (m, n) has the followng explct form E11 T E1 T E1n T E1 T E T E T n P (m, n) = Em1 T Em T Emn T mn mn where each E j for I[1, m] and j I[1, n], s an m n matrx wth the element at poston (, j) beng one and the others beng zero For two arbtrary ntegers m and n, P (m, n) s the untary matrx, e, P (m, n)p T (m, n) = P T (m, n)p (m, n) = I mn 3 For two arbtrary ntegers m and n, P (m, n) = P T (n, m) 3 Man results Ths secton conssts of two parts In the frst part, the solvablty of Problems 1 and s dscussed In the second part, we gve an teratve algorthm for solvng the coupled lnear matrx equatons (14) over reflexve (ant-reflexve) matrces In addton, suffcent condtons are establshed whch guarantee the convergence of the proposed algorthm 31 Solvablty of the Problems 1 and By some straghtforward computatons, we can prove the followng lemmas Lemma 31 Problem 1 s solvable f and only f the system of matrx equatons (31) (T ν (X), T ν (Z)) = (F ν, F ν ), ν I[1, N], are consstent, where Z = (Z 1, Z,, Z p ) s defned such that Z = R X Q n whch the matrces R, Q SOC p p are gven for I[1, p]
5 On the generalzed Sylvester-transpose and conjugate matrx equatons 5 Proof Wthout loss of generalty, we may assume that s 1 = s = s 3 = s 4 = s Suppose that the matrx group X = (X 1, X,, X p ) satsfes n Eq (31) Therefore, p =1 p =1 s A νµ X B νµ + C νµ X T D νµ + M νµ X N νµ + H νµ X HG νµ = F ν s A νµ R X Q B νµ + C νµ Q T XT RT D νµ + M νµ R X Q N νµ + H νµ Q X HR G νµ = F ν Now, we defne the matrx group X = ( X 1, X,, X p ) such that X = X + R X Q, = 1,,, p Evdently, X s a group of reflexve matrces, e, X C p p r (R, Q ), for = 1,,, p It s easy to verfy that for ν I[1, N] p =1 s A νµ X B νµ + C νµ XT D νµ + M νµ X N νµ + H νµ XH G νµ = F ν, whch shows that the matrx groups X = ( X 1, X,, X p ) s the soluton of Problem 1 Conversely, let the matrx group X = (X 1, X,, X p ) be the soluton of Problem 1 That s X C p p r (R, Q ), = 1,,, p, and X = (X 1, X,, X p ) satsfy n Eq (14) Hence, the proof can be concluded mmedately from the fact that X = R X Q for = 1,,, p Analogous to the strategy employed n the proof of Lemma 31, we may establsh the followng lemma Lemma 3 Problem s solvable f and only f the system of matrx equatons (3) (T ν (X), T ν (Z)) = (F ν, F ν ), ν I[1, N] are consstent, where Z = (Z 1, Z,, Z p ) s defned such that Z = R X Q n whch the matrces R, Q SOC p p are gven for I[1, p] Assume that the matrces ψ 1, ψ, ψ 3 and ψ 4 are defned as follows: ψ 1 = s 1 s 1 s 1 s 1 B T 11µ A 11µ B T N1µ A N1µ B T 11µ QT 1 A 11µR 1 B T N1µ QT 1 A N1µR 1 s 1 s 1 s 1 s 1 B T 1pµ A 1pµ B T Npµ A Npµ B T 1pµ QT p A 1pµ R p B T Npµ QT p A Npµ R p,
6 6 F P A Bek, D K Salkuyeh and M M Moghadam ψ = and ψ 4 = s s s s (D T 11µ C 11µ)P (p 1, p 1 ) (D T N1µ C N1µ)P (p 1, p 1 ) (D T 11µ R 1 C 11µ Q T 1 )P (p 1, p 1 ) (D T N1µ R 1 C N1µ Q T 1 )P (p 1, p 1 ) ψ 3 = s 4 s 4 s 4 s 4 s 3 s 3 s 3 s 3 N T 11µ M 11µ N T N1µ M N1µ N T 11µ Q 1 M 11µ R 1 N T N1µ Q 1 M N1µ R 1 (G T 11µ H 11µ)P (p 1, p 1 ) (G T N1µ H N1µ)P (p 1, p 1 ) (G T 11µ RT 1 H 11µQ 1 )P (p 1, p 1 ) (G T N1µ RT 1 H N1µQ 1 )P (p 1, p 1 ) Let Π = (Ψ 1 + Ψ, Ψ 3 + Ψ 4 ), vec(x 1 ) υ = vec(x p ) vec(x 1 ), Ω r = vec(x p ) vec(f 1 ) vec(f N ) vec(f 1 ) vec(f N ) s s s s (D T 1pµ C 1pµ)P (p p, p p ) (D T Npµ C Npµ)P (p p, p p ) (D T 1pµ R p C 1pµ Q T p )P (p p, p p ) (D T Npµ R p C Npµ Q T p )P (p p, p p ) s 3 s 3 s 3 s 3 N T 1pµ M 1pµ N T Npµ M Npµ N T 1pµ Q p M 1pµ R p N T Npµ Q p M Npµ R p s 4 s 4 s 4 s 4, (G T 1pµ H 1pµ)P (p p, p p ) (G T Npµ H Npµ)P (p p, p p ) (G T 1pµ RT p H 1pµ Q p )P (p p, p p ) (G T Npµ RT p H Npµ Q p )P (p p, p p ), and Ω a = vec(f 1 ) vec(f N ) vec(f 1 ) vec(f N ) It s not dffcult to see that Eqs (31) and (3) are equvalent to the followng to the followng lnear systems, respectvely, Πυ = Ω r,,
7 On the generalzed Sylvester-transpose and conjugate matrx equatons 7 and Πυ = Ω a Now, we can conclude the followng theorems from Lemmas 31 and 3 Theorem 33 Problem 1 has a unque soluton f and only f Rank(Π, Ω r ) = Rank(Π) and Π has full column rank The unque reflexve soluton group of Problem 1 can be calculated as follows: X = X + R X Q, = 1,,, p, where X = ( X 1,, X p, X 1,, X p ) s derved such that vec( X) = (Π H Π) 1 Π H Ω r Theorem 34 Problem has a unque soluton f and only f Rank(Π, Ω a ) = Rank(Π) and Π has full column rank The unque ant-reflexve soluton group of Problem can be calculated as follows: X = X R X Q, = 1,,, p, where X = ( X 1,, X p, X 1,, X p ) s derved such that vec( X) = (Π H Π) 1 Π H Ω a 3 Proposed algorthms In ths secton, by developng the dea of gradent based teratve method, we propose an teratve algorthm to compute the reflexve ( ant-reflexve) soluton group of Eq (14) Before presentng the algorthm, for j = 1,, 3, 4, we defne the lnear operators S j (V ) as follows: S j : C λ 1 γ 1 C λ N γ N C p 1 p 1 C pp pp V S j (V ), such that V = (V 1, V,, V N ), S j (V ) = (S 1j (V ), S j (V ),, S pj (V )) and for I[1, p] S 1 (V ) = S 3 (V ) = N s 1 N s 3 A H νµv ν B H νµ, S (V ) = M νµ H V ν N H νµ, S 4 (V ) = N s N s 4 Algorthm 1 (Proposed algorthm for Problems 1 and ) D νµ V T ν C νµ, G νµ V H ν H νµ Step 1: Input the matrces A νµ C λν p, B νµ C p γ ν, µ I[1, s 1 ], C νµ C λν p, D νµ C p γ ν, µ I[1, s ], M νµ C λν p, N νµ C p γ ν, µ I[1, s 3 ], H νµ C λν p, G νµ C p γ ν, µ I[1, s 4 ], F ν C λν γν, R, Q SOC p p, for I[1, p], and ν I[1, N] Step : Set κ = 0 for computng the soluton of Problem 1, and κ = 1 for Problem Choose a tolerance ε Step 3: If κ = 0, select the ntal reflexve group of matrces X (1) = (X (1) 1, X(1),, X(1) p ) Otherwse select the ntal ant-reflexve group of matrces X (1) = (X (1) 1, X(1),, X(1) p )
8 8 F P A Bek, D K Salkuyeh and M M Moghadam Step 4: Set t = 1 For ν = 1,, 3,, N, compute R ν (1) = F ν T ν (X (1) ) Step 5: Choose the nteger values α j, for I[1, p] and j = 1,, 3, 4, such that f S j (V ) 0 for all V = (V 1, V,, V N ) where V ν C λν γν for ν I[1, N]; Set α j = 0; Otherwse set α j = 1 Step 6: For = 1,,, p, Do: If α 1 = 1, set U (t+1) Otherwse U (t+1) = 0 If α = 1, set Y (t+1) Otherwse Y (t+1) = 0 If α 3 = 1, set Z (t+1) Otherwse Z (t+1) = 0 If α 4 = 1, set W (t+1) = X (t) + ω Ns 1 (S 1 (R (t) ) + ( 1) κ R S 1 (R (t) )Q ); = X (t) + ω Ns (S (R (t) ) + ( 1) κ R S (R (t) )Q ); = X (t) + ω Ns 3 (S 3 (R (t) ) + ( 1) κ R S 3 (R (t) )Q ); = X (t) + ω Ns 4 (S 4 (R (t) ) + ( 1) κ R S 4 (R (t) )Q ); Otherwse W (t+1) = 0 Step 7: For = 1,,, p, calculate β := α 1 + α + α 3 + α 4 ; Set X (t+1) = 1 β (U (t+1) + Y (t+1) + Z (t+1) N + W (t+1) ) Step 8: Compute R (t+1) = (R (t+1) 1, R (t+1),, R (t+1) ) where R (t+1) ν = F ν T ν (X (t+1) ), ν = 1,,, N Step 9: If R (t+1) < ε then Stop; else, set t = t + 1 and go to Step 6 Theorem 35 Suppose that the lnear coupled matrx equatons (14) has unque reflexve soluton group X = (X 1, X,, X p) If the parameter ω satsfes the nequalty (33) 0 < ω < Θ, such that Θ = N p =1 Θ ν where, Θ 1ν = s 1 A νµ B νµ, Θ ν = s C νµ D νµ Θ 3ν = s 3 M νµ N νµ, Θ 4ν = s 4 H νµ G νµ Then the teratve soluton groups X (t) = (X (t) 1, X(t),, X(t) p ), t = 1,, 3,, computed by Algorthm 1 (wth κ = 0), converge for any ntal reflexve matrx group X (1) = (X (1) 1, X(1),, X(1) p )
9 On the generalzed Sylvester-transpose and conjugate matrx equatons 9 Proof Wthout loss of generalty, we may assume that α j = 1 for I[1, p] and j = 1,, 3, 4 For = 1,,, p, we set Ũ (t) = U (t) X β, Ỹ (t) = Y (t) X, β Z (t) = Z(t) X β (t), W = W (t) X β For the matrx groups U = (U 1, U,, U p ), Y = (Y 1, Y,, Y p ), Z = (Z 1, Z,, Z p ) and W = (W 1, W,, W p ), we defne T ν (U, Y, Z, W ) = T ν (L), ν = 1,,, N, where the matrx groups L = (L 1, L,, L p ) s defned such that L = (U +Y +Z +W ) for I[1, p] It s obvous that L (t) = X X (t) Therefore, T ν (Ũ (t), Ỹ (t), Z (t), W (t) ) = T ν ( L (t) ) = T ν (X ) T ν (X (t) ) = R (t) ν Suppose that the matrces R, Q SOC p p for I[1, p] are gven Assume that t steps of Algorthm 1, wth κ = 0, has been performed Evdently, the t-th approxmate soluton group X (t) = (X (t) 1, X(t),, X(t) p ) s a reflexve matrx group, e X (t) C p p (R, Q ) for I[1, p] Hence, L(t) = ( L (t) (t) (t) 1, L,, L p ) s a group of reflexve matrces, e, L (t) C p p r (R, Q ) for I[1, p] In addton, for two gven arbtrary matrces A and B, t s not dffcult to see that Re[tr(AB)] = Re[tr(BA)] = Re[tr(A H B H )] Therefore, we get Ũ (t) = Re[tr[ p =1 ω 4Ns 1 { p [ ( =1 Re tr (t) (Ũ ) H Ũ (t) ]] = 1 16s 1 ( L (t 1) L (t 1) + R A H νµ T ν(ũ (t 1), Ỹ (t 1), Z (t 1), W )]} (t 1) )Bνµ H Q ) { p + ω 16N s =1 1 N ) H ( N s1 AH νµ T ν(ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) )Bνµ H s1 AH νµ T ν(ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) )B H νµ +R A H νµ T ν(ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) )Bνµ H Q } 1 16s 1 { [ Re + Re L (t 1) ( tr ( p [ tr =1 A νµ ω N s1 4Ns 1 ( (t 1) L B νµ ) ( ( p =1 A νµ R (t 1) L Q B νµ ) { p + ω N s1 N s =1 1 T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] H (t 1) ) ( T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] } H (t 1) ) A H νµ T ν(ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) )Bνµ H
10 10 F P A Bek, D K Salkuyeh and M M Moghadam +R A H νµ T ν(ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) )Bνµ H Q } 1 { ( N s1 [tr Re ( p =1 A (t 1) νµ L B νµ ) ω Ns 1 + ω 4N s 1 { p N s1 =1 16s 1 L (t 1) ( T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) A νµ Bνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) } ) H )] } Smlarly, we can see that Ỹ (t) 1 { 16s ω N s Ns + ω 4N s L (t 1) { p N s =1 ( [tr Re ( ( p =1 C (t 1) νµ L D νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] } H (t 1) ) C νµ Dνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) }, Z (t) 1 { 16s 3 ω N s3 Ns 3 + ω 4N s 3 L (t 1) { p N s3 =1 ( [tr Re ( ( p =1 M (t 1) νµ L N νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] } H (t 1) ) M νµ Nνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) }, and, W (t) 1 16s L (t 1) 4 { ( ω N s4 [tr Re ( ( p =1 H (t 1) νµ L G νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] } H (t 1) ) Ns 4 + ω 4N s 4 { p N s4 =1 H νµ Gνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) } Assume that ( Λ (t) = 4N s 1 Ũ (t) + s Ỹ (t) + s Z(t) 3 + s ) 4 W (t)
11 On the generalzed Sylvester-transpose and conjugate matrx equatons 11 By some straghtforward computatons, we get 0 Λ (t) Λ (t 1) ω { N s1 Re [tr ( ( ( p =1 A (t 1) νµ L B νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] H (t 1) ) + ( s [tr Re ( ( p =1 C (t 1) νµ L D νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] H (t 1) ) + ( s 3 [tr Re ( ( p =1 M (t 1) νµ L N νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] H (t 1) ) + ( s 4 [tr Re ( ( p =1 H (t 1) νµ L G νµ ) T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W ) )] } H (t 1) ) +ω { p =1 N s1 + p N s =1 + p N s3 =1 A νµ Bνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) C νµ Dνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) + p N s4 =1 Λ (t 1) ω N +ω { p =1 N s1 + p N s3 =1 N M νµ Nνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) H νµ Gνµ Tν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) } T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) A νµ Bνµ + q N =1 M νµ Nνµ + p N =1 T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) s4 s C νµ Dνµ } H νµ Gνµ As ω satsfes n (34), by some straghtforward computatons, we have: ( { p Λ (t) Λ (t 1) ω ω N s1 =1 A νµ Bνµ + s C νµ Dνµ + s 3 M νµ Nνµ + s4 }) H νµ Gνµ N T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) = Λ (t 1) ω ( ω Θ) N T ν (Ũ (t 1), Ỹ (t 1), Z (t 1), W (t 1) ) Λ (0) ω ( ω Θ) t 1 T ν (Ũ (ρ 1), Ỹ (ρ 1), Z (ρ 1), W (ρ 1) ) Therefore, 0 ω ( ω Θ) t 1 ρ=0 N ρ=0 N T ν (Ũ (ρ 1), Ỹ (ρ 1), Z (ρ 1), W (ρ 1) ) Λ (0),
12 1 F P A Bek, D K Salkuyeh and M M Moghadam whch shows that 0 ω ( ω Θ) ρ=0 N N lm t From the convergence theorem of seres, we conclude that T ν (Ũ (t), Ỹ (t), Z (t), W (t) ) T ν (Ũ (ρ 1), Ỹ (ρ 1), Z (ρ 1), W (ρ 1) ) Λ (0) < Hence, lm T ν(ũ (t), Ỹ (t), Z (t), W (t) ) = 0 t Or equvalency, lm t R(t) ν = 0, ν = 1,,, N From Theorem 33, we can conclude the result mmedately = 0 Wth a same strategy employed n the proof of Theorem 35, we may establsh the followng theorem Theorem 36 Suppose that the lnear coupled matrx equatons (14) has unque antreflexve soluton group X = (X 1, X,, X p) If the parameter ω satsfes the nequalty (34) 0 < ω < Θ, such that Θ = N p =1 Θ ν, where, Θ 1ν = s 1 A νµ B νµ, Θ ν = s C νµ D νµ Θ 3ν = s 3 M νµ N νµ, Θ 4ν = s 4 H νµ G νµ Then the teratve soluton groups X (t) = (X (t) 1, X(t),, X(t) p ), t = 1,, 3,, computed by Algorthm 1 (wth κ = 1), converge for any ntal ant-reflexve matrx group X (1) = (X (1) 1, X(1),, X(1) p ) 4 Numercal experments In ths secton, we present two numercal examples to show the effectveness of the proposed algorthm All the numercal experments presented n ths secton were computed n double precson wth some Matlab codes on a Pentum 4 PC, wth a 306 GHz CPU and 100GB of RAM Example 41 We consder the followng matrx equaton (41) AXB + CX T D + M XN + HX H G = F, where A = D = H = B = M = G = C = N =
13 On the generalzed Sylvester-transpose and conjugate matrx equatons ω=00337 ω=0050 ω=0000 log 10 δ k Number of teratons (k) Fgure 1 log 10 δ k versus k for the (R, Q)-reflexve soluton of (41) and F = The exact soluton of (41) s X = whch s (R, Q)-reflexve, where (4) R = Q = Here, we menton that R, Q SOC 3 3 We apply Algorthm 1 wth κ = 0 to solve Problem 1 correspondng to system (41) The ntal guess was taken to be the zero matrx X (0) 1 = 0 and the stoppng crteron δ k = R k F R 0 F < 10 5, was used where R k s the resdual of (41) at kth teraton For ω = 00337, 050, 0000 the method converges n 53, 73 and 9 teratons, respectvely For ω = 00337, the computed soluton s X (53) = whch s n good agreement wth the exact soluton In Fgure 1 the convergence hstory of the method s dsplayed
14 14 F P A Bek, D K Salkuyeh and M M Moghadam 0 1 ω=00 ω=00180 ω=0010 log 10 δ k Number of teratons (k) Fgure log 10 δ k versus k for the (R, Q)-ant-reflexve soluton of (41) We now consder (41) wth the rght-hand sde F = The exact soluton of the system s X = whch s n C 3 3 a (R, Q) where R and Q are defned by (4) All of the other assumptons are as before Performng Algorthm 1 to the matrx equaton wth κ = 1, the method converges n 8, 101 and 154 teratons for ω = 00, 00180, 0010, respectvely For ω = 00 the computed soluton s X (8) = We observe that the method has provded a good approxmate soluton for the system The convergence hstory s dsplayed n Fgure Example 4 In ths example, we consder the system of matrx equatons (43) { X1 + A 1 X 1 B 1 + M 1 X1 N 1 + C X T D + H X H G = F 1, X 1 + Ã1X 1 B1 + M 1 X1 Ñ 1 + C X T D + H X H G = F,
15 On the generalzed Sylvester-transpose and conjugate matrx equatons 15 where and A 1 = N 1 = H = B 1 = C = G = B 1 = C = G = M1 = D = F 1 = F = M 1 = D = Ã 1 = Ñ 1 = H = The exact soluton of Eq (43) s the matrx group (X1, X ) where X1 = 1 1 X = Here, X1 C3 3 r (R 1, Q 1 ) where R 1 = R and Q 1 = Q are as n prevous example and X C3 3 r (R, Q ), where R = Q = We apply Algorthm 1 wth κ = 0 for solvng system (43) The ntal guess was taken to be the zero matrx group (X (0) ) = (0, 0) and the stoppng crteron 1, X(0) δ k = max{ R(k) F R (0) F : = 1, } < 10 5,
16 16 F P A Bek, D K Salkuyeh and M M Moghadam 0 1 ω=0036 ω=006 ω=0016 log 10 δ k Number of teratons (k) Fgure 3 log 10 δ k versus k for the (R, Q )-reflexve of (43) was used, where R () k s the resdual of the th equaton of (43) at teraton k For ω = 0036, w = 006, 0016 the method, respectvely, converges n 79, 110 and 181 teratons For ω = 0036 the computed soluton s (X (79) 1, X (79) ), where X (79) 1 = X (79) = As seen the approxmate soluton group (X (79) 1, X (79) ) s n good agreement wth the exact soluton group The correspondng results are also depcted n Fgure 3 We now change the rght-hand sde of (43) to F 1 = 1 10 F = In ths case, the exact soluton of the system s (X1, X ), where X1 = X = We have X C3 3 a (R, Q ), for = 1, All of the assumptons are as before Algorthm 1 wth k = 1 converges n 180, 3 and 336 teraton, respectvely, for ω = 00, 00180,
17 On the generalzed Sylvester-transpose and conjugate matrx equatons ω=00 ω=00180 ω=0010 log 10 δ k Number of teratons (k) Fgure 4 log 10 δ k versus k for the (R, Q )-ant-reflexve of (43) 0010 For w = 00 the computed soluton by Algorthm 1 s (X (180) 1, X (180) ) where X (180) 1 = X (180) = The convergence hstory of the method s shown n Fgure 4 5 Concluson Ths paper has been devoted for fndng the reflexve (ant-reflexve) soluton group of a general class of complex coupled lnear matrx equatons To ths end, usng herarchcal dentfcaton prncple, an teratve algorthm has been constructed We have establshed that the proposed algorthm converges to the reflexve (ant-reflexve) soluton group of the mentoned coupled lnear matrx equatons for any ntal reflexve (ant-reflexve) soluton group In order to llustrate the feasbly and effectvely of the presented algorthm, some numercal experments have been gven References [1] F P A Bek and D K Salkuyeh, On the global Krylov subspace methods for solvng general coupled matrx equaton, Comput Math Appl, 6 (011) [] D S Bernsten, Matrx Mathematcs: theory, facts, and formulas, Second edton, Prnceton Unversty Press, 009 [3] A Bouhamd and K Jblou, A note on the numercal approxmate solutons for generalzed Sylvester matrx equatons wth applcatons, Appl Math Comput, 06 (008) [4] XW Chang and JSWang, The symmetrc soluton of the matrx equatons AX + Y A = C, AXA T + BY B T = C and (A T XA, B T XB) = (C, D), Lnear Algebra Appl, 179 (1993) [5] HC Chen, Generalzed reflexve matrces: specal propertes and applcatons, SIAM Journal of Matrx Analyss and Applcatons, 19 (1998) [6] J L Chen and X H Chen, Specal matrces, Tsnghua Unversty Press, 00 (In Chnese) [7] M Dehghan and M Hajaran, The general coupled matrx equatons over generalzed bsymmetrc matrces, Lnear Algebra Appl, 43 (010)
18 18 F P A Bek, D K Salkuyeh and M M Moghadam [8] M Dehghan and M Hajaran, An teratve algorthm for solvng a par of matrx equaton AY B = E, CY D = F over generalzed centro-symmetrc matrces, Comput Math Appl, 56 (008) [9] M Dehghan and M Hajaran, Analyss of an teratve algorthm to solve the generalzed coupled Sylvester matrx equatons, Appl Math Model, 35 (011) p [10] M Dehghan and M Hajaran, Solvng the generalzed Sylvester matrx equaton A XB + =1 q C jy D j = F over reflexve and ant-reflexve matrces, Internatonal Journal of Control, Automaton, j=1 and Systems, 9 (1) (011) [11] M Dehghan and M Hajaran, The generalsed Sylvester matrx equatons over the generalsed bsymmetrc and skew-symmetrc matrces Internatonal Journal of Systems Scence, DOI:101080/ (011) [1] F Dng and T Chen, On teratve solutons of general coupled matrx equatons, SIAM J Control Optm, 44 (006) [13] F Dng, PX Lu and J Dng, Iteratve solutons of the generalzed Sylvester matrx equatons by usng the herarchcal dentfcaton prncple, Appl Math Comput, 197 (008) [14] M Hajaran and M Dehghan, The generalzed centro-symmetrc and least squares generalzed centrosymmetrc solutons of the matrx equaton AY B + CY T D = E, Math Meth Appl Sc, 34 (011) [15] G X Huang, F Yng and K Gua, An teratve method for skew-symmetrc soluton and the optmal approxmate soluton of the matrx equaton AXB = C, J Comput Appl Math, 1 (008) [16] K Jblou and AJ Rquet, Projecton methods for large Lyapunov matrx equatons, Lnear Algebra Appl, 415 (006) [17] F L L, X Y Hu and L Zhang, The generalzed ant-reflexve solutons for a class of matrx equaton (BX = C, XD = E), Computonal and Appled Mathematcs, 7 (1) (008) [18] J-F L, X-Y Hu, X-F Duan and L Zhang, Iteratve method for mrror-symmetrc soluton of matrx equaton AXB + CY D = E, Bull Iran Math Soc, 36 () (010) [19] M L Lang, C H You and L F Da, An effcent algorthm for the generalzed centro-symmetrc soluton of the matrx equaton AXB = C, Numer Algorthms, 44 () (007) [0] Y Saad, Iteratve Methods for Sparse lnear Systems, PWS press, New York, 1995 [1] DK Salkuyeh and F Toutounan, New approaches for solvng large Sylvester equatons, Appl Math Comput, 173 (006) 9 18 [] C Song, G Chen and L Zhao, Iteratve solutons to coupled Sylvester-transpose matrx equatons, Appl Math Model, 35 (011) [3] X Wang and W Wu, A fnte teratve algorthm for solvng the generalzed (P, Q) reflexve soluton of the lnear systems of matrx equatons, Math Comput Model, 54 (011) [4] A G Wu, L Lv and G-R Duan, Iteratve algorthms for solvng a class of complex conjugate and transpose matrx equatons, Appl Math Comput, 17 (011) [5] A G Wu, B L, Y Zhang and G-R Duan, Fnte teratve solutons to coupled Sylvester-conjugate matrx equatons, Appl Math Model, 35 (011) [6] JJ Zhang, A note on the teratve solutons of general coupled matrx equaton, Appl Math Comput, 17 (011) [7] Z Al Zhour and A Klcman, Some new connectons between matrx products for parttoned and non-parttoned matrces, Comput Math Appl, 54 (6) (007) [8] B Zhou and GR Duan, On the generalzed Sylvester mappng and matrx equaton, Syst Contro Lett, 57 (3) (008) 00 08
A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS
ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS Fatemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan,
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationLeast-Squares Solutions of Generalized Sylvester Equation with Xi Satisfies Different Linear Constraint
Advances n Lnear Algebra & Matrx heory 6 6 59-7 Publshed Onlne June 6 n ScRes. http://www.scrp.org/journal/alamt http://dx.do.org/.6/alamt.6.68 Least-Squares Solutons of Generalzed Sylvester Equaton wth
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationAN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS
AN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS DAVOD KHOJASTEH SALKUYEH and FATEMEH PANJEH ALI BEIK Communicated by the former editorial board Let A : R m n R m n be a symmetric
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationThe Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites
7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationFixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind
MATEMATIKA, 217, Volume 33, Number 2, 191 26 c Penerbt UTM Press. All rghts reserved Fxed pont method and ts mprovement for the system of Volterra-Fredholm ntegral equatons of the second knd 1 Talaat I.
More informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationTHE Hadamard product of two nonnegative matrices and
IAENG Internatonal Journal of Appled Mathematcs 46:3 IJAM_46_3_5 Some New Bounds for the Hadamard Product of a Nonsngular M-matrx and Its Inverse Zhengge Huang Lgong Wang and Zhong Xu Abstract Some new
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationSolution 1 for USTC class Physics of Quantum Information
Soluton 1 for 018 019 USTC class Physcs of Quantum Informaton Shua Zhao, Xn-Yu Xu and Ka Chen Natonal Laboratory for Physcal Scences at Mcroscale and Department of Modern Physcs, Unversty of Scence and
More informationA Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function
A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationMINIMUM 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 informationarxiv: v1 [math.na] 10 Jan 2018
REINED UPPER BOUNDS OR THE CONVERGENCE O THE RANDOMIZED EXTENDED KACZMARZ AND GAUSS-SEIDEL ALGORITHMS KUI DU arxv:1801.0350v1 math.na 10 Jan 018 Abstract. The randomzed extended Kaczmarz and Gauss-Sedel
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationNew Method for Solving Poisson Equation. on Irregular Domains
Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
More informationρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationLecture 4: Constant Time SVD Approximation
Spectral Algorthms and Representatons eb. 17, Mar. 3 and 8, 005 Lecture 4: Constant Tme SVD Approxmaton Lecturer: Santosh Vempala Scrbe: Jangzhuo Chen Ths topc conssts of three lectures 0/17, 03/03, 03/08),
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationfor j = 1, 2,..., q. Consequently, we may define the norm of X = (X 1, X 2,..., X q ) as follows:
A CYCLIC IERAIVE APPROACH AND IS MODIIED VERSION O SOLVE COUPLED SYLVESER-RANSPOSE MARIX EQUAIONS atemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationSolvability of Indefinite Stochastic Riccati Equations and Linear Quadratic Optimal Control Problems
*Manuscrpt 2nd revson) Clck here to vew lnked References Solvablty of Indefnte Stochastc Rccat Equatons and Lnear Quadratc Optmal Control Problems Janhu Huang a Zhyong Yu b a Department of Appled Mathematcs,
More informationSolution 1 for USTC class Physics of Quantum Information
Soluton 1 for 017 018 USTC class Physcs of Quantum Informaton Shua Zhao, Xn-Yu Xu and Ka Chen Natonal Laboratory for Physcal Scences at Mcroscale and Department of Modern Physcs, Unversty of Scence and
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationIdeal Amenability of Second Duals of Banach Algebras
Internatonal Mathematcal Forum, 2, 2007, no. 16, 765-770 Ideal Amenablty of Second Duals of Banach Algebras M. Eshagh Gord (1), F. Habban (2) and B. Hayat (3) (1) Department of Mathematcs, Faculty of Scences,
More informationPrimer on High-Order Moment Estimators
Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More information