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 /* > \brief \b DLAEBZ computes the number of eigenvalues of a real symmetric tridiagonal matrix which are less
514 than or equal to a given value, and performs other tasks required by the routine sstebz. */
516 /* =========== DOCUMENTATION =========== */
518 /* Online html documentation available at */
519 /* http://www.netlib.org/lapack/explore-html/ */
522 /* > Download DLAEBZ + dependencies */
523 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlaebz.
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlaebz.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlaebz.
537 /* SUBROUTINE DLAEBZ( IJOB, NITMAX, N, MMAX, MINP, NBMIN, ABSTOL, */
538 /* RELTOL, PIVMIN, D, E, E2, NVAL, AB, C, MOUT, */
539 /* NAB, WORK, IWORK, INFO ) */
541 /* INTEGER IJOB, INFO, MINP, MMAX, MOUT, N, NBMIN, NITMAX */
542 /* DOUBLE PRECISION ABSTOL, PIVMIN, RELTOL */
543 /* INTEGER IWORK( * ), NAB( MMAX, * ), NVAL( * ) */
544 /* DOUBLE PRECISION AB( MMAX, * ), C( * ), D( * ), E( * ), E2( * ), */
548 /* > \par Purpose: */
553 /* > DLAEBZ contains the iteration loops which compute and use the */
554 /* > function N(w), which is the count of eigenvalues of a symmetric */
555 /* > tridiagonal matrix T less than or equal to its argument w. It */
556 /* > performs a choice of two types of loops: */
558 /* > IJOB=1, followed by */
559 /* > IJOB=2: It takes as input a list of intervals and returns a list of */
560 /* > sufficiently small intervals whose union contains the same */
561 /* > eigenvalues as the union of the original intervals. */
562 /* > The input intervals are (AB(j,1),AB(j,2)], j=1,...,MINP. */
563 /* > The output interval (AB(j,1),AB(j,2)] will contain */
564 /* > eigenvalues NAB(j,1)+1,...,NAB(j,2), where 1 <= j <= MOUT. */
566 /* > IJOB=3: It performs a binary search in each input interval */
567 /* > (AB(j,1),AB(j,2)] for a point w(j) such that */
568 /* > N(w(j))=NVAL(j), and uses C(j) as the starting point of */
569 /* > the search. If such a w(j) is found, then on output */
570 /* > AB(j,1)=AB(j,2)=w. If no such w(j) is found, then on output */
571 /* > (AB(j,1),AB(j,2)] will be a small interval containing the */
572 /* > point where N(w) jumps through NVAL(j), unless that point */
573 /* > lies outside the initial interval. */
575 /* > Note that the intervals are in all cases half-open intervals, */
576 /* > i.e., of the form (a,b] , which includes b but not a . */
578 /* > To avoid underflow, the matrix should be scaled so that its largest */
579 /* > element is no greater than overflow**(1/2) * underflow**(1/4) */
580 /* > in absolute value. To assure the most accurate computation */
581 /* > of small eigenvalues, the matrix should be scaled to be */
582 /* > not much smaller than that, either. */
584 /* > See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal */
585 /* > Matrix", Report CS41, Computer Science Dept., Stanford */
586 /* > University, July 21, 1966 */
588 /* > Note: the arguments are, in general, *not* checked for unreasonable */
595 /* > \param[in] IJOB */
597 /* > IJOB is INTEGER */
598 /* > Specifies what is to be done: */
599 /* > = 1: Compute NAB for the initial intervals. */
600 /* > = 2: Perform bisection iteration to find eigenvalues of T. */
601 /* > = 3: Perform bisection iteration to invert N(w), i.e., */
602 /* > to find a point which has a specified number of */
603 /* > eigenvalues of T to its left. */
604 /* > Other values will cause DLAEBZ to return with INFO=-1. */
607 /* > \param[in] NITMAX */
609 /* > NITMAX is INTEGER */
610 /* > The maximum number of "levels" of bisection to be */
611 /* > performed, i.e., an interval of width W will not be made */
612 /* > smaller than 2^(-NITMAX) * W. If not all intervals */
613 /* > have converged after NITMAX iterations, then INFO is set */
614 /* > to the number of non-converged intervals. */
620 /* > The dimension n of the tridiagonal matrix T. It must be at */
624 /* > \param[in] MMAX */
626 /* > MMAX is INTEGER */
627 /* > The maximum number of intervals. If more than MMAX intervals */
628 /* > are generated, then DLAEBZ will quit with INFO=MMAX+1. */
631 /* > \param[in] MINP */
633 /* > MINP is INTEGER */
634 /* > The initial number of intervals. It may not be greater than */
638 /* > \param[in] NBMIN */
640 /* > NBMIN is INTEGER */
641 /* > The smallest number of intervals that should be processed */
642 /* > using a vector loop. If zero, then only the scalar loop */
643 /* > will be used. */
646 /* > \param[in] ABSTOL */
648 /* > ABSTOL is DOUBLE PRECISION */
649 /* > The minimum (absolute) width of an interval. When an */
650 /* > interval is narrower than ABSTOL, or than RELTOL times the */
651 /* > larger (in magnitude) endpoint, then it is considered to be */
652 /* > sufficiently small, i.e., converged. This must be at least */
656 /* > \param[in] RELTOL */
658 /* > RELTOL is DOUBLE PRECISION */
659 /* > The minimum relative width of an interval. When an interval */
660 /* > is narrower than ABSTOL, or than RELTOL times the larger (in */
661 /* > magnitude) endpoint, then it is considered to be */
662 /* > sufficiently small, i.e., converged. Note: this should */
663 /* > always be at least radix*machine epsilon. */
666 /* > \param[in] PIVMIN */
668 /* > PIVMIN is DOUBLE PRECISION */
669 /* > The minimum absolute value of a "pivot" in the Sturm */
670 /* > sequence loop. */
671 /* > This must be at least f2cmax |e(j)**2|*safe_min and at */
672 /* > least safe_min, where safe_min is at least */
673 /* > the smallest number that can divide one without overflow. */
678 /* > D is DOUBLE PRECISION array, dimension (N) */
679 /* > The diagonal elements of the tridiagonal matrix T. */
684 /* > E is DOUBLE PRECISION array, dimension (N) */
685 /* > The offdiagonal elements of the tridiagonal matrix T in */
686 /* > positions 1 through N-1. E(N) is arbitrary. */
689 /* > \param[in] E2 */
691 /* > E2 is DOUBLE PRECISION array, dimension (N) */
692 /* > The squares of the offdiagonal elements of the tridiagonal */
693 /* > matrix T. E2(N) is ignored. */
696 /* > \param[in,out] NVAL */
698 /* > NVAL is INTEGER array, dimension (MINP) */
699 /* > If IJOB=1 or 2, not referenced. */
700 /* > If IJOB=3, the desired values of N(w). The elements of NVAL */
701 /* > will be reordered to correspond with the intervals in AB. */
702 /* > Thus, NVAL(j) on output will not, in general be the same as */
703 /* > NVAL(j) on input, but it will correspond with the interval */
704 /* > (AB(j,1),AB(j,2)] on output. */
707 /* > \param[in,out] AB */
709 /* > AB is DOUBLE PRECISION array, dimension (MMAX,2) */
710 /* > The endpoints of the intervals. AB(j,1) is a(j), the left */
711 /* > endpoint of the j-th interval, and AB(j,2) is b(j), the */
712 /* > right endpoint of the j-th interval. The input intervals */
713 /* > will, in general, be modified, split, and reordered by the */
717 /* > \param[in,out] C */
719 /* > C is DOUBLE PRECISION array, dimension (MMAX) */
720 /* > If IJOB=1, ignored. */
721 /* > If IJOB=2, workspace. */
722 /* > If IJOB=3, then on input C(j) should be initialized to the */
723 /* > first search point in the binary search. */
726 /* > \param[out] MOUT */
728 /* > MOUT is INTEGER */
729 /* > If IJOB=1, the number of eigenvalues in the intervals. */
730 /* > If IJOB=2 or 3, the number of intervals output. */
731 /* > If IJOB=3, MOUT will equal MINP. */
734 /* > \param[in,out] NAB */
736 /* > NAB is INTEGER array, dimension (MMAX,2) */
737 /* > If IJOB=1, then on output NAB(i,j) will be set to N(AB(i,j)). */
738 /* > If IJOB=2, then on input, NAB(i,j) should be set. It must */
739 /* > satisfy the condition: */
740 /* > N(AB(i,1)) <= NAB(i,1) <= NAB(i,2) <= N(AB(i,2)), */
741 /* > which means that in interval i only eigenvalues */
742 /* > NAB(i,1)+1,...,NAB(i,2) will be considered. Usually, */
743 /* > NAB(i,j)=N(AB(i,j)), from a previous call to DLAEBZ with */
745 /* > On output, NAB(i,j) will contain */
746 /* > f2cmax(na(k),f2cmin(nb(k),N(AB(i,j)))), where k is the index of */
747 /* > the input interval that the output interval */
748 /* > (AB(j,1),AB(j,2)] came from, and na(k) and nb(k) are the */
749 /* > the input values of NAB(k,1) and NAB(k,2). */
750 /* > If IJOB=3, then on output, NAB(i,j) contains N(AB(i,j)), */
751 /* > unless N(w) > NVAL(i) for all search points w , in which */
752 /* > case NAB(i,1) will not be modified, i.e., the output */
753 /* > value will be the same as the input value (modulo */
754 /* > reorderings -- see NVAL and AB), or unless N(w) < NVAL(i) */
755 /* > for all search points w , in which case NAB(i,2) will */
756 /* > not be modified. Normally, NAB should be set to some */
757 /* > distinctive value(s) before DLAEBZ is called. */
760 /* > \param[out] WORK */
762 /* > WORK is DOUBLE PRECISION array, dimension (MMAX) */
766 /* > \param[out] IWORK */
768 /* > IWORK is INTEGER array, dimension (MMAX) */
772 /* > \param[out] INFO */
774 /* > INFO is INTEGER */
775 /* > = 0: All intervals converged. */
776 /* > = 1--MMAX: The last INFO intervals did not converge. */
777 /* > = MMAX+1: More than MMAX intervals were generated. */
783 /* > \author Univ. of Tennessee */
784 /* > \author Univ. of California Berkeley */
785 /* > \author Univ. of Colorado Denver */
786 /* > \author NAG Ltd. */
788 /* > \date December 2016 */
790 /* > \ingroup OTHERauxiliary */
792 /* > \par Further Details: */
793 /* ===================== */
797 /* > This routine is intended to be called only by other LAPACK */
798 /* > routines, thus the interface is less user-friendly. It is intended */
799 /* > for two purposes: */
801 /* > (a) finding eigenvalues. In this case, DLAEBZ should have one or */
802 /* > more initial intervals set up in AB, and DLAEBZ should be called */
803 /* > with IJOB=1. This sets up NAB, and also counts the eigenvalues. */
804 /* > Intervals with no eigenvalues would usually be thrown out at */
805 /* > this point. Also, if not all the eigenvalues in an interval i */
806 /* > are desired, NAB(i,1) can be increased or NAB(i,2) decreased. */
807 /* > For example, set NAB(i,1)=NAB(i,2)-1 to get the largest */
808 /* > eigenvalue. DLAEBZ is then called with IJOB=2 and MMAX */
809 /* > no smaller than the value of MOUT returned by the call with */
810 /* > IJOB=1. After this (IJOB=2) call, eigenvalues NAB(i,1)+1 */
811 /* > through NAB(i,2) are approximately AB(i,1) (or AB(i,2)) to the */
812 /* > tolerance specified by ABSTOL and RELTOL. */
814 /* > (b) finding an interval (a',b'] containing eigenvalues w(f),...,w(l). */
815 /* > In this case, start with a Gershgorin interval (a,b). Set up */
816 /* > AB to contain 2 search intervals, both initially (a,b). One */
817 /* > NVAL element should contain f-1 and the other should contain l */
818 /* > , while C should contain a and b, resp. NAB(i,1) should be -1 */
819 /* > and NAB(i,2) should be N+1, to flag an error if the desired */
820 /* > interval does not lie in (a,b). DLAEBZ is then called with */
821 /* > IJOB=3. On exit, if w(f-1) < w(f), then one of the intervals -- */
822 /* > j -- will have AB(j,1)=AB(j,2) and NAB(j,1)=NAB(j,2)=f-1, while */
823 /* > if, to the specified tolerance, w(f-k)=...=w(f+r), k > 0 and r */
824 /* > >= 0, then the interval will have N(AB(j,1))=NAB(j,1)=f-k and */
825 /* > N(AB(j,2))=NAB(j,2)=f+r. The cases w(l) < w(l+1) and */
826 /* > w(l-r)=...=w(l+k) are handled similarly. */
829 /* ===================================================================== */
830 /* Subroutine */ int dlaebz_(integer *ijob, integer *nitmax, integer *n,
831 integer *mmax, integer *minp, integer *nbmin, doublereal *abstol,
832 doublereal *reltol, doublereal *pivmin, doublereal *d__, doublereal *
833 e, doublereal *e2, integer *nval, doublereal *ab, doublereal *c__,
834 integer *mout, integer *nab, doublereal *work, integer *iwork,
837 /* System generated locals */
838 integer nab_dim1, nab_offset, ab_dim1, ab_offset, i__1, i__2, i__3, i__4,
840 doublereal d__1, d__2, d__3, d__4;
842 /* Local variables */
843 integer itmp1, itmp2, j, kfnew, klnew, kf, ji, kl, jp, jit;
844 doublereal tmp1, tmp2;
847 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
848 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
849 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
853 /* ===================================================================== */
856 /* Check for Errors */
858 /* Parameter adjustments */
860 nab_offset = 1 + nab_dim1 * 1;
863 ab_offset = 1 + ab_dim1 * 1;
875 if (*ijob < 1 || *ijob > 3) {
884 /* Compute the number of eigenvalues in the initial intervals. */
888 for (ji = 1; ji <= i__1; ++ji) {
889 for (jp = 1; jp <= 2; ++jp) {
890 tmp1 = d__[1] - ab[ji + jp * ab_dim1];
891 if (abs(tmp1) < *pivmin) {
894 nab[ji + jp * nab_dim1] = 0;
896 nab[ji + jp * nab_dim1] = 1;
900 for (j = 2; j <= i__2; ++j) {
901 tmp1 = d__[j] - e2[j - 1] / tmp1 - ab[ji + jp * ab_dim1];
902 if (abs(tmp1) < *pivmin) {
906 ++nab[ji + jp * nab_dim1];
912 *mout = *mout + nab[ji + (nab_dim1 << 1)] - nab[ji + nab_dim1];
918 /* Initialize for loop */
920 /* KF and KL have the following meaning: */
921 /* Intervals 1,...,KF-1 have converged. */
922 /* Intervals KF,...,KL still need to be refined. */
927 /* If IJOB=2, initialize C. */
928 /* If IJOB=3, use the user-supplied starting point. */
932 for (ji = 1; ji <= i__1; ++ji) {
933 c__[ji] = (ab[ji + ab_dim1] + ab[ji + (ab_dim1 << 1)]) * .5;
941 for (jit = 1; jit <= i__1; ++jit) {
943 /* Loop over intervals */
945 if (kl - kf + 1 >= *nbmin && *nbmin > 0) {
947 /* Begin of Parallel Version of the loop */
950 for (ji = kf; ji <= i__2; ++ji) {
952 /* Compute N(c), the number of eigenvalues less than c */
954 work[ji] = d__[1] - c__[ji];
956 if (work[ji] <= *pivmin) {
959 d__1 = work[ji], d__2 = -(*pivmin);
960 work[ji] = f2cmin(d__1,d__2);
964 for (j = 2; j <= i__3; ++j) {
965 work[ji] = d__[j] - e2[j - 1] / work[ji] - c__[ji];
966 if (work[ji] <= *pivmin) {
969 d__1 = work[ji], d__2 = -(*pivmin);
970 work[ji] = f2cmin(d__1,d__2);
979 /* IJOB=2: Choose all intervals containing eigenvalues. */
983 for (ji = kf; ji <= i__2; ++ji) {
985 /* Insure that N(w) is monotone */
989 i__5 = nab[ji + nab_dim1], i__6 = iwork[ji];
990 i__3 = nab[ji + (nab_dim1 << 1)], i__4 = f2cmax(i__5,i__6);
991 iwork[ji] = f2cmin(i__3,i__4);
993 /* Update the Queue -- add intervals if both halves */
994 /* contain eigenvalues. */
996 if (iwork[ji] == nab[ji + (nab_dim1 << 1)]) {
998 /* No eigenvalue in the upper interval: */
999 /* just use the lower interval. */
1001 ab[ji + (ab_dim1 << 1)] = c__[ji];
1003 } else if (iwork[ji] == nab[ji + nab_dim1]) {
1005 /* No eigenvalue in the lower interval: */
1006 /* just use the upper interval. */
1008 ab[ji + ab_dim1] = c__[ji];
1011 if (klnew <= *mmax) {
1013 /* Eigenvalue in both intervals -- add upper to */
1016 ab[klnew + (ab_dim1 << 1)] = ab[ji + (ab_dim1 <<
1018 nab[klnew + (nab_dim1 << 1)] = nab[ji + (nab_dim1
1020 ab[klnew + ab_dim1] = c__[ji];
1021 nab[klnew + nab_dim1] = iwork[ji];
1022 ab[ji + (ab_dim1 << 1)] = c__[ji];
1023 nab[ji + (nab_dim1 << 1)] = iwork[ji];
1036 /* IJOB=3: Binary search. Keep only the interval containing */
1037 /* w s.t. N(w) = NVAL */
1040 for (ji = kf; ji <= i__2; ++ji) {
1041 if (iwork[ji] <= nval[ji]) {
1042 ab[ji + ab_dim1] = c__[ji];
1043 nab[ji + nab_dim1] = iwork[ji];
1045 if (iwork[ji] >= nval[ji]) {
1046 ab[ji + (ab_dim1 << 1)] = c__[ji];
1047 nab[ji + (nab_dim1 << 1)] = iwork[ji];
1055 /* End of Parallel Version of the loop */
1057 /* Begin of Serial Version of the loop */
1061 for (ji = kf; ji <= i__2; ++ji) {
1063 /* Compute N(w), the number of eigenvalues less than w */
1066 tmp2 = d__[1] - tmp1;
1068 if (tmp2 <= *pivmin) {
1071 d__1 = tmp2, d__2 = -(*pivmin);
1072 tmp2 = f2cmin(d__1,d__2);
1076 for (j = 2; j <= i__3; ++j) {
1077 tmp2 = d__[j] - e2[j - 1] / tmp2 - tmp1;
1078 if (tmp2 <= *pivmin) {
1081 d__1 = tmp2, d__2 = -(*pivmin);
1082 tmp2 = f2cmin(d__1,d__2);
1089 /* IJOB=2: Choose all intervals containing eigenvalues. */
1091 /* Insure that N(w) is monotone */
1095 i__5 = nab[ji + nab_dim1];
1096 i__3 = nab[ji + (nab_dim1 << 1)], i__4 = f2cmax(i__5,itmp1);
1097 itmp1 = f2cmin(i__3,i__4);
1099 /* Update the Queue -- add intervals if both halves */
1100 /* contain eigenvalues. */
1102 if (itmp1 == nab[ji + (nab_dim1 << 1)]) {
1104 /* No eigenvalue in the upper interval: */
1105 /* just use the lower interval. */
1107 ab[ji + (ab_dim1 << 1)] = tmp1;
1109 } else if (itmp1 == nab[ji + nab_dim1]) {
1111 /* No eigenvalue in the lower interval: */
1112 /* just use the upper interval. */
1114 ab[ji + ab_dim1] = tmp1;
1115 } else if (klnew < *mmax) {
1117 /* Eigenvalue in both intervals -- add upper to queue. */
1120 ab[klnew + (ab_dim1 << 1)] = ab[ji + (ab_dim1 << 1)];
1121 nab[klnew + (nab_dim1 << 1)] = nab[ji + (nab_dim1 <<
1123 ab[klnew + ab_dim1] = tmp1;
1124 nab[klnew + nab_dim1] = itmp1;
1125 ab[ji + (ab_dim1 << 1)] = tmp1;
1126 nab[ji + (nab_dim1 << 1)] = itmp1;
1133 /* IJOB=3: Binary search. Keep only the interval */
1134 /* containing w s.t. N(w) = NVAL */
1136 if (itmp1 <= nval[ji]) {
1137 ab[ji + ab_dim1] = tmp1;
1138 nab[ji + nab_dim1] = itmp1;
1140 if (itmp1 >= nval[ji]) {
1141 ab[ji + (ab_dim1 << 1)] = tmp1;
1142 nab[ji + (nab_dim1 << 1)] = itmp1;
1151 /* Check for convergence */
1155 for (ji = kf; ji <= i__2; ++ji) {
1156 tmp1 = (d__1 = ab[ji + (ab_dim1 << 1)] - ab[ji + ab_dim1], abs(
1159 d__3 = (d__1 = ab[ji + (ab_dim1 << 1)], abs(d__1)), d__4 = (d__2 =
1160 ab[ji + ab_dim1], abs(d__2));
1161 tmp2 = f2cmax(d__3,d__4);
1163 d__1 = f2cmax(*abstol,*pivmin), d__2 = *reltol * tmp2;
1164 if (tmp1 < f2cmax(d__1,d__2) || nab[ji + nab_dim1] >= nab[ji + (
1167 /* Converged -- Swap with position KFNEW, */
1168 /* then increment KFNEW */
1171 tmp1 = ab[ji + ab_dim1];
1172 tmp2 = ab[ji + (ab_dim1 << 1)];
1173 itmp1 = nab[ji + nab_dim1];
1174 itmp2 = nab[ji + (nab_dim1 << 1)];
1175 ab[ji + ab_dim1] = ab[kfnew + ab_dim1];
1176 ab[ji + (ab_dim1 << 1)] = ab[kfnew + (ab_dim1 << 1)];
1177 nab[ji + nab_dim1] = nab[kfnew + nab_dim1];
1178 nab[ji + (nab_dim1 << 1)] = nab[kfnew + (nab_dim1 << 1)];
1179 ab[kfnew + ab_dim1] = tmp1;
1180 ab[kfnew + (ab_dim1 << 1)] = tmp2;
1181 nab[kfnew + nab_dim1] = itmp1;
1182 nab[kfnew + (nab_dim1 << 1)] = itmp2;
1185 nval[ji] = nval[kfnew];
1186 nval[kfnew] = itmp1;
1195 /* Choose Midpoints */
1198 for (ji = kf; ji <= i__2; ++ji) {
1199 c__[ji] = (ab[ji + ab_dim1] + ab[ji + (ab_dim1 << 1)]) * .5;
1203 /* If no more intervals to refine, quit. */
1216 *info = f2cmax(i__1,0);