Newton's method
Summary
Newton's method finds approximate zeros of a differentiable function . From a starting point , it computes Each new point is the zero of the tangent line to the graph at the old point.
Remarks
Assume is near a zero with . Then the method converges to for close to . The convergence is quadratic: . For , the step is . This is Heron's method for . The method can fail. It stops when , 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.
- no evidence level
- Limit point of a set definition
- Limit of a function definition
- Derivative definition
- Tangent line concept
- Newton's method concept
Sources
- Web https://en.wikipedia.org/wiki/Newton%27s_method, Description
What links here
No node links to this node yet.