Scribd Logo
Upload

Welcome to Scribd!

  • Metodo Busca: 'String' 'String' 'String' 'String' 'Subintervalo'

    Uploaded by

    Juan Flores Villanueva
    8 views2 pages
    The document describes two numerical methods for finding the roots of a function: bisection method and interval subdivision method. The bisection method takes the average of the function values at the interval endpoints until a root is found within a specified number of iterations. The interval subdivision method subdivides the initial interval into smaller subintervals until it finds one where the function changes sign, indicating a root exists within that subinterval. Both methods display the results in a listbox GUI control.

    Original Description:

    Original Title

    BUSCA -BISECCION

    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
    The document describes two numerical methods for finding the roots of a function: bisection method and interval subdivision method. The bisection method takes the average of the function values at the interval endpoints until a root is found within a specified number of iterations. The interval subdivision method subdivides the initial interval into smaller subintervals until it finds one where the function changes sign, indicating a root exists within that subinterval. Both methods display the results in a listbox GUI control.

    Copyright:

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

    Metodo Busca: 'String' 'String' 'String' 'String' 'Subintervalo'

    Uploaded by

    Juan Flores Villanueva
    The document describes two numerical methods for finding the roots of a function: bisection method and interval subdivision method. The bisection method takes the average of the function values at the interval endpoints until a root is found within a specified number of iterations. The interval subdivision method subdivides the initial interval into smaller subintervals until it finds one where the function changes sign, indicating a root exists within that subinterval. Both methods display the results in a listbox GUI control.

    Copyright:

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

    METODO BUSCA

    function pushbutton1_Callback(hObject,
    eventdata, handles)
    f=get(handles.edit1,'string');
    a=str2num(get(handles.edit2,'string'));
    b=str2num(get(handles.edit3,'string'));
    h=str2num(get(handles.edit4,'string'));
    L='SUBINTERVALO';
    x=a:0.1:b;
    y=eval(f);
    plot(x,y);
    grid on
    i=1;
    m=(b-a)./h;
    k=0;
    c=0;
    while i<=m
    x1=a;
    x=x1;
    fa=eval(f);
    x=x1+h;
    fb=eval(f);
    if fa.*fb<0
    c=k+1;
    k=k+1;
    L=strvcat(L,num2str([c,x1,x1+h]));
    end
    a=a+h;
    i=i+1;
    end
    set(handles.listbox1,'string',L);
    METODO DE BISECCION

    function pushbutton1_Callback(hObject,
    eventdata, handles)
    f=get(handles.edit1,'string');
    a=str2num(get(handles.edit2,'string'));
    b=str2num(get(handles.edit3,'string'));
    n=str2num(get(handles.edit4,'string'));
    L='APROXIMACIONES';
    x=a-1:0.01:b+1;
    y=eval(f);
    plot(x,y)
    grid on
    i=1;
    while i<=n
    x1=(a+b)./2;
    x=a;
    fa=eval(f);
    x=x1;
    fb=eval(f);
    if fa.*fb<0
    b=x1;
    else
    a=x1;
    end
    L=strvcat(L,num2str([i x1]));
    set(handles.listbox1,'string',L);
    i=i+1;
    end

    You might also like