Question

c++

Newton method for iteratively finding the root f(x) = 0. The equation is Where f(x) is the function, f'(x) is the derivative of f9x), Write a C++ program to find root for the function of f(x). The function is on your C++ homework 2 for F(x) = x + 2x -10 You may have two functions, for example, float f(float x) float f=x*x-4; //any function equation return f; float prime(float x) float prime = 2 * x; //derivative of the function return prime; Your main program reads an initial guess for x from the keyboard, and to a tolerance of 104. Use while loop for tolerance. Before the loop, guess x = any number, define tolerance. Inside loop will change step h every loop h = f(x)/ f'(x), Xnew = Xoia - h An example for output: Enter the initial guess of root 2 root is 1.85714 h-0.142857 root is 1.84746 -0.08968115 root is 1.84742 -4.26995e-85 Root x = 1.84742 Integration steps = 3

Answer 1

#include
#define EPSILON 0.0001 //tolerance
using namespace std;

double func(double x)
{
   return x*x*x - x*x + 2;
}

// Derivative of the above function which is 3*x^x - 2*x
double derivFunc(double x)
{
   return 3*x*x - 2*x;
}

// Function to find the root
void newtonRaphson(double x)
{
   int steps=0;
   double h = func(x) / derivFunc(x);
   while (abs(h) >= EPSILON)
   {
       h = func(x)/derivFunc(x);

       // x(i+1) = x(i) - f(x) / f'(x)
       x = x - h;
       cout<<"root is "<    cin>> x0;
   newtonRaphson(x0);
   return 0;
}