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
|
/* Ergo, version 3.8.2, a program for linear scaling electronic structure
* calculations.
* Copyright (C) 2023 Elias Rudberg, Emanuel H. Rubensson, Pawel Salek,
* and Anastasia Kruchinina.
*
* 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 3 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.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Primary academic reference:
* Ergo: An open-source program for linear-scaling electronic structure
* calculations,
* Elias Rudberg, Emanuel H. Rubensson, Pawel Salek, and Anastasia
* Kruchinina,
* SoftwareX 7, 107 (2018),
* <http://dx.doi.org/10.1016/j.softx.2018.03.005>
*
* For further information about Ergo, see <http://www.ergoscf.org>.
*/
/* This file belongs to the template_lapack part of the Ergo source
* code. The source files in the template_lapack directory are modified
* versions of files originally distributed as CLAPACK, see the
* Copyright/license notice in the file template_lapack/COPYING.
*/
#ifndef TEMPLATE_LAPACK_LASR_HEADER
#define TEMPLATE_LAPACK_LASR_HEADER
template<class Treal>
int template_lapack_lasr(const char *side, const char *pivot, const char *direct, const integer *m,
const integer *n, const Treal *c__, const Treal *s, Treal *a, const integer *
lda)
{
/* -- LAPACK auxiliary routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
October 31, 1992
Purpose
=======
DLASR performs the transformation
A := P*A, when SIDE = 'L' or 'l' ( Left-hand side )
A := A*P', when SIDE = 'R' or 'r' ( Right-hand side )
where A is an m by n real matrix and P is an orthogonal matrix,
consisting of a sequence of plane rotations determined by the
parameters PIVOT and DIRECT as follows ( z = m when SIDE = 'L' or 'l'
and z = n when SIDE = 'R' or 'r' ):
When DIRECT = 'F' or 'f' ( Forward sequence ) then
P = P( z - 1 )*...*P( 2 )*P( 1 ),
and when DIRECT = 'B' or 'b' ( Backward sequence ) then
P = P( 1 )*P( 2 )*...*P( z - 1 ),
where P( k ) is a plane rotation matrix for the following planes:
when PIVOT = 'V' or 'v' ( Variable pivot ),
the plane ( k, k + 1 )
when PIVOT = 'T' or 't' ( Top pivot ),
the plane ( 1, k + 1 )
when PIVOT = 'B' or 'b' ( Bottom pivot ),
the plane ( k, z )
c( k ) and s( k ) must contain the cosine and sine that define the
matrix P( k ). The two by two plane rotation part of the matrix
P( k ), R( k ), is assumed to be of the form
R( k ) = ( c( k ) s( k ) ).
( -s( k ) c( k ) )
This version vectorises across rows of the array A when SIDE = 'L'.
Arguments
=========
SIDE (input) CHARACTER*1
Specifies whether the plane rotation matrix P is applied to
A on the left or the right.
= 'L': Left, compute A := P*A
= 'R': Right, compute A:= A*P'
DIRECT (input) CHARACTER*1
Specifies whether P is a forward or backward sequence of
plane rotations.
= 'F': Forward, P = P( z - 1 )*...*P( 2 )*P( 1 )
= 'B': Backward, P = P( 1 )*P( 2 )*...*P( z - 1 )
PIVOT (input) CHARACTER*1
Specifies the plane for which P(k) is a plane rotation
matrix.
= 'V': Variable pivot, the plane (k,k+1)
= 'T': Top pivot, the plane (1,k+1)
= 'B': Bottom pivot, the plane (k,z)
M (input) INTEGER
The number of rows of the matrix A. If m <= 1, an immediate
return is effected.
N (input) INTEGER
The number of columns of the matrix A. If n <= 1, an
immediate return is effected.
C, S (input) DOUBLE PRECISION arrays, dimension
(M-1) if SIDE = 'L'
(N-1) if SIDE = 'R'
c(k) and s(k) contain the cosine and sine that define the
matrix P(k). The two by two plane rotation part of the
matrix P(k), R(k), is assumed to be of the form
R( k ) = ( c( k ) s( k ) ).
( -s( k ) c( k ) )
A (input/output) DOUBLE PRECISION array, dimension (LDA,N)
The m by n matrix A. On exit, A is overwritten by P*A if
SIDE = 'R' or by A*P' if SIDE = 'L'.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,M).
=====================================================================
Test the input parameters
Parameter adjustments */
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2;
/* Local variables */
integer info;
Treal temp;
integer i__, j;
Treal ctemp, stemp;
#define a_ref(a_1,a_2) a[(a_2)*a_dim1 + a_1]
--c__;
--s;
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
/* Function Body */
info = 0;
if (! (template_blas_lsame(side, "L") || template_blas_lsame(side, "R"))) {
info = 1;
} else if (! (template_blas_lsame(pivot, "V") || template_blas_lsame(pivot,
"T") || template_blas_lsame(pivot, "B"))) {
info = 2;
} else if (! (template_blas_lsame(direct, "F") || template_blas_lsame(direct,
"B"))) {
info = 3;
} else if (*m < 0) {
info = 4;
} else if (*n < 0) {
info = 5;
} else if (*lda < maxMACRO(1,*m)) {
info = 9;
}
if (info != 0) {
template_blas_erbla("LASR ", &info);
return 0;
}
/* Quick return if possible */
if (*m == 0 || *n == 0) {
return 0;
}
if (template_blas_lsame(side, "L")) {
/* Form P * A */
if (template_blas_lsame(pivot, "V")) {
if (template_blas_lsame(direct, "F")) {
i__1 = *m - 1;
for (j = 1; j <= i__1; ++j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__2 = *n;
for (i__ = 1; i__ <= i__2; ++i__) {
temp = a_ref(j + 1, i__);
a_ref(j + 1, i__) = ctemp * temp - stemp * a_ref(
j, i__);
a_ref(j, i__) = stemp * temp + ctemp * a_ref(j,
i__);
/* L10: */
}
}
/* L20: */
}
} else if (template_blas_lsame(direct, "B")) {
for (j = *m - 1; j >= 1; --j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__1 = *n;
for (i__ = 1; i__ <= i__1; ++i__) {
temp = a_ref(j + 1, i__);
a_ref(j + 1, i__) = ctemp * temp - stemp * a_ref(
j, i__);
a_ref(j, i__) = stemp * temp + ctemp * a_ref(j,
i__);
/* L30: */
}
}
/* L40: */
}
}
} else if (template_blas_lsame(pivot, "T")) {
if (template_blas_lsame(direct, "F")) {
i__1 = *m;
for (j = 2; j <= i__1; ++j) {
ctemp = c__[j - 1];
stemp = s[j - 1];
if (ctemp != 1. || stemp != 0.) {
i__2 = *n;
for (i__ = 1; i__ <= i__2; ++i__) {
temp = a_ref(j, i__);
a_ref(j, i__) = ctemp * temp - stemp * a_ref(1,
i__);
a_ref(1, i__) = stemp * temp + ctemp * a_ref(1,
i__);
/* L50: */
}
}
/* L60: */
}
} else if (template_blas_lsame(direct, "B")) {
for (j = *m; j >= 2; --j) {
ctemp = c__[j - 1];
stemp = s[j - 1];
if (ctemp != 1. || stemp != 0.) {
i__1 = *n;
for (i__ = 1; i__ <= i__1; ++i__) {
temp = a_ref(j, i__);
a_ref(j, i__) = ctemp * temp - stemp * a_ref(1,
i__);
a_ref(1, i__) = stemp * temp + ctemp * a_ref(1,
i__);
/* L70: */
}
}
/* L80: */
}
}
} else if (template_blas_lsame(pivot, "B")) {
if (template_blas_lsame(direct, "F")) {
i__1 = *m - 1;
for (j = 1; j <= i__1; ++j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__2 = *n;
for (i__ = 1; i__ <= i__2; ++i__) {
temp = a_ref(j, i__);
a_ref(j, i__) = stemp * a_ref(*m, i__) + ctemp *
temp;
a_ref(*m, i__) = ctemp * a_ref(*m, i__) - stemp *
temp;
/* L90: */
}
}
/* L100: */
}
} else if (template_blas_lsame(direct, "B")) {
for (j = *m - 1; j >= 1; --j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__1 = *n;
for (i__ = 1; i__ <= i__1; ++i__) {
temp = a_ref(j, i__);
a_ref(j, i__) = stemp * a_ref(*m, i__) + ctemp *
temp;
a_ref(*m, i__) = ctemp * a_ref(*m, i__) - stemp *
temp;
/* L110: */
}
}
/* L120: */
}
}
}
} else if (template_blas_lsame(side, "R")) {
/* Form A * P' */
if (template_blas_lsame(pivot, "V")) {
if (template_blas_lsame(direct, "F")) {
i__1 = *n - 1;
for (j = 1; j <= i__1; ++j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__2 = *m;
for (i__ = 1; i__ <= i__2; ++i__) {
temp = a_ref(i__, j + 1);
a_ref(i__, j + 1) = ctemp * temp - stemp * a_ref(
i__, j);
a_ref(i__, j) = stemp * temp + ctemp * a_ref(i__,
j);
/* L130: */
}
}
/* L140: */
}
} else if (template_blas_lsame(direct, "B")) {
for (j = *n - 1; j >= 1; --j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__1 = *m;
for (i__ = 1; i__ <= i__1; ++i__) {
temp = a_ref(i__, j + 1);
a_ref(i__, j + 1) = ctemp * temp - stemp * a_ref(
i__, j);
a_ref(i__, j) = stemp * temp + ctemp * a_ref(i__,
j);
/* L150: */
}
}
/* L160: */
}
}
} else if (template_blas_lsame(pivot, "T")) {
if (template_blas_lsame(direct, "F")) {
i__1 = *n;
for (j = 2; j <= i__1; ++j) {
ctemp = c__[j - 1];
stemp = s[j - 1];
if (ctemp != 1. || stemp != 0.) {
i__2 = *m;
for (i__ = 1; i__ <= i__2; ++i__) {
temp = a_ref(i__, j);
a_ref(i__, j) = ctemp * temp - stemp * a_ref(i__,
1);
a_ref(i__, 1) = stemp * temp + ctemp * a_ref(i__,
1);
/* L170: */
}
}
/* L180: */
}
} else if (template_blas_lsame(direct, "B")) {
for (j = *n; j >= 2; --j) {
ctemp = c__[j - 1];
stemp = s[j - 1];
if (ctemp != 1. || stemp != 0.) {
i__1 = *m;
for (i__ = 1; i__ <= i__1; ++i__) {
temp = a_ref(i__, j);
a_ref(i__, j) = ctemp * temp - stemp * a_ref(i__,
1);
a_ref(i__, 1) = stemp * temp + ctemp * a_ref(i__,
1);
/* L190: */
}
}
/* L200: */
}
}
} else if (template_blas_lsame(pivot, "B")) {
if (template_blas_lsame(direct, "F")) {
i__1 = *n - 1;
for (j = 1; j <= i__1; ++j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__2 = *m;
for (i__ = 1; i__ <= i__2; ++i__) {
temp = a_ref(i__, j);
a_ref(i__, j) = stemp * a_ref(i__, *n) + ctemp *
temp;
a_ref(i__, *n) = ctemp * a_ref(i__, *n) - stemp *
temp;
/* L210: */
}
}
/* L220: */
}
} else if (template_blas_lsame(direct, "B")) {
for (j = *n - 1; j >= 1; --j) {
ctemp = c__[j];
stemp = s[j];
if (ctemp != 1. || stemp != 0.) {
i__1 = *m;
for (i__ = 1; i__ <= i__1; ++i__) {
temp = a_ref(i__, j);
a_ref(i__, j) = stemp * a_ref(i__, *n) + ctemp *
temp;
a_ref(i__, *n) = ctemp * a_ref(i__, *n) - stemp *
temp;
/* L230: */
}
}
/* L240: */
}
}
}
}
return 0;
/* End of DLASR */
} /* dlasr_ */
#undef a_ref
#endif
|
