In applied mathematics, adaptive quadrature is a process in which the integral of a function $f\left(x\right)$ is approximated using static quadrature rules on adaptively refined subintervals of the integration domain. Generally, adaptive algorithms are just as efficient and effective as traditional algorithms for "well-behaved" integrands, but are also effective for "badly-behaved" integrands for which traditional algorithms fail.

General scheme

1. procedure integrate ( f , a , b , tau ) 2. $Q approx int_a^bf\left(x\right),mbox\left\{d\right\}x$ 3. $varepsilon approx left|Q - int_a^bf\left(x\right),mbox\left\{d\right\}x ight|$ 4. if $varepsilon > au$ then 5. m = (a + b) / 2 6. Q = integrate(f,a,m,tau) + integrate(f,m,b,tau) 7. endif 8. return Q

An approximation $Q$ to the integral of $f\left(x\right)$ over the interval $\left[a,b\right]$ is computed (line 2), as well as an error estimate $varepsilon$ (line 3). If the estimated error is larger than the required tolerance $au$(line 4), the interval is subdivided (line 5) and the quadrature is applied on both halves separately (line 6). Either the initial estimate or the sum of the recursively computed halves is returned (line 7).

The important components are the quadrature rule itself

:$Q approx int_a^bf\left(x\right),mbox\left\{d\right\}x ,$

the error estimator

:$varepsilon approx left|Q - int_a^bf\left(x\right),mbox\left\{d\right\}x ight| ,$

and the logic for deciding which interval to subdivide, and when to terminate.

There are, of course, several variants of this scheme. The most common will be discussed later.

The quadrature rules generally have the form

:$Q_n quad = quad sum_\left\{i=0\right\}^n w_if\left(x_i\right) quad approx quad int_a^b f\left(x\right),mbox\left\{d\right\}x$

where the nodes $x_i$ and weights $w_i$ are generally pre-computed.

In the simplest case, Newton–Cotes formulas of even degree are used, where the nodes $x_i$ are evenly spaced in the interval:

:$x_i = a + frac\left\{i\right\}\left\{n\right\}\left(b - a\right)$.

When such rules are used, the points at which $f\left(x\right)$ has been evaluated can be re-used upon recursion:

:

A similar strategy is used with Clenshaw–Curtis quadrature, where the nodes are chosen as

:$x_i = cosleft\left( frac\left\{2i\right\}\left\{n\right\}pi ight\right)$

Or, when Fejér quadrature is used,

:$x_i = cosleft\left( frac\left\{2\left(i+0.5\right)\right\}\left\{n+1\right\}pi ight\right)$.

An algorithm may elect to use different quadrature methods on different subintervals, for example using a high-order method only where the integrand is smooth.

Error estimation

Some quadrature algorithms generate a sequence of results which should approach the correct value. Otherwise one can use a "null rule" which has the form of the above quadrature rule, but whose value would be zero for a simple integrand (for example, if the integrand were a polynomial of the appropriate degree).

See:
* Null rules
* Epsilon algorithm

ubdivision Logic

"Local" adaptive quadrature makes the acceptable error for a given interval proportional to the length of that interval. This criterion can be difficult to satisfy if the integrand are badly behaved at only a few points, for example with a few step discontinuities. Alternatively, one could require only that the sum of the errors on each of the subintervals be less than the user's requirement. This would be "global" adaptive quadrature. Global adaptive quadrature can be more efficient (using fewer evaluations of the integrand) but are generally more complex to program and may require more working space to record information on the current set of intervals.

ee also

References

* [http://portal.acm.org/citation.cfm?id=369102&dl=GUIDE&coll=GUIDE&CFID=26917988&CFTOKEN=19121185 William M. McKeeman: Algorithm 145: Adaptive numerical integration by Simpson's rule. Commun. ACM 5(12): 604 (1962).]
* [http://portal.acm.org/citation.cfm?id=321870&dl=GUIDE&coll=GUIDE&CFID=26917988&CFTOKEN=19121185 John R. Rice. A Metalgorithm for Adaptive Quadrature. Journal of the ACM 22(1) pp 61-82 ((January 1975).]

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Adaptive Simpson's method — Adaptive Simpson s method, also called adaptive Simpson s rule, is a method of numerical integration proposed by William M. McKeeman in 1962.William M. McKeeman: Algorithm 145: Adaptive numerical integration by Simpson s rule. Commun. ACM 5(12):… …   Wikipedia

• Adaptive stepsize — is a technique in numerical analysis used for many problems, but mainly for integration; This can be normal integration (that is quadrature ), or the process of solving an ordinary differential equation. This article focuses on the latter. For an …   Wikipedia

• Adaptive Multi-Rate — Das Global System for Mobile Communications (früher Groupe Spécial Mobile, GSM) ist ein Standard für volldigitale Mobilfunknetze, der hauptsächlich für Telefonie, aber auch für leitungsvermittelte und paketvermittelte Datenübertragung sowie… …   Deutsch Wikipedia

• Adaptive Transform Acoustic Coding — Infobox file format icon = extension = .aa3 .oma owner = Sony Corporation genre = Audio file format container for = contained by = extended from = extended to = standard =Adaptive Transform Acoustic Coding (ATRAC) is a family of proprietary audio …   Wikipedia

• Clenshaw–Curtis quadrature — and Fejér quadrature are methods for numerical integration, or quadrature , that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables x = cos θ and use a discrete… …   Wikipedia

• Numerical integration — consists of finding numerical approximations for the value S 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… …   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

• 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

• Psychometric software — is software that is used for psychometric analysis of data from tests, questionnaires, or inventories reflecting latent psychoeducational variables. While some psychometric analyses can be performed with standard statistical software like SPSS,… …   Wikipedia

• List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia