Scribd Logo
Upload

Welcome to Scribd!

  • Function: 'Error'

    Uploaded by

    Edword Chao
    1 views1 page
    The document contains a) a function that solves an upper triangular system using forward substitution, b) examples of running the function on matrices of sizes 100, 200, and 400 which return the flop counts of 10000, 40000, and 160000 respectively, and c) a note that to make the function work for lower triangular matrices instead, the for loops would start at 1 instead of n and the nested loop would go from 1 to i-1.

    Original Description:

    170a hw1

    Original Title

    170a hw 1

    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 contains a) a function that solves an upper triangular system using forward substitution, b) examples of running the function on matrices of sizes 100, 200, and 400 which return the flop counts of 10000, 40000, and 160000 respectively, and c) a note that to make the function work for lower triangular matrices instead, the for loops would start at 1 instead of n and the nested loop would go from 1 to i-1.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    1 views1 page

    Function: 'Error'

    Uploaded by

    Edword Chao
    The document contains a) a function that solves an upper triangular system using forward substitution, b) examples of running the function on matrices of sizes 100, 200, and 400 which return the flop counts of 10000, 40000, and 160000 respectively, and c) a note that to make the function work for lower triangular matrices instead, the for loops would start at 1 instead of n and the nested loop would go from 1 to i-1.

    Copyright:

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

    a)

    function[y,flops]=uppertri(n,G,b)
    flops=0;
    y=zeros(n,1);
    fori=n:1:1
    forj=i+1:n
    b(i)=b(i)y(j)*G(i,j);
    flops=flops+2;
    end
    ifG(i,i)==0disp('ERROR');
    break;
    end
    y(i)=b(i)/G(i,i);
    flops=flops+1;
    end

    b)
    n=100;
    G=triu(rand(n,n)+eye(n,n));
    b=rand(n,1);
    [yflops]=uppertri(n,G,b)

    flops=

    10000

    n=200;
    G=triu(rand(n,n)+eye(n,n));
    b=rand(n,1);
    [yflops]=uppertri(n,G,b)

    flops=

    40000

    n=400;
    G=triu(rand(n,n)+eye(n,n));
    b=rand(n,1);
    [yflops]=uppertri(n,G,b)

    flops=

    160000

    c) To convert the program to a lower triangular matrix from an upper triangular matrix,
    you would begin the for loop for for i=1:n, and add the nested loop for j=1:i-1
    instead of the original for loops.

    You might also like