Trapezoid Method and Iteration & Acceleration

Slides:



Advertisements
Similar presentations
Adguary Calwile Laura Rogers Autrey~ 2nd Per. 3/14/11
Advertisements

A Riemann sum is a method for approximating the total area underneath a curve on a graph. This method is also known as taking an integral. There are 3.
5/16/2015 Perkins AP Calculus AB Day 5 Section 4.2.
Section 5.7 Numerical Integration. Approximations for integrals: Riemann Sums, Trapezoidal Rule, Simpson's Rule Riemann Sum: Trapezoidal Rule: Simpson’s.
Numerical Integration Romberg Extrapolation. Acceleration The term acceleration is a term sometimes used in numerical analysis that refers to how you.
Today’s class Romberg integration Gauss quadrature Numerical Methods
Lecture 3: Integration. Integration of discrete functions
Numerical Integration Midpoint Integration. Numerical Integration The problem of finding a value for certain integrals is one of the first problems that.
Numerical Integration Simpson’s Method. Trapezoid Method & Polygonal Lines One way to view the trapezoid method for integration is that the curves that.
Area of a single trapezoid = h
Numerical Integration Approximating Definite Integral.
Automatic Integration
Numerical Computation
4.6 Numerical Integration Trapezoid and Simpson’s Rules.
4.6 Numerical Integration. The Trapezoidal Rule One method to approximate a definite integral is to use n trapezoids.
Trapezoidal Approximation Objective: To find area using trapezoids.
5.2 Definite Integrals. Subintervals are often denoted by  x because they represent the change in x …but you all know this at least from chemistry class,
Section 5.2: Definite Integrals
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Numerical Differentiation and Integration ~ Integration.
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.
Riemann Sums, Trapezoidal Rule, and Simpson’s Rule Haley Scruggs 1 st Period 3/7/11.
In this section, we will investigate how to estimate the value of a definite integral when geometry fails us. We will also construct the formal definition.
Definite Integrals Riemann Sums and Trapezoidal Rule.
5.5 The Trapezoidal Rule. I. Trapezoidal Rule A.) Area of a Trapezoid -
Section 3.2 – Calculating Areas; Riemann Sums
X01234 f(x)f(x) AP Calculus Unit 5 Day 5 Integral Definition and intro to FTC.
Definite Integral df. f continuous function on [a,b]. Divide [a,b] into n equal subintervals of width Let be a sample point. Then the definite integral.
Definite Integrals & Riemann Sums
Quadrature – Concepts (numerical integration) Don Allen.
[5-4] Riemann Sums and the Definition of Definite Integral Yiwei Gong Cathy Shin.
Average Value of a Function. Let’s get started: You already know how to take the average of some finite set. The "mean" is the "average" you're used to,
Application of the Integral
Numerical Integration
Lesson 46 – Area Under the Curve – Riemann Sums
High Accuracy Differentiation Formulas
Chapter 7 Numerical Differentiation and Integration
Clicker Question 1 What is ? A. x tan(x2) + C
MTH1170 Numeric Integration
Lesson 47 - Area under Curves as Limits and Sums
Riemann Sums Approximate area using rectangles
5.1 – Estimating with Finite Sums
5. 7a Numerical Integration. Trapezoidal sums
Even/Odd Functions 5.5.
Lesson 48 – Area Between Curves
Section 3.2 – Calculating Areas; Riemann Sums
Integral as Net Change Chapter 8.1.
Integration & Area Under a Curve
Chapter 23.
Accumulation AP Calculus AB Days 11-12
Copyright © Cengage Learning. All rights reserved.
Accumulation AP Calculus AB Day 13
5. 7a Numerical Integration. Trapezoidal sums
Ch. 6 – The Definite Integral
Copyright © Cengage Learning. All rights reserved.
Section 5.2 Definite Integrals.
4.3 Day 1 Exit Ticket for Feedback
Section 3.2 – Calculating Areas; Riemann Sums
Area & Volume Chapter 6.1 & 6.2 February 20, 2007.
Applications of Integration
Numerical Integration of Functions
Numerical Integration
Objectives Approximate a definite integral using the Trapezoidal Rule.
Romberg Rule of Integration
Jay James Mike Norton Stephen Nesemann Kaitlyn Richardson
Symbolic Integral Notation
Numerical Computation and Optimization
Copyright © Cengage Learning. All rights reserved.
Romberg Rule of Integration
Presentation transcript:

Trapezoid Method and Iteration & Acceleration

Trapezoid Method The trapezoid method is a way to approximate an integral. It approximates the curve by a polygonal line and computes the area formed by the trapezoids where lines are dropped perpendicular down to the x-axis from each of the connecting points. f(x) f(x) b b Area approximated using 2 trapezoids. Area: Area approximated using 4 trapezoids. Area: This is A2 for [0,b] This is A3 for [0,b]

In general any set of points that partition the interval [a,b] can be used as a trapezoidal approximation. We are going to use certain types of partitions that will make the calculation easier. In the partitions we say on the previous slide all had the points equally spaced. This results in the following convention for the trapezoid approximation with n trapezoids. Add up all the function values in the partition multiplied by 2 except for the a and the b, the multiply by the width of each partition and ½. This will calculate the areas of the trapezoid under the curves. Iteration An iterative method generates a sequence of approximations to an answer. Each time you generate an approximation this is called an iteration.

Acceleration The term acceleration is a term used in numerical analysis that refers to how you can improve the results of an iterative algorithm by applying another algorithm to it. In the example we use here we can show how we can use the results of the trapezoid method to improve (give a more accurate estimate of the integral) how quickly it arrives at the answer in terms of the number of calculations that need to be performed. The example of acceleration I will show you is called an extrapolation method (specific case of Richardson extrapolation). Define a sequence of values Ai where: A1 = Trapezoid method with 1 partition (i.e. ½(b-a)(f(a)+f(b)) A2 = Trapezoid method with 2 partitions A3 = Trapezoid method with 4 partitions A4 = Trapezoid method with 8 partitions Each Ai calculation is considered an iteration.

Now we define sequences of values (B1,B2,B3,…),(C1,C2,C3,…),…