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 = {0.f,0.f};
516 static complex c_b2 = {1.f,0.f};
517 static integer c__1 = 1;
519 /* > \brief \b CHBTRD */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download CHBTRD + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/chbtrd.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/chbtrd.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/chbtrd.
542 /* SUBROUTINE CHBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ, */
545 /* CHARACTER UPLO, VECT */
546 /* INTEGER INFO, KD, LDAB, LDQ, N */
547 /* REAL D( * ), E( * ) */
548 /* COMPLEX AB( LDAB, * ), Q( LDQ, * ), WORK( * ) */
551 /* > \par Purpose: */
556 /* > CHBTRD reduces a complex Hermitian band matrix A to real symmetric */
557 /* > tridiagonal form T by a unitary similarity transformation: */
558 /* > Q**H * A * Q = T. */
564 /* > \param[in] VECT */
566 /* > VECT is CHARACTER*1 */
567 /* > = 'N': do not form Q; */
568 /* > = 'V': form Q; */
569 /* > = 'U': update a matrix X, by forming X*Q. */
572 /* > \param[in] UPLO */
574 /* > UPLO is CHARACTER*1 */
575 /* > = 'U': Upper triangle of A is stored; */
576 /* > = 'L': Lower triangle of A is stored. */
582 /* > The order of the matrix A. N >= 0. */
585 /* > \param[in] KD */
587 /* > KD is INTEGER */
588 /* > The number of superdiagonals of the matrix A if UPLO = 'U', */
589 /* > or the number of subdiagonals if UPLO = 'L'. KD >= 0. */
592 /* > \param[in,out] AB */
594 /* > AB is COMPLEX array, dimension (LDAB,N) */
595 /* > On entry, the upper or lower triangle of the Hermitian band */
596 /* > matrix A, stored in the first KD+1 rows of the array. The */
597 /* > j-th column of A is stored in the j-th column of the array AB */
599 /* > if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for f2cmax(1,j-kd)<=i<=j; */
600 /* > if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=f2cmin(n,j+kd). */
601 /* > On exit, the diagonal elements of AB are overwritten by the */
602 /* > diagonal elements of the tridiagonal matrix T; if KD > 0, the */
603 /* > elements on the first superdiagonal (if UPLO = 'U') or the */
604 /* > first subdiagonal (if UPLO = 'L') are overwritten by the */
605 /* > off-diagonal elements of T; the rest of AB is overwritten by */
606 /* > values generated during the reduction. */
609 /* > \param[in] LDAB */
611 /* > LDAB is INTEGER */
612 /* > The leading dimension of the array AB. LDAB >= KD+1. */
615 /* > \param[out] D */
617 /* > D is REAL array, dimension (N) */
618 /* > The diagonal elements of the tridiagonal matrix T. */
621 /* > \param[out] E */
623 /* > E is REAL array, dimension (N-1) */
624 /* > The off-diagonal elements of the tridiagonal matrix T: */
625 /* > E(i) = T(i,i+1) if UPLO = 'U'; E(i) = T(i+1,i) if UPLO = 'L'. */
628 /* > \param[in,out] Q */
630 /* > Q is COMPLEX array, dimension (LDQ,N) */
631 /* > On entry, if VECT = 'U', then Q must contain an N-by-N */
632 /* > matrix X; if VECT = 'N' or 'V', then Q need not be set. */
635 /* > if VECT = 'V', Q contains the N-by-N unitary matrix Q; */
636 /* > if VECT = 'U', Q contains the product X*Q; */
637 /* > if VECT = 'N', the array Q is not referenced. */
640 /* > \param[in] LDQ */
642 /* > LDQ is INTEGER */
643 /* > The leading dimension of the array Q. */
644 /* > LDQ >= 1, and LDQ >= N if VECT = 'V' or 'U'. */
647 /* > \param[out] WORK */
649 /* > WORK is COMPLEX array, dimension (N) */
652 /* > \param[out] INFO */
654 /* > INFO is INTEGER */
655 /* > = 0: successful exit */
656 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
662 /* > \author Univ. of Tennessee */
663 /* > \author Univ. of California Berkeley */
664 /* > \author Univ. of Colorado Denver */
665 /* > \author NAG Ltd. */
667 /* > \date December 2016 */
669 /* > \ingroup complexOTHERcomputational */
671 /* > \par Further Details: */
672 /* ===================== */
676 /* > Modified by Linda Kaufman, Bell Labs. */
679 /* ===================================================================== */
680 /* Subroutine */ int chbtrd_(char *vect, char *uplo, integer *n, integer *kd,
681 complex *ab, integer *ldab, real *d__, real *e, complex *q, integer *
682 ldq, complex *work, integer *info)
684 /* System generated locals */
685 integer ab_dim1, ab_offset, q_dim1, q_offset, i__1, i__2, i__3, i__4,
690 /* Local variables */
691 integer inca, jend, lend, jinc;
695 extern /* Subroutine */ int crot_(integer *, complex *, integer *,
696 complex *, integer *, real *, complex *);
697 integer j1end, j1inc, i__, j, k, l;
699 extern /* Subroutine */ int cscal_(integer *, complex *, complex *,
702 extern logical lsame_(char *, char *);
703 logical initq, wantq, upper;
705 extern /* Subroutine */ int clar2v_(integer *, complex *, complex *,
706 complex *, integer *, real *, complex *, integer *);
707 integer nq, nr, iqaend;
708 extern /* Subroutine */ int clacgv_(integer *, complex *, integer *),
709 claset_(char *, integer *, integer *, complex *, complex *,
710 complex *, integer *), clartg_(complex *, complex *, real
711 *, complex *, complex *), xerbla_(char *, integer *, ftnlen),
712 clargv_(integer *, complex *, integer *, complex *, integer *,
713 real *, integer *), clartv_(integer *, complex *, integer *,
714 complex *, integer *, real *, complex *, integer *);
715 integer kd1, ibl, iqb, kdn, jin, nrt, kdm1;
718 /* -- LAPACK computational routine (version 3.7.0) -- */
719 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
720 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
724 /* ===================================================================== */
727 /* Test the input parameters */
729 /* Parameter adjustments */
731 ab_offset = 1 + ab_dim1 * 1;
736 q_offset = 1 + q_dim1 * 1;
741 initq = lsame_(vect, "V");
742 wantq = initq || lsame_(vect, "U");
743 upper = lsame_(uplo, "U");
750 if (! wantq && ! lsame_(vect, "N")) {
752 } else if (! upper && ! lsame_(uplo, "L")) {
756 } else if (*kd < 0) {
758 } else if (*ldab < kd1) {
760 } else if (*ldq < f2cmax(1,*n) && wantq) {
765 xerbla_("CHBTRD", &i__1, (ftnlen)6);
769 /* Quick return if possible */
775 /* Initialize Q to the unit matrix, if needed */
778 claset_("Full", n, n, &c_b1, &c_b2, &q[q_offset], ldq);
781 /* Wherever possible, plane rotations are generated and applied in */
782 /* vector operations of length NR over the index set J1:J2:KD1. */
784 /* The real cosines and complex sines of the plane rotations are */
785 /* stored in the arrays D and WORK. */
790 kdn = f2cmin(i__1,*kd);
795 /* Reduce to complex Hermitian tridiagonal form, working with */
796 /* the upper triangle */
802 i__1 = kd1 + ab_dim1;
803 i__2 = kd1 + ab_dim1;
805 ab[i__1].r = r__1, ab[i__1].i = 0.f;
807 for (i__ = 1; i__ <= i__1; ++i__) {
809 /* Reduce i-th row of matrix to tridiagonal form */
811 for (k = kdn + 1; k >= 2; --k) {
817 /* generate plane rotations to annihilate nonzero */
818 /* elements which have been created outside the band */
820 clargv_(&nr, &ab[(j1 - 1) * ab_dim1 + 1], &inca, &
821 work[j1], &kd1, &d__[j1], &kd1);
823 /* apply rotations from the right */
826 /* Dependent on the the number of diagonals either */
827 /* CLARTV or CROT is used */
829 if (nr >= (*kd << 1) - 1) {
831 for (l = 1; l <= i__2; ++l) {
832 clartv_(&nr, &ab[l + 1 + (j1 - 1) * ab_dim1],
833 &inca, &ab[l + j1 * ab_dim1], &inca, &
834 d__[j1], &work[j1], &kd1);
839 jend = j1 + (nr - 1) * kd1;
842 for (jinc = j1; i__3 < 0 ? jinc >= i__2 : jinc <=
843 i__2; jinc += i__3) {
844 crot_(&kdm1, &ab[(jinc - 1) * ab_dim1 + 2], &
845 c__1, &ab[jinc * ab_dim1 + 1], &c__1,
846 &d__[jinc], &work[jinc]);
854 if (k <= *n - i__ + 1) {
856 /* generate plane rotation to annihilate a(i,i+k-1) */
857 /* within the band */
859 clartg_(&ab[*kd - k + 3 + (i__ + k - 2) * ab_dim1]
860 , &ab[*kd - k + 2 + (i__ + k - 1) *
861 ab_dim1], &d__[i__ + k - 1], &work[i__ +
863 i__3 = *kd - k + 3 + (i__ + k - 2) * ab_dim1;
864 ab[i__3].r = temp.r, ab[i__3].i = temp.i;
866 /* apply rotation from the right */
869 crot_(&i__3, &ab[*kd - k + 4 + (i__ + k - 2) *
870 ab_dim1], &c__1, &ab[*kd - k + 3 + (i__ +
871 k - 1) * ab_dim1], &c__1, &d__[i__ + k -
872 1], &work[i__ + k - 1]);
878 /* apply plane rotations from both sides to diagonal */
882 clar2v_(&nr, &ab[kd1 + (j1 - 1) * ab_dim1], &ab[kd1 +
883 j1 * ab_dim1], &ab[*kd + j1 * ab_dim1], &inca,
884 &d__[j1], &work[j1], &kd1);
887 /* apply plane rotations from the left */
890 clacgv_(&nr, &work[j1], &kd1);
891 if ((*kd << 1) - 1 < nr) {
893 /* Dependent on the the number of diagonals either */
894 /* CLARTV or CROT is used */
897 for (l = 1; l <= i__3; ++l) {
904 clartv_(&nrt, &ab[*kd - l + (j1 + l) *
905 ab_dim1], &inca, &ab[*kd - l + 1
906 + (j1 + l) * ab_dim1], &inca, &
907 d__[j1], &work[j1], &kd1);
912 j1end = j1 + kd1 * (nr - 2);
916 for (jin = j1; i__2 < 0 ? jin >= i__3 : jin <=
919 crot_(&i__4, &ab[*kd - 1 + (jin + 1) *
920 ab_dim1], &incx, &ab[*kd + (jin +
921 1) * ab_dim1], &incx, &d__[jin], &
927 i__2 = kdm1, i__3 = *n - j2;
928 lend = f2cmin(i__2,i__3);
931 crot_(&lend, &ab[*kd - 1 + (last + 1) *
932 ab_dim1], &incx, &ab[*kd + (last + 1)
933 * ab_dim1], &incx, &d__[last], &work[
941 /* accumulate product of plane rotations in Q */
945 /* take advantage of the fact that Q was */
946 /* initially the Identity matrix */
948 iqend = f2cmax(iqend,j2);
950 i__2 = 0, i__3 = k - 3;
951 i2 = f2cmax(i__2,i__3);
952 iqaend = i__ * *kd + 1;
956 iqaend = f2cmin(iqaend,iqend);
959 for (j = j1; i__3 < 0 ? j >= i__2 : j <= i__2; j
961 ibl = i__ - i2 / kdm1;
964 i__4 = 1, i__5 = j - ibl;
965 iqb = f2cmax(i__4,i__5);
966 nq = iqaend + 1 - iqb;
969 iqaend = f2cmin(i__4,iqend);
970 r_cnjg(&q__1, &work[j]);
971 crot_(&nq, &q[iqb + (j - 1) * q_dim1], &c__1,
972 &q[iqb + j * q_dim1], &c__1, &d__[j],
980 for (j = j1; i__2 < 0 ? j >= i__3 : j <= i__3; j
982 r_cnjg(&q__1, &work[j]);
983 crot_(n, &q[(j - 1) * q_dim1 + 1], &c__1, &q[
984 j * q_dim1 + 1], &c__1, &d__[j], &
994 /* adjust J2 to keep within the bounds of the matrix */
1002 for (j = j1; i__3 < 0 ? j >= i__2 : j <= i__2; j += i__3)
1005 /* create nonzero element a(j-1,j+kd) outside the band */
1006 /* and store it in WORK */
1010 i__6 = (j + *kd) * ab_dim1 + 1;
1011 q__1.r = work[i__5].r * ab[i__6].r - work[i__5].i *
1012 ab[i__6].i, q__1.i = work[i__5].r * ab[i__6]
1013 .i + work[i__5].i * ab[i__6].r;
1014 work[i__4].r = q__1.r, work[i__4].i = q__1.i;
1015 i__4 = (j + *kd) * ab_dim1 + 1;
1017 i__6 = (j + *kd) * ab_dim1 + 1;
1018 q__1.r = d__[i__5] * ab[i__6].r, q__1.i = d__[i__5] *
1020 ab[i__4].r = q__1.r, ab[i__4].i = q__1.i;
1031 /* make off-diagonal elements real and copy them to E */
1034 for (i__ = 1; i__ <= i__1; ++i__) {
1035 i__3 = *kd + (i__ + 1) * ab_dim1;
1036 t.r = ab[i__3].r, t.i = ab[i__3].i;
1038 i__3 = *kd + (i__ + 1) * ab_dim1;
1039 ab[i__3].r = abst, ab[i__3].i = 0.f;
1042 q__1.r = t.r / abst, q__1.i = t.i / abst;
1043 t.r = q__1.r, t.i = q__1.i;
1045 t.r = 1.f, t.i = 0.f;
1048 i__3 = *kd + (i__ + 2) * ab_dim1;
1049 i__2 = *kd + (i__ + 2) * ab_dim1;
1050 q__1.r = ab[i__2].r * t.r - ab[i__2].i * t.i, q__1.i = ab[
1051 i__2].r * t.i + ab[i__2].i * t.r;
1052 ab[i__3].r = q__1.r, ab[i__3].i = q__1.i;
1056 cscal_(n, &q__1, &q[(i__ + 1) * q_dim1 + 1], &c__1);
1062 /* set E to zero if original matrix was diagonal */
1065 for (i__ = 1; i__ <= i__1; ++i__) {
1071 /* copy diagonal elements to D */
1074 for (i__ = 1; i__ <= i__1; ++i__) {
1076 i__2 = kd1 + i__ * ab_dim1;
1077 d__[i__3] = ab[i__2].r;
1085 /* Reduce to complex Hermitian tridiagonal form, working with */
1086 /* the lower triangle */
1095 ab[i__1].r = r__1, ab[i__1].i = 0.f;
1097 for (i__ = 1; i__ <= i__1; ++i__) {
1099 /* Reduce i-th column of matrix to tridiagonal form */
1101 for (k = kdn + 1; k >= 2; --k) {
1107 /* generate plane rotations to annihilate nonzero */
1108 /* elements which have been created outside the band */
1110 clargv_(&nr, &ab[kd1 + (j1 - kd1) * ab_dim1], &inca, &
1111 work[j1], &kd1, &d__[j1], &kd1);
1113 /* apply plane rotations from one side */
1116 /* Dependent on the the number of diagonals either */
1117 /* CLARTV or CROT is used */
1119 if (nr > (*kd << 1) - 1) {
1121 for (l = 1; l <= i__3; ++l) {
1122 clartv_(&nr, &ab[kd1 - l + (j1 - kd1 + l) *
1123 ab_dim1], &inca, &ab[kd1 - l + 1 + (
1124 j1 - kd1 + l) * ab_dim1], &inca, &d__[
1125 j1], &work[j1], &kd1);
1129 jend = j1 + kd1 * (nr - 1);
1132 for (jinc = j1; i__2 < 0 ? jinc >= i__3 : jinc <=
1133 i__3; jinc += i__2) {
1134 crot_(&kdm1, &ab[*kd + (jinc - *kd) * ab_dim1]
1135 , &incx, &ab[kd1 + (jinc - *kd) *
1136 ab_dim1], &incx, &d__[jinc], &work[
1145 if (k <= *n - i__ + 1) {
1147 /* generate plane rotation to annihilate a(i+k-1,i) */
1148 /* within the band */
1150 clartg_(&ab[k - 1 + i__ * ab_dim1], &ab[k + i__ *
1151 ab_dim1], &d__[i__ + k - 1], &work[i__ +
1153 i__2 = k - 1 + i__ * ab_dim1;
1154 ab[i__2].r = temp.r, ab[i__2].i = temp.i;
1156 /* apply rotation from the left */
1161 crot_(&i__2, &ab[k - 2 + (i__ + 1) * ab_dim1], &
1162 i__3, &ab[k - 1 + (i__ + 1) * ab_dim1], &
1163 i__4, &d__[i__ + k - 1], &work[i__ + k -
1170 /* apply plane rotations from both sides to diagonal */
1174 clar2v_(&nr, &ab[(j1 - 1) * ab_dim1 + 1], &ab[j1 *
1175 ab_dim1 + 1], &ab[(j1 - 1) * ab_dim1 + 2], &
1176 inca, &d__[j1], &work[j1], &kd1);
1179 /* apply plane rotations from the right */
1182 /* Dependent on the the number of diagonals either */
1183 /* CLARTV or CROT is used */
1186 clacgv_(&nr, &work[j1], &kd1);
1187 if (nr > (*kd << 1) - 1) {
1189 for (l = 1; l <= i__2; ++l) {
1196 clartv_(&nrt, &ab[l + 2 + (j1 - 1) *
1197 ab_dim1], &inca, &ab[l + 1 + j1 *
1198 ab_dim1], &inca, &d__[j1], &work[
1204 j1end = j1 + kd1 * (nr - 2);
1208 for (j1inc = j1; i__3 < 0 ? j1inc >= i__2 :
1209 j1inc <= i__2; j1inc += i__3) {
1210 crot_(&kdm1, &ab[(j1inc - 1) * ab_dim1 +
1211 3], &c__1, &ab[j1inc * ab_dim1 +
1212 2], &c__1, &d__[j1inc], &work[
1218 i__3 = kdm1, i__2 = *n - j2;
1219 lend = f2cmin(i__3,i__2);
1222 crot_(&lend, &ab[(last - 1) * ab_dim1 + 3], &
1223 c__1, &ab[last * ab_dim1 + 2], &c__1,
1224 &d__[last], &work[last]);
1233 /* accumulate product of plane rotations in Q */
1237 /* take advantage of the fact that Q was */
1238 /* initially the Identity matrix */
1240 iqend = f2cmax(iqend,j2);
1242 i__3 = 0, i__2 = k - 3;
1243 i2 = f2cmax(i__3,i__2);
1244 iqaend = i__ * *kd + 1;
1248 iqaend = f2cmin(iqaend,iqend);
1251 for (j = j1; i__2 < 0 ? j >= i__3 : j <= i__3; j
1253 ibl = i__ - i2 / kdm1;
1256 i__4 = 1, i__5 = j - ibl;
1257 iqb = f2cmax(i__4,i__5);
1258 nq = iqaend + 1 - iqb;
1260 i__4 = iqaend + *kd;
1261 iqaend = f2cmin(i__4,iqend);
1262 crot_(&nq, &q[iqb + (j - 1) * q_dim1], &c__1,
1263 &q[iqb + j * q_dim1], &c__1, &d__[j],
1271 for (j = j1; i__3 < 0 ? j >= i__2 : j <= i__2; j
1273 crot_(n, &q[(j - 1) * q_dim1 + 1], &c__1, &q[
1274 j * q_dim1 + 1], &c__1, &d__[j], &
1281 if (j2 + kdn > *n) {
1283 /* adjust J2 to keep within the bounds of the matrix */
1291 for (j = j1; i__2 < 0 ? j >= i__3 : j <= i__3; j += i__2)
1294 /* create nonzero element a(j+kd,j-1) outside the */
1295 /* band and store it in WORK */
1299 i__6 = kd1 + j * ab_dim1;
1300 q__1.r = work[i__5].r * ab[i__6].r - work[i__5].i *
1301 ab[i__6].i, q__1.i = work[i__5].r * ab[i__6]
1302 .i + work[i__5].i * ab[i__6].r;
1303 work[i__4].r = q__1.r, work[i__4].i = q__1.i;
1304 i__4 = kd1 + j * ab_dim1;
1306 i__6 = kd1 + j * ab_dim1;
1307 q__1.r = d__[i__5] * ab[i__6].r, q__1.i = d__[i__5] *
1309 ab[i__4].r = q__1.r, ab[i__4].i = q__1.i;
1320 /* make off-diagonal elements real and copy them to E */
1323 for (i__ = 1; i__ <= i__1; ++i__) {
1324 i__2 = i__ * ab_dim1 + 2;
1325 t.r = ab[i__2].r, t.i = ab[i__2].i;
1327 i__2 = i__ * ab_dim1 + 2;
1328 ab[i__2].r = abst, ab[i__2].i = 0.f;
1331 q__1.r = t.r / abst, q__1.i = t.i / abst;
1332 t.r = q__1.r, t.i = q__1.i;
1334 t.r = 1.f, t.i = 0.f;
1337 i__2 = (i__ + 1) * ab_dim1 + 2;
1338 i__3 = (i__ + 1) * ab_dim1 + 2;
1339 q__1.r = ab[i__3].r * t.r - ab[i__3].i * t.i, q__1.i = ab[
1340 i__3].r * t.i + ab[i__3].i * t.r;
1341 ab[i__2].r = q__1.r, ab[i__2].i = q__1.i;
1344 cscal_(n, &t, &q[(i__ + 1) * q_dim1 + 1], &c__1);
1350 /* set E to zero if original matrix was diagonal */
1353 for (i__ = 1; i__ <= i__1; ++i__) {
1359 /* copy diagonal elements to D */
1362 for (i__ = 1; i__ <= i__1; ++i__) {
1364 i__3 = i__ * ab_dim1 + 1;
1365 d__[i__2] = ab[i__3].r;