cuhre {cubature}  R Documentation 
Implement a deterministic algorithm for multidimensional numerical
integration. Its algorithm uses one of several cubature rules in a globally
adaptive subdivision scheme. The subdivision algorithm is similar to
suave()
.
cuhre(
f,
nComp = 1L,
lowerLimit,
upperLimit,
...,
relTol = 1e05,
absTol = 1e12,
minEval = 0L,
maxEval = 10^6,
flags = list(verbose = 0L, final = 1L, keep_state = 0L, level = 0L),
key = 0L,
nVec = 1L,
stateFile = NULL
)
f 
The function (integrand) to be integrated. For cuhre, it can be something as simple as a function of a single argument, say x. 
nComp 
The number of components of f, default 1, bears no relation to the dimension of the hypercube over which integration is performed. 
lowerLimit 
The lower limit of integration, a vector for hypercubes. 
upperLimit 
The upper limit of integration, a vector for hypercubes. 
... 
All other arguments passed to the function f. 
relTol 
The maximum tolerance, default 1e5. 
absTol 
the absolute tolerance, default 1e12. 
minEval 
the minimum number of function evaluations required 
maxEval 
The maximum number of function evaluations needed, default 10^6. Note that the actual number of function evaluations performed is only approximately guaranteed not to exceed this number. 
flags 
flags governing the integration. The list here is exhaustive to keep the documentation and invocation uniform, but not all flags may be used for a particular method as noted below. List components:

key 
the quadrature rule key: 
nVec 
the number of vectorization points, default 1, but can be set to an integer > 1 for vectorization, for example, 1024 and the function f above needs to handle the vector of points appropriately. See vignette examples. 
stateFile 
the name of an external file. Vegas can store its entire internal state (i.e. all the information to resume an interrupted integration) in an external file. The state file is updated after every iteration. If, on a subsequent invocation, Vegas finds a file of the specified name, it loads the internal state and continues from the point it left off. Needless to say, using an existing state file with a different integrand generally leads to wrong results. Once the integration finishes successfully, i.e. the prescribed accuracy is attained, the state file is removed. This feature is useful mainly to define ‘checkpoints’ in longrunning integrations from which the calculation can be restarted. 
See details in the documentation.
A list with components:
the actual number of subregions needed
the actual number of integrand evaluations needed
if zero, the desired accuracy was reached, if 1, dimension out of range, if 1, the accuracy goal was not met within the allowed maximum number of integrand evaluations.
vector of length nComp
; the integral of
integrand
over the hypercube
vector of
length nComp
; the presumed absolute error of
integral
vector of length nComp
; the
\chi^2
probability (not the
\chi^2
value itself!) that error
is not a
reliable estimate of the true integration error.
J. Berntsen, T. O. Espelid (1991) An adaptive algorithm for the approximate calculation of multiple integrals. ACM Transactions on Mathematical Software, 17(4), 437451.
T. Hahn (2005) CUBAa library for multidimensional numerical integration. Computer Physics Communications, 168, 7895. See https://feynarts.de/cuba/
integrand < function(arg) {
x < arg[1]
y < arg[2]
z < arg[3]
ff < sin(x)*cos(y)*exp(z);
return(ff)
} # End integrand
NDIM < 3
NCOMP < 1
cuhre(f = integrand,
lowerLimit = rep(0, NDIM),
upperLimit = rep(1, NDIM),
relTol = 1e3, absTol= 1e12,
flags = list(verbose = 2, final = 0))