- 2070 Bhadra · 8 marks
Conjugate gradient numerical (5 iterations)
Short answer
Although A is symmetric but not positive definite, CG recurrences still solve the system in three iterations from zero: x1=1.6538, x2=0.1154, x3=-3.9615, residual zero; alpha may be negative because d^T A d can be negative.
Solve the following equation by using the conjugate gradient method (maximum 5 iterations).
, . is symmetric but not positive definite (its eigenvalues are ). The CG recurrences can still be applied as long as no denominator is zero, but may then become negative. Take , so and .
Iteration 1
Iteration 2
Iteration 3
The residual is zero after three iterations, so iterations 4 and 5 are not needed.
Answer: . Check: , , .
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Conjugate gradient three iterations (10,-6,0) · 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×
- Linear solution techniques; CG two iterations · Computational Techniques in Civil Engineering, chapter 2
- CG algorithm; Gauss-Seidel numerical · Computational Techniques in Civil Engineering, chapter 2
- Conjugate gradient method and algorithm · Computational Techniques in Civil Engineering, chapter 2 · asked 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 C · Theory of Structures I, chapter 4 · asked 2×
- Conjugate beam: slope and deflection at free end · Theory of Structures I, chapter 4
- Conjugate beam: overhanging beam free end · Theory of Structures I, chapter 4
All Computational Techniques in Civil Engineering chapter 2 questions →