14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/Cd(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle_() continue;
256 #define myceiling_(w) {ceil(w)}
257 #define myhuge_(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc_(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
514 /* Table of constant values */
516 static doublecomplex c_b1 = {0.,0.};
517 static doublecomplex c_b2 = {1.,0.};
518 static integer c__3 = 3;
519 static integer c__1 = 1;
521 /* > \brief \b ZLAROR */
523 /* =========== DOCUMENTATION =========== */
525 /* Online html documentation available at */
526 /* http://www.netlib.org/lapack/explore-html/ */
531 /* SUBROUTINE ZLAROR( SIDE, INIT, M, N, A, LDA, ISEED, X, INFO ) */
533 /* CHARACTER INIT, SIDE */
534 /* INTEGER INFO, LDA, M, N */
535 /* INTEGER ISEED( 4 ) */
536 /* COMPLEX*16 A( LDA, * ), X( * ) */
539 /* > \par Purpose: */
544 /* > ZLAROR pre- or post-multiplies an M by N matrix A by a random */
545 /* > unitary matrix U, overwriting A. A may optionally be */
546 /* > initialized to the identity matrix before multiplying by U. */
547 /* > U is generated using the method of G.W. Stewart */
548 /* > ( SIAM J. Numer. Anal. 17, 1980, pp. 403-409 ). */
549 /* > (BLAS-2 version) */
555 /* > \param[in] SIDE */
557 /* > SIDE is CHARACTER*1 */
558 /* > SIDE specifies whether A is multiplied on the left or right */
560 /* > SIDE = 'L' Multiply A on the left (premultiply) by U */
561 /* > SIDE = 'R' Multiply A on the right (postmultiply) by UC> SIDE = 'C' Multiply A on the lef
562 t by U and the right by UC> SIDE = 'T' Multiply A on the left by U and the right by U' */
563 /* > Not modified. */
566 /* > \param[in] INIT */
568 /* > INIT is CHARACTER*1 */
569 /* > INIT specifies whether or not A should be initialized to */
570 /* > the identity matrix. */
571 /* > INIT = 'I' Initialize A to (a section of) the */
572 /* > identity matrix before applying U. */
573 /* > INIT = 'N' No initialization. Apply U to the */
574 /* > input matrix A. */
576 /* > INIT = 'I' may be used to generate square (i.e., unitary) */
577 /* > or rectangular orthogonal matrices (orthogonality being */
578 /* > in the sense of ZDOTC): */
580 /* > For square matrices, M=N, and SIDE many be either 'L' or */
581 /* > 'R'; the rows will be orthogonal to each other, as will the */
583 /* > For rectangular matrices where M < N, SIDE = 'R' will */
584 /* > produce a dense matrix whose rows will be orthogonal and */
585 /* > whose columns will not, while SIDE = 'L' will produce a */
586 /* > matrix whose rows will be orthogonal, and whose first M */
587 /* > columns will be orthogonal, the remaining columns being */
589 /* > For matrices where M > N, just use the previous */
590 /* > explanation, interchanging 'L' and 'R' and "rows" and */
593 /* > Not modified. */
599 /* > Number of rows of A. Not modified. */
605 /* > Number of columns of A. Not modified. */
608 /* > \param[in,out] A */
610 /* > A is COMPLEX*16 array, dimension ( LDA, N ) */
611 /* > Input and output array. Overwritten by U A ( if SIDE = 'L' ) */
612 /* > or by A U ( if SIDE = 'R' ) */
613 /* > or by U A U* ( if SIDE = 'C') */
614 /* > or by U A U' ( if SIDE = 'T') on exit. */
617 /* > \param[in] LDA */
619 /* > LDA is INTEGER */
620 /* > Leading dimension of A. Must be at least MAX ( 1, M ). */
621 /* > Not modified. */
624 /* > \param[in,out] ISEED */
626 /* > ISEED is INTEGER array, dimension ( 4 ) */
627 /* > On entry ISEED specifies the seed of the random number */
628 /* > generator. The array elements should be between 0 and 4095; */
629 /* > if not they will be reduced mod 4096. Also, ISEED(4) must */
630 /* > be odd. The random number generator uses a linear */
631 /* > congruential sequence limited to small integers, and so */
632 /* > should produce machine independent random numbers. The */
633 /* > values of ISEED are changed on exit, and can be used in the */
634 /* > next call to ZLAROR to continue the same random number */
639 /* > \param[out] X */
641 /* > X is COMPLEX*16 array, dimension ( 3*MAX( M, N ) ) */
642 /* > Workspace. Of length: */
643 /* > 2*M + N if SIDE = 'L', */
644 /* > 2*N + M if SIDE = 'R', */
645 /* > 3*N if SIDE = 'C' or 'T'. */
649 /* > \param[out] INFO */
651 /* > INFO is INTEGER */
652 /* > An error flag. It is set to: */
653 /* > 0 if no error. */
654 /* > 1 if ZLARND returned a bad random number (installation */
656 /* > -1 if SIDE is not L, R, C, or T. */
657 /* > -3 if M is negative. */
658 /* > -4 if N is negative or if SIDE is C or T and N is not equal */
660 /* > -6 if LDA is less than M. */
666 /* > \author Univ. of Tennessee */
667 /* > \author Univ. of California Berkeley */
668 /* > \author Univ. of Colorado Denver */
669 /* > \author NAG Ltd. */
671 /* > \date December 2016 */
673 /* > \ingroup complex16_matgen */
675 /* ===================================================================== */
676 /* Subroutine */ int zlaror_(char *side, char *init, integer *m, integer *n,
677 doublecomplex *a, integer *lda, integer *iseed, doublecomplex *x,
680 /* System generated locals */
681 integer a_dim1, a_offset, i__1, i__2, i__3;
682 doublecomplex z__1, z__2;
684 /* Local variables */
688 extern logical lsame_(char *, char *);
690 extern /* Subroutine */ int zgerc_(integer *, integer *, doublecomplex *,
691 doublecomplex *, integer *, doublecomplex *, integer *,
692 doublecomplex *, integer *), zscal_(integer *, doublecomplex *,
693 doublecomplex *, integer *);
695 extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
696 doublecomplex *, doublecomplex *, integer *, doublecomplex *,
697 integer *, doublecomplex *, doublecomplex *, integer *);
698 integer itype, nxfrm;
700 extern doublereal dznrm2_(integer *, doublecomplex *, integer *);
701 extern /* Subroutine */ int xerbla_(char *, integer *);
703 extern /* Subroutine */ int zlacgv_(integer *, doublecomplex *, integer *)
705 //extern /* Double Complex */ VOID zlarnd_(doublecomplex *, integer *,
706 extern doublecomplex zlarnd_(integer *,
708 extern /* Subroutine */ int zlaset_(char *, integer *, integer *,
709 doublecomplex *, doublecomplex *, doublecomplex *, integer *);
710 doublecomplex xnorms;
713 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
714 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
715 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
719 /* ===================================================================== */
722 /* Parameter adjustments */
724 a_offset = 1 + a_dim1 * 1;
731 if (*n == 0 || *m == 0) {
736 if (lsame_(side, "L")) {
738 } else if (lsame_(side, "R")) {
740 } else if (lsame_(side, "C")) {
742 } else if (lsame_(side, "T")) {
746 /* Check for argument errors. */
752 } else if (*n < 0 || itype == 3 && *n != *m) {
754 } else if (*lda < *m) {
759 xerbla_("ZLAROR", &i__1);
769 /* Initialize A to the identity matrix if desired */
771 if (lsame_(init, "I")) {
772 zlaset_("Full", m, n, &c_b1, &c_b2, &a[a_offset], lda);
775 /* If no rotation possible, still multiply by */
776 /* a random complex number from the circle |x| = 1 */
778 /* 2) Compute Rotation by computing Householder */
779 /* Transformations H(2), H(3), ..., H(n). Note that the */
780 /* order in which they are computed is irrelevant. */
783 for (j = 1; j <= i__1; ++j) {
785 x[i__2].r = 0., x[i__2].i = 0.;
790 for (ixfrm = 2; ixfrm <= i__1; ++ixfrm) {
791 kbeg = nxfrm - ixfrm + 1;
793 /* Generate independent normal( 0, 1 ) random numbers */
796 for (j = kbeg; j <= i__2; ++j) {
798 //zlarnd_(&z__1, &c__3, &iseed[1]);
799 z__1=zlarnd_(&c__3, &iseed[1]);
800 x[i__3].r = z__1.r, x[i__3].i = z__1.i;
804 /* Generate a Householder transformation from the random vector X */
806 xnorm = dznrm2_(&ixfrm, &x[kbeg], &c__1);
807 xabs = z_abs(&x[kbeg]);
810 z__1.r = x[i__2].r / xabs, z__1.i = x[i__2].i / xabs;
811 csign.r = z__1.r, csign.i = z__1.i;
813 csign.r = 1., csign.i = 0.;
815 z__1.r = xnorm * csign.r, z__1.i = xnorm * csign.i;
816 xnorms.r = z__1.r, xnorms.i = z__1.i;
818 z__1.r = -csign.r, z__1.i = -csign.i;
819 x[i__2].r = z__1.r, x[i__2].i = z__1.i;
820 factor = xnorm * (xnorm + xabs);
821 if (abs(factor) < 1e-20) {
824 xerbla_("ZLAROR", &i__2);
827 factor = 1. / factor;
831 z__1.r = x[i__3].r + xnorms.r, z__1.i = x[i__3].i + xnorms.i;
832 x[i__2].r = z__1.r, x[i__2].i = z__1.i;
834 /* Apply Householder transformation to A */
836 if (itype == 1 || itype == 3 || itype == 4) {
838 /* Apply H(k) on the left of A */
840 zgemv_("C", &ixfrm, n, &c_b2, &a[kbeg + a_dim1], lda, &x[kbeg], &
841 c__1, &c_b1, &x[(nxfrm << 1) + 1], &c__1);
842 z__2.r = factor, z__2.i = 0.;
843 z__1.r = -z__2.r, z__1.i = -z__2.i;
844 zgerc_(&ixfrm, n, &z__1, &x[kbeg], &c__1, &x[(nxfrm << 1) + 1], &
845 c__1, &a[kbeg + a_dim1], lda);
849 if (itype >= 2 && itype <= 4) {
851 /* Apply H(k)* (or H(k)') on the right of A */
854 zlacgv_(&ixfrm, &x[kbeg], &c__1);
857 zgemv_("N", m, &ixfrm, &c_b2, &a[kbeg * a_dim1 + 1], lda, &x[kbeg]
858 , &c__1, &c_b1, &x[(nxfrm << 1) + 1], &c__1);
859 z__2.r = factor, z__2.i = 0.;
860 z__1.r = -z__2.r, z__1.i = -z__2.i;
861 zgerc_(m, &ixfrm, &z__1, &x[(nxfrm << 1) + 1], &c__1, &x[kbeg], &
862 c__1, &a[kbeg * a_dim1 + 1], lda);
868 //zlarnd_(&z__1, &c__3, &iseed[1]);
869 z__1=zlarnd_(&c__3, &iseed[1]);
870 x[1].r = z__1.r, x[1].i = z__1.i;
873 z__1.r = x[1].r / xabs, z__1.i = x[1].i / xabs;
874 csign.r = z__1.r, csign.i = z__1.i;
876 csign.r = 1., csign.i = 0.;
879 x[i__1].r = csign.r, x[i__1].i = csign.i;
881 /* Scale the matrix A by D. */
883 if (itype == 1 || itype == 3 || itype == 4) {
885 for (irow = 1; irow <= i__1; ++irow) {
886 d_cnjg(&z__1, &x[nxfrm + irow]);
887 zscal_(n, &z__1, &a[irow + a_dim1], lda);
892 if (itype == 2 || itype == 3) {
894 for (jcol = 1; jcol <= i__1; ++jcol) {
895 zscal_(m, &x[nxfrm + jcol], &a[jcol * a_dim1 + 1], &c__1);
902 for (jcol = 1; jcol <= i__1; ++jcol) {
903 d_cnjg(&z__1, &x[nxfrm + jcol]);
904 zscal_(m, &z__1, &a[jcol * a_dim1 + 1], &c__1);