Scribd Logo
Upload

Welcome to Scribd!

  • (Tekkom) 15051204028 Tugas SPL

    Uploaded by

    Natalia
    16 views16 pages
    This document summarizes different methods for solving systems of linear equations: 1) Gaussian elimination method reduces the system of equations to row echelon form. 2) Gaussian-Jordan elimination further reduces the system to diagonal form. 3) Inverse matrix method finds the inverse of the coefficient matrix to directly calculate the solution. 4) Cramer's rule uses determinants to find the unique solution. 5) Iterative methods like Jacobi and Seidel successively improve an initial guess for the solution.

    Original Description:

    SISTEMPERSAMAAN LINIER TEKNIK KOMPUTASI

    Original Title

    [Tekkom]15051204028 Tugas SPL

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document summarizes different methods for solving systems of linear equations: 1) Gaussian elimination method reduces the system of equations to row echelon form. 2) Gaussian-Jordan elimination further reduces the system to diagonal form. 3) Inverse matrix method finds the inverse of the coefficient matrix to directly calculate the solution. 4) Cramer's rule uses determinants to find the unique solution. 5) Iterative methods like Jacobi and Seidel successively improve an initial guess for the solution.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    16 views16 pages

    (Tekkom) 15051204028 Tugas SPL

    Uploaded by

    Natalia
    This document summarizes different methods for solving systems of linear equations: 1) Gaussian elimination method reduces the system of equations to row echelon form. 2) Gaussian-Jordan elimination further reduces the system to diagonal form. 3) Inverse matrix method finds the inverse of the coefficient matrix to directly calculate the solution. 4) Cramer's rule uses determinants to find the unique solution. 5) Iterative methods like Jacobi and Seidel successively improve an initial guess for the solution.

    Copyright:

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

    SISTEM PERSAMAAN LINIER

    Oleh :
    Natalia Mamahit (15051204028)

    Soal Persamaan Linear :


    x1+2x3

    =6

    -3x1+4x2+6x3 = 30
    -x1-2x2+3x3 = 8

    Metode Gauss
    A =

    b2+3b1
    b3+b1

    x2+3. = 12

    = b2 .

    x2 = 12 -

    =
    b3+2b2

    =
    b

    x3 = = 3,45
    x2+3x3 = 12

    x2
    x1+2x3 = 6

    = 1,64

    x1+2. = 6
    x1 = 6 6,9
    x1

    = - 0,9

    Metode Gauss-Jordan
    =
    A

    Metod
    e
    Gauss

    =
    =

    b1 - 2b3
    b2 - 2b3

    x1 = - 0,9
    x2 = 1,64
    x

    = = 3,45

    Metode
    GaussJordan

    Metode Invers Adjoint


    A
    =
    M11 = = = 12-(-12) = 24
    M12 = = = -9-(-6) = -3
    M13 = = = 6-(-4) = 10
    M21 = = = 0-(-4) = 4
    M22 = = = 3-(-2) = 5

    M23 = = = 12-(-12) = 24

    M31 = = = -9-(-6) = -3
    M32 = = = 6-(-4) = 10
    M33 = = = 0-(-4) = 4
    M=

    C=
    C=

    adj A = CT

    A-1 =

    det A =
    =
    0)

    1 0 2 1 0
    12+0+12-(-8-12-3 4 6 -3 4
    -1 -2 3 -1 -2

    . Adj A

    x = A-1 . b
    = .
    = =

    = 24+20
    =44
    x1 = - 0,9
    x2 = 1,64
    3 = = 3,45
    x

    Metode Invers
    A
    OBE
    = [ A I ]
    =
    = b2 .

    b2+3b1
    b3+b1

    -1

    =A

    -1

    .B

    = .

    =
    =
    =

    b3+2b2
    b3 .

    b1-2b3
    b2-3b3

    =
    x1 = - 0,9
    x2 = 1,64
    x = = 3,45
    3

    Metode Cramer
    A =

    b=

    Sehingga,
    A1 = A2 =
    det A = 44
    Det A1 =

    A3 =

    = 72+0+(-120)-(64-72+0)
    = -40

    Det A1 =
    = 90+(-36)-48-(60-48-54)
    = 72

    Det A1 =
    = 32+0+36-(-24-60-0)
    = 152

    X1 = = = -0,9
    X2 = = = 1,64
    X3 = = = 3,45

    Metode Jacobi
    x
    = 6 x1 = 6 - 2x3
    1+2x3
    -3x1+4x2+6x3 = 30 x2 =
    -x1-2x2+3x3 = 8 x3 =
    Psolusi = (x1,x2,x3) = (-0,9 , 1,64 , 3,45)
    P0 = (x1,x2,x3) = (0,0,0)
    Iterasi 2 (x ,x ,x ) = (6 , 7,5 ,
    Iterasi 1 (x1,x2,x3) = (0,0,0)
    1
    2
    3
    2,67)
    x1 = 6 - 2x3 = 6 2.0 = 6
    x1 = 6 - 2x3 = 6 2.2,67 = 0,67
    x2 = = = 7,5
    x3 = = = 2,67

    x2 = = = 8

    Error = |-0,9-6|= 6,9

    x3 = = = 9,67

    Error = |1,64-7,5|= -5,86


    Error = |3,45-2,67|= 0,78

    Error = |-0,9-0,67|= -1,57


    Error = |1,64-8|= -6,36
    Error = |3,45-9,67|= -6,22

    Iterasi 3 (x1,x2,x3) = (0,67, 8 ,


    9,67)
    x1 = 6 - 2x3 = 6 2.9,67 = -13,33
    x2 = = = -6,5
    x3 = = = 8,22
    Error = |-0,9-(-13,33)|= 12,43
    Error = |1,64-(-6,5)|= 8,14
    Error = |3,45-8,22|= -4,77

    Iterasi 4 (x1,x2,x3) = (-13,33 , -6,5 ,


    8,22)
    x1 = 6 - 2x3 = 6 2.8,22 = -10,44
    x2 = = = -14,83
    x3 = =
    Error =
    Error =
    Error =

    = -6,11
    |-0,9-(-10,44)|= 9,54
    |1,64-(-14,83)|= 16,47
    |3,45-(-6,11)|= 9,56

    Iterasi 5 (x1,x2,x3)=(-10,44 , -14,83 ,


    -6,11)
    x1 = 6 - 2x3 = 6 2.-6,11 = 18,22
    x2 = = = 8,83
    x3 = =
    Error =
    Error =
    Error =

    = -10,7
    |-0,9-18,22|= 19,12
    Iterasi 6 (x ,x ,x ) = (18,22 , 8,83 ,
    |1,64-8,83|= 7,19
    1
    2
    3
    |3,45-(-10,7)|= 14,15 -10,7)
    x1 = 6 - 2x3 = 6 2.-10,7 = 27,4
    x2 = = = 37,22
    x3 = =
    Error =
    Error =
    Error =

    = 14,63
    |-0,9-27,4|= 28,3
    |1,64-37,22|= 35,38
    |3,45-14,63|= 11,18

    Metode Seidel
    x
    = 6 x1 = 6 - 2x3
    1+2x3
    -3x1+4x2+6x3 = 30 x2 =
    -x1-2x2+3x3 = 8 x3 =
    Psolusi = (x1,x2,x3) = (-0,9 , 1,64 , 3,45)
    P0 = (x1,x2,x3) = (0,0,0)
    Iterasi 2 (x ,x ,x ) = (6, 12,
    Iterasi 1 (x1,x2,x3) = (0,0,0)
    1
    2
    3
    12,67)
    x1 = 6 - 2x3 = 6 2.0 = 6
    x1 = 6 - 2x3 = 6 2.12,67 =
    x2 = = = 12
    x3 = = = 12,67
    Error = |-0,9-6|= 6,9
    Error = |1,64-12|= 10,36
    Error = |3,45-12,67|= 10,35

    -19,33
    x2 = = = -26
    x3 = = = -21,11

    Error = |-0,9-(19,33)|= 14,43

    Iterasi 3 (x1,x2,x3) = (-19,33 , -26,


    -21,11)
    x1 = 6 - 2x3 = 6 2.-21,11 =

    48,22
    x2 = = =75,33
    x3 = =
    Error =
    Error =
    Error =

    = 68,96
    |-0,9-48,22|= 49,12 Iterasi 4 (x1,x2,x3) = (48,22, 75,33,
    |1,64-75,33|= 73,69
    68,96)
    |3,45-68,96|= 52,57
    x1 = 6 - 2x3 = 6 2.68,96 = -131,93
    x2 = = = -194,89
    x3 = =
    Error =
    Error =
    Error =

    = -171,23
    |-0,9-(-131,93)|= 131,03
    |1,64-(-194,89)|= 196,53
    |3,45-(-171,23)|= 127,58

    Iterasi 5 (x1,x2,x3)=(-131, 93,


    -194,89, -171,23)
    x1 = 6 - 2x3 = 6 2.-6,11 = 348,47
    x2 == = 525,7
    x3 = =
    Error =
    Error =
    Error =

    = 469,29
    |-0,9 - 348,47|= 349,37
    |1,64 - 525,7|= 524,06 Iterasi 6 (x1,x2,x3) = (348,47, 525,7,
    |3,45 - 469,29|= 352,82 469,29)
    x1 = 6 - 2x3 = 6 2.469,29 =
    -932,58
    x2=== -1395,8
    x3 == = -1238,78
    Error = |-0,9 - (-932,58)|= 931,68
    Error = |1,64 - (-1395,8)|= 1397,52

    THANK YOU

    You might also like