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 real c_b8 = 0.f;
516 static real c_b9 = 1.f;
517 static integer c__1 = 1;
518 static real c_b20 = -1.f;
520 /* > \brief \b SSBGST */
522 /* =========== DOCUMENTATION =========== */
524 /* Online html documentation available at */
525 /* http://www.netlib.org/lapack/explore-html/ */
528 /* > Download SSBGST + dependencies */
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ssbgst.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ssbgst.
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ssbgst.
543 /* SUBROUTINE SSBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X, */
544 /* LDX, WORK, INFO ) */
546 /* CHARACTER UPLO, VECT */
547 /* INTEGER INFO, KA, KB, LDAB, LDBB, LDX, N */
548 /* REAL AB( LDAB, * ), BB( LDBB, * ), WORK( * ), */
552 /* > \par Purpose: */
557 /* > SSBGST reduces a real symmetric-definite banded generalized */
558 /* > eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, */
559 /* > such that C has the same bandwidth as A. */
561 /* > B must have been previously factorized as S**T*S by SPBSTF, using a */
562 /* > split Cholesky factorization. A is overwritten by C = X**T*A*X, where */
563 /* > X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the */
564 /* > bandwidth of A. */
570 /* > \param[in] VECT */
572 /* > VECT is CHARACTER*1 */
573 /* > = 'N': do not form the transformation matrix X; */
574 /* > = 'V': form X. */
577 /* > \param[in] UPLO */
579 /* > UPLO is CHARACTER*1 */
580 /* > = 'U': Upper triangle of A is stored; */
581 /* > = 'L': Lower triangle of A is stored. */
587 /* > The order of the matrices A and B. N >= 0. */
590 /* > \param[in] KA */
592 /* > KA is INTEGER */
593 /* > The number of superdiagonals of the matrix A if UPLO = 'U', */
594 /* > or the number of subdiagonals if UPLO = 'L'. KA >= 0. */
597 /* > \param[in] KB */
599 /* > KB is INTEGER */
600 /* > The number of superdiagonals of the matrix B if UPLO = 'U', */
601 /* > or the number of subdiagonals if UPLO = 'L'. KA >= KB >= 0. */
604 /* > \param[in,out] AB */
606 /* > AB is REAL array, dimension (LDAB,N) */
607 /* > On entry, the upper or lower triangle of the symmetric band */
608 /* > matrix A, stored in the first ka+1 rows of the array. The */
609 /* > j-th column of A is stored in the j-th column of the array AB */
611 /* > if UPLO = 'U', AB(ka+1+i-j,j) = A(i,j) for f2cmax(1,j-ka)<=i<=j; */
612 /* > if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=f2cmin(n,j+ka). */
614 /* > On exit, the transformed matrix X**T*A*X, stored in the same */
618 /* > \param[in] LDAB */
620 /* > LDAB is INTEGER */
621 /* > The leading dimension of the array AB. LDAB >= KA+1. */
624 /* > \param[in] BB */
626 /* > BB is REAL array, dimension (LDBB,N) */
627 /* > The banded factor S from the split Cholesky factorization of */
628 /* > B, as returned by SPBSTF, stored in the first KB+1 rows of */
632 /* > \param[in] LDBB */
634 /* > LDBB is INTEGER */
635 /* > The leading dimension of the array BB. LDBB >= KB+1. */
638 /* > \param[out] X */
640 /* > X is REAL array, dimension (LDX,N) */
641 /* > If VECT = 'V', the n-by-n matrix X. */
642 /* > If VECT = 'N', the array X is not referenced. */
645 /* > \param[in] LDX */
647 /* > LDX is INTEGER */
648 /* > The leading dimension of the array X. */
649 /* > LDX >= f2cmax(1,N) if VECT = 'V'; LDX >= 1 otherwise. */
652 /* > \param[out] WORK */
654 /* > WORK is REAL array, dimension (2*N) */
657 /* > \param[out] INFO */
659 /* > INFO is INTEGER */
660 /* > = 0: successful exit */
661 /* > < 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 December 2016 */
674 /* > \ingroup realOTHERcomputational */
676 /* ===================================================================== */
677 /* Subroutine */ int ssbgst_(char *vect, char *uplo, integer *n, integer *ka,
678 integer *kb, real *ab, integer *ldab, real *bb, integer *ldbb, real *
679 x, integer *ldx, real *work, integer *info)
681 /* System generated locals */
682 integer ab_dim1, ab_offset, bb_dim1, bb_offset, x_dim1, x_offset, i__1,
686 /* Local variables */
688 extern /* Subroutine */ int sger_(integer *, integer *, real *, real *,
689 integer *, real *, integer *, real *, integer *), srot_(integer *,
690 real *, integer *, real *, integer *, real *, real *);
691 integer i__, j, k, l, m;
693 extern logical lsame_(char *, char *);
694 extern /* Subroutine */ int sscal_(integer *, real *, real *, integer *);
699 extern /* Subroutine */ int slar2v_(integer *, real *, real *, real *,
700 integer *, real *, real *, integer *);
703 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
705 extern /* Subroutine */ int slaset_(char *, integer *, integer *, real *,
706 real *, real *, integer *), slartg_(real *, real *, real *
709 extern /* Subroutine */ int slargv_(integer *, real *, integer *, real *,
710 integer *, real *, integer *);
712 extern /* Subroutine */ int slartv_(integer *, real *, integer *, real *,
713 integer *, real *, real *, integer *);
719 /* -- LAPACK computational routine (version 3.7.0) -- */
720 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
721 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
725 /* ===================================================================== */
728 /* Test the input parameters */
730 /* Parameter adjustments */
732 ab_offset = 1 + ab_dim1 * 1;
735 bb_offset = 1 + bb_dim1 * 1;
738 x_offset = 1 + x_dim1 * 1;
743 wantx = lsame_(vect, "V");
744 upper = lsame_(uplo, "U");
748 if (! wantx && ! lsame_(vect, "N")) {
750 } else if (! upper && ! lsame_(uplo, "L")) {
754 } else if (*ka < 0) {
756 } else if (*kb < 0 || *kb > *ka) {
758 } else if (*ldab < *ka + 1) {
760 } else if (*ldbb < *kb + 1) {
762 } else if (*ldx < 1 || wantx && *ldx < f2cmax(1,*n)) {
767 xerbla_("SSBGST", &i__1, (ftnlen)6);
771 /* Quick return if possible */
779 /* Initialize X to the unit matrix, if needed */
782 slaset_("Full", n, n, &c_b8, &c_b9, &x[x_offset], ldx);
785 /* Set M to the splitting point m. It must be the same value as is */
786 /* used in SPBSTF. The chosen value allows the arrays WORK and RWORK */
787 /* to be of dimension (N). */
791 /* The routine works in two phases, corresponding to the two halves */
792 /* of the split Cholesky factorization of B as S**T*S where */
797 /* with U upper triangular of order m, and L lower triangular of */
798 /* order n-m. S has the same bandwidth as B. */
800 /* S is treated as a product of elementary matrices: */
802 /* S = S(m)*S(m-1)*...*S(2)*S(1)*S(m+1)*S(m+2)*...*S(n-1)*S(n) */
804 /* where S(i) is determined by the i-th row of S. */
806 /* In phase 1, the index i takes the values n, n-1, ... , m+1; */
807 /* in phase 2, it takes the values 1, 2, ... , m. */
809 /* For each value of i, the current matrix A is updated by forming */
810 /* inv(S(i))**T*A*inv(S(i)). This creates a triangular bulge outside */
811 /* the band of A. The bulge is then pushed down toward the bottom of */
812 /* A in phase 1, and up toward the top of A in phase 2, by applying */
813 /* plane rotations. */
815 /* There are kb*(kb+1)/2 elements in the bulge, but at most 2*kb-1 */
816 /* of them are linearly independent, so annihilating a bulge requires */
817 /* only 2*kb-1 plane rotations. The rotations are divided into a 1st */
818 /* set of kb-1 rotations, and a 2nd set of kb rotations. */
820 /* Wherever possible, rotations are generated and applied in vector */
821 /* operations of length NR between the indices J1 and J2 (sometimes */
822 /* replaced by modified values NRT, J1T or J2T). */
824 /* The cosines and sines of the rotations are stored in the array */
825 /* WORK. The cosines of the 1st set of rotations are stored in */
826 /* elements n+2:n+m-kb-1 and the sines of the 1st set in elements */
827 /* 2:m-kb-1; the cosines of the 2nd set are stored in elements */
828 /* n+m-kb+1:2*n and the sines of the second set in elements m-kb+1:n. */
830 /* The bulges are not formed explicitly; nonzero elements outside the */
831 /* band are created only when they are required for generating new */
832 /* rotations; they are stored in the array WORK, in positions where */
833 /* they are later overwritten by the sines of the rotations which */
834 /* annihilate them. */
836 /* **************************** Phase 1 ***************************** */
838 /* The logical structure of this phase is: */
840 /* UPDATE = .TRUE. */
841 /* DO I = N, M + 1, -1 */
842 /* use S(i) to update A and create a new bulge */
843 /* apply rotations to push all bulges KA positions downward */
845 /* UPDATE = .FALSE. */
846 /* DO I = M + KA + 1, N - 1 */
847 /* apply rotations to push all bulges KA positions downward */
850 /* To avoid duplicating code, the two loops are merged. */
858 i__1 = *kb, i__2 = i__ - 1;
859 kbt = f2cmin(i__1,i__2);
862 i__1 = *n, i__2 = i__ + *ka;
863 i1 = f2cmin(i__1,i__2);
864 i2 = i__ - kbt + ka1;
883 /* Transform A, working with the upper triangle */
887 /* Form inv(S(i))**T * A * inv(S(i)) */
889 bii = bb[kb1 + i__ * bb_dim1];
891 for (j = i__; j <= i__1; ++j) {
892 ab[i__ - j + ka1 + j * ab_dim1] /= bii;
896 i__1 = 1, i__2 = i__ - *ka;
898 for (j = f2cmax(i__1,i__2); j <= i__3; ++j) {
899 ab[j - i__ + ka1 + i__ * ab_dim1] /= bii;
903 for (k = i__ - kbt; k <= i__3; ++k) {
905 for (j = i__ - kbt; j <= i__1; ++j) {
906 ab[j - k + ka1 + k * ab_dim1] = ab[j - k + ka1 + k *
907 ab_dim1] - bb[j - i__ + kb1 + i__ * bb_dim1] * ab[
908 k - i__ + ka1 + i__ * ab_dim1] - bb[k - i__ + kb1
909 + i__ * bb_dim1] * ab[j - i__ + ka1 + i__ *
910 ab_dim1] + ab[ka1 + i__ * ab_dim1] * bb[j - i__ +
911 kb1 + i__ * bb_dim1] * bb[k - i__ + kb1 + i__ *
916 i__1 = 1, i__2 = i__ - *ka;
917 i__4 = i__ - kbt - 1;
918 for (j = f2cmax(i__1,i__2); j <= i__4; ++j) {
919 ab[j - k + ka1 + k * ab_dim1] -= bb[k - i__ + kb1 + i__ *
920 bb_dim1] * ab[j - i__ + ka1 + i__ * ab_dim1];
926 for (j = i__; j <= i__3; ++j) {
928 i__4 = j - *ka, i__1 = i__ - kbt;
930 for (k = f2cmax(i__4,i__1); k <= i__2; ++k) {
931 ab[k - j + ka1 + j * ab_dim1] -= bb[k - i__ + kb1 + i__ *
932 bb_dim1] * ab[i__ - j + ka1 + j * ab_dim1];
940 /* post-multiply X by inv(S(i)) */
944 sscal_(&i__3, &r__1, &x[m + 1 + i__ * x_dim1], &c__1);
947 sger_(&i__3, &kbt, &c_b20, &x[m + 1 + i__ * x_dim1], &
948 c__1, &bb[kb1 - kbt + i__ * bb_dim1], &c__1, &x[m
949 + 1 + (i__ - kbt) * x_dim1], ldx);
953 /* store a(i,i1) in RA1 for use in next loop over K */
955 ra1 = ab[i__ - i1 + ka1 + i1 * ab_dim1];
958 /* Generate and apply vectors of rotations to chase all the */
959 /* existing bulges KA positions down toward the bottom of the */
963 for (k = 1; k <= i__3; ++k) {
966 /* Determine the rotations which would annihilate the bulge */
967 /* which has in theory just been created */
969 if (i__ - k + *ka < *n && i__ - k > 1) {
971 /* generate rotation to annihilate a(i,i-k+ka+1) */
973 slartg_(&ab[k + 1 + (i__ - k + *ka) * ab_dim1], &ra1, &
974 work[*n + i__ - k + *ka - m], &work[i__ - k + *ka
977 /* create nonzero element a(i-k,i-k+ka+1) outside the */
978 /* band and store it in WORK(i-k) */
980 t = -bb[kb1 - k + i__ * bb_dim1] * ra1;
981 work[i__ - k] = work[*n + i__ - k + *ka - m] * t - work[
982 i__ - k + *ka - m] * ab[(i__ - k + *ka) * ab_dim1
984 ab[(i__ - k + *ka) * ab_dim1 + 1] = work[i__ - k + *ka -
985 m] * t + work[*n + i__ - k + *ka - m] * ab[(i__ -
986 k + *ka) * ab_dim1 + 1];
991 i__2 = 1, i__4 = k - i0 + 2;
992 j2 = i__ - k - 1 + f2cmax(i__2,i__4) * ka1;
993 nr = (*n - j2 + *ka) / ka1;
994 j1 = j2 + (nr - 1) * ka1;
997 i__2 = j2, i__4 = i__ + (*ka << 1) - k + 1;
998 j2t = f2cmax(i__2,i__4);
1002 nrt = (*n - j2t + *ka) / ka1;
1005 for (j = j2t; i__4 < 0 ? j >= i__2 : j <= i__2; j += i__4) {
1007 /* create nonzero element a(j-ka,j+1) outside the band */
1008 /* and store it in WORK(j-m) */
1010 work[j - m] *= ab[(j + 1) * ab_dim1 + 1];
1011 ab[(j + 1) * ab_dim1 + 1] = work[*n + j - m] * ab[(j + 1) *
1016 /* generate rotations in 1st set to annihilate elements which */
1017 /* have been created outside the band */
1020 slargv_(&nrt, &ab[j2t * ab_dim1 + 1], &inca, &work[j2t - m], &
1021 ka1, &work[*n + j2t - m], &ka1);
1025 /* apply rotations in 1st set from the right */
1028 for (l = 1; l <= i__4; ++l) {
1029 slartv_(&nr, &ab[ka1 - l + j2 * ab_dim1], &inca, &ab[*ka
1030 - l + (j2 + 1) * ab_dim1], &inca, &work[*n + j2 -
1031 m], &work[j2 - m], &ka1);
1035 /* apply rotations in 1st set from both sides to diagonal */
1038 slar2v_(&nr, &ab[ka1 + j2 * ab_dim1], &ab[ka1 + (j2 + 1) *
1039 ab_dim1], &ab[*ka + (j2 + 1) * ab_dim1], &inca, &work[
1040 *n + j2 - m], &work[j2 - m], &ka1);
1044 /* start applying rotations in 1st set from the left */
1047 for (l = *ka - 1; l >= i__4; --l) {
1048 nrt = (*n - j2 + l) / ka1;
1050 slartv_(&nrt, &ab[l + (j2 + ka1 - l) * ab_dim1], &inca, &
1051 ab[l + 1 + (j2 + ka1 - l) * ab_dim1], &inca, &
1052 work[*n + j2 - m], &work[j2 - m], &ka1);
1059 /* post-multiply X by product of rotations in 1st set */
1063 for (j = j2; i__2 < 0 ? j >= i__4 : j <= i__4; j += i__2) {
1065 srot_(&i__1, &x[m + 1 + j * x_dim1], &c__1, &x[m + 1 + (j
1066 + 1) * x_dim1], &c__1, &work[*n + j - m], &work[j
1075 if (i2 <= *n && kbt > 0) {
1077 /* create nonzero element a(i-kbt,i-kbt+ka+1) outside the */
1078 /* band and store it in WORK(i-kbt) */
1080 work[i__ - kbt] = -bb[kb1 - kbt + i__ * bb_dim1] * ra1;
1084 for (k = *kb; k >= 1; --k) {
1087 i__3 = 2, i__2 = k - i0 + 1;
1088 j2 = i__ - k - 1 + f2cmax(i__3,i__2) * ka1;
1091 i__3 = 1, i__2 = k - i0 + 1;
1092 j2 = i__ - k - 1 + f2cmax(i__3,i__2) * ka1;
1095 /* finish applying rotations in 2nd set from the left */
1097 for (l = *kb - k; l >= 1; --l) {
1098 nrt = (*n - j2 + *ka + l) / ka1;
1100 slartv_(&nrt, &ab[l + (j2 - l + 1) * ab_dim1], &inca, &ab[
1101 l + 1 + (j2 - l + 1) * ab_dim1], &inca, &work[*n
1102 + j2 - *ka], &work[j2 - *ka], &ka1);
1106 nr = (*n - j2 + *ka) / ka1;
1107 j1 = j2 + (nr - 1) * ka1;
1110 for (j = j1; i__2 < 0 ? j >= i__3 : j <= i__3; j += i__2) {
1111 work[j] = work[j - *ka];
1112 work[*n + j] = work[*n + j - *ka];
1117 for (j = j2; i__3 < 0 ? j >= i__2 : j <= i__2; j += i__3) {
1119 /* create nonzero element a(j-ka,j+1) outside the band */
1120 /* and store it in WORK(j) */
1122 work[j] *= ab[(j + 1) * ab_dim1 + 1];
1123 ab[(j + 1) * ab_dim1 + 1] = work[*n + j] * ab[(j + 1) *
1128 if (i__ - k < *n - *ka && k <= kbt) {
1129 work[i__ - k + *ka] = work[i__ - k];
1135 for (k = *kb; k >= 1; --k) {
1137 i__3 = 1, i__2 = k - i0 + 1;
1138 j2 = i__ - k - 1 + f2cmax(i__3,i__2) * ka1;
1139 nr = (*n - j2 + *ka) / ka1;
1140 j1 = j2 + (nr - 1) * ka1;
1143 /* generate rotations in 2nd set to annihilate elements */
1144 /* which have been created outside the band */
1146 slargv_(&nr, &ab[j2 * ab_dim1 + 1], &inca, &work[j2], &ka1, &
1147 work[*n + j2], &ka1);
1149 /* apply rotations in 2nd set from the right */
1152 for (l = 1; l <= i__3; ++l) {
1153 slartv_(&nr, &ab[ka1 - l + j2 * ab_dim1], &inca, &ab[*ka
1154 - l + (j2 + 1) * ab_dim1], &inca, &work[*n + j2],
1159 /* apply rotations in 2nd set from both sides to diagonal */
1162 slar2v_(&nr, &ab[ka1 + j2 * ab_dim1], &ab[ka1 + (j2 + 1) *
1163 ab_dim1], &ab[*ka + (j2 + 1) * ab_dim1], &inca, &work[
1164 *n + j2], &work[j2], &ka1);
1168 /* start applying rotations in 2nd set from the left */
1171 for (l = *ka - 1; l >= i__3; --l) {
1172 nrt = (*n - j2 + l) / ka1;
1174 slartv_(&nrt, &ab[l + (j2 + ka1 - l) * ab_dim1], &inca, &
1175 ab[l + 1 + (j2 + ka1 - l) * ab_dim1], &inca, &
1176 work[*n + j2], &work[j2], &ka1);
1183 /* post-multiply X by product of rotations in 2nd set */
1187 for (j = j2; i__2 < 0 ? j >= i__3 : j <= i__3; j += i__2) {
1189 srot_(&i__4, &x[m + 1 + j * x_dim1], &c__1, &x[m + 1 + (j
1190 + 1) * x_dim1], &c__1, &work[*n + j], &work[j]);
1198 for (k = 1; k <= i__2; ++k) {
1200 i__3 = 1, i__4 = k - i0 + 2;
1201 j2 = i__ - k - 1 + f2cmax(i__3,i__4) * ka1;
1203 /* finish applying rotations in 1st set from the left */
1205 for (l = *kb - k; l >= 1; --l) {
1206 nrt = (*n - j2 + l) / ka1;
1208 slartv_(&nrt, &ab[l + (j2 + ka1 - l) * ab_dim1], &inca, &
1209 ab[l + 1 + (j2 + ka1 - l) * ab_dim1], &inca, &
1210 work[*n + j2 - m], &work[j2 - m], &ka1);
1218 i__2 = i__ - *kb + (*ka << 1) + 1;
1219 for (j = *n - 1; j >= i__2; --j) {
1220 work[*n + j - m] = work[*n + j - *ka - m];
1221 work[j - m] = work[j - *ka - m];
1228 /* Transform A, working with the lower triangle */
1232 /* Form inv(S(i))**T * A * inv(S(i)) */
1234 bii = bb[i__ * bb_dim1 + 1];
1236 for (j = i__; j <= i__2; ++j) {
1237 ab[j - i__ + 1 + i__ * ab_dim1] /= bii;
1241 i__2 = 1, i__3 = i__ - *ka;
1243 for (j = f2cmax(i__2,i__3); j <= i__4; ++j) {
1244 ab[i__ - j + 1 + j * ab_dim1] /= bii;
1248 for (k = i__ - kbt; k <= i__4; ++k) {
1250 for (j = i__ - kbt; j <= i__2; ++j) {
1251 ab[k - j + 1 + j * ab_dim1] = ab[k - j + 1 + j * ab_dim1]
1252 - bb[i__ - j + 1 + j * bb_dim1] * ab[i__ - k + 1
1253 + k * ab_dim1] - bb[i__ - k + 1 + k * bb_dim1] *
1254 ab[i__ - j + 1 + j * ab_dim1] + ab[i__ * ab_dim1
1255 + 1] * bb[i__ - j + 1 + j * bb_dim1] * bb[i__ - k
1260 i__2 = 1, i__3 = i__ - *ka;
1261 i__1 = i__ - kbt - 1;
1262 for (j = f2cmax(i__2,i__3); j <= i__1; ++j) {
1263 ab[k - j + 1 + j * ab_dim1] -= bb[i__ - k + 1 + k *
1264 bb_dim1] * ab[i__ - j + 1 + j * ab_dim1];
1270 for (j = i__; j <= i__4; ++j) {
1272 i__1 = j - *ka, i__2 = i__ - kbt;
1274 for (k = f2cmax(i__1,i__2); k <= i__3; ++k) {
1275 ab[j - k + 1 + k * ab_dim1] -= bb[i__ - k + 1 + k *
1276 bb_dim1] * ab[j - i__ + 1 + i__ * ab_dim1];
1284 /* post-multiply X by inv(S(i)) */
1288 sscal_(&i__4, &r__1, &x[m + 1 + i__ * x_dim1], &c__1);
1292 sger_(&i__4, &kbt, &c_b20, &x[m + 1 + i__ * x_dim1], &
1293 c__1, &bb[kbt + 1 + (i__ - kbt) * bb_dim1], &i__3,
1294 &x[m + 1 + (i__ - kbt) * x_dim1], ldx);
1298 /* store a(i1,i) in RA1 for use in next loop over K */
1300 ra1 = ab[i1 - i__ + 1 + i__ * ab_dim1];
1303 /* Generate and apply vectors of rotations to chase all the */
1304 /* existing bulges KA positions down toward the bottom of the */
1308 for (k = 1; k <= i__4; ++k) {
1311 /* Determine the rotations which would annihilate the bulge */
1312 /* which has in theory just been created */
1314 if (i__ - k + *ka < *n && i__ - k > 1) {
1316 /* generate rotation to annihilate a(i-k+ka+1,i) */
1318 slartg_(&ab[ka1 - k + i__ * ab_dim1], &ra1, &work[*n +
1319 i__ - k + *ka - m], &work[i__ - k + *ka - m], &ra)
1322 /* create nonzero element a(i-k+ka+1,i-k) outside the */
1323 /* band and store it in WORK(i-k) */
1325 t = -bb[k + 1 + (i__ - k) * bb_dim1] * ra1;
1326 work[i__ - k] = work[*n + i__ - k + *ka - m] * t - work[
1327 i__ - k + *ka - m] * ab[ka1 + (i__ - k) * ab_dim1]
1329 ab[ka1 + (i__ - k) * ab_dim1] = work[i__ - k + *ka - m] *
1330 t + work[*n + i__ - k + *ka - m] * ab[ka1 + (i__
1336 i__3 = 1, i__1 = k - i0 + 2;
1337 j2 = i__ - k - 1 + f2cmax(i__3,i__1) * ka1;
1338 nr = (*n - j2 + *ka) / ka1;
1339 j1 = j2 + (nr - 1) * ka1;
1342 i__3 = j2, i__1 = i__ + (*ka << 1) - k + 1;
1343 j2t = f2cmax(i__3,i__1);
1347 nrt = (*n - j2t + *ka) / ka1;
1350 for (j = j2t; i__1 < 0 ? j >= i__3 : j <= i__3; j += i__1) {
1352 /* create nonzero element a(j+1,j-ka) outside the band */
1353 /* and store it in WORK(j-m) */
1355 work[j - m] *= ab[ka1 + (j - *ka + 1) * ab_dim1];
1356 ab[ka1 + (j - *ka + 1) * ab_dim1] = work[*n + j - m] * ab[ka1
1357 + (j - *ka + 1) * ab_dim1];
1361 /* generate rotations in 1st set to annihilate elements which */
1362 /* have been created outside the band */
1365 slargv_(&nrt, &ab[ka1 + (j2t - *ka) * ab_dim1], &inca, &work[
1366 j2t - m], &ka1, &work[*n + j2t - m], &ka1);
1370 /* apply rotations in 1st set from the left */
1373 for (l = 1; l <= i__1; ++l) {
1374 slartv_(&nr, &ab[l + 1 + (j2 - l) * ab_dim1], &inca, &ab[
1375 l + 2 + (j2 - l) * ab_dim1], &inca, &work[*n + j2
1376 - m], &work[j2 - m], &ka1);
1380 /* apply rotations in 1st set from both sides to diagonal */
1383 slar2v_(&nr, &ab[j2 * ab_dim1 + 1], &ab[(j2 + 1) * ab_dim1 +
1384 1], &ab[j2 * ab_dim1 + 2], &inca, &work[*n + j2 - m],
1385 &work[j2 - m], &ka1);
1389 /* start applying rotations in 1st set from the right */
1392 for (l = *ka - 1; l >= i__1; --l) {
1393 nrt = (*n - j2 + l) / ka1;
1395 slartv_(&nrt, &ab[ka1 - l + 1 + j2 * ab_dim1], &inca, &ab[
1396 ka1 - l + (j2 + 1) * ab_dim1], &inca, &work[*n +
1397 j2 - m], &work[j2 - m], &ka1);
1404 /* post-multiply X by product of rotations in 1st set */
1408 for (j = j2; i__3 < 0 ? j >= i__1 : j <= i__1; j += i__3) {
1410 srot_(&i__2, &x[m + 1 + j * x_dim1], &c__1, &x[m + 1 + (j
1411 + 1) * x_dim1], &c__1, &work[*n + j - m], &work[j
1420 if (i2 <= *n && kbt > 0) {
1422 /* create nonzero element a(i-kbt+ka+1,i-kbt) outside the */
1423 /* band and store it in WORK(i-kbt) */
1425 work[i__ - kbt] = -bb[kbt + 1 + (i__ - kbt) * bb_dim1] * ra1;
1429 for (k = *kb; k >= 1; --k) {
1432 i__4 = 2, i__3 = k - i0 + 1;
1433 j2 = i__ - k - 1 + f2cmax(i__4,i__3) * ka1;
1436 i__4 = 1, i__3 = k - i0 + 1;
1437 j2 = i__ - k - 1 + f2cmax(i__4,i__3) * ka1;
1440 /* finish applying rotations in 2nd set from the right */
1442 for (l = *kb - k; l >= 1; --l) {
1443 nrt = (*n - j2 + *ka + l) / ka1;
1445 slartv_(&nrt, &ab[ka1 - l + 1 + (j2 - *ka) * ab_dim1], &
1446 inca, &ab[ka1 - l + (j2 - *ka + 1) * ab_dim1], &
1447 inca, &work[*n + j2 - *ka], &work[j2 - *ka], &ka1)
1452 nr = (*n - j2 + *ka) / ka1;
1453 j1 = j2 + (nr - 1) * ka1;
1456 for (j = j1; i__3 < 0 ? j >= i__4 : j <= i__4; j += i__3) {
1457 work[j] = work[j - *ka];
1458 work[*n + j] = work[*n + j - *ka];
1463 for (j = j2; i__4 < 0 ? j >= i__3 : j <= i__3; j += i__4) {
1465 /* create nonzero element a(j+1,j-ka) outside the band */
1466 /* and store it in WORK(j) */
1468 work[j] *= ab[ka1 + (j - *ka + 1) * ab_dim1];
1469 ab[ka1 + (j - *ka + 1) * ab_dim1] = work[*n + j] * ab[ka1 + (
1470 j - *ka + 1) * ab_dim1];
1474 if (i__ - k < *n - *ka && k <= kbt) {
1475 work[i__ - k + *ka] = work[i__ - k];
1481 for (k = *kb; k >= 1; --k) {
1483 i__4 = 1, i__3 = k - i0 + 1;
1484 j2 = i__ - k - 1 + f2cmax(i__4,i__3) * ka1;
1485 nr = (*n - j2 + *ka) / ka1;
1486 j1 = j2 + (nr - 1) * ka1;
1489 /* generate rotations in 2nd set to annihilate elements */
1490 /* which have been created outside the band */
1492 slargv_(&nr, &ab[ka1 + (j2 - *ka) * ab_dim1], &inca, &work[j2]
1493 , &ka1, &work[*n + j2], &ka1);
1495 /* apply rotations in 2nd set from the left */
1498 for (l = 1; l <= i__4; ++l) {
1499 slartv_(&nr, &ab[l + 1 + (j2 - l) * ab_dim1], &inca, &ab[
1500 l + 2 + (j2 - l) * ab_dim1], &inca, &work[*n + j2]
1505 /* apply rotations in 2nd set from both sides to diagonal */
1508 slar2v_(&nr, &ab[j2 * ab_dim1 + 1], &ab[(j2 + 1) * ab_dim1 +
1509 1], &ab[j2 * ab_dim1 + 2], &inca, &work[*n + j2], &
1514 /* start applying rotations in 2nd set from the right */
1517 for (l = *ka - 1; l >= i__4; --l) {
1518 nrt = (*n - j2 + l) / ka1;
1520 slartv_(&nrt, &ab[ka1 - l + 1 + j2 * ab_dim1], &inca, &ab[
1521 ka1 - l + (j2 + 1) * ab_dim1], &inca, &work[*n +
1522 j2], &work[j2], &ka1);
1529 /* post-multiply X by product of rotations in 2nd set */
1533 for (j = j2; i__3 < 0 ? j >= i__4 : j <= i__4; j += i__3) {
1535 srot_(&i__1, &x[m + 1 + j * x_dim1], &c__1, &x[m + 1 + (j
1536 + 1) * x_dim1], &c__1, &work[*n + j], &work[j]);
1544 for (k = 1; k <= i__3; ++k) {
1546 i__4 = 1, i__1 = k - i0 + 2;
1547 j2 = i__ - k - 1 + f2cmax(i__4,i__1) * ka1;
1549 /* finish applying rotations in 1st set from the right */
1551 for (l = *kb - k; l >= 1; --l) {
1552 nrt = (*n - j2 + l) / ka1;
1554 slartv_(&nrt, &ab[ka1 - l + 1 + j2 * ab_dim1], &inca, &ab[
1555 ka1 - l + (j2 + 1) * ab_dim1], &inca, &work[*n +
1556 j2 - m], &work[j2 - m], &ka1);
1564 i__3 = i__ - *kb + (*ka << 1) + 1;
1565 for (j = *n - 1; j >= i__3; --j) {
1566 work[*n + j - m] = work[*n + j - *ka - m];
1567 work[j - m] = work[j - *ka - m];
1578 /* **************************** Phase 2 ***************************** */
1580 /* The logical structure of this phase is: */
1582 /* UPDATE = .TRUE. */
1584 /* use S(i) to update A and create a new bulge */
1585 /* apply rotations to push all bulges KA positions upward */
1587 /* UPDATE = .FALSE. */
1588 /* DO I = M - KA - 1, 2, -1 */
1589 /* apply rotations to push all bulges KA positions upward */
1592 /* To avoid duplicating code, the two loops are merged. */
1600 i__3 = *kb, i__4 = m - i__;
1601 kbt = f2cmin(i__3,i__4);
1604 i__3 = 1, i__4 = i__ - *ka;
1605 i1 = f2cmax(i__3,i__4);
1606 i2 = i__ + kbt - ka1;
1623 if (i__ < m - kbt) {
1631 /* Transform A, working with the upper triangle */
1635 /* Form inv(S(i))**T * A * inv(S(i)) */
1637 bii = bb[kb1 + i__ * bb_dim1];
1639 for (j = i1; j <= i__3; ++j) {
1640 ab[j - i__ + ka1 + i__ * ab_dim1] /= bii;
1644 i__4 = *n, i__1 = i__ + *ka;
1645 i__3 = f2cmin(i__4,i__1);
1646 for (j = i__; j <= i__3; ++j) {
1647 ab[i__ - j + ka1 + j * ab_dim1] /= bii;
1651 for (k = i__ + 1; k <= i__3; ++k) {
1653 for (j = k; j <= i__4; ++j) {
1654 ab[k - j + ka1 + j * ab_dim1] = ab[k - j + ka1 + j *
1655 ab_dim1] - bb[i__ - j + kb1 + j * bb_dim1] * ab[
1656 i__ - k + ka1 + k * ab_dim1] - bb[i__ - k + kb1 +
1657 k * bb_dim1] * ab[i__ - j + ka1 + j * ab_dim1] +
1658 ab[ka1 + i__ * ab_dim1] * bb[i__ - j + kb1 + j *
1659 bb_dim1] * bb[i__ - k + kb1 + k * bb_dim1];
1663 i__1 = *n, i__2 = i__ + *ka;
1664 i__4 = f2cmin(i__1,i__2);
1665 for (j = i__ + kbt + 1; j <= i__4; ++j) {
1666 ab[k - j + ka1 + j * ab_dim1] -= bb[i__ - k + kb1 + k *
1667 bb_dim1] * ab[i__ - j + ka1 + j * ab_dim1];
1673 for (j = i1; j <= i__3; ++j) {
1675 i__1 = j + *ka, i__2 = i__ + kbt;
1676 i__4 = f2cmin(i__1,i__2);
1677 for (k = i__ + 1; k <= i__4; ++k) {
1678 ab[j - k + ka1 + k * ab_dim1] -= bb[i__ - k + kb1 + k *
1679 bb_dim1] * ab[j - i__ + ka1 + i__ * ab_dim1];
1687 /* post-multiply X by inv(S(i)) */
1690 sscal_(&nx, &r__1, &x[i__ * x_dim1 + 1], &c__1);
1693 sger_(&nx, &kbt, &c_b20, &x[i__ * x_dim1 + 1], &c__1, &bb[
1694 *kb + (i__ + 1) * bb_dim1], &i__3, &x[(i__ + 1) *
1699 /* store a(i1,i) in RA1 for use in next loop over K */
1701 ra1 = ab[i1 - i__ + ka1 + i__ * ab_dim1];
1704 /* Generate and apply vectors of rotations to chase all the */
1705 /* existing bulges KA positions up toward the top of the band */
1708 for (k = 1; k <= i__3; ++k) {
1711 /* Determine the rotations which would annihilate the bulge */
1712 /* which has in theory just been created */
1714 if (i__ + k - ka1 > 0 && i__ + k < m) {
1716 /* generate rotation to annihilate a(i+k-ka-1,i) */
1718 slartg_(&ab[k + 1 + i__ * ab_dim1], &ra1, &work[*n + i__
1719 + k - *ka], &work[i__ + k - *ka], &ra);
1721 /* create nonzero element a(i+k-ka-1,i+k) outside the */
1722 /* band and store it in WORK(m-kb+i+k) */
1724 t = -bb[kb1 - k + (i__ + k) * bb_dim1] * ra1;
1725 work[m - *kb + i__ + k] = work[*n + i__ + k - *ka] * t -
1726 work[i__ + k - *ka] * ab[(i__ + k) * ab_dim1 + 1];
1727 ab[(i__ + k) * ab_dim1 + 1] = work[i__ + k - *ka] * t +
1728 work[*n + i__ + k - *ka] * ab[(i__ + k) * ab_dim1
1734 i__4 = 1, i__1 = k + i0 - m + 1;
1735 j2 = i__ + k + 1 - f2cmax(i__4,i__1) * ka1;
1736 nr = (j2 + *ka - 1) / ka1;
1737 j1 = j2 - (nr - 1) * ka1;
1740 i__4 = j2, i__1 = i__ - (*ka << 1) + k - 1;
1741 j2t = f2cmin(i__4,i__1);
1745 nrt = (j2t + *ka - 1) / ka1;
1748 for (j = j1; i__1 < 0 ? j >= i__4 : j <= i__4; j += i__1) {
1750 /* create nonzero element a(j-1,j+ka) outside the band */
1751 /* and store it in WORK(j) */
1753 work[j] *= ab[(j + *ka - 1) * ab_dim1 + 1];
1754 ab[(j + *ka - 1) * ab_dim1 + 1] = work[*n + j] * ab[(j + *ka
1755 - 1) * ab_dim1 + 1];
1759 /* generate rotations in 1st set to annihilate elements which */
1760 /* have been created outside the band */
1763 slargv_(&nrt, &ab[(j1 + *ka) * ab_dim1 + 1], &inca, &work[j1],
1764 &ka1, &work[*n + j1], &ka1);
1768 /* apply rotations in 1st set from the left */
1771 for (l = 1; l <= i__1; ++l) {
1772 slartv_(&nr, &ab[ka1 - l + (j1 + l) * ab_dim1], &inca, &
1773 ab[*ka - l + (j1 + l) * ab_dim1], &inca, &work[*n
1774 + j1], &work[j1], &ka1);
1778 /* apply rotations in 1st set from both sides to diagonal */
1781 slar2v_(&nr, &ab[ka1 + j1 * ab_dim1], &ab[ka1 + (j1 - 1) *
1782 ab_dim1], &ab[*ka + j1 * ab_dim1], &inca, &work[*n +
1783 j1], &work[j1], &ka1);
1787 /* start applying rotations in 1st set from the right */
1790 for (l = *ka - 1; l >= i__1; --l) {
1791 nrt = (j2 + l - 1) / ka1;
1792 j1t = j2 - (nrt - 1) * ka1;
1794 slartv_(&nrt, &ab[l + j1t * ab_dim1], &inca, &ab[l + 1 + (
1795 j1t - 1) * ab_dim1], &inca, &work[*n + j1t], &
1803 /* post-multiply X by product of rotations in 1st set */
1807 for (j = j1; i__4 < 0 ? j >= i__1 : j <= i__1; j += i__4) {
1808 srot_(&nx, &x[j * x_dim1 + 1], &c__1, &x[(j - 1) * x_dim1
1809 + 1], &c__1, &work[*n + j], &work[j]);
1817 if (i2 > 0 && kbt > 0) {
1819 /* create nonzero element a(i+kbt-ka-1,i+kbt) outside the */
1820 /* band and store it in WORK(m-kb+i+kbt) */
1822 work[m - *kb + i__ + kbt] = -bb[kb1 - kbt + (i__ + kbt) *
1827 for (k = *kb; k >= 1; --k) {
1830 i__3 = 2, i__4 = k + i0 - m;
1831 j2 = i__ + k + 1 - f2cmax(i__3,i__4) * ka1;
1834 i__3 = 1, i__4 = k + i0 - m;
1835 j2 = i__ + k + 1 - f2cmax(i__3,i__4) * ka1;
1838 /* finish applying rotations in 2nd set from the right */
1840 for (l = *kb - k; l >= 1; --l) {
1841 nrt = (j2 + *ka + l - 1) / ka1;
1842 j1t = j2 - (nrt - 1) * ka1;
1844 slartv_(&nrt, &ab[l + (j1t + *ka) * ab_dim1], &inca, &ab[
1845 l + 1 + (j1t + *ka - 1) * ab_dim1], &inca, &work[*
1846 n + m - *kb + j1t + *ka], &work[m - *kb + j1t + *
1851 nr = (j2 + *ka - 1) / ka1;
1852 j1 = j2 - (nr - 1) * ka1;
1855 for (j = j1; i__4 < 0 ? j >= i__3 : j <= i__3; j += i__4) {
1856 work[m - *kb + j] = work[m - *kb + j + *ka];
1857 work[*n + m - *kb + j] = work[*n + m - *kb + j + *ka];
1862 for (j = j1; i__3 < 0 ? j >= i__4 : j <= i__4; j += i__3) {
1864 /* create nonzero element a(j-1,j+ka) outside the band */
1865 /* and store it in WORK(m-kb+j) */
1867 work[m - *kb + j] *= ab[(j + *ka - 1) * ab_dim1 + 1];
1868 ab[(j + *ka - 1) * ab_dim1 + 1] = work[*n + m - *kb + j] * ab[
1869 (j + *ka - 1) * ab_dim1 + 1];
1873 if (i__ + k > ka1 && k <= kbt) {
1874 work[m - *kb + i__ + k - *ka] = work[m - *kb + i__ + k];
1880 for (k = *kb; k >= 1; --k) {
1882 i__3 = 1, i__4 = k + i0 - m;
1883 j2 = i__ + k + 1 - f2cmax(i__3,i__4) * ka1;
1884 nr = (j2 + *ka - 1) / ka1;
1885 j1 = j2 - (nr - 1) * ka1;
1888 /* generate rotations in 2nd set to annihilate elements */
1889 /* which have been created outside the band */
1891 slargv_(&nr, &ab[(j1 + *ka) * ab_dim1 + 1], &inca, &work[m - *
1892 kb + j1], &ka1, &work[*n + m - *kb + j1], &ka1);
1894 /* apply rotations in 2nd set from the left */
1897 for (l = 1; l <= i__3; ++l) {
1898 slartv_(&nr, &ab[ka1 - l + (j1 + l) * ab_dim1], &inca, &
1899 ab[*ka - l + (j1 + l) * ab_dim1], &inca, &work[*n
1900 + m - *kb + j1], &work[m - *kb + j1], &ka1);
1904 /* apply rotations in 2nd set from both sides to diagonal */
1907 slar2v_(&nr, &ab[ka1 + j1 * ab_dim1], &ab[ka1 + (j1 - 1) *
1908 ab_dim1], &ab[*ka + j1 * ab_dim1], &inca, &work[*n +
1909 m - *kb + j1], &work[m - *kb + j1], &ka1);
1913 /* start applying rotations in 2nd set from the right */
1916 for (l = *ka - 1; l >= i__3; --l) {
1917 nrt = (j2 + l - 1) / ka1;
1918 j1t = j2 - (nrt - 1) * ka1;
1920 slartv_(&nrt, &ab[l + j1t * ab_dim1], &inca, &ab[l + 1 + (
1921 j1t - 1) * ab_dim1], &inca, &work[*n + m - *kb +
1922 j1t], &work[m - *kb + j1t], &ka1);
1929 /* post-multiply X by product of rotations in 2nd set */
1933 for (j = j1; i__4 < 0 ? j >= i__3 : j <= i__3; j += i__4) {
1934 srot_(&nx, &x[j * x_dim1 + 1], &c__1, &x[(j - 1) * x_dim1
1935 + 1], &c__1, &work[*n + m - *kb + j], &work[m - *
1944 for (k = 1; k <= i__4; ++k) {
1946 i__3 = 1, i__1 = k + i0 - m + 1;
1947 j2 = i__ + k + 1 - f2cmax(i__3,i__1) * ka1;
1949 /* finish applying rotations in 1st set from the right */
1951 for (l = *kb - k; l >= 1; --l) {
1952 nrt = (j2 + l - 1) / ka1;
1953 j1t = j2 - (nrt - 1) * ka1;
1955 slartv_(&nrt, &ab[l + j1t * ab_dim1], &inca, &ab[l + 1 + (
1956 j1t - 1) * ab_dim1], &inca, &work[*n + j1t], &
1967 i__4 = f2cmin(i__3,m) - (*ka << 1) - 1;
1968 for (j = 2; j <= i__4; ++j) {
1969 work[*n + j] = work[*n + j + *ka];
1970 work[j] = work[j + *ka];
1977 /* Transform A, working with the lower triangle */
1981 /* Form inv(S(i))**T * A * inv(S(i)) */
1983 bii = bb[i__ * bb_dim1 + 1];
1985 for (j = i1; j <= i__4; ++j) {
1986 ab[i__ - j + 1 + j * ab_dim1] /= bii;
1990 i__3 = *n, i__1 = i__ + *ka;
1991 i__4 = f2cmin(i__3,i__1);
1992 for (j = i__; j <= i__4; ++j) {
1993 ab[j - i__ + 1 + i__ * ab_dim1] /= bii;
1997 for (k = i__ + 1; k <= i__4; ++k) {
1999 for (j = k; j <= i__3; ++j) {
2000 ab[j - k + 1 + k * ab_dim1] = ab[j - k + 1 + k * ab_dim1]
2001 - bb[j - i__ + 1 + i__ * bb_dim1] * ab[k - i__ +
2002 1 + i__ * ab_dim1] - bb[k - i__ + 1 + i__ *
2003 bb_dim1] * ab[j - i__ + 1 + i__ * ab_dim1] + ab[
2004 i__ * ab_dim1 + 1] * bb[j - i__ + 1 + i__ *
2005 bb_dim1] * bb[k - i__ + 1 + i__ * bb_dim1];
2009 i__1 = *n, i__2 = i__ + *ka;
2010 i__3 = f2cmin(i__1,i__2);
2011 for (j = i__ + kbt + 1; j <= i__3; ++j) {
2012 ab[j - k + 1 + k * ab_dim1] -= bb[k - i__ + 1 + i__ *
2013 bb_dim1] * ab[j - i__ + 1 + i__ * ab_dim1];
2019 for (j = i1; j <= i__4; ++j) {
2021 i__1 = j + *ka, i__2 = i__ + kbt;
2022 i__3 = f2cmin(i__1,i__2);
2023 for (k = i__ + 1; k <= i__3; ++k) {
2024 ab[k - j + 1 + j * ab_dim1] -= bb[k - i__ + 1 + i__ *
2025 bb_dim1] * ab[i__ - j + 1 + j * ab_dim1];
2033 /* post-multiply X by inv(S(i)) */
2036 sscal_(&nx, &r__1, &x[i__ * x_dim1 + 1], &c__1);
2038 sger_(&nx, &kbt, &c_b20, &x[i__ * x_dim1 + 1], &c__1, &bb[
2039 i__ * bb_dim1 + 2], &c__1, &x[(i__ + 1) * x_dim1
2044 /* store a(i,i1) in RA1 for use in next loop over K */
2046 ra1 = ab[i__ - i1 + 1 + i1 * ab_dim1];
2049 /* Generate and apply vectors of rotations to chase all the */
2050 /* existing bulges KA positions up toward the top of the band */
2053 for (k = 1; k <= i__4; ++k) {
2056 /* Determine the rotations which would annihilate the bulge */
2057 /* which has in theory just been created */
2059 if (i__ + k - ka1 > 0 && i__ + k < m) {
2061 /* generate rotation to annihilate a(i,i+k-ka-1) */
2063 slartg_(&ab[ka1 - k + (i__ + k - *ka) * ab_dim1], &ra1, &
2064 work[*n + i__ + k - *ka], &work[i__ + k - *ka], &
2067 /* create nonzero element a(i+k,i+k-ka-1) outside the */
2068 /* band and store it in WORK(m-kb+i+k) */
2070 t = -bb[k + 1 + i__ * bb_dim1] * ra1;
2071 work[m - *kb + i__ + k] = work[*n + i__ + k - *ka] * t -
2072 work[i__ + k - *ka] * ab[ka1 + (i__ + k - *ka) *
2074 ab[ka1 + (i__ + k - *ka) * ab_dim1] = work[i__ + k - *ka]
2075 * t + work[*n + i__ + k - *ka] * ab[ka1 + (i__ +
2076 k - *ka) * ab_dim1];
2081 i__3 = 1, i__1 = k + i0 - m + 1;
2082 j2 = i__ + k + 1 - f2cmax(i__3,i__1) * ka1;
2083 nr = (j2 + *ka - 1) / ka1;
2084 j1 = j2 - (nr - 1) * ka1;
2087 i__3 = j2, i__1 = i__ - (*ka << 1) + k - 1;
2088 j2t = f2cmin(i__3,i__1);
2092 nrt = (j2t + *ka - 1) / ka1;
2095 for (j = j1; i__1 < 0 ? j >= i__3 : j <= i__3; j += i__1) {
2097 /* create nonzero element a(j+ka,j-1) outside the band */
2098 /* and store it in WORK(j) */
2100 work[j] *= ab[ka1 + (j - 1) * ab_dim1];
2101 ab[ka1 + (j - 1) * ab_dim1] = work[*n + j] * ab[ka1 + (j - 1)
2106 /* generate rotations in 1st set to annihilate elements which */
2107 /* have been created outside the band */
2110 slargv_(&nrt, &ab[ka1 + j1 * ab_dim1], &inca, &work[j1], &ka1,
2111 &work[*n + j1], &ka1);
2115 /* apply rotations in 1st set from the right */
2118 for (l = 1; l <= i__1; ++l) {
2119 slartv_(&nr, &ab[l + 1 + j1 * ab_dim1], &inca, &ab[l + 2
2120 + (j1 - 1) * ab_dim1], &inca, &work[*n + j1], &
2125 /* apply rotations in 1st set from both sides to diagonal */
2128 slar2v_(&nr, &ab[j1 * ab_dim1 + 1], &ab[(j1 - 1) * ab_dim1 +
2129 1], &ab[(j1 - 1) * ab_dim1 + 2], &inca, &work[*n + j1]
2134 /* start applying rotations in 1st set from the left */
2137 for (l = *ka - 1; l >= i__1; --l) {
2138 nrt = (j2 + l - 1) / ka1;
2139 j1t = j2 - (nrt - 1) * ka1;
2141 slartv_(&nrt, &ab[ka1 - l + 1 + (j1t - ka1 + l) * ab_dim1]
2142 , &inca, &ab[ka1 - l + (j1t - ka1 + l) * ab_dim1],
2143 &inca, &work[*n + j1t], &work[j1t], &ka1);
2150 /* post-multiply X by product of rotations in 1st set */
2154 for (j = j1; i__3 < 0 ? j >= i__1 : j <= i__1; j += i__3) {
2155 srot_(&nx, &x[j * x_dim1 + 1], &c__1, &x[(j - 1) * x_dim1
2156 + 1], &c__1, &work[*n + j], &work[j]);
2164 if (i2 > 0 && kbt > 0) {
2166 /* create nonzero element a(i+kbt,i+kbt-ka-1) outside the */
2167 /* band and store it in WORK(m-kb+i+kbt) */
2169 work[m - *kb + i__ + kbt] = -bb[kbt + 1 + i__ * bb_dim1] *
2174 for (k = *kb; k >= 1; --k) {
2177 i__4 = 2, i__3 = k + i0 - m;
2178 j2 = i__ + k + 1 - f2cmax(i__4,i__3) * ka1;
2181 i__4 = 1, i__3 = k + i0 - m;
2182 j2 = i__ + k + 1 - f2cmax(i__4,i__3) * ka1;
2185 /* finish applying rotations in 2nd set from the left */
2187 for (l = *kb - k; l >= 1; --l) {
2188 nrt = (j2 + *ka + l - 1) / ka1;
2189 j1t = j2 - (nrt - 1) * ka1;
2191 slartv_(&nrt, &ab[ka1 - l + 1 + (j1t + l - 1) * ab_dim1],
2192 &inca, &ab[ka1 - l + (j1t + l - 1) * ab_dim1], &
2193 inca, &work[*n + m - *kb + j1t + *ka], &work[m - *
2194 kb + j1t + *ka], &ka1);
2198 nr = (j2 + *ka - 1) / ka1;
2199 j1 = j2 - (nr - 1) * ka1;
2202 for (j = j1; i__3 < 0 ? j >= i__4 : j <= i__4; j += i__3) {
2203 work[m - *kb + j] = work[m - *kb + j + *ka];
2204 work[*n + m - *kb + j] = work[*n + m - *kb + j + *ka];
2209 for (j = j1; i__4 < 0 ? j >= i__3 : j <= i__3; j += i__4) {
2211 /* create nonzero element a(j+ka,j-1) outside the band */
2212 /* and store it in WORK(m-kb+j) */
2214 work[m - *kb + j] *= ab[ka1 + (j - 1) * ab_dim1];
2215 ab[ka1 + (j - 1) * ab_dim1] = work[*n + m - *kb + j] * ab[ka1
2216 + (j - 1) * ab_dim1];
2220 if (i__ + k > ka1 && k <= kbt) {
2221 work[m - *kb + i__ + k - *ka] = work[m - *kb + i__ + k];
2227 for (k = *kb; k >= 1; --k) {
2229 i__4 = 1, i__3 = k + i0 - m;
2230 j2 = i__ + k + 1 - f2cmax(i__4,i__3) * ka1;
2231 nr = (j2 + *ka - 1) / ka1;
2232 j1 = j2 - (nr - 1) * ka1;
2235 /* generate rotations in 2nd set to annihilate elements */
2236 /* which have been created outside the band */
2238 slargv_(&nr, &ab[ka1 + j1 * ab_dim1], &inca, &work[m - *kb +
2239 j1], &ka1, &work[*n + m - *kb + j1], &ka1);
2241 /* apply rotations in 2nd set from the right */
2244 for (l = 1; l <= i__4; ++l) {
2245 slartv_(&nr, &ab[l + 1 + j1 * ab_dim1], &inca, &ab[l + 2
2246 + (j1 - 1) * ab_dim1], &inca, &work[*n + m - *kb
2247 + j1], &work[m - *kb + j1], &ka1);
2251 /* apply rotations in 2nd set from both sides to diagonal */
2254 slar2v_(&nr, &ab[j1 * ab_dim1 + 1], &ab[(j1 - 1) * ab_dim1 +
2255 1], &ab[(j1 - 1) * ab_dim1 + 2], &inca, &work[*n + m
2256 - *kb + j1], &work[m - *kb + j1], &ka1);
2260 /* start applying rotations in 2nd set from the left */
2263 for (l = *ka - 1; l >= i__4; --l) {
2264 nrt = (j2 + l - 1) / ka1;
2265 j1t = j2 - (nrt - 1) * ka1;
2267 slartv_(&nrt, &ab[ka1 - l + 1 + (j1t - ka1 + l) * ab_dim1]
2268 , &inca, &ab[ka1 - l + (j1t - ka1 + l) * ab_dim1],
2269 &inca, &work[*n + m - *kb + j1t], &work[m - *kb
2277 /* post-multiply X by product of rotations in 2nd set */
2281 for (j = j1; i__3 < 0 ? j >= i__4 : j <= i__4; j += i__3) {
2282 srot_(&nx, &x[j * x_dim1 + 1], &c__1, &x[(j - 1) * x_dim1
2283 + 1], &c__1, &work[*n + m - *kb + j], &work[m - *
2292 for (k = 1; k <= i__3; ++k) {
2294 i__4 = 1, i__1 = k + i0 - m + 1;
2295 j2 = i__ + k + 1 - f2cmax(i__4,i__1) * ka1;
2297 /* finish applying rotations in 1st set from the left */
2299 for (l = *kb - k; l >= 1; --l) {
2300 nrt = (j2 + l - 1) / ka1;
2301 j1t = j2 - (nrt - 1) * ka1;
2303 slartv_(&nrt, &ab[ka1 - l + 1 + (j1t - ka1 + l) * ab_dim1]
2304 , &inca, &ab[ka1 - l + (j1t - ka1 + l) * ab_dim1],
2305 &inca, &work[*n + j1t], &work[j1t], &ka1);
2315 i__3 = f2cmin(i__4,m) - (*ka << 1) - 1;
2316 for (j = 2; j <= i__3; ++j) {
2317 work[*n + j] = work[*n + j + *ka];
2318 work[j] = work[j + *ka];