Scribd Logo
Upload

Welcome to Scribd!

  • Gauss Methods

    Uploaded by

    Hashmi Ashmal
    12 views3 pages
    The document describes two methods for solving systems of linear equations: Gauss-Jacobi iteration and Gauss-Jordan elimination. For Gauss-Jacobi, it defines variables to store the matrix, solution vectors, tolerance, and maximum iterations. It then checks for diagonal dominance and performs iterations, updating the solution vector and checking for convergence based on the error. For Gauss-Jordan, it performs row operations to transform the matrix into reduced row echelon form, then back-substitutes to solve for the variables.

    Original Description:

    Original Title

    gauss methods.docx

    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 methods for solving systems of linear equations: Gauss-Jacobi iteration and Gauss-Jordan elimination. For Gauss-Jacobi, it defines variables to store the matrix, solution vectors, tolerance, and maximum iterations. It then checks for diagonal dominance and performs iterations, updating the solution vector and checking for convergence based on the error. For Gauss-Jordan, it performs row operations to transform the matrix into reduced row echelon form, then back-substitutes to solve for the variables.

    Copyright:

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

    Gauss Methods

    Uploaded by

    Hashmi Ashmal
    The document describes two methods for solving systems of linear equations: Gauss-Jacobi iteration and Gauss-Jordan elimination. For Gauss-Jacobi, it defines variables to store the matrix, solution vectors, tolerance, and maximum iterations. It then checks for diagonal dominance and performs iterations, updating the solution vector and checking for convergence based on the error. For Gauss-Jordan, it performs row operations to transform the matrix into reduced row echelon form, then back-substitutes to solve for the variables.

    Copyright:

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

    Gauss Jacobi method

    n=input(‘no of equations’);

    A=zeros(n,n+1);

    X1=zeros(n);

    X2=zeros(n);

    tol=input(‘enter the tolerance’);

    m=input(‘enter maximum iterations’);

    A=input(‘enter a matrix’);

    X1=[0,0,0];

    If(2*(abs(diag(A))))>=sum(abs(A),2);

    disp(‘diagnolly dominant);

    k=1;

    while k<=m

    err=0

    for i=1:n

    s=0

    for j=i:n

    s=s-A(I,j)*X1(j);

    end

    s=(s+A(I,n+1))/A(i,i);

    if abs(s)>err

    err=abs(s);

    end

    X2(i)=X1(i)+s;

    end
    if err<=tol

    break

    else

    k=k+1

    for i=1:n

    X1(i)=X2(i);

    end

    end

    end

    fprintf(‘solution vector after %d iteration is %d\n’,k-1);

    for i=1:n

    fprintf(‘%11f\n’,X2(i));

    end

    gauss Jordan method

    [m,n]=size(a);

    for j=1:m-1

    for z=2:m

    if a(j,j)==0

    t=a(1,:);a(1,:)=a(z,:);

    a(z,:)=t;

    end

    end

    for i=j+1:m

    a(I,:);a(1,:)=a(z,:);

    a(z,:)=t;
    end

    end

    for i=j+1:m

    a(I,:)=a(I,:)-a(j.:)*(a(I,j)/a(j,j));

    end

    end

    for i=j+1:m

    a(I,:)=a(i,:)-a(j,:)*(a(I,j)/a(j,j));

    end

    end

    for s=1:m

    a(s,:)=a(s,:)/a(s,s);

    x(s)=a(s,n);

    end

    disp(‘gauss Jordan method’);

    end

    You might also like