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
|
/*
* Copyright (c) 2011, 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.
*/
/* Based on
*
SUBROUTINE DRSCL( N, SA, SX, INCX )
*
* -- LAPACK auxiliary routine (version 3.2) --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
* November 2006
*/
#ifndef FLENS_LAPACK_GE_RSCL_TCC
#define FLENS_LAPACK_GE_RSCL_TCC 1
#include <flens/blas/blas.h>
#include <flens/lapack/lapack.h>
namespace flens { namespace lapack {
//== generic lapack implementation =============================================
namespace generic {
template <typename SA, typename VSX>
void
rscl_impl(const SA &sa, DenseVector<VSX> &sx)
{
using std::abs;
typedef typename DenseVector<VSX>::ElementType ElementType;
typedef typename ComplexTrait<ElementType>::PrimitiveType PrimitiveType;
typedef typename DenseVector<VSX>::IndexType IndexType;
const IndexType n = sx.length();
const PrimitiveType Zero(0), One(1);
//
// Quick return if possible
//
if (n==0) {
return;
}
//
// Get machine parameters
//
PrimitiveType smallNum = lamch<PrimitiveType>(SafeMin);
PrimitiveType bigNum = One / smallNum;
labad(smallNum, bigNum);
//
// Initialize the denominator to SA and the numerator to 1.
//
PrimitiveType cDen = sa;
PrimitiveType cNum = One;
bool done = false;
do {
const PrimitiveType cDen1 = cDen*smallNum;
const PrimitiveType cNum1 = cNum / bigNum;
PrimitiveType mul;
if (abs(cDen1)>abs(cNum) && cNum!=Zero) {
//
// Pre-multiply X by SMLNUM if CDEN is large compared to CNUM.
//
mul = smallNum;
done = false;
cDen = cDen1;
} else if (abs(cNum1)>abs(cDen)) {
//
// Pre-multiply X by BIGNUM if CDEN is small compared to CNUM.
//
mul = bigNum;
done = false;
cNum = cNum1;
} else {
//
// Multiply X by CNUM / CDEN and return.
//
mul = cNum / cDen;
done = true;
}
//
// Scale the vector X by MUL
//
sx *= mul;
} while (!done);
}
} // namespace generic
//== interface for native lapack ===============================================
#ifdef USE_CXXLAPACK
namespace external {
template <typename SA, typename VSX>
void
rscl_impl(const SA &sa, DenseVector<VSX> &sx)
{
typedef typename DenseVector<VSX>::IndexType IndexType;
cxxlapack::rscl<IndexType>(sx.length(), sa, sx.data(), sx.stride());
}
} // namespace external
#endif // USE_CXXLAPACK
//== public interface ==========================================================
template <typename SA, typename VSX>
void
rscl(const SA &sa, DenseVector<VSX> &sx)
{
//
// Test the input parameters
//
# ifndef NDEBUG
ASSERT(sx.firstIndex()==1);
ASSERT(sx.inc()>0);
# endif
# ifdef CHECK_CXXLAPACK
//
// Make copies of output arguments
//
typename DenseVector<VSX>::NoView sx_org = sx;
# endif
//
// Call implementation
//
LAPACK_SELECT::rscl_impl(sa, sx);
# ifdef CHECK_CXXLAPACK
//
// Make copies of results computed by the generic implementation
//
typename DenseVector<VSX>::NoView sx_generic = sx;
//
// restore output arguments
//
sx = sx_org;
//
// Compare generic results with results from the native implementation
//
external::rscl_impl(sa, sx);
bool failed = false;
if (! isIdentical(sx_generic, sx, "sx_generic", "sx")) {
std::cerr << "CXXLAPACK: sx_generic = " << sx_generic << std::endl;
std::cerr << "F77LAPACK: sx = " << sx << std::endl;
failed = true;
}
if (failed) {
ASSERT(0);
}
# endif
}
//-- forwarding ----------------------------------------------------------------
template <typename SA, typename VSX>
void
rscl(const SA &sa, VSX &&sx)
{
CHECKPOINT_ENTER;
rscl(sa, sx);
CHECKPOINT_LEAVE;
}
} } // namespace lapack, flens
#endif // FLENS_LAPACK_GE_RSCL_TCC
|