-
Notifications
You must be signed in to change notification settings - Fork 6
/
squareMat.cpp
162 lines (154 loc) · 3.55 KB
/
squareMat.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
#include "squareMat.h"
using namespace Arash;
squareMat::squareMat(int s):size(s)
{
elements = std::vector<std::vector<long double> >( size , std::vector<long double> (size,0));
}
squareMat::~squareMat(){}
void squareMat::getCofactor(long double** mat,long double** temp, int p, int q,int n)
{
int i = 0, j = 0;
for (int row = 0; row < n; row++)
{
for (int col = 0; col < n; col++)
{
if (row != p && col != q)
{
temp[i][j++] = mat[row][col];
if (j == n - 1)
{
j = 0;
i++;
}
}
}
}
}
void squareMat::getCofactor(std::vector<std::vector<long double>> mat,std::vector<std::vector<long double>>& temp, int p, int q,int n)
{
int i = 0, j = 0;
for (int row = 0; row < n; row++)
{
for (int col = 0; col < n; col++)
{
if (row != p && col != q)
{
temp[i][j++] = mat[row][col];
if (j == n - 1)
{
j = 0;
i++;
}
}
}
}
}
long double squareMat::det(std::vector<std::vector<long double>>& mat,int n)
{
double D = 0;
std::vector<std::vector<long double> > temp( n , std::vector<long double> (n,0));
int sign = 1;
if(n == 1)
return mat[0][0];
for(int col = 0;col < n;col ++)
{
getCofactor(mat,temp,0,col,n);
// std::cout<<"i'm here: \n";
// for(int i=0;i<n;i++){
// std::cout<<std::endl;
// for(int j=0;j<n;j++){
// std::cout<<temp[i][j]<<"\t";
// }
// }
// std::cout<<"\n\n\n";
D += sign * mat[0][col] * det(temp,n-1);
sign *= -1;
}
return D;
}
long double squareMat::det(long double** mat,int n)
{
int D = 0;
long double** temp;
temp = new long double*[n];
int sign = 1;
for(int i = 0;i < n;i ++)
{
temp[i] = new long double[n];
}
if(n == 1)
return mat[0][0];
for(int col = 0;col < n;col ++)
{
getCofactor(mat,temp,0,col,n);
D += sign * mat[0][col] * det(temp,n-1);
sign *= -1;
}
delete[]* temp;
return D;
}
long double squareMat::det()
{
long double** temp;
temp = new long double*[size];
for(int i = 0;i < size;i ++)
{
temp[i] = new long double[size];
for(int j = 0;j < size;j ++)
temp[i][j] = elements[i][j];
}
// std::cout<<"fucking bug is\n";
// for(int i = 0;i < size;i ++)
// {
// std::cout<<std::endl;
// for(int j = 0;j < size;j ++)
// {
// std::cout<<temp[i][j]<<"\t";
// }
// }
return det(temp,size);
}
squareMat squareMat::adjoint()
{
std::vector<std::vector<long double> > ans( size , std::vector<long double> (size,0));
std::vector<std::vector<long double> > tempMat( size , std::vector<long double> (size,0)); ;
int sign;
for(int row = 0;row < size;row ++)
{
for(int col = 0;col < size;col ++)
{
getCofactor(elements,tempMat,row,col,size);
sign = ((row+col)%2==0)? 1: -1;
ans[col][row] = sign * det(tempMat,size-1);
}
}
return squareMat(ans ,size);
}
squareMat squareMat::inverse()
{
long double determinant = det();
squareMat tempAdjoint = adjoint();
squareMat answer(size);
for(int i = 0;i < size;i++)
{
for(int j = 0;j < size;j++)
{
answer(i,j) = tempAdjoint(i,j) / (long double)determinant;
}
}
return answer;
}
long double& Arash::squareMat::operator() (int i, int j) {
return elements[i][j];
}
long double squareMat::operator()(int i, int j) const
{
return elements[i][j];
}
squareMat& squareMat::operator=(const squareMat& rhs)
{
for(int i = 0;i<size;i++)
for(int j = 0;j<size;j++)
elements[i][j] = rhs(i,j);
return (*this);
}