Question

In: Computer Science

The Gauss-Seidel method as an iterative technique often refers to an improved version of the Jacobi...

The Gauss-Seidel method as an iterative technique often refers to an improved version of the Jacobi method, since the Gauss-Seidel method generally achieves a faster convergence. Describe the difference between the Gauss-Seidel and Jacobi methods.

Solutions

Expert Solution

The techniques for solving linear systems of equation can be separated into two parts i.e. Direct Methods and Iterative Methods. Direct methods are not suitable for solving large number of equations in a system, mainly when the coefficient matrix is sparse. Iterative methods are very efficient regarding computer storage and time requirements.

The first iterative technique is called the Jacobi method. It is a iterative method of solving system of linear equations. This Jacobi method takes two assumptions. First one, that the system given has a unique solution and second one, that the coefficient matrix has no zeros on its main diagonal. In case if any of the diagonal entries are found zero, then rows or columns have to be interchanged to obtain a coefficient matrix which has nonzero entries on the main diagonal.

The second iterative technique is called Gauss Seidel method, which is nothing but the modification of Jacobi method. This modification increases the efficiency level as it often requires less iteration to produce the same degree of accuracy. In the Jacobi method, the values obtained in the nth approximations remain unaffected until the entire nth approximation has been calculated. With the Gauss Seidel method, in contrast, we use the new values of each one, as soon as they are identified. It means, once we have determined values from the very first equation, its value is then used in the second equation to get the new values. Likewise, the new value and the first value are utilized in the third equation to find the new and so onwards.

In other words we can say that , in Jacobi method, each iteration is performed using a set of preceding values, even if new values become available in the mid of the iteration. In Gauss Seidel method, as soon as we have a new iteration for a specific element, we can use it in all further subsequent computations.


Related Solutions

A) Use Jacobi or Gauss-Seidel iteration and perform three iterations by hand. B) Use Jacobi or...
A) Use Jacobi or Gauss-Seidel iteration and perform three iterations by hand. B) Use Jacobi or Gauss-Siedel iteration for ten iterations with a MAT-LAB function. * A= [5, -1,0;-1,5,-1;0,-1,5] , B=[9;4;-6]
A) Use Jacobi or Gauss-Seidel iteration and perform three iterations by hand. B) Use Jacobi or...
A) Use Jacobi or Gauss-Seidel iteration and perform three iterations by hand. B) Use Jacobi or Gauss-Siedel iteration for ten iterations with a MAT-LAB function. * A= [10 -2 1;-2 10 -2;-2 -5 10] , B=[9;12;18]
Find the solution to the given linear systems by Jacobi and Gauss Seidel iteration methods.          ...
Find the solution to the given linear systems by Jacobi and Gauss Seidel iteration methods.           2x + 5y = 16                      20x + y – 2z = 17            5x – y +2z = 12           3x + y = 11                        3x +20y – z = -18           3x +8y -2z = -25                                                       2x – 3y +20z = 25            x + y +4z = 6 2. Solve the equation Ax = b by using the LU decomposition method given the following...
Iterative method of solving large systems Is there any example for which Jacobi method fails and...
Iterative method of solving large systems Is there any example for which Jacobi method fails and Gauss-Seidel method succeeds?
how can I change the Gauss-Seidel method to SOR method code in Matlab? The question has...
how can I change the Gauss-Seidel method to SOR method code in Matlab? The question has shows that In implementing SOR method in MATLAB, one should not calculate Tw and cw by formulas Tw = (D -wL)^(-1)[(1-w)D+wU)] and Cw = w(D-wL)^(-1)b , where w stands for omega and using MATLAB's built-in inv function, since this function requires O(n^3) flops and therefore the whole matter loses its point. I have tried for many times but I can't get the correct answers....
Use the Gauss-Seidel method (a) without relaxation and (b) with relaxation (l 5 0.95) to solve...
Use the Gauss-Seidel method (a) without relaxation and (b) with relaxation (l 5 0.95) to solve the following system to a tolerance of es 5 5%. If necessary, rearrange the equations to achieve convergence. 23x1 1 x2 1 12x3 5 50 6x1 2 x2 2 x3 5 3 6x1 1 9x2 1 x3 5 40
design a program that solves matrices by the method of gauss-seidel use the object-oriented language c...
design a program that solves matrices by the method of gauss-seidel use the object-oriented language c ++
QUESTION: USING MATLAB, Carry out three iterations of the Gauss-Seidel method, starting from the initial vector...
QUESTION: USING MATLAB, Carry out three iterations of the Gauss-Seidel method, starting from the initial vector Use the  ,  and  norm to calculate the residual error after each iteration, until all errors are below 0.0001. [Use 5 decimal place accuracy in you calculations]
Write an algorithm in pseudocode for the binary search method using a while loop (iterative version)...
Write an algorithm in pseudocode for the binary search method using a while loop (iterative version) The recursive ternarySearch method returns true or false depending if the element was found or not. The ternarySearch method works in a similar manner to a binary search except it uses two mid values that “divide” the array into three portions. So, it needs to consider three recursive scenarios: See sample run: Accounts are: [0] 5658845 [1] 8080152 [2] 1005231 [3] 4520125 [4] 4562555...
Write an algorithm in pseudocode for the binary search method using a while loop (iterative version)...
Write an algorithm in pseudocode for the binary search method using a while loop (iterative version) The recursive ternarySearch method returns true or false depending if the element was found or not. The ternarySearch method works in a similar manner to a binary search except it uses two mid values that “divide” the array into three portions. So, it needs to consider three recursive scenarios: See sample run: Accounts are: [0] 5658845 [1] 8080152 [2] 1005231 [3] 4520125 [4] 4562555...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT