本来想要使用之前编写的矩阵相乘函数来写求逆矩阵的代码的,但是在操作过程中出了意外,最后使用的是A^(-1)=A*/|A|这个公式来计算逆矩阵,并且还附有求行列式和伴随矩阵
#include<stdio.h>//c
#include<iostream>//c++
#include<iomanip>//setw函数头文件,为了美观
#include<stdlib.h>//和下面的time函数头文件一样,本来想用的
#include<time.h>
using namespace std;
void doAcheng(double a[3][3], double b[3][3], double c[3][3])//矩阵相乘函数c=a*b
{
int i, j, n;
for (i = 0; i < 3; i++) //矩阵相乘定义,用了三个嵌套循环
{
for (j = 0; j < 3; j++)
{
c[i][j] = 0;
for (n = 0; n < 3; n++)
{
c[i][j] += a[i][n] * b[n][j];
}
}
}
}
int main()
{
double a[3][3], b[3][3], c[3][3], d[3][3];//后面要除行列式,故行列式A和矩阵都要有精度
int i, j;
double A=0;
cout << "请输入矩阵:" << endl;
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
cin >> a[i][j];
}
}
for (i = 0; i < 3; i++)//求伴随矩阵
{
for (j = 0; j < 3; j++)
{
if(i!=1 && j!=1)
{
c[j][i] = pow(-1, i + j) * (a[(i + 1) % 3][(j + 1) % 3] * a[(i + 2) % 3][(j + 2) % 3] - a[(i + 2) % 3][(j + 1) % 3] * a[(i + 1) % 3][(j + 2) % 3]);
}
else if(i==1 && j==1)
{
c[j][i] = pow(-1, i + j) * (a[(i + 1) % 3][(j + 1) % 3] * a[(i + 2) % 3][(j + 2) % 3] - a[(i + 2) % 3][(j + 1) % 3] * a[(i + 1) % 3][(j + 2) % 3]);
}
else
{
c[j][i] = pow(-1, i + j+1) * (a[(i + 1) % 3][(j + 1) % 3] * a[(i + 2) % 3][(j + 2) % 3] - a[(i + 2) % 3][(j + 1) % 3] * a[(i + 1) % 3][(j + 2) % 3]);
}
}
}
for (i = 0; i < 3; i++)
{
A += a[0][i] * c[i][0];//计算矩阵行列式
}
if (A != 0)
{
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
b[i][j] = c[i][j] / A;//根据A^(-1)=A^*/|A|
}
}
cout << "行列式为:" << endl << "A=" << A << endl;
cout << "伴随矩阵为:" << endl;
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
cout << setw(7) << c[i][j];
}
cout << "" << endl;
}
cout << "" << endl;
cout << "逆矩阵为:" << endl;
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
cout << setw(7) << b[i][j];
}
cout << "" << endl;
}
cout << "验算结果如下A*A^(-1)=" << endl;
doAcheng(a, b, d);
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
cout << setw(12) << d[i][j];
}
cout << "" << endl;
}
}
else
{
cout << "该矩阵不可逆,请按任意键退出" << endl;
system("pause");
}
return 0;
}
运行结果如下