-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.go
More file actions
166 lines (127 loc) · 2.13 KB
/
matrix.go
File metadata and controls
166 lines (127 loc) · 2.13 KB
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
162
163
164
165
166
package main
import "math"
type Matrix [][]float64
func NewMatrix(n int) Matrix {
a := make(Matrix, n)
for i := range a {
a[i] = make([]float64, n)
}
return a
}
func compareSize(a, b Matrix) bool {
if len(a) != len(b) {
return false
}
for i := range a {
if len(a[i]) != len(b[i]) {
return false
}
}
return true
}
func Product(a, b Matrix) Matrix {
if !compareSize(a, b) {
return NewMatrix(0)
}
c := NewMatrix(len(a))
for i := range a {
for j := range b {
for k := range c {
c[i][j] += a[i][k] * b[k][j]
}
}
}
return c
}
func simpleDet(a Matrix) float64 {
if len(a) == 1 {
return a[0][0]
}
return a[0][0]*a[1][1] - a[0][1]*a[1][0]
}
func minor(a Matrix, x, y int) float64 {
n := len(a)
if n == 1 {
return simpleDet(a)
}
m := NewMatrix(n)
copy(m, a[:x])
if x != n {
m = append(m, a[x+1:]...)
}
for i := range n - 1 {
tmp := m[i]
m[i] = m[i][:y]
if y != n {
m[i] = append(m[i], tmp[y+1:]...)
}
}
return determinant(m)
}
func cofactor(a Matrix, x, y int) float64 {
return math.Pow(float64(-1), float64(x+y)) * minor(a, x, y)
}
func determinant(a Matrix) float64 {
n := len(a)
if n < 3 {
return simpleDet(a)
}
var det float64
for j := range n {
det += cofactor(a, 0, j) * a[0][j]
}
return det
}
func transpose(a Matrix) Matrix {
var (
n = len(a)
t = NewMatrix(n)
)
for i := range n {
for j := range n {
t[i][j] = a[j][i]
}
}
return t
}
func adj(a Matrix) Matrix {
var (
n = len(a)
b = NewMatrix(n)
)
for i := range n {
for j := range n {
b[i][j] = cofactor(a, i, j)
}
}
return transpose(b)
}
func div(a Matrix, x float64) Matrix {
var (
n = len(a)
b = NewMatrix(n)
)
for i := range n {
for j := range n {
b[i][j] = a[i][j] / x
}
}
return b
}
func Inverse(a Matrix) Matrix {
return div(adj(a), determinant(a))
}
func InverseProduct(a, b Matrix) Matrix {
var (
aInvF = InverseFuture(a)
bInvF = InverseFuture(b)
aInv = <-aInvF
bInv = <-bInvF
)
return Product(aInv, bInv)
}
func InverseFuture(a Matrix) <-chan Matrix {
future := make(chan Matrix)
go func() { future <- Inverse(a) }()
return future
}