Scribd Logo
Upload

Welcome to Scribd!

  • Document

    Uploaded by

    NUR MOHAMMAD ASHIK
    4 views2 pages
    This function implements the secant method to find the root of a function. It takes a function, initial guesses for the root, an error tolerance, and maximum iterations. It iterates by computing the secant estimate for the root at each step, tracking the error and root values, and returns either the found root or the last estimate after reaching the maximum number of iterations.

    Original Description:

    Original Title

    Document (6)

    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 function implements the secant method to find the root of a function. It takes a function, initial guesses for the root, an error tolerance, and maximum iterations. It iterates by computing the secant estimate for the root at each step, tracking the error and root values, and returns either the found root or the last estimate after reaching the maximum number of iterations.

    Copyright:

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

    Document

    Uploaded by

    NUR MOHAMMAD ASHIK
    This function implements the secant method to find the root of a function. It takes a function, initial guesses for the root, an error tolerance, and maximum iterations. It iterates by computing the secant estimate for the root at each step, tracking the error and root values, and returns either the found root or the last estimate after reaching the maximum number of iterations.

    Copyright:

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

    function [res] = secant(func, x0, x1, es, max_it)

    ea = 1;
    prev = x1;
    fprintf('Iteration \t\t x0 \t\t\t x1 \t\t\t xr \t\t\t ea\n');
    for its = 1:max_it
    uval = double(subs(func,x1));
    lval = double(subs(func,x0));
    xr = x1 - double((uval*(x0-x1))/(lval-uval));
    rval = double(subs(func,xr));
    ea = abs(double((xr-prev)/xr));
    if its == 1
    fprintf('%5d \t\t %f \t\t %f \t\t %f\n', its, x0, x1, xr)
    else
    fprintf('%5d \t\t %f \t\t %f \t\t %f \t\t %f\n', its, x0, x1, xr, ea*100)
    end
    if rval == 0
    res = xr;
    break
    elseif ea <= es
    res = xr;
    break
    else
    x0 = x1;
    x1 = xr;
    end
    prev = xr;
    end
    end

    You might also like