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]/df(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)
513 /* Table of constant values */
515 static complex c_b1 = {1.f,0.f};
516 static complex c_b3 = {0.f,0.f};
517 static complex c_b5 = {20.f,0.f};
519 /* > \brief \b CLATM5 */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
529 /* SUBROUTINE CLATM5( PRTYPE, M, N, A, LDA, B, LDB, C, LDC, D, LDD, */
530 /* E, LDE, F, LDF, R, LDR, L, LDL, ALPHA, QBLCKA, */
533 /* INTEGER LDA, LDB, LDC, LDD, LDE, LDF, LDL, LDR, M, N, */
534 /* $ PRTYPE, QBLCKA, QBLCKB */
536 /* COMPLEX A( LDA, * ), B( LDB, * ), C( LDC, * ), */
537 /* $ D( LDD, * ), E( LDE, * ), F( LDF, * ), */
538 /* $ L( LDL, * ), R( LDR, * ) */
541 /* > \par Purpose: */
546 /* > CLATM5 generates matrices involved in the Generalized Sylvester */
549 /* > A * R - L * B = C */
550 /* > D * R - L * E = F */
552 /* > They also satisfy (the diagonalization condition) */
554 /* > [ I -L ] ( [ A -C ], [ D -F ] ) [ I R ] = ( [ A ], [ D ] ) */
555 /* > [ I ] ( [ B ] [ E ] ) [ I ] ( [ B ] [ E ] ) */
562 /* > \param[in] PRTYPE */
564 /* > PRTYPE is INTEGER */
565 /* > "Points" to a certain type of the matrices to generate */
566 /* > (see further details). */
572 /* > Specifies the order of A and D and the number of rows in */
573 /* > C, F, R and L. */
579 /* > Specifies the order of B and E and the number of columns in */
580 /* > C, F, R and L. */
583 /* > \param[out] A */
585 /* > A is COMPLEX array, dimension (LDA, M). */
586 /* > On exit A M-by-M is initialized according to PRTYPE. */
589 /* > \param[in] LDA */
591 /* > LDA is INTEGER */
592 /* > The leading dimension of A. */
595 /* > \param[out] B */
597 /* > B is COMPLEX array, dimension (LDB, N). */
598 /* > On exit B N-by-N is initialized according to PRTYPE. */
601 /* > \param[in] LDB */
603 /* > LDB is INTEGER */
604 /* > The leading dimension of B. */
607 /* > \param[out] C */
609 /* > C is COMPLEX array, dimension (LDC, N). */
610 /* > On exit C M-by-N is initialized according to PRTYPE. */
613 /* > \param[in] LDC */
615 /* > LDC is INTEGER */
616 /* > The leading dimension of C. */
619 /* > \param[out] D */
621 /* > D is COMPLEX array, dimension (LDD, M). */
622 /* > On exit D M-by-M is initialized according to PRTYPE. */
625 /* > \param[in] LDD */
627 /* > LDD is INTEGER */
628 /* > The leading dimension of D. */
631 /* > \param[out] E */
633 /* > E is COMPLEX array, dimension (LDE, N). */
634 /* > On exit E N-by-N is initialized according to PRTYPE. */
637 /* > \param[in] LDE */
639 /* > LDE is INTEGER */
640 /* > The leading dimension of E. */
643 /* > \param[out] F */
645 /* > F is COMPLEX array, dimension (LDF, N). */
646 /* > On exit F M-by-N is initialized according to PRTYPE. */
649 /* > \param[in] LDF */
651 /* > LDF is INTEGER */
652 /* > The leading dimension of F. */
655 /* > \param[out] R */
657 /* > R is COMPLEX array, dimension (LDR, N). */
658 /* > On exit R M-by-N is initialized according to PRTYPE. */
661 /* > \param[in] LDR */
663 /* > LDR is INTEGER */
664 /* > The leading dimension of R. */
667 /* > \param[out] L */
669 /* > L is COMPLEX array, dimension (LDL, N). */
670 /* > On exit L M-by-N is initialized according to PRTYPE. */
673 /* > \param[in] LDL */
675 /* > LDL is INTEGER */
676 /* > The leading dimension of L. */
679 /* > \param[in] ALPHA */
681 /* > ALPHA is REAL */
682 /* > Parameter used in generating PRTYPE = 1 and 5 matrices. */
685 /* > \param[in] QBLCKA */
687 /* > QBLCKA is INTEGER */
688 /* > When PRTYPE = 3, specifies the distance between 2-by-2 */
689 /* > blocks on the diagonal in A. Otherwise, QBLCKA is not */
690 /* > referenced. QBLCKA > 1. */
693 /* > \param[in] QBLCKB */
695 /* > QBLCKB is INTEGER */
696 /* > When PRTYPE = 3, specifies the distance between 2-by-2 */
697 /* > blocks on the diagonal in B. Otherwise, QBLCKB is not */
698 /* > referenced. QBLCKB > 1. */
704 /* > \author Univ. of Tennessee */
705 /* > \author Univ. of California Berkeley */
706 /* > \author Univ. of Colorado Denver */
707 /* > \author NAG Ltd. */
709 /* > \date June 2016 */
711 /* > \ingroup complex_matgen */
713 /* > \par Further Details: */
714 /* ===================== */
718 /* > PRTYPE = 1: A and B are Jordan blocks, D and E are identity matrices */
720 /* > A : if (i == j) then A(i, j) = 1.0 */
721 /* > if (j == i + 1) then A(i, j) = -1.0 */
722 /* > else A(i, j) = 0.0, i, j = 1...M */
724 /* > B : if (i == j) then B(i, j) = 1.0 - ALPHA */
725 /* > if (j == i + 1) then B(i, j) = 1.0 */
726 /* > else B(i, j) = 0.0, i, j = 1...N */
728 /* > D : if (i == j) then D(i, j) = 1.0 */
729 /* > else D(i, j) = 0.0, i, j = 1...M */
731 /* > E : if (i == j) then E(i, j) = 1.0 */
732 /* > else E(i, j) = 0.0, i, j = 1...N */
734 /* > L = R are chosen from [-10...10], */
735 /* > which specifies the right hand sides (C, F). */
737 /* > PRTYPE = 2 or 3: Triangular and/or quasi- triangular. */
739 /* > A : if (i <= j) then A(i, j) = [-1...1] */
740 /* > else A(i, j) = 0.0, i, j = 1...M */
742 /* > if (PRTYPE = 3) then */
743 /* > A(k + 1, k + 1) = A(k, k) */
744 /* > A(k + 1, k) = [-1...1] */
745 /* > sign(A(k, k + 1) = -(sin(A(k + 1, k)) */
746 /* > k = 1, M - 1, QBLCKA */
748 /* > B : if (i <= j) then B(i, j) = [-1...1] */
749 /* > else B(i, j) = 0.0, i, j = 1...N */
751 /* > if (PRTYPE = 3) then */
752 /* > B(k + 1, k + 1) = B(k, k) */
753 /* > B(k + 1, k) = [-1...1] */
754 /* > sign(B(k, k + 1) = -(sign(B(k + 1, k)) */
755 /* > k = 1, N - 1, QBLCKB */
757 /* > D : if (i <= j) then D(i, j) = [-1...1]. */
758 /* > else D(i, j) = 0.0, i, j = 1...M */
761 /* > E : if (i <= j) then D(i, j) = [-1...1] */
762 /* > else E(i, j) = 0.0, i, j = 1...N */
764 /* > L, R are chosen from [-10...10], */
765 /* > which specifies the right hand sides (C, F). */
767 /* > PRTYPE = 4 Full */
768 /* > A(i, j) = [-10...10] */
769 /* > D(i, j) = [-1...1] i,j = 1...M */
770 /* > B(i, j) = [-10...10] */
771 /* > E(i, j) = [-1...1] i,j = 1...N */
772 /* > R(i, j) = [-10...10] */
773 /* > L(i, j) = [-1...1] i = 1..M ,j = 1...N */
775 /* > L, R specifies the right hand sides (C, F). */
777 /* > PRTYPE = 5 special case common and/or close eigs. */
780 /* ===================================================================== */
781 /* Subroutine */ int clatm5_(integer *prtype, integer *m, integer *n, complex
782 *a, integer *lda, complex *b, integer *ldb, complex *c__, integer *
783 ldc, complex *d__, integer *ldd, complex *e, integer *lde, complex *f,
784 integer *ldf, complex *r__, integer *ldr, complex *l, integer *ldl,
785 real *alpha, integer *qblcka, integer *qblckb)
787 /* System generated locals */
788 integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, d_dim1,
789 d_offset, e_dim1, e_offset, f_dim1, f_offset, l_dim1, l_offset,
790 r_dim1, r_offset, i__1, i__2, i__3, i__4;
792 complex q__1, q__2, q__3, q__4, q__5;
794 /* Local variables */
796 extern /* Subroutine */ int cgemm_(char *, char *, integer *, integer *,
797 integer *, complex *, complex *, integer *, complex *, integer *,
798 complex *, complex *, integer *);
799 complex imeps, reeps;
802 /* -- LAPACK computational routine (version 3.7.0) -- */
803 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
804 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
808 /* ===================================================================== */
811 /* Parameter adjustments */
813 a_offset = 1 + a_dim1 * 1;
816 b_offset = 1 + b_dim1 * 1;
819 c_offset = 1 + c_dim1 * 1;
822 d_offset = 1 + d_dim1 * 1;
825 e_offset = 1 + e_dim1 * 1;
828 f_offset = 1 + f_dim1 * 1;
831 r_offset = 1 + r_dim1 * 1;
834 l_offset = 1 + l_dim1 * 1;
840 for (i__ = 1; i__ <= i__1; ++i__) {
842 for (j = 1; j <= i__2; ++j) {
844 i__3 = i__ + j * a_dim1;
845 a[i__3].r = 1.f, a[i__3].i = 0.f;
846 i__3 = i__ + j * d_dim1;
847 d__[i__3].r = 1.f, d__[i__3].i = 0.f;
848 } else if (i__ == j - 1) {
849 i__3 = i__ + j * a_dim1;
850 q__1.r = -1.f, q__1.i = 0.f;
851 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
852 i__3 = i__ + j * d_dim1;
853 d__[i__3].r = 0.f, d__[i__3].i = 0.f;
855 i__3 = i__ + j * a_dim1;
856 a[i__3].r = 0.f, a[i__3].i = 0.f;
857 i__3 = i__ + j * d_dim1;
858 d__[i__3].r = 0.f, d__[i__3].i = 0.f;
866 for (i__ = 1; i__ <= i__1; ++i__) {
868 for (j = 1; j <= i__2; ++j) {
870 i__3 = i__ + j * b_dim1;
871 q__1.r = 1.f - *alpha, q__1.i = 0.f;
872 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
873 i__3 = i__ + j * e_dim1;
874 e[i__3].r = 1.f, e[i__3].i = 0.f;
875 } else if (i__ == j - 1) {
876 i__3 = i__ + j * b_dim1;
877 b[i__3].r = 1.f, b[i__3].i = 0.f;
878 i__3 = i__ + j * e_dim1;
879 e[i__3].r = 0.f, e[i__3].i = 0.f;
881 i__3 = i__ + j * b_dim1;
882 b[i__3].r = 0.f, b[i__3].i = 0.f;
883 i__3 = i__ + j * e_dim1;
884 e[i__3].r = 0.f, e[i__3].i = 0.f;
892 for (i__ = 1; i__ <= i__1; ++i__) {
894 for (j = 1; j <= i__2; ++j) {
895 i__3 = i__ + j * r_dim1;
897 q__4.r = (real) i__4, q__4.i = 0.f;
899 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
900 q__1.r = q__2.r * 20.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f
902 r__[i__3].r = q__1.r, r__[i__3].i = q__1.i;
903 i__3 = i__ + j * l_dim1;
904 i__4 = i__ + j * r_dim1;
905 l[i__3].r = r__[i__4].r, l[i__3].i = r__[i__4].i;
911 } else if (*prtype == 2 || *prtype == 3) {
913 for (i__ = 1; i__ <= i__1; ++i__) {
915 for (j = 1; j <= i__2; ++j) {
917 i__3 = i__ + j * a_dim1;
918 q__4.r = (real) i__, q__4.i = 0.f;
920 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
921 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r *
923 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
924 i__3 = i__ + j * d_dim1;
926 q__4.r = (real) i__4, q__4.i = 0.f;
928 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
929 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r *
931 d__[i__3].r = q__1.r, d__[i__3].i = q__1.i;
933 i__3 = i__ + j * a_dim1;
934 a[i__3].r = 0.f, a[i__3].i = 0.f;
935 i__3 = i__ + j * d_dim1;
936 d__[i__3].r = 0.f, d__[i__3].i = 0.f;
944 for (i__ = 1; i__ <= i__1; ++i__) {
946 for (j = 1; j <= i__2; ++j) {
948 i__3 = i__ + j * b_dim1;
950 q__4.r = (real) i__4, q__4.i = 0.f;
952 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
953 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r *
955 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
956 i__3 = i__ + j * e_dim1;
957 q__4.r = (real) j, q__4.i = 0.f;
959 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
960 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r *
962 e[i__3].r = q__1.r, e[i__3].i = q__1.i;
964 i__3 = i__ + j * b_dim1;
965 b[i__3].r = 0.f, b[i__3].i = 0.f;
966 i__3 = i__ + j * e_dim1;
967 e[i__3].r = 0.f, e[i__3].i = 0.f;
975 for (i__ = 1; i__ <= i__1; ++i__) {
977 for (j = 1; j <= i__2; ++j) {
978 i__3 = i__ + j * r_dim1;
980 q__4.r = (real) i__4, q__4.i = 0.f;
982 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
983 q__1.r = q__2.r * 20.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f
985 r__[i__3].r = q__1.r, r__[i__3].i = q__1.i;
986 i__3 = i__ + j * l_dim1;
988 q__4.r = (real) i__4, q__4.i = 0.f;
990 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
991 q__1.r = q__2.r * 20.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f
993 l[i__3].r = q__1.r, l[i__3].i = q__1.i;
1005 for (k = 1; i__2 < 0 ? k >= i__1 : k <= i__1; k += i__2) {
1006 i__3 = k + 1 + (k + 1) * a_dim1;
1007 i__4 = k + k * a_dim1;
1008 a[i__3].r = a[i__4].r, a[i__3].i = a[i__4].i;
1009 i__3 = k + 1 + k * a_dim1;
1010 c_sin(&q__2, &a[k + (k + 1) * a_dim1]);
1011 q__1.r = -q__2.r, q__1.i = -q__2.i;
1012 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
1021 for (k = 1; i__1 < 0 ? k >= i__2 : k <= i__2; k += i__1) {
1022 i__3 = k + 1 + (k + 1) * b_dim1;
1023 i__4 = k + k * b_dim1;
1024 b[i__3].r = b[i__4].r, b[i__3].i = b[i__4].i;
1025 i__3 = k + 1 + k * b_dim1;
1026 c_sin(&q__2, &b[k + (k + 1) * b_dim1]);
1027 q__1.r = -q__2.r, q__1.i = -q__2.i;
1028 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1033 } else if (*prtype == 4) {
1035 for (i__ = 1; i__ <= i__1; ++i__) {
1037 for (j = 1; j <= i__2; ++j) {
1038 i__3 = i__ + j * a_dim1;
1040 q__4.r = (real) i__4, q__4.i = 0.f;
1041 c_sin(&q__3, &q__4);
1042 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
1043 q__1.r = q__2.r * 20.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f
1045 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
1046 i__3 = i__ + j * d_dim1;
1048 q__4.r = (real) i__4, q__4.i = 0.f;
1049 c_sin(&q__3, &q__4);
1050 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
1051 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f +
1053 d__[i__3].r = q__1.r, d__[i__3].i = q__1.i;
1060 for (i__ = 1; i__ <= i__1; ++i__) {
1062 for (j = 1; j <= i__2; ++j) {
1063 i__3 = i__ + j * b_dim1;
1065 q__4.r = (real) i__4, q__4.i = 0.f;
1066 c_sin(&q__3, &q__4);
1067 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
1068 q__1.r = q__2.r * 20.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f
1070 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1071 i__3 = i__ + j * e_dim1;
1073 q__4.r = (real) i__4, q__4.i = 0.f;
1074 c_sin(&q__3, &q__4);
1075 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
1076 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f +
1078 e[i__3].r = q__1.r, e[i__3].i = q__1.i;
1085 for (i__ = 1; i__ <= i__1; ++i__) {
1087 for (j = 1; j <= i__2; ++j) {
1088 i__3 = i__ + j * r_dim1;
1090 q__4.r = (real) i__4, q__4.i = 0.f;
1091 c_sin(&q__3, &q__4);
1092 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
1093 q__1.r = q__2.r * 20.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f
1095 r__[i__3].r = q__1.r, r__[i__3].i = q__1.i;
1096 i__3 = i__ + j * l_dim1;
1098 q__4.r = (real) i__4, q__4.i = 0.f;
1099 c_sin(&q__3, &q__4);
1100 q__2.r = .5f - q__3.r, q__2.i = 0.f - q__3.i;
1101 q__1.r = q__2.r * 2.f - q__2.i * 0.f, q__1.i = q__2.r * 0.f +
1103 l[i__3].r = q__1.r, l[i__3].i = q__1.i;
1109 } else if (*prtype >= 5) {
1110 q__3.r = 1.f, q__3.i = 0.f;
1111 q__2.r = q__3.r * 20.f - q__3.i * 0.f, q__2.i = q__3.r * 0.f + q__3.i
1113 q__1.r = q__2.r / *alpha, q__1.i = q__2.i / *alpha;
1114 reeps.r = q__1.r, reeps.i = q__1.i;
1115 q__2.r = -1.5f, q__2.i = 0.f;
1116 q__1.r = q__2.r / *alpha, q__1.i = q__2.i / *alpha;
1117 imeps.r = q__1.r, imeps.i = q__1.i;
1119 for (i__ = 1; i__ <= i__1; ++i__) {
1121 for (j = 1; j <= i__2; ++j) {
1122 i__3 = i__ + j * r_dim1;
1124 q__5.r = (real) i__4, q__5.i = 0.f;
1125 c_sin(&q__4, &q__5);
1126 q__3.r = .5f - q__4.r, q__3.i = 0.f - q__4.i;
1127 q__2.r = *alpha * q__3.r, q__2.i = *alpha * q__3.i;
1128 c_div(&q__1, &q__2, &c_b5);
1129 r__[i__3].r = q__1.r, r__[i__3].i = q__1.i;
1130 i__3 = i__ + j * l_dim1;
1132 q__5.r = (real) i__4, q__5.i = 0.f;
1133 c_sin(&q__4, &q__5);
1134 q__3.r = .5f - q__4.r, q__3.i = 0.f - q__4.i;
1135 q__2.r = *alpha * q__3.r, q__2.i = *alpha * q__3.i;
1136 c_div(&q__1, &q__2, &c_b5);
1137 l[i__3].r = q__1.r, l[i__3].i = q__1.i;
1144 for (i__ = 1; i__ <= i__1; ++i__) {
1145 i__2 = i__ + i__ * d_dim1;
1146 d__[i__2].r = 1.f, d__[i__2].i = 0.f;
1151 for (i__ = 1; i__ <= i__1; ++i__) {
1153 i__2 = i__ + i__ * a_dim1;
1154 a[i__2].r = 1.f, a[i__2].i = 0.f;
1156 i__2 = i__ + i__ * a_dim1;
1157 q__1.r = reeps.r + 1.f, q__1.i = reeps.i + 0.f;
1158 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
1160 if (i__ % 2 != 0 && i__ < *m) {
1161 i__2 = i__ + (i__ + 1) * a_dim1;
1162 a[i__2].r = imeps.r, a[i__2].i = imeps.i;
1163 } else if (i__ > 1) {
1164 i__2 = i__ + (i__ - 1) * a_dim1;
1165 q__1.r = -imeps.r, q__1.i = -imeps.i;
1166 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
1168 } else if (i__ <= 8) {
1170 i__2 = i__ + i__ * a_dim1;
1171 a[i__2].r = reeps.r, a[i__2].i = reeps.i;
1173 i__2 = i__ + i__ * a_dim1;
1174 q__1.r = -reeps.r, q__1.i = -reeps.i;
1175 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
1177 if (i__ % 2 != 0 && i__ < *m) {
1178 i__2 = i__ + (i__ + 1) * a_dim1;
1179 a[i__2].r = 1.f, a[i__2].i = 0.f;
1180 } else if (i__ > 1) {
1181 i__2 = i__ + (i__ - 1) * a_dim1;
1182 q__1.r = -1.f, q__1.i = 0.f;
1183 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
1186 i__2 = i__ + i__ * a_dim1;
1187 a[i__2].r = 1.f, a[i__2].i = 0.f;
1188 if (i__ % 2 != 0 && i__ < *m) {
1189 i__2 = i__ + (i__ + 1) * a_dim1;
1191 q__1.r = d__1 * imeps.r, q__1.i = d__1 * imeps.i;
1192 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
1193 } else if (i__ > 1) {
1194 i__2 = i__ + (i__ - 1) * a_dim1;
1195 q__2.r = -imeps.r, q__2.i = -imeps.i;
1197 q__1.r = d__1 * q__2.r, q__1.i = d__1 * q__2.i;
1198 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
1205 for (i__ = 1; i__ <= i__1; ++i__) {
1206 i__2 = i__ + i__ * e_dim1;
1207 e[i__2].r = 1.f, e[i__2].i = 0.f;
1209 i__2 = i__ + i__ * b_dim1;
1210 q__1.r = -1.f, q__1.i = 0.f;
1211 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1213 i__2 = i__ + i__ * b_dim1;
1214 q__1.r = 1.f - reeps.r, q__1.i = 0.f - reeps.i;
1215 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1217 if (i__ % 2 != 0 && i__ < *n) {
1218 i__2 = i__ + (i__ + 1) * b_dim1;
1219 b[i__2].r = imeps.r, b[i__2].i = imeps.i;
1220 } else if (i__ > 1) {
1221 i__2 = i__ + (i__ - 1) * b_dim1;
1222 q__1.r = -imeps.r, q__1.i = -imeps.i;
1223 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1225 } else if (i__ <= 8) {
1227 i__2 = i__ + i__ * b_dim1;
1228 b[i__2].r = reeps.r, b[i__2].i = reeps.i;
1230 i__2 = i__ + i__ * b_dim1;
1231 q__1.r = -reeps.r, q__1.i = -reeps.i;
1232 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1234 if (i__ % 2 != 0 && i__ < *n) {
1235 i__2 = i__ + (i__ + 1) * b_dim1;
1236 q__1.r = imeps.r + 1.f, q__1.i = imeps.i + 0.f;
1237 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1238 } else if (i__ > 1) {
1239 i__2 = i__ + (i__ - 1) * b_dim1;
1240 q__2.r = -1.f, q__2.i = 0.f;
1241 q__1.r = q__2.r - imeps.r, q__1.i = q__2.i - imeps.i;
1242 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1245 i__2 = i__ + i__ * b_dim1;
1246 q__1.r = 1.f - reeps.r, q__1.i = 0.f - reeps.i;
1247 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1248 if (i__ % 2 != 0 && i__ < *n) {
1249 i__2 = i__ + (i__ + 1) * b_dim1;
1251 q__1.r = d__1 * imeps.r, q__1.i = d__1 * imeps.i;
1252 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1253 } else if (i__ > 1) {
1254 i__2 = i__ + (i__ - 1) * b_dim1;
1255 q__2.r = -imeps.r, q__2.i = -imeps.i;
1257 q__1.r = d__1 * q__2.r, q__1.i = d__1 * q__2.i;
1258 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1265 /* Compute rhs (C, F) */
1267 cgemm_("N", "N", m, n, m, &c_b1, &a[a_offset], lda, &r__[r_offset], ldr, &
1268 c_b3, &c__[c_offset], ldc);
1269 q__1.r = -1.f, q__1.i = 0.f;
1270 cgemm_("N", "N", m, n, n, &q__1, &l[l_offset], ldl, &b[b_offset], ldb, &
1271 c_b1, &c__[c_offset], ldc);
1272 cgemm_("N", "N", m, n, m, &c_b1, &d__[d_offset], ldd, &r__[r_offset], ldr,
1273 &c_b3, &f[f_offset], ldf);
1274 q__1.r = -1.f, q__1.i = 0.f;
1275 cgemm_("N", "N", m, n, n, &q__1, &l[l_offset], ldl, &e[e_offset], lde, &
1276 c_b1, &f[f_offset], ldf);