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)
513 /* Table of constant values */
515 static doublecomplex c_b1 = {1.,0.};
517 /* > \brief \b ZUNM22 multiplies a general matrix by a banded unitary matrix. */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download ZUNM22 + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zunm22.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zunm22.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zunm22.
540 /* SUBROUTINE ZUNM22( SIDE, TRANS, M, N, N1, N2, Q, LDQ, C, LDC, */
541 /* $ WORK, LWORK, INFO ) */
543 /* CHARACTER SIDE, TRANS */
544 /* INTEGER M, N, N1, N2, LDQ, LDC, LWORK, INFO */
545 /* COMPLEX*16 Q( LDQ, * ), C( LDC, * ), WORK( * ) */
552 /* > ZUNM22 overwrites the general complex M-by-N matrix C with */
554 /* > SIDE = 'L' SIDE = 'R' */
555 /* > TRANS = 'N': Q * C C * Q */
556 /* > TRANS = 'C': Q**H * C C * Q**H */
558 /* > where Q is a complex unitary matrix of order NQ, with NQ = M if */
559 /* > SIDE = 'L' and NQ = N if SIDE = 'R'. */
560 /* > The unitary matrix Q processes a 2-by-2 block structure */
566 /* > where Q12 is an N1-by-N1 lower triangular matrix and Q21 is an */
567 /* > N2-by-N2 upper triangular matrix. */
573 /* > \param[in] SIDE */
575 /* > SIDE is CHARACTER*1 */
576 /* > = 'L': apply Q or Q**H from the Left; */
577 /* > = 'R': apply Q or Q**H from the Right. */
580 /* > \param[in] TRANS */
582 /* > TRANS is CHARACTER*1 */
583 /* > = 'N': apply Q (No transpose); */
584 /* > = 'C': apply Q**H (Conjugate transpose). */
590 /* > The number of rows of the matrix C. M >= 0. */
596 /* > The number of columns of the matrix C. N >= 0. */
599 /* > \param[in] N1 */
600 /* > \param[in] N2 */
602 /* > N1 is INTEGER */
603 /* > N2 is INTEGER */
604 /* > The dimension of Q12 and Q21, respectively. N1, N2 >= 0. */
605 /* > The following requirement must be satisfied: */
606 /* > N1 + N2 = M if SIDE = 'L' and N1 + N2 = N if SIDE = 'R'. */
611 /* > Q is COMPLEX*16 array, dimension */
612 /* > (LDQ,M) if SIDE = 'L' */
613 /* > (LDQ,N) if SIDE = 'R' */
616 /* > \param[in] LDQ */
618 /* > LDQ is INTEGER */
619 /* > The leading dimension of the array Q. */
620 /* > LDQ >= f2cmax(1,M) if SIDE = 'L'; LDQ >= f2cmax(1,N) if SIDE = 'R'. */
623 /* > \param[in,out] C */
625 /* > C is COMPLEX*16 array, dimension (LDC,N) */
626 /* > On entry, the M-by-N matrix C. */
627 /* > On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q. */
630 /* > \param[in] LDC */
632 /* > LDC is INTEGER */
633 /* > The leading dimension of the array C. LDC >= f2cmax(1,M). */
636 /* > \param[out] WORK */
638 /* > WORK is COMPLEX*16 array, dimension (MAX(1,LWORK)) */
639 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
642 /* > \param[in] LWORK */
644 /* > LWORK is INTEGER */
645 /* > The dimension of the array WORK. */
646 /* > If SIDE = 'L', LWORK >= f2cmax(1,N); */
647 /* > if SIDE = 'R', LWORK >= f2cmax(1,M). */
648 /* > For optimum performance LWORK >= M*N. */
650 /* > If LWORK = -1, then a workspace query is assumed; the routine */
651 /* > only calculates the optimal size of the WORK array, returns */
652 /* > this value as the first entry of the WORK array, and no error */
653 /* > message related to LWORK is issued by XERBLA. */
656 /* > \param[out] INFO */
658 /* > INFO is INTEGER */
659 /* > = 0: successful exit */
660 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
667 /* > \author Univ. of Tennessee */
668 /* > \author Univ. of California Berkeley */
669 /* > \author Univ. of Colorado Denver */
670 /* > \author NAG Ltd. */
672 /* > \date January 2015 */
674 /* > \ingroup complexOTHERcomputational */
676 /* ===================================================================== */
677 /* Subroutine */ int zunm22_(char *side, char *trans, integer *m, integer *n,
678 integer *n1, integer *n2, doublecomplex *q, integer *ldq,
679 doublecomplex *c__, integer *ldc, doublecomplex *work, integer *lwork,
682 /* System generated locals */
683 integer q_dim1, q_offset, c_dim1, c_offset, i__1, i__2, i__3, i__4;
686 /* Local variables */
689 extern logical lsame_(char *, char *);
690 extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
691 integer *, doublecomplex *, doublecomplex *, integer *,
692 doublecomplex *, integer *, doublecomplex *, doublecomplex *,
693 integer *), ztrmm_(char *, char *, char *, char *,
694 integer *, integer *, doublecomplex *, doublecomplex *, integer *
695 , doublecomplex *, integer *);
697 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
700 extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
701 doublecomplex *, integer *, doublecomplex *, integer *);
707 /* -- LAPACK computational routine (version 3.7.1) -- */
708 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
709 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
714 /* ===================================================================== */
718 /* Test the input arguments */
720 /* Parameter adjustments */
722 q_offset = 1 + q_dim1 * 1;
725 c_offset = 1 + c_dim1 * 1;
731 left = lsame_(side, "L");
732 notran = lsame_(trans, "N");
733 lquery = *lwork == -1;
735 /* NQ is the order of Q; */
736 /* NW is the minimum dimension of WORK. */
744 if (*n1 == 0 || *n2 == 0) {
747 if (! left && ! lsame_(side, "R")) {
749 } else if (! lsame_(trans, "N") && ! lsame_(trans,
756 } else if (*n1 < 0 || *n1 + *n2 != nq) {
758 } else if (*n2 < 0) {
760 } else if (*ldq < f2cmax(1,nq)) {
762 } else if (*ldc < f2cmax(1,*m)) {
764 } else if (*lwork < nw && ! lquery) {
770 z__1.r = (doublereal) lwkopt, z__1.i = 0.;
771 work[1].r = z__1.r, work[1].i = z__1.i;
776 xerbla_("ZUNM22", &i__1, (ftnlen)6);
782 /* Quick return if possible */
784 if (*m == 0 || *n == 0) {
785 work[1].r = 1., work[1].i = 0.;
789 /* Degenerate cases (N1 = 0 or N2 = 0) are handled using ZTRMM. */
792 ztrmm_(side, "Upper", trans, "Non-Unit", m, n, &c_b1, &q[q_offset],
793 ldq, &c__[c_offset], ldc);
794 work[1].r = 1., work[1].i = 0.;
796 } else if (*n2 == 0) {
797 ztrmm_(side, "Lower", trans, "Non-Unit", m, n, &c_b1, &q[q_offset],
798 ldq, &c__[c_offset], ldc);
799 work[1].r = 1., work[1].i = 0.;
803 /* Compute the largest chunk size available from the workspace. */
806 i__1 = 1, i__2 = f2cmin(*lwork,lwkopt) / nq;
807 nb = f2cmax(i__1,i__2);
813 for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
815 i__3 = nb, i__4 = *n - i__ + 1;
816 len = f2cmin(i__3,i__4);
819 /* Multiply bottom part of C by Q12. */
821 zlacpy_("All", n1, &len, &c__[*n2 + 1 + i__ * c_dim1], ldc, &
823 ztrmm_("Left", "Lower", "No Transpose", "Non-Unit", n1, &len,
824 &c_b1, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[1], &
827 /* Multiply top part of C by Q11. */
829 zgemm_("No Transpose", "No Transpose", n1, &len, n2, &c_b1, &
830 q[q_offset], ldq, &c__[i__ * c_dim1 + 1], ldc, &c_b1,
833 /* Multiply top part of C by Q21. */
835 zlacpy_("All", n2, &len, &c__[i__ * c_dim1 + 1], ldc, &work[*
837 ztrmm_("Left", "Upper", "No Transpose", "Non-Unit", n2, &len,
838 &c_b1, &q[*n1 + 1 + q_dim1], ldq, &work[*n1 + 1], &
841 /* Multiply bottom part of C by Q22. */
843 zgemm_("No Transpose", "No Transpose", n2, &len, n1, &c_b1, &
844 q[*n1 + 1 + (*n2 + 1) * q_dim1], ldq, &c__[*n2 + 1 +
845 i__ * c_dim1], ldc, &c_b1, &work[*n1 + 1], &ldwork);
847 /* Copy everything back. */
849 zlacpy_("All", m, &len, &work[1], &ldwork, &c__[i__ * c_dim1
855 for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
857 i__3 = nb, i__4 = *n - i__ + 1;
858 len = f2cmin(i__3,i__4);
861 /* Multiply bottom part of C by Q21**H. */
863 zlacpy_("All", n2, &len, &c__[*n1 + 1 + i__ * c_dim1], ldc, &
865 ztrmm_("Left", "Upper", "Conjugate", "Non-Unit", n2, &len, &
866 c_b1, &q[*n1 + 1 + q_dim1], ldq, &work[1], &ldwork);
868 /* Multiply top part of C by Q11**H. */
870 zgemm_("Conjugate", "No Transpose", n2, &len, n1, &c_b1, &q[
871 q_offset], ldq, &c__[i__ * c_dim1 + 1], ldc, &c_b1, &
874 /* Multiply top part of C by Q12**H. */
876 zlacpy_("All", n1, &len, &c__[i__ * c_dim1 + 1], ldc, &work[*
878 ztrmm_("Left", "Lower", "Conjugate", "Non-Unit", n1, &len, &
879 c_b1, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[*n2 + 1],
882 /* Multiply bottom part of C by Q22**H. */
884 zgemm_("Conjugate", "No Transpose", n1, &len, n2, &c_b1, &q[*
885 n1 + 1 + (*n2 + 1) * q_dim1], ldq, &c__[*n1 + 1 + i__
886 * c_dim1], ldc, &c_b1, &work[*n2 + 1], &ldwork);
888 /* Copy everything back. */
890 zlacpy_("All", m, &len, &work[1], &ldwork, &c__[i__ * c_dim1
898 for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
900 i__3 = nb, i__4 = *m - i__ + 1;
901 len = f2cmin(i__3,i__4);
904 /* Multiply right part of C by Q21. */
906 zlacpy_("All", &len, n2, &c__[i__ + (*n1 + 1) * c_dim1], ldc,
908 ztrmm_("Right", "Upper", "No Transpose", "Non-Unit", &len, n2,
909 &c_b1, &q[*n1 + 1 + q_dim1], ldq, &work[1], &ldwork);
911 /* Multiply left part of C by Q11. */
913 zgemm_("No Transpose", "No Transpose", &len, n2, n1, &c_b1, &
914 c__[i__ + c_dim1], ldc, &q[q_offset], ldq, &c_b1, &
917 /* Multiply left part of C by Q12. */
919 zlacpy_("All", &len, n1, &c__[i__ + c_dim1], ldc, &work[*n2 *
920 ldwork + 1], &ldwork);
921 ztrmm_("Right", "Lower", "No Transpose", "Non-Unit", &len, n1,
922 &c_b1, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[*n2 *
923 ldwork + 1], &ldwork);
925 /* Multiply right part of C by Q22. */
927 zgemm_("No Transpose", "No Transpose", &len, n1, n2, &c_b1, &
928 c__[i__ + (*n1 + 1) * c_dim1], ldc, &q[*n1 + 1 + (*n2
929 + 1) * q_dim1], ldq, &c_b1, &work[*n2 * ldwork + 1], &
932 /* Copy everything back. */
934 zlacpy_("All", &len, n, &work[1], &ldwork, &c__[i__ + c_dim1],
940 for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
942 i__3 = nb, i__4 = *m - i__ + 1;
943 len = f2cmin(i__3,i__4);
946 /* Multiply right part of C by Q12**H. */
948 zlacpy_("All", &len, n1, &c__[i__ + (*n2 + 1) * c_dim1], ldc,
950 ztrmm_("Right", "Lower", "Conjugate", "Non-Unit", &len, n1, &
951 c_b1, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[1], &
954 /* Multiply left part of C by Q11**H. */
956 zgemm_("No Transpose", "Conjugate", &len, n1, n2, &c_b1, &c__[
957 i__ + c_dim1], ldc, &q[q_offset], ldq, &c_b1, &work[1]
960 /* Multiply left part of C by Q21**H. */
962 zlacpy_("All", &len, n2, &c__[i__ + c_dim1], ldc, &work[*n1 *
963 ldwork + 1], &ldwork);
964 ztrmm_("Right", "Upper", "Conjugate", "Non-Unit", &len, n2, &
965 c_b1, &q[*n1 + 1 + q_dim1], ldq, &work[*n1 * ldwork +
968 /* Multiply right part of C by Q22**H. */
970 zgemm_("No Transpose", "Conjugate", &len, n2, n1, &c_b1, &c__[
971 i__ + (*n2 + 1) * c_dim1], ldc, &q[*n1 + 1 + (*n2 + 1)
972 * q_dim1], ldq, &c_b1, &work[*n1 * ldwork + 1], &
975 /* Copy everything back. */
977 zlacpy_("All", &len, n, &work[1], &ldwork, &c__[i__ + c_dim1],
983 z__1.r = (doublereal) lwkopt, z__1.i = 0.;
984 work[1].r = z__1.r, work[1].i = z__1.i;