Please follow the following code format and not coping other codes cuz it doesn't work THANK YOU! IN PYTHON: Given an n×n matrix A and n×1 right-hand side b, write a function that carries out q iterations of the Gauss elimination outer loop (without pivoting), where q is an integer between 1 and n, and returns the resulting augmented matrix with all below-diagonal elements transformed to zero in the left-most q columns. the code format
Please follow the following code format and not coping other codes cuz it doesn't work THANK YOU!
IN PYTHON:
Given an n×n matrix A and n×1 right-hand side b, write a function that carries out q iterations of the Gauss elimination outer loop (without pivoting), where q is an integer between 1 and n, and returns the resulting augmented matrix with all below-diagonal elements transformed to zero in the left-most q columns.
the code format:
Solution
def gaussq(A, b, q):
n = len(A)
Aa = [[0] * (n+1) for i in range(n)]
for i in range(n):
for j in range(n+1):
Aa[i][j] = A[i][j]
for j in range(q):
for i in range(n-1, j, -1):
Aa[i][j] = Aa[i][j]/Aa[j][j]
for k in range(n+1):
Aa[i][k] = Aa[i][k] - Aa[i][j]*Aa[j][k]
return Aa
A = [1, 1, 1, 0]
b = [1]
q = 1
gaussq(A, b, q)
1 1 1 0 1
0 2 1 1 2
0 3 2 1 3
0 0 1 2 3
Step by step
Solved in 2 steps
