Scribd Logo
Upload

Welcome to Scribd!

  • SNJ UAS Bahasa Pemrograman

    Uploaded by

    Alfina Rohmaniah
    13 views8 pages
    The document describes two methods for numerically solving systems of linear equations: 1) Gaussian elimination, which uses row operations to transform the matrix into upper triangular form. This is done through a series of steps involving subtraction of rows. 2) LU decomposition, which factors the matrix A as the product of a lower triangular matrix L and an upper triangular matrix U. This decomposition allows the system to be solved through back substitution. Pseudocode is provided to implement both methods.

    Original Description:

    Bahasa pemrograman komputer

    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
    The document describes two methods for numerically solving systems of linear equations: 1) Gaussian elimination, which uses row operations to transform the matrix into upper triangular form. This is done through a series of steps involving subtraction of rows. 2) LU decomposition, which factors the matrix A as the product of a lower triangular matrix L and an upper triangular matrix U. This decomposition allows the system to be solved through back substitution. Pseudocode is provided to implement both methods.

    Copyright:

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

    SNJ UAS Bahasa Pemrograman

    Uploaded by

    Alfina Rohmaniah
    The document describes two methods for numerically solving systems of linear equations: 1) Gaussian elimination, which uses row operations to transform the matrix into upper triangular form. This is done through a series of steps involving subtraction of rows. 2) LU decomposition, which factors the matrix A as the product of a lower triangular matrix L and an upper triangular matrix U. This decomposition allows the system to be solved through back substitution. Pseudocode is provided to implement both methods.

    Copyright:

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

    Scanned with CamScanner

    Scanned with CamScanner


    Penyelesaian

    1.
     Coding

    Dim Y(100), X(100), A(100), S(100)


    Dim xa, xb, N, Delta, LuasTot, STot, X0, Y0, X1, Y1

    Delta = (xb- xa) / N


    For i = 0 To N
    X(i) = xa + i * Delta
    Call fungsi(X(i), Y(i))
    Next i

    LuasTot = 0
    For i = 1 To N
    Luas(i) = (Y(i - 1) + Y(i)) * Delta / 2
    LuasTot = LuasTot + Luas(i)
    Next I

    STot = 0
    For i = 1 To N
    S(i) = Sqr((X(i) - X(i - 1)) ^ 2 + (Y(i) - Y(i - 1)) ^ 2)
    STot = STot + S(i)

    SYTot = 0
    SXTot = 0
    For i = 1 To N
    X1(i) = bawah + Delta * (i - 1 / 2)
    Y1(i) = Y(i - 1) / 2
    X2(i) = bawah + Delta * (i - 1 / 3)
    Y2(i) = Y(i - 1) + (Y(i) - Y(i - 1)) / 3
    SY(i) = X1(i) * Delta * Y(i - 1) + X2(i) * Delta * (Y(i) - Y(i - 1)) / 2
    SX(i) = Y1(i) * Delta * Y(i - 1) + Y2(i) * Delta * (Y(i) - Y(i - 1)) / 2

    SXTot = SXTot + SX(i)


    SYTot = SYTot + SY(i)
    Next i

    X0 = SYTot / LuasTot
    Y0 = SXTot / LuasTot

    LuasTxt.Text = Abs(LuasTot)
    X0Txt.Text = X0
    Y0Txt.Text = Y0
    SXXTot = 0
    SYYTot = 0
    For i = 1 To N
    XX(i) = (X(i - 1) + X(i)) / 2
    YY(i) = (Y(i - 1) + Y(i)) / 2

    SYY(i) = S(i) * XX(i)


    SXX(i) = S(i) * YY(i)
    SXXTot = SXXTot + SYY(i)
    SYYTot = SYYTot + SXX(i)
    Next i

    XX0 = SXXTot / STot


    YY0 = SYYTot / STot

    PanjTxt.Text = STot
    XXTxt.Text = XX0
    YYTxt.Text = YY0
    End Sub
     Flowchart
    2.

     Coding
    Dim A(100,100), B(100,100), A1(100,100), B1(100,100)
    Dim Ndim

    For i = 1 To Ndim
    For j = 1 To Ndim
    Input #1, A(i, j)
    A1(i, j) = A(i, j)
    Next j
    Next i

    For i = 1 To Ndim
    For j = 1 To Ndim
    If j = i Then B(i, j) = 1
    B1(i, j) = 0
    Next j
    Next i

    For ii = 2 To Ndim
    C = A1(ii - 1, ii - 1)
    For i = ii To Ndim
    D = A1(i, ii - 1)
    For j = 1 To Ndim
    A1(i, j) = A1(i, j) - A1(ii - 1, j) * D / C
    B1(i, j) = B1(i, j) - B1(ii - 1, j) * D / C
    Next j
    Next i
    Next ii

    For ii = (Ndim - 1) To 1 Step -1


    C = A1(ii + 1, ii + 1)
    For i = ii To 1 Step -1
    D = A1(i, ii + 1)
    For j = 1 To Ndim
    A1(i, j) = A1(i, j) - A1(ii + 1, j) * D / C
    B1(i, j) = B1(i, j) - B1(ii + 1, j) * D / C
    Next j
    Next i
    Next ii

    For i = 1 To Ndim
    C = A1(i, i)
    For j = 1 To Ndim
    A1(i, j) = A1(i, j) / C
    B1(i, j) = B1(i, j) / C
    Next j

    For i = 1 To Ndim
    For j = 1 To Ndim
    Input #1
    D = A1(i, ii - 1)
    For j = 1 To Ndim
    A1(i, j) = A1(i, j) - A1(ii - 1, j) * D / C
    B1(i, j) = B1(i, j) - B1(ii - 1, j) * D / C
    Next j
    Next i
    Next ii
    For ii = (Ndim - 1) To 1 Step -1
    C = A1(ii + 1, ii + 1)
    For i = ii To 1 Step -1
    D = A1(i, ii + 1)
    For j = 1 To Ndim
    A1(i, j) = A1(i, j) - A1(ii + 1, j) * D / C
    B1(i, j) = B1(i, j) - B1(ii + 1, j) * D / C
    Next j
    Next i
    Next ii
     Flowchart

    You might also like