NAG FL Interface
d01raf (dim1_​gen_​vec_​multi_​rcomm)

1 Purpose

2 Specification

3 Description

liopts = 100
lopts = 100
allocate(iopts(liopts),opts(lopts))
Call d01zkf('initialize = d01raf',iopts,liopts,opts,lopts,ifail)
Call d01zkf('option = value',iopts,liopts,opts,lopts,ifail)
...
Call d01rcf(ni,lenxrq,ldfmrq,sdfmrq,licmin,licmax,lcmin,lcmax, &
     iopts,opts,ifail)
lenx = lenxrq
ldfm = ldfmrq
sdfm = sdfmrq
licom = licmax
lcom = lcmax
allocate(icom(licom),com(lcom),x(lenx),fm(ldfm,sdfm),needi(ni), &
              dinest(ni),errest(ni))

irevcm = 1
While irevcm≠0
    Call d01raf(irevcm,ni,a,b,sid,needi,x,lenx,nx,fm,ldfm,   &
                dinest,errest,iopts,opts,icom,licom,com, &
                lcom,ifail)
    Select Case(irevcm)
    Case(11)
          Initial solve phase 
          evaluate fm(1:ni,1:nx)
    Case(12)
          Adaptive solve phase 
          evaluate fm(needi(1:ni)=1,1:nx)
    Case(0)
          investigate ifail
    End Select
End While

Call d01zlf('option',ivalue,rvalue,cvalue,optype,iopts,opts,ifail)
...

4 References

5 Arguments

1: $\mathbf{irevcm}$ – Integer Input/Output

On initial entry: $\mathbf{irevcm}=1$.

$\mathbf{irevcm}=1$

Sets up data structures in icom and com and starts a new integration.

Constraint: $\mathbf{irevcm}=1$ on initial entry.

On intermediate exit: $\mathbf{irevcm}=11$ or $12$.

irevcm requests the integrands $f_j\left(x_i\right)$ be evaluated for all required $j\in 1,\dots ,n_i$ as indicated by needi, and at all the points $x_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n_x$. Abscissae $x_i$ are provided in $\mathbf{x}\left(i\right)$ and $f_j\left(x_i\right)$ must be returned in $\mathbf{fm}\left(j,i\right)$.

During the initial solve phase:

$\mathbf{irevcm}=11$

Function values are required to construct the initial estimates of the definite integrals.

If $\mathbf{needi}\left(j\right)=1$, $f_j\left(x_i\right)$ must be supplied in $\mathbf{fm}\left(j,i\right)$. This will be the case unless you have abandoned the evaluation of specific integrals on a previous call.

If $\mathbf{needi}\left(j\right)=0$, you have previously abandoned the evaluation of integral $j$, and hence should not supply the value of $f_j\left(x_i\right)$.

dinest and errest contain incomplete information during this phase. As such you should not abandon the evaluation of any integrals during this phase unless you do not require their estimate.

If irevcm is set to a negative value during this phase, $\mathbf{needi}\left(\mathit{j}\right)$, for $\mathit{j}=1,2,\dots ,n_i$, will be set to this negative value and $\mathbf{ifail}=-\mathbf{1}$ will be returned.

During the adaptive solve phase:

$\mathbf{irevcm}=12$

Function values are required to improve the estimates of the definite integrals.

If $\mathbf{needi}\left(j\right)=0$, any evaluation of $f_j\left(x_i\right)$ will be discarded, so there is no need to provide them.

If $\mathbf{needi}\left(j\right)=1$, $f_j\left(x_i\right)$ must be provided in $\mathbf{fm}\left(j,i\right)$.

If $\mathbf{needi}\left(j\right)=2$, $3$ or $4$, the current error estimate of integral $j$ does not require integrand $j$ to be evaluated and provided in $\mathbf{fm}\left(j,i\right)$. Should you choose to, integrand $j$ can be evaluated in which case $\mathbf{needi}\left(j\right)$ must be set to $1$.

dinest and errest contain complete information during this phase.

If irevcm is set to a negative value during this phase $\mathbf{ifail}=\mathbf{1}$, $\mathbf{2}$ or $\mathbf{3}$ will be returned and the elements of needi will reflect the current state of the adaptive process.

On intermediate re-entry: irevcm should normally be left unchanged. However, if irevcm is set to a negative value, d01raf will terminate, (see $\mathbf{irevcm}=11$ and $\mathbf{irevcm}=12$ above).

On final exit: $\mathbf{irevcm}=0$.

$\mathbf{irevcm}=0$

Indicates the algorithm has completed.

Note: any values you return to d01raf as part of the reverse communication procedure should not include floating-point NaN (Not a Number) or infinity values, since these are not handled by d01raf. If your code does inadvertently return any NaNs or infinities, d01raf is likely to produce unexpected results.

2: $\mathbf{ni}$ – Integer Input

On entry: $n_i$, the number of integrands.

3: $\mathbf{a}$ – Real (Kind=nag_wp) Input

On entry: $a$, the lower bound of the domain.

4: $\mathbf{b}$ – Real (Kind=nag_wp) Input

On entry: $b$, the upper bound of the domain.

If $\left|b-a\right|<10\epsilon$, where $\epsilon$ is the machine precision (see x02ajf), d01raf will return $\mathbf{dinest}\left(\mathit{j}\right)=\mathbf{errest}\left(\mathit{j}\right)=0.0$, for $\mathit{j}=1,2,\dots ,n_i$.

5: $\mathbf{sid}$ – Integer Output

For advanced users.

On intermediate exit: sid identifies a specific set of abscissae, $\mathbf{x}$, returned during the integration process. When a new set of abscissae are generated the value of sid is incremented by $1$. Advanced users may store calculations required for an identified set $\mathbf{x}$, and reuse them should d01raf return the same value of sid, i.e., the same set of abscissae was used.

6: $\mathbf{needi}\left(\mathbf{ni}\right)$ – Integer array Input/Output

On initial entry: need not be set.

On intermediate exit: $\mathbf{needi}\left(j\right)$ indicates what action must be taken for integral $j=1,2,\dots n_i$ (see irevcm).

$\mathbf{needi}\left(j\right)=0$

Do not provide $f_j\left(x_i\right)$. Any provided values will be ignored.

$\mathbf{needi}\left(j\right)=1$

The values $f_j\left(x_{\mathit{i}}\right)$ must be provided in $\mathbf{fm}\left(j,\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n_x$.

$\mathbf{needi}\left(j\right)=2$

The values $f_j\left(x_i\right)$ are not required, however the error estimate for integral $j$ is still above the requested tolerance. If you wish to provide values for the evaluation of integral $j$, set $\mathbf{needi}\left(j\right)=1$, and supply $f_j\left(x_{\mathit{i}}\right)$ in $\mathbf{fm}\left(j,\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n_x$.

$\mathbf{needi}\left(j\right)=3$

The error estimate for integral $j$ cannot be improved to below the requested tolerance directly, either because no more new splits may be performed due to exhaustion, or due to the detection of extremely bad integrand behaviour. However, providing the values $f_j\left(x_i\right)$ may still lead to some improvement, and may lead to an acceptable error estimate indirectly using Wynn's epsilon algorithm. If you wish to provide values for the evaluation of integral $j$, set $\mathbf{needi}\left(j\right)=1$, and supply $f_j\left(x_{\mathit{i}}\right)$ in $\mathbf{fm}\left(j,\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n_x$.

$\mathbf{needi}\left(j\right)=4$

The error estimate of integral $j$ is below the requested tolerance. If you believe this to be false, if for example the result in $\mathbf{dinest}\left(j\right)$ is greatly different to what you may expect, you may force the algorithm to re-evaluate this conclusion by including the evaluations of integrand $j$ at $x_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n_x$, and setting $\mathbf{needi}\left(j\right)=1$. Integral and error estimation will be performed again during the next iteration.

On intermediate re-entry: $\mathbf{needi}\left(j\right)$ may be used to indicate what action you have taken for integral $j$.

$\mathbf{needi}\left(j\right)=1$

You have provided the values $f_j\left(x_{\mathit{i}}\right)$ in $\mathbf{fm}\left(j,\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n_x$.

$\mathbf{needi}\left(j\right)<0$

You are abandoning the evaluation of integral $j$. The current values of $\mathbf{dinest}\left(j\right)$ and $\mathbf{errest}\left(j\right)$ will be returned on final completion.

Otherwise you have not provided the value $f_j\left(x_i\right)$.

On final exit: $\mathbf{needi}\left(j\right)$ indicates the final state of integral $j$.

$\mathbf{needi}\left(j\right)=0$

The error estimate for $F_j$ is below the requested tolerance.

$\mathbf{needi}\left(j\right)=1$

The error estimate for $F_j$ is below the requested tolerance after extrapolation.

$\mathbf{needi}\left(j\right)=2$

The error estimate for $F_j$ is above the requested tolerance.

$\mathbf{needi}\left(j\right)=3$

The error estimate for $F_j$ is above the requested tolerance, and extremely bad behaviour of integral $j$ has been detected.

$\mathbf{needi}\left(j\right)<0$

You prohibited further evaluation of integral $j$.

7: $\mathbf{x}\left(\mathbf{lenx}\right)$ – Real (Kind=nag_wp) array Input/Output

On initial entry: if $\mathbf{Primary\; Division\; Mode}=\mathrm{AUTOMATIC}$, x need not be set. This is the default behaviour.

If $\mathbf{Primary\; Division\; Mode}=\mathrm{MANUAL}$, x is used to supply a set of initial ‘break-points’ inside the domain of integration. Specifically, $\mathbf{x}\left(i\right)$ must contain a break-point $x_{\mathit{i}}^0$, for $\mathit{i}=1,2,\dots ,\left(s_{\mathit{pri}}-1\right)$, where $s_{\mathit{pri}}$ is the number of Primary Divisions.

Constraint: if break-points are supplied, $x_{\mathit{i}}^0\in \left(a,b\right)$, $\left|x_{\mathit{i}}^0-a\right|>10.0\epsilon$, $\left|x_{\mathit{i}}^0-b\right|>10.0\epsilon$, for $\mathit{i}=1,2,\dots ,\left(s_{\mathit{pri}}-1\right)$.

On intermediate exit: $\mathbf{x}\left(\mathit{i}\right)$ is the abscissa $x_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n_x$, at which the appropriate integrals must be evaluated.

8: $\mathbf{lenx}$ – Integer Input

On entry: the dimension of the array x as declared in the (sub)program from which d01raf is called. Currently $\mathbf{lenx}=\max \left(122,s_{\mathit{pri}}-1\right)$ will be sufficient for all cases.

Constraint: $\mathbf{lenx}\ge \mathit{lenxrq}$, where $\mathit{lenxrq}$ is dependent upon the options currently set (see Section 11). $\mathit{lenxrq}$ is returned as lenxrq from d01rcf.

9: $\mathbf{nx}$ – Integer Input/Output

On initial entry: need not be set.

On intermediate exit: $n_x$, the number of abscissae at which integrands are required.

On intermediate re-entry: must not be changed.

10: $\mathbf{fm}\left(\mathbf{ldfm},*\right)$ – Real (Kind=nag_wp) array Input

Note: the second dimension of the array fm must be at least $\mathit{sdfmrq}$, where $\mathit{sdfmrq}$ is dependent upon $n_i$ and the options currently set. $\mathit{sdfmrq}$ is returned as sdfmrq from d01rcf. If default options are chosen, $\mathit{sdfmrq}=\mathit{lenxrq}$.

On initial entry: need not be set.

On intermediate re-entry: if indicated by $\mathbf{needi}\left(j\right)$ you must supply the values $f_j\left(x_i\right)$ in $\mathbf{fm}\left(\mathit{j},\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n_x$ and $\mathit{j}=1,2,\dots ,n_i$.

11: $\mathbf{ldfm}$ – Integer Input

On entry: the first dimension of the array fm as declared in the (sub)program from which d01raf is called.

Constraint: $\mathbf{ldfm}\ge \mathit{ldfmrq}$, where $\mathit{ldfmrq}$ is dependent upon $n_i$ and the options currently set. $\mathit{ldfmrq}$ is returned as ldfmrq from d01rcf. If default options are chosen, $\mathit{ldfmrq}=n_i$, implying $\mathbf{ldfm}\ge \mathbf{ni}$.

12: $\mathbf{dinest}\left(\mathbf{ni}\right)$ – Real (Kind=nag_wp) array Input/Output

$\mathbf{dinest}\left(j\right)$ contains the current estimate of the definite integral $F_j$.

On initial entry: need not be set.

On intermediate re-entry: must not be altered.

On exit: contains the current estimates of the ni integrals. If $\mathbf{irevcm}=0$, this will be the final solution.

13: $\mathbf{errest}\left(\mathbf{ni}\right)$ – Real (Kind=nag_wp) array Input/Output

$\mathbf{errest}\left(j\right)$ contains the current error estimate of the definite integral $F_j$.

On initial entry: need not be set.

On intermediate re-entry: must not be altered.

On exit: contains the current error estimates for the ni integrals. If $\mathbf{irevcm}=0$, errest contains the final error estimates of the ni integrals.

14: $\mathbf{iopts}\left(100\right)$ – Integer array Communication Array

15: $\mathbf{opts}\left(100\right)$ – Real (Kind=nag_wp) array Communication Array

The arrays iopts and opts must not be altered between calls to any of the routines d01raf, d01rcf, d01zkf and d01zlf.

16: $\mathbf{icom}\left(\mathbf{licom}\right)$ – Integer array Communication Array

icom contains details of the integration procedure, including information on the integration of the $n_i$ integrals over individual segments. This data is stored sequentially in the order that segments are created. For further information see Section 9.1.

17: $\mathbf{licom}$ – Integer Input

On entry: the dimension of the array icom.

Constraint: $\mathbf{licom}\ge \mathit{licmin}$, where $\mathit{licmin}$ is dependent upon ni and the current options set. $\mathit{licmin}$ is returned as licmin from d01rcf. If the default options are set, $\mathit{licmin}=55+6\times \mathbf{ni}$. Larger values than $\mathit{licmin}$ are recommended if you anticipate that any integrals will require the domain to be further subdivided.

The maximum value that may be required, $\mathit{licmax}$, is returned as licmax from d01rcf. If default options are chosen, except for possibly increasing the value of $s_{\mathit{pri}}$, $\mathit{licmax}=50+5\times \mathbf{ni}+\left(s_{\mathit{pri}}+100\right)\times \left(5+\mathbf{ni}\right)$.

18: $\mathbf{com}\left(\mathbf{lcom}\right)$ – Real (Kind=nag_wp) array Communication Array

com contains details of the integration procedure, including information on the integration of the $n_i$ integrals over individual segments. This data is stored sequentially in the order that segments are created. For further information see Section 9.1.

19: $\mathbf{lcom}$ – Integer Input

On entry: the dimension of the array com.

Constraint: $\mathbf{lcom}>\mathit{lcmin}$, where $\mathit{lcmin}$ is dependent upon ni, $s_{\mathit{pri}}$ and the current options set. $\mathit{lcmin}$ is returned as lcmin from d01rcf. If default options are set, $\mathit{lcmin}=96+12\times \mathbf{ni}$. Larger values are recommended if you anticipate that any integrals will require the domain to be further subdivided.

Given the current options and arguments, the maximum value, $\mathit{lcmax}$, of lcom that may be required, is returned as lcmax from d01rcf. If default options are chosen, $\mathit{lcmax}=94+9\times \mathbf{ni}+⌈\mathbf{ni}/2⌉+\left(s_{\mathit{pri}}+100\right)\times \left(2+⌈\mathbf{ni}/2⌉+2\times \mathbf{ni}\right)$.

20: $\mathbf{ifail}$ – Integer Input/Output

On initial entry: ifail must be set to $0$, $-1\text{ or }1$. If you are unfamiliar with this argument you should refer to Section 4 in the Introduction to the NAG Library FL Interface for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{ or }1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, because for this routine the values of the output arguments may be useful even if $\mathbf{ifail}\ne \mathbf{0}$ on exit, the recommended value is $-1$. When the value $-\mathbf{1}\text{ or }1$ is used it is essential to test the value of ifail on exit.

On final exit: $\mathbf{ifail}=\mathbf{0}$ unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

$\mathbf{ifail}=1$

At least one error estimate exceeded the requested tolerances.

$\mathbf{ifail}=2$

Extremely bad behaviour was detected for at least one integral.

$\mathbf{ifail}=3$

Extremely bad behaviour was detected for at least one integral. At least one other integral error estimate was above the requested tolerance.

$\mathbf{ifail}=11$

irevcm had an illegal value.
On entry, $\mathbf{irevcm}=〈\mathit{\text{value}}〉$.

$\mathbf{ifail}=21$

On entry, $\mathbf{ni}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{ni}\ge 1$.

$\mathbf{ifail}=71$

On entry, $\mathbf{Primary\; Division\; Mode}=\mathrm{MANUAL}$ and at least one supplied break-point in x is outside of the domain of integration.

$\mathbf{ifail}=81$

lenx is insufficient for the chosen options.
On entry, $\mathbf{lenx}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{lenx}\ge 〈\mathit{\text{value}}〉$.

$\mathbf{ifail}=111$

$\mathbf{ldfm}<\mathit{ldfmrq}$. If default options are chosen, this implies $\mathbf{ldfm}<\mathbf{ni}$.
On entry, $\mathbf{ldfm}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{ldfm}\ge 〈\mathit{\text{value}}〉$.

$\mathbf{ifail}=171$

licom is insufficient for additional subdivision.
On entry, $\mathbf{licom}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{licom}\ge 〈\mathit{\text{value}}〉$.

$\mathbf{ifail}=191$

lcom is insufficient for additional subdivision.
On entry, $\mathbf{lcom}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{lcom}\ge 〈\mathit{\text{value}}〉$.

$\mathbf{ifail}=1001$

Either the option arrays iopts and opts have not been initialized for d01raf, or they have become corrupted.

$\mathbf{ifail}=1101$

On entry, one of icom and com has become corrupted.

$\mathbf{ifail}=-1$

Evaluation of all integrals has been stopped during the initial phase.

$\mathbf{ifail}=-99$

An unexpected error has been triggered by this routine. Please contact NAG.

See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$\mathbf{ifail}=-399$

Your licence key may have expired or may not have been installed correctly.

See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$\mathbf{ifail}=-999$

Dynamic memory allocation failed.

See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

8 Parallelism and Performance

9 Further Comments

9.1 Details of the Computation

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

11 Optional Parameters

• Absolute Interval Minimum
• Absolute Tolerance
• Extrapolation
• Extrapolation Safeguard
• Maximum Subdivisions
• Primary Division Mode
• Primary Divisions
• Prioritize Error
• Quadrature Rule
• Relative Interval Minimum
• Relative Tolerance

11.1 Description of the Optional Parameters

• the keywords, where the minimum abbreviation of each keyword is underlined;
• a parameter value, where the letters $a$, $i$ and $r$ denote options that take character, integer and real values respectively;
• the default value.

AUTOMATIC

d01raf will automatically generate $s_{\mathit{pri}}$ segments of equal size covering the interval $\left[a,b\right]$.

MANUAL

d01raf will use the break-points $x_{\mathit{i}}^0$, for $\mathit{i}=1,2,\dots ,s_{\mathit{pri}}-1$, supplied in x on initial entry to generate the initial segments covering $\left[a,b\right]$. These may be supplied in any order, however it will be more efficient to supply them in ascending (or descending if $a>b$) order. Repeated break-points are allowed, although this will generate fewer initial segments.

11.2 Diagnostic Options