Trapezium rule

Trapezium rule

In mathematics, the trapezium rule (the British term) or trapezoidal rule (the American term) is a way to approximately calculate the definite integral

: int_{a}^{b} f(x),dx. The trapezium rule works by approximating the region under the graph of the functionf(x) by a trapezium and calculating its area. It follows that

: int_{a}^{b} f(x), dx approx (b-a)frac{f(a) + f(b)}{2}.

To calculate this integral more accurately, one first splits the interval of integration [a, b] into "n" smaller subintervals, and then applies the trapezium rule on each of them. One obtains the "composite trapezium rule":

:int_a^b f(x),dx approx frac{b-a}{n} left [ {f(a) + f(b) over 2} + sum_{k=1}^{n-1} f left( a+k frac{b-a}{n} ight) ight] .

This can alternatively be written as:

:int_a^b f(x),dx approx frac{b-a}{2n} left(f(x_0) + 2f(x_1) + 2f(x_2)+cdots+2f(x_{n-1}) + f(x_n) ight)

where

: x_k=a+k frac{b-a}{n}, for k=0, 1, dots, n (one can also use a non-uniform grid).

The trapezium rule is one of a family of formulas for numerical integration called Newton–Cotes formulas.
Simpson's rule is another, often more accurate, member of the same family. Simpson's rule and other like methods can be expected to improve on the trapezium rule for functions which are twice continuously differentiable; however for rougher functions the trapezium rule is likely to prove preferable. Moreover, the trapezium rule tends to become extremely accurate when periodic functions are integrated over their periods, a fact best understood in connection with the Euler–Maclaurin summation formula. For non-periodic functions, however, methods with unequally spaced points such as Gaussian quadrature and Clenshaw–Curtis quadrature are generally far more accurate.

An advantage of the trapezium rule is that the sign of the error of the approximation is easily known. An integral approximated with this rule on a concave-up function will be an overestimate because the trapezoids include all of the area under the curve and extend over it. Using this method on a concave-down function yields an underestimate because area is unaccounted for under the curve, but none is counted above. If the interval of the integral being approximated includes an inflection point, then the error is harder to identify.

ee also

* Simpson's rule
* Romberg integration
* Newton–Cotes formulas

References

*
* [http://numericalmethods.eng.usf.edu/topics/trapezoidal_rule.html Trapezoidal Rule of Integration - Notes, PPT, Mathcad, Maple, Mathematica, Matlab] at "Holistic Numerical Methods Institute"

External links

* [http://math.fullerton.edu/mathews/n2003/TrapezoidalRuleMod.html Trapezoidal Rule for Numerical Integration]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Trapezoidal rule — This article is about the quadrature rule for approximating integrals. For the Explicit trapezoidal rule for solving initial value problems, see Heun s method. The function f(x) (in blue) is approximated by a linear function (in red). In… …   Wikipedia

  • List of calculus topics — This is a list of calculus topics.Note: the ordering of topics in sections is a suggestion to students.Before calculus (precalculus)*Graph of a function *Linear function *Secant *Slope *Tangent *Concavity *Finite difference *Radian *Factorial… …   Wikipedia

  • Romberg's method — In numerical analysis, Romberg s method Harv|Romberg|1955 generates a triangular array consisting of numerical estimates of the definite integral: int a^b f(x) , dx by using Richardson extrapolation Harv|Richardson|1910 repeatedly on the… …   Wikipedia

  • Integral — This article is about the concept of integrals in calculus. For the set of numbers, see integer. For other uses, see Integral (disambiguation). A definite integral of a function can be represented as the signed area of the region bounded by its… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie …   Wikipedia

  • Richardson extrapolation — In numerical analysis, Richardson extrapolation is a sequence acceleration method, used to improve the rate of convergence of a sequence. It is named after Lewis Fry Richardson, who introduced the technique in the early 20th century. [cite… …   Wikipedia

  • Numerical differentiation — is a technique of numerical analysis to produce an estimate of the derivative of a mathematical function or function subroutine using values from the function and perhaps other knowledge about the function. Contents 1 Finite difference formulae 1 …   Wikipedia

  • Procedural parameter — In computing, a procedural parameter is a parameter of a procedure that is itself a procedure.This concept is an extremely powerful and versatile programming tool, because it allows programmers to modify certain steps of a library procedure in… …   Wikipedia

  • Matrix function — In mathematics, a matrix function is a function which maps a matrix to another matrix. Contents 1 Extending scalar functions to matrix functions 1.1 Power series 1.2 Jordan decomposition …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”