Do 5 steps, starting from x 0 = [1 1 1]. Compare with the GaussSeidel iteration. Which

Question:

Do 5 steps, starting from x0 = [1    1    1]. Compare with the Gauss–Seidel iteration. Which of the two seems to converge faster? Show the details of your work.

Show convergence in Prob. 16 by verifying that I - A,
where A is the matrix in Prob. 16 with the rows divided by the corresponding main diagonal entries, has the eigenvalues -0.519589 and 0.259795 ± 0.246603i.

Data from Prob. 16

Do 5 steps, starting from x0 = [1    1    1]. Compare with the Gauss–Seidel iteration. Which of the two seems to converge faster? Show the details of your work.

The system in Prob. 10

Data from Prob. 10

Do 5 steps, starting from x0 = [1    1    1]T and using 6S in the computation. Make sure that you solve each equation for the variable that has the largest coefficient (why?). Show the details.

4x1           + 5x3 = 12.5
  x1 + 6x2 + 2x3 = 18.5
8x1 + 2x2 +  x3 = -11.5

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: