Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 106 views

    Gauss Seidel

    Uploaded by

    Gunvir Singh
    The Gauss-Seidel iterative method is used to find the roots of linear equations. It begins by inputting the number of equations and constructing the augmented matrix. Initial guesses are made for the solutions and a tolerance limit is set. The method iterates through the equations, updating the solution estimates based on the previous values until the changes are within the tolerance limit. The final estimates for the solutions are then printed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Gauss Seidel

    Uploaded by

    Gunvir Singh
    106 views7 pages
    The Gauss-Seidel iterative method is used to find the roots of linear equations. It begins by inputting the number of equations and constructing the augmented matrix. Initial guesses are made for the solutions and a tolerance limit is set. The method iterates through the equations, updating the solution estimates based on the previous values until the changes are within the tolerance limit. The final estimates for the solutions are then printed.

    Original Description:

    numerical methods

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The Gauss-Seidel iterative method is used to find the roots of linear equations. It begins by inputting the number of equations and constructing the augmented matrix. Initial guesses are made for the solutions and a tolerance limit is set. The method iterates through the equations, updating the solution estimates based on the previous values until the changes are within the tolerance limit. The final estimates for the solutions are then printed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    106 views7 pages

    Gauss Seidel

    Uploaded by

    Gunvir Singh
    The Gauss-Seidel iterative method is used to find the roots of linear equations. It begins by inputting the number of equations and constructing the augmented matrix. Initial guesses are made for the solutions and a tolerance limit is set. The method iterates through the equations, updating the solution estimates based on the previous values until the changes are within the tolerance limit. The final estimates for the solutions are then printed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 7

    Aim: To find the roots of linear equations by Gauss-Seidel Iterative Method

    Algorithm:
    1. Enter the no. of equations, n.
    2. Create an nx(n+1) matrix, which will be the augmented matrix.
    3. Create an array x of size n which will store the solutions.
    4. Enter the elements of augmented matrix.
    5. Enter the initial guesses.
    6. Enter the tolerance limit,eps.
    7. Pivoting:
    For i=0 to n-1
    For k=i+1 to n-1
    If aii<aki
    Then For j=0 to n
    Swap aij with akj
    8. Set flag=0.
    9. Do:
    Do For i=0 to n-1
    y=xi
    xi=ain
    Do For j=0 to n-1
    If j!=i
    Then xi=xi-aij*xj
    End For j.
    xi=xi/aii
    If |xi-y|<=eps
    Then increment flag.
    End For i.
    Until flag<3
    10. Print the solution that is, the elements of x array.
    Flow Chart: Start

    Enter the no. of equations, n.

    Do i =0 to n-1

    Do j =0 to n-1

    Enter aij

    j<n
    Next j
    j=n
    i<n
    Next i
    i=n

    Do i =0 to n-1

    Enter xi

    i<n-1
    Next i
    i=n-1

    Enter eps

    Do i =0 to n-1
    Do k=i+1 to n-1

    No
    Is aii<aki

    Yes

    Do j=0 to n

    temp=aij

    aij=akj

    akj=temp

    j<n+1
    Next j
    j=n+1
    k<=n-1
    Next k
    k>n-1
    I<n
    Next i
    i=n

    Set flag=0

    Do i =0 to n-1

    y=xi

    xi=ain
    Do j =0 to n-1

    No

    Is j!=i?

    Yes

    xi=xi-aij*xj

    j<n
    Next j
    i=n

    xi=xi/aii

    No
    Is |xi-
    y|<=eps?

    Yes

    flag=flag+1

    i<n
    Next i

    i=n-1

    No.
    Is
    flag>=3?

    Yes

    Print the solution that is, the elements of x


    array

    End
    Program:
    //Gaus-seidel
    #include<iostream>
    #include<iomanip>
    #include<cmath>
    using namespace std;
    int main()
    {
    cout.precision(4);
    cout.setf(ios::fixed);
    int n,i,j,k,flag=0,count=0;
    cout<<"\nEnter the no. of equations\n";
    cin>>n; //Input no. of equations
    double a[n][n+1]; //declare a 2d array for
    storing the elements of the augmented matrix
    double x[n]; //declare an array to store
    the values of variables
    double eps,y;
    cout<<"\nEnter the elements of the augmented matrix row-
    wise:\n";
    for (i=0;i<n;i++)
    for (j=0;j<=n;j++)
    cin>>a[i][j];
    cout<<"\nEnter the initial values of the variables:\n";
    for (i=0;i<n;i++)
    cin>>x[i];
    cout<<"\nEnter the accuracy upto which you want the
    solution:\n";
    cin>>eps;
    for (i=0;i<n;i++)
    //Pivotisation(partial) to make the equations diagonally
    dominant
    for (k=i+1;k<n;k++)
    if (a[i][i]<a[k][i])
    for (j=0;j<=n;j++)
    {
    double temp=a[i][j];
    a[i][j]=a[k][j];
    a[k][j]=temp;
    }
    cout<<"Iter"<<setw(10);
    for(i=0;i<n;i++)
    cout<<"x"<<i<<setw(18);
    cout<<"\n-------------------------------------------------
    ---------------------";
    do //Perform iterations to
    calculate x1,x2,...xn
    {
    cout<<"\n"<<count+1<<"."<<setw(16);
    for (i=0;i<n;i++) //Loop that
    calculates x1,x2,...xn
    {
    y=x[i];
    x[i]=a[i][n];
    for (j=0;j<n;j++)
    {
    if (j!=i)
    x[i]=x[i]-a[i][j]*x[j];
    }
    x[i]=x[i]/a[i][i];
    if (abs(x[i]-y)<=eps) //Compare the ne
    value with the last value
    flag++;
    cout<<x[i]<<setw(18);
    }
    cout<<"\n";
    count++;
    }while(flag<3); //If the values of
    all the variables don't differ from their previous values with
    error more than eps then flag must be 3 and hence stop the
    loop

    cout<<"\n The solution is as follows:\n";


    for (i=0;i<n;i++)
    cout<<"x"<<i<<" = "<<x[i]<<endl; //Print the
    contents of x[]
    return 0;
    }
    Output:

    You might also like