is a method of finding the root of a function f(x) with a one-point approach, where the function f(x) has a derivative. This method uses a one-point approach as a starting point. The closer our chosen starting point is to the real root, the faster it will converge to the root. more information about newtonrapshon
- Start
- Define the function as f(x)
- Define the first derivative of f (x) g (x) g (x) i (x)
- Enter the first number, coefficient x, constant, initial estimate (top), tolerable error (error) and maximum iterations (bottom)
- Initialization of iteration counter i = 1
- If g (top) = 0 then print "Error" and go (12) otherwise go (7)
- Calcualte x1 = up - f (above) / add (above) for addition and calcualte x1 = up - f(above)/less(above) for subtraction
- Iteration counter increment i = i + 1
- If i>=N then print "not convergent" and go (12) otherwise go (10)
- If | f(x1) | > e then set up = x1 and go (6) otherwise go (11)
- Print the result as x1
- Stop
- Start
- Define the function as f(x)
- Define the derivative of the function as g(x)
- Input: A. Initial guess over b. Error Tolerable error c. Bottom Maximum Iteration
- Initialization of iteration counter step = 1
- Do it
If bottom(up) = 0
Print "error"
Stop
Ends if
if operator +
x1 = up - f (up)/plus(up)
top = x1
if operator -
x1 = up - h(up)/less(up)
step = step + 1
If step> down
Print "Not Converging"
Stop
Ends if
While abs f(x1)> e
- Print root as x1
- Stop """