Scribd Logo
Upload

Welcome to Scribd!

  • Function X

    Uploaded by

    Iril Izzi Arlisa
    4 views2 pages
    This document contains code for 4 root finding algorithms: 1. Bisection method which iteratively halves the search interval to find where a function changes sign. 2. Regula Falsi method which uses the secant line between two points to find where the function crosses zero. 3. Newton-Raphson method which uses the tangent line at a point to iteratively estimate where the function is zero. 4. Secant method which uses the secant line between the previous two points to iteratively estimate where the function is zero.

    Original Description:

    FUNGSI

    Original Title

    Function x

    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 contains code for 4 root finding algorithms: 1. Bisection method which iteratively halves the search interval to find where a function changes sign. 2. Regula Falsi method which uses the secant line between two points to find where the function crosses zero. 3. Newton-Raphson method which uses the tangent line at a point to iteratively estimate where the function is zero. 4. Secant method which uses the secant line between the previous two points to iteratively estimate where the function is zero.

    Copyright:

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

    Function X

    Uploaded by

    Iril Izzi Arlisa
    This document contains code for 4 root finding algorithms: 1. Bisection method which iteratively halves the search interval to find where a function changes sign. 2. Regula Falsi method which uses the secant line between two points to find where the function crosses zero. 3. Newton-Raphson method which uses the tangent line at a point to iteratively estimate where the function is zero. 4. Secant method which uses the secant line between the previous two points to iteratively estimate where the function is zero.

    Copyright:

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

    function x = bisection (a,b,N),

    for i = 1:N
    x=(a+b)/2;
    fx=x*exp(-x)+1;fa=a*exp(-a)+1;
    if(fx*fa<0)
    b=x;
    else a=x;
    end,
    x
    end

    ==================================================
    ===================================

    function x = regulafalsi (a,b,N),


    for i = 1:N
    fa=a*exp(-a)+1;fb=b*exp(-b)+1;
    x=((a*fb)-(b*fa))/(fb-fa);
    fx=x*exp(-x)+1;
    if(fx*fa<0)
    b=x;
    else a=x;
    end,
    x
    end

    ==================================================
    ===================================
    function x = newtonraphson (x0,N),
    x=x0;
    for i = 1:N
    fx=x*exp(-x)+1;
    fy=(exp(-x))-(x*(exp(-x)));
    x=(x-(fx/fy));
    end,
    end

    ==================================================
    ===================================
    function x = secant (x0,x1,N)
    x0=x1;x1=xn+1;
    y=fx0;
    yn=fx1;
    for i = 1:N
    yn=x*exp(-x)+1;
    x=x-(y*(x-(x-1))/(y-(yn));
    end,
    end

    You might also like