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 integer c__2 = 2;
516 static integer c__1 = 1;
518 /* > \brief \b CTGSY2 solves the generalized Sylvester equation (unblocked algorithm). */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download CTGSY2 + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ctgsy2.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ctgsy2.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ctgsy2.
541 /* SUBROUTINE CTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, */
542 /* LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, */
545 /* CHARACTER TRANS */
546 /* INTEGER IJOB, INFO, LDA, LDB, LDC, LDD, LDE, LDF, M, N */
547 /* REAL RDSCAL, RDSUM, SCALE */
548 /* COMPLEX A( LDA, * ), B( LDB, * ), C( LDC, * ), */
549 /* $ D( LDD, * ), E( LDE, * ), F( LDF, * ) */
552 /* > \par Purpose: */
557 /* > CTGSY2 solves the generalized Sylvester equation */
559 /* > A * R - L * B = scale * C (1) */
560 /* > D * R - L * E = scale * F */
562 /* > using Level 1 and 2 BLAS, where R and L are unknown M-by-N matrices, */
563 /* > (A, D), (B, E) and (C, F) are given matrix pairs of size M-by-M, */
564 /* > N-by-N and M-by-N, respectively. A, B, D and E are upper triangular */
565 /* > (i.e., (A,D) and (B,E) in generalized Schur form). */
567 /* > The solution (R, L) overwrites (C, F). 0 <= SCALE <= 1 is an output */
568 /* > scaling factor chosen to avoid overflow. */
570 /* > In matrix notation solving equation (1) corresponds to solve */
571 /* > Zx = scale * b, where Z is defined as */
573 /* > Z = [ kron(In, A) -kron(B**H, Im) ] (2) */
574 /* > [ kron(In, D) -kron(E**H, Im) ], */
576 /* > Ik is the identity matrix of size k and X**H is the transpose of X. */
577 /* > kron(X, Y) is the Kronecker product between the matrices X and Y. */
579 /* > If TRANS = 'C', y in the conjugate transposed system Z**H*y = scale*b */
580 /* > is solved for, which is equivalent to solve for R and L in */
582 /* > A**H * R + D**H * L = scale * C (3) */
583 /* > R * B**H + L * E**H = scale * -F */
585 /* > This case is used to compute an estimate of Dif[(A, D), (B, E)] = */
586 /* > = sigma_min(Z) using reverse communication with CLACON. */
588 /* > CTGSY2 also (IJOB >= 1) contributes to the computation in CTGSYL */
589 /* > of an upper bound on the separation between to matrix pairs. Then */
590 /* > the input (A, D), (B, E) are sub-pencils of two matrix pairs in */
597 /* > \param[in] TRANS */
599 /* > TRANS is CHARACTER*1 */
600 /* > = 'N': solve the generalized Sylvester equation (1). */
601 /* > = 'T': solve the 'transposed' system (3). */
604 /* > \param[in] IJOB */
606 /* > IJOB is INTEGER */
607 /* > Specifies what kind of functionality to be performed. */
608 /* > = 0: solve (1) only. */
609 /* > = 1: A contribution from this subsystem to a Frobenius */
610 /* > norm-based estimate of the separation between two matrix */
611 /* > pairs is computed. (look ahead strategy is used). */
612 /* > = 2: A contribution from this subsystem to a Frobenius */
613 /* > norm-based estimate of the separation between two matrix */
614 /* > pairs is computed. (SGECON on sub-systems is used.) */
615 /* > Not referenced if TRANS = 'T'. */
621 /* > On entry, M specifies the order of A and D, and the row */
622 /* > dimension of C, F, R and L. */
628 /* > On entry, N specifies the order of B and E, and the column */
629 /* > dimension of C, F, R and L. */
634 /* > A is COMPLEX array, dimension (LDA, M) */
635 /* > On entry, A contains an upper triangular matrix. */
638 /* > \param[in] LDA */
640 /* > LDA is INTEGER */
641 /* > The leading dimension of the matrix A. LDA >= f2cmax(1, M). */
646 /* > B is COMPLEX array, dimension (LDB, N) */
647 /* > On entry, B contains an upper triangular matrix. */
650 /* > \param[in] LDB */
652 /* > LDB is INTEGER */
653 /* > The leading dimension of the matrix B. LDB >= f2cmax(1, N). */
656 /* > \param[in,out] C */
658 /* > C is COMPLEX array, dimension (LDC, N) */
659 /* > On entry, C contains the right-hand-side of the first matrix */
660 /* > equation in (1). */
661 /* > On exit, if IJOB = 0, C has been overwritten by the solution */
665 /* > \param[in] LDC */
667 /* > LDC is INTEGER */
668 /* > The leading dimension of the matrix C. LDC >= f2cmax(1, M). */
673 /* > D is COMPLEX array, dimension (LDD, M) */
674 /* > On entry, D contains an upper triangular matrix. */
677 /* > \param[in] LDD */
679 /* > LDD is INTEGER */
680 /* > The leading dimension of the matrix D. LDD >= f2cmax(1, M). */
685 /* > E is COMPLEX array, dimension (LDE, N) */
686 /* > On entry, E contains an upper triangular matrix. */
689 /* > \param[in] LDE */
691 /* > LDE is INTEGER */
692 /* > The leading dimension of the matrix E. LDE >= f2cmax(1, N). */
695 /* > \param[in,out] F */
697 /* > F is COMPLEX array, dimension (LDF, N) */
698 /* > On entry, F contains the right-hand-side of the second matrix */
699 /* > equation in (1). */
700 /* > On exit, if IJOB = 0, F has been overwritten by the solution */
704 /* > \param[in] LDF */
706 /* > LDF is INTEGER */
707 /* > The leading dimension of the matrix F. LDF >= f2cmax(1, M). */
710 /* > \param[out] SCALE */
712 /* > SCALE is REAL */
713 /* > On exit, 0 <= SCALE <= 1. If 0 < SCALE < 1, the solutions */
714 /* > R and L (C and F on entry) will hold the solutions to a */
715 /* > slightly perturbed system but the input matrices A, B, D and */
716 /* > E have not been changed. If SCALE = 0, R and L will hold the */
717 /* > solutions to the homogeneous system with C = F = 0. */
718 /* > Normally, SCALE = 1. */
721 /* > \param[in,out] RDSUM */
723 /* > RDSUM is REAL */
724 /* > On entry, the sum of squares of computed contributions to */
725 /* > the Dif-estimate under computation by CTGSYL, where the */
726 /* > scaling factor RDSCAL (see below) has been factored out. */
727 /* > On exit, the corresponding sum of squares updated with the */
728 /* > contributions from the current sub-system. */
729 /* > If TRANS = 'T' RDSUM is not touched. */
730 /* > NOTE: RDSUM only makes sense when CTGSY2 is called by */
734 /* > \param[in,out] RDSCAL */
736 /* > RDSCAL is REAL */
737 /* > On entry, scaling factor used to prevent overflow in RDSUM. */
738 /* > On exit, RDSCAL is updated w.r.t. the current contributions */
740 /* > If TRANS = 'T', RDSCAL is not touched. */
741 /* > NOTE: RDSCAL only makes sense when CTGSY2 is called by */
745 /* > \param[out] INFO */
747 /* > INFO is INTEGER */
748 /* > On exit, if INFO is set to */
749 /* > =0: Successful exit */
750 /* > <0: If INFO = -i, input argument number i is illegal. */
751 /* > >0: The matrix pairs (A, D) and (B, E) have common or very */
752 /* > close eigenvalues. */
758 /* > \author Univ. of Tennessee */
759 /* > \author Univ. of California Berkeley */
760 /* > \author Univ. of Colorado Denver */
761 /* > \author NAG Ltd. */
763 /* > \date December 2016 */
765 /* > \ingroup complexSYauxiliary */
767 /* > \par Contributors: */
768 /* ================== */
770 /* > Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
771 /* > Umea University, S-901 87 Umea, Sweden. */
773 /* ===================================================================== */
774 /* Subroutine */ int ctgsy2_(char *trans, integer *ijob, integer *m, integer *
775 n, complex *a, integer *lda, complex *b, integer *ldb, complex *c__,
776 integer *ldc, complex *d__, integer *ldd, complex *e, integer *lde,
777 complex *f, integer *ldf, real *scale, real *rdsum, real *rdscal,
780 /* System generated locals */
781 integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, d_dim1,
782 d_offset, e_dim1, e_offset, f_dim1, f_offset, i__1, i__2, i__3,
784 complex q__1, q__2, q__3, q__4, q__5, q__6;
786 /* Local variables */
787 integer ierr, ipiv[2], jpiv[2], i__, j, k;
789 extern /* Subroutine */ int cscal_(integer *, complex *, complex *,
791 complex z__[4] /* was [2][2] */;
792 extern logical lsame_(char *, char *);
793 extern /* Subroutine */ int caxpy_(integer *, complex *, complex *,
794 integer *, complex *, integer *), cgesc2_(integer *, complex *,
795 integer *, complex *, integer *, integer *, real *), cgetc2_(
796 integer *, complex *, integer *, integer *, integer *, integer *),
797 clatdf_(integer *, integer *, complex *, integer *, complex *,
798 real *, real *, integer *, integer *);
800 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
805 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
806 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
807 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
811 /* ===================================================================== */
814 /* Decode and test input parameters */
816 /* Parameter adjustments */
818 a_offset = 1 + a_dim1 * 1;
821 b_offset = 1 + b_dim1 * 1;
824 c_offset = 1 + c_dim1 * 1;
827 d_offset = 1 + d_dim1 * 1;
830 e_offset = 1 + e_dim1 * 1;
833 f_offset = 1 + f_dim1 * 1;
839 notran = lsame_(trans, "N");
840 if (! notran && ! lsame_(trans, "C")) {
843 if (*ijob < 0 || *ijob > 2) {
850 } else if (*n <= 0) {
852 } else if (*lda < f2cmax(1,*m)) {
854 } else if (*ldb < f2cmax(1,*n)) {
856 } else if (*ldc < f2cmax(1,*m)) {
858 } else if (*ldd < f2cmax(1,*m)) {
860 } else if (*lde < f2cmax(1,*n)) {
862 } else if (*ldf < f2cmax(1,*m)) {
868 xerbla_("CTGSY2", &i__1, (ftnlen)6);
874 /* Solve (I, J) - system */
875 /* A(I, I) * R(I, J) - L(I, J) * B(J, J) = C(I, J) */
876 /* D(I, I) * R(I, J) - L(I, J) * E(J, J) = F(I, J) */
877 /* for I = M, M - 1, ..., 1; J = 1, 2, ..., N */
882 for (j = 1; j <= i__1; ++j) {
883 for (i__ = *m; i__ >= 1; --i__) {
885 /* Build 2 by 2 system */
887 i__2 = i__ + i__ * a_dim1;
888 z__[0].r = a[i__2].r, z__[0].i = a[i__2].i;
889 i__2 = i__ + i__ * d_dim1;
890 z__[1].r = d__[i__2].r, z__[1].i = d__[i__2].i;
891 i__2 = j + j * b_dim1;
892 q__1.r = -b[i__2].r, q__1.i = -b[i__2].i;
893 z__[2].r = q__1.r, z__[2].i = q__1.i;
894 i__2 = j + j * e_dim1;
895 q__1.r = -e[i__2].r, q__1.i = -e[i__2].i;
896 z__[3].r = q__1.r, z__[3].i = q__1.i;
898 /* Set up right hand side(s) */
900 i__2 = i__ + j * c_dim1;
901 rhs[0].r = c__[i__2].r, rhs[0].i = c__[i__2].i;
902 i__2 = i__ + j * f_dim1;
903 rhs[1].r = f[i__2].r, rhs[1].i = f[i__2].i;
905 /* Solve Z * x = RHS */
907 cgetc2_(&c__2, z__, &c__2, ipiv, jpiv, &ierr);
912 cgesc2_(&c__2, z__, &c__2, rhs, ipiv, jpiv, &scaloc);
915 for (k = 1; k <= i__2; ++k) {
916 q__1.r = scaloc, q__1.i = 0.f;
917 cscal_(m, &q__1, &c__[k * c_dim1 + 1], &c__1);
918 q__1.r = scaloc, q__1.i = 0.f;
919 cscal_(m, &q__1, &f[k * f_dim1 + 1], &c__1);
925 clatdf_(ijob, &c__2, z__, &c__2, rhs, rdsum, rdscal, ipiv,
929 /* Unpack solution vector(s) */
931 i__2 = i__ + j * c_dim1;
932 c__[i__2].r = rhs[0].r, c__[i__2].i = rhs[0].i;
933 i__2 = i__ + j * f_dim1;
934 f[i__2].r = rhs[1].r, f[i__2].i = rhs[1].i;
936 /* Substitute R(I, J) and L(I, J) into remaining equation. */
939 q__1.r = -rhs[0].r, q__1.i = -rhs[0].i;
940 alpha.r = q__1.r, alpha.i = q__1.i;
942 caxpy_(&i__2, &alpha, &a[i__ * a_dim1 + 1], &c__1, &c__[j
943 * c_dim1 + 1], &c__1);
945 caxpy_(&i__2, &alpha, &d__[i__ * d_dim1 + 1], &c__1, &f[j
946 * f_dim1 + 1], &c__1);
950 caxpy_(&i__2, &rhs[1], &b[j + (j + 1) * b_dim1], ldb, &
951 c__[i__ + (j + 1) * c_dim1], ldc);
953 caxpy_(&i__2, &rhs[1], &e[j + (j + 1) * e_dim1], lde, &f[
954 i__ + (j + 1) * f_dim1], ldf);
963 /* Solve transposed (I, J) - system: */
964 /* A(I, I)**H * R(I, J) + D(I, I)**H * L(J, J) = C(I, J) */
965 /* R(I, I) * B(J, J) + L(I, J) * E(J, J) = -F(I, J) */
966 /* for I = 1, 2, ..., M, J = N, N - 1, ..., 1 */
971 for (i__ = 1; i__ <= i__1; ++i__) {
972 for (j = *n; j >= 1; --j) {
974 /* Build 2 by 2 system Z**H */
976 r_cnjg(&q__1, &a[i__ + i__ * a_dim1]);
977 z__[0].r = q__1.r, z__[0].i = q__1.i;
978 r_cnjg(&q__2, &b[j + j * b_dim1]);
979 q__1.r = -q__2.r, q__1.i = -q__2.i;
980 z__[1].r = q__1.r, z__[1].i = q__1.i;
981 r_cnjg(&q__1, &d__[i__ + i__ * d_dim1]);
982 z__[2].r = q__1.r, z__[2].i = q__1.i;
983 r_cnjg(&q__2, &e[j + j * e_dim1]);
984 q__1.r = -q__2.r, q__1.i = -q__2.i;
985 z__[3].r = q__1.r, z__[3].i = q__1.i;
988 /* Set up right hand side(s) */
990 i__2 = i__ + j * c_dim1;
991 rhs[0].r = c__[i__2].r, rhs[0].i = c__[i__2].i;
992 i__2 = i__ + j * f_dim1;
993 rhs[1].r = f[i__2].r, rhs[1].i = f[i__2].i;
995 /* Solve Z**H * x = RHS */
997 cgetc2_(&c__2, z__, &c__2, ipiv, jpiv, &ierr);
1001 cgesc2_(&c__2, z__, &c__2, rhs, ipiv, jpiv, &scaloc);
1002 if (scaloc != 1.f) {
1004 for (k = 1; k <= i__2; ++k) {
1005 q__1.r = scaloc, q__1.i = 0.f;
1006 cscal_(m, &q__1, &c__[k * c_dim1 + 1], &c__1);
1007 q__1.r = scaloc, q__1.i = 0.f;
1008 cscal_(m, &q__1, &f[k * f_dim1 + 1], &c__1);
1014 /* Unpack solution vector(s) */
1016 i__2 = i__ + j * c_dim1;
1017 c__[i__2].r = rhs[0].r, c__[i__2].i = rhs[0].i;
1018 i__2 = i__ + j * f_dim1;
1019 f[i__2].r = rhs[1].r, f[i__2].i = rhs[1].i;
1021 /* Substitute R(I, J) and L(I, J) into remaining equation. */
1024 for (k = 1; k <= i__2; ++k) {
1025 i__3 = i__ + k * f_dim1;
1026 i__4 = i__ + k * f_dim1;
1027 r_cnjg(&q__4, &b[k + j * b_dim1]);
1028 q__3.r = rhs[0].r * q__4.r - rhs[0].i * q__4.i, q__3.i =
1029 rhs[0].r * q__4.i + rhs[0].i * q__4.r;
1030 q__2.r = f[i__4].r + q__3.r, q__2.i = f[i__4].i + q__3.i;
1031 r_cnjg(&q__6, &e[k + j * e_dim1]);
1032 q__5.r = rhs[1].r * q__6.r - rhs[1].i * q__6.i, q__5.i =
1033 rhs[1].r * q__6.i + rhs[1].i * q__6.r;
1034 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
1035 f[i__3].r = q__1.r, f[i__3].i = q__1.i;
1039 for (k = i__ + 1; k <= i__2; ++k) {
1040 i__3 = k + j * c_dim1;
1041 i__4 = k + j * c_dim1;
1042 r_cnjg(&q__4, &a[i__ + k * a_dim1]);
1043 q__3.r = q__4.r * rhs[0].r - q__4.i * rhs[0].i, q__3.i =
1044 q__4.r * rhs[0].i + q__4.i * rhs[0].r;
1045 q__2.r = c__[i__4].r - q__3.r, q__2.i = c__[i__4].i -
1047 r_cnjg(&q__6, &d__[i__ + k * d_dim1]);
1048 q__5.r = q__6.r * rhs[1].r - q__6.i * rhs[1].i, q__5.i =
1049 q__6.r * rhs[1].i + q__6.i * rhs[1].r;
1050 q__1.r = q__2.r - q__5.r, q__1.i = q__2.i - q__5.i;
1051 c__[i__3].r = q__1.r, c__[i__3].i = q__1.i;