0

I have gained a comprehension of the operational process through the discussion located at Why does Newton's method work?. Nevertheless, there is one aspect that remains unclear to me.

To initiate, we choose a pair of values, $(x_0, f(x_0))$, where $x_0$ is in proximity to the true root of $f(x)$ that I am seeking. Subsequently, we determine the linearization of $f(x)$ at this point, denoted as $L_{x0}(x)$. In favorable conditions, I can identify the root of $L_{x0}(x)$, which I will refer to as $x_1$. It seems reasonable to anticipate that $x_1$ will provide a more accurate approximation to the true root of $f(x)$, which is the one I actually require.

However, I am uncertain about how creating a tangent line at the point $(x_1, f(x_1))$ will result in a more precise approximation, which we can designate as $x_2$, to the true root of $f(x)$ in comparison to $x_1$.

My explanation is that, for the same reason $x_1$ provided a superior approximation to the true root of $f(x)$ compared to $x_0$, $x_2$ offers a better approximation than $x_1$. Nonetheless, I am still unsure about my own response and remain open to any clarifications or insights on this matter.

  • @vishalnaakar I know that it is, but still is there any misunderstanding in my explanation? – Nijat Hamidov Oct 21 '23 at 13:16
  • Yeah I did get that point later. So, basically how do you linearize the function without the tangent??? –  Oct 21 '23 at 13:20
  • @vishalnaakar Well, here by linearization I mean finding an equation of the tangent line at the point of interest. – Nijat Hamidov Oct 21 '23 at 13:22
  • @vishalnaakar No, I was just asking if there are any inconsistencies in my explanation. – Nijat Hamidov Oct 21 '23 at 13:24
  • what do you mean by a better approximation ? the proximity of the point to the root in successive iterations.? –  Oct 21 '23 at 13:32
  • @vishalnaakar Approximations x0, x1, ..., x_n form a sequence which converges to the true root x. Better approximation means such x_k which is closer to x than the previous x1, x2, ..., x_k-1. – Nijat Hamidov Oct 21 '23 at 13:36
  • Ok, so you are trying to prove that $x_n - x_{n+1} \ge x_{n+2} - x_{n+1}$ $\forall n \in Z^+$ because of the linearization right? by which we can prove that the tangent provides a precise approximation. Are we convinced now? –  Oct 21 '23 at 14:06
  • @vishalnaakar I don't know whether this is the thing to prove, but I just gained intuition for my own explanation. – Nijat Hamidov Oct 21 '23 at 14:26

4 Answers4

1

So, Basically the question which you intend an answer for, which I have understood from the conversations is that.

How $L_{x_1}(x)$ provides a better approximation in the same way as $L_{x_0}(x)$ is defined?

At first, You take a point $x_0$ which is proximal to $x^*$ a root of $f$. Now, define $I_0 : [x^*,x_0]$ interval with absolute value $|x_0 - x^*|$. By linearization of $f$ at point $x_1$ we get an interval with absolute value $|x_1 - x^*|$.

The answer to your question is just equivalent to proving that,

$$|x_0 - x^*| \ge |x_1 - x^*|$$

Now $x_1 = x_0 - (f(x_0)/f'(x_0))$ by $L_{x_1}(x)$, So the equality would then demand $f(x_0)/f'(x_0) = 0$ $\implies$ either $f(x_0) = 0$ or $|f'(x_0)| \to \infty$ is satisfied.

With the above argument, You can prove that the $abs(I_0) \ge abs(I_1) \ge abs(I_2) ...... \ge abs(I_i)$. Here, the $abs(I_i)$ is defined as absolute value of the interval, $i \in Z^+$. ($I_i : [x^*,x_i]$)

0

When we take the tangent line from the point $f(x_o)$ the point where the tangent line intersects the x-axis is closer to the actual root than the previous proximity root thus improving the approximation and if we do it again we get a more and more better approximation here is the image showing it

0

The intuition is that when you solve $L_{x_0}(x) = 0$ and get $x_1$, you're computing the root of a linear approximation of $f(x)$ calculated around the point $x_0$. This function approximation $L_{x_0}(x)$ coincides with $f(x)$ at $x = x_0$ and gets worse as $x$ gets farther from $x_0$.

Now say you assume $x_1$ is closer to the actual root $x_*$ of $f(x)$ than $x_0$ is. Then, at the actual root $x_*$, $L_{x_1}(x)$ approximates $f(x)$ better than $L_{x_0}$ does.

The post you linked provides some good graphical examples for this intuition.

  • What do you mean by "at the actual root x∗ , Lx1(x) approximates f(x) better than Lx0 does."? In other words what do you mean when you say L_x1 approximates f(x) at the actual root x* ? Since you may say that L_x1 approximates f(x) at the point x_1 ... – Nijat Hamidov Oct 21 '23 at 13:29
  • $L_{x_1}$ is the line tangent to $f(x)$ at the point $x_1$. So it's exactly equal to $f(x)$ at that point. However, for a point $x$ close to $x_1$, $L{x_1}(x)$ should be close to $f(x)$ (as long as $f(x)$ is smooth) – Bernardo Boechat Oct 21 '23 at 13:51
  • Plot any smooth function on a graphing software such as GeoGebra. If you zoom in on the function around a point $x_0$, the graph will get very similar to the tangent line at that point. – Bernardo Boechat Oct 21 '23 at 13:55
0

The linked Wikipedia page also gives the analytic argument, recapitulated here. Suppose the root is at $x_\ast$ and the original guess is at $x_0$. Make a Taylor expansion of $f$ around $x_0$: $$ f(x_\ast) = f(x_0) + f'(x_0)(x_\ast - x_0) + \frac{1}{2} f''(t) (x_\ast-x_0)^2 $$ where $t$ is some number between $x_0$ and $x_\ast$. Now $f(x_\ast) = 0$, so $$ x_0 -\frac{f(x_0)}{f'(x_0)} = x_\ast - \frac{f''(t)}{2f'(x_0)}(x_\ast - x_0)^2 $$ The left-hand side is $x_1$. So $$ x_\ast - x_1 = -\frac{f''(t)}{2f'(x_0)}(x_\ast - x_0)^2 $$

The fraction is a bit tricky, but if there's an upper bound $C$ for it, you get that $|x_1 - x_\ast| \leq C |x_0 - x_\ast|^2$. So it's even better than a contraction mapping. Basically the number of decimal points of accuracy double each time.