Fundamental Methods of Numerical Extrapolation With Applications
|
|
- Ethelbert Robertson
- 6 years ago
- Views:
Transcription
1 Fundmentl Methods of Extrpoltion 1 Fundmentl Methods of Numericl Extrpoltion With Applictions Eric Hung-Lin Liu ehliu@mit.edu Keywords: numericl nlysis, extrpoltion, richrdson, romberg, numericl differentition, numericl integrtion Abstrct Extrpoltion is n incredibly powerful technique for incresing speed nd ccurcy in vrious numericl tsks in scientific computing. As we will see, extrpoltion cn trnsform even the most mundne of lgorithms (such s the Trpezoid Rule) into n extremely fst nd ccurte lgorithm, incresing the rte of convergence by more thn one order of mgnitude. Within this pper, we will first present some bckground theory to motivte the derivtion of Richrdson nd Romberg Extrpoltion nd provide support for their vlidity nd stbility s numericl techniques. Then we will present exmples from differentition nd integrtion to demonstrte the incredible power of extrpoltion. We will lso give some MATLAB code to show some simple implenttion methods in ddition to discussing error bounds nd differentiting between true nd flse convergence. 1 Introduction In mny prcticl pplictions, we often find ourselves ttempting to compute continuous quntities on discrete mchines of limited precision. In severl clssic pplictions (e.g. numericl differentition), this is ccomplished by tending the step-size to zero. Unfortuntely s we will see, this cretes severe problems with floting point round-off errors. In other situtions such s numericl integrtion, tending the step-size towrd zero does not cuse extreme round-off errors, but it cn be severely limiting in terms of execution time: decrese by fctor of 10 increses the required function evlutions by fctor of 10. Extrpoltion, the topic of this pper, ttempts to rectify these problems by computing weighted verges of reltively poor estimtes to eliminte error modes specificlly, we will be exmining vrious forms of Richrdson Extrpoltion. Richrdson nd Richrdson-like schemes re but subset of ll extrpoltion methods, but they re mong the most common. Moreover they hve numerous pplictions nd re not terribly difficult to understnd nd implement. We will demonstrte tht vrious numericl methods tught in introductory clculus clsses re in fct insufficient, but they cn ll be gretly improved through proper ppliction of extrpoltion techniques.
2 2 Liu 1.1 Bckground: A Few Words on Series Expnsions We re very often ble to ssocite some infinite sequence {A n } with known function A(h). For exmple, A(h) my represent first divided differences scheme for differentition, where h is the step-size. Note tht h my be continuous or discrete. The sequence {A n } is described by: A n = A(h n ), n N for monotoniclly decresing sequence {h n } tht converges to 0 in the limit. Thus lim h 0+ A(h) = A nd similrly, lim n A n = A. Computing A(0) is exctly wht we wnt to do continuing the differentition exmple, roughly speking A(0) is the point where the divided differences becomes the derivtive. Interestingly enough, lthough we require tht A(y) hve n symptotic series expnsion, we re only curious bout its form. Specificlly, we will exmine functions with expnsions tht tke this form: A(h) = A + s α k h p k + O(h p s+1 ) s h 0+ (1) k=1 where p n 0 n, p 1 < p 2 <... < p s + 1, nd ll the α k re independent of y. The p n cn in fct be imginry, in which cse we compre only the rel prts. Clerly, hving p 1 > 0 gurntees the existence of lim h 0+ A(h) = A. In the cse where tht limit does not exist, A is the ntilimit of A(h), nd then we know tht t p i 0 for t lest i = 1. However, s long s the sequence {p n } is monotoniclly incresing such tht lim k p k = +, (1) exists nd A(h) hs the expnsion A(h) A + k=1 α kh p k. We do not need to declre ny conditions on the convergence of the infinite series. We do ssume tht the h k re known, but we do not need to know the α k, since s we will see, these constnt fctors re not significnt. Now suppose tht p 1 > 0 (hence it is true p), then when h is sufficiently smll, A(y) pproximtes A with error A(h) A = O(h p 1 ). It is worth noting tht if p 1 is rther lrge, then A(h) A 0 even for vlues of y tht re not very smll. However in most pplictions, h 1 will be smll (sy p 1 < 4), so it would pper tht we must resort to smller nd smller vlues of h. But s previously noted, this is lmost lwys prohibitive in terms of round-off errors nd/or function evlutions. But we should not despir, becuse we re now stnding on the doorstep of the fundmentl ide behind Richrdson Extrpoltion. Tht ide is to use eqution (1) to somehow eliminte the h p 1 error term, thus obtining new pproximtion A 1 (h) A = O(h h 2 ). It is obvious tht A 1 (h) A < A(h) A since p 2 > p 1. As we will see lter, this is ccomplished by tking weighted verge of A(h) nd A( h). s 2 Simple Numericl Differentition nd Integrtion Schemes Before continuing with our development of the theory of extrpoltion, we will briefly review differentition by first divided differences nd qudrture using the (composite) trpezoid nd midpoint rules. These re mong the simplest lgorithms; they re strightforwrd enough to be presented in first-yer clculus clsses. Being ll first-order pproximtions, their error modes re significnt, nd they hve little ppliction in rel situtions. However s we will see, pplying simple extrpoltion scheme mkes these simple methods extremely powerful, convering difficult problems quickly nd chieving higher ccurcy in the process.
3 Fundmentl Methods of Extrpoltion Differentition vi First Divided Differencs Suppose we hve n rbitrry function f(x) C 1 [x 0 ǫ,x 0 + ǫ] for some ǫ > 0. Then pply simple liner fit to f(x) in the forementioned region to pproximte the f (x). We cn begin by ssuming the existence of dditionl derivtives nd computing Tylor Expnsion: where h = x x 0 nd 0 < h ǫ Resulting in: f(x) = f(x 0 ) + f (x 0 )(x x 0 ) f (x 0 )(x x 0 ) 2 + O(f(h 3 )) f (x 0 ) = f(x + h) f(x) h 1 2 f (x)h + O(h 2 ) f (x 0 ) = f(x 0 + h) f(x 0 ) (2) h From the Tylor Expnsion, it would seem tht our first divided difference pproximtion hs trunction error on the order of O(h). Thus one might imgine tht llowing h 0 will yield O(h) 0 t rte liner in h. Unfortuntely, due the limittions of finite precision rithmetic, performing h 0 cn only decrese trunction error certin mount before rithmetic error becomes dominnt. Thus selecting very smll h is not vible solution, which is sdly misconception of mny Clculus students. Let us exmine exctly how this rithmetic error rises. Note tht becuse of the discrete nture of computers, number is represented s (1 + ǫ 1 ) where ǫ 1 is some error. ( b) = (1 + ǫ 1 ) b(1 + ǫ 2 ) = ( b) + (ǫ 1 bǫ 2 ) + ( b)ǫ 3 = ( b)(1 + ǫ 3 ) + ( + b )ǫ 4 Thus the floting point representtion of the difference numertor, fl[f(x + h) f(x)] is f(x + h) f(x) + 2f(x)ǫ +... where 2f(x)ǫ represents the rithmetic error due to subtrction. So the floting point representtion of the full divided difference is: Agin, 2f(x)ǫ h f (x) = fl[ f(x + h) f(x) ] + 2f(x)ǫ 1 h h 2 f (x)h +... (3) is the rithmetic error, while 1f (x)h is the trunction error from only tking the 2 liner term of the Tylor Expnsion. Since one term cts like 1 nd the other like h, there h exists n optimum choice of h such tht the totl error is minimized: ( )1 f(x) h 2 f (x) ǫ 2 (4) Implying tht h optimum eps where eps is mchine precision, which is roughly in IEEE double precision. Thus our best error is 4(f (x)f(x)ǫ) This is rther disml, nd we certinly cn do better. Nturlly it is impossible to modify rithemtic error: it is property of double precision representtions. So we look to the trunction error: prime suspect for extrpoltion.
4 4 Liu 1 Filure of First Divided Differences log 10 (error) log (dx) 10 Figure 1: Approximtion errors from dex dx x=1 The extent of this problem cn be seen in Fig. 1. It displys the numericl errors resulting from the first divided difference pproximtion of dex dx x=1. The y-xis represents the logrithm of the error, while the x-xis shows the pproximte step size. The log-log scle is convenient for visulizing rough order of mgnitude pproximtions for numericl errors with the dditionl benefit of linerizing functions with polynomil error expressions. This method is commonplce in numericl nlysis. Note tht for prcticl purposes, we should not be pplying first divided differences to estimte derivtives. The previous method is O(h). By using centered divided differences, we cn obtin Oh 2 without ny dditionl work. We initilly voided this becuse the exmple of numericl errors is most severe using first differences. The formul for centered differences pproximtion is: δ 0 (h) = f(x 0 + h) f(x 0 h) for 0 < h (5) 2h The derivtive pproximtion then hs error: δ 0 (h) f (x 0 ) = f (ξ(h)) h 2 = O(h 2 ) (6) 3! Sidi provides the full expnsion, obtined with Tylor series expnsion round x 0 : δ 0 (h) f (x 0 ) = s k=1 f 2k+1 (x 0 ) (2k + 1)! h2k + R s (h) where R s (h) = f(2s+3) (ξ(h)) h 2s+2 = O(h 2s+2 ) (2s + 3)! (7)
5 Fundmentl Methods of Extrpoltion Integrtion vi the Trpezoid nd Midpoint Rules First we should note tht since the integrtion schemes presented re used over rnge of interpoltion points {x j }, the given formuls correspond to the Composite Trpezoid nd Midpoint schemes, lthough we will drop the composite lbel. Composite Trpezoid Rule: ( ) f(x) dx = h n 1 f() + 2 f(x j ) + f(b) + O(h 2 ) (8) 2 For uniformly chosen set of points {x j } in the rnge [,b] such tht x j = + jh nd j = 1/n where n is the totl number of interpoltion points. Observe tht ll the Trpezoid Rule relly does is fit line to the function between ech pir of points in the intervl. The Trpezoid Rule is specil cse (n = 1) of the (n+1)-point closed Newton-Cotes formul. Also, Simpson s Rule is nother specil cse (n = 2) of this formul. The composite rules rise from iterting the Newton-Cotes expressions over rnge of points. The following is dpted from Burden nd Fires: Theorem 1. Suppose tht n i=0 if(x i ) denotes the (n+1)-point closed Newton-Cotes formul with x 0 =, x n = b, nd h = b. Then there exists ξ (,b) such tht n n f(x)dx = i f(x i ) + hn+3 f n+2 (ξ) n n t 2 (t j)dt (n + 2)! i=0 if n is even nd f C n+2 [,b], nd 0 f(x)dx = n i=0 i f(x i ) + hn+2 f n+1 (ξ) (n + 1)! n 0 t n (t j)dt if n is odd nd f C n+1 [,b]. Proof. As implied in the introduction, we re ssuming the vlidity of the following expnsion: where i = xn f(x)dx x 0 L i (x)dx = n i f(x i ) i=0 xn x 0 n j=0 j i x x j x i x j dx with L i being the i-th term of the Lgrnge Interpolting Polynomil. Then we cn exploit the properties of the Lgrnge Interpolting Polynomil long with Tylor Expnsions to rrive t the result. The proof is omitted here, but very detiled explntion cn be found in Isscson nd Keller long with more detils bout the specific error nlysis. An lterntive, more difficult derivtion tht voids the Lgrnge Interpolting Polynomil cn be found in Sidi. There is prllel (n+1)-point open Newton Cotes formul tht does not evlute the endpoints,b, which is useful for voiding endpoint singulrities s in int dx. The Midpoint x Rule is member of this group.
6 6 Liu Theorem 2. Suppose tht n i=0 if(x i ) denotes the (n+1)-point closed Newton-Cotes formul with x 1 =, x n+1 = b, nd h = b. Then there exists ξ (,b) such tht n+2 f(x)dx = n i=0 i f(x i ) + hn+3 f n+2 (ξ) (n + 2)! n+1 1 n t 2 (t j)dt if n is even nd f C n+2 [,b], nd f(x)dx = n i=0 i f(x i ) + hn+2 f n+1 (ξ) (n + 1)! n+1 1 t n (t j)dt if n is odd nd f C n+1 [,b]. Proof. The proof is nlgous to Theorem 1, employing Lgrnge Interpolting Polynomils in the sme fshion. Agin, the full proof cn be found in Isscson nd Keller. For completeness, here is the Composite Midpoint Rule. Agin, the error term hs been simplified becuse the exct coeffcients re not of interest, s we will soon see. Additionlly, notice tht s with the Composite Trpezoid Rule, the error term power is one less thn the one expressed by the Newton-Cotes formuls. This is simply becuse the Composite rule hs summed n copies of the simple Newton-Cotes rules. Composite Midpoint Rule: n 1 f(x) dx = h f( + jh 2 ) + O(h2 ) (9) Now, hving reviewed the bsics of numeric integrtion nd differentition, we will finlly introduce the Richrdson (differentition) nd Romberg (integrtion) Extrpoltion procedures. The reder my find it surprising tht only these most bsic of numeric lgorithms re necessry to procede, but the reson for this will soon become cler. The two methods re in fct essentilly the sme, so we will only derive the Romberg lgorithm. Then we will present numeric results demonstrting the superiority of extrpoltion over the bsic lgorithms. We will lso show tht one cn rrive t Simpson s rule simply by performing extrpoltion on the Trpezoid rule. (Note how we hve voided the most simple schemes of left nd right hnd sums. The resoning is left to the reder.) 3 The Richrdson nd Romberg Extrpoltion Technique 3.1 Conceptul nd Anlytic Approch The fundmentl ide behind these extrpoltion schemes is the usge of multiple, low-ccurcy evlutions to eliminte error modes nd crete highly ccurte result. As mentioned erlier, we re ssuming tht the working functions hve the following property: A(h) A = O(h p 1 ), where p 1 is known or obtinble. To motivte our understnding of extrpoltion, we will write some rbitrry qudrture rule I s function of its ssocited step-size, h: I(h). For exmple, the Trpezoid Rule could be written s:
7 Fundmentl Methods of Extrpoltion 7 ( ) I(h) = h n 1 f() + 2 f(x j ) + f(b) + O(h 2 ) 2 As previously mentioned, suppose the expnsion I(h) = I 0 +h p 1 k 1 +hp 2 k exists, where {p i } R re the set of error powers nd {k i } R re some known or unknown constnts. Now consider: I( h s ) = I 0 + hp 1 k 1 s p 1 + hp 2 k 2 s p To eliminte the h p 1 error term (becuse it is the dominnt error power), we will compute I(h) + s p 1 I( h s ). I (h) = s p 1 I( h s ) I(h) = sp 1 I 0 I O(h p 1 ) + hp 2 k 2 s p 1 p 2 h p 2 k (10) = sp 1 I( h) I(h) s = I s p 0 + sp1 p2 1 h p 2 k 1 1 s p (11) = I 0 + h p 2 k (12) = I( h s ) I(h) I(h) s s p 1 1 (13) And tht is the bsic ide underlying Romberg Extrpoltion. Note tht s is the weight by which we decrese the step-size in ech new evlution of I. s = 2 is very common choice. From (14), we cn continue itertively (or recursively) to elimte O(h p 2 ). Using tht result, we cn eliminte O(h p 3 ), nd continue on indefinitely, in theory. In relity, we re limited by floting point precision. The following tble presents grphicl representtion of the extrpoltion process. Notice tht the left-most column is the only column tht involves ctul function evlutions. The second column represents estimtes of I with the O(h p 1 ) term eliminted using the lgorithm given bove. The third column elmimintes O(h p 2 ) nd so forth. The ctul pproximtions tht should be used for error checking cn be found by reding off the entries on the min digonl of this mtrix. Tble 1: Itertion of Generic Extrpoltion Method I 0 (h) I 0 ( h) s I 1(h) I 0 ( h ) s 2 I 1 ( h) s I 2(h) I 0 ( h ) s 3 I 1 ( h ) s 2 I 2 ( h) s I 3(h) Note: more generlly, we need not decrese h geometriclly by fctors of 1 s, but this pproch is often esiest to visulize, nd it simplifies the lgebr in most pplictions without dmging performnce. Common choices for s re smll integers (e.g. s = 2) becuse lrger integers my cuse the number of function evlutions to grow prohibitively quickly.
8 8 Liu 3.2 A Few Words on Implementtion When implementing Richrdson or Romberg extrpoltion, it is most common to do it itertively, unless storge is n extreme issue. Although the problem cn be solved just s esily using recursion, itertion is generlly preferred. In n itertive method, storge of the full tble/mtrix is not neccessry. Conveniently, it is only necessry to store the lst two rows. Although one should keep t lest short history (1 or 2 entries) from the min digonl for error comprisions. Tht is to sy, when the difference between successive estimtes decreses to some given tolernce (the smllest possible tolernce being mchine-zero), we should terminte the lgorithm becuse we re done. However it is possible the extrpoltion method to stll loclly nd generte two successive entries tht re within tolernce even though the result my be reltively fr from the desired precision. Thus it is common prctice to check errors cross every second or third term to void this problem. The following exmple demonstrtes simple implementtion tht voids storing the full tble using MATLAB. It only checks for termintion in successive terms, nd it ssumes the error powers follow the rithmetic progression 2, 4, 6,.... while log10(bs(diff(i)))>log10(eps) %Only checks error of successive terms h(k)=(b-)/2^k; %step-size for the next row R(2,1)=midpoint(,b,h(end)); %Uses midpoint rule to obtin the first entry for j=2:k %perform extrpoltion steps R(2,j)=R(2,j-1)+(R(2,j-1)-R(1,j-1))/(4^(j-1)-1); end I(k)=R(end); %store ltest result in n rry for m=1:k %copy the second row to the first row R(1,m)=R(2,m); end %the next itertion will overwrite the current second row k=k+1; end If the full mtrix is desired, the for loop would be similr to the following. Here, we llow for rbitrry error powers. %xs re the x-loctions long the xis where the function is evluted %ys re the corresponding y-vlues %p is the rry of error powers n = length(xs); R = zeros(n); %crete the tble R(:,1) = ys; for :n-1, for i=1:(n-j), R(i,j+1)=R(i,j)+(R(i,j)-R(i+1,j))/((xs(i+j)/xs(i))^(p(j)/j)-1); end end
9 Fundmentl Methods of Extrpoltion 9 4 Grphicl Demonstrtion of Results 4.1 Differentition nd Integrtion Revisited To see the power of extrpoltion, we present two illustrtive exmples. First, we return to de x dx x=1. Figure 2 shows the originl plot of the first divided difference pproximtion followed by the un-extrpolted centered difference (red). The two blck lines represent one nd two extrpoltion steps with the single step being nturlly less ccurte. Thus we cn see tht extrpoltion incresed the rte of convergence here by n incredible mount. Not only tht, but it lso hnded us 14 deciml plces of ccurcy, compred to the mere 7 chieved by first differences. Even the single step showed gret improvements over the non-extrpolted centered difference. But unfortuntely, not even extrpoltion cn eliminte the problems of floting point errors. Wht it cn do nd hs done here is eliminte trunction error due to poor initil pproximtion methods. 2 Improvement of Divided Differences from Extrpoltion 0 2 log 10 (error) log (h) 10 Figure 2: First nd Extrpolted Centered Differences for dex dx x=1 Figure 3 displys the LHS, Trpezoid, Midpoint, nd Simpson Rules in their stndrd forms (dotted lines). If it is not cler, LHS is the blck line mrked by sterisks, the midpoint/trpezoid rules virtully lie on top of ech other, nd the pink like mrked by Xs is Simpson s Rule. Once extrpolted (solid lines), Simpson, Midpoint, nd Trpezoid re nerly indistinguishble. (Why does this imply tht we should never strt with Simpson s Rule when extrpolting?) Even the lowly Left Hnd Sum is now performing t decent level. But clerly, the Midpoint or Trpezoid Rule is the best choice here. The deciding fctor between them is typiclly where we wnt the function evlutions to occur (i.e. Midpoint voids the endpoints).
10 10 Liu 0 Comprison of Extrpolted nd Un Extrpolted Integrtion Methods log 10 (error) log (h) 10 Figure 3: LHS, Trpezoid, Midpoint, nd Simpson extrpolted nd Un-Extrpolted 4.2 Finding Error Powers Grphiclly Oftentimes, we find ourselves ttempting to extrpolte expressions where the error powers hve not been nlyticlly pre-derived for our convenience. We hve lredy seen few exmples of this; other situtions include most cnned methods for numericlly solving ODEs. However not ll cses re so nice. For exmple, it is esy to pply extrpoltion to evlute infinite series or sequences, but the error terms re usully not obvious in those cses. Differentition nd integrtion re specil in tht it is reltively esy to nlyticlly show how to form the {p i }. In these situtions, we re left with two options. We cn either ttempt to nlyticlly derive the error terms or we cn use grphicl methods. This is nother sitution where using log-log plots is idel. We begin with: I(h) I( h s ) = (1 s p 1 )h p 1 k 1 + (1 s p2 )h p 2 k = (1 s p 1 )h p 1 k 1 + O(h p 2 ) From here, we would like to determine p 1. We cn do this by first ssuming tht for sufficently 1 smll vlues of h (in prctice, on the order of nd smller is sufficient), we cn mke the 100 pproximtion O(h p 2 ) 0. Now we pply log 10 to both sides; note tht we will now drop the subscript p 1 nd ssume tht log mens log 10. So now we hve: log(i(h) I( h s )) = p log(h) + log(1 s p ) + logk 1 (14) ( At this point, we cn tylor expnd log(1 s p ) = 1 ln(10 s p 1 2 s 2p 1 3 s p +... ). At this point we hve two options. If we believe tht the error powers will be integers or simple frctions (e.g. 1, 1, 1 nd similrly simple ones), then we cn mke the dditionl pproximtion 2 3 4
11 Fundmentl Methods of Extrpoltion 11 log(1 s p ) log(1) = 0. As we will see, this series of pproximtions ctully does not relly hrm our bility to determine p in most situtions. The lterntive is to retin more terms from the expnsion of log(1 s p ) nd solve for p using the differences log(i(h) I( h )). Proceeding s with the first option, we hve: log(i(h) I( h )) = p log(h) + C (15) s Figure 4 begins with the Trpezoid Rule extrpolted once using the known first error term, p 1 = 2. The slope of this (red) line shows the next error power we would need to use in order to continue with the extrpoltion process. Not surprisingly, the plot shows tht p 2 = 4. Tble 2 displys the successive points between step-sizes. As predicted, the slope vlues converged to pproximtely 4 firly quickly. In the first few entries, the choice of s is too smll, nd in the lst few vlues, it begins to diverge from 4 s floting point errors come into ply. But in the center, there is little doubt tht the correct choice is p 2 = 4, if you did not believe the plot. The other lines in figure 4 demonstrte wht hppens s continue setting successive error powers. Here it is cler tht the progression for the trpezoid rule goes in multiples of 2. 5 Conclusion Extrpoltion llows us to chieve greter precision with fewer function evlutions thn unextrpolted methods. In some cses (s we sw with simple difference schemes), extrpoltion is the only wy to improve numeric behvior using the sme lgorithm (i.e. without switching to centered differences or something better). Using sets of poor estimtes with smll stepsizes, we cn esily nd quickly eliminte error modes, reching results tht would be otherwise unobtinble without significntly smller step-sizes nd function evlutions. Thus we turn reltively poor numeric schemes like the Trpezoid Rule into excellent performers. Of course the mteril presented here is certinly not the limit of extrpoltion methods. The Richrdson nd Romberg techniques re prt of fundmentl set of methods using polynomil pproximtions. There exist other methods using rtionl function pproximtions (e.g. Pde, Burlirsch Stoer) long with generliztions of mteril presented here. For exmple, Sidi gives detiled nlysis of extrpolting functions whose expnsions re more complicted thn A(h) = A + s k=1 α kh p k + O(h p s+1 ). The next order of complexity cn solve problems where we cn write A(h) = A+ s k=1 α kφ k (y)+o(φ s+1 (y)) where A(y) nd φ k (y) re ssumed known, while gin the α k re not required. Still, the methods presented here re more thn sufficient for mny pplictions including evluting integrls, derivtives, infinite sums, infinite sequences, function pproximtions t point (e.g. evluting π or γ), nd more. 5.1 From Trpezoid to Simpson nd Beyond On closing note, we will now quickly outline how Romberg extrpoltion cn be used to esily derive Simpson s rule from the Trpezoid rule. More generlly, extrpolting the n = i Closed Newton-Cotes Formul results in the n = i + 1 version. By now, this should not be ll tht surprising. We strt with s = 2 nd p = 2; the choice of p is bsed on the error term from the Closed Newton-Cotes Formul. Alterntively, it could hve been determined grphiclly, s shown erlier.
12 12 Liu 0 Using Slope to Find Error Exponents log 10 (diff(s)) log (h) 10 Figure 4: Trpezoid Rule pplied to exp( x2 ) Tble 2: Slope between step-sizes
13 Fundmentl Methods of Extrpoltion 13 4trp( h 2 ) trp(h) = Simp( h 2 ) ( ) ( ) = h n 1 f() + 2 f(x j ) + f(b) h n 1 f() + 2 f(x j ) + f(b) 3 6 n = h 2 1 n 2 f() + 2 f(x j ) + 4 f(x j ) + f(b) 3 Thus Simpson s Rule is: n Simpson s Rule: f(x) dx = h 2 1 f() + 2 f(x j ) References [1] Burden, R. nd D. Fires, Numericl Anlysis 8TH Ed, Thomson, n 2 f(x j ) + f(b) + O(h 4 ) (16) [2] Isscson, E. nd H. B. Keller. Anlysis of Numericl Methods, John Wiley nd Sons. New York, [3] Press, et. l. Numericl Recipes in C: The Art of Scientific Computing, Cmbridge University Press, [4] Sidi, Avrm, Prcticl Extrpoltion Methods, Cmbridge University Press, [5] Stoer, J. nd R. Burlirsch, Introduction to Numericl Anlysis, Springer-Verlg, [6] Sujit, Kirpekr, Implementtion of the Burlirsch Stoer Extrpoltion Method, U. Berkeley, 2003.
NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationNumerical Analysis. 10th ed. R L Burden, J D Faires, and A M Burden
Numericl Anlysis 10th ed R L Burden, J D Fires, nd A M Burden Bemer Presenttion Slides Prepred by Dr. Annette M. Burden Youngstown Stte University July 9, 2015 Chpter 4.1: Numericl Differentition 1 Three-Point
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
More informationLecture 20: Numerical Integration III
cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed
More informationAPPROXIMATE INTEGRATION
APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationIII. Lecture on Numerical Integration. File faclib/dattab/lecture-notes/numerical-inter03.tex /by EC, 3/14/2008 at 15:11, version 9
III Lecture on Numericl Integrtion File fclib/dttb/lecture-notes/numerical-inter03.tex /by EC, 3/14/008 t 15:11, version 9 1 Sttement of the Numericl Integrtion Problem In this lecture we consider the
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationNumerical Integration. 1 Introduction. 2 Midpoint Rule, Trapezoid Rule, Simpson Rule. AMSC/CMSC 460/466 T. von Petersdorff 1
AMSC/CMSC 46/466 T. von Petersdorff 1 umericl Integrtion 1 Introduction We wnt to pproximte the integrl I := f xdx where we re given, b nd the function f s subroutine. We evlute f t points x 1,...,x n
More informationNUMERICAL INTEGRATION
NUMERICAL INTEGRATION How do we evlute I = f (x) dx By the fundmentl theorem of clculus, if F (x) is n ntiderivtive of f (x), then I = f (x) dx = F (x) b = F (b) F () However, in prctice most integrls
More informationNumerical Integration
Chpter 1 Numericl Integrtion Numericl differentition methods compute pproximtions to the derivtive of function from known vlues of the function. Numericl integrtion uses the sme informtion to compute numericl
More informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationdifferent methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).
Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More information3.4 Numerical integration
3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,
More informationHow can we approximate the area of a region in the plane? What is an interpretation of the area under the graph of a velocity function?
Mth 125 Summry Here re some thoughts I ws hving while considering wht to put on the first midterm. The core of your studying should be the ssigned homework problems: mke sure you relly understnd those
More informationLecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 6: Singulr Integrls, Open Qudrture rules, nd Guss Qudrture (Compiled 6 August 7) In this lecture we discuss the
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More informationChapter 5. Numerical Integration
Chpter 5. Numericl Integrtion These re just summries of the lecture notes, nd few detils re included. Most of wht we include here is to be found in more detil in Anton. 5. Remrk. There re two topics with
More informationLecture Note 4: Numerical differentiation and integration. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 4: Numericl differentition nd integrtion Xioqun Zng Sngi Jio Tong University Lst updted: November, 0 Numericl Anlysis. Numericl differentition.. Introduction Find n pproximtion of f (x 0 ),
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationThe goal of this section is to learn how to use a computer to approximate definite integrals, i.e. expressions of the form. Z b
Lecture notes for Numericl Anlysis Integrtion Topics:. Problem sttement nd motivtion 2. First pproches: Riemnn sums 3. A slightly more dvnced pproch: the Trpezoid rule 4. Tylor series (the most importnt
More informationLecture 23: Interpolatory Quadrature
Lecture 3: Interpoltory Qudrture. Qudrture. The computtion of continuous lest squres pproximtions to f C[, b] required evlutions of the inner product f, φ j = fxφ jx dx, where φ j is polynomil bsis function
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS MATH00030 SEMESTER 208/209 DR. ANTHONY BROWN 7.. Introduction to Integrtion. 7. Integrl Clculus As ws the cse with the chpter on differentil
More informationMAT 772: Numerical Analysis. James V. Lambers
MAT 772: Numericl Anlysis Jmes V. Lmbers August 23, 2016 2 Contents 1 Solution of Equtions by Itertion 7 1.1 Nonliner Equtions....................... 7 1.1.1 Existence nd Uniqueness................ 7 1.1.2
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More information1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),
1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on
More informationChapter 3 Polynomials
Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More informationConvergence of Fourier Series and Fejer s Theorem. Lee Ricketson
Convergence of Fourier Series nd Fejer s Theorem Lee Ricketson My, 006 Abstrct This pper will ddress the Fourier Series of functions with rbitrry period. We will derive forms of the Dirichlet nd Fejer
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationChapter 3 Solving Nonlinear Equations
Chpter 3 Solving Nonliner Equtions 3.1 Introduction The nonliner function of unknown vrible x is in the form of where n could be non-integer. Root is the numericl vlue of x tht stisfies f ( x) 0. Grphiclly,
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationn f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1
The Fundmentl Theorem of Clculus As we continue to study the re problem, let s think bck to wht we know bout computing res of regions enclosed by curves. If we wnt to find the re of the region below the
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationLecture 1: Introduction to integration theory and bounded variation
Lecture 1: Introduction to integrtion theory nd bounded vrition Wht is this course bout? Integrtion theory. The first question you might hve is why there is nything you need to lern bout integrtion. You
More informationLecture 17. Integration: Gauss Quadrature. David Semeraro. University of Illinois at Urbana-Champaign. March 20, 2014
Lecture 17 Integrtion: Guss Qudrture Dvid Semerro University of Illinois t Urbn-Chmpign Mrch 0, 014 Dvid Semerro (NCSA) CS 57 Mrch 0, 014 1 / 9 Tody: Objectives identify the most widely used qudrture method
More informationZ b. f(x)dx. Yet in the above two cases we know what f(x) is. Sometimes, engineers want to calculate an area by computing I, but...
Chpter 7 Numericl Methods 7. Introduction In mny cses the integrl f(x)dx cn be found by finding function F (x) such tht F 0 (x) =f(x), nd using f(x)dx = F (b) F () which is known s the nlyticl (exct) solution.
More informationInterpreting Integrals and the Fundamental Theorem
Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 3 Polynomial Interpolation: Numerical Differentiation and Integration.
Advnced Computtionl Fluid Dynmics AA215A Lecture 3 Polynomil Interpoltion: Numericl Differentition nd Integrtion Antony Jmeson Winter Qurter, 2016, Stnford, CA Lst revised on Jnury 7, 2016 Contents 3 Polynomil
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationTaylor Polynomial Inequalities
Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationEuler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )
Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s
More informationChapter 7 Notes, Stewart 8e. 7.1 Integration by Parts Trigonometric Integrals Evaluating sin m x cos n (x) dx...
Contents 7.1 Integrtion by Prts................................... 2 7.2 Trigonometric Integrls.................................. 8 7.2.1 Evluting sin m x cos n (x)......................... 8 7.2.2 Evluting
More informationChapter 1. Basic Concepts
Socrtes Dilecticl Process: The Þrst step is the seprtion of subject into its elements. After this, by deþning nd discovering more bout its prts, one better comprehends the entire subject Socrtes (469-399)
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationAP Calculus Multiple Choice: BC Edition Solutions
AP Clculus Multiple Choice: BC Edition Solutions J. Slon Mrch 8, 04 ) 0 dx ( x) is A) B) C) D) E) Divergent This function inside the integrl hs verticl symptotes t x =, nd the integrl bounds contin this
More informationNatural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring
More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationLecture 12: Numerical Quadrature
Lecture 12: Numericl Qudrture J.K. Ryn@tudelft.nl WI3097TU Delft Institute of Applied Mthemtics Delft University of Technology 5 December 2012 () Numericl Qudrture 5 December 2012 1 / 46 Outline 1 Review
More informationMath 131. Numerical Integration Larson Section 4.6
Mth. Numericl Integrtion Lrson Section. This section looks t couple of methods for pproimting definite integrls numericlly. The gol is to get good pproimtion of the definite integrl in problems where n
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationChapters 4 & 5 Integrals & Applications
Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions
More informationCOT4501 Spring Homework VII
COT451 Spring 1 Homework VII The ssignment is due in clss on Thursdy, April 19, 1. There re five regulr problems nd one computer problem (using MATLAB). For written problems, you need to show your work
More informationConstruction of Gauss Quadrature Rules
Jim Lmbers MAT 772 Fll Semester 2010-11 Lecture 15 Notes These notes correspond to Sections 10.2 nd 10.3 in the text. Construction of Guss Qudrture Rules Previously, we lerned tht Newton-Cotes qudrture
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More information1 Error Analysis of Simple Rules for Numerical Integration
cs41: introduction to numericl nlysis 11/16/10 Lecture 19: Numericl Integrtion II Instructor: Professor Amos Ron Scries: Mrk Cowlishw, Nthnel Fillmore 1 Error Anlysis of Simple Rules for Numericl Integrtion
More informationAnti-derivatives/Indefinite Integrals of Basic Functions
Anti-derivtives/Indefinite Integrls of Bsic Functions Power Rule: In prticulr, this mens tht x n+ x n n + + C, dx = ln x + C, if n if n = x 0 dx = dx = dx = x + C nd x (lthough you won t use the second
More informationSeries: Elementary, then Taylor & MacLaurin
Lecture 3 Series: Elementry, then Tylor & McLurin This lecture on series strts in strnge plce, by revising rithmetic nd geometric series, nd then proceeding to consider other elementry series. The relevnce
More informationNumerical quadrature based on interpolating functions: A MATLAB implementation
SEMINAR REPORT Numericl qudrture bsed on interpolting functions: A MATLAB implementtion by Venkt Ayylsomyjul A seminr report submitted in prtil fulfillment for the degree of Mster of Science (M.Sc) in
More informationPart IB Numerical Analysis
Prt IB Numericl Anlysis Theorems with proof Bsed on lectures by G. Moore Notes tken by Dexter Chu Lent 2016 These notes re not endorsed by the lecturers, nd I hve modified them (often significntly) fter
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationCALCULUS WITHOUT LIMITS
CALCULUS WITHOUT LIMITS The current stndrd for the clculus curriculum is, in my opinion, filure in mny spects. We try to present it with the modern stndrd of mthemticl rigor nd comprehensiveness but of
More informationf(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all
3 Definite Integrl 3.1 Introduction In school one comes cross the definition of the integrl of rel vlued function defined on closed nd bounded intervl [, b] between the limits nd b, i.e., f(x)dx s the
More informationTHE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS
THE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS CARLOS SUERO, MAURICIO ALMANZAR CONTENTS 1 Introduction 1 2 Proof of Gussin Qudrture 6 3 Iterted 2-Dimensionl Gussin Qudrture 20 4
More informationAn approximation to the arithmetic-geometric mean. G.J.O. Jameson, Math. Gazette 98 (2014), 85 95
An pproximtion to the rithmetic-geometric men G.J.O. Jmeson, Mth. Gzette 98 (4), 85 95 Given positive numbers > b, consider the itertion given by =, b = b nd n+ = ( n + b n ), b n+ = ( n b n ) /. At ech
More informationMath 113 Exam 2 Practice
Mth 3 Exm Prctice Februry 8, 03 Exm will cover 7.4, 7.5, 7.7, 7.8, 8.-3 nd 8.5. Plese note tht integrtion skills lerned in erlier sections will still be needed for the mteril in 7.5, 7.8 nd chpter 8. This
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationLECTURE 19. Numerical Integration. Z b. is generally thought of as representing the area under the graph of fèxè between the points x = a and
LECTURE 9 Numericl Integrtion Recll from Clculus I tht denite integrl is generlly thought of s representing the re under the grph of fèxè between the points x = nd x = b, even though this is ctully only
More informationDiscrete Least-squares Approximations
Discrete Lest-squres Approximtions Given set of dt points (x, y ), (x, y ),, (x m, y m ), norml nd useful prctice in mny pplictions in sttistics, engineering nd other pplied sciences is to construct curve
More informationStuff You Need to Know From Calculus
Stuff You Need to Know From Clculus For the first time in the semester, the stuff we re doing is finlly going to look like clculus (with vector slnt, of course). This mens tht in order to succeed, you
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationMonte Carlo method in solving numerical integration and differential equation
Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The
More information31.2. Numerical Integration. Introduction. Prerequisites. Learning Outcomes
Numericl Integrtion 3. Introduction In this Section we will present some methods tht cn be used to pproximte integrls. Attention will be pid to how we ensure tht such pproximtions cn be gurnteed to be
More information(0.0)(0.1)+(0.3)(0.1)+(0.6)(0.1)+ +(2.7)(0.1) = 1.35
7 Integrtion º½ ÌÛÓ Ü ÑÔÐ Up to now we hve been concerned with extrcting informtion bout how function chnges from the function itself. Given knowledge bout n object s position, for exmple, we wnt to know
More information