Scribd Logo
Upload

Welcome to Scribd!

  • Experiment 4 Gauss Seidel Method

    Uploaded by

    rexdindigul
    168 views2 pages
    This document describes the Gauss Seidel iterative method for solving systems of linear equations. It starts with an approximate solution and iteratively derives closer approximations until the desired accuracy is reached. While direct methods are generally preferred, the Gauss Seidel method is advantageous for large sparse matrices as it preserves zero elements. The goal, minimum requirements, equations, and output of applying this method are also outlined.

    Original Description:

    Gauss Seidel Method C Program

    Original Title

    Experiment 4 Gauss Seidel Method (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
    This document describes the Gauss Seidel iterative method for solving systems of linear equations. It starts with an approximate solution and iteratively derives closer approximations until the desired accuracy is reached. While direct methods are generally preferred, the Gauss Seidel method is advantageous for large sparse matrices as it preserves zero elements. The goal, minimum requirements, equations, and output of applying this method are also outlined.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    168 views2 pages

    Experiment 4 Gauss Seidel Method

    Uploaded by

    rexdindigul
    This document describes the Gauss Seidel iterative method for solving systems of linear equations. It starts with an approximate solution and iteratively derives closer approximations until the desired accuracy is reached. While direct methods are generally preferred, the Gauss Seidel method is advantageous for large sparse matrices as it preserves zero elements. The goal, minimum requirements, equations, and output of applying this method are also outlined.

    Copyright:

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

    Gauss Seidel Method

    This iterative method starts from an approximation to the true solution and, if convergent, derive
    a sequence of closer approximations, the cycle of computations being repeated till the required
    accuracy is obtained. In general one should prefer a direct method for the solution of a linear
    system, but in the case of matrices with a large number of zero elements, it will be advantageous
    to use iterative methods, which preserve these elements.

    AIM
    To solve the given system of equations by using Gauss Seidal Method

    MINIMUM HARDWARE AND SOFTWARE:


    Hardware: Desktop, minimum 128MB RAM, a suitable HDD
    Software: Windows XP/Linux, Turbo C/ C++ or Borland C/ C++ compiler

    Problem:
    Solve the following equations:
    x1 + 2x2 + 3x3 = 10
    6x1 + 5x2 + 2x3 = 30
    x1 + 3x2 + x3 = 10
    OUTPUT

    You might also like