Newton-Cotes Formulae
|
Calling Sequence
|
|
ApproximateInt(f(x), x = a..b, method = newtoncotes[N], opts)
ApproximateInt(f(x), a..b, method = newtoncotes[N], opts)
ApproximateInt(Int(f(x), x = a..b), method = newtoncotes[N], opts)
|
|
Parameters
|
|
f(x)
|
-
|
algebraic expression in variable 'x'
|
x
|
-
|
name; specify the independent variable
|
a, b
|
-
|
algebraic expressions; specify the interval
|
N
|
-
|
positive integer
|
opts
|
-
|
equation(s) of the form option=value where option is one of boxoptions, functionoptions, iterations, method, outline, output, partition, pointoptions, refinement, showarea, showfunction, showpoints, subpartition, view, or Student plot options; specify output options
|
|
|
|
|
Description
|
|
•
|
The ApproximateInt(f(x), x = a..b, method = newtoncotes[N], opts) command approximates the integral of f(x) from a to b by using the Nth order Newton-Cotes formula. The first two arguments (function expression and range) can be replaced by a definite integral.
|
•
|
If the independent variable can be uniquely determined from the expression, the parameter x need not be included in the calling sequence.
|
|
The Newton-Cotes formulae are generalizations of the simpler polynomial interpolation routines. The following table gives the correspondence between the other methods and the order.
|
Equivalent Method
|
Order
|
Trapezoid
|
1
|
Simpson's Rule
|
2
|
Simpson's 3/8 Rule
|
3
|
Boole's Rule
|
4
|
|
|
•
|
By default, the interval is divided into equal-sized subintervals.
|
|
|
Examples
|
|
>
|
|
| (1) |
>
|
|
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
>
|
|
| (6) |
>
|
|
>
|
|
>
|
|
|
|
See Also
|
|
Boole's Rules, plot/options, Simpson's 3/8 Rule, Simpson's Rule, Student, Student plot options, Student[Calculus1], Student[Calculus1][ApproximateInt], Student[Calculus1][ApproximateIntTutor], Student[Calculus1][RiemannSum], Student[Calculus1][VisualizationOverview], Trapezoidal Rule
|
|