Matrix Operation Using Operator Overloading

#include
#include

class matrix{
private:
int mat[5][5];
int row;
int column;
public:
matrix(int,int);
matrix(matrix&);
void getdata();
matrix operator-(matrix);
matrix operator+(matrix);
matrix operator*(matrix);
void display();
};

matrix::matrix(int r,int c)
{
row=r;column=c;
}

matrix::matrix(matrix& m)
{
row=m.row;
column=m.column;

cout<<"Copy constructor"<for(int i=0;i{
for(int j=0;j{
mat[i][j]=m.mat[i][j];
}
}
}

void matrix::getdata()
{
cout<<"Value input:"<for(int i=0;i{
for(int j=0;j{
cout<<"Value("<cin>>mat[i][j];
}
}


}

matrix matrix::operator+(matrix a)
{
cout<<"Addition operator"<
matrix temp(row,column);

for(int i=0;i{
for(int j=0;j{
temp.mat[i][j]=mat[i][j]+a.mat[i][j];
}
}
return temp;
}

matrix matrix::operator-(matrix a)
{
cout<<"Subtraction operator"<
matrix temp(row,column);

for(int i=0;i{
for(int j=0;j{
temp.mat[i][j]=mat[i][j]-a.mat[i][j];
}
}
return temp;
}

matrix matrix::operator*(matrix a)
{
cout<<"Multiplaction operator"<
matrix temp(row,column);

for (int i=0;i{
for (int j=0;j{
temp.mat[i][j]=0;
for(int k=0;k{
temp.mat[i][j]=temp.mat[i][j]+(mat[i][k]*a.mat[k][j]);
}
}
}

return temp;
}

void matrix::display()
{
cout<<"The matrix is "<for(int i=0;i{
for(int j=0;j{
cout<}
cout<}
}

int main()
{
clrscr();
matrix m1(2,2),m2(2,2),m3(2,2);

m1.getdata();
m2.getdata();

m3=m1+m2;
m3.display();

m3=m1-m2;
m3.display();

m3=m1*m2;
m3.display();

getch();
return 0;
}

Output:

Matrix Inverse - Theory

1. Find det(M), the determinant of the Matrix M. The determinant will usually show up in the denominator of the inverse. If the determinant is zero, the matrix won't have an inverse.
   
   
   Ads by Google

   
   
2. 
   
   Find M^T, the transpose of the matrix. Transposing means reflecting the matrix about the main diagonal, or equivalently, swapping the (i,j)th element and the (j,i)th.
   
   
3.  Find the determinant of each of the 2x2 minor matrices.Find the determinant of each of the 2x2 minor matrices.
   
   
4. 
   
   Represent these as a matrix of cofactors as shown, and multiply each term by the sign indicated. The result of these steps is the adjugate matrix (sometimes also called the adjoint), notated Adj(M).
   
   
5. 
   
   Find the inverse by dividing the adjugate found in the previous step by the determinate from the first step.
   
   

• Note that this same method can be applied to a matrix containing variables or unknowns, for example an algebraic matrix, M, and its inverse, M^-1.
  
  
  
• Write down all your steps as it is extremely difficult to inverse a 3x3 matrix in your head
• Computer programs exist that work out the inverses of matrices for you, up to and including the size of 30x30 matrices
• 
  
• The adjugate matrix is the transpose of the matrix of co-factors, that is why we transpose the matrix in step 2, to find the a transposed matrix of co-factors.
• Check that is accurate by multiplying M by M^-1. You should be able verify that M*M^-1 = M^-1*M = I. I is the identity matrix, consisting of 1s along the main diagonal and 0s elsewhere. If not, you made an error somewhere.

Matrix Inverse in CPP

#include
#include
int main(){

  int a[3][3],i,j;
  float determinant=0;
  clrscr();
  cout<<"Enter the 9 elements of matrix: ";
  for(i=0;i<3 br="" i="">      for(j=0;j<3 br="" j="">       cin>>a[i][j];

  cout<<"\nThe matrix is\n";
  for(i=0;i<3 br="" i="">      cout<<"\n";
      for(j=0;j<3 br="" j="">       cout<<"\t"<  }

  for(i=0;i<3 br="" i="">      determinant = determinant + (a[0][i]*(a[1][(i+1)%3]*a[2][(i+2)%3] - a[1][(i+2)%3]*a[2][(i+1)%3]));

   cout<<"\nInverse of matrix is: \n\n";
   for(i=0;i<3 br="" i="">   cout<<" ";
      for(j=0;j<3 br="" j="">       cout<<" "<<((a[(i+1)%3][(j+1)%3] * a[(i+2)%3][(j+2)%3]) - (a[(i+1)%3][(j+2)%3]*a[(i+2)%3][(j+1)%3]))/ determinant;
       cout<<"\n";
   }

   return 0;
}

Output: