An approximation to the arithmetic-geometric mean. G.J.O. Jameson, Math. Gazette 98 (2014), 85 95
|
|
- Clarence McDowell
- 5 years ago
- Views:
Transcription
1 An pproximtion to the rithmetic-geometric men G.J.O. Jmeson, Mth. Gzette 98 (4), Given positive numbers > b, consider the itertion given by =, b = b nd n+ = ( n + b n ), b n+ = ( n b n ) /. At ech stge, the two new numbers re the rithmetic nd geometric mens of the previous two. It is esily seen tht b n < n, ( n ) is decresing, (b n ) is incresing nd n+ b n+ < ( n b n ), nd hence tht ( n ) nd (b n ) converge to common limit, which is clled the rithmetic-geometric men of nd b. We will denote it by M(, b). Furthermore, the convergence is qudrtic, hence very rpid. We illustrte this by the clcultion of M(, ): n b n n Of course, 5 nd b 5 re not ctully equl, but more deciml plces would be required to show the difference; in fct, 5 b 5 < 9. A fmous result of Guss, dting from 799, reltes M(, b) to the integrl I(, b) = π/ dx = (x + ) / (x + b ) / ( cos θ + b sin dθ. () θ) / The equivlence of the two integrls is seen by substituting x = b tn θ. Guss s theorem sttes tht I(, b) = π M(, b). () This result hs been discussed in number of Gzette rticles, e.g. [], [], [3]. The min step of the proof is to show, in the bove nottion, tht I(, b ) = I(, b). It then follows tht I(, b) = I( n, b n ) for ll n. By the first integrl in (), I( n, b n ) > dx = x + n π n, nd similrly I( n, b n ) < π/(b n ); () now follows. One wy to prove tht I(, b ) =
2 I(, b) is by the substitution x = t b/t. This ingenious substitution seems to hve been introduced by D.J. Newmn in [4]; more ccessible ccounts of it cn be seen in [] nd [5]. In [3], Nick Lord presents n interesting new method bsed on the re in polr coordintes. Depending on one s strting point, Guss s theorem cn be regrded either s the evlution of the integrl I(, b) (including quick wy to clculte it in specific cses), or s closed expression for M(, b). Clerly, M(c, cb) = cm(, b) nd I(c, cb) = I(, b) for c >, so it is enough to stte c results in terms of M(, ) nd I(, ). The topic of this rticle is the fct tht there re plesntly simple formule giving good pproximtions to I nd M, s follows: for lrge nd smll (positive) b, I(, ) log 4, I(, b) log 4 b, M(, ) F (), where F () = π log 4. The first two sttements re equivlent becuse I(, ) = I(, ), nd the sttement for M(, ) follows by Guss s theorem. The pproximtion is strikingly ccurte for modertely lrge : for exmple, F () = 6.7 to four d.p.: compre the vlue for M(, ) found bove. These pproximtions hve been known for long time: for exmple, version ppers in [6, p. 5], published in 97. A vriety of methods hve been used, with differing estimtes of the ccurcy of the pproximtion. A very effective method ws presented by Newmn in [5]. However, it is sketched rther briefly there, nd the sttement is given only in the form I(, ) = log 4 + O(/ ). Here we develop Newmn s method in more detil to estblish the following more specific estimtion (which is rther more precise thn ny version I hve seen in the existing literture): THEOREM. For < b nd, we hve log 4 b < I(, b) < ( + 4 b ) log 4 b, (3) log 4 < I(, ) < Moreover, the following lower bounds lso pply: ( + ) log 4. (4) 4 I(, b) > ( + 4 b ) log 4 b 7 6 b, (5)
3 ( I(, ) > + ) log (6) The pirs of sttements re equivlent, becuse of the identity I(, ) = I(, ). Sttements (5) nd (6) my look rther technicl, but we include them becuse they emerge from the sme process of resoning, nd becuse, together with (3) nd (4), they show tht ( I(, ) = + ) log 4 + O(/ ), 4 nd similr sttement for b (so in fct the estimtion log 4 + O(/ ) in [5] is not quite correct). At the sme time, we hve gined the plesntly simple inequlity I(, ) > log 4. By Guss s theorem nd the inequlity /( + x) > x, pplied with x = /(4 ), sttement (4) trnsltes into the following pir of inequlities for M(, ): COROLLARY. Let F () be s bove. For, ( ) F () < M(, ) < F (). (7) 4 This grees well with the ccurcy seen bove for =. Since M(, b) = b M(/b, ) we cn derive the following bounds for M(, b) (where > b) in generl: ) π ( b < M(, b) < π log(4/b) 4 log(4/b). (8) The proofs cn be set out in terms of either or b: we shll use b. The method requires nothing more thn some elementry integrls nd the binomil nd logrithmic series. We will lso see tht weker version of Theorem cn be estblished very quickly. At this point, we mke two preliminry observtions bout I(, b). inequlity of the mens, we hve (x + ) / (x + b ) / (x + ) + (x + b ), Firstly, by the so tht I(, b) π 4 ( + ). (9) b Secondly, I(, b) equtes to stndrd elliptic integrl in the following wy. Let b = ( b ) /, so tht b + b =. Then cos θ + b sin θ = b sin θ, so tht I(, b) = π/ ( b sin dθ. θ) / 3
4 In the lnguge of elliptic integrls, this is complete elliptic integrl of the first kind, denoted by K(b ). However, we do not ssume ny prior knowledge of elliptic intgrls. We now embrk on the proof. Tking =, write H(x) =. () (x + ) / (x + b ) / The strting point is the observtion tht the substitution x = b/y gives so tht b / H(x) dx = b / H(y) dy, b / I(, b) = H(x) dx. () Now ( + y) / > y for < y <, s is esily seen by multiplying out ( + y)( y), so for < x <, ( x ) (x + b ) < H(x) <. () / (x + b ) / Now observe tht the substitution x = by gives b / /b / dx = (x + b ) / (y + ) dy = / sinh b. / LEMMA. We hve log b < / sinh < log b/ b + b. (3) / 4 Proof. Recll tht sinh x = log[x + (x + ) / ], which is clerly greter thn log x. Also, since ( + b) / < + b, ( ) / b + / b + = b [ + ( + / b)/ ] < b ( + b) = / b ( + b). / 4 The right-hnd inequlity in (3) now follows from the fct tht log( + x) x. This is lredy enough to prove the following interim version of Theorem : THEOREM A. For < b nd, log 4 b b < I(, b) < log 4 b + b, (4) log 4 < I(, ) < log 4 +. (5) 4
5 where Proof. The two sttements re equivlent, since I(, ) = I(, ). By () nd (), Since (x + b ) / > x, we hve sinh b / R (b) < I(, b) < sinh b /, R (b) = b / x dx. (6) (x + b ) / R (b) < b / x b / x dx = x dx = b. Both inequlities in (4) now follow from (3), since log b / = log 4 b. Theorem A is sufficient to show tht M(, ) F () s. To see this, write I(, ) = log 4 + r(). Then I(, ) which tends to s, since r(). log 4 = r() log 4[log 4 + r()], Some reders my be content with Theorem A, but for those with the ppetite for it, we now refine the method to estblish the full strength of Theorem. All we need to do is improve our estimtions by the insertion of further terms. The upper estimte in () only used ( + y) / <. Insted, we now use the stronger bound ( + y) / < y y for < y <. These re the first three terms of the binomil expnsion, nd the stted inequlity holds becuse the terms of the expnsion lternte in sign nd decrese in mgnitude. So we hve insted of (): ( x ) (x + b ) < H(x) < ( / x x4 ). (7) (x + b ) / We lso need further degree of ccurcy in the estimtes for sinh b / LEMMA. For < b, we hve log b + b 3 / 4 3 b < sinh < log b/ b + b / 4 Proof. Agin by the binomil series, we hve 6 b + nd R (b). 3 b3. (8) + b 8 b < ( + b) / < + b 8 b + 6 b3. (9) 5
6 So, s in Lemm, ( ) / b + / b + < b ( + b / 8 b + 6 b3 ) = b ( + b / 4 6 b + 3 b3 ). The right-hnd inequlity in (8) now follows from log( + x) x. Also, ( ) / b + / b + > b ( + b / 8 b ) = ( + B), b/ where B = 4 b 6 b (so B < 4 b). By the log series, log( + x) > x x for < x <, so log( + B) > B B > 4 b 6 b 3 b = 4 b 3 3 b. LEMMA 3. For < b, we hve: R (b) < b + 4 b b log, () b/ R (b) > b + 4 b b log b / 3 6 b3, () R (b) < b 5 b. () Proof: We cn evlute R (b) explicitly by the substitution x = b sinh t in (6): R (b) = c(b) c(b) b sinh t dt = b (cosh t ) dt = 4 b sinh c(b) b c(b), where c(b) = sinh (/b / ). Now so sinh c(b) = sinh c(b) cosh c(b) = ( ) / b / b + = b ( + b)/, R (b) = b( + b)/ b c(b). Sttement () now follows from ( + b) / < + b nd c(b) > log. Sttement () b / follows from the left-hnd inequlity in (9) nd the right-hnd one in (3). Unfortuntely, () does not quite follow from (). We prove it directly from the integrl, s follows. Write x /(x + b ) / = g(x). Since g(x) < x, we hve b / g(x) dx < b (b b ). For < x < b, we hve by the binomil expnsion gin ) x x g(x) = ( x b( + x /b ) / b b + 3x4, 8b 4 nd hence b g(x) dx < ( )b < 3 b. 6
7 Together, these estimtes give R (b) < b 5 b. Completion of the proof of Theorem : lower bounds. By (7), (8) nd (), I(, b) > sinh b / R (b) > log 4 b + b 3 6 b ( b 5 b ) > log 4 b, (with spre term 8 b ). Of course, the key fct is the cncelltion of the term b. Also, using () insted of (), we hve I(, b) > log 4 b + b 3 6 b ( b + 4 b 4 b log 4 b ) = ( + 4 b ) log 4 b 7 6 b. where Upper bound: By (7), So by (8) nd (), R (b) = I(, b) < sinh b / R (b) R (b), b / x 4 b / dx < x 3 dx = (x + b ) / 4 b. I(, b) < log 4 b + b 8 b + 6 b3 ( b + 4 b 4 b log 4 b 3 6 b3 ) b = ( + 4 b ) log 4 b 3 6 b + 4 b3. If b < 3 4, then 3 6 b 4 b3, so I(, b) < ( + 4 b ) log 4 b. For b 3 4, we reson s follows. By (9), I(, b) π 4 (+ b ). Write h(b) = (+ 4 b ) log 4 b π ( + ). We find tht h( 3 ) >. One verifies by differentition tht h(b) 4 b 4 is incresing for < b (we omit the detils), hence h(b) > for 3 b. 4 Note: We mention very briefly n older, perhps better known, pproch (cf. [7, p. ]). Use the identity I(, b) = K(b ), nd note tht b when b. Define A(b ) = π/ b sin θ ( b sin dθ θ) / nd B(b ) = K(b ) A(b ). One shows by direct integrtion tht A(b ) = log[(+b )/b] nd B() = log, so tht when b, we hve A(b ) log b nd hence K(b ) log 4 b. 7
8 This method cn be developed to give n estimtion with error term of the form O(b log b ), [8, p ]. The uthor hs refined it little further, but the detils re distinctly more lborious thn the method we hve given here, nd the end result still does not chieve the ccurcy of our Theorem. Appliction to the clcultion of logrithms nd π. In my view, Theorem is interesting enough in its own right. However, it lso hs plesing pplictions to the clcultion of logrithms (ssuming π known) nd π (ssuming logrithms known), exploiting the rpid convergence of the gm itertion. Consider first the problem of clculting log x (where x > ). Choose n, in wy to be discussed below, nd let 4 = x n, so tht n log x = log 4, which is pproximted by I(, ). We clculte M = M(, ), nd hence I(, ) = π/(m). Then log x is pproximted by (/n)i(, ). How ccurte is this pproximtion? By Theorem, log 4 = I(, ) r(), where < r() < 4 log 4. Hence in which log x = r() I(, ) n n, < r() n < log x 4 = 4 log x x n. We choose n so tht this is within the desired degree of ccurcy. It might seem nomlous tht log x, which we re trying to clculte, ppers in this error estimtion, but rough estimte for it is lwys redily vilble. For illustrtion, we pply this to the clcultion of log, tking n =, so tht = = 4. We find tht M = M(4, ) , so our pproximtion is π 4 M , while in fct log = to seven d.p. The discussion bove (just tking log < ) shows tht the pproximtion overestimtes log, with error no more thn 4/ 4 = / < / 6. A vrition (cf. [9, p. ]) is s follows: choose lrge (e.g. = n for suitble n). Then I(, ) log 4 nd xi(x, ) log 4x, so log x xi(x, ) I(, ). Clerly, this method requires two gm itertions. The error is r() r(x), nd we hve gin < r() < r (), where r () = log 4. Now log y/y is decresing for y > e /, so 4 r (x) < r (), hence the mgnitude of the error is no more thn r () itself; this cn be compred with the error 4 log x in the previous method. We now turn to the question of pproximting π. The simple-minded method is s 8
9 follows. Choose suitbly lrge. By Guss s theorem nd Theorem, where π = M(, )I(, ) = M(, )log 4 + s(), s() = M(, ) r() 4 < M(, )log 4. 3 So n pproximtion to π is M(, ) log 4, with error no more thn s(). Using our originl exmple with =, this gives to five d.p., with the error estimted s no more thn 8 5 (the ctul error is bout ). For better pproximtion, one would repet with lrger. However, there is wy to generte sequence of incresingly close pproximtions from single gm itertion, which we now describe (cf. [8, Proposition 3]). In the originl gm itertion, let c n = ( n b n) /. Note tht c n converges rpidly to. By Guss s theorem, π = M(, c )I(, c ). To pply Theorem, we need to equte I(, c ) to n expression of the form I(d n, e n ), where e n /d n tends to. This is chieved s follows. We hve so c n+ = ( n b n ), nd hence c n+ = n+ b n+ = 4 ( n + b n ) n b n = 4 ( n b n ), n = n+ + c n+, b n = n+ c n+ (this shows how to derive n nd b n from n+ nd b n+, reversing the gm itertion). Hence c n = n b n = 4 n+ c n+, so the rithmetic men of n+ nd c n+ is n, while the geometric men is c n. Therefore I( n, c n ) = I( n+, c n+ ), nd hence I(, c ) = I( n n, n c n ) = ( I, c ) n. n n n Since c n / n tends to, Theorem (or even Theorem A) pplies to show tht I(, c ) = lim log 4 n. n n n c n Now tke = nd b =. Then c = b, so M(, b ) = M(, c ), nd ( n ) converges to this vlue. Since π = M(, c )I(, c ), we hve estblished the following: THEOREM. With n, b n, c n defined in this wy, we hve π = lim n log 4 n. (3) n c n 9
10 Denote this pproximtion by p n. With enough determintion, one could derive n error estimtion, but we will just illustrte the speed of convergence by performing the first three steps. Vlues re rounded to six significnt figures. To clculte c n, we use c n = c n /(4 n ) rther thn ( n b n ), since this would require much greter ccurcy in the vlues of n nd b n. n n b n c n p n More ccurte clcultion gives the vlue p 3 = , showing tht it ctully grees with π to eight deciml plces. While this itertion does indeed converge rpidly to π, it hs the disdvntge tht logrithms must be clculted, or ssumed known. This is overcome by the Guss-Brent- Slmin lgorithm, which lso uses the gm itertion, but depends on identities involving integrls of the kind π/ sin θ ( cos θ + b sin dθ θ) / insted of Theorem. A user-friendly ccount of this lgorithm, with cre tken to use the most elementry methods vilble, is given in []. Series expressions for I(, b). Recll tht K(b) = π/ ( b sin θ) / dθ nd I(, b) = K(b ). By integrting the binomil expnsion, one finds tht K(b) = π n= d nb n for < b <, where d = nd d n =.3... (n ).4... (n). By more elborte methods, identifying nd solving second-order differentil eqution stisfied by I(, b), one cn estblish the following identity [9, p. 9]: I(, b) = K(b ) = π K(b) log 4 b d n e n b n, (4) where e n = n r= ( ). Together with the stted series for K(b), this gives r r I(, b) = log 4 b + d n (log 4 ) b e n b n. (5) n= Let us compre the informtion delivered by these series with our Theorem. Write I(, b) = log 4 + r b (b). The first term of the series in (5) is 4 b (log 4 ), so we cn stte b ( r (b) = 4 b log 4 ) ( b + O b 4 log ), (6) b n=
11 which is little more ccurte thn our estimte. For the gm, this trnsltes into M(, ) = F () F () log 4 + O(/ 3 ) s, 4 log 4 An ctul lower bound cn be derived s follows. We hve e n < log for ll n, since (e n ) is incresing with limit log. Hence log 4 b e n >, so from (5), r (b) > 4 b ( log 4 b ), (7) which is slightly stronger thn (5). However, some quite delicte clcultions re needed to recpture our upper bound in (3). Acknowledgement: I m grteful to Nick Lord for his constnt interest nd dvice while this rticle evolved through severl preliminry versions, nd to Mike Hirschhorn for some useful suggestions. References. Nick Lord, Recent clcultions of π: the Guss-Slmin lgorithm, Mth. Gz. 76 (99), Robert M. Young, On the re enclosed by the curve x 4 + y 4 =, Mth. Gz. 93 (9), Nick Lord, Evluting integrls using polr res, Mth. Gz. 96 (), D.J. Newmn, Rtionl pproximtion versus fst computer methods, in Lectures on pproximtion nd vlue distribution, pp , Sém. Mth. Sup. 79 (Presses Univ. Montrél, 98). 5. D.J. Newmn, A simplified version of the fst lgorithm of Brent nd Slmin, Mth. Comp. 44 (985), 7, reprinted in Pi: A Source Book (Springer, 999), E.T. Whittker nd G.N. Wtson, A Course of Modern Anlysis (Cmbridge Univ. Press, 97). 7. F. Bowmn, Introduction to Elliptic Functions, (Dover Publictions, 96). 8. J.M. Borwein nd P.B. Borwein, The rithmetic-geometric men nd fst computtion of elementry functions, SIAM Review 6 (984), , reprinted in Pi: A Source Book (Springer, 999), J.M. Borwein nd P.B. Borwein, Pi nd the AGM, (Wiley, 987). G.J.O. JAMESON Dept. of Mthemtics nd Sttistics, Lncster University, Lncster LA 4YF emil: g.jmeson@lncster.c.uk
Euler, 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 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 informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
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 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 informationFurther integration. x n nx n 1 sinh x cosh x log x 1/x cosh x sinh x e x e x tan x sec 2 x sin x cos x tan 1 x 1/(1 + x 2 ) cos x sin x
Further integrtion Stndrd derivtives nd integrls The following cn be thought of s list of derivtives or eqully (red bckwrds) s list of integrls. Mke sure you know them! There ren t very mny. f(x) f (x)
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 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 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 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 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 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 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 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 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 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 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 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 informationIntegral points on the rational curve
Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box
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 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 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 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 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 informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
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 informationAN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir
RGMIA Reserch Report Collection, Vol., No., 999 http://sci.vu.edu.u/ rgmi AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS I. Fedotov nd S. S. Drgomir Astrct. An
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
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 information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationChapter 6 Notes, Larson/Hostetler 3e
Contents 6. Antiderivtives nd the Rules of Integrtion.......................... 6. Are nd the Definite Integrl.................................. 6.. Are............................................ 6. Reimnn
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 informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
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 informationSummary: Method of Separation of Variables
Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section
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 informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
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 informationLecture 3 Gaussian Probability Distribution
Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil
More informationVyacheslav Telnin. Search for New Numbers.
Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which
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 informationSection 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40
Mth B Prof. Audrey Terrs HW # Solutions by Alex Eustis Due Tuesdy, Oct. 9 Section 5. #7,, 6,, 5; Section 5. #8, 9, 5,, 7, 3; Section 5.3 #4, 6, 9, 3, 6, 8, 3; Section 5.4 #7, 8,, 3, 5, 9, 4 5..7 Since
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
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 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 informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
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 informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 014 Mrk Scheme: Ech prt of Question 1 is worth four mrks which re wrded solely for the correct nswer.
More information6.2 CONCEPTS FOR ADVANCED MATHEMATICS, C2 (4752) AS
6. CONCEPTS FOR ADVANCED MATHEMATICS, C (475) AS Objectives To introduce students to number of topics which re fundmentl to the dvnced study of mthemtics. Assessment Emintion (7 mrks) 1 hour 30 minutes.
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 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 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 informationSOME INTEGRAL INEQUALITIES OF GRÜSS TYPE
RGMIA Reserch Report Collection, Vol., No., 998 http://sci.vut.edu.u/ rgmi SOME INTEGRAL INEQUALITIES OF GRÜSS TYPE S.S. DRAGOMIR Astrct. Some clssicl nd new integrl inequlities of Grüss type re presented.
More informationSYDE 112, LECTURES 3 & 4: The Fundamental Theorem of Calculus
SYDE 112, LECTURES & 4: The Fundmentl Theorem of Clculus So fr we hve introduced two new concepts in this course: ntidifferentition nd Riemnn sums. It turns out tht these quntities re relted, but it is
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 informationNUMERICAL 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 informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationFig. 1. Open-Loop and Closed-Loop Systems with Plant Variations
ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses
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 informationDisclaimer: This Final Exam Study Guide is meant to help you start studying. It is not necessarily a complete list of everything you need to know.
Disclimer: This is ment to help you strt studying. It is not necessrily complete list of everything you need to know. The MTH 33 finl exm minly consists of stndrd response questions where students must
More informationCalculus. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Clculus Min Yn Deprtment of Mthemtics Hong Kong University of Science nd Technology My, 7 Contents Limit 7 Limit of Sequence 7 Arithmetic Rule 9 Sndwich Rule 3 Some Bsic Limits 5 4 Order Rule 9 5 Subsequence
More informationDefinition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim
Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)
More informationCzechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction
Czechoslovk Mthemticl Journl, 55 (130) (2005), 933 940 ESTIMATES OF THE REMAINDER IN TAYLOR S THEOREM USING THE HENSTOCK-KURZWEIL INTEGRAL, Abbotsford (Received Jnury 22, 2003) Abstrct. When rel-vlued
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 information( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that
Arc Length of Curves in Three Dimensionl Spce If the vector function r(t) f(t) i + g(t) j + h(t) k trces out the curve C s t vries, we cn mesure distnces long C using formul nerly identicl to one tht we
More informationSection 4.8. D v(t j 1 ) t. (4.8.1) j=1
Difference Equtions to Differentil Equtions Section.8 Distnce, Position, nd the Length of Curves Although we motivted the definition of the definite integrl with the notion of re, there re mny pplictions
More informationHOMEWORK SOLUTIONS MATH 1910 Sections 7.9, 8.1 Fall 2016
HOMEWORK SOLUTIONS MATH 9 Sections 7.9, 8. Fll 6 Problem 7.9.33 Show tht for ny constnts M,, nd, the function yt) = )) t ) M + tnh stisfies the logistic eqution: y SOLUTION. Let Then nd Finlly, y = y M
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 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 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 information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationPolynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230
Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationIndefinite Integral. Chapter Integration - reverse of differentiation
Chpter Indefinite Integrl Most of the mthemticl opertions hve inverse opertions. The inverse opertion of differentition is clled integrtion. For exmple, describing process t the given moment knowing the
More informationApplicable Analysis and Discrete Mathematics available online at
Applicble Anlysis nd Discrete Mthemtics vilble online t http://pefmth.etf.rs Appl. Anl. Discrete Mth. 4 (2010), 23 31. doi:10.2298/aadm100201012k NUMERICAL ANALYSIS MEETS NUMBER THEORY: USING ROOTFINDING
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 informationarxiv:math/ v2 [math.ho] 16 Dec 2003
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
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 informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
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 information12 TRANSFORMING BIVARIATE DENSITY FUNCTIONS
1 TRANSFORMING BIVARIATE DENSITY FUNCTIONS Hving seen how to trnsform the probbility density functions ssocited with single rndom vrible, the next logicl step is to see how to trnsform bivrite probbility
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
More informationSuppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.
Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot
More informationMath 554 Integration
Mth 554 Integrtion Hndout #9 4/12/96 Defn. A collection of n + 1 distinct points of the intervl [, b] P := {x 0 = < x 1 < < x i 1 < x i < < b =: x n } is clled prtition of the intervl. In this cse, we
More informationn=0 ( 1)n /(n + 1) converges, but not n=100 1/n2, is at most 1/100.
Mth 07H Topics since the second exm Note: The finl exm will cover everything from the first two topics sheets, s well. Absolute convergence nd lternting series A series n converges bsolutely if n converges.
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
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 informationSections 5.2: The Definite Integral
Sections 5.2: The Definite Integrl In this section we shll formlize the ides from the lst section to functions in generl. We strt with forml definition.. The Definite Integrl Definition.. Suppose f(x)
More informationSelf-similarity and symmetries of Pascal s triangles and simplices mod p
Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,
More informationHomework 4. (1) If f R[a, b], show that f 3 R[a, b]. If f + (x) = max{f(x), 0}, is f + R[a, b]? Justify your answer.
Homework 4 (1) If f R[, b], show tht f 3 R[, b]. If f + (x) = mx{f(x), 0}, is f + R[, b]? Justify your nswer. (2) Let f be continuous function on [, b] tht is strictly positive except finitely mny points
More informationINTRODUCTION TO INTEGRATION
INTRODUCTION TO INTEGRATION 5.1 Ares nd Distnces Assume f(x) 0 on the intervl [, b]. Let A be the re under the grph of f(x). b We will obtin n pproximtion of A in the following three steps. STEP 1: Divide
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 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 informationIntegration Techniques
Integrtion Techniques. Integrtion of Trigonometric Functions Exmple. Evlute cos x. Recll tht cos x = cos x. Hence, cos x Exmple. Evlute = ( + cos x) = (x + sin x) + C = x + 4 sin x + C. cos 3 x. Let u
More information14.4. Lengths of curves and surfaces of revolution. Introduction. Prerequisites. Learning Outcomes
Lengths of curves nd surfces of revolution 4.4 Introduction Integrtion cn be used to find the length of curve nd the re of the surfce generted when curve is rotted round n xis. In this section we stte
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
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 information