How is the Babylonian recurrence relation decomposed into two functions for geometric visualization?

Conditions

• $a > 0$
• $x_n > 0$

Reasoning, step by step

1. Start with the standard Babylonian update rule: $x_{n+1} = \frac{1}{2}(x_n + \frac{a}{x_n})$.
2. Identify the two terms inside the parentheses.
3. Define the first term as a function of $x$: $f(x) = x$.
4. Define the second term as a function of $x$: $g(x) = \frac{a}{x}$.
5. Rewrite the recurrence as $x_{n+1} = \frac{1}{2}(f(x_n) + g(x_n))$.
6. Visualize $f(x)$ as the line $y=x$ and $g(x)$ as the curve $y=a/x$.

Example

We rewrite the iteration step as the average of two functions: $x_{n+1} = \frac{1}{2}(f(x_n) + g(x_n))$, where $f(x) = x$ represents identity and $g(x) = \frac{a}{x}$ represents inverse proportionality.

Common misconceptions

• Thinking that $f(x)$ and $g(x)$ are added horizontally rather than vertically averaged.
• Assuming $g(x)$ is linear; it is non-linear (hyperbolic), which drives the rapid convergence.

Watch the explanation

Explore next

• Why is the factor $1/2$ necessary in the decomposition?
• Can this decomposition be generalized to cube roots?