Newton Raphson Method
- Iterative procedure that refines an initial guess to approximate a root of an equation.
- Each iteration uses the function value and its derivative to compute a better approximation.
- Repeat the update until the approximation is sufficiently close to the actual root.
Definition
Section titled “Definition”The Newton–Raphson method is a widely used iterative method to find the roots of a given equation. It is based on the idea that if we can approximate the root of a given equation, we can use that approximation to find an even better approximation.
Explanation
Section titled “Explanation”- Start by choosing an initial guess for the root; this can be any value believed to be near the actual root.
- Use the chosen approximation together with the function and its derivative to compute an improved approximation.
- The method applies the update formula as presented in the source:
- Repeat the update iteratively until the result is close enough to the true root.
Examples
Section titled “Examples”Example 1 — quadratic:
Section titled “Example 1 — quadratic: x2−6x+9=0x^2 - 6x + 9 = 0x2−6x+9=0”Choose initial guess: (x = 3).
Apply the update:
The improved approximation is (x = 3).
Initial guess: (x = 1).
First improved approximation:
Second improved approximation:
As shown, each improved approximation moves closer to the actual root; the process is continued until the approximation is sufficiently accurate.
Related terms
Section titled “Related terms”- Derivative
- Root (of an equation)
- Iterative method