-
Notifications
You must be signed in to change notification settings - Fork 5
/
matrix.h
91 lines (85 loc) · 2.73 KB
/
matrix.h
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
/******************************************************/
/* */
/* matrix.h - matrices */
/* */
/******************************************************/
/* Copyright 2019,2020 Pierre Abbat.
* This file is part of PerfectTIN.
*
* PerfectTIN is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* PerfectTIN is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License and Lesser General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License
* and Lesser General Public License along with PerfectTIN. If not, see
* <http://www.gnu.org/licenses/>.
*/
#ifndef MATRIX_H
#define MATRIX_H
#include <vector>
#define BYTERMS 104.51076499576490995918
/* square root of 10922.5, which is the root-mean-square of a random byte
* doubled and offset to center
*/
#define matrixmismatch 6
// operation on matrices is impossible because the sizes don't match
struct rowsult
{
int pivot; // which column was selected for the pivot, or -1 if the rows are all 0
int flags; // which of the three elementary row operations were done
double detfactor; // these are multiplied together to compute the determinant
};
class matrix
{
protected:
unsigned rows,columns;
double *entry;
rowsult rowop(matrix &b,int row0,int row1,int piv);
double _determinant();
bool findpivot(matrix &b,int row,int column);
public:
matrix();
matrix(unsigned r,unsigned c);
matrix(const matrix &b);
matrix(matrix &&b);
~matrix();
void resize(unsigned newrows,unsigned newcolumns);
unsigned getrows()
{
return rows;
}
unsigned getcolumns()
{
return columns;
}
void setzero();
void setidentity();
void dump();
matrix &operator=(const matrix &b);
matrix &operator=(matrix &&b);
double *operator[](unsigned row);
matrix operator+(matrix& b);
matrix &operator+=(matrix &b);
matrix operator-(matrix& b);
matrix operator*(matrix& b);
double trace();
matrix transpose() const;
matrix transmult();
void swaprows(unsigned r0,unsigned r1);
void swapcolumns(unsigned c0,unsigned c1);
void gausselim(matrix &b);
void randomize_c();
double determinant();
operator std::vector<double>() const;
};
matrix invert(matrix m);
matrix rowvector(const std::vector<double> &v);
matrix columnvector(const std::vector<double> &v);
#endif