Breaking News: Grepper is joining You.com. Read the official announcement!

inverse matrix gauss python

Tender Toucan answered on October 30, 2021 Popularity 4/10 Helpfulness 1/10

answer inverse matrix gauss python

inverse matrix gauss python

Comment

-1

def inverse(a):
    n = len(a) #defining the range through which loops will run
    #constructing the n X 2n augmented matrix
    P = [[0.0 for i in range(len(a))] for j in range(len(a))]
    for i in range(3):
        for j in range(3):
            P[j][j] = 1.0
    for i in range(len(a)):
        a[i].extend(P[i])
    #main loop for gaussian elimination begins here
    for k in range(n):
        if abs(a[k][k]) < 1.0e-12:
            for i in range(k+1, n):
                if abs(a[i][k]) > abs(a[k][k]):
                    for j in range(k, 2*n):
                        a[k][j], a[i][j] = a[i][j], a[k][j] #swapping of rows
                    break
        pivot = a[k][k] #defining the pivot
        if pivot == 0: #checking if matrix is invertible
            print("This matrix is not invertible.")
            return
        else:
            for j in range(k, 2*n): #index of columns of the pivot row
                a[k][j] /= pivot
            for i in range(n): #index the subtracted rows
                if i == k or a[i][k] == 0: continue
                factor = a[i][k]
                for j in range(k, 2*n): #index the columns for subtraction
                    a[i][j] -= factor * a[k][j]
    for i in range(len(a)): #displaying the matrix
        for j in range(n, len(a[0])):
            print(a[i][j], end = " ")
        print()

Popularity 4/10 Helpfulness 1/10 Language python

Source: stackoverflow.com

Tags: gauss inverse matrix python

Link to this answer
Share Copy Link

Contributed on Oct 30 2021

Tender Toucan

0 Answers Avg Quality 2/10

inverse matrix gauss python

Contents

More Related Answers

inverse matrix gauss python

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.