Numerical Integration — Definition, Formula & Examples
Numerical integration is a set of techniques for approximating the value of a definite integral using arithmetic calculations on sampled function values, rather than finding an exact antiderivative.
Given a definite integral , numerical integration (or numerical quadrature) estimates its value by partitioning into subintervals and computing a weighted sum of function values at selected points, producing an approximation whose error can be bounded in terms of and the derivatives of .
Key Formula
Where:
- = Lower and upper bounds of integration
- = Number of subintervals
- = Width of each subinterval
- = The $i$-th partition point: $x_i = a + ih$
How It Works
You divide the interval into equal subintervals of width . For the Trapezoidal Rule, you approximate the area under the curve by connecting consecutive points with straight lines, giving . For Simpson's Rule (which requires even), you fit parabolas through consecutive triples of points, giving . Simpson's Rule is generally more accurate for smooth functions because parabolas track curvature better than straight lines. Increasing reduces error in both methods.
Worked Example
Problem: Use the Trapezoidal Rule with to approximate .
Step 1: Compute the subinterval width.
Step 2: List the partition points and function values: with giving .
Step 3: Apply the Trapezoidal Rule formula.
Answer: . The exact value is , so the approximation overshoots by about .
Why It Matters
Many real-world integrals, such as those arising from experimental data or functions like , have no closed-form antiderivative. Numerical integration is the standard tool in engineering, physics, and computational science for evaluating these integrals to any desired accuracy.
Common Mistakes
Mistake: Using Simpson's Rule with an odd number of subintervals.
Correction: Simpson's Rule requires an even number of subintervals ( must be even) because it fits parabolas through groups of three consecutive points.
