Riccati 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

Size: px
Start display at page:

Download "Riccati 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"

Transcription

1 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 Sanda Departent of Coputer Scence and Boedcal Inforatcs, Unversty of Central Greece, Laa 3500, Greece Departent of Electroncs, echnologcal Educatonal Insttute of Laa, Laa, Greece Abstract: A test s developed for checng the exstence of a fnte nuber of solutons of the atrx euatons X A X A Q and X A X A Q, when A s a nonsngular atrx An algebrac ethod for coputng all the solutons of these atrx euatons s proposed he ethod s based on the algebrac soluton of the correspondng dscrete te Rccat euatons he nuber of solutons s also derved he extree solutons are coputed as well Keywords: Matrx theory, atrx euatons, egenvalue-egenvector, Rccat euaton INRODUCION he central ssue of ths paper s the nvestgaton and the coputaton of all the solutons of the atrx euatons X A X A Q () and X A X A Q () where A s an n n atrx, A denotes the transpose of A and Q s an n n Hertan postve defnte atrx hese euatons arse n any applcatons n varous research areas ncludng control theory, ladder networs, dynac prograng, stochastc flterng and statstcs: see [, ] for references concernng euaton () and [3] for references concernng euaton () Concernng euaton (), we denote a soluton of X A X A Q as X It s well nown [4, heore 5] that, the exstence of the Hertan postve defnte soluton of the euaton () depends on the nuercal radus / / of atrx Q AQ In partcular, t s reured that / / rq ( AQ ), where r( A) ax{ x Ax : for every x n wth x x } denotes the nuercal radus of A It s also nown [4-6] that, f () has a Hertan postve defnte soluton X, then there exst nal and axal solutons X n and X ax, respectvely, such that 0 < Xn X Xax for any Hertan postve defnte soluton X Here, f X *Address correspondence to ths author at the Departent of Coputer Scence and Boedcal Inforatcs, Unversty of Central Greece, Laa 3500, Greece; E-al: ada@ucggr Matheatcs Subect Classfcaton: 5A4, 5A8, 93B5 and Y are Hertan atrces, then X Y eans that Y X s a nonnegatve defnte atrx and X < Y eans that Y X s a postve defnte atrx Concernng euaton (), we denote a soluton of X A X A Q as X It s well nown [3, 6] that there always exsts a unue Hertan postve defnte soluton, whch s the axal soluton X ax of (), and, f A s nonsngular, then there exsts a unue Hertan negatve defnte soluton, whch s the nal soluton X n of () he nal and axal solutons are referred as the extree solutons hese euatons have been studed recently by any authors [-]: the theoretcal propertes such as necessary and suffcent condtons for the exstence of a postve defnte soluton have been nvestgated and nuercal ethods for coputng the extree solutons of these euatons have been proposed; the avalable ethods are recursve algorths based anly on the fxed pont teraton and on applcatons of the Newton s algorth or the cyclc reducton ethod Furtherore, these euatons ay have Hertan postve defnte solutons or non- Hertan solutons hey also ay have defnte or ndefnte nuber of solutons For exaple as referred n [], when A Q 0 0, the euaton () has ndefnte nuber of solutons fored as X a a, where a s any real nuber a 0 Fnally, the exstence of a fnte nuber of Hertan postve defnte solutons of euaton () has been studed n [4], when A s nonsngular and Q I, where I s the dentty atrx In fact, the exstence of a fnte nuber of solutons of X A X A I depends on atrx A and s calculated, when A s a nonsngular coplex atrx / Bentha Open

2 Rccat Euaton Soluton Method he Open Appled Inforatcs Journal, 009, Volue 3 3 or A s a noral atrx ( AA A A ) Also, the fnte nuber of real syetrc postve defnte solutons of X A X A I s calculated, when A s real and nvertble In ths paper, we focus n the coputaton of all the solutons of the atrx euatons () and (), when A s nonsngular In Secton, an algebrac ethod for coputng all the solutons of these euatons s proposed he ethod s based on the algebrac soluton of the correspondng dscrete te Rccat euatons he nuber of solutons s also derved In Secton 3, a test for checng the exstence of a fnte nuber of solutons s developed he nuber of Hertan, syetrc, real and the extree solutons are coputed as well In Secton 4, sulaton results are gven to llustrate the effcency of the proposed ethod and fnally, concludng rears are gven n Secton 5 RICCAI EQUAION SOLUION MEHOD FOR HE COMPUAION OF ALL HE SOLUIONS All the Solutons of Euaton X A X A Q Here, A s an n n nonsngular atrx and the nuercal radus / / rq ( AQ ) orng as n [7] and [4], we are able to derve a Rccat euaton, whch s euvalent to the atrx euaton () In fact, the atrx euaton () can be wrtten as whereby arses, X Q A X A X QA [ QA X A] A QA A [ A QA X ] A A Q A A [ X ( A QA )] ( A A ) and thus the followng euvalent related Rccat euaton s derved ( ) ( ) P C F P G F, (3) wth F A A, C Q and G A QA (4) It becoes obvous that the atrx euaton () s euvalent to the related Rccat euaton (3) and that the two euatons have euvalent solutons hus the unue axal soluton of () concdes wth the unue Hertan postve defnte soluton of the related Rccat euaton: X P (5) ax It s clear that we are able to solve (), f we now the soluton of the related Rccat euaton he soluton of the related Rccat euaton can be derved usng the algebrac soluton proposed n [3] and [4] More specfcally, fro the Rccat euaton s paraeters the followng syplectc atrx s fored: A A A QA QA A A A QA QA Note that a syplectc atrx M JM J, where J O I I O (6) M s defned as Snce s a syplectc atrx, t can be wrtten as L ( ), (7) where all the egenvalues of are non-zero and can be placed n the dagonal atrx L O O and s the atrx, whch contans the correspondng egenvectors of atrx, (9) Rewrtng the eualty n (7) as L, we conclude the followng eualtes: A A ( A QA ) (0) ( ) QA A A QA A A () A A ( A QA ) () ( ) QA A A QA A A (3) Snce all the egenvalues of the syplectc atrx are non-zero, t s clear that 0 ( ) and 0 ( ), where ( A) denotes the spectru of A Moreover, f the bloc atrces,,, are nonsngular, then, after soe algebra, fro (0) and () we tae: ( ) Q A A ( ) A QA Fro () and (3) we tae: ( ) Q A A ( ) A QA A A A A (8) (4) (5) Usng (4) n (4) and (5), we are able to rewrte the last two euatons as ( ) C F ( ( ) ) G ( ) C F ( ( ) ) G (F ), (F ),

3 4 he Open Appled Inforatcs Journal, 009, Volue 3 Ada et al whereby t s obvous that both the uanttes ( ) and ( ) satsfy the Rccat euaton (3) and conseuently satsfy the atrx euaton () hus, the followng proposton s proved Proposton Let the bloc atrces,,, n (9) be nonsngular and arse fro every perutaton of coluns of n (9), whch consst of the egenvectors of n (6) he solutons of () are fored by ( ) X (6) X ( ) (7) At ths pont, we observe that the solutons calculated by (6) can be derved fro any arrangeent of the frst n egenvectors and that the other solutons calculated by (7) can be derved fro any arrangeent of the next n egenvectors Proposton he solutons n (6), (7) of euaton () do not depend on the perutaton of the frst n coluns of n (9), whch are egenvectors of n (6) Proof Let E rt O 0 0 O (8) be the n n dentty atrx, n whch the t colun s perutated by the r colun Let be the syplectc atrx n (6) and,,, n, n,, n be the egenvectors of n (7), where n n n and n n n Suppose that X, X consttute two solutons of () and due to (6), (7), they are wrtten X ( ) and X ( ) respectvely Snce E E and E E we tae X ( ) E E ( ) ( E )( E ) ( ) and ( ) ( ) E E X E E ( )( ) ( ) Conseuently, every perutaton of the frst n egenvectors consttutes the sae soluton for () and every perutaton of the followng n egenvectors consttutes the sae soluton for () Furtherore, we are gong to nvestgate every perutaton of the egenvalues of n a dagonal atrx In fact, as referred n [4], the syplectc atrx can be wrtten as ˆ ˆ ˆ L ( ), (9) where ˆL s the atrx, whch contans all the egenvalues of atrx as L n (8) and forulated as ˆL ˆ O O ( ˆ ), (0) wth ˆ the dagonal atrx, whch contans the egenvalues of atrx, that le outsde the unt crcle Note that the egenvalues of atrx occur n recprocal pars, due to the fact that s a syplectc atrx In (9), ˆ s the atrx, that contans the egenvectors of atrx, whch correspond to the egenvalues arranged n the dagonal atrx ˆL n (0): ˆ () Usng the atrx of egenvectors ˆ n (), Proposton and (6) of Proposton, we have: X P () ( ) Moreover, by (5) and (), the unue axal soluton of () s coputed as

4 Rccat Euaton Soluton Method he Open Appled Inforatcs Journal, 009, Volue 3 5 ˆ ˆ Xax ( ), that has been proved n a dfferent way n [7] By (7) the other soluton of () s coputed X ( ), whch s the nal soluton of (), as proved n [7]: X n ( ) Conseuently, the extree solutons X ax, X n X A X A Q are derved, dong the specfc arrangeent n the atrces L,, whch are fored as n (0)-() In the followng, by Proposton and, we lead to the coputaton of the nuber of solutons concernng euaton () heore 3 Let A be an n n nonsngular atrx, wth / / rq ( AQ ), and the bloc atrces,,, be nonsngular, whch arse fro every perutaton of coluns of n (9) he fnte nuber of solutons (ns) of () s eual to ( n)! ns (3) / / Proof Snce rq ( AQ ), the euaton () has a Hertan postve defnte soluton, (see [4, heore 5]) and by [4] the atrx n (6) for a specfc arrangeent of egenvalues (recall the egenvalues belong outsde or nsde the unt crcle) can be wrtten as n (9), t s obvous that, the euaton () has at least a Hertan postve defnte soluton, naely the axal one Moreover, the syplectc atrx n (7) has n egenvectors, whch can be used to copute all the solutons by (6)-(7) he fnte nuber of the possble perutatons of these egenvectors are (n)! By Proposton each soluton has ultplcty eual to n Hence, the nuber of solutons of () coputed usng the Rccat euaton soluton ethod s: ns n n (n)! n!(nn)! (n)! n!n! (n)! (n!) Rear Note that n heore 3, f we ot the nonsngularty of all the bloc atrces,,, whch arse fro every perutaton of the n frst wth the n followng coluns of n (9), then ns n (3) s an upper bound for the nuber of solutons of () Recall that the exstence of the solutons of () depends on / / rq ( AQ ) Conseuently, the exstence of the extree solutons and the nonsngularty of the correspondng atrces, are ensured by the assuptons of heore 3, therefore the solutons are of coputed by (6)-(7) he nonsngularty of all the bloc atrces,,, s needed for the exstence of all the other (not extree) solutons of (), whch are gven by forulas n (6)-(7) All the Solutons of Euaton X A X A Q Let A be a nonsngular atrx orng as n [7] and [3], we are able to derve a Rccat euaton, whch s euvalent to the atrx euaton () In fact, the atrx euaton () can be wrtten as whereby arses, X Q A X A X Q A [ Q A X A] A Q A A [ A QA X ] A A Q A A [ X A QA ] ( A A ) and thus the followng euvalent related Rccat euaton s derved ( ) ( ) P C F P G F (4) wth F A A, C Q and G A QA (5) It becoes obvous that the atrx euaton () s euvalent to the related Rccat euaton (4) and that the two euatons have euvalent solutons hus the unue axal soluton of () concdes wth the unue Hertan postve defnte soluton of the related Rccat euaton: X ax P (6) It s clear that we are able to solve (), f we now the soluton of the related Rccat euaton he soluton of the related Rccat euaton can be derved usng the algebrac soluton proposed n [3] and [4] More specfcally, fro the Rccat euaton s paraeters the followng syplectc atrx s fored: A A A QA (7) QA A A A QA QA Snce s a syplectc atrx, t can be wrtten as L ( ), (8) where all the egenvalues of are non-zero and can be placed n the dagonal atrx L O, (9) O and s the atrx, whch contans the correspondng egenvectors of atrx, (30)

5 6 he Open Appled Inforatcs Journal, 009, Volue 3 Ada et al Rewrtng the eualty n (8) as L, and followng the sae way of proof as n paragraph, we conclude : ( ) ( ) Q A A ( ) A QA Q A A ( ) A QA A A A A (3) (3) Usng (5) n (3) and (3), t s obvous that both the uanttes ( ) and ( ) satsfy the Rccat euaton (4) and conseuently satsfy the atrx euaton () hus, the followng proposton s proved n Proposton 4 Let the bloc atrces,,, (30) be nonsngular and arse fro every perutaton of coluns of n (30), whch consst of the egenvectors of n (7) he solutons of () are fored by ( ) X (33) ( ) X (34) At ths pont, we observe that the solutons calculated by (33) can be derved fro any arrangeent of the frst n egenvectors and that the other solutons calculated by (34) can be derved fro any arrangeent of the next n egenvectors hus, followng the sae ethod as n paragraph, the followng proposton s proved Proposton 5 he solutons n (33), (34) of euaton () do not depend on the perutaton of the frst n coluns of n (30), whch are egenvectors of n (7) Furtherore, n the proof of the forulas of the extree solutons n [7], we dd not observe that these are derved by the specfc perutaton of the egenvalues of the dagonal atrx In fact, as referred n [4], the syplectc atrx can be wrtten as ˆ ˆ ˆ L ( ), (35) where ˆL s the atrx, whch contans all the egenvalues of atrx as L n (9) and forulated ˆL ˆ O O ( ˆ ) (36) wth ˆ the dagonal atrx, whch contans the egenvalues of atrx, that le outsde the unt crcle In (35), ˆ s the atrx, that contans the egenvectors of atrx, whch correspond to the egenvalues arranged n the dagonal atrx ˆL n (36): (37) It s obvous that, usng the atrx of egenvectors ˆ n (37), Proposton 5, the forulas n (33)-(34) of Proposton 4, the unue axal and nal solutons of () are coputed as: X (38) ax ( ) X (39) n ( ) Conseuently, the extree solutons X ax, X n X A X A Q are derved, dong the specfc arrangeent n the atrces L,, whch are fored as n (36)-(37) By Proposton 4 and 5 and followng the sae way of the proof as n paragraph, we lead to the coputaton of the nuber of solutons concernng euaton () heore 6 Let A be an n n nonsngular atrx and the bloc atrces,,,, whch arse fro every perutaton of coluns of n (30), be nonsngular he fnte nuber of solutons (ns) of () s eual to ( n)! ns Rear Note that n heore 6, f we ot the nonsngularty of all the bloc atrces,,,, whch arse fro every perutaton of the n frst wth the n followng coluns of n (30), then ns n (3) s an upper bound for the nuber of solutons of () Recall that for an A nonsngular atrx, the euaton () has always extree Hertan solutons, whereby the nonsngularty of the correspondng atrces, s pled, therefore the solutons are coputed by (33) and (34) or by (38)-(39) he nonsngularty of all the bloc atrces,,,, s needed for the exstence of all the other (not extree) solutons of (), whch are gven by forulas n (33)-(34) 3 EXISENCE OF A FINIE NUMBER OF SOLUIONS 3 Exstence of a Fnte Nuber of Solutons for XA X A Q he exstence of a fnte nuber of solutons of euaton (), when A s nonsngular and Q I, depends on atrx A, as stated n [4] In fact, t depends on the egenvalues of the atrx: of

6 Rccat Euaton Soluton Method he Open Appled Inforatcs Journal, 009, Volue 3 7 H O A A A (40) More precsely: f d( V( ( H))) for all egenvalues ( H ),,,, n of H, wth ( H ), then, there exsts a fnte nuber of Hertan solutons of X A X A I Note that V( ( H)) denotes the egenspace correspondng to egenvalue ( H ) of the atrx H and d( V( ( H))) denotes the denson of V( ( H)) Moreover, the nuber of Hertan postve defnte solutons (hpdns) of X A X A I s gven by [4] hpdns ( n ), (4) where s the nuber of egenvalues ( H ) of H lyng outsde the unt crcle, wth algebrac ultplcty n,,,, Also, as referred n [4, Proposton 8], the nuber of real syetrc postve defnte solutons (rpdns) s eual to rpdns ( n ), (4) where p s the nuber of real egenvalues lyng outsde the unt crcle, s the nuber of coplex conugate pars of egenvalues lyng outsde the unt crcle, wth algebrac ultplcty n,,,, hs result, that s referred n the specal case, where Q I, can be extended for the general case, when Q I It s nown [4] that the atrx euaton () can be reduced to a correspondng atrx euaton, wth Q I Multplyng on / the rght and on the left both sdes of () by Q, (recall that Q s a Hertan postve defnte atrx, hence t s nonsngular), we have : / / / / Q X Q Q A X AQ I Settng n the last euaton / / Y Q XQ and we obtan / / R Q AQ (43) Y R Y R I, (44) where the atrx R s nonsngular, snce A s nonsngular By (43), t s obvous that the soluton X of () can be coputed as / / X Q Y Q, (45) where Y s the correspondng Hertan soluton of (44) Snce the exstence of a fnte nuber of Hertan postve defnte solutons of (44) depends on the atrx, whch s fored as n (40), we have H O R R R, and substtutng the atrx R by (43) we obtan: H O Q / A Q / Q / A Q / Q / A Q / (46) It s easy to verfy that the atrx H s syplectc Usng the above stateents we conclude the followng results, whch consttute a generalzaton of Corollary 66 and of Proposton 8 n [4] as well as of the relatonshps n (4)-(4) Corollary 7 Suppose that the atrx euaton X A X A Q has a Hertan postve defnte soluton If d( V( ( H ))) for every egenvalue ( H ),,,, n of H n (46), wth ( H ), then there exsts a fnte nuber of solutons of () Let ( H ), ( H ),, ( H ) be the dstnct egenvalues of H lyng outsde the unt crcle, wth algebrac ultplcty n,,,, he nuber of Hertan postve defnte solutons (hpdns) of () s eual to hpdns ( n ) (47) Corollary 8 Let A be an n n nonsngular real atrx, Q be real and H be the atrx n (46) Let ( H ), ( H ),, p ( H ) be the dstnct real egenvalues of H lyng outsde the unt crcle, be the nuber of coplex conugate pars of egenvalues lyng outsde the unt crcle, wth algebrac ultplcty n,,,, he nuber of real syetrc postve defnte solutons (rpdns) of () s eual to rpdns ( n ) (48) he exstence of a fnte nuber of solutons of the atrx euaton () can be expressed wth respect to the egenvalues of nstead of the egenvalues of H, as t s presented n the followng heore 9 Let A be an n n nonsngular atrx, wth / / rq ( AQ ), be the atrx n (6) and the bloc atrces,,, n (9) be nonsngular If d( V ( ( ))) for every egenvalue ( ),,,, n of, wth ( ), then, there exsts a

7 8 he Open Appled Inforatcs Journal, 009, Volue 3 Ada et al fnte nuber of Hertan postve defnte solutons (hpdns) of () he nuber of Hertan postve defnte solutons of () s eual to hpdns ( n ) (49) he nuber of non-hertan solutons (nhns) of () s nhns ns ( n ) (50) In partcular, f A and Q are real atrces, then aong the hpdns there exst real syetrc solutons (rpdns) and the nuber of rpdns of () s rpdns ( n ) (5) In above, s the nuber of the dstnct egenvalues of, that le outsde the unt crcle, wth algebrac ultplcty n,,,,, p s the nuber of real dstnct egenvalues of lyng outsde the unt crcle, s the nuber of coplex conugate pars of egenvalues lyng outsde the unt crcle, wth algebrac ultplcty n,,,,, and ns s gven by (3) Proof Due to the followng relaton Q/ O O Q / ((H ) ) Q / O O Q /, (5) t s clear that the atrces and ( H ) are slar, thus the relaton between the egenvalues of these two atrces s: H ( ) ( ),,,, n (53) Moreover, by (53), the relaton of the absolute value s: ( H ) ( ) By the last eualty t s obvous that, ( H ) ( ) (54) and ( H ) > ( ) > (55) Note that the egenspaces, correspondng to egenvalues ( H ) and ( H ) of the atrces H and ( H ), concde, hence, d( V( ( H ))) d( V( ( H ))) Also, f we cobne the above eualty wth the slarty of atrces and ( H ), we conclude that d( V( ( ))) d( V( ( H ))) (56) he assupton and (56) yelds d( V( ( ))) d( V( ( H ))) he last stateent and (54) lead to the concluson that, the frst part of Corollary 7 can be appled, e, there exsts a fnte of Hertan solutons of () Furtherore, cobnng the assupton wth (55), t s obvous that the second part of Corollary 7 s appled, hence, hpdns ( n ), where n s the algebrac ultplcty of the egenvalue ( ) of, for every,,,, wth ( ) > Also, by (53) we have that any real (coplex) egenvalue ( H ) of the atrx H s real (coplex) egenvalue of the atrx, respectvely, thus the hypotheses and (55) lead to applcaton of Corollary 8, whereby arses the nuber of real syetrc solutons n (5) Furtherore, due to the assuptons for the bloc atrces,,,, the nuber of non-hertan solutons of () n (50) yelds cobnng heore 3 wth the euaton (49) Rear 3 Note that n heore 9, p,, are connected by the relatonshp 3 Exstence of a Fnte Nuber of Solutons for X A X A Q he euaton () can be fored as (), f we substtute the nonsngular atrx A wth A, and then we have X A X A Q (57) Accordng to heore 9, the exstence of a fnte nuber of solutons of euaton (57) depends on the atrx, whch s fored as (6) and s A A QA A A QA A A QA QA (58) heore 0 Let A be an n n nonsngular atrx be the atrx n (7) and the bloc atrces,,, n (30) be nonsngular If d( V ( ( ))) for every egenvalue ( ),,,, n of, wth ( ), then, there exsts a fnte nuber of Hertan solutons (hns) of () he nuber of Hertan solutons of () s eual to hns ( n ), (59) and the nuber of non-hertan solutons (nhns) of () s nhns ns ( n ) (60) In partcular, f A and Q are real atrces, then aong the hns there exst real syetrc solutons (rns) and the nuber of rns of () s

8 Rccat Euaton Soluton Method he Open Appled Inforatcs Journal, 009, Volue 3 9 rns ( n ) (6) In above, s the nuber of the dstnct egenvalues of, that le outsde the unt crcle, wth algebrac ultplcty n,,,,, p s the nuber of real dstnct egenvalues of lyng outsde the unt crcle, s the nuber of coplex conugate pars of egenvalues lyng outsde the unt crcle, wth algebrac ultplcty n,,,,, and ns s gven by (3) Proof It s obvous that, when we substtute n (58) A wth A, arses A A A QA, (6) QA A A A QA QA e, the atrx s dentfed wth the atrx n (7) Hence, t becoes obvous that the soluton of () can be derved through the soluton of euaton of type () n (57) and cobnng the conclusons of heore 9 In fact, f d(v ( ( ))) d(v ( ( ))), for all egenvalues ( ) of the atrx wth ( ) ( ),,,, n, then there exsts a fnte nuber of Hertan solutons of X A X A Q, due to the exstence of fnte nuber of Hertan postve defnte solutons of X A X A Q Clearly, snce ( ) ( ),,,, n, the egenvalues ( ), ( ),, ( ) le outsde the unt crcle, when ( ), ( ),, ( ) le outsde the unt crcle Also, any real (coplex) egenvalue ( ) of s real (coplex) egenvalue of ; therefore, applyng the conclusons of heore 9 for the atrx, the eualtes n (59) and (6) are derved, edately Furtherore, due to the assuptons for the bloc atrces,,,, the nuber of non-hertan solutons of () n (60) yelds cobnng heore 6 wth the euaton (59) Rear 4 Note that n heore 0, p,, are connected by the relatonshp 4 SIMULAION RESULS Sulaton results are gven to llustrate the effcency of the proposed ethod he proposed ethods copute accurate solutons as verfed through the followng sulaton exaples, usng Matlab 65 Exaple hs exaple concerns the scalar euaton X A X A Q, wth A 05, Q Snce A s a nonsngular atrx, Rccat euaton soluton ethod can be appled he atrx n (6) has ( ) {0078, 398}, and the correspondng egenvectors are the coluns of the atrx Conseuently, has egenvalue outsde the unt crcle, whch s a real egenvalue p, wth ultplcty n and no par of coplex egenvalues ( 0 ) Snce all the hypotheses of heore 9 are verfed, by (49) and (5) the nuber of Hertan postve defnte solutons s eual to the nuber of real syetrc postve defnte solutons: hpdns ( n ) rpdns ( n ) Furtherore, n and by (3) the ethod coputes ( n)! ns solutons of the atrx euaton X A X A Q and accordng to heore 9 the nuber of non-hertan solutons s gven by (50), e, the non- Hertan solutons are nhns ns ( n ) 0 hus, there exst only Hertan-real syetrc solutons, whch are the extree solutons: X X ax (axal soluton) X X n (nal soluton) It s also verfed that: O < Xn < Xax Exaple hs exaple concerns the euaton X A X A Q and s taen fro [] Consder the euaton (), wth A 3 4, Q Snce A s a real and nonsngular atrx wth / / rq ( AQ ) 04957, Rccat euaton soluton ethod can be appled he atrx n (6) has, ( ) { ( ) 053± 08506, ( ) 0457 ± 07 }, 3,4 wth, ( ) 3, 3,4 ( ) 045, and the correspondng egenvectors of are the coluns of the atrx

9 30 he Open Appled Inforatcs Journal, 009, Volue 3 Ada et al he atrx has egenvalues outsde the unt crcle, p 0 real egenvalue, par of coplex egenvalues outsde the unt crcle, the algebrac ultplcty of all the egenvalues s n n Moreover, the bloc atrx,,,, that arses fro every perutaton of coluns of, s nonsngular hus, the hypotheses of heore 9 are verfed and by (49) we copute hpdns ( n ) 4, and by (5) rpdns ( n ) Furtherore, by (3) of heore 3, for n, the ( n)! ethod coputes ns 6 solutons of the atrx euaton X A X A Q Accordng to heore 9 the nuber of non-hertan solutons s gven by (50) and s eual to nhns ns ( n ) 6 4 All the solutons are: X X ax (axal soluton) X X X X X 6 X n (nal soluton) It s also verfed that: O < Xn < Xax Exaple 3 hs exaple concerns the euaton X A X A Q and s taen fro [] Consder the euaton (), wth A , Q Snce A s a real and nonsngular atrx wth / / rq ( AQ ) 04998, Rccat euaton soluton ethod can be appled he atrx n (6) has ( ) {, ( ) 785 ± 00583, 3 ( ) 0673, ( ) 0937, ( ) 007± }, 4 5,6 wth, ( ) 055, 3 ( ) 0673, 4 ( ) 0937, and 5,6 ( ) he correspondng egenvectors of are the coluns of the atrx 3 he atrx has 3 egenvalues outsde the unt crcle, fro that, p real egenvalue, par of coplex egenvalues outsde the unt crcle, the algebrac ultplcty of all the egenvalues s eual to Moreover, the 3 3 bloc atrx,,,, that arses fro every perutaton of coluns of 3, s nonsngular hus, the hypotheses of heore 9 are verfed and we copute hpdns ( n ) 8 and rpdns ( n ) 4 by (49) and (5), respectvely he real syetrc postve defnte solutons are X, (axal soluton), X, X 9, X 0, (nal soluton), n partcular: X X ax

10 Rccat Euaton Soluton Method he Open Appled Inforatcs Journal, 009, Volue X X X 0 X n It s verfed that: O < Xn X Xax for every Hertan postve defnte soluton X, snce n, 9 ax O < X X X X Furtherore, by (3) of heore 3, for n 3, the ( n)! ethod coputes ns 0 solutons of the atrx euaton X A X A Q Accordng to heore 9 the nuber of non-hertan solutons s gven by (50) and s eual to nhns ns ( n ) 0 8 Exaple 4 hs exaple concerns the scalar euaton X A X A Q, wth A, Q Snce A s a nonsngular atrx, Rccat euaton soluton ethod can be appled he atrx n (7) has ( ) {06096, 6404}, and the correspondng egenvectors are the coluns of the atrx Conseuently, has egenvalue outsde the unt crcle, whch s a real egenvalue p, wth ultplcty n and 0 Snce all the hypotheses of heore 0 are verfed, by (59) and (6) the nuber of Hertan solutons and especally of real solutons s eual to hns ( n ), rns ( n ), respectvely Furtherore, n and by heore 6, the ( n)! ethod coputes ns solutons of the atrx euaton X A X A Q Accordng to heore 0 the nuber of non-hertan solutons s gven by (60) and s eual to nhns ns ( n ) 0 hus, there exst only Hertan-real syetrc solutons, whch are the extree solutons: X X ax 566 (axal soluton) X X n 566 (nal soluton) Exaple 5 hs exaple concerns the euaton X A X A Q and s taen fro [6] and [] Consder the euaton (), wth A , Q 3 4 Snce A s a real and nonsngular atrx, Rccat euaton soluton ethod can be appled he atrx n (7) has ( ) {, ( ) 0404 ± 098, ( ) 0976 ± 0766 }, 3,4 wth, ( ) 059, 3,4 ( ) 0944, and the correspondng egenvectors of are the coluns of the atrx 5 he atrx has egenvalues outsde the unt crcle, wth n n, where p 0 and, and the bloc atrces,,,, that arse fro every perutaton of coluns of 5, are nonsngular hus, the hypotheses of heore 0 are verfed and we copute hns ( n ) 4, rns ( n ), by (59) and (6), respectvely Furtherore, n and by ( n)! heore 6, the ethod coputes ns 6 solutons of the atrx euaton X A X A Q Accordng to

11 3 he Open Appled Inforatcs Journal, 009, Volue 3 Ada et al heore 0 the nuber of non-hertan solutons s gven by (60) and s eual to nhns ns ( n ) 6 4 All the solutons are: X X ax (axal soluton) X X X X X 6 X n (nal soluton) Exaple 6 hs exaple concerns the euaton X A X A Q, wth A , Q hs exaple has the sae atrces AQ, as Exaple 3, thus A s nonsngular, hence the Rccat euaton soluton ethod can be appled he atrx n (7) has, 3 4 5,6 ( ) { ( ) 74± 4359, ( ) 6644, ( ) 06, ( ) ± }, wth, ( ) 44644, 3 ( ) 6644, 4 ( ) 06 and 5,6 ( ) 0069 he correspondng egenvectors of are the coluns of the atrx 6 he atrx has 3 egenvalues outsde the unt crcle, wth n n n 3, fro that, there exsts p real egenvalue and par of coplex egenvalues outsde the unt crcle Moreover, the 3 3 bloc atrx,,,, that arses fro every perutaton of coluns of 6, s nonsngular hus, the hypotheses of heore 0 are verfed and we copute hns ( n ) 8 and rns ( n ) 4 by (59) and (6), respectvely he real syetrc solutons are X, (axal soluton), X, X 9, X 0, (nal soluton), n partcular: X X ax X X 9 X 0 X n Furtherore, n 3 and by heore 6, the ethod ( n)! coputes ns 0solutons of the atrx euaton X A X A Q Accordng to heore 0 the nuber of non-hertan solutons s gven by (60) and s eual to nhns ns ( n ) 0 8 CONCLUSIONS A ethod s developed for checng the exstence of a fnte nuber of solutons of the atrx euatons

12 Rccat Euaton Soluton Method he Open Appled Inforatcs Journal, 009, Volue 3 33 X A X A Q and X A X A Q, when A s nonsngular An algebrac ethod for coputng of all the solutons of these atrx euatons s proposed, naely the Rccat euaton soluton ethod, whch s based on the algebrac soluton of the correspondng dscrete te Rccat euatons he ethod provdes sple forulas for coputng the accurate solutons of these atrx euatons, as verfed through sulaton experents he ethod coputes the extree solutons as well he nuber of solutons s also derved he exstence and the coputaton only of the extree solutons (Hertan) of the atrx euatons () and () have been studed n the bblography (see [3, 4, 7, 0]) In the present paper, the necessary condtons for the exstence of all the solutons (Hertan ones as well as non-hertan ones) of these euatons are presented, the nuber of solutons s coputed and forulas for coputng all these solutons are gven REFERENCES [] N Anderson, Jr D Morley, and GE rapp, Postve solutons to X A BX B*, Lnear Algebra Appl, vol 34, pp 53-6, 990 [] X Zhan, Coputng the extreal postve defnte solutons of a atrx euaton, SIAM J Sc Coput, vol 7, no 5, pp 67-74, Sep 996 [3] A Ferrante, and BC Levy, Hertan solutons of the euaton X QNX N*, Lnear Algebra Appl, vol 47, pp , 996 [4] JC Engwerda, ACM Ran, and AL Reboer, Necessary and suffcent condtons for the exstence of a postve defnte soluton of the atrx euaton X A*X A Q, Lnear Algebra Appl, vol 86, pp 55-75, 993 [5] I Gohberg, P Lancaster, and L Rodan, Matrces and Indefnte Scalar Product, Operator heory: Advances and Applcatons, O8 Brhäuser Verlag: Basel, 983 [6] B Men, Effcent coputaton of the extree solutons of X A* X A Q and X A*X A Q, Math Coput, vol 7, no 39, pp 89-04, Nov 00 [7] M Ada, N Assas, and F Sanda, Algebrac solutons of the atrx euatons X A X A Q and X A X A Q, Int J Algebra, vol, no, pp 50-58, 008 [Onlne] Avalable fro: http//www-harco/a [Accessed 0 Feb 008] [8] N Assas, F Sanda, and M Ada, Recursve solutons of the atrx euatons X A X A Q and X A X A Q, Appl Math Sc, vol, no 38, pp , 008 [Onlne] Avalable fro: [Accessed 0 Mar 008] [9] P Benner, and H Fassbender, On the soluton of the ratonal atrx euaton X Q LX L, EURASIP J Adv Sgnal Process, vol 007, pp -0, 007 Artcle ID 850, [Onlne] Avalable fro: 055/007/850 [Accessed Feb, 007] [0] JC Engwerda, On the exstence of a postve defnte soluton of the atrx euaton X A X A I, Lnear Algebra Appl, vol 94, pp 9-08, 993 [] CH Guo, and P Lancaster, Iteratve soluton of two atrx euatons, Math Coput, vol 68, no 8, pp , Aprl 999 [] X Zhan, and J Xe, On the atrx euaton X A X A I, Lnear Algebra Appl, vol 47, pp , 996 [3] BDO Anderson, and JB Moore, Optal Flterng, Englewood Clffs, New Jersey, USA: Prentce Hall nc, 979 [4] DR Vaughan, A nonrecursve algebrac soluton for the dscrete Rccat euaton, IEEE rans Autoat Cont, pp , 970 Receved: March 30, 009 Revsed: Aprl 9, 009 Accepted: May 07, 009 Ada et al; Lcensee Bentha Open hs s an open access artcle lcensed under the ters of the Creatve Coons Attrbuton Non-Coercal Lcense ( whch perts unrestrcted, non-coercal use, dstrbuton and reproducton n any edu, provded the wor s properly cted

Applied Mathematics Letters

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

Slobodan Lakić. Communicated by R. Van Keer

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

Least Squares Fitting of Data

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

International Journal of Mathematical Archive-9(3), 2018, Available online through ISSN

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

The Order Relation and Trace Inequalities for. Hermitian Operators

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

Least Squares Fitting of Data

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

Finite Fields and Their Applications

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

The Parity of the Number of Irreducible Factors for Some Pentanomials

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

Modified parallel multisplitting iterative methods for non-hermitian positive definite systems

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

Perron Vectors of an Irreducible Nonnegative Interval Matrix

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

A new eigenvalue inclusion set for tensors with its applications

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

System in Weibull Distribution

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 information

MATH Homework #2

MATH Homework #2 MATH609-601 Homework #2 September 27, 2012 1. Problems Ths contans a set of possble solutons to all problems of HW-2. Be vglant snce typos are possble (and nevtable). (1) Problem 1 (20 pts) For a matrx

More information

A Radon-Nikodym Theorem for Completely Positive Maps

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

Linear Algebra and its Applications

Linear Algebra and its Applications Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler

More information

1. Statement of the problem

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

Department of Economics, Niigata Sangyo University, Niigata, Japan

Department of Economics, Niigata Sangyo University, Niigata, Japan Appled Matheatcs, 0, 5, 777-78 Publshed Onlne March 0 n ScRes. http://www.scrp.org/journal/a http://d.do.org/0.6/a.0.507 On Relatons between the General Recurrence Forula o the Etenson o Murase-Newton

More information

On the number of regions in an m-dimensional space cut by n hyperplanes

On the number of regions in an m-dimensional space cut by n hyperplanes 6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general

More information

ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES

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

XII.3 The EM (Expectation-Maximization) Algorithm

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

Minimization of l 2 -Norm of the KSOR Operator

Minimization of l 2 -Norm of the KSOR Operator ournal of Matheatcs and Statstcs 8 (): 6-70, 0 ISSN 59-36 0 Scence Publcatons do:0.38/jssp.0.6.70 Publshed Onlne 8 () 0 (http://www.thescpub.co/jss.toc) Mnzaton of l -Nor of the KSOR Operator Youssef,

More information

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions

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

Convexity preserving interpolation by splines of arbitrary degree

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

Quantum Particle Motion in Physical Space

Quantum Particle Motion in Physical Space Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal

More information

Finite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003

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

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.

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

PROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE

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

A property of the elementary symmetric functions

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

4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation

4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation 4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are

More information

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also

More information

On the spectral norm of r-circulant matrices with the Pell and Pell-Lucas numbers

On the spectral norm of r-circulant matrices with the Pell and Pell-Lucas numbers Türkmen and Gökbaş Journal of Inequaltes and Applcatons (06) 06:65 DOI 086/s3660-06-0997-0 R E S E A R C H Open Access On the spectral norm of r-crculant matrces wth the Pell and Pell-Lucas numbers Ramazan

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

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

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form

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

1 Definition of Rademacher Complexity

1 Definition of Rademacher Complexity COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the

More information

APPENDIX A Some Linear Algebra

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

The lower and upper bounds on Perron root of nonnegative irreducible matrices

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

Recursive Solutions of the Matrix Equations X + A T X 1 A = Q and X A T X 1 A = Q

Recursive Solutions of the Matrix Equations X + A T X 1 A = Q and X A T X 1 A = Q Applied Mathematical Sciences, Vol. 2, 2008, no. 38, 1855-1872 Recursive Solutions of the Matrix Equations X + A T X 1 A = Q and X A T X 1 A = Q Nicholas Assimakis Department of Electronics, Technological

More information

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate

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

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

Quantum Mechanics for Scientists and Engineers

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

Computational and Statistical Learning theory Assignment 4

Computational and Statistical Learning theory Assignment 4 Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}

More information

Excess Error, Approximation Error, and Estimation Error

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

On Finite Rank Perturbation of Diagonalizable Operators

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

THE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York

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

LECTURE :FACTOR ANALYSIS

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

LECTURE 9 CANONICAL CORRELATION ANALYSIS

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

Case Study of Markov Chains Ray-Knight Compactification

Case Study of Markov Chains Ray-Knight Compactification Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

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

Gadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281

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

Solutions to exam in SF1811 Optimization, Jan 14, 2015

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

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

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

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

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 information

Chapter One Mixture of Ideal Gases

Chapter One Mixture of Ideal Gases herodynacs II AA Chapter One Mxture of Ideal Gases. Coposton of a Gas Mxture: Mass and Mole Fractons o deterne the propertes of a xture, we need to now the coposton of the xture as well as the propertes

More information

Formulas for the Determinant

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

arxiv: v2 [math.co] 3 Sep 2017

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

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong

More information

On the Eigenspectrum of the Gram Matrix and the Generalisation Error of Kernel PCA (Shawe-Taylor, et al. 2005) Ameet Talwalkar 02/13/07

On the Eigenspectrum of the Gram Matrix and the Generalisation Error of Kernel PCA (Shawe-Taylor, et al. 2005) Ameet Talwalkar 02/13/07 On the Egenspectru of the Gra Matr and the Generalsaton Error of Kernel PCA Shawe-aylor, et al. 005 Aeet alwalar 0/3/07 Outlne Bacground Motvaton PCA, MDS Isoap Kernel PCA Generalsaton Error of Kernel

More information

PARTITIONS WITH PARTS IN A FINITE SET

PARTITIONS WITH PARTS IN A FINITE SET PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 28, Nuber 5, Pages 269 273 S 0002-9939(0005606-9 Artcle electroncally publshe on February 7, 2000 PARTITIONS WITH PARTS IN A FINITE SET MELVYN B.

More information

Dynamic Systems on Graphs

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

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

for Linear Systems With Strictly Diagonally Dominant Matrix

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

An Optimal Bound for Sum of Square Roots of Special Type of Integers

An Optimal Bound for Sum of Square Roots of Special Type of Integers The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type

More information

Fixed-Point Iterations, Krylov Spaces, and Krylov Methods

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

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

1 GSW Iterative Techniques for y = Ax

1 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

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

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

On Pfaff s solution of the Pfaff problem

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

Difference Equations

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

On an identity for the cycle indices of rooted tree automorphism groups

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

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

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

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

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

Xiangwen Li. March 8th and March 13th, 2001

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

COS 511: Theoretical Machine Learning

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

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise ppled Mathematcal Scences, Vol. 4, 200, no. 60, 2955-296 Norm Bounds for a ransformed ctvty Level Vector n Sraffan Systems: Dual Exercse Nkolaos Rodousaks Department of Publc dmnstraton, Panteon Unversty

More information

SL n (F ) Equals its Own Derived Group

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

Existence of Two Conjugate Classes of A 5 within S 6. by Use of Character Table of S 6

Existence of Two Conjugate Classes of A 5 within S 6. by Use of Character Table of S 6 Internatonal Mathematcal Forum, Vol. 8, 2013, no. 32, 1591-159 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/mf.2013.3359 Exstence of Two Conjugate Classes of A 5 wthn S by Use of Character Table

More information

y new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)

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

Randić Energy and Randić Estrada Index of a Graph

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

h-analogue of Fibonacci Numbers

h-analogue of Fibonacci Numbers h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

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

Solving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint

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

Smarandache-Zero Divisors in Group Rings

Smarandache-Zero Divisors in Group Rings Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Several generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c

Several generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,

More information

Scattering by a perfectly conducting infinite cylinder

Scattering by a perfectly conducting infinite cylinder Scatterng by a perfectly conductng nfnte cylnder Reeber that ths s the full soluton everywhere. We are actually nterested n the scatterng n the far feld lt. We agan use the asyptotc relatonshp exp exp

More information

Our focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.

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

Maximizing the number of nonnegative subsets

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

A new Approach for Solving Linear Ordinary Differential Equations

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

Research Article The Solution of Two-Point Boundary Value Problem of a Class of Duffing-Type Systems with Non-C 1 Perturbation Term

Research Article The Solution of Two-Point Boundary Value Problem of a Class of Duffing-Type Systems with Non-C 1 Perturbation Term Hndaw Publshng Corporaton Boundary Value Problems Volume 9, Artcle ID 87834, 1 pages do:1.1155/9/87834 Research Artcle The Soluton of Two-Pont Boundary Value Problem of a Class of Duffng-Type Systems wth

More information

Approximate Technique for Solving Class of Fractional Variational Problems

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

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 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 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.

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

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Solutions for Homework #9

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

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

Singular Value Decomposition: Theory and Applications

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