1.1 1-D Spectra via Method of Stationary Phase

Size: px
Start display at page:

Download "1.1 1-D Spectra via Method of Stationary Phase"

Transcription

1 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE D Spectra via Method of Statioary Phase Now we cosider a differet approximatio of the Fourier trasform that is valid for certai 1-D fuctios at large values of ξ. The process is a applicatio of the method of statioary phase, which was developed by Lord Kelvi i the 1800s to solve itegrals ecoutered i the study of hydrodyamics. I tur, this is a variatio of the method of steepest descets for evaluatig path itegrals of complex fuctios. The method of statioary phase provides useful estimates of itegrals of oscillatig fuctios, ad thus of itegrads with imagiary-valued expoets. This method is particularly applicable to superchirp fuctios e ±iπx, for which o closed form of the spectrum has bee derived. The results obtaied for these fuctios will be applied i several cotexts later i the book. More detailed descriptios are available i Erdelyi (1956) ad Copso (1965). The goverig priciple behid the method of statioary phase will be itroduced by example. Cosider a itegral of the geeral form: I [k] r [x] e ik µ[x] dx (1) where r [x] ad µ [x] are real-valued fuctios ad k is a selectable real-valued parameter. The expoetial fuctio e ik µ[x] oscillates at a rate that depeds o both k ad the fuctioal form of µ [x]. Ifk is large, the rate of oscillatio of the expoetial term must also be large i all regios of the domai where µ [x] 6 0. I such cases, the cotributio to the oscillatig fuctio to the area will be small i ay regio where the expoetial term oscillates more rapidly tha the variatio of r [x], because the areas of the adjacet positive ad egative lobes will approximately cacel. Coversely, i those regios of the domai where k µ [x] is small, the amplitude of the expoetial term will approximate the uit costat. The area of those regios will be determied by the width of this regio of the domai ad the amplitude of the real-valued fuctio r [x]. The real ad imagiary parts of a sample itegrad i these two regios are show i Figure 1c,d. This shows that the itegral i Eq.(1) may be estimated by evaluatig the itegrad oly i those regios where the expoetial term oscillates slowly, i.e., wherever the derivative of the phase fuctio is approximately 0, dµ dx 0; these are the statioary poits of µ [x]. The semi-ifiite itegrals of the real ad imagiary parts over the domai <x a are show i Figure 1e,f. These illustrate that the primary cotributio to the area i both cases arise from the itegrad i the regio of the statioary poit. The example i Figure 1 also shows that the requiremet that r [x] be real valued i Eq.(1) creates o problem whe evaluatig the itegral of a complex-valued fuctio, because the liearity of itegratio allows the itegrals of the idividual parts to be

2 Figure 1.1: Priciple of the Method of Statioary Phase: (a) real-valued modulatio r [x]; (b) phase fuctio m [x], which is approximately statioary i viciity of x ; (c), (d) Real ad imagiary parts of r [x] e iµ[x], showig Z rapid oscillatios away from x statioary poit; (e), (f) Real ad imagiary parts of r [α] e iµ[α] dα, showigthat the primary cotributio to the area is from r [x] i the viciity of the statioary poit.

3 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 3 performed separately ad summed. I [k] µ (<{r[x]} + i {r [x]}) e ik µ[x] dx µ <{r [x]} e ik µ[x] dx + i {r [x]} e ik µ[x] dx () Uder some circumstaces, other ad more subtle aspects of the method of statioary phase require special treatmet. Sice these occur rarely i the cases of greatest iterest i imagig, they will be metioed oly i passig ad ot cosidered i detail. Iterested readers should cosult sources that cocetrate o this subject, especially the work of Erdelyi ad of Friedma. To illustrate use of the method of statioary phase i Fourier aalysis, cosider the Fourier trasform of a 1-D complex-valued fuctio f [x] expressed i terms of its magitude f [x] ad phase Φ{f [x]}: F 1 {f [x]} f [x] e πiξx dx f [x] e iφ{f[x]} e πiξx dx f [x] e i(φ{f[x]} πξx) dx (3) Note that the form of this itegral is somewhat less geeral tha that i Eq.(1) because the modulatio fuctio f [x] is ot oly real valued, but also oegative, whereas r [x] i Eq.(1) may be egative. TheFourieritegraliEq.(3)mayberewritteitheformofEq.(1)bydefiig: µ [x] 1 Φ {f [x]} πx () ξ ad substitutig the spatial frequecy ξ for the parameter k ad f [x] for r [x]: F [ξ] f [x] e iξ µ[x] dx (5) Note that the phase fuctio µ [x] icludes a factor of ξ 1, but this is reasoable sice ξ is a parameter (rather tha a variable) i the itegrad. Thus the result will be a fuctio of this parameter, as it must be. If the phase fuctio µ [x] has o sigularities (i.e., if all of its derivatives are fiite), the µ [x] may be expaded ito a Taylor series about ay arbitrary locatio x 0 :

4 Ã µ [x] µ[x 0 ]+ (x x 0 ) dµ dx xx0! + Ã (x x 0 ) d µ dx xx0! + µ[x 0 ]+(x x 0 ) µ 0 [x 0 ]+ (x x 0) µ 00 [x 0 ] + + (x x 0) µ () [x 0 ]+ (6)! where the commo multiple-prime shorthad otatio for derivatives has bee substituted i the secod expressio for simplicity. We ow select x 0 to be a statioary poit of the phase fuctio, so that µ 0 [x 0 ] 0. For ow, assume that µ [x] has oly oe such statioary poit; extesio to cases with multiple statioary poits is straightforward ad will be cosidered later. The first-order term i the Taylor series vaishes: µ [x] µ [x 0 ]+0+ (x x 0) µ 00 [x 0 ]+ (x x 0) 3 µ 000 [x 0 ]+ (7)! 3! ad the Fourier itegral i Eq.(3) may be rewritte i terms of this series: Z " Ã!# + F [ξ] f [x] exp +iξ µ [x 0 ]+µ 00 (x x 0 ) [x 0 ] + dx Z Ã " Ã!#! + f [x] exp [+iξ µ [x 0 ]] exp +iξ µ 00 [x 0 ] (x x 0) dx Z Ã " Ã!#! + + Y f [x] exp [+iξ µ [x 0 ]] exp +iξ µ () [x 0 ] (x x 0) dx (8) Of course, the zero-order term i the Taylor series is a costat with respect to x ad maybeextractedfromtheitegral: Z Ã " Ã!#! + + Y F [ξ] exp[+iξ µ [x 0 ]] f [x] exp +iξ µ () [x 0 ] (x x 0) dx (9) If the spatial frequecy ξ is assumed to be sufficietly large that the expoetial term oscillates may times over the scale of variatio of f [x], the the itegral may be approximated to evaluate the spectrum. Uder this coditio, the magitude f [x] cotributes sigificat area to the Fourier itegral oly i the viciity of the statioary poit x 0, thus allowig the varyig magitude f [x] to be approximated by the costat f [x 0 ]. I additio, the ifiite limits of the itegral may be chaged to fiite limits i the viciity of the sigle statioary poit. Fially, oly the first ozero term i the Taylor series of order two or larger is sigificat because (x x 0 ) << (x x 0 ) for 3 whe x is i the eighborhood of x 0. The resultig asymptotic form of the

5 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 5 Fourier itegral is: ˆF [ ξ >> 0] f [x 0 ] exp [+iξ µ [x 0 ]] Z x0 + x 0 " # exp +iξ µ 00 [x 0 ] (x x 0) dx (10) where is a small positive umber. Note that this expressio assumes that µ 00 [x 0 ] 6 0. If the derivatives of secod or larger order of µ [x] also are zero at x 0, the the derivative with the smallest order (other tha 1) that does ot vaish is used i the approximatio. The remaider of the derivatio must be appropriately modified; details are preseted by Friedma. I words, Eq.(10) demostrates that the Fourier itegral of a oscillatig fuctio that icludes a sigle statioary poit i the ifiite domai may be evaluated as the product of some easily evaluated costats ad the fiite itegral of a quadratic-phase expoetial. Sice the area of the quadratic-phase factor also is cocetrated i the viciity of the statioary poit, little additioal error is icurred by substitutig its area over the ifiite domai i Eq.(10). Z " # x0 + exp +iξ µ 00 [x 0 ] (x x 0) Z " Ã!# dx x 0 + exp +iξ µ 00 [x 0 ] (x x 0) dx (11) I short, the fiite itegral is approximated by the total area of the quadratic-phase expoetial, which is easy to evaluate by chagig the itegratio variable to u 1 µ00 [x 0 ](x x 0 ) ad applyig the cetral ordiate theorem from Eq.(9.110). The area of the quadratic-phase term is: Z " Ã!# Ãs! x+ Z exp +iξ µ 00 [x 0 ] (x x 0) π u+ dx exp +iπu du ξµ 00 [x 0 ] x Ãs π ξ µ 00 [x 0 ]! u h exp +i π i This result is substituted ito Eq.(10) to obtai the approximatio for the spectrum that is valid i those cases where the phase of the itegrad of the Fourier trasform is statioary at a sigle coordiate: Ãs! ˆF [ ξ >> 0] π f [x 0 ] ξ µ 00 [x 0 ] h exp +i π i exp [+iξ µ [x 0 ]] (1) (13a)

6 6 This complex amplitude may be expressed as magitude ad phase: s ˆF [ ξ >> 0] π f [x 0 ] ξ 1 µ 00 [x 0 ] o Φ ˆF [ ξ >> 0] +ξ µ[x0 ]+ π (13b) (13c) The approximatio for the more geeral form of the Fourier itegral with a real-valued bipolar modulatio is obtaied by a direct substitutio of the real-valued modulatio r [x] for the oegative magitude f [x] : s f [x] r [x] e iφ{f[x]} ˆF [ ξ >> 0] π r [x 0 ] h+i ξ µ 00 [x 0 ] exp π i exp [+iξ µ [x 0 ]] (1) If there are two (or more) poits of statioary phase i the itegrad, the approximatio is evaluated at each ad the results are summed to obtai the asymptotic solutio. A example of such a case is cosidered i the ext sectio. Obviously, a itegral i the frequecy domai similar to that i Eq.(3) may be costructed for the iverse Fourier trasform, which will allow the asymptotic evaluatio of f [x] from a spectrum with a oscillatig expoetial. Such a developmet will be used i Chapter Examples of Spectra via Statioary Phase Uit-Magitude Liear-Phase Expoetial The formulatio i Eq.(1) will be used to evaluate the asymptotic form of the Fourier itegral for a few phase fuctios. Cosider first the spectrum of the liear-phase expoetial f [x] e +πiξ 0x. The Fourier itegral is: F 1 [ξ] 1[x] e +πiξ 0 x e πiξx dx e πi(ξ ξ 0)x dx (15) which may be recast ito the form of Eq.(5) by chagig the itegratio variable ξ to ζ (ξ ξ 0 ) ad idetifyig the phase fuctio µ [x] to be πx: F 1 [ζ] e +iζ µ[x] dx e +iζ (πx) dx (16)

7 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 7 Thederivativeofthephasefuctioisthepositivecostatµ 0 [x] π, which cofirms the observatio that the itegrad oscillates at the same rate over the etire domai; i other words, there is o poit of statioary phase. Sice the criterio for statioary phase is ot fulfilled, the asymptotic solutio for F [ξ] does ot exist. This result demostrates that the method of statioary phase may be applied oly if the phase of f [x] icludes terms of order or higher Modulated Quadratic-Phase Expoetial Perhaps the most useful applicatio of the method of statioary phase to Fourier aalysis is the determiatio of the asymptotic form of the spectrum of a fuctio f [x] with a quadratic phase scaled by the factor α ad modulated by f [x] : f [x] f [x] e +iπ ( x α) (17) The scale factor α has uits of legth to esure that the expoet is dimesioless. The Fourier itegral may be recast ito the form of Eq.(5): F [ξ] f [x] e +iπ x α dx ξx The phase fuctio ad its derivatives are easy to evaluate: f [x] e +iξ πx α πx ξ dx (18) µ [x] πx α ξ πx (19a) µ x µ 0 [x] π α ξ 1 (19b) µ µ 0 x0 [x 0 ]0π α ξ 1 (19c) x 0 +α ξ (19d) Note that x 0 +a ξ i Eq.(19d) has the required dimesios of legth for a coordiate i the space domai. The phase fuctio ad its derivatives evaluated at this statioary poit are: µ[x 0 ] πα ξ α ξ πα ξ πα ξ (0a) µ 0 [x 0 ]0 (0b) µ 00 [x] π α ξ µ00 [x 0 ] π α ξ (0c) µ () [x 0 ]0for 3 (0d)

8 8 These results are substituted ito the statioary-phase solutio i Eq.(13) to estimate the amplitude of the spectrum at spatial frequecies distat from the origi: s π π ˆF [ ξ >> 0] f [x 0 ] ξ µ 00 [x 0 ] e+i e +iξ µ[x 0 ] f α ξ v u t ³ π e +i π e +iξ ( πα ξ) ξ π α ξ f α ξ α e +i π e iπα ξ α f α ξ e +i π e iπα ξ (1) The validity of this expressio may be cofirmed by by settig the chirp rate α to uity ad f [x] 1to produce a umodulated chirp. The result may be compared to the kow spectrum of the quadratic-phase expoetial i Eq.(9.9): F ª h 1 exp +iπx ˆF [ ξ >> 0] 1 [ξ] exp +i π i exp iπξ F [ξ] () I the case of a uit-magitude quadratic-phase fuctio, the asymptotic ad exact forms of the spectrum are idetical. This is because µ () [x] 0for >3, ad thus o error i the phase fuctio is icurred by trucatig the Taylor series at the secod-order term. A more geeral quadratic-phase fuctio is obtaied by replacig the oegative modulatio f [x] with a real-valued bipolar fuctio m [x] after scalig by b ad traslatig by x 1 : x x1 f 3 [x] m e ±iπ ( α) x (3) b Eq.(1) may be applied directly to evaluate the asymptotic form of the spectrum: ˆF 3 [ ξ >> 0] α ξ x 1 α m b " ξ x1 # α α m b α e ±i π e iπα ξ e +i π e iπα ξ (a) The estimate of the phase trasfer fuctio of the modulated quadratic-phase filter is idetical to that of the umodulated sigal: o µ Φ ˆF 3 [ξ] π α ξ 1 (b) Eq.() has some very iterestig (ad perhaps uexpected) features. Note that the magitude of the spectrum is the same real-valued modulatio m exhibited by the space-domai fuctio, after traslatig ad scalig by the respective factors x 1 ad α

9 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 9 b. Both of these factors have dimesios of reciprocal legth, as appropriate for α fuctios i the frequecy domai. I words, icreasig the width parameter of the modulatio of f 3 [x] icreases the the width parameter of the spectrum estimate ˆF 3 [ξ] by a proportioal factor. Similarly, a traslatio of the modulatio of f 3 [x] produces a proportioal traslatio of the modulatio of ˆF 3 [ξ]. These features of the spectrum may seem to violate the scalig ad shiftig theorems of the Fourier trasform, but i fact are artifacts of the quadratic-phase fuctio that will be discussed i more detail i Chapter 17. Because decreasig the scale factor α of the quadratic phase has the effect of icreasig the oscillatio rate of f 3 [x], this coditio improves the accuracy of statioaryphase solutio at a particular spatial frequecy. The predictio of Eq.() will be tested for the specific caseofascaledad traslated SINC fuctio modulated by a quadratic-phase fuctio with α : x f [x] SINC e +iπ ( x ) (5) which is graphed both as real-ad-imagiary parts ad as magitude-ad-phase i Figure ; ote the bipolar modulatio preset i f [x]. The statioary-phase solutio for the spectrum is obtaied by direct substitutio ito Eq.(): ˆF [ ξ >> 0] ξ 1 SINC e +i π e iπ(ξ) (6) 1 where the scale factor α 1ithe argumet of the SINC fuctio corrects the dimesios of both the traslatio ad scale factor. The spectrum is compared to a discrete calculatio i Figure 3. The differeces betwee the approximatios ad the computed spectra are more apparet i the magified views for 1 ξ cycles per uit legth. Note i the approximate magitude spectrum is zero at ξ 1,whilethe exact computed spectrum is ot Statioary-Phase Approximatio for Symmetric Superchirps We ow briefly cosider asymptotic forms of the spectra of umodulated superchirp fuctios that were itroduced i Eq.(6.13). We defied two flavors of superchirps that differ i behavior for odd values of the order : the itrisically symmetric form cos [π x ]±i si [π x ] ad the Hermitia variety cos [π x ]±isgn[x] si[π x ]. We cosider the symmetric form first. Based upo the symmetry argumets developed i Chapter 9.1, we expect the spectra of these complex-valued ad symmetric fuctios to be complex ad symmetric. The Fourier itegral is: o F 1 e +iπ α x ³e +iπ α x e πiξx dx (7) The phase fuctio ad its first derivative are: µ [x] + π ³ x πx (8) ξ α

10 10 Figure 1.: f [x] SINC h x exp +iπ x i as (a) real part; (b) imagiary part; (c) magitude; (d) phase. This fuctio will be used to demostrate the approximatio of the Fourier trasform via the method of statioary phase.

11 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 11 Figure 1.3: The statioary phase approximatio to the Fourier trasform of f [x] SINC h x exp +iπ i x. The approximatio is ˆF [ξ] SINC ξ + 1 exp iπ (ξ) exp +i π (a) real part; (b) imagiary part; (c) magitude; ad (d) phase. The differeces betwee the approximatio ad the computed spectra are more visible i the magified views for 1 ξ cycles per uit legth.

12 1 µ 0 [x] + π αξ ³ x α 1 π (9) It is coveiet to cosider the cases of eve ad odd values of separately. Whe is eve, the expoet 1 i µ 0 [x] is odd. The poit(s) of statioary phase (if ay) are the solutios to µ 0 [x 0 ]0, which are determied by the spatial frequecy ξ i the Fourier itegral: 1 1 µ αξ x 0 α (30) Note that x 0 has the required uits of legth. The statioary poits of a eveorder symmetric superchirp are the real-valued solutios of Eq.(30), ad thus are proportioal to odd-order roots of the selected spatial frequecy ξ. For example, if, the statioary poits are proportioal to the real-valued solutios of ξ 1 3.For ξ>0, a sigle real-valued solutio for ξ 1 3 x 0 exists ad it is positive. Whe ξ<0, the sigle real-valued solutio for x 0 is egative. Whe is odd, the phase fuctio of the symmetric superchirp may be decomposed ito two fuctios, oe each for positive ad egative x: µ [x 0] + π ³ + x πx (31a) ξ α µ[x 0] + π ³ x πx (31b) ξ α The first derivatives of the phase i these two regios are: µ 0 [x 0] + π ³ αξ + α 1 x π (3a) µ 0 [x 0] + π ³ αξ α 1 x π (3b) Because is odd, 1 is eve. For positive values of x, the statioary poit(s) must satisfy: µ 1 αξ 1 (x 0 ) + +α (33a) Because it is proportioal to a eve-order root of ξ, this expressio is real valued oly for ξ>0. I other words, the statioary-phase estimate of the spectrum of a odd-order superchirp is ozero oly for positive frequecies. Similarly, the statioary poit for egative x must satisfy the coditio: (x 0 ) α µ 1 αξ 1 (33b) The real-valued eve-order root of ξ agai exists oly for ξ>0, ad thus (x 0 ) < 0. I short, the itegrad has a sigle statioary poit if is symmetric. A example isshowifigurefor, α 1uit, ad ξ +cycles per uit legth. The statioary poit is located at x

13 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 13 Figure 1.: Statioary poit of exp [+iπx ] exp [ πix ]: (a) real ad imagiary parts of exp [+iπx ]; (b) real ad imagiary parts of exp [ πi x ]; (c) real part, imagiary part, uit magitude, ad phase of exp [+iπx ] exp [ πi x ], showig the statioary poit at x

14 1 It may be coveiet to recast the itegral i Eq.(7) ito the form of Eq.(5) by chagig variables: where: ³e +iπ x α e πiξx dx x αu e +iv(u u) ³ v π 1 ³ v π 1 αdu (3a) (3b) ξ 1 ³ v 1 1 (3c) α π α The phase fuctio ad its derivatives are easily evaluated i terms of u ad v: µ [u] u u (35a) µ 0 [u] u 1 1 u 0 ( 1) 1 (35b) µ 00 [u] ( 1) u (35c) µ[u 0 ](1 ) ³ ( 1 ) (35d) µ 00 [u 0 ]( 1) ³ ( 1) (35e) Substitutio of these terms ito the statioary-phase solutio of Eq.(13) yields the approximate solutio for the spectrum that is valid for large ν : Ãs! π ˆF [ v >> 0] vµ 00 [u 0 ] e +i π e +iv µ[u 0 ] α µ ³ v 1 π whichmaybewritteithedesiredformbysubstitutigtheformofν from Eq.(3b). The statioary-phase solutio for the spectrum of the umodulated symmetric superchirp fuctio is the complex-valued symmetric fuctio: µ ˆF [ξ] α ( 1) 1 µ α ξ ( ) h exp +i π i à " exp +iπ (1 ) µ α ξ (36) ( 1) #! (37) To check (if ot cofirm) the validity of this expressio, substitute ad compare to the kow spectrum of the quadratic-phase fuctio: o F 1 e +iπ ( α) x ˆF [ξ] α 1 h 1(α ξ ) 0 exp +i π i exp iπ (α ξ ) h α exp +i π i exp iπ (α ξ ) (38) which we kow to be the correct spectrum for all values of ξ from the applicatio of the kow trasform ad the scalig theorem.

15 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 15 It is perhaps istructive to examie the fuctioal forms of the magitude ad phase of the statioary-phase solutio to the superchirp spectrum. The magitude spectrum is the eve fuctio: s ˆF µ α ξ ( [ξ] (39a) α ( 1) ) The fact that the magitude spectrum is costat for cofirms the observatio that chirp fuctios are composed of siusoids with idetical magitudes at all spatial frequecies. However, for >, the magitude of the spectrum is ot costat, but rather decreases with icreasig frequecy. The rate of declie i the magitude spectrum is ξ 0 1, ξ 1, ξ 1 3,ad ξ 3 8 for 5. I words, the magitude falls off more quickly with icreasig order. This behavior is cosistet with the observatio that the superchirp amplitude is approximately costat over larger regios ad that the spatial frequecy chages more quickly with x as the order is icreased. The phase spectrum of the symmetric superchirp is: Ã oo µ! Φ F 1 e +iπ ( α) x 1 α ξ 1 π +(1 ) (39b) which varies as ξ, ξ 3, ξ 3,ad ξ 5 for 5, respectively. I words, the variatio i phase of the spectrum over ξ decreases as the order of the superchirp is icreased. Examples are show i Figure 5. The iitial phase of the statioary-phase approximatio of the spectrum of all superchirps of the form e +iπ x is + π radias, though we kow from the momet calculatio i Eq.(39) that the iitial phase actually is + π radias. This agai remids us that the statioary-phase calculatio is valid for ξ >> Spectra of Hermitia Superchirp Fuctios via Statioary Phase The symmetry argumets of Chapter 9.1 ad the expasio i terms of momets i Eq.(8) demostrate that the spectra of all odd-order Hermitia superchirps are real valued. The approximate forms of these spectra obtaied from the method of statioary phase demostrate the variatios required whe the itegrad has more tha oe statioary poit. We cosider the case for odd for simplicity. The phase fuctio of the Fourier itegral of the Hermitia fuctio is: µ µ [x] + π ³ x πx (0a) ξ α

16 16 Figure 1.5: Magitude ad phase of spectra of symmetric superchirps f [x] exp [+iπ x ] for, 3,, 5 by discrete computatio ad the approximatio by the method of statioary phase from Eq.(39). Note that the magitude falls off more rapidly ad the phase less rapidly with ξ as icreases.

17 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 17 ad its first ad secod derivatives are respectively: µ µ 0 [x] + π ³ x 1 π αξ α µ µ 00 [x] + π ³ x ( 1) α ξ α (0b) (0c) The statioary poit(s) (if ay) are the solutios to µ 0 [x 0 ]0: x 0 α µ 1 αξ 1 (1) Sice is odd for all Hermitia superchirps, the ( 1) is eve. I words, the coordiate of the statioary poit is proportioal to the real-valued eve-order roots of the spatial frequecy ξ where the Fourier itegral is evaluated. Whe ξ is large ad positive (ξ >>0), there are two real-valued solutios for x 0 with idetical magitudes ad opposite sig, i.e., at x 0 ± x 0. The cotributios from the two statioary poits must be added to evaluate the asymptotic form of the Fourier itegral for positive frequecies. The situatio is qualitatively differet for ξ<0. The coordiates of the statioary poits are proportioal to eve-order roots of egative umbers, which have NO realvalued solutios; there are o statioary poits if ξ<0, ad thus the statioary-phase approximatio of the Fourier itegral is zero for all ξ<<0. Examples of the itegrad of the Fourier itegral of the cubic Hermitia superchirp are show i Figure 6. It remais to evaluate the phase fuctio ad its secod derivative at the two statioary poits of the odd-order Hermitia superchirp for ξ>0. These may be iserted separately ito Eq.(13) ad summed to evaluate the approximatio. The positive ad egative statioary poits are labelled x + ad x, respectively: µ αξ 0 <x + +α µ αξ 0 >x α (a) (b) where ξ, α, ad are all real-valued positive quatities. The correspodig phase fuctios are obtaied by substitutio of these derivatives ito Eq.(0a). The phase fuctio evaluated for x + is: Ã π αξ µ [x + ](+1) 1 ξ π µ αξ π µ µ 1 α 1 α 1 1 ξ π ξ 1 1! 1 (3a) Sice ξ is assumed to be large ad is positive, the firsttermmustbelargertha

18 18 Figure 1.6: Statioary poits of the product exp +iπ x exp [ πix], ( 3, 3 α, ξ +1). There are two statioary poits located at x 0 ±q 1 3 h ±6.53: (a) real ad imagiary parts of exp +iπ i x 3 ; (b) real ad imagiary parts of exp [ πix]; (c) real part, imagiary part, magitude, ad phase of the product, showig the two statioary poits. The cotributios from the two statioary poits to the Fourier itegral are complex cojugates, ad so the imagiary parts cacel.

19 1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 19 the secod, which meas that µ[x + ] must be positive. The phase fuctio evaluated at the egative statioary poit is: Ã π αξ µ [x ]( 1) 1 ξ Ã π! Ã π µ µ α 1 α ξ π µ! 1 αξ 1! 1 1 ξ 1 1 µ[x + ] (3b) Note that the factors e +iξµ[x 0] evaluated at these two statioary poits are complex cojugates. The correspodig solutios for the secod derivative are: µ 00 [x + ] π α ξ µ 00 [x ]+ π α ξ ( 1) µ αξ ( 1) µ αξ 1 (a) 1 µ 00 [x + ] (b) which also have the same magitude ad opposite sig; the secod derivative evaluated at the egative statioary poit x is positive, while that at x + is egative. Substitutio of these results ito Eq.(13) yield the asymptotic form of the Fourier itegral: Ã s s! ˆF [ξ >>0] e +i π e iξµ[x π +] ξµ 00 [x + ] + π eiξµ[x ] ξµ 00 [x ] r Ã! π π e iξµ[x ] ξ e+i p µ 00 [x ] + e+iξµ[x ] p +µ 00 [x ] s µ π π e iξµ[x ] e +iξµ[x ] ξµ 00 [x ] e+i s µ π π e iξµ[x ] e +iξµ[x ] ξµ 00 [x ] e+i + +i +1 s µ π e +i π e iξµ[x ] e +iξµ[x ] + ξµ 00 [x ] e +i π e +i π e i π s π ³e i (ξµ[x ]+ π ξµ 00 ) + e +i(ξµ[x ]+ π ) [x ] s π ³ h cos ξµ[x ξµ 00 ]+ π i [x ] (5)

20 0 Figure 1.7: Fourier trasforms of Hermitia superchirp fuctios compared to approximatios from the method of statioary phase: (a) F{exp [+iπx 3 ]}; (b) F{exp [+iπx ]}. After substitutig the expressios for µ ad µ 00 from Eq.(3) ad Eq.(), the asymptotic solutios for the spectra of odd-order Hermitia superchirp are obtaied: F 1 e +iπ ( x α) o for odd αq ( 1) αξ h cos π (1 ) αξ i 1 π if ξ>>0 0 if ξ<<0 (6) I words, the asymptotic spectrum of the odd-order Hermitia superchirp fuctio is real valued ad also is zero for egative frequecies. The computed forms for 3 ad 5are show i Figure 7. The graph of Eq.(5) i Figure 6 shows that the momet expasio of the spectrum for 3has ozero amplitude for small egative frequecies. This behavior is ot modelled by Eq.(6) because it is valid oly for large ξ. Note that the rate of oscillatio of the spectrum with ξ decreases with the order.

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole Page 1 Very Quick Itroductio to MRI The poit of this itroductio is to give the studet a sufficietly accurate metal picture of MRI to help uderstad its impact o image registratio. The two major aspects

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS) Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Spectral leakage and windowing

Spectral leakage and windowing EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD

35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD Noah J. DeMoes, Gabriel T. Ba, Bryce D. Wilkis, Theodore

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

APPLICATION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICAL NEAR-FIELD ANTENNA MEASUREMENTS

APPLICATION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICAL NEAR-FIELD ANTENNA MEASUREMENTS PPLICTION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICL NER-FIELD NTENN MESUREMENTS lle C. Newell*, David Lee** *Nearfield Systems Ic. 133 East 3 rd St., Bldg. 54 Carso, C 9745 **David Florida Laboratory,

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Appendix A. Use of Operators in ARPS

Appendix A. Use of Operators in ARPS A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Characterizing graphs of maximum principal ratio

Characterizing graphs of maximum principal ratio Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Solutions to Midterm Exam

Solutions to Midterm Exam 05-76-0 Solutions to Midterm Exam. For the function: f [x] =sin[πx] RECT [x ] (a) Find expressions for the even and odd parts of f [x] (b) Sketch these even and odd parts. It will first be useful to sketch

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure. SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio

More information

An incremental theory of double edge diffraction

An incremental theory of double edge diffraction RADIO SCIENCE, VOL. 42,, doi:10.1029/2007rs003681, 2007 A icremetal theory of double edge diffractio A. Toccafodi 1 ad R. Tiberio 2 Received 30 April 2007; revised 12 October 2007; accepted 29 October

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY BACHMANN-LANDAU NOTATIONS Lecturer: Dr. Jomar F. Rabajate IMSP, UPLB MATH 174: Numerical Aalysis I 1 st Sem AY 018-019 RANKING OF FUNCTIONS Name Big-Oh Eamples Costat O(1 10 Logarithmic O(log log, log(

More information

Matrix representation of a solution of a combinatorial problem of the group theory

Matrix representation of a solution of a combinatorial problem of the group theory Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,

More information

NAG Library Function Document nag_fft_hermitian (c06ebc)

NAG Library Function Document nag_fft_hermitian (c06ebc) c06 Fourier Trasforms NAG Library Fuctio Documet ag_fft_hermitia () 1 Purpose ag_fft_hermitia () calculates the discrete Fourier trasform of a Hermitia sequece of complex data values. (No extra workspace

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Massachusetts Institute of Technology Lecture : Theory of Parallel Systems Feb. 25, Lecture 6: List contraction, tree contraction, and

Massachusetts Institute of Technology Lecture : Theory of Parallel Systems Feb. 25, Lecture 6: List contraction, tree contraction, and Massachusetts Istitute of Techology Lecture.89: Theory of Parallel Systems Feb. 5, 997 Professor Charles E. Leiserso Scribe: Guag-Ie Cheg Lecture : List cotractio, tree cotractio, ad symmetry breakig Work-eciet

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

It just came to me that I 8.2 GRAPHS AND CONVERGENCE

It just came to me that I 8.2 GRAPHS AND CONVERGENCE 44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot

More information

Algorithm. Counting Sort Analysis of Algorithms

Algorithm. Counting Sort Analysis of Algorithms Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system.

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system. Commo Core Math 3 Notes Uit Day Systems I. Systems of Liear Equatios A system of two liear equatios i two variables is two equatios cosidered together. To solve a system is to fid all the ordered pairs

More information

Test 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4.

Test 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4. Name: Class: Date: ID: A Test Review Short Aswer. Fid the geeral solutio of the differetial equatio below ad check the result by differetiatio. dy du 9 u. Use the error formula to estimate the error i

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

FPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea

FPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset

More information

15 UNSUPERVISED LEARNING

15 UNSUPERVISED LEARNING 15 UNSUPERVISED LEARNING [My father] advised me to sit every few moths i my readig chair for a etire eveig, close my eyes ad try to thik of ew problems to solve. I took his advice very seriously ad have

More information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information