Algebra Study Guide

In mathematics, equations can often be solved by finding the points where two functions intersect. When an exact algebraic solution is difficult or impossible to find, graphical methods offer a powerful way to approximate these solutions. This involves plotting the graphs of the functions involved and identifying their intersection points. Each intersection point represents a solution where the 'y' values of both functions are equal, meaning the 'x' value at that point is a solution to the equation formed by setting the two functions equal to each other.

For example, to solve an equation like $x^3 - 3x + 1 = 0$ graphically, you could plot the function $y = x^3 - 3x + 1$ and find where it crosses the x-axis (where $y=0$). The x-coordinates of these intersection points are the approximate solutions to the equation. Alternatively, you could rewrite the equation as $x^3 = 3x - 1$ and plot two separate functions: $y_1 = x^3$ and $y_2 = 3x - 1$. The x-coordinates of their intersection points would also be the approximate solutions to the original equation.

The accuracy of the approximation depends on the scale of the graph and the precision with which you can read values from it. Often, questions will ask you to estimate solutions to a certain degree of accuracy, or to identify solutions within a given range. Drawing accurate graphs and carefully reading coordinates are crucial skills. When an equation is rearranged, the choice of functions to plot can sometimes simplify the drawing process, for example, by plotting a more complex curve against a simpler straight line.

Iteration is a powerful numerical method used to find approximate solutions to equations, especially those that are difficult or impossible to solve directly. The core idea is to start with an initial guess, typically denoted as x₀, and then repeatedly apply a specific formula to generate a sequence of increasingly accurate approximations: x₁, x₂, x₃, and so on. This formula is called an iterative formula, usually represented as xₙ₁₁ = g(xₙ).

To use iteration, you first need to rearrange the equation f(x) = 0 into the iterative form x = g(x). There might be multiple ways to rearrange an equation into this form. The choice of iterative formula is critical, as not all rearrangements will converge to a solution. For an iteration to converge, the absolute value of the derivative of g(x) at the root must be less than 1, i.e., |g'(x)| < 1. This condition ensures that subsequent values get closer to the root. If |g'(x)| > 1, the iteration will diverge, moving further away from the root.

Once an iterative formula xₙ₁₁ = g(xₙ) is established and an initial guess x₀ is chosen, you calculate the first approximation x₁ = g(x₀). Then, you use x₁ to find x₂ = g(x₁), and continue this process. The iteration stops when successive approximations are sufficiently close to each other, or when the desired level of accuracy (e.g., a certain number of decimal places) is achieved. In practical terms, you might stop when two consecutive iterations round to the same value for the required precision. This method is fundamental in many scientific and engineering calculations where exact solutions are not obtainable.