quad(func, a, b, args=(), full_output=0, epsabs=1.49e-08, epsrel=1.49e-08, limit=50, points=None, weight=None, wvar=None, wopts=None, maxp1=50, limlst=50)
Integrate func from a to b (possibly infinite interval) using a technique from the Fortran library QUADPACK.
Extra information for quad() inputs and outputs
If full_output is non-zero, then the third output argument (infodict) is a dictionary with entries as tabulated below. For infinite limits, the range is transformed to (0,1) and the optional outputs are given with respect to this transformed range. Let M be the input argument limit and let K be infodict['last']. The entries are:
'neval'
The number of function evaluations.
'last'
The number, K, of subintervals produced in the subdivision process.
'alist'
A rank-1 array of length M, the first K elements of which are the left end points of the subintervals in the partition of the integration range.
'blist'
A rank-1 array of length M, the first K elements of which are the right end points of the subintervals.
'rlist'
A rank-1 array of length M, the first K elements of which are the integral approximations on the subintervals.
'elist'
A rank-1 array of length M, the first K elements of which are the moduli of the absolute error estimates on the subintervals.
'iord'
A rank-1 integer array of length M, the first L elements of which are pointers to the error estimates over the subintervals with L=K
if K<=M/2+2
or L=M+1-K
otherwise. Let I be the sequence infodict['iord']
and let E be the sequence infodict['elist']
. Then E[I[1]], ..., E[I[L]]
forms a decreasing sequence.
If the input argument points is provided (i.e., it is not None), the following additional outputs are placed in the output dictionary. Assume the points sequence is of length P.
'pts'
A rank-1 array of length P+2 containing the integration limits and the break points of the intervals in ascending order. This is an array giving the subintervals over which integration will occur.
'level'
A rank-1 integer array of length M (=limit), containing the subdivision levels of the subintervals, i.e., if (aa,bb) is a subinterval of (pts[1], pts[2])
where pts[0]
and pts[2]
are adjacent elements of infodict['pts']
, then (aa,bb) has level l if |bb-aa| = |pts[2]-pts[1]| * 2**(-l)
.
'ndin'
A rank-1 integer array of length P+2. After the first integration over the intervals (pts[1], pts[2]), the error estimates over some of the intervals may have been increased artificially in order to put their subdivision forward. This array has ones in slots corresponding to the subintervals for which this happens.
Weighting the integrand
The input variables, weight and wvar, are used to weight the integrand by a select list of functions. Different integration methods are used to compute the integral with these weighting functions, and these do not support specifying break points. The possible values of weight and the corresponding weighting functions are.
========== =================================== ===================== weight
Weight function used wvar
========== =================================== ===================== 'cos' cos(w*x) wvar = w 'sin' sin(w*x) wvar = w 'alg' g(x) = ((x-a)**alpha)*((b-x)**beta) wvar = (alpha, beta) 'alg-loga' g(x)*log(x-a) wvar = (alpha, beta) 'alg-logb' g(x)*log(b-x) wvar = (alpha, beta) 'alg-log' g(x)*log(x-a)*log(b-x) wvar = (alpha, beta) 'cauchy' 1/(x-c) wvar = c ========== =================================== =====================
wvar holds the parameter w, (alpha, beta), or c depending on the weight selected. In these expressions, a and b are the integration limits.
For the 'cos' and 'sin' weighting, additional inputs and outputs are available.
For finite integration limits, the integration is performed using a Clenshaw-Curtis method which uses Chebyshev moments. For repeated calculations, these moments are saved in the output dictionary:
'momcom'
The maximum level of Chebyshev moments that have been computed, i.e., if M_c
is infodict['momcom']
then the moments have been computed for intervals of length |b-a| * 2**(-l)
, l=0,1,...,M_c
.
'nnlog'
A rank-1 integer array of length M(=limit), containing the subdivision levels of the subintervals, i.e., an element of this array is equal to l if the corresponding subinterval is |b-a|* 2**(-l)
.
'chebmo'
A rank-2 array of shape (25, maxp1) containing the computed Chebyshev moments. These can be passed on to an integration over the same interval by passing this array as the second element of the sequence wopts and passing infodict['momcom'] as the first element.
If one of the integration limits is infinite, then a Fourier integral is computed (assuming w neq 0). If full_output is 1 and a numerical error is encountered, besides the error message attached to the output tuple, a dictionary is also appended to the output tuple which translates the error codes in the array info['ierlst']
to English messages. The output information dictionary contains the following entries instead of 'last', 'alist', 'blist', 'rlist', and 'elist':
'lst'
The number of subintervals needed for the integration (call it K_f
).
'rslst'
A rank-1 array of length M_f=limlst, whose first K_f
elements contain the integral contribution over the interval (a+(k-1)c, a+kc)
where c = (2*floor(|w|) + 1) * pi / |w|
and k=1,2,...,K_f
.
'erlst'
A rank-1 array of length M_f
containing the error estimate corresponding to the interval in the same position in infodict['rslist']
.
'ierlst'
A rank-1 integer array of length M_f
containing an error flag corresponding to the interval in the same position in infodict['rslist']
. See the explanation dictionary (last entry in the output tuple) for the meaning of the codes.
Absolute error tolerance. Default is 1.49e-8. quad
tries to obtain an accuracy of abs(i-result) <= max(epsabs, epsrel*abs(i))
where i
= integral of :None:None:`func` from a to b, and result
is the numerical approximation. See :None:None:`epsrel` below.
Relative error tolerance. Default is 1.49e-8. If epsabs <= 0
, :None:None:`epsrel` must be greater than both 5e-29 and 50 * (machine epsilon)
. See :None:None:`epsabs` above.
An upper bound on the number of subintervals used in the adaptive algorithm.
A sequence of break points in the bounded integration interval where local difficulties of the integrand may occur (e.g., singularities, discontinuities). The sequence does not have to be sorted. Note that this option cannot be used in conjunction with weight
.
String indicating weighting function. Full explanation for this and the remaining arguments can be found below.
Variables for use with weighting functions.
Optional input for reusing Chebyshev moments.
An upper bound on the number of Chebyshev moments.
Upper bound on the number of cycles (>=3) for use with a sinusoidal weighting and an infinite end-point.
A Python function or method to integrate. If :None:None:`func` takes many arguments, it is integrated along the axis corresponding to the first argument.
If the user desires improved integration performance, then f may be a scipy.LowLevelCallable
with one of the signatures:
double func(double x) double func(double x, void *user_data) double func(int n, double *xx) double func(int n, double *xx, void *user_data)
The user_data
is the data contained in the scipy.LowLevelCallable
. In the call forms with xx
, n
is the length of the xx
array which contains xx[0] == x
and the rest of the items are numbers contained in the args
argument of quad.
In addition, certain ctypes call signatures are supported for backward compatibility, but those should not be used in new code.
Lower limit of integration (use -numpy.inf for -infinity).
Upper limit of integration (use numpy.inf for +infinity).
Extra arguments to pass to :None:None:`func`.
Non-zero to return a dictionary of integration information. If non-zero, warning messages are also suppressed and the message is appended to the output tuple.
An estimate of the absolute error in the result.
A dictionary containing additional information. Run scipy.integrate.quad_explain() for more information.
A convergence message.
Appended only with 'cos' or 'sin' weighting and infinite integration limits, it contains an explanation of the codes in infodict['ierlst']
Compute a definite integral.
dblquad
double integral
fixed_quad
fixed-order Gaussian quadrature
nquad
n-dimensional integrals (uses :None:None:`quad` recursively)
ode
ODE integrator
odeint
ODE integrator
quadrature
adaptive Gaussian quadrature
romb
integrator for sampled data
scipy.special
for coefficients and roots of orthogonal polynomials
simpson
integrator for sampled data
tplquad
triple integral
Calculate $\int^4_0 x^2 dx$ and compare with an analytic result
>>> from scipy import integrate
... x2 = lambda x: x**2
... integrate.quad(x2, 0, 4) (21.333333333333332, 2.3684757858670003e-13)
>>> print(4**3 / 3.) # analytical result 21.3333333333
Calculate $\int^\infty_0 e^{-x} dx$
>>> invexp = lambda x: np.exp(-x)
... integrate.quad(invexp, 0, np.inf) (1.0, 5.842605999138044e-11)
>>> f = lambda x,a : a*x
... y, err = integrate.quad(f, 0, 1, args=(1,))
... y 0.5
>>> y, err = integrate.quad(f, 0, 1, args=(3,))
... y 1.5
from scipy import integrate import ctypes lib = ctypes.CDLL('/home/.../testlib.*') #use absolute path lib.func.restype = ctypes.c_double lib.func.argtypes = (ctypes.c_int,ctypes.c_double) integrate.quad(lib.func,0,1,(1)) #(1.3333333333333333, 1.4802973661668752e-14) print((1.0**3/3.0 + 1.0) - (0.0**3/3.0 + 0.0)) #Analytic result # 1.3333333333333333
Be aware that pulse shapes and other sharp features as compared to the size of the integration interval may not be integrated correctly using this method. A simplified example of this limitation is integrating a y-axis reflected step function with many zero values within the integrals bounds.
>>> y = lambda x: 1 if x<=0 else 0
... integrate.quad(y, -1, 1) (1.0, 1.1102230246251565e-14)
>>> integrate.quad(y, -1, 100) (1.0000000002199108, 1.0189464580163188e-08)
>>> integrate.quad(y, -1, 10000) (0.0, 0.0)See :
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.integrate._quadrature.simpson
scipy.integrate._quadpack_py.dblquad
scipy.integrate._odepack_py.odeint
scipy.integrate._quadrature.quadrature
scipy.integrate._quadrature.romb
scipy.integrate._quadrature.romberg
scipy.integrate._quadrature.fixed_quad
scipy.integrate._quadrature.cumulative_trapezoid
scipy.integrate._quadpack_py.quad
scipy.integrate._quadpack_py.nquad
scipy.integrate._ode.ode
scipy.integrate._quadpack_py.tplquad
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them