solve the system of equations
8x1 -x2 +2x3 =4
-3x1 +11x2 -x3 +3x4 =23
_x2 +10x3 -x4 =-13
_2x1 +x2 -x3 +8x4 =13
with x^(0) =[0 0 0 0]^T by using the Gauss Jacoboi and Gauss Seidel method. The exact solution of the system is x=[1 2 -1 1]^T. Perform the required number of iteration so that the same accuracy is obtained by birth the methods. What conclusions can you draw from the result obtained?
with x(0)=[0000]T by using the Gauss Jacoboi and Gauss Seidel method. The exact solution of the system is x=[12−11]T. Perform the required number of iteration so that the same accuracy is obtained by birth the methods. What conclusions can you draw from the result obtained?
A faster way to get (3) is to solve the first equation in (2) for x1, the second equation for x2, the third for x3, the fourth for x4 and then rename the variables on the left as y1,y2,y3 and y4 respectively.
For k=0, take x(0)=(x1,x2,x3,x4)=(0,0,0,0), and compute
Thus x(2)=(1.086,1.666,−1.347,1.076) . The entries in x(2) are used on the right in (3) to compute the entries in x(3) , and so on. Here are the results, with calculations using EXCEL and results reported to four decimal places:
if we decide to stop when the entries in x(k) and x(k−1) differ by less than 0.001, then we need 8 iterations ( k=8 ).
Apply the Gauss-Seidel method to the system in Example 1 with x(0)=[0000]T and 9 iterations.
For some k , denote the entries in x(k) by (x1,x2,x3,x4) and the entries in x(k−1) by (y1,y2,y3,y4) . The recursion
We will work with one equation at a time. When we reach the second equation, y1 is already known, so we can move it to the right side. Likewise, in the third equation y1 and y2 are known, so we move them to the right. Dividing by the coefficients of the terms remaining on the left, we obtain
The entries in x(1) are used on the right in (4) to compute the entries in x(2) , and so on. Here are the results, with calculations using EXCEL and results reported to four decimal places:
when k is 5, the entries in x(k) and x(k−1) differ by less than 0.001.
Answer: We need 8 iterations ( k=8 ) for Gauss Jacoboi's method and 5 iterations ( k=5 ) for Gauss-Seidel method. In this example the Gauss-Seidel method converges faster than Jacobi's method.
Finding a professional expert in "partial differential equations" in the advanced level is difficult.
You can find this expert in "Assignmentexpert.com" with confidence.
Exceptional experts! I appreciate your help. God bless you!