Numerical Integration and Differentiation: Methods and Examples

Numerical Integration and Differentiation
Numerical Integration and Differentiation are fundamental tools in various fields like
engineering, physics, and data science. They provide ways to estimate integrals and
derivatives of functions when analytical solutions are difficult or impossible to obtain.
Understanding these methods allows you to solve complex problems using computational
techniques, especially when dealing with discrete data or functions defined by data points.
Numerical Integration
Numerical integration, also known as quadrature, is the process of approximating the definite
integral of a function. The need for numerical integration arises when the antiderivative of a
function is not known or is difficult to compute, or when the function is only known at discrete
points.
Riemann Sums
Riemann Sums are a basic method for approximating the area under a curve. They involve
dividing the interval of integration into subintervals and approximating the area in each
subinterval using rectangles. There are three main types of Riemann Sums:
●​ Left Riemann Sum: Uses the left endpoint of each subinterval to determine the height
of the rectangle.
●​ Right Riemann Sum: Uses the right endpoint of each subinterval to determine the
height of the rectangle.
●​ Midpoint Rule: Uses the midpoint of each subinterval to determine the height of the
rectangle.
Example: Approximate the integral of f(x) = x<sup>2</sup> from 0 to 1 using a Left Riemann
Sum with n = 4 subintervals.
1.​ The width of each subinterval is (1-0)/4 = 0.25.
2.​ The left endpoints are 0, 0.25, 0.5, and 0.75.
3.​ The Riemann Sum is:​
0.25 * (0<sup>2</sup> + 0.25<sup>2</sup> + 0.5<sup>2</sup> +
0.75<sup>2</sup>) = 0.21875
Example: Approximate the integral of f(x) = e<sup>-x</sup> from 0 to 2 using the Right
Riemann Sum with n = 5 subintervals.
1.​ The width of each subinterval is (2-0)/5 = 0.4.
2.​ The right endpoints are 0.4, 0.8, 1.2, 1.6, and 2.
3.​ The Riemann Sum is:​
0.4 * (e<sup>-0.4</sup> + e<sup>-0.8</sup> + e<sup>-1.2</sup> +
e<sup>-1.6</sup> + e<sup>-2</sup>) ≈ 0.4463
Example (Midpoint Rule): Approximate the integral of f(x) = sin(x) from 0 to π/2 using the
Midpoint Rule with n = 3 subintervals.
1.​ The width of each subinterval is (π/2 - 0)/3 = π/6.
2.​ The midpoints are π/12, 3π/12, 5π/12.
3.​ The Riemann Sum is:​
(π/6) * (sin(π/12) + sin(3π/12) + sin(5π/12)) ≈ 0.9560
Trapezoidal Rule
The Trapezoidal Rule approximates the integral by dividing the area under the curve into
trapezoids instead of rectangles. It averages the function values at the endpoints of each
subinterval.
Formula:
∫<sub>a</sub><sup>b</sup> f(x) dx ≈ (Δx/2) * [f(x<sub>0</sub>) + 2f(x<sub>1</sub>) +
2f(x<sub>2</sub>) + ... + 2f(x<sub>n-1</sub>) + f(x<sub>n</sub>)]
where Δx = (b-a)/n and x<sub>i</sub> = a + iΔx.
Example: Approximate the integral of f(x) = x<sup>3</sup> from 1 to 3 using the Trapezoidal
Rule with n = 4 subintervals.
1.​ Δx = (3-1)/4 = 0.5.
2.​ The x values are 1, 1.5, 2, 2.5, and 3.
3.​ The Trapezoidal Rule gives:​
(0.5/2) * [1<sup>3</sup> + 2(1.5<sup>3</sup>) + 2(2<sup>3</sup>) +
2(2.5<sup>3</sup>) + 3<sup>3</sup>] = 20
Example: Approximate the integral of f(x) = ln(x) from 1 to 2 using the Trapezoidal Rule with
n = 5 subintervals.
1.​ Δx = (2-1)/5 = 0.2.
2.​ The x values are 1, 1.2, 1.4, 1.6, 1.8, and 2.
3.​ The Trapezoidal Rule gives:​
(0.2/2) * [ln(1) + 2ln(1.2) + 2ln(1.4) + 2ln(1.6) + 2ln(1.8) + ln(2)] ≈ 0.3864
Simpson's Rule
Simpson's Rule approximates the integral by using quadratic polynomials to interpolate the
function within each subinterval. It generally provides a more accurate approximation than
the Riemann Sums and the Trapezoidal Rule. n must be even when using Simpson's rule.
Formula:
∫<sub>a</sub><sup>b</sup> f(x) dx ≈ (Δx/3) * [f(x<sub>0</sub>) + 4f(x<sub>1</sub>) +
2f(x<sub>2</sub>) + 4f(x<sub>3</sub>) + ... + 2f(x<sub>n-2</sub>) + 4f(x<sub>n-1</sub>)
+ f(x<sub>n</sub>)]
where Δx = (b-a)/n and x<sub>i</sub> = a + iΔx.
Example: Approximate the integral of f(x) = x<sup>4</sup> from 0 to 2 using Simpson's
Rule with n = 4 subintervals.
1.​ Δx = (2-0)/4 = 0.5.
2.​ The x values are 0, 0.5, 1, 1.5, and 2.
3.​ Simpson's Rule gives:​
(0.5/3) * [0<sup>4</sup> + 4(0.5<sup>4</sup>) + 2(1<sup>4</sup>) +
4(1.5<sup>4</sup>) + 2<sup>4</sup>] ≈ 6.4667
Example: Approximate the integral of f(x) = cos(x) from 0 to π using Simpson's Rule with n =
6 subintervals.
1.​ Δx = (π-0)/6 = π/6.
2.​ The x values are 0, π/6, π/3, π/2, 2π/3, 5π/6, and π.
3.​ Simpson's Rule gives:​
(π/18) * [cos(0) + 4cos(π/6) + 2cos(π/3) + 4cos(π/2) + 2cos(2π/3) + 4cos(5π/6) +
cos(π)] ≈ -0.000794
Adaptive Quadrature
Adaptive quadrature methods automatically adjust the step size Δx based on the behavior of
the function. Regions where the function varies rapidly are divided into smaller subintervals
to improve accuracy, while regions where the function is smooth use larger subintervals to
reduce computational cost. Adaptive quadrature is often implemented using recursive
algorithms.
●​ How it works:
●​ Estimate the integral over an interval.
●​ Estimate the error in the approximation.
●​ If the error is too large, divide the interval into smaller subintervals and repeat
the process.
●​ If the error is acceptable, accept the approximation and move on.
●​ Benefits:
●​ Higher accuracy for functions with varying behavior.
●​ Automatic adjustment of step size, reducing the need for manual tuning.
Practice Activities for Numerical Integration
1.​ Riemann Sums: Approximate the integral of f(x) = x<sup>3</sup> + 1 from 0 to 2
using Left, Right and Midpoint Riemann sums, with n = 5.
2.​ Trapezoidal Rule: Approximate the integral of f(x) = sin(x) + cos(x) from 0 to π/2
using the Trapezoidal Rule with n = 4.
3.​ Simpson's Rule: Approximate the integral of f(x) = 1/(1 + x<sup>2</sup>) from -1 to 1
using Simpson's Rule with n = 6.
4.​ Comparison: Compare the accuracy of the Left Riemann Sum, Trapezoidal Rule, and
Simpson's Rule for approximating the integral of f(x) = e<sup>x</sup> from 0 to 1
with n = 10.
5.​ Adaptive Quadrature (Conceptual): Explain how adaptive quadrature can improve the
accuracy of numerical integration when dealing with a function that has a sharp peak
in the interval of integration.
Numerical Differentiation
Numerical differentiation is the process of approximating the derivative of a function at a
given point using values of the function at nearby points. It's used when the analytical
derivative is unknown or difficult to compute, or when the function is only known at discrete
points.
Finite Difference Approximations
Finite difference approximations are the most common methods for numerical differentiation.
They involve approximating the derivative using the function values at nearby points.
●​ Forward Difference:​
f'(x) ≈ (f(x + h) - f(x)) / h​
where h is a small step size.
●​ Backward Difference:​
f'(x) ≈ (f(x) - f(x - h)) / h​
where h is a small step size.
●​ Central Difference:​
f'(x) ≈ (f(x + h) - f(x - h)) / (2h)​
The central difference is generally more accurate than forward or backward
differences.
Example: Approximate the derivative of f(x) = x<sup>2</sup> at x = 2 using the Forward
Difference with h = 0.1.
f'(2) ≈ (f(2.1) - f(2)) / 0.1 = (2.1<sup>2</sup> - 2<sup>2</sup>) / 0.1 = 4.1
Example: Approximate the derivative of f(x) = sin(x) at x = π/4 using the Backward
Difference with h = 0.05.
f'(π/4) ≈ (f(π/4) - f(π/4 - 0.05)) / 0.05 = (sin(π/4) - sin(π/4 - 0.05)) / 0.05 ≈ 0.6771
Example: Approximate the derivative of f(x) = e<sup>x</sup> at x = 1 using the Central
Difference with h = 0.01.
f'(1) ≈ (f(1.01) - f(0.99)) / (20.01) = (e<sup>1.01</sup> - e<sup>0.99</sup>) / 0.02 ≈ 2.7183*
Higher-Order Approximations
Higher-order finite difference approximations use more points to achieve higher accuracy.
For example, a higher-order central difference approximation for the first derivative is:
f'(x) ≈ (-f(x + 2h) + 8f(x + h) - 8f(x - h) + f(x - 2h)) / (12h)
Example: Approximate the derivative of f(x) = x<sup>3</sup> at x = 1 using the higher-order
central difference with h = 0.1.
f'(1) ≈ (-f(1.2) + 8f(1.1) - 8f(0.9) + f(0.8)) / (120.1) = (-1.2<sup>3</sup> + 81.1<sup>3</sup>
- 80.9<sup>3</sup> + 0.8<sup>3</sup>) / 1.2 ≈ 3.00*
Numerical Differentiation of Data
When a function is only known at discrete points (e.g., from experimental data), numerical
differentiation can be used to estimate the derivative. The same finite difference formulas
can be applied, but the choice of h is determined by the spacing of the data points.
Choosing the Step Size (h)
The choice of the step size h is critical in numerical differentiation.
●​ Too large: Can lead to large truncation errors (due to the approximation of the
derivative).
●​ Too small: Can lead to large round-off errors (due to the finite precision of computer
arithmetic).
In practice, it is often necessary to experiment with different values of h to find a balance
between these two types of errors.
Practice Activities for Numerical Differentiation
1.​ Finite Differences: Approximate the derivative of f(x) = x<sup>2</sup> - x at x = 1
using Forward, Backward, and Central Differences, with h = 0.05.
2.​ Higher-Order Approximation: Approximate the derivative of f(x) = cos(x) at x = π/3
using a higher-order central difference with h = 0.1.