numerical mathematics Define a function called approximate_newton(f, h, x0, epsilon, maximum_iterations),wheref is the name of the function whose root you are trying to approximate,h is a small positive stepsize to be used in approximating the derivative of f atthe different approximate roots (see approximate formula for f'(x) below),x0 is the initial guess of the root,epsilon is a small positive number used in the stopping condition of the algo-rithm, andmaximum iterations is the maximum number of iterations the method shouldhave.This function should do an approximate version of Newton's method in which thederivative term is replaced by the following approximation to the derivative:-f(x + h) − f (x)hƒ'(x)≈In the argument list of the function, epsilon should be assigned the default valueof 0.00001 and maximum_iterations should be assigned the default value of 100.If the maxmimum number of iterations is exceeded, an error message should beprinted stating that the method did not converge within the specified maximumnumber of iterations and the function should return None.The stopping condition for the main loop enacting the algorithm should be:STOP when abs (f(xn)) < epsilon for the first time OR maximum_iterationshas been exceeded, where în is the latest approximation to the root.Ensure that for each iteration of your approximate Newton's method, the followingare displayed: the iteration number n; the approximate root xn; and f(xn).

As per the question we will construct a Python code that implements an approximate version of…

Define a function called approximate_newton (f, h, x0, epsilon, maximum iterations), where f is the name of the function whose root you are trying to approximate, h is a small positive stepsize to be used in approximating the derivative of fat the different approximate roots (see approximate formula for f'(x) below), x0 is the initial guess of the root, epsilon is a small positive number used in the stopping condition of the algo- rithm, and maximum_iterations is the maximum number of iterations the method should have. This function should do an approximate version of Newton's method in which the derivative term is replaced by the following approximation to the derivative: f'(x) ≈ ƒ(x + h) − f (x) - h In the argument list of the function, epsilon should be assigned the default value of 0.00001 and maximum_iterations should be assigned the default value of 100. If the maxmimum number of iterations is exceeded, an error message should be printed stating that the method did not converge within the specified maximum number of iterations and the function should return None. The stopping condition for the main loop enacting the algorithm should be: STOP when abs(f(xn)) < epsilon for the first time OR maximum_iterations has been exceeded, where xn is the latest approximation to the root. Ensure that for each iteration of your approximate Newton's method, the following are displayed: the iteration number n; the approximate root xn; and f(xn).

2nd Edition

ISBN:9780321964038

Author:GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.

Publisher:GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.

Chapter3: The Derivative

Section3.CR: Chapter 3 Review

Problem 8CR