Reference no: EM133234663

IN PYTHON

A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal and the ones immediately above and below it. Write a function that solves a linear system whose coefficient matrix is tridiagonal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don't need to be modified or added. As an example, consider a linear system Ax = b with 100,000 unknowns and the same number of equations. The coefficient matrix A is tridiagonal, with all elements on the main diagonal equal to 3 and all elements on the diagonals above and below it equal to 1. The vector of constant terms b contains all ones, except that the first and last elements are zero. You can use td to find that x1 = -0.10557. Write the code in PYTHON.