3. Numerical integration (Numerical quadrature) .

Slides:



Advertisements
Similar presentations
Numerical Integration
Advertisements

ES 240: Scientific and Engineering Computation. Chapter 17: Numerical IntegrationIntegration  Definition –Total area within a region –In mathematical.
1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.
Computational Methods in Physics PHYS 3437
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Section 5.7 Numerical Integration. Approximations for integrals: Riemann Sums, Trapezoidal Rule, Simpson's Rule Riemann Sum: Trapezoidal Rule: Simpson’s.
Numerical Integration of Functions
NUMERICAL DIFFERENTIATION AND INTEGRATION
Chapter 7 Numerical Differentiation and Integration
Today’s class Romberg integration Gauss quadrature Numerical Methods
2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.
Lecture 18 - Numerical Differentiation
Numerical Integration
Lecture 3: Integration. Integration of discrete functions
MANE 4240 & CIVL 4240 Introduction to Finite Elements Numerical Integration in 1D Prof. Suvranu De.
CHAPTER 4 THE DEFINITE INTEGRAL.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 29 Numerical Integration.
Chapter 17 Numerical Integration Formulas. Graphical Representation of Integral Integral = area under the curve Use of a grid to approximate an integral.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 22 Integration of Equations.
Numerical Integration
NUMERICAL DIFFERENTIATION The derivative of f (x) at x 0 is: An approximation to this is: for small values of h. Forward Difference Formula.
CISE301_Topic7KFUPM1 SE301: Numerical Methods Topic 7 Numerical Integration Lecture KFUPM Read Chapter 21, Section 1 Read Chapter 22, Sections 2-3.
CISE301_Topic71 SE301: Numerical Methods Topic 7 Numerical Integration Lecture KFUPM (Term 101) Section 04 Read Chapter 21, Section 1 Read Chapter.
Quadrature Greg Beckham. Quadrature Numerical Integration Goal is to obtain the integral with as few computations of the integrand as possible.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Numerical Differentiation and Integration Part 6 Calculus.
19.5 Numeric Integration and Differentiation
Chapter 4, Integration of Functions. Open and Closed Formulas x 1 =a x 2 x 3 x 4 x 5 =b Closed formula uses end points, e.g., Open formulas - use interior.
Numerical Integration In general, a numerical integration is the approximation of a definite integration by a “weighted” sum of function values at discretized.
Lecture 28: Comparison of different numerical integrators 1.Adaptive Simpson’s and Trapezoid Rules 2. Romberg Integration 3. Adaptive Gaussian Quadrature.
Chapter 4 Numerical Differentiation and Integration 1/16 Given x 0, approximate f ’(x 0 ). h xfhxf xf h )()( lim)('    x0x0 x1x1 h x1x1 x0x0.
1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.
Automatic Integration
Lecture 19 - Numerical Integration CVEN 302 July 22, 2002.
Numerical Computation
1 Chapter 7 NUMERICAL INTEGRATION. 2 PRELIMINARIES We use numerical integration when the function f(x) may not be integrable in closed form or even in.
1 Numerical Analysis Lecture 12 Numerical Integration Dr. Nader Okasha.
Chapters 5 and 6: Numerical Integration
4.6 Numerical Integration Trapezoid and Simpson’s Rules.
MA2213 Lecture 4 Numerical Integration. Introduction Definition is the limit of Riemann sums I(f)
 Finding area of polygonal regions can be accomplished using area formulas for rectangles and triangles.  Finding area bounded by a curve is more challenging.
EE3561_Unit 7Al-Dhaifallah EE 3561 : Computational Methods Unit 7 Numerical Integration Dr. Mujahed AlDhaifallah ( Term 342)
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 22.
5. Integration 2.Quadrature as Box Counting 3.Algorithm: Trapezoid Rule 4.Algorithm: Simpson’s Rule 5.Integration Error 6.Algorithm: Gaussian Quadrature.
Chap. 11 Numerical Differentiation and Integration
Techniques for Numerical Integration
1/7  4.6 Adaptive Quadrature Methods Chapter 4 Numerical Differentiation and Integration -- Adaptive Quadrature Methods   /2  /4  /8 Predict the.
The purpose of Chapter 5 is to develop the basic principles of numerical integration Usefule Words integrate, integral 积分(的), integration 积分(法), quadrature.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 5 Integration and Differentiation.
SE301_Topic 6Al-Amer20051 SE301:Numerical Methods Topic 6 Numerical Integration Dr. Samir Al-Amer Term 053.
Clicker Question 1 What is ? (Hint: u-sub) – A. ln(x – 2) + C – B. x – x 2 + C – C. x + ln(x – 2) + C – D. x + 2 ln(x – 2) + C – E. 1 / (x – 2) 2 + C.
Quadrature – Concepts (numerical integration) Don Allen.
Chapter 4, Integration of Functions
NUMERICAL DIFFERENTIATION Forward Difference Formula
Numerical Analysis Lecture 42.
Chapter 22.
Integration with Unequal Segments
The Area Question and the Integral
Composite Numerical Integration
4.3 Elements of Numerical Integration
Numerical Integration:
Summation Formulas Constant Series.
Numerical Computation and Optimization
SKTN 2393 Numerical Methods for Nuclear Engineers
Objectives Approximate a definite integral using the Trapezoidal Rule.
Numerical Integration
Chapter 4, Integration of Functions
Elements of Numerical Integration
Presentation transcript:

3. Numerical integration (Numerical quadrature) . Given the continuous function f(x) on [a,b], approximate Newton-Cotes Formulas: For the given abscissas, approximate the integral I(f) by the integral of interpolating formula with degree n, I(pn) . Formulas that use end points a, and b as data points are called closed formulas. Those not use the end points called open (semi-open) formulas.

Newton-Cotes formula for with equally spaced abscissas . Rectangle rule Mid point rule. Trapezoidal rule Simpson’s rule Simpson’s 3/8 rule Bode’s rule Rectangle and Mid point rules are the (semi-)open formulas. Definition: Degree of Precision (or Accuracy) of a quadrature rule In(f) is the positive integer D, if I(xk) = In(xk) for the degree k · D, and I(xk) ¹ In(xk) for the degree k = D + 1.

Closed Newton-Cotes formula of degree D=n=8. Weights wi contain some negative coefficients. This thorem suggests that the higher order Newton-Cotes formula wouldn’t be useful for practical numerical computations. Piecewise ! composite rules. Optimize data points ! A family of Gauss formulas.

Theorem: (The error associated with Newton-Cotes formulas.) For Newton-Cotes formula with n+1 abscissas (open or closed) a) For even n, and f(x)2 C(n+2)(a,b), 9 x2(a,b) such that, b) For odd n, and f(x)2 C(n+1)(a,b), 9 x2(a,b) such that, n=even cases are generally better in the degree of precision. Constants c, c’ depend on n and type of formula open or closed. For a given n, c of the closed formulas are typically smaller than the open formula. The closed formulas are more used in practice. If the function has a singularity at the end point, open formulas can be useful.

Theorem: (Weighted Mean-Value Theorem for Integrals.) Exc. 3-1) Prove this. The above theorem is used to determine the error of a Newton_Cotes formula. Ex) Trapezoidal formula.

Exc. 3-2) Verify Boole’s rule using an algebraic computing software. Exc. 3-3) Derive the error term for the Simplson’s rule using the interpolation error formula, Exc 3-4) Derive the error term for the mid-point rule and Simpson’s rule. Exc 3-5) Derive the error associated with Newton-Cotes formulas.

Extended (composite, compound) formula. Trapezoidal formula Simpson formula

For the composite trapezoidal rule, Theorem: (Euler-Maclaurin Sum Formula). If the f(x) has odd derivatives that are equal at the end points of interval [a,b], such as a periodic function on [a,b], the composite trapezoidal rule becomes more accurate. (Also extended mid-point rule.)

Romberg integration. Extrapolation applied to the composite trapezoidal rule. Euler-Maclaurin summation formula, Romberg approximations is written Rk,j , Level of extrapolation   Step size Exc 3-6) Using Romberg integration, calculate the definite integral and estimate the error up to R4,4 .

Gaussian quadratures. Approximating the integral in the form, optimize the location of data points and the associated weights, in the way that the integrals of polynomials have exact value, (From 2 n parameters wi and xi , a quadrature formula with the degree of precision 2n-1 can be constructed at best.)

Exc 3-7) Prove the above theorem.

Exc 3-8) Prove the above theorem. hint) show the following facts.

Exc 3-9) Try some of the above. More topics for the numerical integration. Higher precision integration formulas. ex) IMT type formula, (DE formula.) Integration of improper integrals. (i.e. infinite integral region, or discontinuity of integrand.) Integration of multivariate functions. ex) Monte-Carlo. Multivariate Gauss formulas.