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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
|
/*
* Copyright (c) 2012, Michael Lehn, Klaus Pototzky
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1) Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2) Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3) Neither the name of the FLENS development group nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef FLENS_MATRIXTYPES_HERMITIAN_IMPL_HBMATRIX_TCC
#define FLENS_MATRIXTYPES_HERMITIAN_IMPL_HBMATRIX_TCC 1
#include <flens/blas/level1/copy.h>
#include <flens/matrixtypes/hermitian/impl/hbmatrix.h>
#include <flens/typedefs.h>
namespace flens {
template <typename FS>
HbMatrix<FS>::HbMatrix()
{
}
template <typename FS>
HbMatrix<FS>::HbMatrix(IndexType dim, StorageUpLo upLo, IndexType numOffDiags,
IndexType firstIndex)
: engine_(dim, dim, (upLo == Lower) ? numOffDiags : 0,
(upLo == Upper) ? numOffDiags : 0, firstIndex),
upLo_(upLo)
{
ASSERT(dim>=0);
}
template <typename FS>
HbMatrix<FS>::HbMatrix(const Engine &engine, StorageUpLo upLo)
: engine_(engine), upLo_(upLo)
{
}
template <typename FS>
HbMatrix<FS>::HbMatrix(const HbMatrix &rhs)
: HermitianMatrix<HbMatrix<FS> >(),
engine_(rhs.engine()),
upLo_(rhs.upLo())
{
}
template <typename FS>
template <typename RHS>
HbMatrix<FS>::HbMatrix(const HbMatrix<RHS> &rhs)
: engine_(rhs.engine()),
upLo_(rhs.upLo())
{
}
template <typename FS>
template <typename RHS>
HbMatrix<FS>::HbMatrix(HbMatrix<RHS> &rhs)
: engine_(rhs.engine()),
upLo_(rhs.upLo())
{
}
template <typename FS>
template <typename RHS>
HbMatrix<FS>::HbMatrix(const Matrix<RHS> &rhs)
{
blas::copy(rhs.impl(), *this);
}
// -- operators ----------------------------------------------------------------
template <typename FS>
HbMatrix<FS> &
HbMatrix<FS>::operator=(const HbMatrix &rhs)
{
if (this!=&rhs) {
assign(rhs, *this);
}
return *this;
}
template <typename FS>
template <typename RHS>
HbMatrix<FS> &
HbMatrix<FS>::operator=(const Matrix<RHS> &rhs)
{
assign(rhs, *this);
return *this;
}
template <typename FS>
template <typename RHS>
HbMatrix<FS> &
HbMatrix<FS>::operator+=(const Matrix<RHS> &rhs)
{
plusAssign(rhs, *this);
return *this;
}
template <typename FS>
template <typename RHS>
HbMatrix<FS> &
HbMatrix<FS>::operator-=(const Matrix<RHS> &rhs)
{
minusAssign(rhs, *this);
return *this;
}
template <typename FS>
HbMatrix<FS> &
HbMatrix<FS>::operator=(const ElementType &alpha)
{
ASSERT(imag(alpha)==0);
if (upLo_==Lower) {
for (IndexType i = -numOffDiags(); i <= 0; ++i)
(*this).diag(i) = alpha;
} else {
for (IndexType i = numOffDiags(); i >= 0; --i)
(*this).diag(i) = alpha;
}
return *this;
}
template <typename FS>
HbMatrix<FS> &
HbMatrix<FS>::operator+=(const ElementType &alpha)
{
ASSERT(imag(alpha)==0);
if (upLo_==Lower) {
for (IndexType i = -numOffDiags(); i <= 0; ++i)
(*this).diag(i) += alpha;
} else {
for (IndexType i = numOffDiags(); i >= 0; --i)
(*this).diag(i) += alpha;
}
return *this;
}
template <typename FS>
HbMatrix<FS> &
HbMatrix<FS>::operator-=(const ElementType &alpha)
{
ASSERT(imag(alpha)==0);
if (upLo_==Lower) {
for (IndexType i = -numOffDiags(); i <= 0; ++i)
(*this).diag(i) -= alpha;
} else {
for (IndexType i = numOffDiags(); i >= 0; --i)
(*this).diag(i) -= alpha;
}
return *this;
}
template <typename FS>
HbMatrix<FS> &
HbMatrix<FS>::operator*=(const ElementType &alpha)
{
ASSERT(imag(alpha)==0);
if (upLo_==Lower) {
for (IndexType i = -numOffDiags(); i <= 0; ++i)
(*this).diag(i) *= alpha;
} else {
for (IndexType i = numOffDiags(); i >= 0; --i)
(*this).diag(i) *= alpha;
}
return *this;
}
template <typename FS>
HbMatrix<FS> &
HbMatrix<FS>::operator/=(const ElementType &alpha)
{
ASSERT(imag(alpha)==0);
if (upLo_==Lower) {
for (IndexType i = -numOffDiags(); i <= 0; ++i)
(*this).diag(i) /= alpha;
} else {
for (IndexType i = numOffDiags(); i >= 0; --i)
(*this).diag(i) /= alpha;
}
return *this;
}
template <typename FS>
const typename HbMatrix<FS>::ElementType &
HbMatrix<FS>::operator()(IndexType row, IndexType col) const
{
# ifndef NDEBUG
if (upLo()==Upper) {
ASSERT(col>=row);
} else {
ASSERT(col<=row);
}
# endif
return engine_(row, col);
}
template <typename FS>
typename HbMatrix<FS>::ElementType &
HbMatrix<FS>::operator()(IndexType row, IndexType col)
{
# ifndef NDEBUG
if (upLo()==Upper) {
ASSERT(col>=row);
} else {
ASSERT(col<=row);
}
# endif
return engine_(row, col);
}
// -- views --------------------------------------------------------------------
// general views
template <typename FS>
typename HbMatrix<FS>::ConstGeneralView
HbMatrix<FS>::general() const
{
return ConstGeneralViewView(engine_, upLo_);
}
template <typename FS>
typename HbMatrix<FS>::GeneralView
HbMatrix<FS>::general()
{
return GeneralView(engine_, upLo_);
}
// symmetric view
template <typename FS>
typename HbMatrix<FS>::ConstSymmetricView
HbMatrix<FS>::symmetric() const
{
return ConstSymmetricView(engine_, upLo_);
}
template <typename FS>
typename HbMatrix<FS>::SymmetricView
HbMatrix<FS>::symmetric()
{
return SymmetricView(engine_, upLo_);
}
// triangular view
template <typename FS>
typename HbMatrix<FS>::ConstTriangularView
HbMatrix<FS>::triangular() const
{
return ConstTriangularView(engine_, upLo_);
}
template <typename FS>
typename HbMatrix<FS>::TriangularView
HbMatrix<FS>::triangular()
{
return TriangularView(engine_, upLo_);
}
template <typename FS>
const typename HbMatrix<FS>::ConstVectorView
HbMatrix<FS>::diag(IndexType diag) const
{
return ConstVectorView(engine_.viewDiag(diag));
}
template <typename FS>
typename HbMatrix<FS>::VectorView
HbMatrix<FS>::diag(IndexType diag)
{
return VectorView(engine_.viewDiag(diag));
}
// -- methods ------------------------------------------------------------------
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::dim() const
{
return engine_.dim();
}
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::numCols() const
{
return engine_.numCols();
}
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::numRows() const
{
return engine_.numRows();
}
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::firstIndex() const
{
return engine_.firstIndex();
}
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::lastIndex() const
{
return engine_.lastIndex();
}
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::leadingDimension() const
{
return engine_.leadingDimension();
}
template <typename FS>
StorageOrder
HbMatrix<FS>::order() const
{
return engine_.order;
}
template <typename FS>
typename HbMatrix<FS>::IndexType
HbMatrix<FS>::numOffDiags() const
{
return (upLo_==Upper) ? engine_.numSuperDiags()
: engine_.numSubDiags();
}
template <typename FS>
const typename HbMatrix<FS>::ElementType *
HbMatrix<FS>::data() const
{
return engine_.data();
}
template <typename FS>
typename HbMatrix<FS>::ElementType *
HbMatrix<FS>::data()
{
return engine_.data();
}
template <typename FS>
template <typename RHS>
bool
HbMatrix<FS>::resize(const HbMatrix<RHS> &rhs,
const ElementType &value)
{
return engine_.resize(rhs.engine(), value);
}
template <typename FS>
bool
HbMatrix<FS>::resize(IndexType dim, IndexType numOffDiags,
IndexType firstIndex, const ElementType &value)
{
return engine_.resize(dim, dim,
(upLo_==Lower) ? numOffDiags : 0,
(upLo_==Upper) ? numOffDiags : 0,
firstIndex, value);
}
template <typename FS>
bool
HbMatrix<FS>::fill(const ElementType &value)
{
ASSERT(imag(value)==0);
return engine_.fill(value);
}
template <typename FS>
bool
HbMatrix<FS>::fillRandom()
{
bool val = engine_.fillRandom();
VectorView d = (*this).diag(0);
for (IndexType i=d.firstIndex();i<=d.lastIndex();++i) {
d(i) = ElementType(real(d(i)));
}
return val;
}
// -- implementation -----------------------------------------------------------
template <typename FS>
const typename HbMatrix<FS>::Engine &
HbMatrix<FS>::engine() const
{
return engine_;
}
template <typename FS>
typename HbMatrix<FS>::Engine &
HbMatrix<FS>::engine()
{
return engine_;
}
template <typename FS>
StorageUpLo
HbMatrix<FS>::upLo() const
{
return upLo_;
}
} // namespace flens
#endif // FLENS_MATRIXTYPES_HERMITIAN_IMPL_HBMATRIX_TCC
|