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
|
/* arpack/dsesrt.f -- translated by f2c (version 20090411).
You must link the resulting object file with libf2c:
on Microsoft Windows system, link with libf2c.lib;
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
or, if you install libf2c.a in a standard place, with -lf2c -lm
-- in that order, at the end of the command line, as in
cc *.o -lf2c -lm
Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
http://www.netlib.org/f2c/libf2c.zip
*/
#ifdef __cplusplus
extern "C" {
#endif
#include "v3p_netlib.h"
/* Table of constant values */
static integer c__1 = 1;
/* ----------------------------------------------------------------------- */
/* \BeginDoc */
/* \Name: dsesrt */
/* \Description: */
/* Sort the array X in the order specified by WHICH and optionally */
/* apply the permutation to the columns of the matrix A. */
/* \Usage: */
/* call dsesrt */
/* ( WHICH, APPLY, N, X, NA, A, LDA) */
/* \Arguments */
/* WHICH Character*2. (Input) */
/* 'LM' -> X is sorted into increasing order of magnitude. */
/* 'SM' -> X is sorted into decreasing order of magnitude. */
/* 'LA' -> X is sorted into increasing order of algebraic. */
/* 'SA' -> X is sorted into decreasing order of algebraic. */
/* APPLY Logical. (Input) */
/* APPLY = .TRUE. -> apply the sorted order to A. */
/* APPLY = .FALSE. -> do not apply the sorted order to A. */
/* N Integer. (INPUT) */
/* Dimension of the array X. */
/* X Double precision array of length N. (INPUT/OUTPUT) */
/* The array to be sorted. */
/* NA Integer. (INPUT) */
/* Number of rows of the matrix A. */
/* A Double precision array of length NA by N. (INPUT/OUTPUT) */
/* LDA Integer. (INPUT) */
/* Leading dimension of A. */
/* \EndDoc */
/* ----------------------------------------------------------------------- */
/* \BeginLib */
/* \Routines */
/* dswap Level 1 BLAS that swaps the contents of two vectors. */
/* \Authors */
/* Danny Sorensen Phuong Vu */
/* Richard Lehoucq CRPC / Rice University */
/* Dept. of Computational & Houston, Texas */
/* Applied Mathematics */
/* Rice University */
/* Houston, Texas */
/* \Revision history: */
/* 12/15/93: Version ' 2.1'. */
/* Adapted from the sort routine in LANSO and */
/* the ARPACK code dsortr */
/* \SCCS Information: @(#) */
/* FILE: sesrt.F SID: 2.3 DATE OF SID: 4/19/96 RELEASE: 2 */
/* \EndLib */
/* ----------------------------------------------------------------------- */
/*< subroutine dsesrt (which, apply, n, x, na, a, lda) >*/
/* Subroutine */ int dsesrt_(char *which, logical *apply, integer *n,
doublereal *x, integer *na, doublereal *a, integer *lda, ftnlen
which_len)
{
/* System generated locals */
integer a_dim1, a_offset, i__1;
doublereal d__1, d__2;
/* Builtin functions */
integer s_cmp(char *, char *, ftnlen, ftnlen);
/* Local variables */
integer i__, j, igap;
doublereal temp;
extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
doublereal *, integer *);
/* %------------------% */
/* | Scalar Arguments | */
/* %------------------% */
/*< character*2 which >*/
/*< logical apply >*/
/*< integer lda, n, na >*/
/* %-----------------% */
/* | Array Arguments | */
/* %-----------------% */
/*< >*/
/* %---------------% */
/* | Local Scalars | */
/* %---------------% */
/*< integer i, igap, j >*/
/*< >*/
/* %----------------------% */
/* | External Subroutines | */
/* %----------------------% */
/*< external dswap >*/
/* %-----------------------% */
/* | Executable Statements | */
/* %-----------------------% */
/*< igap = n / 2 >*/
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 0;
a -= a_offset;
/* Function Body */
igap = *n / 2;
/*< if (which .eq. 'SA') then >*/
if (s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) == 0) {
/* X is sorted into decreasing order of algebraic. */
/*< 10 continue >*/
L10:
/*< if (igap .eq. 0) go to 9000 >*/
if (igap == 0) {
goto L9000;
}
/*< do 30 i = igap, n-1 >*/
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
/*< j = i-igap >*/
j = i__ - igap;
/*< 20 continue >*/
L20:
/*< if (j.lt.0) go to 30 >*/
if (j < 0) {
goto L30;
}
/*< if (x(j).lt.x(j+igap)) then >*/
if (x[j] < x[j + igap]) {
/*< temp = x(j) >*/
temp = x[j];
/*< x(j) = x(j+igap) >*/
x[j] = x[j + igap];
/*< x(j+igap) = temp >*/
x[j + igap] = temp;
/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
if (*apply) {
dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
a_dim1 + 1], &c__1);
}
/*< else >*/
} else {
/*< go to 30 >*/
goto L30;
/*< endif >*/
}
/*< j = j-igap >*/
j -= igap;
/*< go to 20 >*/
goto L20;
/*< 30 continue >*/
L30:
;
}
/*< igap = igap / 2 >*/
igap /= 2;
/*< go to 10 >*/
goto L10;
/*< else if (which .eq. 'SM') then >*/
} else if (s_cmp(which, "SM", (ftnlen)2, (ftnlen)2) == 0) {
/* X is sorted into decreasing order of magnitude. */
/*< 40 continue >*/
L40:
/*< if (igap .eq. 0) go to 9000 >*/
if (igap == 0) {
goto L9000;
}
/*< do 60 i = igap, n-1 >*/
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
/*< j = i-igap >*/
j = i__ - igap;
/*< 50 continue >*/
L50:
/*< if (j.lt.0) go to 60 >*/
if (j < 0) {
goto L60;
}
/*< if (abs(x(j)).lt.abs(x(j+igap))) then >*/
if ((d__1 = x[j], abs(d__1)) < (d__2 = x[j + igap], abs(d__2))) {
/*< temp = x(j) >*/
temp = x[j];
/*< x(j) = x(j+igap) >*/
x[j] = x[j + igap];
/*< x(j+igap) = temp >*/
x[j + igap] = temp;
/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
if (*apply) {
dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
a_dim1 + 1], &c__1);
}
/*< else >*/
} else {
/*< go to 60 >*/
goto L60;
/*< endif >*/
}
/*< j = j-igap >*/
j -= igap;
/*< go to 50 >*/
goto L50;
/*< 60 continue >*/
L60:
;
}
/*< igap = igap / 2 >*/
igap /= 2;
/*< go to 40 >*/
goto L40;
/*< else if (which .eq. 'LA') then >*/
} else if (s_cmp(which, "LA", (ftnlen)2, (ftnlen)2) == 0) {
/* X is sorted into increasing order of algebraic. */
/*< 70 continue >*/
L70:
/*< if (igap .eq. 0) go to 9000 >*/
if (igap == 0) {
goto L9000;
}
/*< do 90 i = igap, n-1 >*/
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
/*< j = i-igap >*/
j = i__ - igap;
/*< 80 continue >*/
L80:
/*< if (j.lt.0) go to 90 >*/
if (j < 0) {
goto L90;
}
/*< if (x(j).gt.x(j+igap)) then >*/
if (x[j] > x[j + igap]) {
/*< temp = x(j) >*/
temp = x[j];
/*< x(j) = x(j+igap) >*/
x[j] = x[j + igap];
/*< x(j+igap) = temp >*/
x[j + igap] = temp;
/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
if (*apply) {
dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
a_dim1 + 1], &c__1);
}
/*< else >*/
} else {
/*< go to 90 >*/
goto L90;
/*< endif >*/
}
/*< j = j-igap >*/
j -= igap;
/*< go to 80 >*/
goto L80;
/*< 90 continue >*/
L90:
;
}
/*< igap = igap / 2 >*/
igap /= 2;
/*< go to 70 >*/
goto L70;
/*< else if (which .eq. 'LM') then >*/
} else if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0) {
/* X is sorted into increasing order of magnitude. */
/*< 100 continue >*/
L100:
/*< if (igap .eq. 0) go to 9000 >*/
if (igap == 0) {
goto L9000;
}
/*< do 120 i = igap, n-1 >*/
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
/*< j = i-igap >*/
j = i__ - igap;
/*< 110 continue >*/
L110:
/*< if (j.lt.0) go to 120 >*/
if (j < 0) {
goto L120;
}
/*< if (abs(x(j)).gt.abs(x(j+igap))) then >*/
if ((d__1 = x[j], abs(d__1)) > (d__2 = x[j + igap], abs(d__2))) {
/*< temp = x(j) >*/
temp = x[j];
/*< x(j) = x(j+igap) >*/
x[j] = x[j + igap];
/*< x(j+igap) = temp >*/
x[j + igap] = temp;
/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
if (*apply) {
dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
a_dim1 + 1], &c__1);
}
/*< else >*/
} else {
/*< go to 120 >*/
goto L120;
/*< endif >*/
}
/*< j = j-igap >*/
j -= igap;
/*< go to 110 >*/
goto L110;
/*< 120 continue >*/
L120:
;
}
/*< igap = igap / 2 >*/
igap /= 2;
/*< go to 100 >*/
goto L100;
/*< end if >*/
}
/*< 9000 continue >*/
L9000:
/*< return >*/
return 0;
/* %---------------% */
/* | End of dsesrt | */
/* %---------------% */
/*< end >*/
} /* dsesrt_ */
#ifdef __cplusplus
}
#endif
|
