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

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox: nag_quad_1d_inf_wtrig (d01as)

## Purpose

nag_quad_1d_inf_wtrig (d01as) calculates an approximation to the sine or the cosine transform of a function g$g$ over [a,)$\left[a,\infty \right)$:
 ∞ ∞ I = ∫ g(x)sin(ωx)dx  or  I = ∫ g(x)cos(ωx)dx a a
$I = ∫a∞ g(x) sin(ωx) dx or I = ∫a∞ g(x) cos(ωx) dx$
(for a user-specified value of ω$\omega$).

## Syntax

[result, abserr, lst, erlst, rslst, ierlst, iw, ifail] = d01as(g, a, omega, key, epsabs, 'limlst', limlst, 'lw', lw, 'liw', liw)
[result, abserr, lst, erlst, rslst, ierlst, iw, ifail] = nag_quad_1d_inf_wtrig(g, a, omega, key, epsabs, 'limlst', limlst, 'lw', lw, 'liw', liw)

## Description

nag_quad_1d_inf_wtrig (d01as) is based on the QUADPACK routine QAWFE (see Piessens et al. (1983)). It is an adaptive function, designed to integrate a function of the form g(x)w(x)$g\left(x\right)w\left(x\right)$ over a semi-infinite interval, where w(x)$w\left(x\right)$ is either sin(ωx)$\mathrm{sin}\left(\omega x\right)$ or cos(ωx)$\mathrm{cos}\left(\omega x\right)$.
Over successive intervals
 Ck = [a + (k − 1)c,a + kc] ,   k = 1,2, … ,lst $Ck = [a+(k-1)c,a+kc] , k=1,2,…,lst$
integration is performed by the same algorithm as is used by nag_quad_1d_fin_wtrig (d01an). The intervals Ck${C}_{k}$ are of constant length
 c = {2[|ω|] + 1} π / |ω| ,   ω ≠ 0 , $c = { 2[|ω|] +1 } π/|ω| , ω≠0 ,$
where [|ω|]$\left[|\omega |\right]$ represents the largest integer less than or equal to |ω|$|\omega |$. Since c$c$ equals an odd number of half periods, the integral contributions over succeeding intervals will alternate in sign when the function g$g$ is positive and monotonically decreasing over [a,)$\left[a,\infty \right)$. The algorithm, described in Piessens et al. (1983), incorporates a global acceptance criterion (as defined by Malcolm and Simpson (1976)) together with the ε$\epsilon$-algorithm (see Wynn (1956)) to perform extrapolation. The local error estimation is described by Piessens et al. (1983).
If ω = 0$\omega =0$ and key = 1${\mathbf{key}}=1$, the function uses the same algorithm as nag_quad_1d_inf (d01am) (with epsrel = 0.0${\mathbf{epsrel}}=0.0$).
In contrast to the other functions in Chapter D01, nag_quad_1d_inf_wtrig (d01as) works only with an absolute error tolerance (epsabs). Over the interval Ck${C}_{k}$ it attempts to satisfy the absolute accuracy requirement
 EPSAk = Uk × epsabs , $EPSAk = Uk×epsabs ,$
where Uk = (1p)pk1${U}_{\mathit{k}}=\left(1-p\right){p}^{\mathit{k}-1}$, for k = 1,2,$\mathit{k}=1,2,\dots$ and p = 0.9$p=0.9$.
However, when difficulties occur during the integration over the k$k$th sub-interval Ck${C}_{k}$ such that the error flag ierlst(k)${\mathbf{ierlst}}\left(k\right)$ is nonzero, the accuracy requirement over subsequent intervals is relaxed. See Piessens et al. (1983) for more details.

## References

Malcolm M A and Simpson R B (1976) Local versus global strategies for adaptive quadrature ACM Trans. Math. Software 1 129–146
Piessens R, de Doncker–Kapenga E, Überhuber C and Kahaner D (1983) QUADPACK, A Subroutine Package for Automatic Integration Springer–Verlag
Wynn P (1956) On a device for computing the em(Sn)${e}_{m}\left({S}_{n}\right)$ transformation Math. Tables Aids Comput. 10 91–96

## Parameters

### Compulsory Input Parameters

1:     g – function handle or string containing name of m-file
g must return the value of the function g$g$ at a given point x.
[result] = g(x)

Input Parameters

1:     x – double scalar
The point at which the function g$g$ must be evaluated.

Output Parameters

1:     result – double scalar
The result of the function.
2:     a – double scalar
a$a$, the lower limit of integration.
3:     omega – double scalar
The parameter ω$\omega$ in the weight function of the transform.
4:     key – int64int32nag_int scalar
Indicates which integral is to be computed.
key = 1${\mathbf{key}}=1$
w(x) = cos(ωx)$w\left(x\right)=\mathrm{cos}\left(\omega x\right)$.
key = 2${\mathbf{key}}=2$
w(x) = sin(ωx)$w\left(x\right)=\mathrm{sin}\left(\omega x\right)$.
Constraint: key = 1${\mathbf{key}}=1$ or 2$2$.
5:     epsabs – double scalar
The absolute accuracy required. If epsabs is negative, the absolute value is used. See Section [Accuracy].

### Optional Input Parameters

1:     limlst – int64int32nag_int scalar
An upper bound on the number of intervals Ck${C}_{k}$ needed for the integration.
Default: 50$50$
Constraint: limlst3${\mathbf{limlst}}\ge 3$.
2:     lw – int64int32nag_int scalar
The dimension of the array w as declared in the (sub)program from which nag_quad_1d_inf_wtrig (d01as) is called. The value of lw (together with that of liw) imposes a bound on the number of sub-intervals into which each interval Ck${C}_{k}$ may be divided by the function. The number of sub-intervals cannot exceed lw / 4${\mathbf{lw}}/4$. The more difficult the integrand, the larger lw should be.
Default: a value in the range 800$800$ to 2000$2000$ is adequate for most problems.
Constraint: lw4${\mathbf{lw}}\ge 4$.
3:     liw – int64int32nag_int scalar
The dimension of the array iw as declared in the (sub)program from which nag_quad_1d_inf_wtrig (d01as) is called. The number of sub-intervals into which each interval Ck${C}_{k}$ may be divided cannot exceed liw / 2${\mathbf{liw}}/2$.
Default: lw / 2${\mathbf{lw}}/2$
Constraint: liw2${\mathbf{liw}}\ge 2$.

w

### Output Parameters

1:     result – double scalar
The approximation to the integral I$I$.
2:     abserr – double scalar
An estimate of the modulus of the absolute error, which should be an upper bound for |Iresult|$|I-{\mathbf{result}}|$.
3:     lst – int64int32nag_int scalar
The number of intervals Ck${C}_{k}$ actually used for the integration.
4:     erlst(limlst) – double array
erlst(k)${\mathbf{erlst}}\left(\mathit{k}\right)$ contains the error estimate corresponding to the integral contribution over the interval Ck${C}_{\mathit{k}}$, for k = 1,2,,lst$\mathit{k}=1,2,\dots ,{\mathbf{lst}}$.
5:     rslst(limlst) – double array
rslst(k)${\mathbf{rslst}}\left(\mathit{k}\right)$ contains the integral contribution over the interval Ck${C}_{\mathit{k}}$, for k = 1,2,,lst$\mathit{k}=1,2,\dots ,{\mathbf{lst}}$.
6:     ierlst(limlst) – int64int32nag_int array
ierlst(k)${\mathbf{ierlst}}\left(\mathit{k}\right)$ contains the error flag corresponding to rslst(k)${\mathbf{rslst}}\left(\mathit{k}\right)$, for k = 1,2,,lst$\mathit{k}=1,2,\dots ,{\mathbf{lst}}$. See Section [Error Indicators and Warnings].
7:     iw(liw) – int64int32nag_int array
iw(1)${\mathbf{iw}}\left(1\right)$ contains the maximum number of sub-intervals actually used for integrating over any of the intervals Ck${C}_{k}$. The rest of the array is used as workspace.
8:     ifail – int64int32nag_int scalar
${\mathrm{ifail}}={\mathbf{0}}$ unless the function detects an error (see [Error Indicators and Warnings]).

## Error Indicators and Warnings

Note: nag_quad_1d_inf_wtrig (d01as) may return useful information for one or more of the following detected errors or 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 maximum number of subdivisions allowed with the given workspace has been reached without the accuracy requirements being achieved. Look at the integrand in order to determine the integration difficulties. If the position of a local difficulty within the interval can be determined (e.g., a singularity of the integrand or its derivative, a peak, a discontinuity, etc.) you will probably gain from splitting up the interval at this point and calling nag_quad_1d_inf_wtrig (d01as) on the infinite subrange and an appropriate integrator on the finite subrange. Alternatively, consider relaxing the accuracy requirements specified by epsabs or increasing the amount of workspace.
W ifail = 2${\mathbf{ifail}}=2$
Round-off error prevents the requested tolerance from being achieved. Consider requesting less accuracy.
W ifail = 3${\mathbf{ifail}}=3$
Extremely bad local integrand behaviour causes a very strong subdivision around one (or more) points of the interval. The same advice applies as in the case of ${\mathbf{ifail}}={\mathbf{1}}$.
W ifail = 4${\mathbf{ifail}}=4$
The requested tolerance cannot be achieved because the extrapolation does not increase the accuracy satisfactorily; the returned result is the best which can be obtained. The same advice applies as in the case of ${\mathbf{ifail}}={\mathbf{1}}$.
Look at the integrand in order to determine the integration difficulties. If the position of a local difficulty within the interval can be determined (e.g., a singularity of the integrand or its derivative, a peak, a discontinuity etc.) you will probably gain from splitting up the interval at this point and calling nag_quad_1d_inf_wtrig (d01as) on the infinite subrange and an appropriate integrator on the finite subrange. Alternatively, consider relaxing the accuracy requirements specified by epsabs or increasing the amount of workspace.
Please note that divergence can occur with any nonzero value of ifail.
W ifail = 5${\mathbf{ifail}}=5$
The integral is probably divergent, or slowly convergent. Please note that divergence can occur with any nonzero value of ifail.
ifail = 6${\mathbf{ifail}}=6$
 On entry, key ≠ 1${\mathbf{key}}\ne 1$ or 2$2$, or limlst < 3${\mathbf{limlst}}<3$.
W ifail = 7${\mathbf{ifail}}=7$
Bad integration behaviour occurs within one or more of the intervals Ck${C}_{k}$. Location and type of the difficulty involved can be determined from the vector ierlst.
W ifail = 8${\mathbf{ifail}}=8$
Maximum number of intervals Ck${C}_{k}$ ($\text{}={\mathbf{limlst}}$) allowed has been achieved. Increase the value of limlst to allow more cycles.
W ifail = 9${\mathbf{ifail}}=9$
The extrapolation table constructed for convergence acceleration of the series formed by the integral contribution over the intervals Ck${C}_{k}$, does not converge to the required accuracy.
ifail = 10${\mathbf{ifail}}=10$
 On entry, lw < 4${\mathbf{lw}}<4$, or liw < 2${\mathbf{liw}}<2$.
In the cases ${\mathbf{ifail}}={\mathbf{7}}$, 8${\mathbf{8}}$ or 9${\mathbf{9}}$, additional information about the cause of the error can be obtained from the array ierlst, as follows:
ierlst(k) = 1${\mathbf{ierlst}}\left(k\right)=1$
The maximum number of subdivisions = min (lw / 4,liw / 2)$\text{subdivisions}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{lw}}/4,{\mathbf{liw}}/2\right)$ has been achieved on the k$k$th interval.
ierlst(k) = 2${\mathbf{ierlst}}\left(k\right)=2$
Occurrence of round-off error is detected and prevents the tolerance imposed on the k$k$th interval from being achieved.
ierlst(k) = 3${\mathbf{ierlst}}\left(k\right)=3$
Extremely bad integrand behaviour occurs at some points of the k$k$th interval.
ierlst(k) = 4${\mathbf{ierlst}}\left(k\right)=4$
The integration procedure over the k$k$th interval does not converge (to within the required accuracy) due to round-off in the extrapolation procedure invoked on this interval. It is assumed that the result on this interval is the best which can be obtained.
ierlst(k) = 5${\mathbf{ierlst}}\left(k\right)=5$
The integral over the k$k$th interval is probably divergent or slowly convergent. It must be noted that divergence can occur with any other value of ierlst(k)${\mathbf{ierlst}}\left(k\right)$.

## Accuracy

nag_quad_1d_inf_wtrig (d01as) cannot guarantee, but in practice usually achieves, the following accuracy:
 |I − result| ≤ |epsabs|, $|I-result|≤|epsabs|,$
where epsabs is the user-specified absolute error tolerance. Moreover, it returns the quantity abserr, which, in normal circumstances, satisfies
 |I − result| ≤ abserr ≤ |epsabs|. $|I-result|≤abserr≤|epsabs|.$

None.

## Example

```function nag_quad_1d_inf_wtrig_example
a = 0;
omega = 1.570796326794897;
key = int64(1);
epsabs = 0.001;
[result, abserr, lst, erlst, rslst, ierlst, iw, ifail] = ...
nag_quad_1d_inf_wtrig(@g, a, omega, key, epsabs);
result, abserr, lst, ifail

function [result] = g(x)
if (x > 0)
result = 1/sqrt(x);
else
result = 0;
end
```
```

result =

1.0000

abserr =

5.9234e-04

lst =

6

ifail =

0

```
```function d01as_example
a = 0;
omega = 1.570796326794897;
key = int64(1);
epsabs = 0.001;
[result, abserr, lst, erlst, rslst, ierlst, iw, ifail] = ...
d01as(@g, a, omega, key, epsabs);
result, abserr, lst, ifail

function [result] = g(x)
if (x > 0)
result = 1/sqrt(x);
else
result = 0;
end
```
```

result =

1.0000

abserr =

5.9234e-04

lst =

6

ifail =

0

```

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

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