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
|
/* -- translated by f2c (version 19940927).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
#include "f2c.h"
/* Complex */ VOID clatm3_(complex * ret_val, integer *m, integer *n, integer
*i, integer *j, integer *isub, integer *jsub, integer *kl, integer *
ku, integer *idist, integer *iseed, complex *d, integer *igrade,
complex *dl, complex *dr, integer *ipvtng, integer *iwork, real *
sparse)
{
/* System generated locals */
integer i__1, i__2;
complex q__1, q__2, q__3;
/* Builtin functions */
void c_div(complex *, complex *, complex *), r_cnjg(complex *, complex *);
/* Local variables */
static complex ctemp;
extern /* Complex */ VOID clarnd_(complex *, integer *, integer *);
extern doublereal slaran_(integer *);
/* -- LAPACK auxiliary test routine (version 2.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
February 29, 1992
Purpose
=======
CLATM3 returns the (ISUB,JSUB) entry of a random matrix of
dimension (M, N) described by the other paramters. (ISUB,JSUB)
is the final position of the (I,J) entry after pivoting
according to IPVTNG and IWORK. CLATM3 is called by the
CLATMR routine in order to build random test matrices. No error
checking on parameters is done, because this routine is called in
a tight loop by CLATMR which has already checked the parameters.
Use of CLATM3 differs from CLATM2 in the order in which the random
number generator is called to fill in random matrix entries.
With CLATM2, the generator is called to fill in the pivoted matrix
columnwise. With CLATM3, the generator is called to fill in the
matrix columnwise, after which it is pivoted. Thus, CLATM3 can
be used to construct random matrices which differ only in their
order of rows and/or columns. CLATM2 is used to construct band
matrices while avoiding calling the random number generator for
entries outside the band (and therefore generating random numbers
in different orders for different pivot orders).
The matrix whose (ISUB,JSUB) entry is returned is constructed as
follows (this routine only computes one entry):
If ISUB is outside (1..M) or JSUB is outside (1..N), return zero
(this is convenient for generating matrices in band format).
Generate a matrix A with random entries of distribution IDIST.
Set the diagonal to D.
Grade the matrix, if desired, from the left (by DL) and/or
from the right (by DR or DL) as specified by IGRADE.
Permute, if desired, the rows and/or columns as specified by
IPVTNG and IWORK.
Band the matrix to have lower bandwidth KL and upper
bandwidth KU.
Set random entries to zero as specified by SPARSE.
Arguments
=========
M - INTEGER
Number of rows of matrix. Not modified.
N - INTEGER
Number of columns of matrix. Not modified.
I - INTEGER
Row of unpivoted entry to be returned. Not modified.
J - INTEGER
Column of unpivoted entry to be returned. Not modified.
ISUB - INTEGER
Row of pivoted entry to be returned. Changed on exit.
JSUB - INTEGER
Column of pivoted entry to be returned. Changed on exit.
KL - INTEGER
Lower bandwidth. Not modified.
KU - INTEGER
Upper bandwidth. Not modified.
IDIST - INTEGER
On entry, IDIST specifies the type of distribution to be
used to generate a random matrix .
1 => real and imaginary parts each UNIFORM( 0, 1 )
2 => real and imaginary parts each UNIFORM( -1, 1 )
3 => real and imaginary parts each NORMAL( 0, 1 )
4 => complex number uniform in DISK( 0 , 1 )
Not modified.
ISEED - INTEGER array of dimension ( 4 )
Seed for random number generator.
Changed on exit.
D - COMPLEX array of dimension ( MIN( I , J ) )
Diagonal entries of matrix. Not modified.
IGRADE - INTEGER
Specifies grading of matrix as follows:
0 => no grading
1 => matrix premultiplied by diag( DL )
2 => matrix postmultiplied by diag( DR )
3 => matrix premultiplied by diag( DL ) and
postmultiplied by diag( DR )
4 => matrix premultiplied by diag( DL ) and
postmultiplied by inv( diag( DL ) )
5 => matrix premultiplied by diag( DL ) and
postmultiplied by diag( CONJG(DL) )
6 => matrix premultiplied by diag( DL ) and
postmultiplied by diag( DL )
Not modified.
DL - COMPLEX array ( I or J, as appropriate )
Left scale factors for grading matrix. Not modified.
DR - COMPLEX array ( I or J, as appropriate )
Right scale factors for grading matrix. Not modified.
IPVTNG - INTEGER
On entry specifies pivoting permutations as follows:
0 => none.
1 => row pivoting.
2 => column pivoting.
3 => full pivoting, i.e., on both sides.
Not modified.
IWORK - INTEGER array ( I or J, as appropriate )
This array specifies the permutation used. The
row (or column) originally in position K is in
position IWORK( K ) after pivoting.
This differs from IWORK for CLATM2. Not modified.
SPARSE - REAL between 0. and 1.
On entry specifies the sparsity of the matrix
if sparse matix is to be generated.
SPARSE should lie between 0 and 1.
A uniform ( 0, 1 ) random number x is generated and
compared to SPARSE; if x is larger the matrix entry
is unchanged and if x is smaller the entry is set
to zero. Thus on the average a fraction SPARSE of the
entries will be set to zero.
Not modified.
=====================================================================
-----------------------------------------------------------------------
Check for I and J in range
Parameter adjustments */
--iwork;
--dr;
--dl;
--d;
--iseed;
/* Function Body */
if (*i < 1 || *i > *m || *j < 1 || *j > *n) {
*isub = *i;
*jsub = *j;
ret_val->r = 0.f, ret_val->i = 0.f;
return ;
}
/* Compute subscripts depending on IPVTNG */
if (*ipvtng == 0) {
*isub = *i;
*jsub = *j;
} else if (*ipvtng == 1) {
*isub = iwork[*i];
*jsub = *j;
} else if (*ipvtng == 2) {
*isub = *i;
*jsub = iwork[*j];
} else if (*ipvtng == 3) {
*isub = iwork[*i];
*jsub = iwork[*j];
}
/* Check for banding */
if (*jsub > *isub + *ku || *jsub < *isub - *kl) {
ret_val->r = 0.f, ret_val->i = 0.f;
return ;
}
/* Check for sparsity */
if (*sparse > 0.f) {
if (slaran_(&iseed[1]) < *sparse) {
ret_val->r = 0.f, ret_val->i = 0.f;
return ;
}
}
/* Compute entry and grade it according to IGRADE */
if (*i == *j) {
i__1 = *i;
ctemp.r = d[i__1].r, ctemp.i = d[i__1].i;
} else {
clarnd_(&q__1, idist, &iseed[1]);
ctemp.r = q__1.r, ctemp.i = q__1.i;
}
if (*igrade == 1) {
i__1 = *i;
q__1.r = ctemp.r * dl[i__1].r - ctemp.i * dl[i__1].i, q__1.i =
ctemp.r * dl[i__1].i + ctemp.i * dl[i__1].r;
ctemp.r = q__1.r, ctemp.i = q__1.i;
} else if (*igrade == 2) {
i__1 = *j;
q__1.r = ctemp.r * dr[i__1].r - ctemp.i * dr[i__1].i, q__1.i =
ctemp.r * dr[i__1].i + ctemp.i * dr[i__1].r;
ctemp.r = q__1.r, ctemp.i = q__1.i;
} else if (*igrade == 3) {
i__1 = *i;
q__2.r = ctemp.r * dl[i__1].r - ctemp.i * dl[i__1].i, q__2.i =
ctemp.r * dl[i__1].i + ctemp.i * dl[i__1].r;
i__2 = *j;
q__1.r = q__2.r * dr[i__2].r - q__2.i * dr[i__2].i, q__1.i = q__2.r *
dr[i__2].i + q__2.i * dr[i__2].r;
ctemp.r = q__1.r, ctemp.i = q__1.i;
} else if (*igrade == 4 && *i != *j) {
i__1 = *i;
q__2.r = ctemp.r * dl[i__1].r - ctemp.i * dl[i__1].i, q__2.i =
ctemp.r * dl[i__1].i + ctemp.i * dl[i__1].r;
c_div(&q__1, &q__2, &dl[*j]);
ctemp.r = q__1.r, ctemp.i = q__1.i;
} else if (*igrade == 5) {
i__1 = *i;
q__2.r = ctemp.r * dl[i__1].r - ctemp.i * dl[i__1].i, q__2.i =
ctemp.r * dl[i__1].i + ctemp.i * dl[i__1].r;
r_cnjg(&q__3, &dl[*j]);
q__1.r = q__2.r * q__3.r - q__2.i * q__3.i, q__1.i = q__2.r * q__3.i
+ q__2.i * q__3.r;
ctemp.r = q__1.r, ctemp.i = q__1.i;
} else if (*igrade == 6) {
i__1 = *i;
q__2.r = ctemp.r * dl[i__1].r - ctemp.i * dl[i__1].i, q__2.i =
ctemp.r * dl[i__1].i + ctemp.i * dl[i__1].r;
i__2 = *j;
q__1.r = q__2.r * dl[i__2].r - q__2.i * dl[i__2].i, q__1.i = q__2.r *
dl[i__2].i + q__2.i * dl[i__2].r;
ctemp.r = q__1.r, ctemp.i = q__1.i;
}
ret_val->r = ctemp.r, ret_val->i = ctemp.i;
return ;
/* End of CLATM3 */
} /* clatm3_ */
|
