Scribd Logo
Upload

Welcome to Scribd!

  • Newton Cotes in MATLAB

    Uploaded by

    Vicky Lavinia II
    119 views2 pages
    This document discusses and compares the Trapezoidal Composite Rule and Simpson's 1/3 Composite Rule for numerical integration. It calculates the integral of the square root function from 0 to 1 using different values of n subdivisions and computes the error estimates for each method. Tables of the approximations and errors are displayed for each rule.

    Original Description:

    Trapesium Komposit Simpson ⅓ Komposit

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses and compares the Trapezoidal Composite Rule and Simpson's 1/3 Composite Rule for numerical integration. It calculates the integral of the square root function from 0 to 1 using different values of n subdivisions and computes the error estimates for each method. Tables of the approximations and errors are displayed for each rule.

    Copyright:

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

    Newton Cotes in MATLAB

    Uploaded by

    Vicky Lavinia II
    This document discusses and compares the Trapezoidal Composite Rule and Simpson's 1/3 Composite Rule for numerical integration. It calculates the integral of the square root function from 0 to 1 using different values of n subdivisions and computes the error estimates for each method. Tables of the approximations and errors are displayed for each rule.

    Copyright:

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

    %% NEWTON COTES:

    %% Metode Trapesium Komposit

    clc
    clear all

    a = 0;
    b = 1;
    n = [8 32 64 128 256];
    x = a;
    fx(1) = sqrt(x);
    for k = 1:1:5
    h = (b-a)/n(k);
    e = 0; %karena -((b-a)^3)*(-1/4*0^(-3/2))/(12*n(k)^2) tidak terdefinisi --> 1/
    (0^(3/2))
    for j = 1:1:n(k)
    x = a+(j*h);
    fx(j+1) = sqrt(x);
    galat = -((b-a)^3)*(-1/4*x^(-3/2))/(12*n(k)^2);
    if galat > e
    e = galat;
    end
    end
    e(k) = e;
    fx;
    for j = 2:1:n(k)
    fx(j) = 2*fx(j);
    end
    fx;
    hampiran(k) = (h/2)*sum(fx);
    end
    hampiran
    e
    %% Metode Simpson 1/3 Komposit

    clc
    clear all

    a = 0;
    b = 1;
    n = [8 32 64 128 256];
    x = a;
    fx(1) = sqrt(x);
    for k = 1:1:5
    h = (b-a)/n(k);
    e = 0; %karena -((b-a)^5)*(-15/16*0^(-7/2))/(180*n(k)^4) tidak terdefinisi
    for j = 1:1:n(k)
    x = a+(j*h);
    fx(j+1) = sqrt(x);
    galat = -((b-a)^5)*(-15/16*x^(-7/2))/(180*n(k)^4);
    if galat > e
    e = galat;
    end
    end
    e(k) = e;
    fx;
    for j = 2:1:n(k)
    if mod(j,2) == 0
    fx(j) = 4*fx(j);
    else
    fx(j) = 2*fx(j);
    end
    end
    fx;
    hampiran(k) = (h/3)*sum(fx);
    end
    hampiran
    e

    You might also like