Quadrature – Concepts (numerical integration) Don Allen.

Slides:



Advertisements
Similar presentations
Prof. Muhammad Saeed ( Differentiation and Integration )
Advertisements

Numerical Integration
1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.
Computational Methods in Physics PHYS 3437
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
Numerical Integration of Functions
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
Chapter 7 Numerical Differentiation and Integration
11. Numerical Differentiation and Integration 11
Today’s class Romberg integration Gauss quadrature Numerical Methods
Lecture 18 - Numerical Differentiation
Numerical Integration
Newton-Cotes Integration Formula
MANE 4240 & CIVL 4240 Introduction to Finite Elements Numerical Integration in 1D Prof. Suvranu De.
Chapter 5 Numerical Differentiation and Integration.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 29 Numerical Integration.
Numerical integration continued --- Simpson’s rules - We can add more segments OR - We can use a higher order polynomial.
Chapter 17 Numerical Integration Formulas. Graphical Representation of Integral Integral = area under the curve Use of a grid to approximate an integral.
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.
Simpson’s 1/3 rd Rule of Integration. What is Integration? Integration The process of measuring the area under a.
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.
Engineering Analysis ENG 3420 Fall 2009
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
Today’s class Numerical Integration Newton-Cotes Numerical Methods
3. Numerical integration (Numerical quadrature) .
MECN 3500 Inter - Bayamon Lecture Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
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.
Numerical Differential & Integration. Introduction If a function f(x) is defined as an expression, its derivative or integral is determined using analytical.
1 Simpson’s 1/3 rd Rule of Integration. 2 What is Integration? Integration The process of measuring the area under a curve. Where: f(x) is the integrand.
Introduction to Numerical Analysis I
4.6 Numerical Integration Trapezoid and Simpson’s Rules.
Lecture 22 - Exam 2 Review CVEN 302 July 29, 2002.
EE3561_Unit 7Al-Dhaifallah EE 3561 : Computational Methods Unit 7 Numerical Integration Dr. Mujahed AlDhaifallah ( Term 342)
Integration Copyright © Cengage Learning. All rights reserved.
5.1.  When we use the midpoint rule or trapezoid rule we can actually calculate the maximum error in the calculation to get an idea how much we are off.
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
Numerical Integration
Use of Newton-Cotes Formulas and eventual shortcomings Matlab code to increase number of segments with trapezoid, 1/3 and 3/8 rule.
Techniques for Numerical Integration
Introduction to Numerical Analysis I
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.
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.
NUMERICAL DIFFERENTIATION Forward Difference Formula
Chapter 7 Numerical Differentiation and Integration
Two-Point Gaussian Quadrature Rule
Chapter 23.
Chapter 7 Numerical Differentiation and Integration
NUMERICAL INTEGRATION
Two-Point Gaussian Quadrature Rule
Numerical Integration:
Copyright © Cengage Learning. All rights reserved.
Numerical Computation and Optimization
MATH 174: NUMERICAL ANALYSIS I
ANSWER THE FOLLOWING BRIEFLY BUT COMPREHENSIVELY.
Numerical Integration
Numerical Integration
Presentation transcript:

Quadrature – Concepts (numerical integration) Don Allen

Principles Quadrature Methods - Types – Points are given – Newton-Cotes – Points are selected – Gaussian – Romberg – To extrapolate to better estimates – Adaptive – Predicting exactness from error Error formulas Composite forms

Newton-Cotes Includes Trapezoidal and Simpson’s rules. Based on polynomial interpolation of select points. – Usually equally spaced points. – Can be as the data as determined from practice. Error computed from errors of approximation Composite forms involve repeated application over select series of points.

Gaussian Quadrature Based on the question: What points can be selected to make the method exact for the maximum order of polynomials. Points must be computed beforehand. These are the (numerical) solutions of certain polynomial equations. Composite forms involve repeated application over select series of points.

Romberg method Based on a precise knowledge of the error formula. Uses the ideas of Richardson’s extrapolation. The idea is that we use the method for step size h, h/2, h/4, etc until the approximation is quite good.

Adaptive Methods Two different methods are employed over the same interval. One method is of higher order than the other. The play is to use the higher order method as exact to determine the approximation value of the lower order method. Composite forms involve repeated application over select series of points.