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 doublereal c_b7 = 1.;
516 static doublereal c_b8 = 0.;
517 static integer c__2 = 2;
519 /* > \brief \b DLALSA computes the SVD of the coefficient matrix in compact form. Used by sgelsd. */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download DLALSA + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlalsa.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlalsa.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlalsa.
542 /* SUBROUTINE DLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, */
543 /* LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, */
544 /* GIVCOL, LDGCOL, PERM, GIVNUM, C, S, WORK, */
547 /* INTEGER ICOMPQ, INFO, LDB, LDBX, LDGCOL, LDU, N, NRHS, */
549 /* INTEGER GIVCOL( LDGCOL, * ), GIVPTR( * ), IWORK( * ), */
550 /* $ K( * ), PERM( LDGCOL, * ) */
551 /* DOUBLE PRECISION B( LDB, * ), BX( LDBX, * ), C( * ), */
552 /* $ DIFL( LDU, * ), DIFR( LDU, * ), */
553 /* $ GIVNUM( LDU, * ), POLES( LDU, * ), S( * ), */
554 /* $ U( LDU, * ), VT( LDU, * ), WORK( * ), */
558 /* > \par Purpose: */
563 /* > DLALSA is an itermediate step in solving the least squares problem */
564 /* > by computing the SVD of the coefficient matrix in compact form (The */
565 /* > singular vectors are computed as products of simple orthorgonal */
568 /* > If ICOMPQ = 0, DLALSA applies the inverse of the left singular vector */
569 /* > matrix of an upper bidiagonal matrix to the right hand side; and if */
570 /* > ICOMPQ = 1, DLALSA applies the right singular vector matrix to the */
571 /* > right hand side. The singular vector matrices were generated in */
572 /* > compact form by DLALSA. */
578 /* > \param[in] ICOMPQ */
580 /* > ICOMPQ is INTEGER */
581 /* > Specifies whether the left or the right singular vector */
582 /* > matrix is involved. */
583 /* > = 0: Left singular vector matrix */
584 /* > = 1: Right singular vector matrix */
587 /* > \param[in] SMLSIZ */
589 /* > SMLSIZ is INTEGER */
590 /* > The maximum size of the subproblems at the bottom of the */
591 /* > computation tree. */
597 /* > The row and column dimensions of the upper bidiagonal matrix. */
600 /* > \param[in] NRHS */
602 /* > NRHS is INTEGER */
603 /* > The number of columns of B and BX. NRHS must be at least 1. */
606 /* > \param[in,out] B */
608 /* > B is DOUBLE PRECISION array, dimension ( LDB, NRHS ) */
609 /* > On input, B contains the right hand sides of the least */
610 /* > squares problem in rows 1 through M. */
611 /* > On output, B contains the solution X in rows 1 through N. */
614 /* > \param[in] LDB */
616 /* > LDB is INTEGER */
617 /* > The leading dimension of B in the calling subprogram. */
618 /* > LDB must be at least f2cmax(1,MAX( M, N ) ). */
621 /* > \param[out] BX */
623 /* > BX is DOUBLE PRECISION array, dimension ( LDBX, NRHS ) */
624 /* > On exit, the result of applying the left or right singular */
625 /* > vector matrix to B. */
628 /* > \param[in] LDBX */
630 /* > LDBX is INTEGER */
631 /* > The leading dimension of BX. */
636 /* > U is DOUBLE PRECISION array, dimension ( LDU, SMLSIZ ). */
637 /* > On entry, U contains the left singular vector matrices of all */
638 /* > subproblems at the bottom level. */
641 /* > \param[in] LDU */
643 /* > LDU is INTEGER, LDU = > N. */
644 /* > The leading dimension of arrays U, VT, DIFL, DIFR, */
645 /* > POLES, GIVNUM, and Z. */
648 /* > \param[in] VT */
650 /* > VT is DOUBLE PRECISION array, dimension ( LDU, SMLSIZ+1 ). */
651 /* > On entry, VT**T contains the right singular vector matrices of */
652 /* > all subproblems at the bottom level. */
657 /* > K is INTEGER array, dimension ( N ). */
660 /* > \param[in] DIFL */
662 /* > DIFL is DOUBLE PRECISION array, dimension ( LDU, NLVL ). */
663 /* > where NLVL = INT(log_2 (N/(SMLSIZ+1))) + 1. */
666 /* > \param[in] DIFR */
668 /* > DIFR is DOUBLE PRECISION array, dimension ( LDU, 2 * NLVL ). */
669 /* > On entry, DIFL(*, I) and DIFR(*, 2 * I -1) record */
670 /* > distances between singular values on the I-th level and */
671 /* > singular values on the (I -1)-th level, and DIFR(*, 2 * I) */
672 /* > record the normalizing factors of the right singular vectors */
673 /* > matrices of subproblems on I-th level. */
678 /* > Z is DOUBLE PRECISION array, dimension ( LDU, NLVL ). */
679 /* > On entry, Z(1, I) contains the components of the deflation- */
680 /* > adjusted updating row vector for subproblems on the I-th */
684 /* > \param[in] POLES */
686 /* > POLES is DOUBLE PRECISION array, dimension ( LDU, 2 * NLVL ). */
687 /* > On entry, POLES(*, 2 * I -1: 2 * I) contains the new and old */
688 /* > singular values involved in the secular equations on the I-th */
692 /* > \param[in] GIVPTR */
694 /* > GIVPTR is INTEGER array, dimension ( N ). */
695 /* > On entry, GIVPTR( I ) records the number of Givens */
696 /* > rotations performed on the I-th problem on the computation */
700 /* > \param[in] GIVCOL */
702 /* > GIVCOL is INTEGER array, dimension ( LDGCOL, 2 * NLVL ). */
703 /* > On entry, for each I, GIVCOL(*, 2 * I - 1: 2 * I) records the */
704 /* > locations of Givens rotations performed on the I-th level on */
705 /* > the computation tree. */
708 /* > \param[in] LDGCOL */
710 /* > LDGCOL is INTEGER, LDGCOL = > N. */
711 /* > The leading dimension of arrays GIVCOL and PERM. */
714 /* > \param[in] PERM */
716 /* > PERM is INTEGER array, dimension ( LDGCOL, NLVL ). */
717 /* > On entry, PERM(*, I) records permutations done on the I-th */
718 /* > level of the computation tree. */
721 /* > \param[in] GIVNUM */
723 /* > GIVNUM is DOUBLE PRECISION array, dimension ( LDU, 2 * NLVL ). */
724 /* > On entry, GIVNUM(*, 2 *I -1 : 2 * I) records the C- and S- */
725 /* > values of Givens rotations performed on the I-th level on the */
726 /* > computation tree. */
731 /* > C is DOUBLE PRECISION array, dimension ( N ). */
732 /* > On entry, if the I-th subproblem is not square, */
733 /* > C( I ) contains the C-value of a Givens rotation related to */
734 /* > the right null space of the I-th subproblem. */
739 /* > S is DOUBLE PRECISION array, dimension ( N ). */
740 /* > On entry, if the I-th subproblem is not square, */
741 /* > S( I ) contains the S-value of a Givens rotation related to */
742 /* > the right null space of the I-th subproblem. */
745 /* > \param[out] WORK */
747 /* > WORK is DOUBLE PRECISION array, dimension (N) */
750 /* > \param[out] IWORK */
752 /* > IWORK is INTEGER array, dimension (3*N) */
755 /* > \param[out] INFO */
757 /* > INFO is INTEGER */
758 /* > = 0: successful exit. */
759 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
765 /* > \author Univ. of Tennessee */
766 /* > \author Univ. of California Berkeley */
767 /* > \author Univ. of Colorado Denver */
768 /* > \author NAG Ltd. */
770 /* > \date June 2017 */
772 /* > \ingroup doubleOTHERcomputational */
774 /* > \par Contributors: */
775 /* ================== */
777 /* > Ming Gu and Ren-Cang Li, Computer Science Division, University of */
778 /* > California at Berkeley, USA \n */
779 /* > Osni Marques, LBNL/NERSC, USA \n */
781 /* ===================================================================== */
782 /* Subroutine */ int dlalsa_(integer *icompq, integer *smlsiz, integer *n,
783 integer *nrhs, doublereal *b, integer *ldb, doublereal *bx, integer *
784 ldbx, doublereal *u, integer *ldu, doublereal *vt, integer *k,
785 doublereal *difl, doublereal *difr, doublereal *z__, doublereal *
786 poles, integer *givptr, integer *givcol, integer *ldgcol, integer *
787 perm, doublereal *givnum, doublereal *c__, doublereal *s, doublereal *
788 work, integer *iwork, integer *info)
790 /* System generated locals */
791 integer givcol_dim1, givcol_offset, perm_dim1, perm_offset, b_dim1,
792 b_offset, bx_dim1, bx_offset, difl_dim1, difl_offset, difr_dim1,
793 difr_offset, givnum_dim1, givnum_offset, poles_dim1, poles_offset,
794 u_dim1, u_offset, vt_dim1, vt_offset, z_dim1, z_offset, i__1,
797 /* Local variables */
798 integer nlvl, sqre, i__, j;
799 extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
800 integer *, doublereal *, doublereal *, integer *, doublereal *,
801 integer *, doublereal *, doublereal *, integer *);
802 integer inode, ndiml, ndimr;
803 extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
804 doublereal *, integer *);
806 extern /* Subroutine */ int dlals0_(integer *, integer *, integer *,
807 integer *, integer *, doublereal *, integer *, doublereal *,
808 integer *, integer *, integer *, integer *, integer *, doublereal
809 *, integer *, doublereal *, doublereal *, doublereal *,
810 doublereal *, integer *, doublereal *, doublereal *, doublereal *,
812 integer ic, lf, nd, ll, nl, nr;
813 extern /* Subroutine */ int dlasdt_(integer *, integer *, integer *,
814 integer *, integer *, integer *, integer *), xerbla_(char *,
816 integer im1, nlf, nrf, lvl, ndb1, nlp1, lvl2, nrp1;
819 /* -- LAPACK computational routine (version 3.7.1) -- */
820 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
821 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
825 /* ===================================================================== */
828 /* Test the input parameters. */
830 /* Parameter adjustments */
832 b_offset = 1 + b_dim1 * 1;
835 bx_offset = 1 + bx_dim1 * 1;
838 givnum_offset = 1 + givnum_dim1 * 1;
839 givnum -= givnum_offset;
841 poles_offset = 1 + poles_dim1 * 1;
842 poles -= poles_offset;
844 z_offset = 1 + z_dim1 * 1;
847 difr_offset = 1 + difr_dim1 * 1;
850 difl_offset = 1 + difl_dim1 * 1;
853 vt_offset = 1 + vt_dim1 * 1;
856 u_offset = 1 + u_dim1 * 1;
861 perm_offset = 1 + perm_dim1 * 1;
863 givcol_dim1 = *ldgcol;
864 givcol_offset = 1 + givcol_dim1 * 1;
865 givcol -= givcol_offset;
874 if (*icompq < 0 || *icompq > 1) {
876 } else if (*smlsiz < 3) {
878 } else if (*n < *smlsiz) {
880 } else if (*nrhs < 1) {
882 } else if (*ldb < *n) {
884 } else if (*ldbx < *n) {
886 } else if (*ldu < *n) {
888 } else if (*ldgcol < *n) {
893 xerbla_("DLALSA", &i__1, (ftnlen)6);
897 /* Book-keeping and setting up the computation tree. */
903 dlasdt_(n, &nlvl, &nd, &iwork[inode], &iwork[ndiml], &iwork[ndimr],
906 /* The following code applies back the left singular vector factors. */
907 /* For applying back the right singular vector factors, go to 50. */
913 /* The nodes on the bottom level of the tree were solved */
914 /* by DLASDQ. The corresponding left and right singular vector */
915 /* matrices are in explicit form. First apply back the left */
916 /* singular vector matrices. */
920 for (i__ = ndb1; i__ <= i__1; ++i__) {
922 /* IC : center row of each node */
923 /* NL : number of rows of left subproblem */
924 /* NR : number of rows of right subproblem */
925 /* NLF: starting row of the left subproblem */
926 /* NRF: starting row of the right subproblem */
929 ic = iwork[inode + i1];
930 nl = iwork[ndiml + i1];
931 nr = iwork[ndimr + i1];
934 dgemm_("T", "N", &nl, nrhs, &nl, &c_b7, &u[nlf + u_dim1], ldu, &b[nlf
935 + b_dim1], ldb, &c_b8, &bx[nlf + bx_dim1], ldbx);
936 dgemm_("T", "N", &nr, nrhs, &nr, &c_b7, &u[nrf + u_dim1], ldu, &b[nrf
937 + b_dim1], ldb, &c_b8, &bx[nrf + bx_dim1], ldbx);
941 /* Next copy the rows of B that correspond to unchanged rows */
942 /* in the bidiagonal matrix to BX. */
945 for (i__ = 1; i__ <= i__1; ++i__) {
946 ic = iwork[inode + i__ - 1];
947 dcopy_(nrhs, &b[ic + b_dim1], ldb, &bx[ic + bx_dim1], ldbx);
951 /* Finally go through the left singular vector matrices of all */
952 /* the other subproblems bottom-up on the tree. */
954 j = pow_ii(&c__2, &nlvl);
957 for (lvl = nlvl; lvl >= 1; --lvl) {
958 lvl2 = (lvl << 1) - 1;
960 /* find the first node LF and last node LL on */
961 /* the current level LVL */
968 lf = pow_ii(&c__2, &i__1);
972 for (i__ = lf; i__ <= i__1; ++i__) {
974 ic = iwork[inode + im1];
975 nl = iwork[ndiml + im1];
976 nr = iwork[ndimr + im1];
980 dlals0_(icompq, &nl, &nr, &sqre, nrhs, &bx[nlf + bx_dim1], ldbx, &
981 b[nlf + b_dim1], ldb, &perm[nlf + lvl * perm_dim1], &
982 givptr[j], &givcol[nlf + lvl2 * givcol_dim1], ldgcol, &
983 givnum[nlf + lvl2 * givnum_dim1], ldu, &poles[nlf + lvl2 *
984 poles_dim1], &difl[nlf + lvl * difl_dim1], &difr[nlf +
985 lvl2 * difr_dim1], &z__[nlf + lvl * z_dim1], &k[j], &c__[
986 j], &s[j], &work[1], info);
993 /* ICOMPQ = 1: applying back the right singular vector factors. */
997 /* First now go through the right singular vector matrices of all */
998 /* the tree nodes top-down. */
1002 for (lvl = 1; lvl <= i__1; ++lvl) {
1003 lvl2 = (lvl << 1) - 1;
1005 /* Find the first node LF and last node LL on */
1006 /* the current level LVL. */
1013 lf = pow_ii(&c__2, &i__2);
1017 for (i__ = ll; i__ >= i__2; --i__) {
1019 ic = iwork[inode + im1];
1020 nl = iwork[ndiml + im1];
1021 nr = iwork[ndimr + im1];
1030 dlals0_(icompq, &nl, &nr, &sqre, nrhs, &b[nlf + b_dim1], ldb, &bx[
1031 nlf + bx_dim1], ldbx, &perm[nlf + lvl * perm_dim1], &
1032 givptr[j], &givcol[nlf + lvl2 * givcol_dim1], ldgcol, &
1033 givnum[nlf + lvl2 * givnum_dim1], ldu, &poles[nlf + lvl2 *
1034 poles_dim1], &difl[nlf + lvl * difl_dim1], &difr[nlf +
1035 lvl2 * difr_dim1], &z__[nlf + lvl * z_dim1], &k[j], &c__[
1036 j], &s[j], &work[1], info);
1042 /* The nodes on the bottom level of the tree were solved */
1043 /* by DLASDQ. The corresponding right singular vector */
1044 /* matrices are in explicit form. Apply them back. */
1046 ndb1 = (nd + 1) / 2;
1048 for (i__ = ndb1; i__ <= i__1; ++i__) {
1050 ic = iwork[inode + i1];
1051 nl = iwork[ndiml + i1];
1052 nr = iwork[ndimr + i1];
1061 dgemm_("T", "N", &nlp1, nrhs, &nlp1, &c_b7, &vt[nlf + vt_dim1], ldu, &
1062 b[nlf + b_dim1], ldb, &c_b8, &bx[nlf + bx_dim1], ldbx);
1063 dgemm_("T", "N", &nrp1, nrhs, &nrp1, &c_b7, &vt[nrf + vt_dim1], ldu, &
1064 b[nrf + b_dim1], ldb, &c_b8, &bx[nrf + bx_dim1], ldbx);