Integer type:** int32**** int64**** nag_int** show int32 show int32 show int64 show int64 show nag_int show nag_int

nag_quad_1d_fin_well (d01ah) computes a definite integral over a finite range to a specified relative accuracy using a method described by Patterson.

nag_quad_1d_fin_well (d01ah) computes a definite integral of the form

The method uses as its basis a family of interlacing high precision rules (see Patterson (1968)) using 1$1$, 3$3$, 7$7$, 15$15$, 31$31$, 63$63$, 127$127$ and 255$255$ nodes. Initially the family is applied in sequence to the integrand. When two successive rules differ relatively by less than the required relative accuracy, the last rule used is taken as the value of the integral and the operation is regarded as successful. If all rules in the family have been applied unsuccessfully, subdivision is invoked. The subdivision strategy is as follows. The interval under scrutiny is divided into two sub-intervals (not always equal). The basic family is then applied to the first sub-interval. If the required accuracy is not obtained, the interval is stored for future examination (see ifail = 2${\mathbf{ifail}}={\mathbf{2}}$) and the second sub-interval is examined. Should the basic family again be unsuccessful, then the sub-interval is further subdivided and the whole process repeated. Successful integrations are accumulated as the partial value of the integral. When all possible successful integrations have been completed, those previously unsuccessful sub-intervals placed in store are examined.

$$\underset{a}{\overset{b}{\int}}f\left(x\right)dx\text{.}$$ |

A large number of refinements are incorporated to improve the performance. Some of these are:

(a) | The rate of convergence of the basic family is monitored and used to make a decision to abort and subdivide before the full sequence has been applied. |

(b) | The ε$\epsilon $-algorithm is applied to the basic results in an attempt to increase the convergence rate. See Wynn (1956). |

(c) | An attempt is made to detect sharp end point peaks and singularities in each sub-interval and to apply appropriate transformations to smooth the integrand. This consideration is also used to select interval sizes in the subdivision process. |

(d) | The relative accuracy sought in each sub-interval is adjusted in accordance with its likely contribution to the total integral. |

(e) | Random transformations of the integrand are applied to improve reliability in some instances. |

Patterson T N L (1968) The Optimum addition of points to quadrature formulae *Math. Comput.* **22** 847–856

Wynn P (1956) On a device for computing the e_{m}(S_{n})${e}_{m}\left({S}_{n}\right)$ transformation *Math. Tables Aids Comput.* **10** 91–96

- 1: a – double scalar
- a$a$, the lower limit of integration.
- 2: b – double scalar
- b$b$, the upper limit of integration. It is not necessary that a < b$a<b$.
- 3: epsr – double scalar
- The relative accuracy required.
- 4: f – function handle or string containing name of m-file
- 5: nlimit – int64int32nag_int scalar
- A limit to the number of function evaluations. If nlimit ≤ 0${\mathbf{nlimit}}\le 0$, the function uses a default limit of 10000$10000$.

None.

None.

- 1: result – double scalar
- The result of the function.
- 2: npts – int64int32nag_int scalar
- The number of function evaluations used in the calculation of the integral.
- 3: relerr – double scalar
- A rough estimate of the relative error achieved.
- 4: ifail – int64int32nag_int scalar
- ifail = 0${\mathrm{ifail}}={\mathbf{0}}$ unless the function detects an error (see [Error Indicators and Warnings]).

Errors or warnings detected by the function:

Cases prefixed with `W` are classified as warnings and
do not generate an error of type NAG:error_*n*. See nag_issue_warnings.

`W`ifail = 1${\mathbf{ifail}}=1$- The integral has not converged to the accuracy requested. It may be worthwhile to try increasing nlimit.

`W`ifail = 2${\mathbf{ifail}}=2$- Too many unsuccessful levels of subdivision have been invoked.

On entry, epsr ≤ 0.0${\mathbf{epsr}}\le 0.0$.

When ifail = 1${\mathbf{ifail}}={\mathbf{1}}$ or 2${\mathbf{2}}$ a result may be obtained by continuing without further subdivision, but this is likely to be **inaccurate**.

The relative accuracy required is specified by you in the variable epsr. The function will terminate whenever the relative accuracy specified by epsr is judged to have been reached.

If on exit, ifail = 0${\mathbf{ifail}}={\mathbf{0}}$, then it is most likely that the result is correct to the specified accuracy. If, on exit, ifail = 1${\mathbf{ifail}}={\mathbf{1}}$ or 2${\mathbf{2}}$, then it is likely that the specified accuracy has not been reached.

relerr is a rough estimate of the relative error achieved. It is a by-product of the computation and is not used to effect the termination of the function. The outcome of the integration must be judged by the value of ifail.

The time taken by nag_quad_1d_fin_well (d01ah) depends on the complexity of the integrand and the accuracy required.

Open in the MATLAB editor: nag_quad_1d_fin_well_example

function nag_quad_1d_fin_well_examplea = 0; b = 1; epsr = 1e-05; nlimit = int64(0); f = @(x) 4.0/(1.0+x^2); [result, npts, relerr, ifail] = nag_quad_1d_fin_well(a, b, epsr, f, nlimit)

result = 3.1416 npts = 15 relerr = 5.8494e-09 ifail = 0

Open in the MATLAB editor: d01ah_example

function d01ah_examplea = 0; b = 1; epsr = 1e-05; nlimit = int64(0); f = @(x) 4.0/(1.0+x^2); [result, npts, relerr, ifail] = d01ah(a, b, epsr, f, nlimit)

result = 3.1416 npts = 15 relerr = 5.8494e-09 ifail = 0

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2013