Equation (6.31) is called Simpson’s 3/8 rule. For this rule, h ¼ðb aÞ=3. The error
associated with this numerical formula is
E ¼
3h
5
80
f
4ðÞ
ξðÞ: (6:32)
The error associated with Simpson’s 3/8 rule is Oh
5
, which is of the same order as Simpson’s 1/3
rule. The degree of precision of Simpson’s 3/8 rule is 3.
If the integration interval is divided into n > 3 subintervals, Simpson’s 3/8 rule can
be applied to each group of three consecutive subintervals. Thus, the integrand
function is approximated using a piecewise cubic polynomial interpolant.
However, to apply Simpson’s 3/8 rule, it is necessary for n to be divisible by 3. The
composite Simpson’s 3/8 formula is as follows:
ð
b
a
fxðÞdx
3h
8
fx
0
ðÞþ3
X
n=3
i¼1
fx
3i2
ðÞþfx
3i1
ðÞ½þ2
X
ðn=3Þ1
i¼1
fx
3i
ðÞþfx
n
ðÞ
!
:
(6:33)
The truncation error of Equation (6.33) is
E ¼
h
4
ðb aÞ
80
f
4ðÞ
: (6:34)
Since the truncation errors of the composite Simpson’s 1/3 rule and the composite
Simpson’s 3/8 rule are of the same order, both methods are often combined so that
restrictions need not be imposed on the number of subintervals (such as n must be
even or n must be a multiple of 3). If n is even, only the composite Simpson’s 1/3 rule
needs to be used. However, if n is odd, Simpson’s 3/8 rule can be used to integrate the
first three subintervals, while the remainder of the interval can be integrated using
composite Simpson’s 1/3 rule. The use of the 1/3 rule is preferred over the 3/8 rule
since fewer data points (or functional evaluations) are required by the 1/3 rule to
achieve the same level of accuracy.
In Simpson’s formulas, since the nodes are equally spaced, the accuracy of
integration will vary over the interval. To achieve a certain level of accuracy, the
largest subinterval width h within the most difficult region of integration that
produces a result of sufficient accuracy fixes the global step size. This subinterval
width must be applied over the entire interval, which unnecessarily increases the
number of subintervals required to calculate the integ ral. A more advanced algo-
rithm is the adaptive quadrature method, which selectively narrows the node spacing
when the accuracy condition is not met for a particular subinterval. The numerical
integration is performed twice for each subinterval, at a node spacing of h and at a
node spacing of h/2. The difference betw een the two integrals obtained with different
n (one twice the other) is used to e stimate the truncation error. If the error is greater
than the specified tolerance, the subinterval is halved recursively, and integration is
performed on each half by doubling the number of subintervals. The truncation
error is estimated based on the new node spacing and the decision to subdivide the
subinterval further is made accordingly. This procedure continues until the desired
accuracy level is met throughout the integration interval.
385
6.3 Newton–Cotes for mulas