计算方法 - 高斯消元法矩阵求逆

最新推荐文章于 2022-05-23 10:22:26 发布

Spikeeee-

最新推荐文章于 2022-05-23 10:22:26 发布

阅读量471

点赞数 4

分类专栏：计算方法

本文链接：https://blog.csdn.net/weixin_45919985/article/details/117702622

版权

计算方法专栏收录该内容

13 篇文章 1 订阅

订阅专栏

Python 矩阵增广
行增广：ANS = np.c_[A, b]
列增广：ANS = np.r_[A, b]
博客参考：https://blog.csdn.net/qithon/article/details/80100029

import numpy as np


if __name__ == '__main__':
    A = [[1, 2, 3], [2, 2, 1], [3, 4, 3]]
    A = np.array(A)
    l = A.shape[0]
    E = np.identity(l)
    for k in range(l):
        for i in range(k+1, l):
            temp = A[i][k]/A[k][k]
            for j in range(l):
                A[i][j] = A[i][j] - A[k][j] * temp
                E[i][j] = E[i][j] - E[k][j] * temp
    for k in range(l-1, -1, -1):
        for i in range(k-1, -1, -1):
            temp = A[i][k] / A[k][k]
            A[i][k] = 0
            for j in range(l):
                E[i][j] = E[i][j] - E[k][j] * temp
    for i in range(l):
        for j in range(l):
            E[i][j] = E[i][j] / A[i][i]
    print(E)