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
|
/*
* Copyright (c) 2007-2012, Michael Lehn
*
* 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 ULMBLAS_CXXBLAS_LEVEL2SPARSE_HECRSMV_TCC
#define ULMBLAS_CXXBLAS_LEVEL2SPARSE_HECRSMV_TCC 1
#include <ulmblas/cxxblas/level2sparse/hecrsmv.h>
#include <ulmblas/impl/auxiliary/conjugate.h>
#include <ulmblas/impl/auxiliary/real.h>
#define HAVE_CXXBLAS_HECRSMV 1
namespace cxxblas {
template <typename IndexType, typename ALPHA, typename MA, typename VX,
typename BETA, typename VY>
void
hecrsmv(IndexType n,
const ALPHA &alpha,
bool lowerA,
const MA *A,
const IndexType *ia,
const IndexType *ja,
const VX *x,
const BETA &beta,
VY *y)
{
//CXXBLAS_DEBUG_OUT("hecrsmv_generic");
using ulmBLAS::conjugate;
using ulmBLAS::real;
//
// The correct index base of the CRS matrix is stored in first Element of ia
//
--ia;
ja -= ia[1];
A -= ia[1];
//
// Let x, y be one-based; x_, y_ get correct index base ia[1]
//
const VX *x_ = x - ia[1];
VY *y_ = y - ia[1];
--x;
--y;
if (beta==BETA(0)) {
for (int i=1; i<=n; ++i) {
y[i] = 0;
}
} else if (beta!=BETA(1)) {
for (int i=1; i<=n; ++i) {
y[i] *= beta;
}
}
if (!lowerA) {
for (int i=1, I=ia[1]; i<=n; ++i, ++I) {
if (ia[i]<ia[i+1]) {
int k=ia[i];
if (ja[k]==I) {
y[i] += alpha*real(A[k])*x_[ja[k]];
} else {
y[i] += alpha*A[k]*x_[ja[k]];
y_[ja[k]] += alpha*conjugate(A[k])*x[i];
}
for (k=ia[i]+1; k<ia[i+1]; ++k) {
y[i] += alpha*A[k]*x_[ja[k]];
y_[ja[k]] += alpha*conjugate(A[k])*x[i];
}
}
}
} else {
for (int i=1, I=ia[1]; i<=n; ++i, ++I) {
if (ia[i]<ia[i+1]) {
int k;
for (k=ia[i]; k<ia[i+1]-1; ++k) {
y[i] += alpha*A[k]*x_[ja[k]];
y_[ja[k]] += alpha*conjugate(A[k])*x[i];
}
if (ja[k]==I) {
y[i] += alpha*real(A[k])*x_[ja[k]];
} else {
y[i] += alpha*A[k]*x_[ja[k]];
y_[ja[k]] += alpha*conjugate(A[k])*x[i];
}
}
}
}
}
#ifdef HAVE_SPARSEBLAS
template <typename IndexType>
typename If<IndexType>::isBlasCompatibleInteger
hecrsmv(StorageUpLo upLo,
IndexType n,
const ComplexFloat &alpha,
const ComplexFloat *A,
const IndexType *ia,
const IndexType *ja,
const ComplexFloat *x,
const ComplexFloat &beta,
ComplexFloat *y)
{
CXXBLAS_DEBUG_OUT("hecrsmv -> [" BLAS_IMPL "] ccsrmv");
char matdescra[5] = { "H*N*" };
matdescra[1] = getF77BlasChar(upLo);
matdescra[3] = getIndexBaseChar(ia[0]);
if (matdescra[3]=='E') {
hecrsmv<IndexType, ComplexFloat, ComplexFloat,
ComplexFloat, ComplexFloat,
ComplexFloat>
(upLo, n, alpha, A, ia, ja, x, beta, y);
return;
}
char transA = 'N';
mkl_ccsrmv(&transA,
&n, &n,
reinterpret_cast<const float*>(&alpha), &matdescra[0],
reinterpret_cast<const float*>(A), ja, ia, ia+1,
reinterpret_cast<const float*>(x),
reinterpret_cast<const float*>(&beta),
reinterpret_cast<float*>(y));
}
template <typename IndexType>
typename If<IndexType>::isBlasCompatibleInteger
hecrsmv(StorageUpLo upLo,
IndexType n,
const ComplexDouble &alpha,
const ComplexDouble *A,
const IndexType *ia,
const IndexType *ja,
const ComplexDouble *x,
const ComplexDouble &beta,
ComplexDouble *y)
{
CXXBLAS_DEBUG_OUT("hecrsmv -> [" BLAS_IMPL "] zcsrmv");
char matdescra[5] = { "H*N*" };
matdescra[1] = getF77BlasChar(upLo);
matdescra[3] = getIndexBaseChar(ia[0]);
if (matdescra[3]=='E') {
hecrsmv<IndexType, ComplexDouble, ComplexDouble,
ComplexDouble, ComplexDouble,
ComplexDouble>
(upLo, n, alpha, A, ia, ja, x, beta, y);
return;
}
char transA = 'N';
mkl_zcsrmv(&transA,
&n, &n,
reinterpret_cast<const double*>(&alpha), &matdescra[0],
reinterpret_cast<const double*>(A), ja, ia, ia+1,
reinterpret_cast<const double*>(x),
reinterpret_cast<const double*>(&beta),
reinterpret_cast<double*>(y));
}
#endif
} // namespace cxxblas
#endif // ULMBLAS_CXXBLAS_LEVEL2SPARSE_HECRSMV_TCC
|