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__1 = 1;
517 /* > \brief \b SLASD7 merges the two sets of singular values together into a single sorted set. Then it tries
518 to deflate the size of the problem. Used by sbdsdc. */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download SLASD7 + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slasd7.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slasd7.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slasd7.
541 /* SUBROUTINE SLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL, */
542 /* VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ, */
543 /* PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, */
546 /* INTEGER GIVPTR, ICOMPQ, INFO, K, LDGCOL, LDGNUM, NL, */
548 /* REAL ALPHA, BETA, C, S */
549 /* INTEGER GIVCOL( LDGCOL, * ), IDX( * ), IDXP( * ), */
550 /* $ IDXQ( * ), PERM( * ) */
551 /* REAL D( * ), DSIGMA( * ), GIVNUM( LDGNUM, * ), */
552 /* $ VF( * ), VFW( * ), VL( * ), VLW( * ), Z( * ), */
556 /* > \par Purpose: */
561 /* > SLASD7 merges the two sets of singular values together into a single */
562 /* > sorted set. Then it tries to deflate the size of the problem. There */
563 /* > are two ways in which deflation can occur: when two or more singular */
564 /* > values are close together or if there is a tiny entry in the Z */
565 /* > vector. For each such occurrence the order of the related */
566 /* > secular equation problem is reduced by one. */
568 /* > SLASD7 is called from SLASD6. */
574 /* > \param[in] ICOMPQ */
576 /* > ICOMPQ is INTEGER */
577 /* > Specifies whether singular vectors are to be computed */
578 /* > in compact form, as follows: */
579 /* > = 0: Compute singular values only. */
580 /* > = 1: Compute singular vectors of upper */
581 /* > bidiagonal matrix in compact form. */
584 /* > \param[in] NL */
586 /* > NL is INTEGER */
587 /* > The row dimension of the upper block. NL >= 1. */
590 /* > \param[in] NR */
592 /* > NR is INTEGER */
593 /* > The row dimension of the lower block. NR >= 1. */
596 /* > \param[in] SQRE */
598 /* > SQRE is INTEGER */
599 /* > = 0: the lower block is an NR-by-NR square matrix. */
600 /* > = 1: the lower block is an NR-by-(NR+1) rectangular matrix. */
602 /* > The bidiagonal matrix has */
603 /* > N = NL + NR + 1 rows and */
604 /* > M = N + SQRE >= N columns. */
607 /* > \param[out] K */
610 /* > Contains the dimension of the non-deflated matrix, this is */
611 /* > the order of the related secular equation. 1 <= K <=N. */
614 /* > \param[in,out] D */
616 /* > D is REAL array, dimension ( N ) */
617 /* > On entry D contains the singular values of the two submatrices */
618 /* > to be combined. On exit D contains the trailing (N-K) updated */
619 /* > singular values (those which were deflated) sorted into */
620 /* > increasing order. */
623 /* > \param[out] Z */
625 /* > Z is REAL array, dimension ( M ) */
626 /* > On exit Z contains the updating row vector in the secular */
630 /* > \param[out] ZW */
632 /* > ZW is REAL array, dimension ( M ) */
633 /* > Workspace for Z. */
636 /* > \param[in,out] VF */
638 /* > VF is REAL array, dimension ( M ) */
639 /* > On entry, VF(1:NL+1) contains the first components of all */
640 /* > right singular vectors of the upper block; and VF(NL+2:M) */
641 /* > contains the first components of all right singular vectors */
642 /* > of the lower block. On exit, VF contains the first components */
643 /* > of all right singular vectors of the bidiagonal matrix. */
646 /* > \param[out] VFW */
648 /* > VFW is REAL array, dimension ( M ) */
649 /* > Workspace for VF. */
652 /* > \param[in,out] VL */
654 /* > VL is REAL array, dimension ( M ) */
655 /* > On entry, VL(1:NL+1) contains the last components of all */
656 /* > right singular vectors of the upper block; and VL(NL+2:M) */
657 /* > contains the last components of all right singular vectors */
658 /* > of the lower block. On exit, VL contains the last components */
659 /* > of all right singular vectors of the bidiagonal matrix. */
662 /* > \param[out] VLW */
664 /* > VLW is REAL array, dimension ( M ) */
665 /* > Workspace for VL. */
668 /* > \param[in] ALPHA */
670 /* > ALPHA is REAL */
671 /* > Contains the diagonal element associated with the added row. */
674 /* > \param[in] BETA */
677 /* > Contains the off-diagonal element associated with the added */
681 /* > \param[out] DSIGMA */
683 /* > DSIGMA is REAL array, dimension ( N ) */
684 /* > Contains a copy of the diagonal elements (K-1 singular values */
685 /* > and one zero) in the secular equation. */
688 /* > \param[out] IDX */
690 /* > IDX is INTEGER array, dimension ( N ) */
691 /* > This will contain the permutation used to sort the contents of */
692 /* > D into ascending order. */
695 /* > \param[out] IDXP */
697 /* > IDXP is INTEGER array, dimension ( N ) */
698 /* > This will contain the permutation used to place deflated */
699 /* > values of D at the end of the array. On output IDXP(2:K) */
700 /* > points to the nondeflated D-values and IDXP(K+1:N) */
701 /* > points to the deflated singular values. */
704 /* > \param[in] IDXQ */
706 /* > IDXQ is INTEGER array, dimension ( N ) */
707 /* > This contains the permutation which separately sorts the two */
708 /* > sub-problems in D into ascending order. Note that entries in */
709 /* > the first half of this permutation must first be moved one */
710 /* > position backward; and entries in the second half */
711 /* > must first have NL+1 added to their values. */
714 /* > \param[out] PERM */
716 /* > PERM is INTEGER array, dimension ( N ) */
717 /* > The permutations (from deflation and sorting) to be applied */
718 /* > to each singular block. Not referenced if ICOMPQ = 0. */
721 /* > \param[out] GIVPTR */
723 /* > GIVPTR is INTEGER */
724 /* > The number of Givens rotations which took place in this */
725 /* > subproblem. Not referenced if ICOMPQ = 0. */
728 /* > \param[out] GIVCOL */
730 /* > GIVCOL is INTEGER array, dimension ( LDGCOL, 2 ) */
731 /* > Each pair of numbers indicates a pair of columns to take place */
732 /* > in a Givens rotation. Not referenced if ICOMPQ = 0. */
735 /* > \param[in] LDGCOL */
737 /* > LDGCOL is INTEGER */
738 /* > The leading dimension of GIVCOL, must be at least N. */
741 /* > \param[out] GIVNUM */
743 /* > GIVNUM is REAL array, dimension ( LDGNUM, 2 ) */
744 /* > Each number indicates the C or S value to be used in the */
745 /* > corresponding Givens rotation. Not referenced if ICOMPQ = 0. */
748 /* > \param[in] LDGNUM */
750 /* > LDGNUM is INTEGER */
751 /* > The leading dimension of GIVNUM, must be at least N. */
754 /* > \param[out] C */
757 /* > C contains garbage if SQRE =0 and the C-value of a Givens */
758 /* > rotation related to the right null space if SQRE = 1. */
761 /* > \param[out] S */
764 /* > S contains garbage if SQRE =0 and the S-value of a Givens */
765 /* > rotation related to the right null space if SQRE = 1. */
768 /* > \param[out] INFO */
770 /* > INFO is INTEGER */
771 /* > = 0: successful exit. */
772 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
778 /* > \author Univ. of Tennessee */
779 /* > \author Univ. of California Berkeley */
780 /* > \author Univ. of Colorado Denver */
781 /* > \author NAG Ltd. */
783 /* > \date December 2016 */
785 /* > \ingroup OTHERauxiliary */
787 /* > \par Contributors: */
788 /* ================== */
790 /* > Ming Gu and Huan Ren, Computer Science Division, University of */
791 /* > California at Berkeley, USA */
793 /* ===================================================================== */
794 /* Subroutine */ int slasd7_(integer *icompq, integer *nl, integer *nr,
795 integer *sqre, integer *k, real *d__, real *z__, real *zw, real *vf,
796 real *vfw, real *vl, real *vlw, real *alpha, real *beta, real *dsigma,
797 integer *idx, integer *idxp, integer *idxq, integer *perm, integer *
798 givptr, integer *givcol, integer *ldgcol, real *givnum, integer *
799 ldgnum, real *c__, real *s, integer *info)
801 /* System generated locals */
802 integer givcol_dim1, givcol_offset, givnum_dim1, givnum_offset, i__1;
805 /* Local variables */
807 extern /* Subroutine */ int srot_(integer *, real *, integer *, real *,
808 integer *, real *, real *);
809 integer i__, j, m, n, idxjp, jprev, k2;
810 extern /* Subroutine */ int scopy_(integer *, real *, integer *, real *,
813 extern real slapy2_(real *, real *);
815 extern real slamch_(char *);
816 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), slamrg_(
817 integer *, integer *, real *, integer *, integer *, integer *);
818 real hlftol, eps, tau, tol;
822 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
823 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
824 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
828 /* ===================================================================== */
832 /* Test the input parameters. */
834 /* Parameter adjustments */
847 givcol_dim1 = *ldgcol;
848 givcol_offset = 1 + givcol_dim1 * 1;
849 givcol -= givcol_offset;
850 givnum_dim1 = *ldgnum;
851 givnum_offset = 1 + givnum_dim1 * 1;
852 givnum -= givnum_offset;
859 if (*icompq < 0 || *icompq > 1) {
861 } else if (*nl < 1) {
863 } else if (*nr < 1) {
865 } else if (*sqre < 0 || *sqre > 1) {
867 } else if (*ldgcol < n) {
869 } else if (*ldgnum < n) {
874 xerbla_("SLASD7", &i__1, (ftnlen)6);
884 /* Generate the first part of the vector Z and move the singular */
885 /* values in the first part of D one position backward. */
887 z1 = *alpha * vl[nlp1];
890 for (i__ = *nl; i__ >= 1; --i__) {
891 z__[i__ + 1] = *alpha * vl[i__];
893 vf[i__ + 1] = vf[i__];
894 d__[i__ + 1] = d__[i__];
895 idxq[i__ + 1] = idxq[i__] + 1;
900 /* Generate the second part of the vector Z. */
903 for (i__ = nlp2; i__ <= i__1; ++i__) {
904 z__[i__] = *beta * vf[i__];
909 /* Sort the singular values into increasing order */
912 for (i__ = nlp2; i__ <= i__1; ++i__) {
917 /* DSIGMA, IDXC, IDXC, and ZW are used as storage space. */
920 for (i__ = 2; i__ <= i__1; ++i__) {
921 dsigma[i__] = d__[idxq[i__]];
922 zw[i__] = z__[idxq[i__]];
923 vfw[i__] = vf[idxq[i__]];
924 vlw[i__] = vl[idxq[i__]];
928 slamrg_(nl, nr, &dsigma[2], &c__1, &c__1, &idx[2]);
931 for (i__ = 2; i__ <= i__1; ++i__) {
933 d__[i__] = dsigma[idxi];
940 /* Calculate the allowable deflation tolerance */
942 eps = slamch_("Epsilon");
944 r__1 = abs(*alpha), r__2 = abs(*beta);
945 tol = f2cmax(r__1,r__2);
947 r__2 = (r__1 = d__[n], abs(r__1));
948 tol = eps * 64.f * f2cmax(r__2,tol);
950 /* There are 2 kinds of deflation -- first a value in the z-vector */
951 /* is small, second two (or more) singular values are very close */
952 /* together (their difference is small). */
954 /* If the value in the z-vector is small, we simply permute the */
955 /* array so that the corresponding singular value is moved to the */
958 /* If two values in the D-vector are close, we perform a two-sided */
959 /* rotation designed to make one of the corresponding z-vector */
960 /* entries zero, and then permute the array so that the deflated */
961 /* singular value is moved to the end. */
963 /* If there are multiple singular values then the problem deflates. */
964 /* Here the number of equal singular values are found. As each equal */
965 /* singular value is found, an elementary reflector is computed to */
966 /* rotate the corresponding singular subspace so that the */
967 /* corresponding components of Z are zero in this new basis. */
972 for (j = 2; j <= i__1; ++j) {
973 if ((r__1 = z__[j], abs(r__1)) <= tol) {
975 /* Deflate due to small z component. */
995 if ((r__1 = z__[j], abs(r__1)) <= tol) {
997 /* Deflate due to small z component. */
1003 /* Check if singular values are close enough to allow deflation. */
1005 if ((r__1 = d__[j] - d__[jprev], abs(r__1)) <= tol) {
1007 /* Deflation is possible. */
1012 /* Find sqrt(a**2+b**2) without overflow or */
1013 /* destructive underflow. */
1015 tau = slapy2_(c__, s);
1021 /* Record the appropriate Givens rotation */
1025 idxjp = idxq[idx[jprev] + 1];
1026 idxj = idxq[idx[j] + 1];
1027 if (idxjp <= nlp1) {
1033 givcol[*givptr + (givcol_dim1 << 1)] = idxjp;
1034 givcol[*givptr + givcol_dim1] = idxj;
1035 givnum[*givptr + (givnum_dim1 << 1)] = *c__;
1036 givnum[*givptr + givnum_dim1] = *s;
1038 srot_(&c__1, &vf[jprev], &c__1, &vf[j], &c__1, c__, s);
1039 srot_(&c__1, &vl[jprev], &c__1, &vl[j], &c__1, c__, s);
1045 zw[*k] = z__[jprev];
1046 dsigma[*k] = d__[jprev];
1054 /* Record the last singular value. */
1057 zw[*k] = z__[jprev];
1058 dsigma[*k] = d__[jprev];
1063 /* Sort the singular values into DSIGMA. The singular values which */
1064 /* were not deflated go into the first K slots of DSIGMA, except */
1065 /* that DSIGMA(1) is treated separately. */
1068 for (j = 2; j <= i__1; ++j) {
1070 dsigma[j] = d__[jp];
1077 for (j = 2; j <= i__1; ++j) {
1079 perm[j] = idxq[idx[jp] + 1];
1080 if (perm[j] <= nlp1) {
1087 /* The deflated singular values go back into the last N - K slots of */
1091 scopy_(&i__1, &dsigma[*k + 1], &c__1, &d__[*k + 1], &c__1);
1093 /* Determine DSIGMA(1), DSIGMA(2), Z(1), VF(1), VL(1), VF(M), and */
1098 if (abs(dsigma[2]) <= hlftol) {
1102 z__[1] = slapy2_(&z1, &z__[m]);
1103 if (z__[1] <= tol) {
1109 *s = -z__[m] / z__[1];
1111 srot_(&c__1, &vf[m], &c__1, &vf[1], &c__1, c__, s);
1112 srot_(&c__1, &vl[m], &c__1, &vl[1], &c__1, c__, s);
1114 if (abs(z1) <= tol) {
1121 /* Restore Z, VF, and VL. */
1124 scopy_(&i__1, &zw[2], &c__1, &z__[2], &c__1);
1126 scopy_(&i__1, &vfw[2], &c__1, &vf[2], &c__1);
1128 scopy_(&i__1, &vlw[2], &c__1, &vl[2], &c__1);