- 2074 Bhadra · 4 marks
Conjugate gradient three iterations (10,-6,0)
Short answer
Starting from zero, the conjugate gradient computations give x1=1.2, x2=0, x3=0 after one iteration; after two, (2.1818, 1.6364, 0); after three, x1=2.4, x2=2.0, x3=0.8, with zero residual.
Carry out three iterations of the conjugate gradient method for the following system of linear equations:
(symmetric, positive definite), . Take , so , .
Iteration 1
Iteration 2
Iteration 3
| Iteration | ||||
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 12 |
| 1 | 1.2000 | 0 | 0 | 7.2 |
| 2 | 2.1818 | 1.6364 | 0 | 3.273 |
| 3 | 2.4000 | 2.0000 | 0.8000 | 0 |
Answer: . Check: , , .
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Conjugate gradient numerical (5 iterations) · Computational Techniques in Civil Engineering, chapter 2
- Linear solution techniques; CG two iterations · Computational Techniques in Civil Engineering, chapter 2
- Conjugate gradient numerical (3,0,2 system) · Computational Techniques in Civil Engineering, chapter 2 · asked 2×
- Conjugate gradient numerical (2,-1 system) · Computational Techniques in Civil Engineering, chapter 2 · asked 2×
- Conjugate gradient method and algorithm · Computational Techniques in Civil Engineering, chapter 2 · asked 2×
- Why conjugate gradient over Gaussian methods · Computational Techniques in Civil Engineering, chapter 2
- Conjugate beam: slope and deflection at free end C · Theory of Structures I, chapter 4 · asked 2×
- Conjugate beam: slope and deflection at free end · Theory of Structures I, chapter 4
- N-R two iterations, y12 = 10∠−73.74° · Power System Analysis II, chapter 2
- Conjugate beam: slope and deflection at free end C · Theory of Structures I, chapter 4 · asked 2×
All Computational Techniques in Civil Engineering chapter 2 questions →