1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.

Slides:



Advertisements
Similar presentations
Computational Methods in Physics PHYS 3437
Advertisements

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.
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
Numerical Integration of Functions
Chapter 7 Numerical Differentiation and Integration
Revisiting Numerical Integration: Getting More from Fewer Points Asilomar - December 2007 Bruce Cohen Lowell High School, SFUSD
Today’s class Romberg integration Gauss quadrature Numerical Methods
Lecture 18 - Numerical Differentiation
Numerical Integration
ECIV 720 A Advanced Structural Mechanics and Analysis
Lecture 3: Integration. Integration of discrete functions
MANE 4240 & CIVL 4240 Introduction to Finite Elements Numerical Integration in 1D Prof. Suvranu De.
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.
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
Integration. Problem: An experiment has measured the number of particles entering a counter per unit time dN(t)/dt, as a function of time. The problem.
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.
Integrals 5.
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
3. Numerical integration (Numerical quadrature) .
Lecture 19 - Numerical Integration CVEN 302 July 22, 2002.
Numerical Computation
MAT 1235 Calculus II Section 7.7 Approximate (Numerical) Integration
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
Chapter 7 – Techniques of 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)
Integration Copyright © Cengage Learning. All rights reserved.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 22.
Chap. 11 Numerical Differentiation and Integration
Remainder Theorem. The n-th Talor polynomial The polynomial is called the n-th Taylor polynomial for f about c.
Use of Newton-Cotes Formulas and eventual shortcomings Matlab code to increase number of segments with trapezoid, 1/3 and 3/8 rule.
6. Numerical Integration 6.1 Definition of numerical integration. 6.2 Reasons to use numerical integration. 6.3 Formulas of numerical Integration. 6.4.
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.
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.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 20 Numerical Integration of Functions.
Chapter 4, Integration of Functions
NUMERICAL DIFFERENTIATION Forward Difference Formula
Clicker Question 1 What is ? A. x tan(x2) + C
Midpoint and Trapezoidal Rules
Numerical Analysis Lecture 42.
Chapter 22.
Two-Point Gaussian Quadrature Rule
Chapter 23.
Chapter 7 Numerical Differentiation and Integration
NUMERICAL INTEGRATION
Copyright © Cengage Learning. All rights reserved.
Composite Numerical Integration
Two-Point Gaussian Quadrature Rule
Elements of Numerical Integration
Copyright © Cengage Learning. All rights reserved.
Numerical Computation and Optimization
Numerical Integration of Functions
Numerical Integration
Objectives Approximate a definite integral using the Trapezoidal Rule.
Chapter 5 Integration.
Numerical Integration
Chapter 4, Integration of Functions
Elements of Numerical Integration
Presentation transcript:

1 Chapter 5 Numerical Integration

2 A Review of the Definite Integral

3 Riemann Sum  A summation of the form is called a Riemann sum.

4 5.2 Improving the Trapezoid Rule  The trapezoid rule for computing integrals:  The error:

5 5.2 Improving the Trapezoid Rule  So that  Therefore,  Error estimation:  Improvement of the approximation: the corrected trapezoid rule

6 Example 5.1

7 Example 5.2

8 h4h4

9 Approximate Corrected Trapezoid Rule

10

Simpson’s Rule and Degree of Precision

12 let

13

14 Example 5.3

15

16 The Composite Rule Assume Example 5.4

17

18 Example 5.5 h4h4 It’s OK!!

19 Discussion  From our experiments:  From the definition of Simpson’s rule:  Why? Why Simpson’s rule is “more accurate than it ought to be”?

20

21

22

23

24 Example 5.6

The Midpoint Rule  Consider the integral:  And the Taylor approximation:  The midpoint rule:  Its composite rule: because

26

27

28 Example 5.7

29

30

Application: Stirling’s Formula  Stirling’s formula is an interesting and useful way to approximate the factorial function, n!, for large values of n. Use Stirling ’ s formula to show that for all x. Example

Gaussian Quadrature  Gaussian quadrature is a very powerful tool for approximating integrals.  The quadrature rules are all base on special values of weights and abscissas (called Gauss points)  The quadrature rule is written in the form weights Gauss points

33

34 Example 5.8

35 Question k ×

36 Discussion  The high accuracy of Gaussian quadrature then comes from the fact that it integrates very-high-degree polynomials exactly.  We should choose N=2n-1, because a polynomial of degree 2n-1 has 2n coefficients, and thus the number of unknowns ( n weights plus n abscissas) equals the number of equations.  Taking N=2n will yield a contradiction.

37 Only to find an example

38

39 Finding Gauss Points

40 Theorem 5.3

41 Theorem 5.4

42

43 Other Intervals, Other Rules

44 Example 5.9 Table 5.5

45 Error estimation!! See exercise!!

46 Example 5.10

47

Extrapolation Methods  One of the most important ideas in computational mathematics is— We can take the information from a few approximations and Use that to both estimate the error in the approximation and generate a significantly improved approximation  In this section we will embark on a more detailed study of some of these ideas.

49 Approximation

50 Estimating p

51 Example 5.11

52

53 Example 5.12

54

55 Error Estimation and an Improved Approximation I2n-InI2n-In

56 Example 5.13

57 Example 5.14 O(h 2 ): Error of trapezoid rule O(h 4 ): Error of Richardson extrapolation