Journal of Computational and Applied Mathematics

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Journal of Computational and Applied Mathematics"

Transcription

1 Journal of Computatonal and Appled Mathematcs 37 (03) 6 35 Contents lsts avalable at ScVerse ScenceDrect Journal of Computatonal and Appled Mathematcs journal homepage: wwwelsevercom/locate/cam The nverse of banded matrces Emrah Kılıç a Pantelmon Stanca b a TOBB Economcs and Technology Unversty Mathematcs Department Sogutozu Ankara Turkey b Naval Postgraduate School Department of Appled Mathematcs Monterey CA USA a r t c l e n f o a b s t r a c t Artcle hstory: Receved 8 June 00 Receved n revsed form 8 September 0 Keywords: Trangular matrx Hessenberg matrx Inverse r-banded matrx The nverses of r-banded matrces for r = 3 have been thoroughly nvestgated as one can see from the references we provde Let B rn ( r n) be an n n matrx of entres {a j } r r j r wth the remanng un-ndexed entres all zeros In ths paper generalzng a method of Mallk (999) [5] we gve the LU factorzaton and the nverse of the matrx B rn (f t exsts) Our results are vald for an arbtrary square matrx (takng r = n) and so we wll gve a new approach for computng the nverse of an nvertble square matrx Our method s based on Hessenberg submatrces assocated to B rn 0 Elsever BV All rghts reserved Background There are varous methods for fndng nverses of matrces (f these exst) and we recall the Gauss Jordan method the trangular decomposton such as LUD or Cholesky factorzaton to menton only a few A very popular approach s based A A on block parttonng Let A = whose nverse (called Schur s complement) s A A A A = A A B A A A A B B A A B where B = A A A A (under the rght condtons namely that A B are nvertble) Further an teratve approach for fndng the nverse exsts but ts convergence s a functon of the matrx s condton number cond(a) = A A (n some norm say l where A = max j a j ; or l wth A = A T ) We wll not go nto detals regardng these parameters of a matrx as the consderable lterature has been dedcated to these concepts Certanly the nverse of a dagonal matrx (f t exsts) s found easly: f A = dag(a a n ) then A = u c 0 0 dag(a 0 u c 0 a n ) If U s a bdagonal say U = u 0 then U = (v j ) j where the entres 0 u n satsfy the recurrences 0 > j; v j = = j u c v j < j u Correspondng author E-mal addresses: (E Kılıç) (P Stanca) /$ see front matter 0 Elsever BV All rghts reserved do:006/jcam00708

2 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) These recurrences can certanly be solved and we obtan 0 > j v j = j ck j v j k= u k Gong further to trdagonal matrces thngs start to change We want to menton here the work of Schlegel [] who showed b 0 0 b 0 that f B = then the nverse B = (c j ) j s gven by c j = r r r n j and c j f j < where 0 b n r 0 = r = b r k = (b k r k r k ) k = n and r = b n r n r n = ( ) n det(b) We would lke to make an observaton at ths pont: snce the nverse of a trdagonal matrx s a full matrx the Schur s complement method s not very effcent Moreover Vmur [] obtaned the nverse of another partcular trdagonal matrx n terms of the Gegenbauer polynomal C α n (x) (for α = ) whose generatng functon s ( xtt ) α = n=0 C α n (x)tn ; Prabhakar et al [3] showed some connecton between the aforementoned nverse and the generalzed Hermte polynomals namely g m n (x λ) = [n/m] k=0 n! k!(n mk)! λk x n mk (Classcal Hermte H n (x) are obtaned for m = λ = x x) Many specal cases of the banded matrces such as Toepltz matrces symmetrc Toepltz matrces especally trdagonal matrces etc have been studed by several authors as we prevously mentoned (the reader can fnd many more references publshed n the present journal for nstance [4] among others) These matrces arse n many areas of mathematcs and ts applcatons Trdagonal or more general banded matrces are used n telecommuncaton system analyss fnte dfference methods for solvng PDEs lnear recurrence systems wth non-constant coeffcents etc so t s natural to ask the queston of whether one can obtan some results about the nverse of 4-dagonal or perhaps even general banded matrces We wll do so n ths paper Throughout ths paper we consder a general r-banded matrx B rn of order n defned by a a a 3 a r 0 0 a a a a 3 a r a 3 a a 3 a 3 a B rn = a 3 a 3 a 4 a 4 a r n r b j = a r a 3 3 a 4 a 5 a 3 n 3 0 a r a n a 3 n a 3 n a n a n a n 0 0 a r n r a 3 n where a j s stand for arbtrary real numbers r r j r n (note that the n the notaton a n does not denote the th power of a n ) When r = n the matrx B nn s reduced to an arbtrary square matrx In ths paper generalzng a method of [5] we gve the LU factorzaton and (n our man result) the nverse of the matrx B rn (f t exsts) Our results are vald for an arbtrary square matrx (by takng r = n) Therefore we gve a new approach for computng the nverse of an nvertble square matrx thus generalzng varous results (see [6 8590] and the references theren) Our method s based on Hessenberg submatrces assocated to B rn Secton deals wth the LU factorzaton of an r-banded matrx To fnd the nverse of such a matrx (obtaned n Secton 4) we need to fnd nverses of the obtaned trangular matrces from the LU factorzaton and ths s done n Secton 3 We conclude the paper wth a few examples n Secton 5 a n a n () LU factorzaton of an r-banded matrx Ths secton s manly devoted to the LU factorzaton of the matrx B rn Frst we construct two recurrences For r and s r defne k = s a r s t= m t s t kt s t ()

3 8 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) 6 35 and for r () as m = s r t= k s m t s t kt s t (3) wth ntal condtons and m = a () k k = a r = a () r a where the terms a ± n for n are the entres of B rn For these sequences to be well-defned we assume that none of the denomnators k s are zero (whch s equvalent to the below-defned U and consequently B rn beng nvertble) Now defne untary lower trdagonal matrx L and upper trangular matrx U and L = l j = 0 m m m m m 3 m r 0 m r m 3 m 4 m 4 m n 0 0 m r n r m n m n k k k 3 k r 0 0 k k k 3 k r U = k 3 k 3 k u j = k 4 k 4 k r k 5 k 3 n 3 k n k n n r k 3 n k n 0 k n Our frst result gves the LU factorzaton of B rn (5) (4) Theorem For n > the LU factorzaton of matrx B rn s gven by B rn = LU where L and U are defned as n (4) and (5) respectvely Proof Frst we consder the case = j r From matrx multplcaton and the defntons of L and U we have b = n l s u s = s= l s u s s= = l u l u l u = m k m k m k k From () by takng r = we obtan b = a

4 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) whch gves the concluson Now consder the case of > r Thus b = n l s u s = s= r l s u s s= = l u l u l r u r From the defntons of L and U we wrte b = k m k m k3 mr r kr r whch by takng = n () mples b = a n whch shows the clam for = j Next we look at the super-dagonal entres of matrx B rn Consder the case j = q where q r Thus by the defnton of B n for q r b q = a q = n l s u sq s= We consder two cases Frst we assume r q and so l t u tq = l u q l u q l u q t= = m k q m q k q m kq kq whch by takng q and n n () gves us t= l t u tq = a q whch completes the proof for the frst case Now we consder the case r q < Thus we wrte b q = a q = n r q l s u sq = l t u tq s= t= From the defntons of matrces U and L we can wrte r q l t u tq = l u q l u q l r q u rqq t= Usng () we obtan b q = a q = k q m kq m k3q mr q rq kr rq r q = k q m t t kqt t t= whch completes the proof for the upper dagonal entres of matrx B rn Fnally we look at the upper dagonal entres of the matrx B rn and we need to show that b q = a (q) Here we frst consder the case r q From the defntons of matrces U and L b q = n l qt u t = t= l qt u t t= = m q k mq k m q k mq k = m q k t= m qt t kt t

5 30 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) 6 35 whch by takng n and q n () mples b q = a (q) For the fnal case that s > r q usng the defntons of U and L we wrte b q = n r q l qt u t = l q t u t t= t= = l q u l q u l q rq u rq = m q k m q k mq(r q ) rq r q = m q k t= m qt t kt t whch by takng n and q n () gves b q = a (q) and the theorem s proved k r q rq The result of Theorem wll be vald for the LU factorzaton of any arbtrary square matrx by takng r = n n the matrx B rn Now we gve a closed formula for det B rn usng the LU factorzaton of Brn Corollary For n > 0 n det B rn = = k where k s are gven by () 3 The nverse of trangular matrces In ths secton we gve an explct formula for the nverse of a general trangular matrx For ths purpose we construct certan submatrces of a trangular matrx whch are Hessenberg matrces and then we consder the determnants of these submatrces to determne the entres of the nverse of the consdered trangular matrx Snce upper and lower trangular matrces have essentally the same propertes frst we consder the upper trangular matrx case We denote the correspondng Hessenberg matrces for an upper and a lower trangular matrx by H u (r s) and H l (r s) respectvely Let H = h j be an arbtrary (n n) upper trangular matrx Now we construct square Hessenberg submatrces of H hj of order s r n the followng way: for s > r > 0 let H u (r s) = denote an upper Hessenberg submatrx of H by deletng ts frst r and last (n s) columns and frst (r ) and last (n s ) rows Clearly the (s r) (s r) upper Hessenberg matrx H u (r s) takes the form: h rr h rr h rs h rs h rr h rr h rs h rs H u (r s) = 0 h s s h s s h s s 0 0 h s s h s s (6) Smlarly let H = h j be an arbtrary (n n) lower trangular matrx We construct square Hessenberg submatrces of ĥj H of order (r s) n the followng way: for r > s > 0 let H l (r s) = denote a lower Hessenberg submatrx of H by deletng ts frst r and last (n s) rows and frst (r ) and last (n s ) columns Clearly the (r s) (r s) lower Hessenberg matrx H l (r s) takes the form: h rr h rr 0 0 h rr h rr H l (r s) = hs s h s r h s r h s s h s s h sr h sr h ss h ss

6 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) Here we note that (H u (r s)) T = (H l (s r)) Our constructon s vald for any upper or lower trangular matrx but we wll apply t only to L U gven by (4) and (5) renderng L l ( j) U u ( j) For example let A be an upper trangular matrx of order 6 as follows: a b c d e f 0 a b c d e A = 0 0 a 3 b 3 c 3 d a 4 b 4 c a 5 b a 6 Thus A u ( 5) and A u (3 6) take the forms : b c d b3 c 3 d 3 A u ( 5) = a 3 b 3 c 3 and A u (3 6) = a 4 b 4 c 4 0 a 4 b 4 0 a 5 b 5 Here note that all matrces of the form H u ( j) (H l ( j)) obtaned from an upper (lower) trangular matrx U are upper (lower) Hessenberg matrces Now we start wth the followng two lemmas Throughout ths paper we assume the boundary condtons H u (r r) = H l (r r) = and j x = for > j Lemma 3 Let the (j ) (j ) upper Hessenberg matrx H u ( j) be defned as n (6) Then for j > j j det H u ( j) = ( ) j t a j tj det (H u ( j t)) a kk t= k=j t Proof If we compute the determnant of the upper Hessenberg matrx H u ( j) by the Laplace expanson of a determnant wth respect to the last column then the proof follows Theorem 4 Let U = a j be an (n n) arbtrary upper trangular matrx and W = wj = U ts nverse Then (a ) f = j w j = j a kk ( ) j det (H u ( j)) j > k= where H u (r s) s as before Proof Denote WU by E = e j It s clear that for the case = j E = In where I n s the nth unt matrx Now consder the case j > From the defntons of matrces W and U e j = n w t a tj = t= = a j a j w t a tj t= j t a kk ( ) t a tj det (H u ( t)) t= k= = a j a ( ) a j det (H u ( )) a a ( ) a j det (H u ( )) a a a = ( )j a j j det (H u ( j )) j a kk j k= a kk a j ( ) k= j k= j a j j ( ) j ( ) j det (H u ( j)) k=j a kk a j ( ) ( ) j a j j det (H u ( j )) ( ) j det (H u ( j)) j j a kk j k= k= a kk det (H u ( )) det (H u ( j )) ( ) j a j j det (H u ( j )) a kk k=

7 3 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) 6 35 = j j j a kk k= t= k=t a kk ( ) t a t j det (H u ( t )) whch by Lemma 3 mples e j = 0 and the proof s completed ( ) j det (H u ( j)) All the results of ths secton hold for lower trangular matrces wth the obvous modfcaton usng the lower Hessenberg matrx Now we menton an nterestng fact that the numbers of summed or subtracted terms n computng the nverse of a term of an upper (lower) trangular matrx are the generalzed order-k Fbonacc numbers defned by f k n = k = c f k n n > 0 where f k = f k = = k f k = 0 0 When k = and c = c = the generalzed order- Fbonacc numbers are the usual Fbonacc numbers that s f = m F m (mth Fbonacc number) When also k = 3 c = c = c 3 = then the generalzed order-3 Fbonacc numbers by the ntal condtons f 3 = f 3 = 0 f 3 = 0 are whch are also known as trbonacc numbers Let U n = u j be an upper (wth k super-dagonals) trangular matrx of order n wth u = h for n u r = cr t= a r for n r r k and h s are all dstnct from zero and a r s are arbtrary For computng the nverse of U n we need the correspondng Hessenberg submatrces defned as before by H (r s) Therefore we should note that the numbers of summed or subtracted terms n computng the nverse of a term of U n omttng the sgns and denomnators of the terms that s the number of requred summatons n the expanson of det (H (r s)) are the generalzed order-(s r) Fbonacc numbers f s r n To show that we consder a (k k) upper Hessenberg matrx H k = a j wth r-superdagonals whose entres are gven by a = e for k a r = c r t= h(r) t for k r and 0 r k e 0 for all If one superdagonal has a 0 entry then all the entres n ths superdagonal are zeros That s f a r = 0 for some and r then c r = 0 Here E n denotes the number of summed or subtracted terms n det H n For example f a b c H 3 = d e f 0 g h then det H 3 = ahe afg bdh cdg and so the correspondng E 3 = 4 By expandng det H n wth respect to the frst row wthout any smplfcaton n the entres h (r) = c r t= a r we get E n = c E n c E n c r E n r One easly computes that E = E = E 3 = 4 E r = r Consequently one can see that E n = f k n where f k n s the generalzed order-k Fbonacc numbers For example for k = 4 r = let c = and c = that s a = t= h() t = h () h () a = and so h () h() h () 0 0 e H 4 = h () h() h () 0 0 e h () 3 h() 3 h () e 3 h () 4 h() 4 Snce r = c = c = the countng sequence E n satsfes E n = E n E n wth E = E = so E n = P n the well known Pell sequence Therefore the number of summed or subtracted terms whle computng det H 4 s the 5th Pell number: h () h() h () 0 0 e h () det h() h () 0 0 e h () 3 h() 3 h () e 3 h () 4 h() 4 = e e 3 h h 3 h h h 3 h 4 h h h 3 h 4 h h h 4 h 3 h h 3 h h 4 t= h() t = h ()

8 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) h h h 3 h 4 h h h 3 h 4 h h 3 h h 4 h h h 4 h 3 h h h 3 h 4 h h h 4 h 3 h h 3 h h 4 h h h 3 h 4 h h h 3 h 4 h h 3 h h 4 h h h 4 h 3 h h h 3 h 4 e h h 3h 4 e h h h 4 e 3 h h h 3 e h h 3h 4 e h h 4h 3 e h h h 4 e h h h 4 e 3 h h 3 h e 3 h h h 3 e h h 3h 4 e h h h 4 e 3 h h 3 h From the above example t s seen that there are 9 terms n the expanson of det H 4 whch s the 5th Pell number P 5 4 The nverse of an r-banded matrx In ths secton we gve a closed formula for the nverse of an r-banded matrx Frst we consder the nverse of the upper trangular matrx L Here we recall a well known fact that the nverse of an upper trangular matrx s also upper trangular We shall gve the followng lemmas whose proofs are straghtforward Lemma 5 Let the lower trangular matrx L be as n (4) Let E = e j denote the nverse of L Then f = j e j = ( ) j det (L l ( j)) f j < where L l ( j) s defned as before Lemma 6 Let the upper trangular matrx U be as n (5) Let G = g j denote the nverse of U Then f j = k g j = ( ) j det (U u ( j)) f j > j k r r= where U u ( j) s defned as before The man result of ths secton follows from the LU factorzaton of B rn and the prevous lemmas Theorem 7 Let D n = d j denote the nverse of the matrx Brn Then d j = n t= g te tj where g t e tj are defned n the prevous lemmas Precsely f we let S( t j) = det(u u(j)) det(l l (tj)) j then r= k r ( ) j det(u u( j)) n ( ) j j S( t j) d j = k k r r= n S( t ) t> ( ) j det(l l ( j)) ( ) j k t>j f < j f = j n S( t j) f > j t> Proof Snce B rn = LU then by the prevous two lemmas we get D = U L and so n n d j = g t e tj = g t e tj t= t=max{j} By takng the three cases < j = j > j and usng the expressons of g t e tj from Lemmas 5 and 6 the clam follows 5 Some partcular cases If we take r = and S n to be a symmetrc matrx and label a = a b = b = b we obtan the formulas of [] for the nverse of

9 34 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) 6 35 a b 0 b a b b 3 a 3 b 4 0 S n = 0 b n a n b n 0 0 b n a n namely the exstence of two sequences u v such that u v u v u v 3 u v n u v u v u v 3 u v n S = u v 3 u v 3 u 3 v 3 u 3 v n n u v n u v n u 3 v n u n v n The sequences u v j can be determned (as Meurant dd n []) usng the LU decomposton of Theorem and they wll depend on our k j mj We wll not repeat the argument here Consder the general bnary recurrence G n = a G n b G n G 0 = 0 G = Let 0 0 a 0 0 b a 0 0 G 3n = 0 a 0 0 b a Its nverse s [] G 0 0 G G 0 0 G 3 G G 0 0 G 3n G n G n G G 0 G n G n G 3 G G In the same manner by gong through our argument one can obtan many other known (and possbly unknown) matrx nverses and determnants We end by dsplayng yet another example based on the Chebyshev polynomals of the second knd U n (x) = sn(n)θ cos θ = x whch satsfy the recurrence: U sn θ n (x) = xu n (x) U n (x) U 0 (x) = a b 0 0 b a b 0 U (x) = x The symmetrc Toepltz S = has the nverse [3] S = (t j ) j where t j = 0 b a b 0 b a U (a/b)u n j (a/b) ( ) j j b U n (a/b) ( ) j U j (a/b)u n (a/b) > j b U n (a/b) It could be nterestng to use a varaton of the methods of ths paper to nvestgate the spectrum of general r-banded matrces (see [4] for example) Acknowledgments The authors thank the referee for pontng out several shortcomngs n the presentaton of the paper The second author was partally supported by Ar Force CVAQ (D Nussbaum) and NPS-RIP References [] P Schlegel The explct nverse of a trdagonal matrx Math Comp 4 (970) 665 [] V Vmur A novel way of expressng a class of trdagonal band matrx n terms of Gegenbauer polynomals Matrx & Tensors Quart 0 (969) [3] TR Prabhakar A Srvastava RC Tomar Inverse of a trdagonal band matrx n terms of generalzed Hermte polynomals Indan J Pure Appl Math 0 (979) 84 87

10 E Kılıç P Stanca / Journal of Computatonal and Appled Mathematcs 37 (03) [4] TS Papatheodorou Inverses for a class of banded matrces and applcatons to pecewse cubc approxmaton J Comput Appl Math 8 (4) (98) [5] RK Mallk The nverse of a lower trangular matrx Int J Math Game Theory Algebra 8 (999) [6] CM da Fonseca J Petronlho Explct nverses of some trdagonal matrces Lnear Algebra Appl 35 (00) 7 [7] E Klc Explct formula for the nverse of a trdagonal matrx by backward contnued fractons Appl Math Comput 97 (008) [8] H-B L T-Z Huang X-P Lu H L On the nverses of general trdagonal matrces Lnear Algebra Appl 433 (5) (00) [9] RK Mallk The nverse of a trdagonal matrx Lnear Algebra Appl 35 (00) [0] M El-Mkkawy A Karawa Inverson of general trdagonal matrces Appl Math Lett 9 (006) 7 70 [] G Meurant A revew on the nverse of symmetrc trdagonal and block trdagonal matrces SIAM J Matrx Anal Appl 3 (99) [] W Wang T Wang Identtes va Bell matrx and Fbonacc matrx Dscrete Appl Math 56 (008) [3] U Kamps Chebyshev polynomals and least squares estmaton based on one-dependent random varables Lnear Algebra Appl (989) 7 30 [4] A Böttcher SM Grudsky EA Maksmenko Insde the egenvalues of certan Hermtan Toepltz band matrces J Comput Appl Math 33 (00) 45 64

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

6. EIGENVALUES AND EIGENVECTORS 3 = 3 2

6. EIGENVALUES AND EIGENVECTORS 3 = 3 2 EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a non-zero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :

More information

We are now ready to answer the question: What are the possible cardinalities for finite fields?

We are now ready to answer the question: What are the possible cardinalities for finite fields? Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

greatest common divisor

greatest common divisor 4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

New bounds in Balog-Szemerédi-Gowers theorem

New bounds in Balog-Szemerédi-Gowers theorem New bounds n Balog-Szemeréd-Gowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A

More information

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs

More information

Ring structure of splines on triangulations

Ring structure of splines on triangulations www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2) MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

More information

Texas Instruments 30X IIS Calculator

Texas Instruments 30X IIS Calculator Texas Instruments 30X IIS Calculator Keystrokes for the TI-30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the

More information

On fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations 1

On fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations 1 General Mathematcs Vol. 6, No. 3 (2008), 9 3 On fourth order smultaneously zero-fndng method for multple roots of complex polynomal euatons Nazr Ahmad Mr and Khald Ayub Abstract In ths paper, we present

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Yves Genin, Yurii Nesterov, Paul Van Dooren. CESAME, Universite Catholique de Louvain. B^atiment Euler, Avenue G. Lema^tre 4-6

Yves Genin, Yurii Nesterov, Paul Van Dooren. CESAME, Universite Catholique de Louvain. B^atiment Euler, Avenue G. Lema^tre 4-6 Submtted to ECC 99 as a regular paper n Lnear Systems Postve transfer functons and convex optmzaton 1 Yves Genn, Yur Nesterov, Paul Van Dooren CESAME, Unverste Catholque de Louvan B^atment Euler, Avenue

More information

Non-degenerate Hilbert Cubes in Random Sets

Non-degenerate Hilbert Cubes in Random Sets Journal de Théore des Nombres de Bordeaux 00 (XXXX), 000 000 Non-degenerate Hlbert Cubes n Random Sets par Csaba Sándor Résumé. Une légère modfcaton de la démonstraton du lemme des cubes de Szemeréd donne

More information

Fisher Markets and Convex Programs

Fisher Markets and Convex Programs Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and

More information

1 Approximation Algorithms

1 Approximation Algorithms CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

More information

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

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-2016. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

The descriptive complexity of the family of Banach spaces with the π-property

The descriptive complexity of the family of Banach spaces with the π-property Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014

More information

Communication Networks II Contents

Communication Networks II Contents 8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

More information

Generalizing the degree sequence problem

Generalizing the degree sequence problem Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

More information

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Texas Instruments 30Xa Calculator

Texas Instruments 30Xa Calculator Teas Instruments 30Xa Calculator Keystrokes for the TI-30Xa are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the tet, check

More information

Inequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.

Inequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001. Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6) Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

More information

x f(x) 1 0.25 1 0.75 x 1 0 1 1 0.04 0.01 0.20 1 0.12 0.03 0.60

x f(x) 1 0.25 1 0.75 x 1 0 1 1 0.04 0.01 0.20 1 0.12 0.03 0.60 BIVARIATE DISTRIBUTIONS Let be a varable that assumes the values { 1,,..., n }. Then, a functon that epresses the relatve frequenc of these values s called a unvarate frequenc functon. It must be true

More information

2.4 Bivariate distributions

2.4 Bivariate distributions page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together

More information

QUANTUM MECHANICS, BRAS AND KETS

QUANTUM MECHANICS, BRAS AND KETS PH575 SPRING QUANTUM MECHANICS, BRAS AND KETS The followng summares the man relatons and defntons from quantum mechancs that we wll be usng. State of a phscal sstem: The state of a phscal sstem s represented

More information

Formula of Total Probability, Bayes Rule, and Applications

Formula of Total Probability, Bayes Rule, and Applications 1 Formula of Total Probablty, Bayes Rule, and Applcatons Recall that for any event A, the par of events A and A has an ntersecton that s empty, whereas the unon A A represents the total populaton of nterest.

More information

Implementation of Deutsch's Algorithm Using Mathcad

Implementation of Deutsch's Algorithm Using Mathcad Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

More information

The k-binomial Transforms and the Hankel Transform

The k-binomial Transforms and the Hankel Transform 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 9 (2006, Artcle 06.1.1 The k-bnomal Transforms and the Hankel Transform Mchael Z. Spvey Department of Mathematcs and Computer Scence Unversty of Puget

More information

Section 5.3 Annuities, Future Value, and Sinking Funds

Section 5.3 Annuities, Future Value, and Sinking Funds Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

More information

The Analysis of Outliers in Statistical Data

The Analysis of Outliers in Statistical Data THALES Project No. xxxx The Analyss of Outlers n Statstcal Data Research Team Chrysses Caron, Assocate Professor (P.I.) Vaslk Karot, Doctoral canddate Polychrons Economou, Chrstna Perrakou, Postgraduate

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

ErrorPropagation.nb 1. Error Propagation

ErrorPropagation.nb 1. Error Propagation ErrorPropagaton.nb Error Propagaton Suppose that we make observatons of a quantty x that s subject to random fluctuatons or measurement errors. Our best estmate of the true value for ths quantty s then

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

The Magnetic Field. Concepts and Principles. Moving Charges. Permanent Magnets

The Magnetic Field. Concepts and Principles. Moving Charges. Permanent Magnets . The Magnetc Feld Concepts and Prncples Movng Charges All charged partcles create electrc felds, and these felds can be detected by other charged partcles resultng n electrc force. However, a completely

More information

z(t) = z 1 (t) + t(z 2 z 1 ) z(t) = 1 + i + t( 2 3i (1 + i)) z(t) = 1 + i + t( 3 4i); 0 t 1

z(t) = z 1 (t) + t(z 2 z 1 ) z(t) = 1 + i + t( 2 3i (1 + i)) z(t) = 1 + i + t( 3 4i); 0 t 1 (4.): ontours. Fnd an admssble parametrzaton. (a). the lne segment from z + to z 3. z(t) z (t) + t(z z ) z(t) + + t( 3 ( + )) z(t) + + t( 3 4); t (b). the crcle jz j 4 traversed once clockwse startng at

More information

Stability, observer design and control of networks using Lyapunov methods

Stability, observer design and control of networks using Lyapunov methods Stablty, observer desgn and control of networks usng Lyapunov methods von Lars Naujok Dssertaton zur Erlangung des Grades enes Doktors der Naturwssenschaften - Dr. rer. nat. - Vorgelegt m Fachberech 3

More information

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence 1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

More information

Some Recent Tools and a BDDC Algorithm for 3D Problems in H(curl)

Some Recent Tools and a BDDC Algorithm for 3D Problems in H(curl) Some Recent Tools and a BDDC Algorthm for 3D Problems n H(curl) Clark R. Dohrmann 1 and Olof B. Wdlund 2 1 Sanda Natonal Laboratores, Albuquerque, New Mexco, 87185-0346, USA. Sanda s a multprogram laboratory

More information

On the Solution of Indefinite Systems Arising in Nonlinear Optimization

On the Solution of Indefinite Systems Arising in Nonlinear Optimization On the Soluton of Indefnte Systems Arsng n Nonlnear Optmzaton Slva Bonettn, Valera Ruggero and Federca Tnt Dpartmento d Matematca, Unverstà d Ferrara Abstract We consder the applcaton of the precondtoned

More information

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

LECTURE 2: CRYSTAL BASES

LECTURE 2: CRYSTAL BASES LECTURE 2: CRYSTAL BASES STEVEN SAM AND PETER TINGLEY Today I ll defne crystal bases, and dscuss ther basc propertes. Ths wll nclude the tensor product rule and the relatonshp between the crystals B(λ)

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

In our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is

In our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is Payout annutes: Start wth P dollars, e.g., P = 100, 000. Over a 30 year perod you receve equal payments of A dollars at the end of each month. The amount of money left n the account, the balance, earns

More information

The covariance is the two variable analog to the variance. The formula for the covariance between two variables is

The covariance is the two variable analog to the variance. The formula for the covariance between two variables is Regresson Lectures So far we have talked only about statstcs that descrbe one varable. What we are gong to be dscussng for much of the remander of the course s relatonshps between two or more varables.

More information

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem. Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set

More information

Joe Pimbley, unpublished, 2005. Yield Curve Calculations

Joe Pimbley, unpublished, 2005. Yield Curve Calculations Joe Pmbley, unpublshed, 005. Yeld Curve Calculatons Background: Everythng s dscount factors Yeld curve calculatons nclude valuaton of forward rate agreements (FRAs), swaps, nterest rate optons, and forward

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

In the rth step, the computaton of the Householder matrx H r requres only the n ; r last elements of the rth column of A T r;1a r;1 snce we donothave

In the rth step, the computaton of the Householder matrx H r requres only the n ; r last elements of the rth column of A T r;1a r;1 snce we donothave An accurate bdagonal reducton for the computaton of sngular values Ru M. S. Ralha Abstract We present a new bdagonalzaton technque whch s compettve wth the standard bdagonalzaton method and analyse the

More information

1. Measuring association using correlation and regression

1. Measuring association using correlation and regression How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate

More information

The Performance Analysis Of A M/M/2/2+1 Retrial Queue With Unreliable Server

The Performance Analysis Of A M/M/2/2+1 Retrial Queue With Unreliable Server Journal of Statstcal Scence and Applcaton, October 5, Vol. 3, No. 9-, 63-74 do:.765/38-4/5.9.3 D DAV I D PUBLISHING The Performance Analyss Of A M/M//+ Retral Queue Wth Unrelable Server R. Kalyanaraman

More information

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu

More information

FORCED CONVECTION HEAT TRANSFER IN A DOUBLE PIPE HEAT EXCHANGER

FORCED CONVECTION HEAT TRANSFER IN A DOUBLE PIPE HEAT EXCHANGER FORCED CONVECION HEA RANSFER IN A DOUBLE PIPE HEA EXCHANGER Dr. J. Mchael Doster Department of Nuclear Engneerng Box 7909 North Carolna State Unversty Ralegh, NC 27695-7909 Introducton he convectve heat

More information

HÜCKEL MOLECULAR ORBITAL THEORY

HÜCKEL MOLECULAR ORBITAL THEORY 1 HÜCKEL MOLECULAR ORBITAL THEORY In general, the vast maorty polyatomc molecules can be thought of as consstng of a collecton of two electron bonds between pars of atoms. So the qualtatve pcture of σ

More information

CIRCUIT ELEMENTS AND CIRCUIT ANALYSIS

CIRCUIT ELEMENTS AND CIRCUIT ANALYSIS EECS 4 SPING 00 Lecture 9 Copyrght egents of Unversty of Calforna CICUIT ELEMENTS AND CICUIT ANALYSIS Lecture 5 revew: Termnology: Nodes and branches Introduce the mplct reference (common) node defnes

More information

APPLICATIONS OF VARIATIONAL PRINCIPLES TO DYNAMICS AND CONSERVATION LAWS IN PHYSICS

APPLICATIONS OF VARIATIONAL PRINCIPLES TO DYNAMICS AND CONSERVATION LAWS IN PHYSICS APPLICATIONS OF VAIATIONAL PINCIPLES TO DYNAMICS AND CONSEVATION LAWS IN PHYSICS DANIEL J OLDE Abstract. Much of physcs can be condensed and smplfed usng the prncple of least acton from the calculus of

More information

Pricing Multi-Asset Cross Currency Options

Pricing Multi-Asset Cross Currency Options CIRJE-F-844 Prcng Mult-Asset Cross Currency Optons Kenchro Shraya Graduate School of Economcs, Unversty of Tokyo Akhko Takahash Unversty of Tokyo March 212; Revsed n September, October and November 212

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

21 Vectors: The Cross Product & Torque

21 Vectors: The Cross Product & Torque 21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl

More information

Imperial College London

Imperial College London F. Fang 1, C.C. Pan 1, I.M. Navon 2, M.D. Pggott 1, G.J. Gorman 1, P.A. Allson 1 and A.J.H. Goddard 1 1 Appled Modellng and Computaton Group Department of Earth Scence and Engneerng Imperal College London,

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

LECTURE 1: MOTIVATION

LECTURE 1: MOTIVATION LECTURE 1: MOTIVATION STEVEN SAM AND PETER TINGLEY 1. Towards quantum groups Let us begn by dscussng what quantum groups are, and why we mght want to study them. We wll start wth the related classcal objects.

More information

How Much to Bet on Video Poker

How Much to Bet on Video Poker How Much to Bet on Vdeo Poker Trstan Barnett A queston that arses whenever a gae s favorable to the player s how uch to wager on each event? Whle conservatve play (or nu bet nzes large fluctuatons, t lacks

More information

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

More information

The material in this lecture covers the following in Atkins. 11.5 The informtion of a wavefunction (d) superpositions and expectation values

The material in this lecture covers the following in Atkins. 11.5 The informtion of a wavefunction (d) superpositions and expectation values Lecture 7: Expectaton Values The materal n ths lecture covers the followng n Atkns. 11.5 The nformton of a wavefuncton (d) superpostons and expectaton values Lecture on-lne Expectaton Values (PDF) Expectaton

More information

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz

More information

Consider a 1-D stationary state diffusion-type equation, which we will call the generalized diffusion equation from now on:

Consider a 1-D stationary state diffusion-type equation, which we will call the generalized diffusion equation from now on: Chapter 1 Boundary value problems Numercal lnear algebra technques can be used for many physcal problems. In ths chapter we wll gve some examples of how these technques can be used to solve certan boundary

More information

Some geometric probability problems involving the Eulerian numbers

Some geometric probability problems involving the Eulerian numbers Some geometrc probablty problems nvolvng the Euleran numbers Frank Schmdt Rodca Smon Department of Mathematcs The George Washngton Unversty Washngton, DC 20052 smon@math.gwu.edu Dedcated to Herb Wlf on

More information

Faraday's Law of Induction

Faraday's Law of Induction Introducton Faraday's Law o Inducton In ths lab, you wll study Faraday's Law o nducton usng a wand wth col whch swngs through a magnetc eld. You wll also examne converson o mechanc energy nto electrc energy

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

Do Hidden Variables. Improve Quantum Mechanics?

Do Hidden Variables. Improve Quantum Mechanics? Radboud Unverstet Njmegen Do Hdden Varables Improve Quantum Mechancs? Bachelor Thess Author: Denns Hendrkx Begeleder: Prof. dr. Klaas Landsman Abstract Snce the dawn of quantum mechancs physcst have contemplated

More information

SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

More information

On Leonid Gurvits s proof for permanents

On Leonid Gurvits s proof for permanents On Leond Gurvts s proof for permanents Monque Laurent and Alexander Schrver Abstract We gve a concse exposton of the elegant proof gven recently by Leond Gurvts for several lower bounds on permanents.

More information