Scribd Logo
Upload

Welcome to Scribd!

  • 47 views

    Algorithm:: Experiment No: 03 Experiment Name: Write A Program Implementation of Aim

    Uploaded by

    Rasel Madber
    The document describes an experiment to implement the Newton-Raphson method to find the root of a function. The Newton-Raphson method uses successive approximations to find the root of a function by taking the tangent line of the function at a point and finding where it crosses the x-axis. The algorithm involves defining an initial guess, calculating the function value and derivative at that point, using them to get a new estimate, and repeating until the value is within the tolerance threshold. The program code provided implements this method to find the root of the function f(x) = 3x - cos(x) - 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Algorithm:: Experiment No: 03 Experiment Name: Write A Program Implementation of Aim

    Uploaded by

    Rasel Madber
    47 views3 pages
    The document describes an experiment to implement the Newton-Raphson method to find the root of a function. The Newton-Raphson method uses successive approximations to find the root of a function by taking the tangent line of the function at a point and finding where it crosses the x-axis. The algorithm involves defining an initial guess, calculating the function value and derivative at that point, using them to get a new estimate, and repeating until the value is within the tolerance threshold. The program code provided implements this method to find the root of the function f(x) = 3x - cos(x) - 1.

    Original Title

    Newton Rapson Method Rasel Madber-43

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an experiment to implement the Newton-Raphson method to find the root of a function. The Newton-Raphson method uses successive approximations to find the root of a function by taking the tangent line of the function at a point and finding where it crosses the x-axis. The algorithm involves defining an initial guess, calculating the function value and derivative at that point, using them to get a new estimate, and repeating until the value is within the tolerance threshold. The program code provided implements this method to find the root of the function f(x) = 3x - cos(x) - 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    47 views3 pages

    Algorithm:: Experiment No: 03 Experiment Name: Write A Program Implementation of Aim

    Uploaded by

    Rasel Madber
    The document describes an experiment to implement the Newton-Raphson method to find the root of a function. The Newton-Raphson method uses successive approximations to find the root of a function by taking the tangent line of the function at a point and finding where it crosses the x-axis. The algorithm involves defining an initial guess, calculating the function value and derivative at that point, using them to get a new estimate, and repeating until the value is within the tolerance threshold. The program code provided implements this method to find the root of the function f(x) = 3x - cos(x) - 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Experiment No: 03

    Experiment Name: Write a program Implementation of Newton Rapson Method.


    Aim: The Newton-Raphson method (also known as Newton's method) is a way to quickly find
    a good approximation for the root of a real-valued function f(x) = 0f(x)=0. It uses the idea that a
    continuous and differentiable function can be approximated by a straight line tangent to it.
    Algorithm:
    Newton Raphson method Steps (Rule)

    Step-1: Find points a and b such that a<b and f(a)⋅f(b)<0.

    Step-2: Take the interval [a,b] and


    find next value x0=a+b2

    Step-3:
    ( ) ()
    Find f x0 and f′ x0

    x =x -f(x )f′(x )
    1 0 0 0

    Step-4:
    ( )
    If f x1 =0 then x1 is an exact root,
    else x0=x1

    Step-5:
    ()
    Repeat steps 3 and 4 until f xi =0 or |f(x )|≤Accuracy
    i

    Program Cord:
    #include<stdio.h>
    #include<conio.h>
    #include<math.h>
    #include<stdlib.h>

    /* Defining equation to be solved.


    Change this equation to solve another problem. */
    #define f(x) 3*x - cos(x) -1

    /* Defining derivative of g(x).


    As you change f(x), change this function also. */
    #define g(x) 3 + sin(x)

    void main()
    {
    float x0, x1, f0, f1, g0, e;
    int step = 1, N;
    clrscr();
    /* Inputs */
    printf("\nEnter initial guess:\n");
    scanf("%f", &x0);
    printf("Enter tolerable error:\n");
    scanf("%f", &e);
    printf("Enter maximum iteration:\n");
    scanf("%d", &N);
    /* Implementing Newton Raphson Method */
    printf("\nStep\t\tx0\t\tf(x0)\t\tx1\t\tf(x1)\n");
    do
    {
    g0 = g(x0);
    f0 = f(x0);
    if(g0 == 0.0)
    {
    printf("Mathematical Error.");
    exit(0);
    }

    x1 = x0 - f0/g0;

    printf("%d\t\t%f\t%f\t%f\t%f\n",step,x0,f0,x1,f1);
    x0 = x1;

    step = step+1;

    if(step > N)
    {
    printf("Not Convergent.");
    exit(0);
    }

    f1 = f(x1);

    }while(fabs(f1)>e);

    printf("\nRoot is: %f", x1);


    getch();
    }
    Input:
    Enter initial guess:
    1
    Enter tolerable error:
    0.00001
    Enter maximum iteration:
    10

    Output:
    Enter initial guess:
    1
    Enter tolerable error:
    0.00001
    Enter maximum iteration:
    10

    Step x0 f(x0) x1 f(x1)


    1 1.000000 1.459698 0.620016 0.000000
    2 0.620016 0.046179 0.607121 0.046179
    3 0.607121 0.000068 0.607102 0.000068

    Root is: 0.607102

    You might also like