Scribd Logo
Upload

Welcome to Scribd!

  • C Progrmin of Newton Rapson Method

    Uploaded by

    Riya Karmakar
    16 views2 pages
    This document is an advanced mathematics assignment submitted by 4 students - Prakhyalakhy Das, Priya Rahul, Richa Mishra, and Riya Karmakar. It contains C code implementing the Newton-Raphson method to find the root of the function F(x) = x^3 - x - 4. The code takes an initial guess x0, calculates F(x) and its derivative F'(x), and updates the guess as x1 = x0 - F(x0)/F'(x0) until the difference between successive guesses is less than 0.00001 or the maximum number of iterations is reached.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is an advanced mathematics assignment submitted by 4 students - Prakhyalakhy Das, Priya Rahul, Richa Mishra, and Riya Karmakar. It contains C code implementing the Newton-Raphson method to find the root of the function F(x) = x^3 - x - 4. The code takes an initial guess x0, calculates F(x) and its derivative F'(x), and updates the guess as x1 = x0 - F(x0)/F'(x0) until the difference between successive guesses is less than 0.00001 or the maximum number of iterations is reached.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views2 pages

    C Progrmin of Newton Rapson Method

    Uploaded by

    Riya Karmakar
    This document is an advanced mathematics assignment submitted by 4 students - Prakhyalakhy Das, Priya Rahul, Richa Mishra, and Riya Karmakar. It contains C code implementing the Newton-Raphson method to find the root of the function F(x) = x^3 - x - 4. The code takes an initial guess x0, calculates F(x) and its derivative F'(x), and updates the guess as x1 = x0 - F(x0)/F'(x0) until the difference between successive guesses is less than 0.00001 or the maximum number of iterations is reached.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    ADVANCED MATHEMATICS ASSIGNMENT

    BY

    ROLL NO.: 1151019

    PRAKHYALAKHY DAS

    ROLL NO.:1151021

    PRIYA RAHUL

    ROLL NO.:1151023

    RICHA MISHRA

    ROLL NO.:1151024

    RIYA KARMAKAR

    #include<stdio.h>
    #include<conio.h>
    #include<math.h>
    #define F(x) (x*x*x)-x-4
    #define FD(x) (3*x*x)-1
    #define MAXIT 20
    void main()
    {
    int count;
    float x0,x1,fx,fdx;
    clrscr();
    printf("newton raphson method\n");
    printf("------------\n");
    printf("initial value");

    scanf("%f",&x0);
    count=1;
    begin:
    fx=F(x0);
    fdx=FD(x0);
    x1=(x0-(fx/fdx));
    if(fabs((x1-x0)/x1)<0.00001)
    {
    printf("the root is :%f\n",x1);
    printf("iteration is :%d\n",count);
    }
    else
    {
    x0=x1;
    count=count+1;
    if((count<MAXIT))
    goto begin;
    }
    getch();
    }

    You might also like