Analysis of the Expected Number of Bit Comparisons Required by Quickselect
|
|
- Sarah Harris
- 6 years ago
- Views:
Transcription
1 Aalysis of the Expected Number of Bit Comparisos Required by Quickselect James Alle Fill Takéhiko Nakama Abstract Whe algorithms for sortig ad searchig are applied to keys that are represeted as bit strigs, we ca quatify the performace of the algorithms ot oly i terms of the umber of key comparisos required by the algorithms but also i terms of the umber of bit comparisos. Some of the stadard sortig ad searchig algorithms have bee aalyzed with respect to key comparisos but ot with respect to bit comparisos. I this exteded abstract, we ivestigate the expected umber of bit comparisos required by Quickselect also kow as Fid. We develop exact ad asymptotic formulae for the expected umber of bit comparisos required to fid the smallest or largest key by Quickselect ad show that the expectatio is asymptotically liear with respect to the umber of keys. Similar results are obtaied for the average case. For fidig keys of arbitrary rak, we derive a exact formula for the expected umber of bit comparisos that usig ratioal arithmetic requires oly fiite summatio rather tha such operatios as umerical itegratio ad use it to compute the expectatio for each target rak. 1 Itroductio ad Summary Whe a algorithm for sortig or searchig is aalyzed, the algorithm is usually regarded either as comparig keys pairwise irrespective of the keys iteral structure or as operatig o represetatios such as bit strigs of keys. I the former case, aalyses ofte quatify the performace of the algorithm i terms of the umber of key comparisos required to accomplish the task; Quickselect also kow as Fid is a example of those algorithms that have bee studied from this poit of view. I the latter case, if keys are represeted as bit strigs, the aalyses quatify the performace of the algorithm i terms of the umber of bits compared util Supported by NSF grat DMS 4614, ad by The Johs Hopkis Uiversity s Acheso J. Duca Fud for the Advacemet of Research i Statistics. Departmet of Applied Mathematics ad Statistics at The Johs Hopkis Uiversity. Departmet of Applied Mathematics ad Statistics at The Johs Hopkis Uiversity. it completes its task. Digital search trees, for example, have bee examied from this perspective. I order to fully quatify the performace of a sortig or searchig algorithm ad eable compariso betwee key-based ad digital algorithms, it is ideal to aalyze the algorithm from both poits of view. However, to date, oly Quicksort has bee aalyzed with both approaches; see Fill ad Jaso [3]. Before their study, Quicksort had bee extesively examied with regard to the umber of key comparisos performed by the algorithm e.g., Kuth [11], Régier [16], Rösler [17], Kessl ad Szpakowski [9], Fill ad Jaso [], Neiiger ad Rüschedorf [15], but it had ot bee examied with regard to the umber of bit comparisos i sortig keys represeted as bit strigs. I their study, Fill ad Jaso assumed that keys are idepedetly ad uiformly distributed over,1 ad that the keys are represeted as bit strigs. [They also coducted the aalysis for a geeral absolutely cotiuous distributio over,1.] They showed that the expected umber of bit comparisos required to sort keys is asymptotically equivalet to l lg as compared to the lead-order term of the expected umber of key comparisos, which is asymptotically l. We use l ad lg to deote atural ad biary logarithms, respectively, ad use log whe the base does ot matter for example, i remaider estimates. I this exteded abstract, we ivestigate the expected umber of bit comparisos required by Quickselect. Hoare [7] itroduced this search algorithm, which is treated i most textbooks o algorithms ad data structures. Quickselect selects the m-th smallest key we call it the rak-m key from a set of distict keys. The keys are typically assumed to be distict, but the algorithm still works with a mior adustmet eve if they are ot distict. The algorithm fids the target key i a recursive ad radom fashio. First, it selects a pivot uiformly at radom from keys. Let k deote the rak of the pivot. If k m, the the algorithm returs the pivot. If k > m, the the algorithm recursively operates o the set of keys smaller tha the pivot ad returs the rak-m key. Similarly, if k < m, the the algorithm recursively oper-
2 ates o the set of keys larger tha the pivot ad returs the k m-th smallest key from the subset. Although previous studies e.g., Kuth [1], Mahmoud et al. [13], Grübel ad U. Rösler [6], Let ad Mahmoud [1], Mahmoud ad Smythe [14], Devroye [1], Hwag ad Tsai [8] examied Quickselect with regard to key comparisos, this study is the first to aalyze the bit complexity of the algorithm. We suppose that the algorithm is applied to distict keys that are represeted as bit strigs ad that the algorithm operates o idividual bits i order to fid a target key. We also assume that the keys are uiformly ad idepedetly distributed i, 1. For istace, cosider applyig Quickselect to fid the smallest key amog three keys k 1, k, ad k 3 whose biary represetatios are , , ad , respectively. If the algorithm selects k 3 as a pivot, the it compares each of k 1 ad k to k 3 i order to determie the rak of k 3. Whe k 1 ad k 3 are compared, the algorithm requires bit comparisos to determie that k 3 is smaller tha k 1 because the two keys have the same first digit ad differ at the secod digit. Similarly, whe k ad k 3 are compared, the algorithm requires 4 bit comparisos to determie that k 3 is smaller tha k. After these comparisos, key k 3 has bee idetified as smallest. Hece the search for the smallest key requires a total of 6 bit comparisos resultig from the two key comparisos. We let µm, deote the expected umber of bit comparisos required to fid the rak-m key i a file of keys by Quickselect. By symmetry, µm, µ1 m,. First, we develop exact ad asymptotic formulae for µ1, µ,, the expected umber of bit comparisos required to fid the smallest key by Quickselect, as summarized i the followig theorem. Theorem 1.1. The expected umber µ1, of bit comparisos required by Quickselect to fid the smallest key i a file of keys that are idepedetly ad uiformly distributed i, 1 has the followig exact ad asymptotic expressios: µ1, H 1 c 1 l l B 1 11 l 1 l O1, H ad B deote harmoic ad Beroulli umbers, respectively, ad, with χ k : πik l ad γ : Euler s costat..577, we defie 1.1 c : γ 9 l 4 l k Z\{} ζ1 χ k Γ1 χ k Γ4 χ k 1 χ k The costat c ca alteratively be expressed as k 1. c 1 k l. k 1 It is easily see that the expressio 1.1 is real, eve though it ivolves the imagiary umbers χ k. The asymptotic formula shows that the expected umber of bit comparisos is asymptotically liear i with the lead-order coefficiet approximately equal to Hece the expected umber of bit comparisos is asymptotically differet from that of key comparisos required to fid the smallest key oly by a costat factor the expectatio for key comparisos is asymptotically. Complex-aalytic methods are utilized to obtai the asymptotic formula; i a future paper, it will be show how the liear lead-order asymptotics µ1, c [with c give i the form 1.] ca be obtaied without resort to complex aalysis. A outlie of the proof of Theorem 1.1 is provided i Sectio 3. We also derive exact ad asymptotic expressios for the expected umber of bit comparisos for the average case. We deote this expectatio by µ m,. I the average case, the parameter m i µm, is cosidered a discrete uiform radom variable; hece µ m, 1 m1 µm,. The derived asymptotic formula shows that µ m, is also asymptotically liear i ; see More detailed results for µ m, are described i Sectio 4. Lastly, i Sectio 5, we derive a exact expressio of µm, for each fixed m that is suited for computatios. Our prelimiary exact formula for µm, [show i.7] etails ifiite summatio ad itegratio. As a result, it is ot a desirable form for umerically computig the expected umber of bit comparisos. Hece we establish aother exact formula that oly requires fiite summatio ad use it to compute µm, for m 1,...,,,..., 5. The computatio leads to the followig coectures: i for fixed, µm, [which of course is symmetric about 1/] icreases i m for m 1/; ad ii for fixed m, µm, icreases i asymptotically liearly. Space limitatios o this exteded abstract force us to omit a substatial portio of the details of our study. We refer the iterested reader to our full-legth paper [4]. k
3 Prelimiaries To ivestigate the bit complexity of Quickselect, we follow the geeral approach developed by Fill ad Jaso [3]. Let U 1,..., U deote the keys uiformly ad idepedetly distributed o, 1, ad let U i deote the rak-i key. The, for 1 i < assume,.1 P {U i ad U are compared} if m i m 1 if i < m < i 1 m i 1 if m. To determie the first probability i.1, ote that U m,..., U remai i the same subset util the first time that oe of them is chose as a pivot. Therefore, U i ad U are compared if ad oly if the first pivot chose from U m,..., U is either U i or U. Aalogous argumets establish the other two cases. For < s < t < 1, it is well kow that the oit desity fuctio of U i ad U is give by f Ui,U s, t : i 1, 1, i 1, 1,. s i 1 t s i 1 1 t. Clearly, the evet that U i ad U are compared is idepedet of the radom variables U i ad U. Hece, defiig P 1 s, t, m, :.3 P s, t, m, :.4 P 3 s, t, m, :.5 m i< 1 i<m< 1 i< m m 1 f U i,u s, t, i 1 f U i,u s, t, m i 1 f U i,u s, t, P s, t, m, : P 1 s, t, m, P s, t, m,.6 P 3 s, t, m, [the sums i.3.5 are double sums over i ad ], ad lettig βs, t deote the idex of the first bit at which the keys s ad t differ, we ca write the expectatio µm, of the umber of bit comparisos required to fid the rak-m key i a file of keys as µm, k l1 βs, tp s, t, m, dt ds s k l 1 k l k l 1 k l 1 k k 1 P s, t, m, dt ds; i this expressio, ote that k represets the last bit at which s ad t agree. 3 Aalysis of µ1, I Sectio 3.1, we outlie a derivatio of the exact expressio for µ1, show i Theorem 1.1; see the full paper [4] for the umerous suppressed details of the various computatios. I Sectio 3., we prove the asymptotic result asserted i Theorem Exact Computatio of µ1, Sice the cotributio of P s, t, m, or P 3 s, t, m, to P s, t, m, is zero for m 1, we have P s, t, 1, P 1 s, t, 1, [see.4 through.6]. Let x : s, y : t s, z : 1 t. The 3.1 P 1 s, t, 1, z 1 i< x i 1 y i 1 z 1 t. From.7 ad 3.1, µ1, i 1, 1, i 1, 1, k k 1 k [l 1 l 1 1 ]. k l1 To further trasform 3., defie B r 1 if r r r a,r 1 if r 1 1 if r,
4 B r deotes the r-th Beroulli umber. Let S, : l1 l 1. The S, 1 r a,r r see Kuth [11], ad 1 µ1, k 1 k k a,r k r 1 r r1 H 1 t, H deotes the -th harmoic umber ad [ B ] 3.5 t : Asymptotic Aalysis of µ1, I order to obtai a asymptotic expressio for µ1,, we aalyze t i The followig lemma provides a exact expressio for t that easily leads to a asymptotic expressio for µ1, : Lemma 3.1. Let γ deote Euler s costat..577, ad defie χ k : πik l. The t H 1 a 1 [ H H 7 ] l γ 1 l 1 H 3 b Σ, a : γ 9 18 l l b : Σ : k Z\{} k Z\{} k Z\{} ζ1 χ k Γ1 χ k Γ4 χ k 1 χ k, ζ1 χ k Γ χ k l 1 χ k Γ3 χ k, ζ1 χ k Γ χ k Γ 1 l 1 χ k Γ 1 χ k, ad H deotes the -th Harmoic umber of order, i.e., H : i1 1 i. The proof of the lemma ivolves complex-aalytic techiques ad is rather legthy, so it is omitted i this exteded abstract; see our full-legth paper [4]. From 3.4, the exact expressio for t also provides a alterative exact expressio for µ1,. Usig Lemma 3.1, we complete the proof of Theorem 1.1. We kow H l γ O 4, H π O 3. Combiig with 3.4 ad Lemma 3.1, we obtai a asymptotic expressio for µ1, : µ1, a 1 l l l 1 l O The term O1 i 3.8 has fluctuatios of small magitude due to Σ, which is periodic i log with amplitude smaller tha.11. Thus, as asserted i Theorem 1.1, the asymptotic slope i 3.8 is c a γ 9 l 4 l k Z\{} ζ1 χ k Γ1 χ k Γ4 χ k 1 χ k. The alterative expressio 1. for c is established i a forthcomig revisio to our full-legth paper [4]; this was also doe idepedetly by Graber ad Prodiger [5]. As described i their paper, suitable use of Stirlig s formula with bouds allows oe to compute c very rapidly to may decimal places. 4 Aalysis of the Average Case: µ m, 4.1 Exact Computatio of µ m, Here we cosider the parameter m i µm, as a discrete radom variable with uiform probability mass fuctio P {m i} 1/, i 1,,...,, ad average over m while the parameter is fixed. Thus, usig the otatio defied i Sectio, µ m, µ 1 m, µ m, µ 3 m,,, for l 1,, 3, µ l m, s βs, t 1 P l s, t, m, dt ds. m1 Here µ 1 m, µ 3 m, by a easy symmetric argumet we omit, ad so 4. µ m, µ 1 m, µ m, ; we will compute µ 1 m, ad µ m, exactly i Sectio
5 4.1.1 Exact Computatio of µ m, We use the followig lemma i order to compute µ 1 m, exactly: Lemma s βs, t 1 P 1 s, t, m, dt ds m 1 1 B Space limitatios o this exteded abstract do ot allow us to prove this lemma here; we give the proof i our full-legth paper [4]. Sice µ 1 m, 1 µ1, 1 1 s βs, t 1 P 1 s, t, m, dt ds, m From , we obtai 4.5 µ m, B 4 B [1 1 ] 1. We rewrite or combie some of the terms i 4.5 for the asymptotic aalysis of µ m, described i the ext sectio. We defie it follows from 3.4 ad Lemma 4.1 that µ 1 m, B B F 1 : F : F 3 : F 4 : F 5 : The , B B [ [1 1 ]. 3 ] [ 1 1, 1 ], Similarly, after laborious calculatios, oe ca show that µ m, [1 1 ] µ m, 1 8 F 1 4 F 4 9 F F 4 8 F Asymptotic Aalysis of µ m, We derive a asymptotic expressio for µ m, show i 4.6.
6 Routie argumets show that F l 4 γ 4.7 l γ 1 O1, 1 F 3 l γ 1 l O1, 4.8 F l ã 1 9 γ 1 8 l O1, F 5 1 l 3 l γ l 1 ã : l O, 1 l l 7 36 l 41 7 γ 1 l ζ1 χ k Γ1 χ k l χ k Γ4 χ k. k Z\{} Sice F is equal to t, which is defied at 3.5 ad aalyzed i Sectio 3., we already have a asymptotic expressio for F. Therefore, from , we obtai the followig asymptotic formula for µ m, : µ m, 41 l ã 4 l l l 1 l O1. The asymptotic slope 41 l ã is approximately We have ot yet sought a alterative form for ã like that for c i Derivatio of a Closed Formula for µm, The exact expressio for µm, obtaied i Sectio [see.7] ivolves ifiite summatio ad itegratio. Hece it is ot a preferable form for umerically computig the expectatio. I this sectio, we establish aother exact expressio for µm, that oly ivolves fiite summatio. We also use the formula to compute µm, for m 1,...,,,...,. As described i Sectio, it follows from equatios.6.7 that µm, µ 1 m, µ m, µ 3 m,,, for q 1,, 3, µ q m, : 5.1 k k l1 l 1 k sl 1 k l k tl 1 k k 1 P q s, t, m, dt ds. The same techique ca be applied to elimiate the ifiite summatio ad itegratio from each µ q m,. We describe the techique for obtaiig a closed expressio of µ 1 m,. First, we trasform P 1 s, t, m, show i.3 so that we ca elimiate the itegratio i µ 1 m,. Defie C 1 i, : I{1 m i < } 5. m 1 i 1, 1, i 1, 1, I{1 m i < } is a idicator fuctio that equals 1 if the evet i braces holds ad otherwise. The 5.3 P 1 s, t, m, C f, h : f1 fm 1 fh im f f h s f t h C f, h, i 1 C 1 i, f i 1 1 h i 1. h f Thus, from 5.1 ad 5.3, we ca elimiate the itegratio i µ 1 m, ad express it usig polyomials i l: 5.4 µ 1 m, fm 1 k l1 f h C 3 f, h k 1 k kfh [l h1 l 1 h1 ] [l 1 f1 l 1 f1 ], C 3 f, h : 1 1f 1 C f, h.,
7 Oe ca show that [ l h1 l 1 ] [ h1 l 1 ] f1 l 1 f1 5.5 fh1 1 1 h C 4 f, h, l 1, h 1 C 4 f, h, : 1 fh 1 1 f f 1 h 1 1 [ 1 From , we obtai f1 ] 1 1. µ 3 m,. I order to derive the aalogous exact formula for µ m,, oe eed oly start the derivatio by chagig the idicator fuctio i C 1 i, [see 5.] to I{1 i < m < } ad follow each step of the procedure; similarly, for µ 3 m,, oe eed oly start the derivatio by chagig the idicator fuctio to I{1 i < m }. Usig the closed exact formulae of µ 1 m,, µ m,, ad µ 3 m,, we computed µm, for, 3,..., ad m 1,,...,. Figure 1 shows the results, which suggest the followig: i for fixed, µm, [which of course is symmetric about 1/] icreases i m for m 1/; ad ii for fixed m, µm, icreases i asymptotically liearly. Expectatio of bit comparisos µ 1 m, fm 1 f h fh1 1 C 5 f, h, k k 1 kfh l 1, k C 5 f, h, : C 3 f, h C 4 f, h,. Here, as described i Sectio 3.1, l1 μm, k 1 l 1 a,r k r, l1 r a,r is defied by 3.3. Now defie 5 m C 6 f, h,, r : a,r C 5 f, h,. The 5.6 C 7 a : fm 1 µ 1 m, C 7 a1 a, f hα fh1 β a1 C 6 f, h,, a f h, i which α : a f 1 ad β : 1 f h a. The procedure described above ca be applied to derive aalogous exact formulae for µ m, ad Figure 1: Expected umber of bit comparisos for Quickselect. The closed formulae for µ 1 m,, µ m,, ad µ 3 m, were used to compute µm, for 1,,..., represets the umber of keys ad m 1,,..., m represets the rak of the target key. 6 Discussio Our ivestigatio of the bit complexity of Quickselect revealed that the expected umber of bit comparisos required by Quickselect to fid the smallest or largest key from a set of keys is asymptotically liear i with the asymptotic slope approximately equal to
8 Hece asymptotically it differs from the expected umber of key comparisos to achieve the same task oly by a costat factor. The expectatio for key comparisos is asymptotically ; see Kuth [1] ad Mahmoud et al. [13]. This result is rather cotrastive to the Quicksort case i which the expected umber of bit comparisos is asymptotically l lg as the expected umber of key comparisos is asymptotically l see Fill ad Jaso [3]. Our aalysis also showed that the expected umber of bit comparisos for the average case remais asymptotically liear i with the lead-order coefficiet approximately equal to Agai, the expected umber is asymptotically differet from that of key comparisos for the average case oly by a costat factor. The expected umber of key comparisos for the average case is asymptotically 3; see Mahmoud et al. [13]. Although we have yet to establish a formula aalogous to 3.4 ad 4.6 for the expected umber of bit comparisos to fid the m-th key for fixed m, we established a exact expressio that oly requires fiite summatio ad used it to obtai the results show i Figure 1. However, the formula remais computatioally complex. Writte as a sigle expressio, µm, is a seve-fold sum of rather elemetary terms with each sum havig order terms i the worst case; i this sese, the ruig time of the algorithm for computig µm, is of order 7. The expressio for µm, does ot allow us to derive a asymptotic formula for it or to prove the two ituitively obvious observatios described at the ed of Sectio 5. The situatio is substatially better for the expected umber of key comparisos to fid the m-th key from a set of keys; Kuth [1] showed that the expectatio ca be writte as [31H mh m 3 mh 1 m ]. I this exteded abstract, we cosidered idepedet ad uiformly distributed keys i,1. I this case, each bit i a bit-strig key is 1 with probability.5. I ogoig research, we geeralize the model ad suppose that each bit results from a idepedet Beroulli trial with success probability p. The more geeral results of that research will further elucidate the bit complexity of Quickselect ad other algorithms. Ackowledgmet. We thak Philippe Flaolet, Svate Jaso, ad Helmut Prodiger for helpful discussios. [] J. A. Fill ad S. Jaso. Quicksort asymptotics. Joural of Algorithms, 44:4 8,. [3] J. A. Fill ad S. Jaso. The umber of bit comparisos used by Quicksort: A average-case aalysis. Proceedigs of the ACM-SIAM Symposium o Discrete Algorithms, pages 93 3, 4. [4] J. A. Fill ad T. Nakama. Aalysis of the expected umber of bit comparisos required by Quickselect [5] P. J. Graber ad H. Prodiger. O a costat arisig i the aalysis of bit comparisos i Quickselect. Preprit, 7. [6] R. Grübel ad U. Rösler. Asymptotic distributio theory for Hoare s selectio algorithm. Advaces i Applied Probability, 8:5 69, [7] C. R. Hoare. Fid algorithm 65. Commuicatios of the ACM, 4:31 3, [8] H. Hwag ad T. Tsai. Quickselect ad the Dickma fuctio. Combiatorics, Probability ad Computig, 11: ,. [9] C. Kessl ad W. Szpakowski. Quicksort algorithm agai revisited. Discrete Mathematics ad Theoretical Computer Sciece, 3:43 64, [1] D. E. Kuth. Mathematical aalysis of algorithms. I Iformatio Processig 71 Proceedigs of IFIP Cogress, Lublaa, 1971, pages North- Hollad, Amsterdam, 197. [11] D. E. Kuth. The Art of Computer Programmig. Volume 3: Sortig ad Searchig. Addiso-Wesley, Readig, Massachusetts, [1] J. Let ad H. M. Mahmoud. Average-case aalysis of multiple Quickselect: A algorithm for fidig order statistics. Statistics ad Probability Letters, 8:99 31, [13] H. M. Mahmoud, R. Modarres, ad R. T. Smythe. Aalysis of Quickselect: A algorithm for order statistics. RAIRO Iformatique Théorique et Applicatios, 9:55 76, [14] H. M. Mahmoud ad R. T. Smythe. Probabilistic aalysis of multiple Quickselect. Algorithmica, : , [15] R. Neiiger ad L. Rüschedorf. Rates of covergece for Quickselect. Joural of Algorithm, 44:51 6,. [16] M. Régier. A limitig distributio of Quicksort. RAIRO Iformatique Théorique et Applicatios, 3: , [17] U. Rösler. A limit theorem for Quicksort. RAIRO Iformatique Théorique et Applicatios, 5:85 1, Refereces [1] L. Devroye. O the probablistic worst-case time of Fid. Algorithmica, 31:91 33, 1.
Analysis of Execution Costs for QuickSelect. Takéhiko Nakama
Aalysis of Executio Costs for QuickSelect by Takéhiko Nakama A dissertatio submitted to The Johs Hopkis Uiversity i coformity with the requiremets for the degree of Doctor of Philosophy. Baltimore, Marylad
More informationAppendix to Quicksort Asymptotics
Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala
More informationarxiv: v1 [math.pr] 31 Jan 2012
EXACT L 2 -DISTANCE FROM THE LIMIT FOR QUICKSORT KEY COMPARISONS EXTENDED ABSTRACT) arxiv:20.6445v [math.pr] 3 Ja 202 PATRICK BINDJEME JAMES ALLEN FILL Abstract Usigarecursiveapproach, weobtaiasimpleexactexpressioforthel
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationBasics of Probability Theory (for Theory of Computation courses)
Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationAnalysis of the Expected Number of Bit Comparisons Required by Quickselect
Aalyi of the Expected Number of Bit Compario Required by Quickelect Jame Alle Fill Departmet of Applied Mathematic ad Statitic The Joh Hopki Uiverity imfill@hu.edu ad http://www.am.hu.edu/~fill/ ad Takéhiko
More informationOn Binary Search Tree Recursions with Monomials as Toll Functions
O Biary Search Tree Recursios with Moomials as Toll Fuctios Ralph Neiiger Istitut für Mathematische Stochastik Albert-Ludwigs-Uiversität Freiburg Eckerstr. 1 79104 Freiburg Germay April 4, 2001 Abstract
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationCOMPUTING THE EULER S CONSTANT: A HISTORICAL OVERVIEW OF ALGORITHMS AND RESULTS
COMPUTING THE EULER S CONSTANT: A HISTORICAL OVERVIEW OF ALGORITHMS AND RESULTS GONÇALO MORAIS Abstract. We preted to give a broad overview of the algorithms used to compute the Euler s costat. Four type
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More informationQuantum Computing Lecture 7. Quantum Factoring
Quatum Computig Lecture 7 Quatum Factorig Maris Ozols Quatum factorig A polyomial time quatum algorithm for factorig umbers was published by Peter Shor i 1994. Polyomial time meas that the umber of gates
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationx a x a Lecture 2 Series (See Chapter 1 in Boas)
Lecture Series (See Chapter i Boas) A basic ad very powerful (if pedestria, recall we are lazy AD smart) way to solve ay differetial (or itegral) equatio is via a series expasio of the correspodig solutio
More informationRandom assignment with integer costs
Radom assigmet with iteger costs Robert Parviaie Departmet of Mathematics, Uppsala Uiversity P.O. Box 480, SE-7506 Uppsala, Swede robert.parviaie@math.uu.se Jue 4, 200 Abstract The radom assigmet problem
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationRates of Convergence for Quicksort
Rates of Covergece for Quicksort Ralph Neiiger School of Computer Sciece McGill Uiversity 480 Uiversity Street Motreal, HA 2K6 Caada Ludger Rüschedorf Istitut für Mathematische Stochastik Uiversität Freiburg
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationExtremal Weighted Path Lengths in Random Binary Search Trees
Extremal Weighted Path Legths i Radom Biary Search Trees Rafik Aguech 1 Nabil Lasmar 2 Hosam Mahmoud 3 December 18, 2008 Abstract. We cosider weighted path legths to the extremal leaves i a radom biary
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationAdvanced Course of Algorithm Design and Analysis
Differet complexity measures Advaced Course of Algorithm Desig ad Aalysis Asymptotic complexity Big-Oh otatio Properties of O otatio Aalysis of simple algorithms A algorithm may may have differet executio
More informationRegression with an Evaporating Logarithmic Trend
Regressio with a Evaporatig Logarithmic Tred Peter C. B. Phillips Cowles Foudatio, Yale Uiversity, Uiversity of Aucklad & Uiversity of York ad Yixiao Su Departmet of Ecoomics Yale Uiversity October 5,
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationHarmonic Number Identities Via Euler s Transform
1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 12 2009), Article 09.6.1 Harmoic Number Idetities Via Euler s Trasform Khristo N. Boyadzhiev Departmet of Mathematics Ohio Norther Uiversity Ada, Ohio 45810
More informationThe Rand and block distances of pairs of set partitions
The Rad ad block distaces of pairs of set partitios Frak Ruskey 1 ad Jeifer Woodcock 1 Dept. of Computer Sciece, Uiversity of Victoria, CANADA Abstract. The Rad distaces of two set partitios is the umber
More informationA Probabilistic Analysis of Quicksort
A Probabilistic Aalysis of Quicsort You are assumed to be familiar with Quicsort. I each iteratio this sortig algorithm chooses a pivot ad the, by performig comparisios with the pivot, splits the remaider
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationAdvanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4
More informationCS 332: Algorithms. Linear-Time Sorting. Order statistics. Slide credit: David Luebke (Virginia)
1 CS 332: Algorithms Liear-Time Sortig. Order statistics. Slide credit: David Luebke (Virgiia) Quicksort: Partitio I Words Partitio(A, p, r): Select a elemet to act as the pivot (which?) Grow two regios,
More informationFourier series and the Lubkin W-transform
Fourier series ad the Lubki W-trasform Jaso Boggess, Departmet of Mathematics, Iowa State Uiversity Eric Buch, Departmet of Mathematics, Baylor Uiversity Charles N. Moore, Departmet of Mathematics, Kasas
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationENGI Series Page 6-01
ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationPAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationAP Calculus Chapter 9: Infinite Series
AP Calculus Chapter 9: Ifiite Series 9. Sequeces a, a 2, a 3, a 4, a 5,... Sequece: A fuctio whose domai is the set of positive itegers = 2 3 4 a = a a 2 a 3 a 4 terms of the sequece Begi with the patter
More informationStochastic Simulation
Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso
More informationConfidence interval for the two-parameter exponentiated Gumbel distribution based on record values
Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationMonte Carlo Integration
Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationApproximations and more PMFs and PDFs
Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.
More informationAnalysis of Algorithms -Quicksort-
Aalysis of Algorithms -- Adreas Ermedahl MRTC (Mälardales Real-Time Research Ceter) adreas.ermedahl@mdh.se Autum 2004 Proposed by C.A.R. Hoare i 962 Worst- case ruig time: Θ( 2 ) Expected ruig time: Θ(
More informationA Simplified Binet Formula for k-generalized Fibonacci Numbers
A Simplified Biet Formula for k-geeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Zhaohui Du Shaghai, Chia zhao.hui.du@gmail.com
More informationAMS Mathematics Subject Classification : 40A05, 40A99, 42A10. Key words and phrases : Harmonic series, Fourier series. 1.
J. Appl. Math. & Computig Vol. x 00y), No. z, pp. A RECURSION FOR ALERNAING HARMONIC SERIES ÁRPÁD BÉNYI Abstract. We preset a coveiet recursive formula for the sums of alteratig harmoic series of odd order.
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationNew Version of the Rayleigh Schrödinger Perturbation Theory: Examples
New Versio of the Rayleigh Schrödiger Perturbatio Theory: Examples MILOŠ KALHOUS, 1 L. SKÁLA, 1 J. ZAMASTIL, 1 J. ČÍŽEK 2 1 Charles Uiversity, Faculty of Mathematics Physics, Ke Karlovu 3, 12116 Prague
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationC. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions
C. Complex Numbers. Complex arithmetic. Most people thik that complex umbers arose from attempts to solve quadratic equatios, but actually it was i coectio with cubic equatios they first appeared. Everyoe
More informationTopics in Probability Theory and Stochastic Processes Steven R. Dunbar. Stirling s Formula Derived from the Gamma Function
Steve R. Dubar Departmet of Mathematics 23 Avery Hall Uiversity of Nebraska-Licol Licol, NE 68588-3 http://www.math.ul.edu Voice: 42-472-373 Fax: 42-472-8466 Topics i Probability Theory ad Stochastic Processes
More informationFrequency Domain Filtering
Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform
More informationDe Bruijn Sequences for the Binary Strings with Maximum Specified Density
De Bruij Sequeces for the Biary Strigs with Maximum Specified Desity Joe Sawada 1, Brett Steves 2, ad Aaro Williams 2 1 jsawada@uoguelph.ca School of Computer Sciece, Uiversity of Guelph, CANADA 2 brett@math.carleto.ca
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationThe Gamma function Michael Taylor. Abstract. This material is excerpted from 18 and Appendix J of [T].
The Gamma fuctio Michael Taylor Abstract. This material is excerpted from 8 ad Appedix J of [T]. The Gamma fuctio has bee previewed i 5.7 5.8, arisig i the computatio of a atural Laplace trasform: 8. ft
More informationBernoulli numbers and the Euler-Maclaurin summation formula
Physics 6A Witer 006 Beroulli umbers ad the Euler-Maclauri summatio formula I this ote, I shall motivate the origi of the Euler-Maclauri summatio formula. I will also explai why the coefficiets o the right
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationSubject: Differential Equations & Mathematical Modeling-III
Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso
More informationFeedback in Iterative Algorithms
Feedback i Iterative Algorithms Charles Byre (Charles Byre@uml.edu), Departmet of Mathematical Scieces, Uiversity of Massachusetts Lowell, Lowell, MA 01854 October 17, 2005 Abstract Whe the oegative system
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationJournal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula
Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials
More informationNOTE ON THE NUMERICAL TRANSCENDENTS S AND s = - 1. n n n BY PROFESSOR W. WOOLSEY JOHNSON.
NOTE ON THE NUMBERS S AND S =S l. 477 NOTE ON THE NUMERICAL TRANSCENDENTS S AND s = - 1. BY PROFESSOR W. WOOLSEY JOHNSON. 1. The umbers defied by the series 8 =l4--+-4--4-... ' O 3 W 4 W } where is a positive
More informationThe natural exponential function
The atural expoetial fuctio Attila Máté Brookly College of the City Uiversity of New York December, 205 Cotets The atural expoetial fuctio for real x. Beroulli s iequality.....................................2
More informationThe Binomial Theorem
The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationChapter 22 Developing Efficient Algorithms
Chapter Developig Efficiet Algorithms 1 Executig Time Suppose two algorithms perform the same task such as search (liear search vs. biary search). Which oe is better? Oe possible approach to aswer this
More informationSeries with Central Binomial Coefficients, Catalan Numbers, and Harmonic Numbers
3 47 6 3 Joural of Iteger Sequeces, Vol. 5 (0), Article..7 Series with Cetral Biomial Coefficiets, Catala Numbers, ad Harmoic Numbers Khristo N. Boyadzhiev Departmet of Mathematics ad Statistics Ohio Norther
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More information