Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • Newton Raphson Method

    Uploaded by

    Sourav Dash
    34 views2 pages
    This document outlines a Newton-Raphson method algorithm to find the root of a function. It takes a user-input function and initial x value, then iteratively calculates the function value and derivative to update x, converging on a root. It prints the iteration number and updated x value on each loop, stopping when the change in x is less than a tolerance or after 100 iterations.

    Original Description:

    Original Title

    newton raphson method.docx

    Copyright

    © © All Rights Reserved

    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 outlines a Newton-Raphson method algorithm to find the root of a function. It takes a user-input function and initial x value, then iteratively calculates the function value and derivative to update x, converging on a root. It prints the iteration number and updated x value on each loop, stopping when the change in x is less than a tolerance or after 100 iterations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    34 views2 pages

    Newton Raphson Method

    Uploaded by

    Sourav Dash
    This document outlines a Newton-Raphson method algorithm to find the root of a function. It takes a user-input function and initial x value, then iteratively calculates the function value and derivative to update x, converging on a root. It prints the iteration number and updated x value on each loop, stopping when the change in x is less than a tolerance or after 100 iterations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    1.

    fun=input('enter function:');
    2. f=inline(fun,'x');
    3. x=input('x:');
    4. h=0.00001;
    5. xp=0;
    6. tol=0.00001;
    7. fprintf(' i x\n');
    8. for i=1:100
    fx=feval(f,x);
    df=(feval(f,x+h)-feval(f,x))/h;
    x=x-fx/df;
    fprintf('%2g %7.8f\n',i,x);
    if (abs(x-xp)<tol)
    break;
    end
    xp=x;
    9. end
    10. fprintf('x=%5.5f\n',x)
    newtonraphsonmethod
    enter function:'x^3-5*x+1'
    x:0
    i x
    1 0.20000000
    2 0.20163935
    3 0.20163968
    x=0.20164

    You might also like