- 2070 Magh · 8 marks
Gauss-Seidel: four unknowns
Short answer
After rearranging for diagonal dominance and applying Gauss-Seidel iterations, the solution converges to x1 = 1.3665, x2 = 1.8681, x3 = 1.2138, x4 = 1.8918.
Solve the following systems of linear equations using the Gauss-Seidel iteration method. x1 + 3x2 - x3 + 7x4 = 19 2x1 + 8x2 + x3 - x4 = 17 3x1 + x2 + 9x3 - x4 = 15 9x1 - x2 - x3 + 2x4 = 13
Gauss-Seidel method: solve each equation for its diagonal unknown and use the newest values immediately in the same iteration. It converges when the system is diagonally dominant.
Step 1: Check dominance and rearrange
The given equations are not in diagonally dominant order, so rearrange them (swap equations) so that the largest coefficient of each unknown lies on the diagonal:
9x1 − x2 − x3 + 2x4 = 13 (was 4th)
2x1 + 8x2 + x3 − x4 = 17 (was 2nd)
3x1 + x2 + 9x3 − x4 = 15 (was 3rd)
x1 + 3x2 − x3 + 7x4 = 19 (was 1st)
Now 9 > 1 + 1 + 2, 8 > 2 + 1 + 1, 9 > 3 + 1 + 1, 7 > 1 + 3 + 1, so the system is diagonally dominant.
Step 2: Iteration formulas
x1 = (13 + x2 + x3 − 2x4) / 9
x2 = (17 − 2x1 − x3 + x4) / 8
x3 = (15 − 3x1 − x2 + x4) / 9
x4 = (19 − x1 − 3x2 + x3) / 7
Start with x1(0) = 0, x2(0) = 0, x3(0) = 0, x4(0) = 0.
Step 3: Iterations
| Iter | x1 | x2 | x3 | x4 |
|---|---|---|---|---|
| 0 | 0.0000 | 0.0000 | 0.0000 | 0.0000 |
| 1 | 1.4444 | 1.7639 | 0.9892 | 1.8933 |
| 2 | 1.3296 | 1.9056 | 1.2221 | 1.8822 |
| 3 | 1.3737 | 1.8641 | 1.2108 | 1.8921 |
| 4 | 1.3656 | 1.8688 | 1.2141 | 1.8917 |
| 5 | 1.3666 | 1.8681 | 1.2138 | 1.8919 |
| 6 | 1.3665 | 1.8681 | 1.2138 | 1.8918 |
| 7 | 1.3665 | 1.8681 | 1.2138 | 1.8918 |
| 8 | 1.3665 | 1.8681 | 1.2138 | 1.8918 |
Values of two successive iterations agree to 4 decimal places, so we stop.
Answer: x1 ≈ 1.3665, x2 ≈ 1.8681, x3 ≈ 1.2138, x4 ≈ 1.8918
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Gauss-Seidel: 10x+y-z=11.19 · Numerical Method, chapter 3
- Gauss-Seidel: 20x+y-2z=17 · Numerical Method, chapter 3
- Gauss elimination: 4x4 system · Numerical Method, chapter 3 · asked 3×
- Gauss elimination, partial pivoting, 4 unknowns · Numerical Method, chapter 3 · asked 4×
- Gauss-Jordan pseudo-code · Numerical Method, chapter 3 · asked 4×
- Find x3[n] from X3=X1X2, x1 5-point, x2 4-point · Digital Signal Analysis and Processing, chapter 7 · asked 3×
- Transfer function from state equations, output x1 · Control Systems, chapter 8 · asked 2×
- Direct, iterative methods; Gauss-Seidel numerical · Computational Techniques in Civil Engineering, chapter 2
- Transfer function from state equations, output x2 · Control Systems, chapter 8 · asked 2×