| Numerical Integration |
Article Index for Numerical |
Shopping Integration |
Website Links For Numerical Integration |
Information AboutNumerical Integration |
| CATEGORIES ABOUT NUMERICAL INTEGRATION | |
| numerical analysis | |
| numerical integrationnumerical analysis | |
| numerical integration | |
| numerical analysis | |
| integration | |
| integral calculus | |
|
In Numerical Analysis , numerical integration constitutes a broad family of algorithms for calculating the numerical value of a definite Integral , and by extension, the term is also sometimes used to describe the Numerical Solution Of Differential Equations . This article focuses on calculation of definite integrals. The term '''quadrature''' is more or less a synonym for ''numerical integration'', especially as applied to one-dimensional integrals. Two-dimensional integration is sometimes described as '''cubature''', although this term is much less frequently used and the meaning of ''quadrature'' is understood for higher dimensional integration as well. The basic problem considered by numerical integration is to compute an approximate solution to a definite integral: : If ''f''(''x'') is a smooth well-behaved function and the limits of integration are fixed, the method of Gaussian Quadrature is very effective. In general, this problem can also be stated as an Initial Value Problem for an Ordinary Differential Equation , as follows. : Finding ''y''(''b'') is equivalent to computing the integral. Methods developed for ordinary differential equations, such as the Runge-Kutta Method , can be applied to the restated problem. In the remainder of this article, we shall discuss methods developed specifically for the problem stated as a definite integral. REASONS FOR NUMERICAL INTEGRATION There are several reasons for carrying out numerical integration. The integrand ''f'' may be known only at certain points, such as obtained by Sampling . Some Embedded Systems and other computer applications may need numerical integration for this reason. A formula for the integrand may be known, but it may be difficult or impossible to find an Antiderivative . An example of such an integrand is exp(-''t''2). It may be possible to find an antiderivative symbolically, but it may be easier to compute a numerical approximation than to compute the antiderivative. That may be the case if the antiderivative is given as an infinite series or product, or if its evaluation requires a Special Function which is not available. METHODS FOR ONE-DIMENSIONAL INTEGRALS Numerical integration methods can generally be described as combining evaluations of the integrand to get an approximation to the integral. An important part of the analysis of any numerical integration method is to study the behavior of the approximation error as a function of the number of integrand evaluations. A method which yields a small error for a small number of evaluations is usually considered superior. Reducing the number of evaluations of the integrand reduces the number of arithmetic operations involved, and therefore reduces the total Round-off Error . Also, each evaluation takes time, and the integrand may be arbitrarily complicated. It should be noted, however, that a 'brute force' kind of numerical integration can be done, if the integrand is reasonably well behaved (i.e. continuous), by evaluating the integrand with very small increments. Quadrature rules based on interpolating functions A large class of quadrature rules can be derived by constructing Interpolating functions which are easy to integrate. Typically these interpolating functions are Polynomial s. The simplest method of this type is to let the interpolating function be a constant function (a polynomial of order zero) which passes through the point ((''a''+''b'')/2, ''f''((''a''+''b'')/2)). This is called the ''midpoint rule'' or ''rectangle rule''. : The interpolating function may be an Affine Function (a polynomial of degree 1) which passes through the points (''a'', ''f''(''a'')) and (''b'', ''f''(''b'')). This is called the '' Trapezoidal Rule ''. : For either one of these rules, we can make a more accurate approximation by breaking up the interval ''b'' into some number ''n'' of subintervals, computing an approximation for each subinterval, then adding up all the results. This is called a ''composite rule'', ''extended rule'', or ''iterated rule''. For example, the composite trapezoidal rule can be stated as : where the subintervals have the form ''h'', (''k''+1) ''h'' , with ''h'' = (''b''-''a'')/''n'' and ''k'' = 0, 1, 2, ..., ''n''-1. Interpolation with polynomials evaluated at equally-spaced points in ''b'' yields the Newton-Cotes Formulas , of which the rectangle rule and the trapezoidal rule are examples. Simpson's Rule , which is based on a polynomial of order 2, is also a Newton-Cotes formula. If we allow the intervals between interpolation points to vary, we find another group of quadrature formulas, called Gaussian Quadrature formulas. A Gaussian quadrature rule is typically more accurate than a Newton-Cotes rule which requires the same number of function evaluations, if the integrand is smooth (i.e., if it has many Derivative s.) Adaptive algorithms If ''f'' does not have many derivatives at all points, or if the derivatives become large, then Gaussian quadrature is often insufficient. In this case, an algorithm similar to the following will perform better: // This algorithm calculates the definite integral of a function // from 0 to 1, adaptively, by choosing smaller steps near // problematic points. // Set initial_h to the initial step size. x:=0 h:=initial_h accumulator:=0 WHILE x<1.0 DO IF x+h>1.0 THEN h=1.0-x END IF IF error from quadrature over {Link without Title} for f is too large THEN Make h smaller ELSE accumulator:=accumulator + quadrature of f over {Link without Title} x:=x+h IF error from quadrature over {Link without Title} is very small THEN Make h larger END IF END IF END WHILE RETURN accumulator Some details of the algorithm require careful thought. For many cases, estimating the error from quadrature over an interval for a function f isn't obvious. One popular solution is to use two different rules of quadrature, and use their difference as an estimate of the error from quadrature. The other problem is deciding what "too large" or "very small" signify. A possible criterion for "too large" is that the quadrature error should not be larger than ''th'' where t, a real number, is the tolerance we wish to set for global error. Then again, if h is already tiny, it may not be worthwhile to make it even smaller even if the quadrature error is apparently large. This type of error analysis is usually called "a posteriori" since we compute the error after having computed the approximation. Heuristics for adaptive quadrature are discussed by Forsythe et al. (Section 5.4). Extrapolation methods The accuracy of a quadrature rule of the Newton-Cotes type is generally a function of the number of evaluation points. The result is usually more accurate as number of evaluation points increases, or, equivalently, as the width of the step size between the points decreases. It is natural to ask what the result would be if the step size were allowed to approach zero. This can be answered by extrapolating the result from two or more nonzero step sizes (see Richardson Extrapolation ). The extrapolation function may be a Polynomial or Rational Function . Extrapolation methods are described in more detail by Stoer and Bulirsch (Section 3.4). Conservative (a priori) error estimation Let ''f'' have a bounded first derivative over {Link without Title} . The Mean Value Theorem for ''f'', where , gives : for some ''yx'' in {Link without Title} depending on ''x''. If we integrate in ''x'' from ''a'' to ''b'' on both sides and the take absolute values, we obtain | ||
| \left \int_a^b (x - a) f'(y_x)\, dx
ight</math> |
|
|