c++使用vector求矩阵的A的逆

c++使用vector求矩阵的A的逆

• 直接上代码

#include <vector>
#include <iostream>
using namespace std;

vector<vector<double>> make_zero_martix(int m, int n) {
    //创建0矩阵
    vector<vector<double>> array;
    vector<double> temparay;
    for (int i = 0; i < m; ++i)// m*n 维数组
    {
        for (int j = 0; j < n; ++j)
            temparay.push_back(i * j);
        array.push_back(temparay);
        temparay.erase(temparay.begin(), temparay.end());
    }
    return array;
}

//按第一行展开计算|A|
double getA(vector<vector<double>> arcs, int n)
{
    if (n == 1)
    {
        return arcs[0][0];
    }
    double ans = 0;
    vector<vector<double>> temp = make_zero_martix(arcs.size(), arcs.size());
    int i, j, k;
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < n - 1; j++)
        {
            for (k = 0; k < n - 1; k++)
            {
                temp[j][k] = arcs[j + 1][(k >= i) ? k + 1 : k];
            }
        }
        double t = getA(temp, n - 1);
        if (i % 2 == 0)
        {
            ans += arcs[0][i] * t;
        }
        else
        {
            ans -= arcs[0][i] * t;
        }
    }
    return ans;
}

//计算每一行每一列的每个元素所对应的余子式，组成A*
void  getAStart(vector<vector<double>> arcs, int n, vector<vector<double>>& ans)
{
    if (n == 1)
    {
        ans[0][0] = 1;
        return;
    }
    int i, j, k, t;
    vector<vector<double>> temp = make_zero_martix(n, n);
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < n; j++)
        {
            for (k = 0; k < n - 1; k++)
            {
                for (t = 0; t < n - 1; t++)
                {
                    //cout << arcs[k >= i ? k + 1 : k][t >= j ? t + 1 : t] << endl;
                    temp[k][t] = arcs[k >= i ? k + 1 : k][t >= j ? t + 1 : t];
                }
            }
            ans[j][i] = getA(temp, n - 1);  //此处顺便进行了转置
            if ((i + j) % 2 == 1)
            {
                ans[j][i] = -ans[j][i];
            }
        }
    }
}

//得到给定矩阵src的逆矩阵保存到des中。
bool GetMatrixInverse(vector<vector<double>> src, int n, vector<vector<double>>& des)
{
    double flag = getA(src, n);
    vector<vector<double>> t = make_zero_martix(n, n);
    if (0 == flag)
    {
        cout << "原矩阵行列式为0，无法求逆。请重新运行" << endl;
        return false;//如果算出矩阵的行列式为0，则不往下进行
    }
    else
    {
        getAStart(src, n, t);
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                des[i][j] = t[i][j] / flag;
            }
        }
    }
    return true;
}

vector<vector<double>> inverse(vector<vector<double>> matrix_before) {
    //矩阵求逆
    bool flag;
    vector<vector<double>> matrix_after = make_zero_martix(matrix_before.size(), matrix_before.size());
    flag = GetMatrixInverse(matrix_before, matrix_before.size(), matrix_after);
    return matrix_after;
}


int main() {
    vector<vector<double>> nums1 = {
        {1, 2, 3},
        {4, 15, 6},
        {7, 8, 8}
    };
    vector<vector<double>> w = inverse(nums1);
    for (int i = 0; i < w.size(); i++)
    {
        for (int j = 0; j < w[0].size(); j++)
        {
            cout << w[i][j] << " ";
        }
        cout << endl;
    }
}

• 其他的矩阵操作可见https://blog.csdn.net/cute_boy_/article/details/119515874?spm=1001.2014.3001.5501