Scribd Logo
Upload

Welcome to Scribd!

  • GuassJacobi PDF

    Uploaded by

    DEVASHISH KUMAR
    9 views2 pages
    This document demonstrates the Gauss-Jacobi method for solving a system of linear equations. The method initializes the solution vector x to 0 and iteratively updates x by solving Ax=b, where A is the coefficient matrix, b is the constant vector, and x is solved for using the diagonal of A only. The algorithm runs for 15 iterations, printing the current solution x at each step as it converges to the final solution.

    Original Description:

    Original Title

    GuassJacobi.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document demonstrates the Gauss-Jacobi method for solving a system of linear equations. The method initializes the solution vector x to 0 and iteratively updates x by solving Ax=b, where A is the coefficient matrix, b is the constant vector, and x is solved for using the diagonal of A only. The algorithm runs for 15 iterations, printing the current solution x at each step as it converges to the final solution.

    Copyright:

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

    GuassJacobi PDF

    Uploaded by

    DEVASHISH KUMAR
    This document demonstrates the Gauss-Jacobi method for solving a system of linear equations. The method initializes the solution vector x to 0 and iteratively updates x by solving Ax=b, where A is the coefficient matrix, b is the constant vector, and x is solved for using the diagonal of A only. The algorithm runs for 15 iterations, printing the current solution x at each step as it converges to the final solution.

    Copyright:

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

    ◼ Gauss Jacobi Method

    In[255]:=

    A = {{4.0, 1.0, 2.0}, {- 3.0, 5.0, 1.0}, {1.0, 1.0, 3.0}};


    d = {{4.0, 0, 0}, {0, 5.0, 0}, {0, 0, 3.0}};
    u = {{0, 1.0, 2.0}, {0, 0, 1.0}, {0, 0, 0}};
    l = {{0, 0, 0}, {- 3.0, 0, 0}, {1.0, 1.0, 0}};
    b = Transpose[{{4.0, 7.0, 3.0}}];
    x[1] = Transpose[{{0, 0, 0}}]
    Do[x[n + 1] = LinearSolve[d, - (l + u).x[n] + b];
    Print[x ^ n, "=", MatrixForm[x[n]]], {n, 1, 15}]
    Out[260]=

    {{0}, {0}, {0}}


    2

    0
    x= 0
    0
    1.
    x2= 1.4
    1.
    0.15
    x3= 1.8
    0.2
    0.45
    x4= 1.45
    0.35
    0.4625
    x5= 1.6
    0.366667
    0.416667
    x6= 1.60417
    0.3125
    0.442708
    x7= 1.5875
    0.326389
    0.439931
    x8= 1.60035
    0.323264
    0.438281
    x9= 1.59931
    0.319907
    0.44022
    x10= 1.59899
    0.320804
    0.439851
    x11= 1.59997
    0.320264
    0.439875
    x12= 1.59986
    0.320059
    0.440006
    x13= 1.59991
    0.320089
    0.439977
    x14= 1.59999
    0.320027
    0.43999
    x15= 1.59998
    0.320012

    You might also like