This repository has been archived by the owner on May 25, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mstruct.h
129 lines (111 loc) · 3.63 KB
/
mstruct.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
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
/***************************************************************************
* blitz/mstruct.h Matrix structure classes
*
* $Id: mstruct.h,v 1.4 2003/12/11 03:44:22 julianc Exp $
*
* Copyright (C) 1997-2001 Todd Veldhuizen <[email protected]>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 for more details.
*
*
* Suggestions: [email protected]
* Bugs: [email protected]
*
* For more information, please see the Blitz++ Home Page:
* http://oonumerics.org/blitz/
*
***************************************************************************/
#ifndef BZ_MSTRUCT_H
#define BZ_MSTRUCT_H
#ifndef BZ_BLITZ_H
#include <blitz/blitz.h>
#endif
#ifndef BZ_ZERO_H
#include <blitz/zero.h>
#endif
/*
* Each matrix structure class encapsulates a storage format for matrix
* data. It is responsible for:
* - Storing the size of the matrix
* - Calculating how many unique elements the matrix will have
* - Mapping indices (i,j) onto memory locations
* - Performing any sign reversals or conjugations when matrix
* elements are retrieved (e.g. in a Hermitian or Skew symmetric
* matrix)
*
* Every matrix structure class must provide these methods:
*
* ctor()
* ctor(unsigned rows, unsigned cols)
* unsigned columns() const;
* unsigned cols() const;
* unsigned firstInRow() const;
* unsigned firstInCol() const;
* template<typename T> T& get(T* data, unsigned i, unsigned j);
* template<typename T> T get(const T* data, unsigned i, unsigned j) const;
* bool inRange(unsigned i, unsigned j) const
* unsigned lastInRow() const;
* unsigned lastInCol() const;
* unsigned numElements() const;
* void resize(unsigned rows, unsigned cols);
* unsigned rows() const;
*
* Each matrix structure class must declare a public type
* T_iterator which is an iterator to scan through the unique
* entries of the matrix. The iterator class must provide
* these methods:
*
* ctor(unsigned rows, unsigned cols)
* unsigned offset() const
* operator bool() const
* unsigned row() const
* unsigned col() const
*/
BZ_NAMESPACE(blitz)
class MatrixStructure { };
class AsymmetricMatrix : public MatrixStructure {
public:
AsymmetricMatrix()
: rows_(0), cols_(0)
{ }
AsymmetricMatrix(unsigned rows, unsigned cols)
: rows_(rows), cols_(cols)
{ }
unsigned columns() const { return cols_; }
unsigned cols() const { return cols_; }
bool inRange(const unsigned i,const unsigned j) const {
return (i<rows_) && (j<cols_);
}
void resize(unsigned rows, unsigned cols) {
rows_ = rows;
cols_ = cols;
}
unsigned rows() const { return rows_; }
protected:
unsigned rows_, cols_;
};
// Still to be implemented:
// SkewSymmetric
// Hermitian
// Tridiagonal
// Banded<L,H>
// Upper bidiagonal
// Lower bidiagonal
// Upper Hessenberg
// Lower Hessenberg
BZ_NAMESPACE_END
#include <blitz/matgen.h> // RowMajor and ColumnMajor general matrices
#include <blitz/matsymm.h> // Symmetric
#include <blitz/matdiag.h> // Diagonal
#include <blitz/mattoep.h> // Toeplitz
#include <blitz/matltri.h> // Lower triangular
#include <blitz/matutri.h> // Upper triangular
#endif // BZ_MSTRUCT_H