Math 2.0

concept

Newton's method

Summary

Newton's method finds approximate zeros of a differentiable function ff. From a starting point x0x_0, it computes xn+1=xn−f(xn)f′(xn).x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}. Each new point is the zero of the tangent line to the graph at the old point.

Remarks

Assume ff is C2C^2 near a zero rr with f′(r)≠0f'(r) \ne 0. Then the method converges to rr for x0x_0 close to rr. The convergence is quadratic: ∣xn+1−r∣≤C∣xn−r∣2|x_{n+1} - r| \le C |x_n - r|^2. For f(x)=x2−2f(x) = x^2 - 2, the step is xn+1=(xn+2/xn)/2x_{n+1} = (x_n + 2/x_n)/2. This is Heron's method for 2\sqrt{2}. The method can fail. It stops when f′(xn)=0f'(x_n) = 0, and it can cycle or diverge from a poor starting point.

Explanations

L1 human

Replace the graph by its tangent line, and find where the line crosses the axis. Repeat from there. Near a simple root, each step roughly doubles the number of correct digits.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Limit point of a set definition
  2. Limit of a function definition
  3. Derivative definition
  4. Tangent line concept
  5. Newton's method concept

Sources

  1. Web https://en.wikipedia.org/wiki/Newton%27s_method, Description