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__9 = 9;
516 static integer c__0 = 0;
517 static integer c__2 = 2;
518 static doublereal c_b23 = 1.;
519 static doublereal c_b24 = 0.;
520 static integer c__1 = 1;
522 /* > \brief \b DLAED0 used by sstedc. Computes all eigenvalues and corresponding eigenvectors of an unreduced
523 symmetric tridiagonal matrix using the divide and conquer method. */
525 /* =========== DOCUMENTATION =========== */
527 /* Online html documentation available at */
528 /* http://www.netlib.org/lapack/explore-html/ */
531 /* > Download DLAED0 + dependencies */
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlaed0.
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlaed0.
538 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlaed0.
546 /* SUBROUTINE DLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, */
547 /* WORK, IWORK, INFO ) */
549 /* INTEGER ICOMPQ, INFO, LDQ, LDQS, N, QSIZ */
550 /* INTEGER IWORK( * ) */
551 /* DOUBLE PRECISION D( * ), E( * ), Q( LDQ, * ), QSTORE( LDQS, * ), */
555 /* > \par Purpose: */
560 /* > DLAED0 computes all eigenvalues and corresponding eigenvectors of a */
561 /* > symmetric tridiagonal matrix using the divide and conquer method. */
567 /* > \param[in] ICOMPQ */
569 /* > ICOMPQ is INTEGER */
570 /* > = 0: Compute eigenvalues only. */
571 /* > = 1: Compute eigenvectors of original dense symmetric matrix */
572 /* > also. On entry, Q contains the orthogonal matrix used */
573 /* > to reduce the original matrix to tridiagonal form. */
574 /* > = 2: Compute eigenvalues and eigenvectors of tridiagonal */
578 /* > \param[in] QSIZ */
580 /* > QSIZ is INTEGER */
581 /* > The dimension of the orthogonal matrix used to reduce */
582 /* > the full matrix to tridiagonal form. QSIZ >= N if ICOMPQ = 1. */
588 /* > The dimension of the symmetric tridiagonal matrix. N >= 0. */
591 /* > \param[in,out] D */
593 /* > D is DOUBLE PRECISION array, dimension (N) */
594 /* > On entry, the main diagonal of the tridiagonal matrix. */
595 /* > On exit, its eigenvalues. */
600 /* > E is DOUBLE PRECISION array, dimension (N-1) */
601 /* > The off-diagonal elements of the tridiagonal matrix. */
602 /* > On exit, E has been destroyed. */
605 /* > \param[in,out] Q */
607 /* > Q is DOUBLE PRECISION array, dimension (LDQ, N) */
608 /* > On entry, Q must contain an N-by-N orthogonal matrix. */
609 /* > If ICOMPQ = 0 Q is not referenced. */
610 /* > If ICOMPQ = 1 On entry, Q is a subset of the columns of the */
611 /* > orthogonal matrix used to reduce the full */
612 /* > matrix to tridiagonal form corresponding to */
613 /* > the subset of the full matrix which is being */
614 /* > decomposed at this time. */
615 /* > If ICOMPQ = 2 On entry, Q will be the identity matrix. */
616 /* > On exit, Q contains the eigenvectors of the */
617 /* > tridiagonal matrix. */
620 /* > \param[in] LDQ */
622 /* > LDQ is INTEGER */
623 /* > The leading dimension of the array Q. If eigenvectors are */
624 /* > desired, then LDQ >= f2cmax(1,N). In any case, LDQ >= 1. */
627 /* > \param[out] QSTORE */
629 /* > QSTORE is DOUBLE PRECISION array, dimension (LDQS, N) */
630 /* > Referenced only when ICOMPQ = 1. Used to store parts of */
631 /* > the eigenvector matrix when the updating matrix multiplies */
635 /* > \param[in] LDQS */
637 /* > LDQS is INTEGER */
638 /* > The leading dimension of the array QSTORE. If ICOMPQ = 1, */
639 /* > then LDQS >= f2cmax(1,N). In any case, LDQS >= 1. */
642 /* > \param[out] WORK */
644 /* > WORK is DOUBLE PRECISION array, */
645 /* > If ICOMPQ = 0 or 1, the dimension of WORK must be at least */
646 /* > 1 + 3*N + 2*N*lg N + 3*N**2 */
647 /* > ( lg( N ) = smallest integer k */
648 /* > such that 2^k >= N ) */
649 /* > If ICOMPQ = 2, the dimension of WORK must be at least */
653 /* > \param[out] IWORK */
655 /* > IWORK is INTEGER array, */
656 /* > If ICOMPQ = 0 or 1, the dimension of IWORK must be at least */
657 /* > 6 + 6*N + 5*N*lg N. */
658 /* > ( lg( N ) = smallest integer k */
659 /* > such that 2^k >= N ) */
660 /* > If ICOMPQ = 2, the dimension of IWORK must be at least */
664 /* > \param[out] INFO */
666 /* > INFO is INTEGER */
667 /* > = 0: successful exit. */
668 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
669 /* > > 0: The algorithm failed to compute an eigenvalue while */
670 /* > working on the submatrix lying in rows and columns */
671 /* > INFO/(N+1) through mod(INFO,N+1). */
677 /* > \author Univ. of Tennessee */
678 /* > \author Univ. of California Berkeley */
679 /* > \author Univ. of Colorado Denver */
680 /* > \author NAG Ltd. */
682 /* > \date December 2016 */
684 /* > \ingroup auxOTHERcomputational */
686 /* > \par Contributors: */
687 /* ================== */
689 /* > Jeff Rutter, Computer Science Division, University of California */
690 /* > at Berkeley, USA */
692 /* ===================================================================== */
693 /* Subroutine */ int dlaed0_(integer *icompq, integer *qsiz, integer *n,
694 doublereal *d__, doublereal *e, doublereal *q, integer *ldq,
695 doublereal *qstore, integer *ldqs, doublereal *work, integer *iwork,
698 /* System generated locals */
699 integer q_dim1, q_offset, qstore_dim1, qstore_offset, i__1, i__2;
702 /* Local variables */
704 integer curr, i__, j, k;
705 extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
706 integer *, doublereal *, doublereal *, integer *, doublereal *,
707 integer *, doublereal *, doublereal *, integer *);
709 extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
710 doublereal *, integer *);
711 integer indxq, iwrem;
712 extern /* Subroutine */ int dlaed1_(integer *, doublereal *, doublereal *,
713 integer *, integer *, doublereal *, integer *, doublereal *,
714 integer *, integer *);
716 extern /* Subroutine */ int dlaed7_(integer *, integer *, integer *,
717 integer *, integer *, integer *, doublereal *, doublereal *,
718 integer *, integer *, doublereal *, integer *, doublereal *,
719 integer *, integer *, integer *, integer *, integer *, doublereal
720 *, doublereal *, integer *, integer *);
722 extern /* Subroutine */ int dlacpy_(char *, integer *, integer *,
723 doublereal *, integer *, doublereal *, integer *);
725 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
726 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
727 integer *, integer *, ftnlen, ftnlen);
728 integer igivnm, submat, curprb, subpbs, igivpt;
729 extern /* Subroutine */ int dsteqr_(char *, integer *, doublereal *,
730 doublereal *, doublereal *, integer *, doublereal *, integer *);
731 integer curlvl, matsiz, iprmpt, smlsiz, lgn, msd2, smm1, spm1, spm2;
734 /* -- LAPACK computational routine (version 3.7.0) -- */
735 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
736 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
740 /* ===================================================================== */
743 /* Test the input parameters. */
745 /* Parameter adjustments */
749 q_offset = 1 + q_dim1 * 1;
752 qstore_offset = 1 + qstore_dim1 * 1;
753 qstore -= qstore_offset;
760 if (*icompq < 0 || *icompq > 2) {
762 } else if (*icompq == 1 && *qsiz < f2cmax(0,*n)) {
766 } else if (*ldq < f2cmax(1,*n)) {
768 } else if (*ldqs < f2cmax(1,*n)) {
773 xerbla_("DLAED0", &i__1, (ftnlen)6);
777 /* Quick return if possible */
783 smlsiz = ilaenv_(&c__9, "DLAED0", " ", &c__0, &c__0, &c__0, &c__0, (
784 ftnlen)6, (ftnlen)1);
786 /* Determine the size and placement of the submatrices, and save in */
787 /* the leading elements of IWORK. */
793 if (iwork[subpbs] > smlsiz) {
794 for (j = subpbs; j >= 1; --j) {
795 iwork[j * 2] = (iwork[j] + 1) / 2;
796 iwork[(j << 1) - 1] = iwork[j] / 2;
804 for (j = 2; j <= i__1; ++j) {
805 iwork[j] += iwork[j - 1];
809 /* Divide the matrix into SUBPBS submatrices of size at most SMLSIZ+1 */
810 /* using rank-1 modifications (cuts). */
814 for (i__ = 1; i__ <= i__1; ++i__) {
815 submat = iwork[i__] + 1;
817 d__[smm1] -= (d__1 = e[smm1], abs(d__1));
818 d__[submat] -= (d__1 = e[smm1], abs(d__1));
822 indxq = (*n << 2) + 3;
825 /* Set up workspaces for eigenvalues only/accumulate new vectors */
828 temp = log((doublereal) (*n)) / log(2.);
829 lgn = (integer) temp;
830 if (pow_ii(&c__2, &lgn) < *n) {
833 if (pow_ii(&c__2, &lgn) < *n) {
836 iprmpt = indxq + *n + 1;
837 iperm = iprmpt + *n * lgn;
838 iqptr = iperm + *n * lgn;
839 igivpt = iqptr + *n + 2;
840 igivcl = igivpt + *n * lgn;
843 iq = igivnm + (*n << 1) * lgn;
844 /* Computing 2nd power */
846 iwrem = iq + i__1 * i__1 + 1;
848 /* Initialize pointers */
851 for (i__ = 0; i__ <= i__1; ++i__) {
852 iwork[iprmpt + i__] = 1;
853 iwork[igivpt + i__] = 1;
859 /* Solve each submatrix eigenproblem at the bottom of the divide and */
864 for (i__ = 0; i__ <= i__1; ++i__) {
869 submat = iwork[i__] + 1;
870 matsiz = iwork[i__ + 1] - iwork[i__];
873 dsteqr_("I", &matsiz, &d__[submat], &e[submat], &q[submat +
874 submat * q_dim1], ldq, &work[1], info);
879 dsteqr_("I", &matsiz, &d__[submat], &e[submat], &work[iq - 1 +
880 iwork[iqptr + curr]], &matsiz, &work[1], info);
885 dgemm_("N", "N", qsiz, &matsiz, &matsiz, &c_b23, &q[submat *
886 q_dim1 + 1], ldq, &work[iq - 1 + iwork[iqptr + curr]],
887 &matsiz, &c_b24, &qstore[submat * qstore_dim1 + 1],
890 /* Computing 2nd power */
892 iwork[iqptr + curr + 1] = iwork[iqptr + curr] + i__2 * i__2;
896 i__2 = iwork[i__ + 1];
897 for (j = submat; j <= i__2; ++j) {
898 iwork[indxq + j] = k;
905 /* Successively merge eigensystems of adjacent submatrices */
906 /* into eigensystem for the corresponding larger matrix. */
908 /* while ( SUBPBS > 1 ) */
915 for (i__ = 0; i__ <= i__1; i__ += 2) {
922 submat = iwork[i__] + 1;
923 matsiz = iwork[i__ + 2] - iwork[i__];
928 /* Merge lower order eigensystems (of size MSD2 and MATSIZ - MSD2) */
929 /* into an eigensystem of size MATSIZ. */
930 /* DLAED1 is used only for the full eigensystem of a tridiagonal */
932 /* DLAED7 handles the cases in which eigenvalues only or eigenvalues */
933 /* and eigenvectors of a full symmetric matrix (which was reduced to */
934 /* tridiagonal form) are desired. */
937 dlaed1_(&matsiz, &d__[submat], &q[submat + submat * q_dim1],
938 ldq, &iwork[indxq + submat], &e[submat + msd2 - 1], &
939 msd2, &work[1], &iwork[subpbs + 1], info);
941 dlaed7_(icompq, &matsiz, qsiz, &tlvls, &curlvl, &curprb, &d__[
942 submat], &qstore[submat * qstore_dim1 + 1], ldqs, &
943 iwork[indxq + submat], &e[submat + msd2 - 1], &msd2, &
944 work[iq], &iwork[iqptr], &iwork[iprmpt], &iwork[iperm]
945 , &iwork[igivpt], &iwork[igivcl], &work[igivnm], &
946 work[iwrem], &iwork[subpbs + 1], info);
951 iwork[i__ / 2 + 1] = iwork[i__ + 2];
961 /* Re-merge the eigenvalues/vectors which were deflated at the final */
966 for (i__ = 1; i__ <= i__1; ++i__) {
967 j = iwork[indxq + i__];
969 dcopy_(qsiz, &qstore[j * qstore_dim1 + 1], &c__1, &q[i__ * q_dim1
973 dcopy_(n, &work[1], &c__1, &d__[1], &c__1);
974 } else if (*icompq == 2) {
976 for (i__ = 1; i__ <= i__1; ++i__) {
977 j = iwork[indxq + i__];
979 dcopy_(n, &q[j * q_dim1 + 1], &c__1, &work[*n * i__ + 1], &c__1);
982 dcopy_(n, &work[1], &c__1, &d__[1], &c__1);
983 dlacpy_("A", n, n, &work[*n + 1], n, &q[q_offset], ldq);
986 for (i__ = 1; i__ <= i__1; ++i__) {
987 j = iwork[indxq + i__];
991 dcopy_(n, &work[1], &c__1, &d__[1], &c__1);
996 *info = submat * (*n + 1) + submat + matsiz - 1;