# Numerical integration

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 is s follows. The rst section covers qudrture procedures, which re the dominnt wy to solve models. The second section covers (pseudo) Monte Crlo integrtion techniques. The lst section discusses qusi Monte Crlo integrtion. 2.2 Qudrture techniques Suppose we wnt to clculte I = ; (2.) where f(x) is sclr function. This could be di cult problem, e.g., becuse the functionl form is nsty or becuse we do not even hve functionl form, but only set of function vlues. Qudrture techniques re numericl integrtion techniques for which the formul of the numericl integrl cn be written s I = w i f i ; (2.2) i=

2 ii 2. Numericl integrtion where f i is the function vlue of f t node x i nd w i is weight. We will discuss two types of qudrture techniques. The rst is Newton-Cotes. Newton-Cotes is not very creful bout choosing the loction of the nodes, but is clever bout choosing the weights. The second is Gussin Qudrture. This procedure is clever bout choosing the weights s well s the nodes. To implement qudrture methods you cn forget the detils of the derivtion. All you hve to remember is how to construct wht kind of weights nd this is esy Newton-Cotes Qudrture Consider the integrtion problem given in Eqution 2. nd suppose tht one hs three function vlues t three nodes. Given this informtion, how would one clculte the integrl? Well, one could clculte n pproximting function nd clculte the integrl for this pproximting function. Since we hve been given three points, we cn clculte second-order polynomil, P 2 (x), nd get n estimte for the integrl using P 2 (x)dx: (2.3) Since integrting polynomils is esy, this procedure is strightforwrd. But one still hs to nd the pproximtion nd do the integrtion. It turns out tht these procedures cn be stndrdized. Tht is, one cn nd the weights in (2.2) independent of the functionl form of f. They do depend to some extend on the loction of the nodes. We ssume tht x 0 =, x = ( + b)=2, nd x 2 = b. Tht is, we hve equidistnt nodes nd the rst (lst) node is the left (right) boundry. We hve two segments of equl length, h nd we cn write x = x 0 + h nd x 2 = x 0 + 2h. Recll from the chpter on function pproximtion, tht using Lgrnge interpoltion the second-order polynomil cn be written s P 2 (x) = f 0 L 0 (x) + f L (x) + f 2 L 2 (x): (2.4) This mens tht our pproximting integrl is given by P 2 (x)dx = (f 0 L 0 (x) + f L (x) + f 2 L 2 (x)) dx = f 0 L 0 (x)dx + f L (x)dx + f 2 L 2 (x)dx The right-hnd side lredy hs the qudrture form s in Eqution (2.2). The weights re the integrls. Key is tht the integrls, i.e., the weights, do not depend on the function vlues. The nodes re pinned down by the vlue of x 0 nd h. The beuty is tht the integrls do not depend on x 0

3 2.2 Qudrture techniques iii either. Try to do the integrtion for one of them to ensure yourself tht this is true. In prticulr, it is not di cult to show tht Simpson qudrture Combining the results we get L 0 (x)dx = 3 h L (x)dx = 4 3 h L 2 (x)dx = 3 h P 2 (x)dx = 3 f f + 3 f 2 h: This will give you n ccurte nswer if the function f cn be pproximted well with second-order polynomil over the intervl [; b]. It will give you n exct nswer for ny second-order polynomil. But clerly this will not give you n ccurte nswer if the function you re integrting is more complex. Sticking to the originl ide of integrting pproximting polynomils, there re two wys to proceed. The rst is to extend the ide to higher-order polynomils. The other is to use the sme ide but to smller intervls. In prticulr, suppose tht one hs n + equidistnt nodes nd the distnce between the nodes is h. The totl number of nodes must be odd so tht there re n=2 segments of length 2h. On ech of these segments of length 2h one then pplies the bove procedure. This would give 3 f f + 3 f 2 h + 3 f f f 4 h f n f n + 3 f n h = 3 f f f f f f n f n + 3 f n h Gussin qudrture In constructing the Simpson weights no thought went into choosing the loction of the nodes. We simply strted with equidistnt nodes nd clculted the formuls for the weights. Writing the code to implement Newton- Cotes is so esy, becuse the weights only depend on h nd not on x 0. But

4 iv 2. Numericl integrtion by being smrt bout choosing the nodes we cn do even better. Tht is we cn get more ccurte nswer with the sme number of points. To be precise, if n is the number of nodes, then the following is true. With Newton-Cotes qudrture we get n exctly correct nswer if the function we re integrting is polynomil of order n, wheres with Gussin qudrture we get n exctly correct nswer if the function we re interested in is polynomil of order 2n. For exmple, if we hve 5 nodes then we get n exct nswer for ll polynomils of order 9 (or less) nd we get n ccurte nswer for functions tht cn be pproximted well with 9 th -order polynomil. Given tht we cn cover quite few functions with 9 th -order polynomils, you better be impressed bout the power nd simplicity of Gussin qudrture. To understnd the procedure, suppose we wnt to integrte sclr function de ned on [ ; ] using the qudrture formul with n nodes. Thus, Z! i f( i ): (2.5) Note tht we hve 2n free prmeters, nmely the! i s (the weights) nd the i s (the nodes). We wnt to get the correct nswer for ny polynomil of order 2n. To ccomplish this, we choose the vlues of! i nd i so tht by construction we get the correct nswer for ll the bsis functions, tht is, for, x, x 2,, nd x 2n. But if we get the correct nswer for ll bsis functions, we get the correct nswer for ny combintion. Tht is, one gets the correct nswer for ny polynomil of order 2n. To see why, suppose tht we hve found the! i s nd the i s such tht pplying the formul in Eqution 2.5 for f(x) = x 4 gives the right nswer, tht is Z x 4 dx = i=! i 4 i : (2.6) But this mens tht we lso get the right nswer for f(x) = x 4 for ny vlue of. To see why our pproximtion now would be! i 4 i =! i 4 i : (2.7) i= Tht is our pproximtion is the nswer for f(x) = x 4 times. Since the integrl of f(x) is indeed equl times the integrl of f(x) we get the right nswer. Similrly, we get the right nswer for ny combintion of polynomil bsis functions. But we still hve to nd the! i s nd the i s tht give us the correct nswer for the bsis functions. Tht will be the cse if the following is true: Z x j dx =! i j i j = 0; ; ; 2n (2.8) i= i= i=

5 2.2 Qudrture techniques v This is system of 2n equtions in 2n unknowns. The importnt thing to relize is tht the solution to this system of equtions does not depend on f. Tht is, independent of the prticulr function one is considering, one uses the sme vlues for the! i s nd the i s. In fct, there re stndrd subroutines vilble to solve for the qudrture nodes nd weights. Guss-Legendre The procedure discussed bove tht clculted the integrl of function over the intervl [ ; ] is clled Guss-Legendre. So in prctice one would do the following. One would use numericl procedure to generte the! i s nd the i s. The generted vlues will stisfy (2.8), but you don t hve to worry bout how the lgorithm mkes tht hppen. Let the solution be! GL i nd GL i. The only thing tht you hve to do is to obtin function vlues t the indicted nodes nd clculte the pproximtion to the integrl using the qudrture formul, tht is Guss-Hermite Z i=! GL i f( GL i ): (2.9) Guss-Legendre will give n ccurte nswer if f(x) cn be pproximted well with polynomil. Now suppose tht one wnts to integrte function f(x) tht cn be written s g(x) W (x) nd one knows tht g(x) cn be pproximted well with polynomil but g(x) W (x) cnnot. In this cse, it would not be smrt to use Guss-Legendre. Insted one would wnt to djust the procedure to tke this into ccount. There re di erent Gussin qudrture procedure tht do exctly this for di erent weighting functions, W (x), nd di erent domins. An importnt one is Guss-Hermite for which the weighting function is e x2 nd the domin is the rel line. For Guss- Hermite the weights nd the nodes re chosen to stisfy Z x j e x2 dx =! i j i j = 0; ; ; 2n (2.0) Let the solution be! GH i by Z i= nd GH i. So the pproximtion would be given g(x)e x2 dx i=! GH i g( gh;i ): (2.) Mke sure you understnd why there is n = in Eqution (2.0) nd n in Eqution (2.). In the rst eqution we re choosing the! i s nd the i s so tht our pproximting formul, i.e. Eqution (2.) will give the correct nswer for prticulr choices of g(x), nmely polynomil bsis functions. But unless g(x) is polynomil, the qudrture formul is n pproximtion.

6 vi 2. Numericl integrtion Guss-Chebyshev Another Gussin qudrture procedure is Guss-Chebyshev tht dels with Z g(x) dx ( x 2 ) =2 Qudrture nodes The nodes tht solve the problems discussed here turn out to be the zeros of the bsis functions of the corresponding Orthogonl polynomil. Tht is, the Chebyshev nodes tht solve Z x j ( x 2 ) dx = X n! =2 i j i j = 0; ; ; 2n i= re exctly the sme s the Chebyshev nodes discussed in the chpter on pproximting functions, lthough it goes bit to fr to explin why Chnge in vrible Suppose one wnts to clculte the expecttion of h (y), i.e., E[h(y)] ; where y is rndom vrible with N(; 2 ) distribution. Tht is one wnts to clculte Z (y ) 2 p h(y) exp dy Also, suppose tht h(y) is function tht one expects cn be pproximted well with polynomil. This problem resembles Guss-Hermite qudrture problem but not exctly. One might be tempted to mke it Guss-Hermite problem simply by de ning (y ) 2 h(y) = h(y) exp p exp ( y 2 ) nd considering the identicl integrl Z h(y) exp y 2 dy: But note tht it ws given tht h(y) could be pproximted well with polynomil, not tht h(y) cn be. In fct, given tht exp( y 2 ) is not like polynomil, h(y) my be pproximted very poorly with polynomil. So the pproprite wy to go is to do chnge of vribles. This is very esy but don t forget the Jcobin. Tht is, if y = (x) then g(y)dy = Z (b) () g((x)) 0 (x)dx

7 2.3 Monte Crlo Integrtion vii The trnsformtion we use here is x = y p 2 or y = p 2x + This gives E [h(y)] = = = Z Z Z (y ) 2 p h(y) exp dy p 2 h(p 2x + ) exp x 2 p 2dy p h( p 2x + ) exp x 2 dy Wht to do in prctice? So wht would you do in prctice if one wnts to evlute E[h(y)]. First, one obtins n Guss-Hermite qudrture weights nd nodes using numericl lgorithm. Second, one gets n pproximtion using E [h(y)] p p! GH i h 2 GH i + i= (2.2) nd do not forget to divide by p! Well, how often do you get something in life so complex s n integrl so esily? 2.3 Monte Crlo Integrtion The ide behind Monte Crlo integrtion is very simple. Consider rndom vrible x with CDF F (x). Then one cn pproximte the integrl of the function h(x) with P T t= h(x)df (x) h(x t) ; (2.3) T where fx t g T t= is series drwn from rndom number genertor corresponding to the distribution of x. Although very simple there is one importnt disdvntge: it is not very ccurte. Above we sw tht we cn get n ccurte nswer with just few qudrture nodes for lrge clss of functions. Monte Crlo is subject to smpling vrition nd this only disppers t root n. Suppose we clculte the men of rndom vrible with uniform distribution on the unit intervl. With T = 00 the stndrd error is which is 5.8% of the true men. Even with T = ; 000 we hve stndrd error tht is.8% of the true men.

8 viii 2. Numericl integrtion If one doesn t hve CDF then one cn use uniform distribution. Tht is, h(x)dx = (b ) h(x)f b (x)dx; (2.4) where f b is the density of rndom vrible with uniform distribution over [; b], tht is, f b = (b ). Thus, one could pproximte the integrl with P T t= h(x)dx (b ) h(x t) ; (2.5) T where x t is generted using rndom number genertor for vrible tht is uniform on [; b]. Typiclly one doesn t hve ccess to true rndom numbers nd one only hs ccess to computer progrm tht genertes them. Therefore, these procedures re lso referred to pseudo rndom numbers. The computer progrm genertes dt tht re (if it is good progrm) indistinguishble from true series of rndom numbers. But the function tht genertes the series is deterministic (nd chotic) so tht one should be creful in using theorems for true rndom numbers to think bout things like rtes of convergence. 2.4 Multivrite problems nd qusi Monte Crlo integrtion It is strightforwrd to extend the ide of qudrture techniques to higher dimensionl problems. The number of nodes increses exponentilly, however, which mens tht it becomes computtionlly quickly very expensive. With Monte Crlo integrtion one does not seem to hve this problem. Tht is the men of h(x t ) nd the men of h(x t ; z t ) both converge towrds its men t rte p T. Think of numericl integrtion problem s choosing nodes nd then tking (weighted) verge. By extending the qudrture techniques derived for sclr functions to multivrite problems one doesn t ll in the spce with nodes in the most e cient wy. Building on the ide of pseudo Monte Crlo new techniques hve been developed tht ll in the spce better. The strting point of qusi Monte Crlo integrtion is to generte equidistributed series. A sclr sequence fx t g T t= is equidistributed over [; b] i b lim T! T TX f(x t ) = t= (2.6) for ll Riemn-integrble f(x). Note the similrity with Eqution (2.5). There re severl exmples of equidistributed series. For exmple the se-

9 2.4 Multivrite problems nd qusi Monte Crlo integrtion ix quence (; 2; 3; 4; ) is equidistributed modulo for ny irrtionl number. Another exmple is the sequence of prime numbers multiplied by n irrtionl number (2; 3; 5; 7; ). For d-dimensionl problem, n equidistributed sequence fx t g T t= D R d stis es (D) TX Z lim f(x t ) = ; (2.7) T! T t= where (D) is the Lebesque mesure of D. 2 Some exmples for equidistributed vectors on the d-dimensionl unit hypercube re the following. Weyl: x t = (t p p ; t p p 2 ; ; t p p d ) modulo, (2.8) where p i is the i th positive prime number. Neiderreiter: x t = (t2 =(d+) ; 2 2=(d+) ; ; t2 d=(d+) ) modulo Equidistributed vectors for other hypercubes cn be done using liner trnsformtions. D F rc(x) (or x Modulo ) mens tht we subtrct the lrgest integer tht is less thn x. For exmple, frc(3:564) = 0:564: 2 To see why you hve to multiply the sum with (D) just consider the cse when f(x) = 8x. Then we know the integrl should be equl to (D) which we get becuse P T t= f(x)=t = :

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

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

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

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

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

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

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

### COSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature

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

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

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

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

### Line and Surface Integrals: An Intuitive Understanding

Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of

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

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

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

### The Wave Equation I. MA 436 Kurt Bryan

1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string

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

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

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

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

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

### Math 113 Exam 2 Practice

Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.-7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number

### STEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA. 0 if t < 0, 1 if t > 0.

STEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA STEPHEN SCHECTER. The unit step function nd piecewise continuous functions The Heviside unit step function u(t) is given by if t

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

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

### Problem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:

(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one

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

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

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

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

### 10. AREAS BETWEEN CURVES

. AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in

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

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

### Mapping the delta function and other Radon measures

Mpping the delt function nd other Rdon mesures Notes for Mth583A, Fll 2008 November 25, 2008 Rdon mesures Consider continuous function f on the rel line with sclr vlues. It is sid to hve bounded support

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

### Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

### Lecture Notes: Orthogonal Polynomials, Gaussian Quadrature, and Integral Equations

18330 Lecture Notes: Orthogonl Polynomils, Gussin Qudrture, nd Integrl Equtions Homer Reid My 1, 2014 In the previous set of notes we rrived t the definition of Chebyshev polynomils T n (x) vi the following

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

### S. S. Dragomir. 1. Introduction. In [1], Guessab and Schmeisser have proved among others, the following companion of Ostrowski s inequality:

FACTA UNIVERSITATIS NIŠ) Ser Mth Inform 9 00) 6 SOME COMPANIONS OF OSTROWSKI S INEQUALITY FOR ABSOLUTELY CONTINUOUS FUNCTIONS AND APPLICATIONS S S Drgomir Dedicted to Prof G Mstroinni for his 65th birthdy

### Test , 8.2, 8.4 (density only), 8.5 (work only), 9.1, 9.2 and 9.3 related test 1 material and material from prior classes

Test 2 8., 8.2, 8.4 (density only), 8.5 (work only), 9., 9.2 nd 9.3 relted test mteril nd mteril from prior clsses Locl to Globl Perspectives Anlyze smll pieces to understnd the big picture. Exmples: numericl

### Problem Set 3

14.102 Problem Set 3 Due Tuesdy, October 18, in clss 1. Lecture Notes Exercise 208: Find R b log(t)dt,where0

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

### 2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ).

AP Clculus BC Review Chpter 8 Prt nd Chpter 9 Things to Know nd Be Ale to Do Know everything from the first prt of Chpter 8 Given n integrnd figure out how to ntidifferentite it using ny of the following

### Anonymous Math 361: Homework 5. x i = 1 (1 u i )

Anonymous Mth 36: Homewor 5 Rudin. Let I be the set of ll u (u,..., u ) R with u i for ll i; let Q be the set of ll x (x,..., x ) R with x i, x i. (I is the unit cube; Q is the stndrd simplex in R ). Define

### A. Limits - L Hopital s Rule ( ) How to find it: Try and find limits by traditional methods (plugging in). If you get 0 0 or!!, apply C.! 1 6 C.

A. Limits - L Hopitl s Rule Wht you re finding: L Hopitl s Rule is used to find limits of the form f ( x) lim where lim f x x! c g x ( ) = or lim f ( x) = limg( x) = ". ( ) x! c limg( x) = 0 x! c x! c

### MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

### Tests for the Ratio of Two Poisson Rates

Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

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

### ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between

### Continuous probability distributions

Chpter 1 Continuous probbility distributions 1.1 Introduction We cll x continuous rndom vrible in x b if x cn tke on ny vlue in this intervl. An exmple of rndom vrible is the height of dult humn mle, selected

### Non-Linear & Logistic Regression

Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

### Acceptance Sampling by Attributes

Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire

### MATH 174A: PROBLEM SET 5. Suggested Solution

MATH 174A: PROBLEM SET 5 Suggested Solution Problem 1. Suppose tht I [, b] is n intervl. Let f 1 b f() d for f C(I; R) (i.e. f is continuous rel-vlued function on I), nd let L 1 (I) denote the completion

### CLOSED EXPRESSIONS FOR COEFFICIENTS IN WEIGHTED NEWTON-COTES QUADRATURES

Filomt 27:4 (2013) 649 658 DOI 10.2298/FIL1304649M Published by Fculty of Sciences nd Mthemtics University of Niš Serbi Avilble t: http://www.pmf.ni.c.rs/filomt CLOSED EXPRESSIONS FOR COEFFICIENTS IN WEIGHTED

### Practice final exam solutions

University of Pennsylvni Deprtment of Mthemtics Mth 26 Honors Clculus II Spring Semester 29 Prof. Grssi, T.A. Asher Auel Prctice finl exm solutions 1. Let F : 2 2 be defined by F (x, y (x + y, x y. If

### USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year

1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.

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

### Synoptic Meteorology I: Finite Differences September Partial Derivatives (or, Why Do We Care About Finite Differences?

Synoptic Meteorology I: Finite Differences 16-18 September 2014 Prtil Derivtives (or, Why Do We Cre About Finite Differences?) With the exception of the idel gs lw, the equtions tht govern the evolution

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

### D01BBF NAG Fortran Library Routine Document

D01 Qudrture D01BBF NAG Fortrn Librry Routine Document Note. Before using this routine, plese red the Users Note for your implementtion to check the interprettion of bold itlicised terms nd other implementtion-dependent

### Jackson 2.26 Homework Problem Solution Dr. Christopher S. Baird University of Massachusetts Lowell

Jckson 2.26 Homework Problem Solution Dr. Christopher S. Bird University of Msschusetts Lowell PROBLEM: The two-dimensionl region, ρ, φ β, is bounded by conducting surfces t φ =, ρ =, nd φ = β held t zero

### Math 4200: Homework Problems

Mth 4200: Homework Problems Gregor Kovčič 1. Prove the following properties of the binomil coefficients ( n ) ( n ) (i) 1 + + + + 1 2 ( n ) (ii) 1 ( n ) ( n ) + 2 + 3 + + n 2 3 ( ) n ( n + = 2 n 1 n) n,

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

### Homework Solution - Set 5 Due: Friday 10/03/08

CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.

### Numerical Methods I. Olof Widlund Transcribed by Ian Tobasco

Numericl Methods I Olof Widlund Trnscribed by In Tobsco Abstrct. This is prt one of two semester course on numericl methods. The course ws offered in Fll 011 t the Cournt Institute for Mthemticl Sciences,

### l 2 p2 n 4n 2, the total surface area of the

Week 6 Lectures Sections 7.5, 7.6 Section 7.5: Surfce re of Revolution Surfce re of Cone: Let C be circle of rdius r. Let P n be n n-sided regulr polygon of perimeter p n with vertices on C. Form cone

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

### Chapter 2 Fundamental Concepts

Chpter 2 Fundmentl Concepts This chpter describes the fundmentl concepts in the theory of time series models In prticulr we introduce the concepts of stochstic process, men nd covrince function, sttionry

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

### Normal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution

Norml Distribution Lecture 6: More Binomil Distribution If X is rndom vrible with norml distribution with men µ nd vrince σ 2, X N (µ, σ 2, then P(X = x = f (x = 1 e 1 (x µ 2 2 σ 2 σ Sttistics 104 Colin

### PDE Notes. Paul Carnig. January ODE s vs PDE s 1

PDE Notes Pul Crnig Jnury 2014 Contents 1 ODE s vs PDE s 1 2 Section 1.2 Het diffusion Eqution 1 2.1 Fourier s w of Het Conduction............................. 2 2.2 Energy Conservtion.....................................

### 38.2. The Uniform Distribution. Introduction. Prerequisites. Learning Outcomes

The Uniform Distribution 8. Introduction This Section introduces the simplest type of continuous probbility distribution which fetures continuous rndom vrible X with probbility density function f(x) which

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

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

### Unit #10 De+inite Integration & The Fundamental Theorem Of Calculus

Unit # De+inite Integrtion & The Fundmentl Theorem Of Clculus. Find the re of the shded region ove nd explin the mening of your nswer. (squres re y units) ) The grph to the right is f(x) = -x + 8x )Use

### Calculus 2: Integration. Differentiation. Integration

Clculus 2: Integrtion The reverse process to differentition is known s integrtion. Differentition f() f () Integrtion As it is the opposite of finding the derivtive, the function obtined b integrtion is

### Improper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.

Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:

### BIFURCATIONS IN ONE-DIMENSIONAL DISCRETE SYSTEMS

BIFRCATIONS IN ONE-DIMENSIONAL DISCRETE SYSTEMS FRANCESCA AICARDI In this lesson we will study the simplest dynmicl systems. We will see, however, tht even in this cse the scenrio of different possible

### Using QM for Windows. Using QM for Windows. Using QM for Windows LEARNING OBJECTIVES. Solving Flair Furniture s LP Problem

LEARNING OBJECTIVES Vlu%on nd pricing (November 5, 2013) Lecture 11 Liner Progrmming (prt 2) 10/8/16, 2:46 AM Olivier J. de Jong, LL.M., MM., MBA, CFD, CFFA, AA www.olivierdejong.com Solving Flir Furniture

### 4.1. Probability Density Functions

STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of

### Ordinary Differential Equations- Boundary Value Problem

Ordinry Differentil Equtions- Boundry Vlue Problem Shooting method Runge Kutt method Computer-bsed solutions o BVPFD subroutine (Fortrn IMSL subroutine tht Solves (prmeterized) system of differentil equtions

### The Basic Functional 2 1

2 The Bsic Functionl 2 1 Chpter 2: THE BASIC FUNCTIONAL TABLE OF CONTENTS Pge 2.1 Introduction..................... 2 3 2.2 The First Vrition.................. 2 3 2.3 The Euler Eqution..................

### SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics

SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose

### Topic 1 Notes Jeremy Orloff

Topic 1 Notes Jerem Orloff 1 Introduction to differentil equtions 1.1 Gols 1. Know the definition of differentil eqution. 2. Know our first nd second most importnt equtions nd their solutions. 3. Be ble

### 2. VECTORS AND MATRICES IN 3 DIMENSIONS

2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

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

### 1 i n x i x i 1. Note that kqk kp k. In addition, if P and Q are partition of [a, b], P Q is finer than both P and Q.

Chpter 6 Integrtion In this chpter we define the integrl. Intuitively, it should be the re under curve. Not surprisingly, fter mny exmples, counter exmples, exceptions, generliztions, the concept of the

### Homework Assignment 3 Solution Set

Homework Assignment 3 Solution Set PHYCS 44 6 Ferury, 4 Prolem 1 (Griffiths.5(c The potentil due to ny continuous chrge distriution is the sum of the contriutions from ech infinitesiml chrge in the distriution.

### MATH 409 Advanced Calculus I Lecture 19: Riemann sums. Properties of integrals.

MATH 409 Advnced Clculus I Lecture 19: Riemnn sums. Properties of integrls. Drboux sums Let P = {x 0,x 1,...,x n } be prtition of n intervl [,b], where x 0 = < x 1 < < x n = b. Let f : [,b] R be bounded

### Numerical Methods in Economics

Numericl Methods in Economics Alexis Akir Tod November 5, 07 Polynomil interpoltion Polynomils re gret becuse we cn differentite nd integrte them very esily. Since degree n polynomil is determined by n

### MATH 222 Second Semester Calculus. Fall 2015

MATH Second Semester Clculus Fll 5 Typeset:August, 5 Mth nd Semester Clculus Lecture notes version. (Fll 5) This is self contined set of lecture notes for Mth. The notes were written by Sigurd Angenent,

### A Convergence Theorem for the Improper Riemann Integral of Banach Space-valued Functions

Interntionl Journl of Mthemticl Anlysis Vol. 8, 2014, no. 50, 2451-2460 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/ijm.2014.49294 A Convergence Theorem for the Improper Riemnn Integrl of Bnch

### Math 324 Course Notes: Brief description

Brief description These re notes for Mth 324, n introductory course in Mesure nd Integrtion. Students re dvised to go through ll sections in detil nd ttempt ll problems. These notes will be modified nd

### MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

### Distance And Velocity

Unit #8 - The Integrl Some problems nd solutions selected or dpted from Hughes-Hllett Clculus. Distnce And Velocity. The grph below shows the velocity, v, of n object (in meters/sec). Estimte the totl

### Week 7 Riemann Stieltjes Integration: Lectures 19-21

Week 7 Riemnn Stieltjes Integrtion: Lectures 19-21 Lecture 19 Throughout this section α will denote monotoniclly incresing function on n intervl [, b]. Let f be bounded function on [, b]. Let P = { = 0

### x ) dx dx x sec x over the interval (, ).

Curve on 6 For -, () Evlute the integrl, n (b) check your nswer by ifferentiting. ( ). ( ). ( ).. 6. sin cos 7. sec csccot 8. sec (sec tn ) 9. sin csc. Evlute the integrl sin by multiplying the numertor

### Problem. Statement. variable Y. Method: Step 1: Step 2: y d dy. Find F ( Step 3: Find f = Y. Solution: Assume

Functions of Rndom Vrible Problem Sttement We know the pdf ( or cdf ) of rndom r vrible. Define new rndom vrible Y = g. Find the pdf of Y. Method: Step : Step : Step 3: Plot Y = g( ). Find F ( y) by mpping

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