14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
513 /* Table of constant values */
515 static integer c__10 = 10;
516 static integer c__1 = 1;
517 static integer c__2 = 2;
518 static integer c__3 = 3;
519 static integer c__4 = 4;
520 static integer c_n1 = -1;
522 /* > \brief <b> SSYEVR_2STAGE computes the eigenvalues and, optionally, the left and/or right eigenvectors for
525 /* @generated from dsyevr_2stage.f, fortran d -> s, Sat Nov 5 23:50:10 2016 */
527 /* =========== DOCUMENTATION =========== */
529 /* Online html documentation available at */
530 /* http://www.netlib.org/lapack/explore-html/ */
533 /* > Download SSYEVR_2STAGE + dependencies */
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ssyevr_
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ssyevr_
540 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ssyevr_
548 /* SUBROUTINE SSYEVR_2STAGE( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, */
549 /* IL, IU, ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, */
550 /* LWORK, IWORK, LIWORK, INFO ) */
554 /* CHARACTER JOBZ, RANGE, UPLO */
555 /* INTEGER IL, INFO, IU, LDA, LDZ, LIWORK, LWORK, M, N */
556 /* REAL ABSTOL, VL, VU */
557 /* INTEGER ISUPPZ( * ), IWORK( * ) */
558 /* REAL A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * ) */
561 /* > \par Purpose: */
566 /* > SSYEVR_2STAGE computes selected eigenvalues and, optionally, eigenvectors */
567 /* > of a real symmetric matrix A using the 2stage technique for */
568 /* > the reduction to tridiagonal. Eigenvalues and eigenvectors can be */
569 /* > selected by specifying either a range of values or a range of */
570 /* > indices for the desired eigenvalues. */
572 /* > SSYEVR_2STAGE first reduces the matrix A to tridiagonal form T with a call */
573 /* > to SSYTRD. Then, whenever possible, SSYEVR_2STAGE calls SSTEMR to compute */
574 /* > the eigenspectrum using Relatively Robust Representations. SSTEMR */
575 /* > computes eigenvalues by the dqds algorithm, while orthogonal */
576 /* > eigenvectors are computed from various "good" L D L^T representations */
577 /* > (also known as Relatively Robust Representations). Gram-Schmidt */
578 /* > orthogonalization is avoided as far as possible. More specifically, */
579 /* > the various steps of the algorithm are as follows. */
581 /* > For each unreduced block (submatrix) of T, */
582 /* > (a) Compute T - sigma I = L D L^T, so that L and D */
583 /* > define all the wanted eigenvalues to high relative accuracy. */
584 /* > This means that small relative changes in the entries of D and L */
585 /* > cause only small relative changes in the eigenvalues and */
586 /* > eigenvectors. The standard (unfactored) representation of the */
587 /* > tridiagonal matrix T does not have this property in general. */
588 /* > (b) Compute the eigenvalues to suitable accuracy. */
589 /* > If the eigenvectors are desired, the algorithm attains full */
590 /* > accuracy of the computed eigenvalues only right before */
591 /* > the corresponding vectors have to be computed, see steps c) and d). */
592 /* > (c) For each cluster of close eigenvalues, select a new */
593 /* > shift close to the cluster, find a new factorization, and refine */
594 /* > the shifted eigenvalues to suitable accuracy. */
595 /* > (d) For each eigenvalue with a large enough relative separation compute */
596 /* > the corresponding eigenvector by forming a rank revealing twisted */
597 /* > factorization. Go back to (c) for any clusters that remain. */
599 /* > The desired accuracy of the output can be specified by the input */
600 /* > parameter ABSTOL. */
602 /* > For more details, see SSTEMR's documentation and: */
603 /* > - Inderjit S. Dhillon and Beresford N. Parlett: "Multiple representations */
604 /* > to compute orthogonal eigenvectors of symmetric tridiagonal matrices," */
605 /* > Linear Algebra and its Applications, 387(1), pp. 1-28, August 2004. */
606 /* > - Inderjit Dhillon and Beresford Parlett: "Orthogonal Eigenvectors and */
607 /* > Relative Gaps," SIAM Journal on Matrix Analysis and Applications, Vol. 25, */
608 /* > 2004. Also LAPACK Working Note 154. */
609 /* > - Inderjit Dhillon: "A new O(n^2) algorithm for the symmetric */
610 /* > tridiagonal eigenvalue/eigenvector problem", */
611 /* > Computer Science Division Technical Report No. UCB/CSD-97-971, */
612 /* > UC Berkeley, May 1997. */
615 /* > Note 1 : SSYEVR_2STAGE calls SSTEMR when the full spectrum is requested */
616 /* > on machines which conform to the ieee-754 floating point standard. */
617 /* > SSYEVR_2STAGE calls SSTEBZ and SSTEIN on non-ieee machines and */
618 /* > when partial spectrum requests are made. */
620 /* > Normal execution of SSTEMR may create NaNs and infinities and */
621 /* > hence may abort due to a floating point exception in environments */
622 /* > which do not handle NaNs and infinities in the ieee standard default */
629 /* > \param[in] JOBZ */
631 /* > JOBZ is CHARACTER*1 */
632 /* > = 'N': Compute eigenvalues only; */
633 /* > = 'V': Compute eigenvalues and eigenvectors. */
634 /* > Not available in this release. */
637 /* > \param[in] RANGE */
639 /* > RANGE is CHARACTER*1 */
640 /* > = 'A': all eigenvalues will be found. */
641 /* > = 'V': all eigenvalues in the half-open interval (VL,VU] */
642 /* > will be found. */
643 /* > = 'I': the IL-th through IU-th eigenvalues will be found. */
644 /* > For RANGE = 'V' or 'I' and IU - IL < N - 1, SSTEBZ and */
645 /* > SSTEIN are called */
648 /* > \param[in] UPLO */
650 /* > UPLO is CHARACTER*1 */
651 /* > = 'U': Upper triangle of A is stored; */
652 /* > = 'L': Lower triangle of A is stored. */
658 /* > The order of the matrix A. N >= 0. */
661 /* > \param[in,out] A */
663 /* > A is REAL array, dimension (LDA, N) */
664 /* > On entry, the symmetric matrix A. If UPLO = 'U', the */
665 /* > leading N-by-N upper triangular part of A contains the */
666 /* > upper triangular part of the matrix A. If UPLO = 'L', */
667 /* > the leading N-by-N lower triangular part of A contains */
668 /* > the lower triangular part of the matrix A. */
669 /* > On exit, the lower triangle (if UPLO='L') or the upper */
670 /* > triangle (if UPLO='U') of A, including the diagonal, is */
674 /* > \param[in] LDA */
676 /* > LDA is INTEGER */
677 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
680 /* > \param[in] VL */
683 /* > If RANGE='V', the lower bound of the interval to */
684 /* > be searched for eigenvalues. VL < VU. */
685 /* > Not referenced if RANGE = 'A' or 'I'. */
688 /* > \param[in] VU */
691 /* > If RANGE='V', the upper bound of the interval to */
692 /* > be searched for eigenvalues. VL < VU. */
693 /* > Not referenced if RANGE = 'A' or 'I'. */
696 /* > \param[in] IL */
698 /* > IL is INTEGER */
699 /* > If RANGE='I', the index of the */
700 /* > smallest eigenvalue to be returned. */
701 /* > 1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0. */
702 /* > Not referenced if RANGE = 'A' or 'V'. */
705 /* > \param[in] IU */
707 /* > IU is INTEGER */
708 /* > If RANGE='I', the index of the */
709 /* > largest eigenvalue to be returned. */
710 /* > 1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0. */
711 /* > Not referenced if RANGE = 'A' or 'V'. */
714 /* > \param[in] ABSTOL */
716 /* > ABSTOL is REAL */
717 /* > The absolute error tolerance for the eigenvalues. */
718 /* > An approximate eigenvalue is accepted as converged */
719 /* > when it is determined to lie in an interval [a,b] */
720 /* > of width less than or equal to */
722 /* > ABSTOL + EPS * f2cmax( |a|,|b| ) , */
724 /* > where EPS is the machine precision. If ABSTOL is less than */
725 /* > or equal to zero, then EPS*|T| will be used in its place, */
726 /* > where |T| is the 1-norm of the tridiagonal matrix obtained */
727 /* > by reducing A to tridiagonal form. */
729 /* > See "Computing Small Singular Values of Bidiagonal Matrices */
730 /* > with Guaranteed High Relative Accuracy," by Demmel and */
731 /* > Kahan, LAPACK Working Note #3. */
733 /* > If high relative accuracy is important, set ABSTOL to */
734 /* > SLAMCH( 'Safe minimum' ). Doing so will guarantee that */
735 /* > eigenvalues are computed to high relative accuracy when */
736 /* > possible in future releases. The current code does not */
737 /* > make any guarantees about high relative accuracy, but */
738 /* > future releases will. See J. Barlow and J. Demmel, */
739 /* > "Computing Accurate Eigensystems of Scaled Diagonally */
740 /* > Dominant Matrices", LAPACK Working Note #7, for a discussion */
741 /* > of which matrices define their eigenvalues to high relative */
745 /* > \param[out] M */
748 /* > The total number of eigenvalues found. 0 <= M <= N. */
749 /* > If RANGE = 'A', M = N, and if RANGE = 'I', M = IU-IL+1. */
752 /* > \param[out] W */
754 /* > W is REAL array, dimension (N) */
755 /* > The first M elements contain the selected eigenvalues in */
756 /* > ascending order. */
759 /* > \param[out] Z */
761 /* > Z is REAL array, dimension (LDZ, f2cmax(1,M)) */
762 /* > If JOBZ = 'V', then if INFO = 0, the first M columns of Z */
763 /* > contain the orthonormal eigenvectors of the matrix A */
764 /* > corresponding to the selected eigenvalues, with the i-th */
765 /* > column of Z holding the eigenvector associated with W(i). */
766 /* > If JOBZ = 'N', then Z is not referenced. */
767 /* > Note: the user must ensure that at least f2cmax(1,M) columns are */
768 /* > supplied in the array Z; if RANGE = 'V', the exact value of M */
769 /* > is not known in advance and an upper bound must be used. */
770 /* > Supplying N columns is always safe. */
773 /* > \param[in] LDZ */
775 /* > LDZ is INTEGER */
776 /* > The leading dimension of the array Z. LDZ >= 1, and if */
777 /* > JOBZ = 'V', LDZ >= f2cmax(1,N). */
780 /* > \param[out] ISUPPZ */
782 /* > ISUPPZ is INTEGER array, dimension ( 2*f2cmax(1,M) ) */
783 /* > The support of the eigenvectors in Z, i.e., the indices */
784 /* > indicating the nonzero elements in Z. The i-th eigenvector */
785 /* > is nonzero only in elements ISUPPZ( 2*i-1 ) through */
786 /* > ISUPPZ( 2*i ). This is an output of SSTEMR (tridiagonal */
787 /* > matrix). The support of the eigenvectors of A is typically */
788 /* > 1:N because of the orthogonal transformations applied by SORMTR. */
789 /* > Implemented only for RANGE = 'A' or 'I' and IU - IL = N - 1 */
792 /* > \param[out] WORK */
794 /* > WORK is REAL array, dimension (MAX(1,LWORK)) */
795 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
798 /* > \param[in] LWORK */
800 /* > LWORK is INTEGER */
801 /* > The dimension of the array WORK. */
802 /* > If JOBZ = 'N' and N > 1, LWORK must be queried. */
803 /* > LWORK = MAX(1, 26*N, dimension) where */
804 /* > dimension = f2cmax(stage1,stage2) + (KD+1)*N + 5*N */
805 /* > = N*KD + N*f2cmax(KD+1,FACTOPTNB) */
806 /* > + f2cmax(2*KD*KD, KD*NTHREADS) */
807 /* > + (KD+1)*N + 5*N */
808 /* > where KD is the blocking size of the reduction, */
809 /* > FACTOPTNB is the blocking used by the QR or LQ */
810 /* > algorithm, usually FACTOPTNB=128 is a good choice */
811 /* > NTHREADS is the number of threads used when */
812 /* > openMP compilation is enabled, otherwise =1. */
813 /* > If JOBZ = 'V' and N > 1, LWORK must be queried. Not yet available */
815 /* > If LWORK = -1, then a workspace query is assumed; the routine */
816 /* > only calculates the optimal size of the WORK array, returns */
817 /* > this value as the first entry of the WORK array, and no error */
818 /* > message related to LWORK is issued by XERBLA. */
821 /* > \param[out] IWORK */
823 /* > IWORK is INTEGER array, dimension (MAX(1,LIWORK)) */
824 /* > On exit, if INFO = 0, IWORK(1) returns the optimal LWORK. */
827 /* > \param[in] LIWORK */
829 /* > LIWORK is INTEGER */
830 /* > The dimension of the array IWORK. LIWORK >= f2cmax(1,10*N). */
832 /* > If LIWORK = -1, then a workspace query is assumed; the */
833 /* > routine only calculates the optimal size of the IWORK array, */
834 /* > returns this value as the first entry of the IWORK array, and */
835 /* > no error message related to LIWORK is issued by XERBLA. */
838 /* > \param[out] INFO */
840 /* > INFO is INTEGER */
841 /* > = 0: successful exit */
842 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
843 /* > > 0: Internal error */
849 /* > \author Univ. of Tennessee */
850 /* > \author Univ. of California Berkeley */
851 /* > \author Univ. of Colorado Denver */
852 /* > \author NAG Ltd. */
854 /* > \date June 2016 */
856 /* > \ingroup realSYeigen */
858 /* > \par Contributors: */
859 /* ================== */
861 /* > Inderjit Dhillon, IBM Almaden, USA \n */
862 /* > Osni Marques, LBNL/NERSC, USA \n */
863 /* > Ken Stanley, Computer Science Division, University of */
864 /* > California at Berkeley, USA \n */
865 /* > Jason Riedy, Computer Science Division, University of */
866 /* > California at Berkeley, USA \n */
868 /* > \par Further Details: */
869 /* ===================== */
873 /* > All details about the 2stage techniques are available in: */
875 /* > Azzam Haidar, Hatem Ltaief, and Jack Dongarra. */
876 /* > Parallel reduction to condensed forms for symmetric eigenvalue problems */
877 /* > using aggregated fine-grained and memory-aware kernels. In Proceedings */
878 /* > of 2011 International Conference for High Performance Computing, */
879 /* > Networking, Storage and Analysis (SC '11), New York, NY, USA, */
880 /* > Article 8 , 11 pages. */
881 /* > http://doi.acm.org/10.1145/2063384.2063394 */
883 /* > A. Haidar, J. Kurzak, P. Luszczek, 2013. */
884 /* > An improved parallel singular value algorithm and its implementation */
885 /* > for multicore hardware, In Proceedings of 2013 International Conference */
886 /* > for High Performance Computing, Networking, Storage and Analysis (SC '13). */
887 /* > Denver, Colorado, USA, 2013. */
888 /* > Article 90, 12 pages. */
889 /* > http://doi.acm.org/10.1145/2503210.2503292 */
891 /* > A. Haidar, R. Solca, S. Tomov, T. Schulthess and J. Dongarra. */
892 /* > A novel hybrid CPU-GPU generalized eigensolver for electronic structure */
893 /* > calculations based on fine-grained memory aware tasks. */
894 /* > International Journal of High Performance Computing Applications. */
895 /* > Volume 28 Issue 2, Pages 196-209, May 2014. */
896 /* > http://hpc.sagepub.com/content/28/2/196 */
900 /* ===================================================================== */
901 /* Subroutine */ int ssyevr_2stage_(char *jobz, char *range, char *uplo,
902 integer *n, real *a, integer *lda, real *vl, real *vu, integer *il,
903 integer *iu, real *abstol, integer *m, real *w, real *z__, integer *
904 ldz, integer *isuppz, real *work, integer *lwork, integer *iwork,
905 integer *liwork, integer *info)
907 /* System generated locals */
908 integer a_dim1, a_offset, z_dim1, z_offset, i__1, i__2;
911 /* Local variables */
913 extern integer ilaenv2stage_(integer *, char *, char *, integer *,
914 integer *, integer *, integer *);
919 integer i__, j, inddd, indee;
921 extern logical lsame_(char *, char *);
923 extern /* Subroutine */ int sscal_(integer *, real *, real *, integer *);
925 integer indwk, lhtrd, lwmin;
928 extern /* Subroutine */ int scopy_(integer *, real *, integer *, real *,
929 integer *), sswap_(integer *, real *, integer *, real *, integer *
930 ), ssytrd_2stage_(char *, char *, integer *, real *, integer *,
931 real *, real *, real *, real *, integer *, real *, integer *,
935 logical alleig, indeig;
936 integer iscale, ieeeok, indibl, indifl;
938 extern real slamch_(char *);
940 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
941 integer *, integer *, ftnlen, ftnlen);
942 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
944 integer indtau, indisp, indiwo, indwkn, liwmin;
946 extern /* Subroutine */ int sstein_(integer *, real *, real *, integer *,
947 real *, integer *, integer *, real *, integer *, real *, integer *
948 , integer *, integer *), ssterf_(integer *, real *, real *,
950 integer llwrkn, llwork, nsplit;
952 extern real slansy_(char *, char *, integer *, real *, integer *, real *);
953 extern /* Subroutine */ int sstebz_(char *, char *, integer *, real *,
954 real *, integer *, integer *, real *, real *, real *, integer *,
955 integer *, real *, integer *, integer *, real *, integer *,
956 integer *), sstemr_(char *, char *, integer *,
957 real *, real *, real *, real *, integer *, integer *, integer *,
958 real *, real *, integer *, integer *, integer *, logical *, real *
959 , integer *, integer *, integer *, integer *);
961 extern /* Subroutine */ int sormtr_(char *, char *, char *, integer *,
962 integer *, real *, integer *, real *, real *, integer *, real *,
963 integer *, integer *);
970 /* -- LAPACK driver routine (version 3.8.0) -- */
971 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
972 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
976 /* ===================================================================== */
979 /* Test the input parameters. */
981 /* Parameter adjustments */
983 a_offset = 1 + a_dim1 * 1;
987 z_offset = 1 + z_dim1 * 1;
994 ieeeok = ilaenv_(&c__10, "SSYEVR", "N", &c__1, &c__2, &c__3, &c__4, (
995 ftnlen)6, (ftnlen)1);
997 lower = lsame_(uplo, "L");
998 wantz = lsame_(jobz, "V");
999 alleig = lsame_(range, "A");
1000 valeig = lsame_(range, "V");
1001 indeig = lsame_(range, "I");
1003 lquery = *lwork == -1 || *liwork == -1;
1005 kd = ilaenv2stage_(&c__1, "SSYTRD_2STAGE", jobz, n, &c_n1, &c_n1, &c_n1);
1006 ib = ilaenv2stage_(&c__2, "SSYTRD_2STAGE", jobz, n, &kd, &c_n1, &c_n1);
1007 lhtrd = ilaenv2stage_(&c__3, "SSYTRD_2STAGE", jobz, n, &kd, &ib, &c_n1);
1008 lwtrd = ilaenv2stage_(&c__4, "SSYTRD_2STAGE", jobz, n, &kd, &ib, &c_n1);
1010 i__1 = *n * 26, i__2 = *n * 5 + lhtrd + lwtrd;
1011 lwmin = f2cmax(i__1,i__2);
1013 i__1 = 1, i__2 = *n * 10;
1014 liwmin = f2cmax(i__1,i__2);
1017 if (! lsame_(jobz, "N")) {
1019 } else if (! (alleig || valeig || indeig)) {
1021 } else if (! (lower || lsame_(uplo, "U"))) {
1023 } else if (*n < 0) {
1025 } else if (*lda < f2cmax(1,*n)) {
1029 if (*n > 0 && *vu <= *vl) {
1032 } else if (indeig) {
1033 if (*il < 1 || *il > f2cmax(1,*n)) {
1035 } else if (*iu < f2cmin(*n,*il) || *iu > *n) {
1041 if (*ldz < 1 || wantz && *ldz < *n) {
1043 } else if (*lwork < lwmin && ! lquery) {
1045 } else if (*liwork < liwmin && ! lquery) {
1051 /* NB = ILAENV( 1, 'SSYTRD', UPLO, N, -1, -1, -1 ) */
1052 /* NB = MAX( NB, ILAENV( 1, 'SORMTR', UPLO, N, -1, -1, -1 ) ) */
1053 /* LWKOPT = MAX( ( NB+1 )*N, LWMIN ) */
1054 work[1] = (real) lwmin;
1060 xerbla_("SSYEVR_2STAGE", &i__1, (ftnlen)13);
1062 } else if (lquery) {
1066 /* Quick return if possible */
1076 if (alleig || indeig) {
1078 w[1] = a[a_dim1 + 1];
1080 if (*vl < a[a_dim1 + 1] && *vu >= a[a_dim1 + 1]) {
1082 w[1] = a[a_dim1 + 1];
1086 z__[z_dim1 + 1] = 1.f;
1093 /* Get machine constants. */
1095 safmin = slamch_("Safe minimum");
1096 eps = slamch_("Precision");
1097 smlnum = safmin / eps;
1098 bignum = 1.f / smlnum;
1099 rmin = sqrt(smlnum);
1101 r__1 = sqrt(bignum), r__2 = 1.f / sqrt(sqrt(safmin));
1102 rmax = f2cmin(r__1,r__2);
1104 /* Scale matrix to allowable range, if necessary. */
1112 anrm = slansy_("M", uplo, n, &a[a_offset], lda, &work[1]);
1113 if (anrm > 0.f && anrm < rmin) {
1115 sigma = rmin / anrm;
1116 } else if (anrm > rmax) {
1118 sigma = rmax / anrm;
1123 for (j = 1; j <= i__1; ++j) {
1125 sscal_(&i__2, &sigma, &a[j + j * a_dim1], &c__1);
1130 for (j = 1; j <= i__1; ++j) {
1131 sscal_(&j, &sigma, &a[j * a_dim1 + 1], &c__1);
1135 if (*abstol > 0.f) {
1136 abstll = *abstol * sigma;
1143 /* Initialize indices into workspaces. Note: The IWORK indices are */
1144 /* used only if SSTERF or SSTEMR fail. */
1145 /* WORK(INDTAU:INDTAU+N-1) stores the scalar factors of the */
1146 /* elementary reflectors used in SSYTRD. */
1148 /* WORK(INDD:INDD+N-1) stores the tridiagonal's diagonal entries. */
1150 /* WORK(INDE:INDE+N-1) stores the off-diagonal entries of the */
1151 /* tridiagonal matrix from SSYTRD. */
1153 /* WORK(INDDD:INDDD+N-1) is a copy of the diagonal entries over */
1154 /* -written by SSTEMR (the SSTERF path copies the diagonal to W). */
1156 /* WORK(INDEE:INDEE+N-1) is a copy of the off-diagonal entries over */
1157 /* -written while computing the eigenvalues in SSTERF and SSTEMR. */
1159 /* INDHOUS is the starting offset Householder storage of stage 2 */
1160 indhous = indee + *n;
1161 /* INDWK is the starting offset of the left-over workspace, and */
1162 /* LLWORK is the remaining workspace size. */
1163 indwk = indhous + lhtrd;
1164 llwork = *lwork - indwk + 1;
1165 /* IWORK(INDIBL:INDIBL+M-1) corresponds to IBLOCK in SSTEBZ and */
1166 /* stores the block indices of each of the M<=N eigenvalues. */
1168 /* IWORK(INDISP:INDISP+NSPLIT-1) corresponds to ISPLIT in SSTEBZ and */
1169 /* stores the starting and finishing indices of each block. */
1170 indisp = indibl + *n;
1171 /* IWORK(INDIFL:INDIFL+N-1) stores the indices of eigenvectors */
1172 /* that corresponding to eigenvectors that fail to converge in */
1173 /* SSTEIN. This information is discarded; if any fail, the driver */
1174 /* returns INFO > 0. */
1175 indifl = indisp + *n;
1176 /* INDIWO is the offset of the remaining integer workspace. */
1177 indiwo = indifl + *n;
1179 /* Call SSYTRD_2STAGE to reduce symmetric matrix to tridiagonal form. */
1182 ssytrd_2stage_(jobz, uplo, n, &a[a_offset], lda, &work[indd], &work[inde]
1183 , &work[indtau], &work[indhous], &lhtrd, &work[indwk], &llwork, &
1186 /* If all eigenvalues are desired */
1187 /* then call SSTERF or SSTEMR and SORMTR. */
1191 if (*il == 1 && *iu == *n) {
1195 if ((alleig || test) && ieeeok == 1) {
1197 scopy_(n, &work[indd], &c__1, &w[1], &c__1);
1199 scopy_(&i__1, &work[inde], &c__1, &work[indee], &c__1);
1200 ssterf_(n, &w[1], &work[indee], info);
1203 scopy_(&i__1, &work[inde], &c__1, &work[indee], &c__1);
1204 scopy_(n, &work[indd], &c__1, &work[inddd], &c__1);
1206 if (*abstol <= *n * 2.f * eps) {
1211 sstemr_(jobz, "A", n, &work[inddd], &work[indee], vl, vu, il, iu,
1212 m, &w[1], &z__[z_offset], ldz, n, &isuppz[1], &tryrac, &
1213 work[indwk], lwork, &iwork[1], liwork, info);
1217 /* Apply orthogonal matrix used in reduction to tridiagonal */
1218 /* form to eigenvectors returned by SSTEMR. */
1220 if (wantz && *info == 0) {
1222 llwrkn = *lwork - indwkn + 1;
1223 sormtr_("L", uplo, "N", n, m, &a[a_offset], lda, &work[indtau]
1224 , &z__[z_offset], ldz, &work[indwkn], &llwrkn, &iinfo);
1230 /* Everything worked. Skip SSTEBZ/SSTEIN. IWORK(:) are */
1238 /* Otherwise, call SSTEBZ and, if eigenvectors are desired, SSTEIN. */
1239 /* Also call SSTEBZ and SSTEIN if SSTEMR fails. */
1242 *(unsigned char *)order = 'B';
1244 *(unsigned char *)order = 'E';
1246 sstebz_(range, order, n, &vll, &vuu, il, iu, &abstll, &work[indd], &work[
1247 inde], m, &nsplit, &w[1], &iwork[indibl], &iwork[indisp], &work[
1248 indwk], &iwork[indiwo], info);
1251 sstein_(n, &work[indd], &work[inde], m, &w[1], &iwork[indibl], &iwork[
1252 indisp], &z__[z_offset], ldz, &work[indwk], &iwork[indiwo], &
1253 iwork[indifl], info);
1255 /* Apply orthogonal matrix used in reduction to tridiagonal */
1256 /* form to eigenvectors returned by SSTEIN. */
1259 llwrkn = *lwork - indwkn + 1;
1260 sormtr_("L", uplo, "N", n, m, &a[a_offset], lda, &work[indtau], &z__[
1261 z_offset], ldz, &work[indwkn], &llwrkn, &iinfo);
1264 /* If matrix was scaled, then rescale eigenvalues appropriately. */
1266 /* Jump here if SSTEMR/SSTEIN succeeded. */
1275 sscal_(&imax, &r__1, &w[1], &c__1);
1278 /* If eigenvalues are not in order, then sort them, along with */
1279 /* eigenvectors. Note: We do not sort the IFAIL portion of IWORK. */
1280 /* It may not be initialized (if SSTEMR/SSTEIN succeeded), and we do */
1281 /* not return this detailed information to the user. */
1285 for (j = 1; j <= i__1; ++j) {
1289 for (jj = j + 1; jj <= i__2; ++jj) {
1300 sswap_(n, &z__[i__ * z_dim1 + 1], &c__1, &z__[j * z_dim1 + 1],
1307 /* Set WORK(1) to optimal workspace size. */
1309 work[1] = (real) lwmin;
1314 /* End of SSYEVR_2STAGE */
1316 } /* ssyevr_2stage__ */