THE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS

Save this PDF as:

Size: px
Start display at page:

Transcription

1 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 References 22 5 Experiments using Gussin Qudrture Rule on [, b] ppendix-1 6 Experiments using Gussin Qudrture Rule with non-stndrd Mesures ppendix-2 7 Experiments compring Gussin Qudrture, the Trpezoid Rule, And Simpson s Rule ppendix-3 8 Experiments using Gussin Qudrture Rule On Disjoint Intervls ppendix-4 9 Experiments using Iterted Gussin Qudrture Over A Rectngle [, b] [c, d] ppendix-5 1 Introduction The Fundmentl Theorem of Clculus llows one to compute the definite integrl of function over n intervl [, b] by using nti-derivtives Once the ntiderivtive of the function is found, then it is evluted t the end points of the intervl For exmple, suppose we hve continuous function f(x) on[, b] If F (x) isnntiderivtive of f(x), ie F (x) =f(x) for ll x in [, b], then f(x)dx = F (b) F () 0 This project ws crried out during the Spring, 2008 nd Summer I, 2008 semesters with Professor Lwrence A Filkow s the mentor During Spring, 2008 the project ws sponsored by SUNY/NSF Allince for Minority Prticiption t SUNY New Pltz The New Pltz AMP Director is Professor Stcie Nunes from the Deprtment of Physics During Summer I, 2008 the project ws sponsored under Ntionl Science Foundtion Grnt (number) The uthors thnk the sponsors for their support 1

2 For mny functions f(x) we re not ble to compute n nti-derivtive in closed form, so we cn t use the Fundmentl Theorem of Clculus For exmple f(x) =e x2 does not hve n nti-derivtive in closed form Insted, we will use numericl methods to estimte f(x)dx Gussin Qudrture is one such method The purpose of our reserch is to find wy of estimting complicted definite integrls using the Gussin Qudrture rule There re other numericl integrtion methods s well, like Simpson s rule nd the Trpezoid rule In some of the experiments, we will compre the efficiency of Gussin Qudrture to the efficiencies of Simpson s Rule nd the Trpezoid Rule The ide behind Gussin Qudrture is tht given n integer M =2n +1 > 0, we cn find points x 1 x n in [, b], nd positive weights w 1 w n,sotht (11) p(x)dx = p w i p(x i ) i=1 for every polynomil p(x) with deg p M Then, for ny continuous function f(x) on the intervl [, b], we cn pproximte the integrl f(x)dx by the Gussin Qudrture rule Q(f) := n i=1 w if(x i ), ie, (12) f(x)dx Q(f) = w i f(x i ) i=1 To explin why this pproch is effective, we hve to consider the Weierstrss Approximtion Theorem (WAT) This theorem sys tht given continuous function 2

3 f(x) on the intervl [, b] ndsmllɛ>0, we cn find polynomil p(x) sotht f(x) p(x) <ɛfor ll x in [, b] Butwelsohvetotkeintoccountthtto get the best results from (11) nd (12), the degree of the polynomil p(x) inwat must be less thn the chosen M for the Gussin Qudrture Rule If deg p > M, the pproximtion in (12) my not be stisfctory Our definition of Gussin Qudrture sys tht Q(f) = p i=1 w if(x i ) Wht the Weierstrss Approximtion Theorem suggests is tht Q(f) f(x)dx To see this, consider the error, (13) E := Q(f) f(x)dx For every polynomil p, we hve E = Q(f) Q(p)+Q(p) Q(f) Q(p) + Q(p) Now suppose tht deg p M Tht mens tht f(x)dx f(x)dx Q(p) = p(x)dx So, (14) Q(p) f(x)dx 3

4 = = p(x)dx f(x)dx (p(x) f(x))dx (15) p(x) f(x) dx If p(x) f(x) <ɛthroughout [, b], then the expression in (15) is t most = ɛdx, which is equl to ɛ(b ) So we hve (16) Q(p) f(x)dx ɛ(b ) Now let s consider Q(f) Q(p) Thisisequlto w i f(x i ) w i p(x i ) = w i (f(x i ) p(x i )) w i (f(x i ) p(x i ) w i ɛ = ɛ w i So we hve: = ɛ(b ) (since w i = Q(1) = 1dx = b ) (17) Q(f) Q(p) ɛ(b ) 4

5 Now we cn show tht the error (13) cn be mde smll, s follows Suppose we re given n intervl [, b], continuous function f(x) on[, b], ɛ>0,ndletp(x) be given by the Weierstrss Approximtion Theorem, ie p(x) f(x) <ɛ( x b) If we choose M deg p nd pply the Gussin Qudrture Rule using this M, then from (17) nd (14) we hve E = Q(f) f(x)dx is Q(f) Q(p) + Q(p) f(x)dx ɛ(b )+ɛ(b ) =2ɛ(b ), nd since ɛ is smll, E is lso smll Unfortuntely, for smll ɛ, deg p is often very lrge, so it is not prcticl to use Gussin Qudrture with M deg p Wht the experiments will show is tht strting with M = 1,sM increses we cn chieve 6 plce ccurcy in estimting f(x)dx by using firly smll vlues of M, though the smllest M tht gives 6 plce ccurcy depends on severl fctors, such s the intervl length b nd the complexity of f(x) 5

6 2 Proof of Gussin Qudrture We will derive n implementtion of Gussin Qudrture bsed on mtrix positivity nd Lgrnge interpoltion, s described in [HK, pge 115] Recll the following fcts bout integrls (21) (f(x)+g(x))dx = f(x)dx + g(x)dx (22) αf(x)dx = α f(x)dx The sme rules pply to Gussin Qudrture: (23) Q(f(x)+g(x)) = Q(f(x)) + Q(g(x)) (24) Q(αf(x)) = αq(f(x)) To prove (23), we hve Q(f(x)+g(x)) = = w i (f(x i )+g(x i )) (w i f(x i )+w i g(x i )) 6

7 = w i (f(x i )) + w i (g(x i )) = Q(f(x)) + Q(g(x)) The proof of (24) is similr Equtions (21) - (24) show tht it is enough to prove Gussin Qudrture for p(x) =x i (0 i M), ie, we must find points nd weights s in (11) such tht (25) β j := x j dx = Q(x j ):= w i x j i, (0 j M) Exmple 21 We will illustrte this reduction to monomils with p(x) = x Applying (21) nd (22) we hve, ( o + 1 x)dx = 0 1dx+1 xdx If (25) holds, then the lst expression equls 0 Q(1) + 1 Q(x), nd by (23)-(24), this equls Q( x), ie, ( x)dx = Q( x) Exmple 22 Throughout this section we shll illustrte the method of Gussin Qudrture in detil for the cse when m =3,n =1,ndtheintervlis[0, 1] We need to find points x 0,x 1 in [0, 1] nd positive weights w 0,w 1 such tht: 7

8 (26) β 0 := 1 = w 0 x 0 + w 1 x 1 (27) β 1 := 1/2 =w 0 x 0 + w 1 x 1 (28) β 2 := 1/3 =w 0 x w 1 x 2 1 (29) β 3 := 1/4 =w 0 x w 1 x 3 1 defined s In the sequel we will show how to solve (26)-(29) To estblish Gussin Qudrture we need to look t the Hnkel mtrix H H = β 0 β 1 β n β 1 β 2 β n+1 β 2 β 3 β n+2 β n β n+1 β 2n We will denote the columns of H by 1,t,, t n We lso will consider the vector v :=t n+1 =(β n+1,,β 2n+1 ) t 8

9 It is known tht H is positive nd invertible Tht mens H, > 0 whenever 0 Another wy to know tht the mtrix H is positive nd invertible is to show tht the nested determinnts of the corners re ll positive If H i is the i i upper left hnd corner of H, we must show tht det H i > 0(1 i n +1) Exmple 23 In our exmple, we hve H = 1 1/2 1/2 1/3 Then det(h 1 )= 1 nd det(h 2 )= 1/3 1/4 =1/12 > 0SoH>0 Since H is invertible, there is n unique vector =( 0,, n ) such tht (210) H = v, ie, = H 1 v, 9

10 or equivlently, (211) 0 β n β n = β n+1 0 β n β n+1 = β n+2 0 β n + + n β 2n = β 2n+1 So t n+1 = t+ + n t n Nowletp(t) =t n+1 ( t + + n t n ) Exmple 24 In our exmple, we hve 1 1/2 1/2 1/3 0 1 = 1/3 1/4 so 0 = 1/3 H 1 1 1/4 1/3 1/2 1/3 =12 1/2 1 1/4 nd we find 0 = 1/6, 1 =1 10

11 So we hve p(t) =t 2 ( 1/6+t) =t 2 t +1/6 It is known tht p(t) hs exctly n + 1 distinct rel roots in [, b] (see the proof of Proposition 33 nd Theorem 41 (iv) => (iii) in [CF] Denote these roots by x 0 x n Exmple 25 In our exmple, the roots of t 2 t +1/6 =0re t =1± 1 4(1)(1/6)/2 =1± (5/3)/2, so x nd x Note tht both x 0 nd x 1 re in [0, 1] Now let s look t the Vndermonde mtrix V defined s V = x 0 0 x 0 n x 1 0 x 1 n x n 0 x n n It is known tht becuse x 0,,x n re distinct, then V is invertible, ie, det(v ) 0[HK, pge 115] 11

12 Exmple 26 In our exmple, V = 1 1 x 0 x 1 So det(v )=x 1 x 0 0 Since V is invertible, there is n unique vector, ω := (ω 0 ω n ), such tht (212) Vω= β 0 β 1 β n, ie, (213) 1 1 x 0 x n x 0 2 x 2 n x n 0 x n n ω 0 ω n = β 0 β 1 β n 12

13 (213) is equivlent to the following system: (214) β 0 = ω ω n (= Q(1)) β 1 = ω 0 x ω n x n (= Q(x)) β n = ω 0 x n ω n x n n (= Q(x n )) We clim tht x 0,,x n nd ω 0,,ω n solve the Gussin Qudrture system (25) Exmple 27 In the exmple we hve, 1 1 x 0 x 1 ω 0 ω 1 = β 0 β 1, or equivlently w 0 + w 1 = β 0, nd w 0 x 0 + w 1 x 1 = β 1, where w nd w The Gussin Qudrture system (25) is equivlent to the system of equtions in (214) together with the following system: 13

14 (215) β n+1 = ω 0 x n ω n x n+1 n (= Q(x n+1 )) β n+2 = ω 0 x n ω n x n+2 n (= Q(x n+2 )) = β 2n+1 = ω 0 x 2n ω n x 2n+1 n (= Q(x 2n+1 )) Since (214) is stisfied from (213), we re going to focus on (215) Consider the first eqution of (215), β n+1 = ω 0 x n ω n x n+1 n We hve β n+1 = x n+1 dx nd Q(x n+1 ) w i x n+1 i Since ech x i is root of t n+1 = t + + n t n,wehve Q(x n+1 )= w i x n+1 i 14

15 = w i ( x i + + n x n i ) = 0 wi + 1 wi x i + + n wi x n i = 0 β β n β n (by (214)) By the first eqution of (211), the lst expression is equl to β n+1, so we conclude tht (216) Q(x n+1 )=β n+1 For the second eqution of (215), we hve Q(x n+2 ) w i x n+2 i Since ech x i is root of t n+1 = t + + n t n, x i is lso root of t n+2 = 0 t + + n t n+1 Sowehve Q(x n+2 )= w i x n+2 i = w i ( 0 x i + + n x n+1 i ) 15

16 = 0 wi x i + + n wi x n+1 i = 0 β n β n+1 (by (214) nd (216)) By the second eqution of (211) the lst expression is equl to β n+2,sowe conclude tht (217) Q(x n+2 )=β n+2 Following the sme procedure, we re ble to prove the rest of the equtions in the set (215) This completes the proof tht the points x i,,x n nd the weights w i,,w n stisfy the Gussin Qudrture system (11) From the bove discussion, we hve distinct points x 0,,x n in [, b] nd weights w 0,,w n such tht (218) Q(p) := w i p(x i )= p(x)dx (deg p 2n +1) To complete the proof of Gussin Qudrture s in (11) we must still show tht ech w i > 0 In wht follows we will use Lgrnge polynomils to prove tht ech w i > 0 Lgrnge Interpoltion sys tht given distinct points x 0,,x n nd given numbers y 0,,y n there is unique polynomil p(x) withdeg p = n, such tht p(x i )=y i (0 i n) 16

17 Exmple 28 Consider Lgrnge Interpoltion with n=1 The Lgrnge polynomil of degree 1 such tht p(x 0 )=y 0 nd p(x 1 )=y 1 is (219) p 1 (x) := y 0(x x 1 ) (x 0 x 1 ) + y 1(x x 0 ) (x 1 x 0 ) The curve y = p(x) is the line connecting (x 0,y 0 )nd(x 1,y 1 ) The Lgrnge polynomil p 1 (x) in (219) is the bsis for the Trpezoidl Rule In this rule, we subdivide [, b] inton equl subintervls [x i,x i+1 ](0 i n + 1,x 0 =, x n = b) On intervl [x i,x i+1 ], we pproximte f(x) by the line connecting (x i,f(x i )) to (x i+1,f(x i+1 )); this line is the grph of the Lgrnge polynomil p 1 (x) such tht p 1 (x i )=y i := f(x i ) nd p 1 (x i+1 )=y i+1 := f(x i+1 ) We then pproximte x i+1 x i grph of p 1 between x i nd x i+1 : f(x)dx by the re of the trpezoid determined by the xi+1 x i f(x)dx 1 2 (x i+1 x i )(f(x i )+f(x i+1 )) Letting h = x i+1 x i (0 i n 1), we my express the Trpezoidl Rule by 17

18 (220) n 1 f(x)dx = h f( + ih)+h( f()+f(b) ) 2 i=1 Exmple 29 For n =2,wehvedistinctpointsx 0,x 1,x 2,ndvluesy 0,y 1,y 2 The Lgrnge polynomil p(x) looks like the following: (221) p 2 (x) := y 0(x x 1 )(x x 2 ) (x 0 x 1 )(x 0 x 2 ) + y 1(x x 0 )(x x 2 ) (x 1 x 0 )(x 1 x 2 ) + y 2(x x 0 )(x x 1 ) (x 2 x 0 )(x 2 x 1 ) The curve y = p 2 (x) is the unique prbol pssing through (x 0,y 0 ), (x 1,y 1 ), (x 2,y 2 ) The Lgrnge polynomil p 2 (x) in (221) is the bsis for Simpson s Rule In this rule, we pproximte y = f(x) by piecewise-prbolic curve y = g(x) on[, b], using p 2 (x) for ech piece of g(x) We cn then pproximte f(x)dx by g(x)dx Ifwe let the function f be tbulted t points x 0,x 1 nd x 2, eqully spced by distnce h, nd we let y i = f i := f(x i )(0 i 2), then Simpson s rule sys tht x2 x0 +2h x 0 f(x)dx = x0 +2h x 0 f(x)dx x 0 p 2 (x)dx = 1 3 h(f 0 +4f 1 + f 2 ) 18

19 If we use n double-intervls with eqully spced points x 0,x 1,,x 2n, then by using the bove method on ech double-intervl nd dding up, we get (222) f(x)dx h n 1 3 ( (2f( +2ih)+4f( +(2i +1)h)) + f(b) f()) The generl formul for the Lgrnge polynomil p(x) such tht p(x i )=y i (p i n) is cler from (219) nd (221) If q(x) is nother polynomil of deg n such tht q(x i )=y i (0 i n), then (p q)(x i )=0 Since deg p q n nd p q hs n +1 distinct roots, it follows tht p q = 0, ie p = q So there is unique Lgrnge polynomil of deg n Now we return to Gussin Qudrture, nd the clim tht ω i > 0(0 i n) We fix j nd we let p(x) p j (x) be the Lgrnge polynomil of degree n such tht p(x i )=0fori j nd p(x j )=1 Now consider q(x) =p(x) 2 Since deg q =2n (< 2n + 1), then from (218), (223) q(x)dx = w i q(x i ) Note tht q(x) 0nd q(x j )=1, so q(x)dx > 0 19

20 Therefore, 0 < q(x)dx = w i q(x i )=w j, so we conclude tht w j > 0(0 j n) This completes the proof of the Gussin Qudrture rule (11) 3 Iterted 2-Dimensionl Gussin Qudrture In 1-dimensionl Gussin Qudrture we showed tht given n>0nd n intervl [, b], there exist points x 0,,x n in [,b] nd positive weights ω 0,,ω n, such tht p(x)dx = n w ip(x i )(deg p 2n +1) Now we re going to use 1-dimensionl Gussin Qudrture to find rule tht works in two dimensions We re given rectngle in the plne, R =[, b] [c, d], nd continuous function f(x, y) onr We wnt to pproximte f(x, y)dxdy R Given n, letx 0,,x n, ω 0,,ω n be the Gussin Qudrture points nd weights for [, b], so (11) holds Let y 0,,y n, s 0,,s n be the Gussin Qudrture points nd weights for [c, d], so tht d c q(y)dy = s j q(y j )(deg q 2n +1) j=0 Now for function f(x, y), defined on rectngle R, let Q(f) := s j w i f(x i,y j ) j=0 20

21 For polynomil p(x, y), let p y (x) =p(x, y)( polynomil in x with y fixed), nd let p x (y) =p(x, y)( polynomil in y with x fixed) We re clming tht if p(x, y) is polynomil, with deg p y (x) 2n +1nd deg p x (y) 2n +1, then Q(p) = d p(x, y)dxdy( c R p(x, y)dxdy) If we fix x nd consider g(y) :=p x (y) =p(x, y), then deg g 2n +1, so which is the sme s d c g(y)dy = s j g(y j ), j=0 H(x) := d c p(x, y)dy = s j p(x, y j )( x b) j=0 So we hve d c p(x, y)dydx = = ( d j=0 p x (y)dydx = c s j p(x, y j ))dx H(x)dx = s j p(x, y j )dx (deg p(x, y j ) 2n +1) j=0 21

22 = j=0 s j w i p(x i,y j )= s j w i p(x i,y j ) j=0 = Q(p(x, y)) So Q(p) = R p(x, y)dxdy whenever deg p x(y) 2n +1 nd deg p y (x) 2n +1 For generl function f(x, y), tht is defined nd continuous on R, we my pproximte f(x, y)dxdy by Q(f) R In ppendix-5 we will illustrte this pproximtion with numericl exmples References [CF] RE Curto, LA Filkow, Recursiveness, positivity, nd truncted moment problems, Houston Journl of Mthemtics 17(1991), [HK] Hoffmn, RKunze, Liner Algebr, Prentice-Hill, 1961 Deprtment of Computer Science, Stte University of New York, New Pltz, NY 12561, USA 22

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

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

Lecture 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

Best 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

III. 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

Numerical 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

Unit #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

Sections 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)

3.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 [,

Numerical 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

Lecture 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

COT4501 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

63. 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 =

Chapters 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

Lecture 14 Numerical integration: advanced topics

Lecture 14 Numericl integrtion: dvnced topics Weinn E 1,2 nd Tiejun Li 2 1 Deprtment of Mthemtics, Princeton University, weinn@princeton.edu 2 School of Mthemticl Sciences, Peking University, tieli@pku.edu.cn

Midpoint Approximation

Midpoint Approximtion Sometimes, we need to pproximte n integrl of the form R b f (x)dx nd we cnnot find n ntiderivtive in order to evlute the integrl. Also we my need to evlute R b f (x)dx where we do

Big idea in Calculus: approximation

Big ide in Clculus: pproximtion Derivtive: f (x) = df dx f f(x +h) f(x) =, x h rte of chnge is pproximtely the rtio of chnges in the function vlue nd in the vrible in very short time Liner pproximtion:

LECTURE 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

1 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

Numerical Integration

Numericl Integrtion Wouter J. Den Hn London School of Economics c 2011 by Wouter J. Den Hn June 3, 2011 Qudrture techniques I = f (x)dx n n w i f (x i ) = w i f i i=1 i=1 Nodes: x i Weights: w i Qudrture

Section 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 FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give

different 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

31.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

Math 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

Week 10: Riemann integral and its properties

Clculus nd Liner Algebr for Biomedicl Engineering Week 10: Riemnn integrl nd its properties H. Führ, Lehrstuhl A für Mthemtik, RWTH Achen, WS 07 Motivtion: Computing flow from flow rtes 1 We observe the

Chapter 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

20 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

38 Riemann sums and existence of the definite integral.

38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These

Numerical 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

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

Polynomial 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

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

(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

We know that if f is a continuous nonnegative function on the interval [a, b], then b

1 Ares Between Curves c 22 Donld Kreider nd Dwight Lhr We know tht if f is continuous nonnegtive function on the intervl [, b], then f(x) dx is the re under the grph of f nd bove the intervl. We re going

COSC 336 Numericl Anlysis I Numericl Integrtion nd Dierentition III - Guss Qudrture nd Adptive Qudrture Edgr Griel Fll 5 COSC 336 Numericl Anlysis I Edgr Griel Summry o the lst lecture I For pproximting

Lecture 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

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

Orthogonal Polynomials and Least-Squares Approximations to Functions

Chpter Orthogonl Polynomils nd Lest-Squres Approximtions to Functions **4/5/3 ET. Discrete Lest-Squres Approximtions Given set of dt points (x,y ), (x,y ),..., (x m,y m ), norml nd useful prctice in mny

Best Approximation in the 2-norm

Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

Math 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:

If u = g(x) is a differentiable function whose range is an interval I and f is continuous on I, then f(g(x))g (x) dx = f(u) du

Integrtion by Substitution: The Fundmentl Theorem of Clculus demonstrted the importnce of being ble to find nti-derivtives. We now introduce some methods for finding ntiderivtives: If u = g(x) is differentible

1B40 Practical Skills

B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

Integrals along Curves.

Integrls long Curves. 1. Pth integrls. Let : [, b] R n be continuous function nd let be the imge ([, b]) of. We refer to both nd s curve. If we need to distinguish between the two we cll the function the

Math 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

1 Ordinary Differential Equations

1 Ordinry Differentil Equtions 1. Mthemticl Bckground 1..1 Smoothness Definition 1.1 A function f defined on [, b] is continuous t x [, b] if lim x x f(x) = f(x ). Remrk Note tht this implies existence

Discrete 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

Riemann Integrals and the Fundamental Theorem of Calculus

Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums

Introduction to Numerical Analysis

Introduction to Numericl Anlysis Doron Levy Deprtment of Mthemtics nd Center for Scientific Computtion nd Mthemticl Modeling (CSCAMM) University of Mrylnd June 14, 2012 D. Levy CONTENTS Contents 1 Introduction

Lecture 3. Limits of Functions and Continuity

Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.

x = b a n x 2 e x dx. cdx = c(b a), where c is any constant. a b

CHAPTER 5. INTEGRALS 61 where nd x = b n x i = 1 (x i 1 + x i ) = midpoint of [x i 1, x i ]. Problem 168 (Exercise 1, pge 377). Use the Midpoint Rule with the n = 4 to pproximte 5 1 x e x dx. Some quick

Homework 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

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23

Harmonic Mean Derivative - Based Closed Newton Cotes Quadrature

IOSR Journl of Mthemtics (IOSR-JM) e-issn: - p-issn: 9-X. Volume Issue Ver. IV (My. - Jun. 0) PP - www.iosrjournls.org Hrmonic Men Derivtive - Bsed Closed Newton Cotes Qudrture T. Rmchndrn D.Udykumr nd

Section 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

Partial Derivatives. Limits. For a single variable function f (x), the limit lim

Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles

Calculus and linear algebra for biomedical engineering Week 11: The Riemann integral and its properties

Clculus nd liner lgebr for biomedicl engineering Week 11: The Riemnn integrl nd its properties Hrtmut Führ fuehr@mth.rwth-chen.de Lehrstuhl A für Mthemtik, RWTH Achen Jnury 9, 2009 Overview 1 Motivtion:

MATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1

MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further

Czechoslovak 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

5: The Definite Integral

5: The Definite Integrl 5.: Estimting with Finite Sums Consider moving oject its velocity (meters per second) t ny time (seconds) is given y v t = t+. Cn we use this informtion to determine the distnce

OPEN NEWTON - COTES QUADRATURE WITH MIDPOINT DERIVATIVE FOR INTEGRATION OF ALGEBRAIC FUNCTIONS

IJRET: Interntionl Journl of Reserch in Engineering nd Technology eissn: 9-6 pissn: -78 OPEN NEWTON - COTES QUADRATURE WITH MIDPOINT DERIVATIVE FOR INTEGRATION OF ALGEBRAIC FUNCTIONS T. Rmchndrn R.Priml

Section 6.1 Definite Integral

Section 6.1 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 e determined

The 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

5.2 Volumes: Disks and Washers

4 pplictions of definite integrls 5. Volumes: Disks nd Wshers In the previous section, we computed volumes of solids for which we could determine the re of cross-section or slice. In this section, we restrict

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C.

Lecture 4 Complex Integrtion MATH-GA 2451.001 Complex Vriles 1 Construction 1.1 Integrting complex function over curve in C A nturl wy to construct the integrl of complex function over curve in the complex

New 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

The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.

ADVANCED CALCULUS PRACTICE PROBLEMS JAMES KEESLING The problems tht follow illustrte the methods covered in clss. They re typicl of the types of problems tht will be on the tests. 1. Riemnn Integrtion

More Properties of the Riemann Integral

More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl

Chapter 6. Riemann Integral

Introduction to Riemnn integrl Chpter 6. Riemnn Integrl Won-Kwng Prk Deprtment of Mthemtics, The College of Nturl Sciences Kookmin University Second semester, 2015 1 / 41 Introduction to Riemnn integrl

Continuous Random Variables

STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

Convex Sets and Functions

B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

The Definite Integral

CHAPTER 3 The Definite Integrl Key Words nd Concepts: Definite Integrl Questions to Consider: How do we use slicing to turn problem sttement into definite integrl? How re definite nd indefinite integrls

The presentation of a new type of quantum calculus

DOI.55/tmj-27-22 The presenttion of new type of quntum clculus Abdolli Nemty nd Mehdi Tourni b Deprtment of Mthemtics, University of Mzndrn, Bbolsr, Irn E-mil: nmty@umz.c.ir, mehdi.tourni@gmil.com b Abstrct

Line Integrals. Partitioning the Curve. Estimating the Mass

Line Integrls Suppose we hve curve in the xy plne nd ssocite density δ(p ) = δ(x, y) t ech point on the curve. urves, of course, do not hve density or mss, but it my sometimes be convenient or useful to

7.6 The Use of Definite Integrals in Physics and Engineering

Arknss Tech University MATH 94: Clculus II Dr. Mrcel B. Finn 7.6 The Use of Definite Integrls in Physics nd Engineering It hs been shown how clculus cn be pplied to find solutions to geometric problems

Math 3B Final Review

Mth 3B Finl Review Written by Victori Kl vtkl@mth.ucsb.edu SH 6432u Office Hours: R 9:45-10:45m SH 1607 Mth Lb Hours: TR 1-2pm Lst updted: 12/06/14 This is continution of the midterm review. Prctice problems

Anti-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

Math 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

Chapter 9 Definite Integrals

Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished

UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE

UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE 1. Pointwise Convergence of Sequence Let E be set nd Y be metric spce. Consider functions f n : E Y for n = 1, 2,.... We sy tht the sequence

Math 0230 Calculus 2 Lectures

Mth Clculus Lectures Chpter 7 Applictions of Integrtion Numertion of sections corresponds to the text Jmes Stewrt, Essentil Clculus, Erly Trnscendentls, Second edition. Section 7. Ares Between Curves Two

Math Calculus with Analytic Geometry II

orem of definite Mth 5.0 with Anlytic Geometry II Jnury 4, 0 orem of definite If < b then b f (x) dx = ( under f bove x-xis) ( bove f under x-xis) Exmple 8 0 3 9 x dx = π 3 4 = 9π 4 orem of definite Problem

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

MTH 122 Fall 2008 Essex County College Division of Mathematics Handout Version 10 1 October 14, 2008

MTH 22 Fll 28 Essex County College Division of Mthemtics Hndout Version October 4, 28 Arc Length Everyone should be fmilir with the distnce formul tht ws introduced in elementry lgebr. It is bsic formul

Section 14.3 Arc Length and Curvature

Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in

Interpolation. Gaussian Quadrature. September 25, 2011

Gussin Qudrture September 25, 2011 Approximtion of integrls Approximtion of integrls by qudrture Mny definite integrls cnnot be computed in closed form, nd must be pproximted numericlly. Bsic building

Math 100 Review Sheet

Mth 100 Review Sheet Joseph H. Silvermn December 2010 This outline of Mth 100 is summry of the mteril covered in the course. It is designed to be study id, but it is only n outline nd should be used s

Math 113 Exam 1-Review

Mth 113 Exm 1-Review September 26, 2016 Exm 1 covers 6.1-7.3 in the textbook. It is dvisble to lso review the mteril from 5.3 nd 5.5 s this will be helpful in solving some of the problems. 6.1 Are Between

set is not closed under matrix [ multiplication, ] and does not form a group.

Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

The Trapezoidal Rule

_.qd // : PM Pge 9 SECTION. Numericl Integrtion 9 f Section. The re of the region cn e pproimted using four trpezoids. Figure. = f( ) f( ) n The re of the first trpezoid is f f n. Figure. = Numericl Integrtion

7 - Continuous random variables

7-1 Continuous rndom vribles S. Lll, Stnford 2011.01.25.01 7 - Continuous rndom vribles Continuous rndom vribles The cumultive distribution function The uniform rndom vrible Gussin rndom vribles The Gussin

2

1 Notes for Numericl Anlysis Mth 5466 by S. Adjerid Virgini Polytechnic Institute nd Stte University (A Rough Drft) 2 Contents 1 Differentition nd Integrtion 5 1.1 Introduction............................

a a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.

Section 9 The Lplce Expnsion In the lst section, we defined the determinnt of (3 3) mtrix A 12 to be 22 12 21 22 2231 22 12 21. In this section, we introduce generl formul for computing determinnts. Rewriting

Variational Techniques for Sturm-Liouville Eigenvalue Problems

Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment