2.5. Fixed-Point Iteration

Fixed-point iteration is an iterative method for finding the root of an equation f(x)=0 by transforming it into an equivalent form x=g(x), where g(x) is derived from the original equation.

Fixed-point iteration is a numerical method used to approximate solutions to equations. The main idea is to rearrange the equation f(x) = 0 into a form where x equals some other function of x, represented as g(x). This transformation allows us to define a new equation that, when solved iteratively, leads us closer to the root of the original equation.

Imagine if you're trying to find the right balance of ingredients in a recipe. Instead of directly calculating how much more of each ingredient you need, you make a guess based on what you've already added, adjust and taste the mixture repeatedly until you find the perfect flavor. Fixed-point iteration works similarly by refining the guess incrementally.

1. Rearrange the equation f(x)=0 into the form x=g(x).
2. Start with an initial guess x0.
3. Use the iterative formula: xn+1=g(xn).
4. Repeat the process until the difference between successive approximations is less than a desired tolerance: |xn+1−xn|<ϵ.

The fixed-point iteration process involves a series of clear steps. First, you need to transform your original equation into the form needed for iteration, x = g(x). Then, you choose a starting point, called the initial guess (x0). For each subsequent step, you calculate a new approximation by plugging the previous guess into g(x). This is repeated until the changes between guesses (|xn+1 - xn|) are smaller than a carefully chosen threshold (ϵ), indicating that you're close enough to the solution.

Think of it like adjusting the volume on your stereo. You start at a guess value, turn the knob slightly, and listen carefully. Each time you tweak the volume based on how it sounds, you zero in on what feels just right. That’s the essence of fixed-point iteration—making adjustments until you're satisfied with the result.

Advantages:

• Simple and easy to implement.
• No need for derivatives.

Disadvantages:

• Convergence is not guaranteed unless |g′(x)|<1 near the root.
• The method can be slow and inefficient if g(x) is not well chosen.

Fixed-point iteration has several benefits that make it appealing for use. It's straightforward to implement and doesn’t require knowledge of derivatives, which can complicate other methods. However, one key drawback is that it won't always converge to a solution; it relies on the condition that the derivative of g(x) is less than 1 in absolute terms near the root. If g(x) is poorly chosen, the iteration may stall or lead away from the root, making it less efficient.

This can be compared to selecting a route on a map using GPS. Sometimes, a simple path works fine (easy to implement), but if your GPS gets you stuck in traffic or on an unfamiliar road, you may end up lost (not converging). The right path ensures you reach your destination efficiently.

For f(x)=x2−4, we can rearrange the equation to x=4 or x=√(4 + x).

• Initial guess: x0=1.
• Iterate: x1=√(4 + 1)≈2.236 x2=√(4 + 2.236)≈2.415
• Continue iterating until the solution converges to x=2.

In this example, we want to find a root for the function f(x) = x² - 4. First, we rearrange this into a fixed-point form, x = √(4 + x), which gives us a clear iterative approach. Starting with an initial guess of x0 = 1, we compute the next guesses by substituting into the formula. As we iterate, the values approach the actual root, which is 2, indicating that the method is working effectively. The process continues until further changes in our guesses are imperceptible, indicating convergence.

Imagine you’re trying to find the height of a tree using shadow measurements. You make an initial guess (x0) based on the shadow length and measurements of nearby objects, then refine your guess iteratively as you measure again and again. Eventually, your guess aligns closely with the actual height (the root). This iterative refinement exemplifies fixed-point iteration in action.

--