c++实现矩阵类以及矩阵的相关运算
每次写线代作业的时候,自己懒的进行矩阵相关运算,想借助计算机,但这需要重新启动vscode,因为vscode的配置是和文件夹走的,我的c++和python不是一个文件夹,由于这一学期还是写c++多点,重启vscode也懒得,而c++中支持矩阵运算的第三方库一般又是做计算机图形方面的比较大型的库,于是就想自己写一个。
我这像是期中考试的学生吗 555
虽然还有瑕疵,比如小数的处理还没考虑,但是足够帮助我们学习(偷懒 )线性代数了。
目前可以实现相乘、转置、求行列式、求逆、转化为上三角矩阵
不废话了直接上代码:
#include<iostream>
#include<vector>
#include <iomanip>
using namespace std;
class matrix
{
friend matrix matmul(matrix a, matrix b);
friend ostream& operator<<(ostream& out,matrix a);
friend matrix operator*(int,matrix);
private:
int row;
int column;
vector<vector<double> >cmatrix;
public:
matrix(int t1,int t2);
matrix();
matrix tran(matrix);
matrix show();
vector<double>& operator[](int i);
double det(vector<vector<double> >);
double det();
matrix T();
matrix I();
int R();
matrix uptri();
matrix operator+(matrix);
matrix operator-(matrix);
matrix operator*(double);
};
int matrix::R()
{
matrix index=this->uptri();
int r=0;
int index1=0;
for(int i=0;i<row;i++)
{
index1=0;
for(int j=0;j<column;j++)
if(index[i][j]!=0)
index1=1;
if(index1)
r++;
}
return r;
}
matrix operator*(int a,matrix b)
{
matrix index=b;
for(int i=0;i<b.row;i++)
for(int j=0;j<b.column;j++)
index[i][j]*=a;
return index;
}
matrix matrix::operator*(double b)
{
matrix index=*this;
for(int i=0;i<row;i++)
for(int j=column;j<column;j++)
index[i][j]*=b;
return index;
}
matrix matrix::operator-(matrix b)
{
matrix index=*this;
if(this->row!=b.row||this->column!=b.column)
{
cout<<"数学错误"<<endl;
return *this;
}
for(int i=0;i<row;i++)
for(int j=0;j<column;j++)
{
index[i][j]=this->cmatrix[i][j]-b[i][j];
}
return index;
}
matrix matrix::operator+(matrix b)
{
matrix index=*this;
if(this->row!=b.row||this->column!=b.column)
{
cout<<"数学错误"<<endl;
return *this;
}
for(int i=0;i<row;i++)
for(int j=0;j<column;j++)
{
index[i][j]=this->cmatrix[i][j]+b[i][j];
}
return index;
}
matrix::matrix(){column=0;row=0;cmatrix.resize(0);}
matrix::matrix(int t1,int t2):row(t1),column(t2)
{
vector<double>index;
for(int i=0;i<row;i++)
{
index.resize(0);
for(int j=0;j<column;j++)
{
double index1;
cin>>index1;
index.push_back(index1);
}
cmatrix.push_back(index);
}
}
matrix matrix::show()
{
for(int i=0;i<row;i++)
for(int j=0;j<column;j++)
{
if(this->cmatrix[i][j]>0&&this->cmatrix[i][j]<10e-6)
this->cmatrix[i][j]=0;
else if(this->cmatrix[i][j]<0&&this->cmatrix[i][j]>-10e-6)
this->cmatrix[i][j]=0;
}
cout<<'['<<setw(9);
for(int i=0;i<row;i++)
{
// if (i != 0)
// cout <<' ';
for(int j=0;j<column;j++)
{
cout<<cmatrix[i][j]<<setw(10);
// if (j != column - 1)
// cout << "\t";
}
if(i!=row-1)
cout<<endl;
}
cout<<']'<<endl;
return *this;
}
vector<double>& matrix::operator[](int i)
{
return cmatrix[i];
}
matrix matrix::tran(matrix tran)
{
if (this->row != tran.column)
{
cout << "数学错误!" << endl;
return *this;
}
else
{
matrix index;
vector<double>index1;
index1.resize(column);
for (int i = 0; i < tran.row; i++)
index.cmatrix.push_back(index1);
for (int i = 0; i < tran.row; i++)
{
for (int j = 0; j < column; j++)
{
for (int k = 0; k < tran.column;k++)
{
index[i][j] += tran[i][k] * cmatrix[k][j];
}
}
index.row = tran.row;
index.column = column;
}
return index;
}
}
matrix matmul(matrix a, matrix b)
{
matrix index;
vector<double>index1;
index1.resize(b.column);
for (int i = 0; i < a.row; i++)
index.cmatrix.push_back(index1);
for (int i = 0; i < a.row; i++)
{
for (int j = 0; j < b.column; j++)
{
for (int k = 0; k < a.column; k++)
{
index[i][j] += a[i][k] * b[k][j];
}
}
}
index.column = b.column;
index.row = a.row;
return index;
}
ostream& operator<<(ostream& out, matrix a)
{
a.show();
return out;
}
double matrix::det(vector<vector<double> >M)
{
if (M.size()==2)
{
return (M[0][0] * M[1][1] - M[0][1] * M[1][0]);
}
double result=0;
for(int i=0;i<M.size();i++)
{
vector<vector<double> >index;
int sign=i+2;
for(int j=0;j<M.size();j++)
{
if(j==i)
continue;
vector<double>index2;
for(int k=1;k<M.size();k++)
{
index2.push_back(M[j][k]);
}
index.push_back(index2);
}
if(sign%2==0)
sign=1;
else
sign=-1;
result+=sign*M[i][0]*(this->det(index));
}
return result;
}
double matrix::det()
{
if(column!=row)
{
cout<<"数学错误!"<<endl;
return 0;
}
return det(this->cmatrix);
}
matrix matrix::T()
{
matrix index;
index.row=column;
index.column=row;
index.cmatrix.resize(0);
vector<double>index2;
index2.resize(index.column);
for(int i=0;i<index.row;i++)
index.cmatrix.push_back(index2);
for(int i=0;i<index.row;i++)
for(int j=0;j<index.column;j++)
index.cmatrix[i][j]=this->cmatrix[j][i];
return index;
}
matrix matrix::I()
{
matrix index=*this;
matrix index1=*this;
for(int i=0;i<row;i++)
{
index1.cmatrix[i].resize(0);
index1.cmatrix[i].resize(column,0);
index1.cmatrix[i][i]=1;
}
if(this->det()==0)
{
cout<<"不可逆"<<endl;
return *this;
}
for(int i=1;i<row;i++)
{
bool over=false;
for(int j=0;j<i;j++)
{
double t1=(double)index[i][j];
double t2=(double)index[j][j];
if(index[i][j]!=0)
{
if(t2==0)
{
for(int j1=0;j1<column;j1++)
{
double index3=index[j][j1];
index[j][j1]=index[i][j1];
index[i][j1]=index3;
double index4=index1[j][j1];
index1[j][j1]=index1[i][j1];
index1[i][j1]=index4;
}
over=true;
}
if(over)
continue;
for(int k=0;k<column;k++)
{
index[i][k]-=(double)t1/t2*index[j][k];
index1[i][k]-=(double)t1/t2*index1[j][k];
}
}
}
if(over)
{
continue;
over=false;
}
}
for(int i=0;i<row;i++)
{
double t1=(double)index[i][i];
for(int j=0;j<column;j++)
{
index[i][j]/=t1;
index1[i][j]/=t1;
}
}
for(int i=0;i<row;i++)
{
for(int j=i+1;j<column;j++)
{
double t2=(double)index[i][j];
if(index[i][j]!=0)
{
for(int k=0;k<column;k++)
{
index[i][k]-=t2*index[j][k];
index1[i][k]-=t2*index1[j][k];
}
}
}
}
// for(int i=0;i<row;i++)
// for(int j=0;j<column;j++)
// {
// if((int)(index1[i][j]*100)%100==33)
// for(int k=0;k<column;k++)
// index1[i][k]*=3;
// else if((int)(index1[i][j]*100)%100==50)
// for(int k=0;k<column;k++)
// index1[i][k]*=2;
// else if((int)(index1[i][j]*100)%100==20)
// for(int k=0;k<column;k++)
// index1[i][k]*=5;
// else if((int)(index1[i][j]*100)%100!=0)
// for(int k=0;k<column;k++)
// index1[i][k]*=10;
// int t3=0;
// for(int k=2;k<10;k++)
// {
// t3=k;
// for(int i1=0;i1<column;i1++)
// {
// if((int)index1[i][i1]%k!=0)
// t3=0;
// }
// if(t3)
// {
// for(int i1=0;i1<column;i1++)
// index1[i][i1]/=t3;
// }
// }
// }
return index1;
}
matrix matrix::uptri()
{
if(row!=column)
{
cout<<"数学错误!"<<endl;
return *this;
}
matrix index=*this;
for(int i=1;i<row;i++)
{
bool over=false;
for(int j=0;j<i;j++)
{
double t1=(double)index[i][j];
double t2=(double)index[j][j];
if(t1!=0)
{
if(t2==0)
{
for(int j1=0;j1<column;j1++)
{
double index3=index[j][j1];
index[j][j1]=index[i][j1];
index[i][j1]=index3;
}
over=true;
}
if(over)
continue;
for(int k=0;k<column;k++)
{
index[i][k]-=(double)t1/t2*index[j][k];
}
}
}
if(over)
{
continue;
over=false;
}
}
return index;
}
int main()
{
matrix a(3,3);
cout<<"矩阵A:\n"<<a;
cout<<"矩阵A的转置:\n"<<a.T();
cout<<"矩阵A的行列式:"<<a.det()<<endl;
cout<<"矩阵A化为上三角矩阵:\n"<<a.uptri();
cout<<"矩阵A的逆矩阵函数测试:\n"<<a.tran(a.I());
cout<<"矩阵A的逆矩阵:\n"<<a.I();
cout<<"矩阵A的秩为: "<<a.R()<<endl;
// matrix A(3,3);
// matrix b(3,1);
// cout<<matmul(A.I(),b);
return 0;
}