Numerical Methods
Techniques for finding approximate solutions to complex equations that cannot be solved algebraically.
In A-Level Mathematics, we often solve equations algebraically to find exact roots. However, many real-world and complex equations, such as `e^x = 4x`, cannot be solved this way. Numerical Methods provide us with powerful techniques to find highly accurate *approximate* solutions to such equations.
### Part 1: Locating a Root - The Change of Sign Method
Before finding a root, we must first confirm its approximate location. A root of an equation `f(x) = 0` is a value of `x` for which the function's value is zero. Graphically, it's where the curve `y = f(x)` intersects the x-axis.
The change of sign method is based on a simple but fundamental idea: if a continuous function `f(x)` has a value that is negative at `x = a` and positive at `x = b`, it must cross the x-axis at least once between `a` and `b`.
Process for Locating a Root:
Example: Show that the equation `x³ - 5x + 3 = 0` has a root between `x = 0` and `x = 1`.
* Let `f(x) = x³ - 5x + 3`.
* Calculate `f(0) = (0)³ - 5(0) + 3 = +3`.
* Calculate `f(1) = (1)³ - 5(1) + 3 = -1`.
* Since there is a change of sign from positive to negative, we can conclude that at least one root lies between 0 and 1.
### Part 2: Iterative Methods for Approximating a Root
Once we have located a root in a small interval, we can use an iterative formula to find a more accurate approximation. The core idea is to generate a sequence of values that get progressively closer to the actual root.
Process for Iteration:
Example: Find a root of `x³ - 5x + 3 = 0` correct to 3 d.p., using the rearrangement `x = (x³ + 3) / 5` and a starting value `x₀ = 0.5`.
* The iterative formula is `x_(n+1) = (x_n³ + 3) / 5`.
* `x₀ = 0.5`
* `x₁ = (0.5³ + 3) / 5 = 0.625`
* `x₂ = (0.625³ + 3) / 5 = 0.6489...`
* `x₃ = (0.6489...³ + 3) / 5 = 0.6548...`
* `x₄ = (0.6548...³ + 3) / 5 = 0.6562...`
* `x₅ = (0.6562...³ + 3) / 5 = 0.6565...`
* `x₆ = (0.6565...³ + 3) / 5 = 0.6566...`
* `x₇ = (0.6566...³ + 3) / 5 = 0.6566...`
Since `x₆` and `x₇` are both `0.6566...`, they are identical to 3 decimal places. Thus, the root is 0.657 (to 3 d.p.). To prove this, it's good practice to show values to more significant figures before rounding.
### Part 3: Convergence and Divergence
Not every iterative formula will successfully find a root. The sequence of approximations might get closer to the root (convergence) or move further away from it (divergence).
Convergence depends on the gradient of the function `F(x)` near the root. For an iterative process `x_(n+1) = F(x_n)` to converge to a root `α`, the condition |F'(α)| < 1 must be met. This means the gradient of `y = F(x)` must be between -1 and 1 at the point of intersection with `y = x`.
We can visualize this behaviour using graphs:
* Staircase Diagram: If `0 < F'(α) < 1`, the iteration steps will form a staircase pattern, homing in on the root.
* Cobweb Diagram: If `-1 < F'(α) < 0`, the iteration steps will spiral inwards towards the root in a cobweb pattern.
If |F'(α)| > 1, the diagrams would show an outward spiral, indicating a divergent iteration that will fail to find the root.
Key Points to Remember
- 1A root of f(x) = 0 lies in (a, b) if f(x) is continuous and f(a) and f(b) have **opposite signs**.
- 2An equation f(x) = 0 must be rearranged into the iterative form **x = F(x)**.
- 3The iterative formula **x_(n+1) = F(x_n)** generates a sequence of approximations from a starting value x₀.
- 4Iteration continues until successive approximations agree to the required **degree of accuracy**.
- 5An iterative process **converges** if the approximations approach the root and **diverges** if they move away.
- 6For convergence to a root α, the condition **|F'(α)| < 1** must be satisfied near the root.
- 7**Staircase** and **cobweb diagrams** are graphical representations of the iterative process.
- 8Always show calculated values to a higher degree of accuracy before rounding to justify your final answer.
Pakistan Example
Calculating Load Capacity in Civil Engineering
When designing foundations for buildings in cities like Karachi or Lahore, civil engineers use complex formulas to determine the load-bearing capacity of soil. These formulas, like the Terzaghi or Meyerhof equations, are often non-linear and involve variables for soil cohesion, friction angle, and foundation depth. Solving for a specific design parameter, such as the required width of a foundation for a given load, often leads to an equation with no direct algebraic solution. Engineers can use numerical iteration, starting with an initial estimate, to approximate the required foundation width to a high degree of accuracy, ensuring the structural integrity of a new high-rise building or bridge.
Quick Revision Infographic
Mathematics — Quick Revision
Numerical Methods
Key Concepts
Formulas to Know
A root of f(x) = 0 lies in (a, b) if f(x) is continuous and f(a) and f(b) have **opposite signs**.An equation f(x) = 0 must be rearranged into the iterative form **x = F(x)**.The iterative formula **x_(n+1) = F(x_n)** generates a sequence of approximations from a starting value x₀.Calculating Load Capacity in Civil Engineering
When designing foundations for buildings in cities like Karachi or Lahore, civil engineers use complex formulas to determine the load-bearing capacity of soil. These formulas, like the Terzaghi or Meyerhof equations, are often non-linear and involve variables for soil cohesion, friction angle, and foundation depth. Solving for a specific design parameter, such as the required width of a foundation for a given load, often leads to an equation with no direct algebraic solution. Engineers can use numerical iteration, starting with an initial estimate, to approximate the required foundation width to a high degree of accuracy, ensuring the structural integrity of a new high-rise building or bridge.