Minimization of l 2 -Norm of the KSOR Operator
|
|
- Joanna Warren
- 5 years ago
- Views:
Transcription
1 ournal of Matheatcs and Statstcs 8 (): 6-70, 0 ISSN Scence Publcatons do:0.38/jssp Publshed Onlne 8 () 0 ( Mnzaton of l -Nor of the KSOR Operator Youssef, I.K. and A.I. Alzak Departent of Matheatcs, Faculty of Scence, An Shas Unversty, Caro, 566, Egypt Receved , Revsed 0--9; Accepted 0--9 ABSRAC We consder the proble of nzng the l -nor of the KSOR operator when solvng a lnear systes of the for AX = b where, A = I +B ( = -B, s the acob teraton atrx), B s skew syetrc atrx. Based on the egenvalue functonal relatons gven for the KSOR ethod, we fnd optal values of the relaxaton paraeter whch nze the l -nor of the KSOR operators. Use the Sngular Value Decoposton (SVD) technques to fnd an easy coputable atrx untary equvalent to the teraton atrx KSOR. he optu value of the relaxaton paraeter n the KSOR ethod s accurately approxated through the nzaton of the l -nor of an assocated atrx ( ) whch has the sae spectru as the teraton atrx. Nuercal exaple llustratng and confrng the theoretcal relatons are consdered. Usng SVD s an easy and effectve approach n provng the egenvalue functonal relatons and n deternng the approprate value of the relaxaton paraeter. All calculatons are perfored wth the help of the coputer algebra syste Matheatca 8.0. Keywords: KSOR Iteratve Method, l -Nor, Sngular Value Decoposton (SVD). INRODUCION We consder lnear systes of the for Equaton : a jx j = b j,a 0, =,, L, () j=.. acob Method Equaton 3: [ n+ ] [ n] [ n] x = b ajx j ajx j a j= j= + (3) Wth a j = - a j for j and the syste adts a unque soluton. hs syste of equatons can be wrtten as Equaton : A X b,ax, b R, A R = () Such lnear systes arse n any dfferent applcatons for exaple n the fnte dfference treatent of the Korteweg de Vres equaton, Buckley (977). Also, s-lar lnear systes appears n the treatent of coupled haronc equatons, Ehrlch (97). In the teratve treatent of lnear systes, we use the splttng, A = D-L-U, where D = d I s the dag-onal part of A, for soe non-zero constant d, -L s the strctly lower-trangular part of A and -U s the strctly uppertrangular part of A, Woznck (00). he acob Method n atrx for s Equaton : X = X + D b = D (L + U) () [n+ ] [n] j s the acob teraton atrx, t s clear that n ths case s a skew syetrc atrx... he SOR Method s Equaton 5: [ n+ ] [ n ] [n ] [n] [n] x = x + b + ajx j ajx j ax a j= j= updated coponents old coponents =,, L,; n = 0,, L Correspondng Author: Youssef, I.K., Departent of Matheatcs, Faculty of Scence, An Shas Unversty, Caro, 566, Egypt (5) Scence Publcatons 6
2 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 where, (0,) s a relaxaton paraeter, = gves the well-known Gauss-Sedel ethod. he SOR Method n atrx for s Equaton 6: X = X + (D L) b [n+ ] [n] SOR Scence Publcatons ( = + SOR (D L) D U) (6) where, SOR s the SOR teraton atrx. he choce of the relaxaton paraeter s very portant for the convergence rate of the SOR ethod. For certan classes of atrces (-cyclc consstently ordered) wth property A, n the sense of Young (003), for such systes there s a functonal egenvalue relaton of the for Equaton 7: / ( λ + ) = µλ (7) where, λ s an egenvalue of the SOR and µ s a correspondng egenvalue of the. Most work on the choce of s to nze ρ( SOR ) whch s only an asyptotc crtera of the convergence rate of lnear statonary teratve ethod, Hadjdos and Neuann (998). In real coputatons, we have to consder average convergence rate Mlleo et al. (006). he deternaton of the optal value of the relaxaton paraeter opt can be obtaned wth the help of the egenvalue functonal relaton (7). Young (003), deterned opt when has only real egenvalues and ρ( ). In ths case we have: opt = + ( ρ ) where the optalty s understood n the sense of the nzaton of ρ( SOR ). Maleev (006) deterned opt when has only pure agnary egenvalues and ρ ( ). In ths case we have: opt = + + ( ρ ) Golub and Plls (990) ntroduced a sple proof for the egenvalue functonal relaton (7) by the use of the Sngular Value Decoposton (SVD) approach for real syetrc atrces. Yn and Yuan (00) consdered the skew syetrc case as well as the syetrc case. Mlleo et al. (006) consdered the nzaton of l - nors of the SOR and MSOR operators for the skew syetrc case he KSOR Method s In a recent work Youssef (0), ntroduced the KSOR ethod Equaton 8 and 9: [ n+ ] [ n] x = x + a b a x a x a x [n+ ] [n] [n+ ] j j j j 3 j= j= Assued updated old updated =,, L,, R [,0] [ n+ ] x = ( + ) [ n ] [n+ ] [n] x + b ajx j ajx j a j= j= + =,, L,, R [,0] (8) (9) he KSOR Method n atrx notaton s Equaton 0: ( ( X = X + + D L) b [n+ ] [n] KSOR KSOR = + D L) [D + U] (0) where, KSOR s the KSOR teraton atrx (operator). As t was n the SOR the rate of convergence of the KSOR ethod depends on the choce of the relaxaton paraeter. For certan classes of atrces (-cyclc consstently ordered wth property A), Youssef (0) establshed the egenvalue functonal relaton Equaton : / β + β = µ β () where, β I 's are the egenvalues of the KSOR and µ 's are the egenvalues of the acob teraton atrx. he egenvalue functonal relaton () can be proved by the use of the SVD technque... Sngular Value Decoposton Sngular Value Decoposton (SVD) of a atrx B R l s a factorzaton: ( q) l B = U ΣV, Σ = dag s,s, L,s R,q = { l,} where, s s s q 0, U and V are orthogonal atrces such that:
3 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 U U = IP, V V = Iq We consder n ths study the case studed by Yn and Yuan (00) also by Mlleo et al. (006) n whch the coeffcent atrx take the for Equaton : IP F A = F Iq () where, F R p q wth p + q = and p q. In ths case the acob teraton atrx becoes Equaton 3: 0 F = F 0 (3) It s clear that s skew syetrc and accordngly adts pure agnary egenvalues and the KSOR teraton atrx KSOR becoes Equaton : heore Let Abe the atrx gven by (), then Equaton 5: { µ } = σ = ( σ ) = σ( FF ) = { S } =,...,q (5) where, µ are the egenvalues of, S are the squares of the sngular values of F and (σ( )) s the set of squares of the egenvalues of. Proof Usng the SVD to decopose the corner block atrx F, we obtan Equaton 6: F = UΣ V (6) where, p p atrx U and q q atrx V are orthogonal,.e.: U U = I p,v V = Iq I P F + + = ( + ) + ( + ) KSOR F I q F F () and s the p q dagonal atrx (of sngular values) defned n (7). he egenvalues of the atrx: FF = UΣΣ U are {s,s,...,s } q Usually, researchers work on obtanng the optu value of the relaxaton paraeter n the sense of nzng the spectral radus of the teraton atrx or an equvalent quantty. We use the SVD approach n provng the egenvalue functonal relaton for the KSOR ethod. Also, we use the sae arguent of Golub and Plls (990) to defne a atrx ( ) whch has the sae spectru as the teraton atrx KSOR. Our objectve s to fnd the optal value of the relaxaton paraeter whch nzes the l -nor of the KSOR operator and llustrate the theoretcal results through applcatons to a nuercal exaple.. MAERIALS AND MEHODS We use the SVD n provng the relaton between the egenvalues of the skew syetrc acob teraton atrx and the sngular values of a block sub-atrx F, theore (). We wll prove the relaton between the egenvalue functonal relaton between the egenvalues of and KSOR by usng SVD, theore (). We wll fnd the spectal radus of (( KSOR ) KSOR ), theore (3). We wll fnd the optal value of the relaxaton paraeter to nze the l -nors of the KSOR theore (). Scence Publcatons 63 FF U = UΣΣ U U = UΣΣ Accordngly, the egenvectors of the atrx FF equal to the coluns of orthogonal atrx U. Slarly, F F = V V has ts egenvectors equal to the coluns of orthogonal atrx V. he nuber of nonzero sngular values S of F s equal to the rank of F. Substtutng the sngular value decoposton (6) nto the corner eleents F, F of (3), we obtan (8) Equaton 7 and 8: s 0 L L 0 0 s 0 0 q q M O M sq M Σ = 0 L L L sq 0 0 L (p q) q M L M 0 0 L 0 F 0 UΣV = = F 0 VΣ U 0 (7) (8)
4 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 Now, we wll fnd a relaton between the sngular values S (dagonal of ) and the egenvalues µ of where =,,..,q. For µ 0 an egenvalues of, we have Equaton 9: Coparng the block entres of n (8) and (), we obtan the equaltes: H F = XY = UΣ V x x x x ff,,,t y = µ y = µ = y y (9) H F = YX = VΣ U So that, the nuber of non-zero egenvalues of equals t that s coe n pars ±µ. o account for zero egenvalues, we wrte Equaton 0: z z 0 (0) 0,,,r z = = = z 0 We construct the n n non-sngular atrx W whose coluns are the orthogonal egenvectors of (9) and (0): Scence Publcatons X X Z W = n = p + q = t + r Y Y Z Note that the t coluns of p t atrx X and q t atrx Y are the t respectve egenvectors of (9), the r coluns of p r atrx Z and q r atrx Z coe fro the r null vectors of (0). Ordnarly, we would scale the coluns of W to produce an orthogonal atrx as a techncal convenence, however, we assue that the coluns of W are scaled so that Equaton : H WW = I () Let the atrx I denote the t t atrx whose dagonal eleents are the t postve egenvalues µ of (9). hen (9) and (0) can be cobned to produce the sngle atrx equaton: 0 0 X X Z X X Z 0 0 Y Y Z = Y Y Z Whch, when ultpled through on the rght by W H we get Equaton : H 0 XY = H YX 0 () 6 And we see Equaton 3: 0 Y Y 0 F F H X X 0 FF 0 = = H UΣΣ U 0 = 0 VΣ ΣV Accordngly: { } ( ) ( ( ) ) { } µ = σ = σ = σ FF = S. =,,...,q heore (3) Let KSOR and be gven, respectvely, by () and (3). hen the egenvalues µ σ( ) and β σ( KSOR ) are lnked by the functonal relaton Equaton : ( β ) + β = µβ () Moreover, the egenvalues and -nor of atrces KSOR and ( ) are related as follows Equaton 5-9: ( KSOR ) ( ) σ = σ (5) ( KSOR ) ( ) ax ( ) ρ = ρ = ρ (6) q = ( ) = ax = ( ) (7) k k k KSOR q Where: = dag( ( ), L, I ) (8) + q p q s + + ( ) = =,.q s s ( + ) + ( + ) (9)
5 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 where, s are the sngular values of F. Proof By usng the sngular value decoposton of the atrx F we have F = U V where U and V orthogonal atrces, then the atrx KSOR has the for Equaton 30: I P UΣV + + = ( + ) + ( + ) KSOR VΣ U I q VΣ ΣV Let the orthogonal atrces U and V be factored out then KSOR has the for Equaton 3: KSOR U 0 = 0 V I P Σ U V I Σ q Σ Σ ( + ) + ( + ) (30) (3) s + + ( ) = =, L,q (3) s s ( + ) + ( + ) where, s are the sngular values of F. We have seen that each eber of the faly of KSOR teraton atrx KSOR s untarly equvalent to a atrx ( ) havng only or atrces on the an dagonal. hat s, fro (3) and (33) Equaton 35: Q P PQ for untary QP KSOR = (35) Untary equvalent (35) ples that both the egenvalues and the -nors agree for both ( - fales of) atrces KSOR and ( ) then we have (5), (6) and (7). Fro (5) we have Equaton 36: ( KSOR ) ( ) det β I = 0 ff det β I = 0 (36) Fro the rght-hand deternant above, we see, fro (33), (3), that all β are constraned by Equaton 37: Note that (3) reveals the untarly equavalent atrx Γ wth four block subatrces, each of whch s a dagonal sub-atrx where Equaton 3: ( ) β =,ordet β I = 0; =,,,q + hen: (37) I P Σ + + Γ = ( + ) + ( + ) ) Σ I q Σ Σ U 0 U 0, Q Q = = 0 V 0 V and (3) hs ean that there s a perutaton atrx P whch pulls the two corner dagonal atrces to the an dagonal,.e., PΓ P has only or atrces along ts an dagonal. When Γ of (3) s peruted nto the block dagonal for, we obtan Equaton 33: = PΓ P = dag ( ), ( ), I + q pq where each atrx ( ) s gven by Equaton 3: (33) β s + + det( βi ( )) = = 0 s β + s ( + ) + ( + ) hus we fnd: ( I ) det β = β + + S β S + 3 = 0 ( + ) + ( + ) β + s β = 0 + ( + ) β =,or ( β + β ) + s β = 0 =,, q + Accordngly, wth the help of (5) we can wrte Equaton 38: β =,or ( β + β ) = µ β =,, q + (38) Scence Publcatons 65
6 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 Now the left-hand equaton, β = appears n + (33), (3) once for each occurrence of a zero egenvalue for, but β = s a specal case of the rght-hand + sde of (38), naely, when µ s set to zero. herefore, (38) s descrbed by the sngle relaton (). Fro the prevous theore we see the l -nor of the KSOR teraton atrx s equvalent to the l -nor of the ( ) then, equvalent to the square root of the spectral radus of ( ( )) ( ). hen, the proble of nzng the l -nor of the KSOR teraton atrx s equvalent to the proble of nzng the square root of the spectral radus of ( ( )) ( ). heore 3 Under the assuptons of the theore, for K = the nu of the of l -nor of the KSOR s equvalent to Equaton 39-: δ = : n δ = n R [,0] R [,0] ax [(t) + [ (t) C] ], Where: t ( + ) (,t) : = + ( + t) ( + ) ( + ) (39) (0) s + ( + ) ( ) ( ) = s s + + ( + ) s + + s s ( + ) + ( + ) ( ) ( ) = s + ( + ) ( + ) s s + 3 ( + ) ( + ) s s 3 + ( + ) ( + ) s s ( + ) + ( + ) It s easy to see Equaton 5: det( ( ) ( ) β I ) = β S + + ( + ) + ( + S ) β + Set s = t and defne Equaton 6 and 7: = ( + ) c : (3) () (5) (6) = ( + ) C : () t,t : t ( + ) ( + ) ( ) = + ( + ) (7) Wth t s the square of the spectral radus of the acob teraton atrx. Proof Fro the theore we have Equaton : = ( ) = ax ( ) KSOR q q = ax{ ρ ( ( ) ( ))} Now we go to calculate Equaton 3 and : Scence Publcatons () 66 herefore Equaton 8: det( ( ) ( )) β I ) = β (t ) β+ C (8) Solvng ths quadratc equaton, we fnd that Equaton 9: β = {(t ) ± [ (t ) C] } (9) Note that, for any t 0, R/[-,0], we have Equaton 50:
7 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 (t) 0 (t) C 0 (50) Note that: he egenvalues of the atrx ( ) ( ) are nonnegatve nubers and for the roots of the char-acterstc Equaton 5 and 5: β t β + C = 0 =,,...q (5) β = 0 ( + ) he largest of the two roots of (5) s gven by: L : = L ( ) {(, t ) + [ (, t) C( )] } =, q (5) Proof Fro (0) we see Equaton 56 and 57: t (,t) : = + ( + ) ( + ) l t 0 for any + R / [,0] d,t 3 t : = + l+ t 3 5 d ( + ) ( + ) hen we fnd Equaton 58: ( ) d,t d 0 for any (56) (57) (58) he axu value of each L s obtaned for the axu value of the correspondng (, t ). Note that: d(t) = ( t + ) 0,for any t 0 dt ( + ) Now for any t 0, (t) s a strctly ncreasng functon of t. Lkewse, L s strctly ncreasng functon of t, set Equaton 53 and 5: he functon (, t) ncreases strctly n the nterval (-, -). Dfferentatng L(, t) defned n (5) wth respect to, and usng (0) and () we fnd Equaton 59: d 8 5 dl d d + ( + ) = + d d ( + ) (59) L : = L = ax L =,, L,q (53) It s clear that Equaton 60: hen: dl 0 for any (, ) d (60) ( ) L : = L =,t +,t C( ) Scence Publcatons (5) Wth t = ρ ( ). he spectral radus of the atrx ( ) ( ) for any gven, s the quantty L, then fro (53) the spectral radus of the atrx ( ) ( ) s L. heore he value of, whch has nu n (39), s the unque real postve root n (0, ) of the Equaton 55: f t t 0 = + + = (55) 67 So that, the functon L(, t) ncreases strctly n the dl nterval (-,-). We wll take lt of the functon d as, we obtan Equaton 6: d 8 5 dl d + d ( + ) L = L + L 0 d 0 d 0 ( + ) hen when, dl we have 0 d lt as and obtan Equaton 6: + (6), now we take
8 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 d dl d d ( + ) L = L L + 0 d 0 d 0 ( + ) Set Equaton 63 and 6: (6) hat s: d d d ( ) d + d d ( ) 5 ( ) = d 8 W = + d ( + ) 5 (63) Elnatng ( d/d ) and dvdng through -, we obtan: V = ( + ) Now splfy (63) and (6) as: t + t + ( t + t) ( w + ) = V ( t t ) hen we have Equaton 65: dl L = 0 0 d (6) 0 as 0 (65) herefore, fro (6) and (65) L(, t) has a odd nuber of local nu ponts n (0, ). For any fxed t (0, ), the global nu pont of L( dl, t) s a pont n (0, ) at whch d vanshes. dl Settng = 0 then: d d d 8 = d ( + ) d ( + ) 5 ( + ) d d = d d ( + ) ( + ) It now follows that: d d = d d + ( + ) Substtutng (56) for and (57) for d/d, we obtan Equaton 66: f t t = + (66) hen, we have Equaton 67 and 68: ( + ) + + t + t r ( ) = = t t t ( + ) + t + t r ( ) = = 0 t t t + (67) (68) herefore, f ( ) has a unque zero r ( ) n that nterval. So the r ( ) s a unque real postve root n (0, ) of the equaton (66), fro that and (6), we notes that Equaton 69: ( ) L r,t L L, t (69) ± hen: d d 8 = 5 d ( + ) d ( + ) So that r ( ) s a unque real postve root n (0, ) of the equaton whch has the nu of L( ). Exaple Consder a syste wth: Scence Publcatons 68
9 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 Fg.. he behvour of the spectral radus of the SOR as a functon of Fg.. he behavour of the l -nor of SOR as a functon of A =, b = For splcty we adapted the rght hand sde b as t was n Young (003) and Youssef (0) so that the exact soluton s x =, x =, x 3 =, x =. It s well known that, for ths syste we have. he egenvalues of the acob teraton atrx are the roots of the equaton: he roots are: µ + 0.5µ = 0 Fg. 3. he behvour of the spectral radus of the KSOR as a functon of µ = µ = I, µ 3 = µ = I For the atrx, F = the Sngular values are s = s = It s clear that the acob teraton atrx s a skew syetrc, accordngly ther egenvalues are pure agnary coplex nubers, and satsfes µ = s. Scence Publcatons 3. RESULS We used the SVD n provng the egenvalue functonal relaton for the KSOR operator he nzaton of the l -nor s used as a good estaton for deternng the optu value of the relaxaton paraeter n the KSOR ethod as well as n the SOR ethod 69 Fg.. he behavour of the l -nor of SOR as a functon of Fro Fg. and we see that the calculated results agree wth the theoretcal results of Mlleo et al. (006)
10 Youssef, I.K. and A.I. Alzak /ournal of Matheatcs and Statstcs 8 (): 6-70, 0 Fro Fg. 3 and we see that the calculated results agree wth our theoretcal results Nuercal exaple llustratng and confrng the theoretcal relatons s consdered Scence Publcatons. DISCUSION Young (003), consdered the proble why convergence of the SOR ethod wth the optu opt n the sense of nzng the spectral radus of the teraton atrx s soe what slower than what ght expected, the spectral radus s only an asyptotc easure of the rate of convergence of a lnear teratve ethod. In hs treatent Young (003), establshed a relaton between the egenvalues of certan atrces related to A (the SOR teraton atrx, SOR ) and those of certan block atrces. Golub and Plls (990) rased the queston of deternng, for each k, a relaxaton paraeter (0, ) whch nzes the Eucldean nor of the k th power of the SOR teraton atrx, assocated wth a real syetrc postve defnte atrx wth property A. Hadjdos and Neuann (998), used the reducton of the SOR operator ntroduced by Golub and Plls (990), wth the help of the SVD of the assocated block acob teraton atrx to obtan the nzng relaxaton paraeter for the case k =. Yn and Yuan (00), used the SVD to re-derve the egenvalue functonal relatons for block skew syetrc atrces for the AOR ethod. Mlleo et al. (006), consdered systes wth block skew syetrc acob teraton atrx and used the SVD n studyng the behavor of the SOR operator fro the l -nor pont of vew they deterned theoretcally the nzng relaxaton paraeter of the l -nor. Youssef (0), defned the KSOR operator, we used the SVD n re-prove the functonal egenvalue relaton for the KSOR operator and the correspondng untary block atrx ( ). we eployed the sae arguent as n Yn and Yuan (00), also n Mlleo et al. (006) for systes wth block skew syetrc acob teraton atrx and used the SVD n studyng the behavor of the l -nor of the KSOR operator. We deterned theoretcally the nzng relaxaton paraeter of the l -nor for the KSOR operator. We confred our theoretcal results by a nuercal exaple. We wll contnue ths study n a subsequent work n whch we wll consder a generalzatons of the KSOR operator CONCLUSION We used the sae arguent defned by Golub and Plls (990), used by Yn and Yuan (00) also by Mlleo et al. (006), we proved that the KSOR teraton atrx KSOR s untary equvalent to a atrx ( ) havng only or atrces on the dagonal. We nze the l -nor of the KSOR operator for atrces whose acob teraton atrx s skew syetrc. By our results, the optal value of the relaxaton paraeter s: =. opt (p( )) 6. REFERENCES Buckley, A., 977. On the soluton of certan skew syetrc lnear systes. SIAM. Nuer. Anal., : DOI: 0.37/07035 Ehrlch, L.W., 97. Coupled haronc equatons, SOR and Chebyshev acceleraton. Math. Coput., 6: Golub, G.H. and. Plls, 990. owards an Effectve wo-paraeter SOR Method. In: Iteratve Methods for Large Lnear Systes, Kncad, D.R. (Eds.), Acadec Press, New York, ISBN-0: , pp: Hadjdos, A. and M. Neuann, 998. Eucldean nor nzaton of the SOR operators. SIAM. Matrx Anal. Appl., 9: 9-0. DOI: 0.37/S Maleev, A.A., 006. On the SOR ethod wth overlappng subsystes. Coput. Math. Math. Phys., 6: DOI: 0.3/S Mlleo, I.,.H. Yn and.y. Yuan, 006. Mnzaton of l -nors of SOR and MSOR operators. Coput. Appled Math., 9: 3-. DOI: 0.06/j.ca Woznck, I. Z., 00. On perforance of SOR ethod for solvng nonsyetrc lnear systes. Coput. Appled Math., 37: DOI: 0.06/S (00) Yn,.H. and.y. Yuan, 00. Note on statonary teratve ethods by SVD. Appled Math. Coput., 7: DOI: 0.06/S (0) Young, D.M., 003. Iteratve Soluton of Large Lnear Systes. st Edn., Dover Publcatons, Mneola, New York, ISBN-0: , pp: 570. Youssef, I.K., 0. On the successve over relaxaton ethod.. Math. Stat., 8: DOI: 0.38/jssp
System in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationModified parallel multisplitting iterative methods for non-hermitian positive definite systems
Adv Coput ath DOI 0.007/s0444-0-9262-8 odfed parallel ultsplttng teratve ethods for non-hertan postve defnte systes Chuan-Long Wang Guo-Yan eng Xue-Rong Yong Receved: Septeber 20 / Accepted: 4 Noveber
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More information1. Statement of the problem
Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
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 informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
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 informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationCHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS
CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned
More informationarxiv: v2 [math.co] 3 Sep 2017
On the Approxate Asyptotc Statstcal Independence of the Peranents of 0- Matrces arxv:705.0868v2 ath.co 3 Sep 207 Paul Federbush Departent of Matheatcs Unversty of Mchgan Ann Arbor, MI, 4809-043 Septeber
More informationRiccati Equation Solution Method for the Computation of the Solutions of X + A T X 1 A = Q and X A T X 1 A = Q
he Open Appled Inforatcs Journal, 009, 3, -33 Open Access Rccat Euaton Soluton Method for the Coputaton of the Solutons of X A X A Q and X A X A Q Mara Ada *, Ncholas Assas, Grgors zallas and Francesca
More informationIntegral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions
Int J Open Probles Copt Math, Vol 7, No 4, Deceber 214 ISSN 1998-6262; Copyrght ICSS Publcaton, 214 www-csrsorg Integral Transfors and Dual Integral Equatons to Solve Heat Equaton wth Mxed Condtons Naser
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 informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 17. a ij x (k) b i. a ij x (k+1) (D + L)x (k+1) = b Ux (k)
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 08 LECTURE 7. sor method remnder: n coordnatewse form, Jacob method s = [ b a x (k) a and Gauss Sedel method s = [ b a = = remnder: n matrx form, Jacob method
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationfor Linear Systems With Strictly Diagonally Dominant Matrix
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1269-1273 On an Accelerated Overrelaxaton Iteratve Method for Lnear Systems Wth Strctly Dagonally Domnant Matrx By M. Madalena Martns*
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
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 informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationA new eigenvalue inclusion set for tensors with its applications
COMPUTATIONAL SCIENCE RESEARCH ARTICLE A new egenvalue ncluson set for tensors wth ts applcatons Cal Sang 1 and Janxng Zhao 1 * Receved: 30 Deceber 2016 Accepted: 12 Aprl 2017 Frst Publshed: 20 Aprl 2017
More informationImplicit scaling of linear least squares problems
RAL-TR-98-07 1 Iplct scalng of lnear least squares probles by J. K. Red Abstract We consder the soluton of weghted lnear least squares probles by Householder transforatons wth plct scalng, that s, wth
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 informationInternational Journal of Mathematical Archive-9(3), 2018, Available online through ISSN
Internatonal Journal of Matheatcal Archve-9(3), 208, 20-24 Avalable onlne through www.ja.nfo ISSN 2229 5046 CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS T. SHEKAR GOUD, JAGAN MOHAN RAO M AND N.CH.
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
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 informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationFixed-Point Iterations, Krylov Spaces, and Krylov Methods
Fxed-Pont Iteratons, Krylov Spaces, and Krylov Methods Fxed-Pont Iteratons Solve nonsngular lnear syste: Ax = b (soluton ˆx = A b) Solve an approxate, but spler syste: Mx = b x = M b Iprove the soluton
More informationy new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)
Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,
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 informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationBy M. O'Neill,* I. G. Sinclairf and Francis J. Smith
52 Polynoal curve fttng when abscssas and ordnates are both subject to error By M. O'Nell,* I. G. Snclarf and Francs J. Sth Departents of Coputer Scence and Appled Matheatcs, School of Physcs and Appled
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationA 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 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 informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. ) with a symmetric Pcovariance matrix of the y( x ) measurements V
Fall Analyss o Experental Measureents B Esensten/rev S Errede General Least Squares wth General Constrants: Suppose we have easureents y( x ( y( x, y( x,, y( x wth a syetrc covarance atrx o the y( x easureents
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 informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More informationTHE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York
#A8 INTEGERS 8 (8) THE ADJACENCY-PELL-HURWITZ NUMBERS Josh Hller Departent of Matheatcs and Coputer Scence Adelp Unversty New York johller@adelphedu Yeş Aküzü Faculty of Scence and Letters Kafkas Unversty
More informationApproximate Technique for Solving Class of Fractional Variational Problems
Appled Matheatcs, 5, 6, 837-846 Publshed Onlne May 5 n ScRes. http://www.scrp.org/journal/a http://dx.do.org/.436/a.5.6578 Approxate Technque for Solvng Class of Fractonal Varatonal Probles Ead M. Soloua,,
More informationASYMMETRIC TRAFFIC ASSIGNMENT WITH FLOW RESPONSIVE SIGNAL CONTROL IN AN URBAN NETWORK
AYMMETRIC TRAFFIC AIGNMENT WITH FLOW REPONIVE IGNAL CONTROL IN AN URBAN NETWORK Ken'etsu UCHIDA *, e'ch KAGAYA **, Tohru HAGIWARA *** Dept. of Engneerng - Hoado Unversty * E-al: uchda@eng.houda.ac.p **
More informationA Radon-Nikodym Theorem for Completely Positive Maps
A Radon-Nody Theore for Copletely Postve Maps V P Belavn School of Matheatcal Scences, Unversty of Nottngha, Nottngha NG7 RD E-al: vpb@aths.nott.ac.u and P Staszews Insttute of Physcs, Ncholas Coperncus
More informationElastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.
Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday
More informationSolutions for Homework #9
Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural
More informationThree Algorithms for Flexible Flow-shop Scheduling
Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
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 informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
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 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 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 informationGadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281
Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More informationChapter 1. Theory of Gravitation
Chapter 1 Theory of Gravtaton In ths chapter a theory of gravtaton n flat space-te s studed whch was consdered n several artcles by the author. Let us assue a flat space-te etrc. Denote by x the co-ordnates
More informationFUZZY MODEL FOR FORECASTING INTEREST RATE OF BANK INDONESIA CERTIFICATE
he 3 rd Internatonal Conference on Quanttatve ethods ISBN 979-989 Used n Econoc and Busness. June 6-8, 00 FUZZY ODEL FOR FORECASING INERES RAE OF BANK INDONESIA CERIFICAE Agus aan Abad, Subanar, Wdodo
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 informationDescription of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t
Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set
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 informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationPolynomial Barrier Method for Solving Linear Programming Problems
Internatonal Journal o Engneerng & echnology IJE-IJENS Vol: No: 45 Polynoal Barrer Method or Solvng Lnear Prograng Probles Parwad Moengn, Meber, IAENG Abstract In ths wor, we study a class o polynoal ordereven
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 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 informationOn an identity for the cycle indices of rooted tree automorphism groups
On an dentty for the cycle ndces of rooted tree autoorphs groups Stephan G Wagner Insttut für Analyss und Coputatonal Nuber Theory Technsche Unverstät Graz Steyrergasse 30, 800 Graz, Austra wagner@fnanzathtugrazat
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
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 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 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 informationCentroid Uncertainty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Problems
Centrod Uncertanty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Probles Jerry M. Mendel and Hongwe Wu Sgnal and Iage Processng Insttute Departent of Electrcal Engneerng Unversty of Southern
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 informationAUTO-CALIBRATION. FACTORIZATION. STRUCTURE FROM MOTION.
AUO-CALIBRAION. FACORIZAION. SRUCURE FRO OION. hank you for the sldes. hey coe ostly fro the followng sources. arc ollefeys U. of North Carolna artal Hebert CU Slvo Savarese U. of chgan Dan Huttenlocher
More informationQuantum Mechanics for Scientists and Engineers
Quantu Mechancs or Scentsts and Engneers Sangn K Advanced Coputatonal Electroagnetcs Lab redkd@yonse.ac.kr Nov. 4 th, 26 Outlne Quantu Mechancs or Scentsts and Engneers Blnear expanson o lnear operators
More informationSpecial Relativity and Riemannian Geometry. Department of Mathematical Sciences
Tutoral Letter 06//018 Specal Relatvty and Reannan Geoetry APM3713 Seester Departent of Matheatcal Scences IMPORTANT INFORMATION: Ths tutoral letter contans the solutons to Assgnent 06. BAR CODE Learn
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 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 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 informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More informationGradient Descent Learning and Backpropagation
Artfcal Neural Networks (art 2) Chrstan Jacob Gradent Descent Learnng and Backpropagaton CSC 533 Wnter 200 Learnng by Gradent Descent Defnton of the Learnng roble Let us start wth the sple case of lnear
More informationGeorgia Tech PHYS 6124 Mathematical Methods of Physics I
Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends
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 informationOn Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1
Ffteenth Internatonal Workshop on Algebrac and Cobnatoral Codng Theory June 18-24, 2016, Albena, Bulgara pp. 35 40 On Syndroe Decodng of Punctured Reed-Soloon and Gabduln Codes 1 Hannes Bartz hannes.bartz@tu.de
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
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 information