python code

Write your own function that implements the Gauss-Seidel iteration method to solve Ax-b Assume the matrix is diagonally dominant and no pivoting is required. Program the straight Gauss-Seidel method which updates the solution {x) using the most recent calculated values. The script file that you write is to export a function with an interface of: def run(A,b) This function will call your Gauss-Seidel solver and send it an arbitrary coefficient matrix A and right hand side vector b that the grader will supply. Use a starting vector ofx [1, 1, 1, ....] and iterate until the convergence criteria is met for all the x's. n+1 Use eps 0.0001 and print out the vector x and the number of iterations in the form: Number of Iterations is x is Values should be printed out to 4significant digits of accuracy and displayed in scientific notation. Call this script file a4task3.py Write your own function that implements the Gauss-Seidel iteration method to solve Ax-b Assume the matrix is diagonally dominant and no pivoting is required. Program the straight Gauss-Seidel method which updates the solution {x) using the most recent calculated values. The script file that you write is to export a function with an interface of: def run(A,b) This function will call your Gauss-Seidel solver and send it an arbitrary coefficient matrix A and right hand side vector b that the grader will supply. Use a starting vector ofx [1, 1, 1, ....] and iterate until the convergence criteria is met for all the x's. n+1 Use eps 0.0001 and print out the vector x and the number of iterations in the form: Number of Iterations is x is Values should be printed out to 4significant digits of accuracy and displayed in scientific notation. Call this script file a4task3.py