« previous | Thursday, February 20, 2014 | next »
Section 4.1: Numerical Differentiation
Section 4.3: Numerical Integration
Theorem. [Numerical Quadrature].
Where
- are points on the interval
- are constants defined by
- is a value in
Proof. Let be the Lagrange interpolating polynomial of . Since
is true for some in , it follows that
By substituting for the definition of , we obtain
If we let , we arrive at the desired formula:
such that is our approximation and is the error.
quod erat demonstrandum
Trapezoidal Rule
The simplest non-trivial case for the interpolating polynomial of is a line between two sample points.
For simplicity, the notation shall be used to express the (uniform) distance between equidistant points
Proof. We can apply the quadrature formula above using our definitions for and . Observe that can be abstracted to a term by the mean value theorem for some value because does not change signs on .
quod erat demonstrandum
Simpson's Rule
If we use a quadratic interpolating polynomial instead of a linear one, we can derive Simpson's rule. The interpolating parabola defined by three points , , and is given by
However, integrating this result using the quadrature method described above results in a error term. We can do better by using an alternative method involving the 3rd-degree Taylor polynomial expansion of centered at :
Proof. Plugging in our definitions above yields
Like in the proof for the trapezoidal rule, we can apply the mean value theorem to replace the factor in the integrand with the constant
Replacing with its approximation from Section 4.1 gives
The values and can be replaced by a common value , giving the desired formula:
quod erat demonstrandum
Degree of Accuracy
The degree of accuracy [in class, DAC], or precision, of a quadrature formula is the largest positive integer such that the formula is exact for , for each . Burden 197 [1]
I can't believe the book just gave this definition: it treats accuracy and precision as interchangeable terms. However, accuracy and precision are most certainly two distinct, separate topics.
The degree of accuracy may be found by finding the largest degree polynomial such that the error term is identically 0.
The error term of the trapezoidal rule has a second-derivative term, so polynomials of degree 1 are identically zero (e.g. ), but polynomials of degree 2 are constant (e.g. ). Hence the trapezoidal rule has degree of accuracy 1.
Similarly, the error term of Simpson's rule has a fourth-derivative term, so for polynomials of degree 3, , but . Therefore Simpson's rule has degree of accuracy 3.
- ↑
Burden, Richard L. and J. Douglas Faires.
Numerical Analysis.
9th ed.
Boston:
Brooks/Cole, Cengage Learning,
2011.
197.
Print.