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
|
#ifndef MATRIX_HH
#define MATRIX_HH
#include "vsmat.hh"
#include "vector.hh"
/// a Real matrix
class Matrix {
virtual_smat *dat;
public:
void OK() const { dat->OK(); }
int cols() const { return dat->cols(); }
int rows() const { return dat->rows(); }
/// return the size of a matrix
int dim() const;
/**
PRE
the matrix needs to be square.
*/
// Matrix() { dat = 0; }
~Matrix() { delete dat; }
/// set entries to r
void fill(Real r);
/// set diagonal to d
void set_diag(Real d);
void set_diag(Vector d);
/// set unit matrix
void unit() { set_diag(1.0); }
void operator+=(const Matrix&m);
void operator-=(const Matrix&m);
void operator*=(Real a);
void operator/=(Real a) { (*this) *= 1/a; }
/// add a row
void insert_row(Vector v,int k);
/**
add a row to the matrix before row k
PRE
v.dim() == cols()
0 <= k <= rows()
*/
///
void delete_row(int k) { dat->delete_row(k); }
/**
delete a row from this matrix.
PRE
0 <= k < rows();
*/
void delete_column(int k) { dat->delete_column(k); }
///
Matrix(int n);
/**
square n matrix, initialised to null
*/
///
Matrix(int n, int m);
/**
n x m matrix, init to 0
*/
Matrix(const Matrix &m);
/// dyadic product: v * w.transpose
Matrix(Vector v, Vector w);
void operator=(const Matrix&m);
/// access an element
Real operator()(int i,int j) const;
/// access an element
Real &operator()(int i, int j);
/// Matrix multiply with vec (from right)
Vector operator *(const Vector &v) const;
/// set this to m1*m2.
void set_product(const Matrix &m1, const Matrix &m2);
Vector left_multiply(Vector const &) const;
Matrix operator-() const;
/// transpose this.
void transpose();
/// return a transposed copy.
Matrix transposed() const ;
Real norm() const;
/// swap
void swap_columns(int c1, int c2);
/**
PRE
0 <= c1,c2 < cols()
*/
/// swap
void swap_rows(int c1, int c2);
/**
PRE
0 <= c1,c2 < rows()
*/
Vector row(int ) const;
Vector col(int) const;
operator String() const;
void print() const;
};
/** This is a class for a nonsquare block of #Real#s. The
implementation of sparse matrices is done in the appropriate #smat#
class. Matrix only does the mathematical actions (adding,
multiplying, etc.)
TODO
implement ref counting? */
inline Vector
operator *(Vector &v, const Matrix& m) { return m.left_multiply(v); }
Matrix operator *(const Matrix& m1,const Matrix &m2);
Matrix operator /(const Matrix &m1,Real a);
inline Matrix operator -(Matrix m1,const Matrix m2)
{
m1 -= m2;
return m1;
}
#endif
|
