Consider a system of linear equations, Ax = b given as:
x1 + 5x2 + 3x3 = 28
3x1 + 7x2 + 13x3 = 76
12x1 + 3x2 − 5x3 = 1
i. Can you solve the system above using Cholesky decomposition? Explain your answer.
ii. Rearrange the rows until A becomes a strictly diagonally dominant matrix.
iii. Then, solve the system using the Gauss-Seidel method with x(0) = (1 0 1)T and stop the iteration when max 1≤i≤n |x(k)i − x(k−1)i| < 0.0500