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> SGGSVD computes the singular value decomposition (SVD) for OTHER matrices</b> */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download SGGSVD + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sggsvd.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sggsvd.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sggsvd.
540 /* SUBROUTINE SGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, */
541 /* LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, */
544 /* CHARACTER JOBQ, JOBU, JOBV */
545 /* INTEGER INFO, K, L, LDA, LDB, LDQ, LDU, LDV, M, N, P */
546 /* INTEGER IWORK( * ) */
547 /* REAL A( LDA, * ), ALPHA( * ), B( LDB, * ), */
548 /* $ BETA( * ), Q( LDQ, * ), U( LDU, * ), */
549 /* $ V( LDV, * ), WORK( * ) */
552 /* > \par Purpose: */
557 /* > This routine is deprecated and has been replaced by routine SGGSVD3. */
559 /* > SGGSVD computes the generalized singular value decomposition (GSVD) */
560 /* > of an M-by-N real matrix A and P-by-N real matrix B: */
562 /* > U**T*A*Q = D1*( 0 R ), V**T*B*Q = D2*( 0 R ) */
564 /* > where U, V and Q are orthogonal matrices. */
565 /* > Let K+L = the effective numerical rank of the matrix (A**T,B**T)**T, */
566 /* > then R is a K+L-by-K+L nonsingular upper triangular matrix, D1 and */
567 /* > D2 are M-by-(K+L) and P-by-(K+L) "diagonal" matrices and of the */
568 /* > following structures, respectively: */
570 /* > If M-K-L >= 0, */
573 /* > D1 = K ( I 0 ) */
575 /* > M-K-L ( 0 0 ) */
578 /* > D2 = L ( 0 S ) */
582 /* > ( 0 R ) = K ( 0 R11 R12 ) */
583 /* > L ( 0 0 R22 ) */
587 /* > C = diag( ALPHA(K+1), ... , ALPHA(K+L) ), */
588 /* > S = diag( BETA(K+1), ... , BETA(K+L) ), */
589 /* > C**2 + S**2 = I. */
591 /* > R is stored in A(1:K+L,N-K-L+1:N) on exit. */
593 /* > If M-K-L < 0, */
596 /* > D1 = K ( I 0 0 ) */
597 /* > M-K ( 0 C 0 ) */
600 /* > D2 = M-K ( 0 S 0 ) */
601 /* > K+L-M ( 0 0 I ) */
602 /* > P-L ( 0 0 0 ) */
604 /* > N-K-L K M-K K+L-M */
605 /* > ( 0 R ) = K ( 0 R11 R12 R13 ) */
606 /* > M-K ( 0 0 R22 R23 ) */
607 /* > K+L-M ( 0 0 0 R33 ) */
611 /* > C = diag( ALPHA(K+1), ... , ALPHA(M) ), */
612 /* > S = diag( BETA(K+1), ... , BETA(M) ), */
613 /* > C**2 + S**2 = I. */
615 /* > (R11 R12 R13 ) is stored in A(1:M, N-K-L+1:N), and R33 is stored */
616 /* > ( 0 R22 R23 ) */
617 /* > in B(M-K+1:L,N+M-K-L+1:N) on exit. */
619 /* > The routine computes C, S, R, and optionally the orthogonal */
620 /* > transformation matrices U, V and Q. */
622 /* > In particular, if B is an N-by-N nonsingular matrix, then the GSVD of */
623 /* > A and B implicitly gives the SVD of A*inv(B): */
624 /* > A*inv(B) = U*(D1*inv(D2))*V**T. */
625 /* > If ( A**T,B**T)**T has orthonormal columns, then the GSVD of A and B is */
626 /* > also equal to the CS decomposition of A and B. Furthermore, the GSVD */
627 /* > can be used to derive the solution of the eigenvalue problem: */
628 /* > A**T*A x = lambda* B**T*B x. */
629 /* > In some literature, the GSVD of A and B is presented in the form */
630 /* > U**T*A*X = ( 0 D1 ), V**T*B*X = ( 0 D2 ) */
631 /* > where U and V are orthogonal and X is nonsingular, D1 and D2 are */
632 /* > ``diagonal''. The former GSVD form can be converted to the latter */
633 /* > form by taking the nonsingular matrix X as */
635 /* > X = Q*( I 0 ) */
636 /* > ( 0 inv(R) ). */
642 /* > \param[in] JOBU */
644 /* > JOBU is CHARACTER*1 */
645 /* > = 'U': Orthogonal matrix U is computed; */
646 /* > = 'N': U is not computed. */
649 /* > \param[in] JOBV */
651 /* > JOBV is CHARACTER*1 */
652 /* > = 'V': Orthogonal matrix V is computed; */
653 /* > = 'N': V is not computed. */
656 /* > \param[in] JOBQ */
658 /* > JOBQ is CHARACTER*1 */
659 /* > = 'Q': Orthogonal matrix Q is computed; */
660 /* > = 'N': Q is not computed. */
666 /* > The number of rows of the matrix A. M >= 0. */
672 /* > The number of columns of the matrices A and B. N >= 0. */
678 /* > The number of rows of the matrix B. P >= 0. */
681 /* > \param[out] K */
686 /* > \param[out] L */
690 /* > On exit, K and L specify the dimension of the subblocks */
691 /* > described in Purpose. */
692 /* > K + L = effective numerical rank of (A**T,B**T)**T. */
695 /* > \param[in,out] A */
697 /* > A is REAL array, dimension (LDA,N) */
698 /* > On entry, the M-by-N matrix A. */
699 /* > On exit, A contains the triangular matrix R, or part of R. */
700 /* > See Purpose for details. */
703 /* > \param[in] LDA */
705 /* > LDA is INTEGER */
706 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
709 /* > \param[in,out] B */
711 /* > B is REAL array, dimension (LDB,N) */
712 /* > On entry, the P-by-N matrix B. */
713 /* > On exit, B contains the triangular matrix R if M-K-L < 0. */
714 /* > See Purpose for details. */
717 /* > \param[in] LDB */
719 /* > LDB is INTEGER */
720 /* > The leading dimension of the array B. LDB >= f2cmax(1,P). */
723 /* > \param[out] ALPHA */
725 /* > ALPHA is REAL array, dimension (N) */
728 /* > \param[out] BETA */
730 /* > BETA is REAL array, dimension (N) */
732 /* > On exit, ALPHA and BETA contain the generalized singular */
733 /* > value pairs of A and B; */
734 /* > ALPHA(1:K) = 1, */
735 /* > BETA(1:K) = 0, */
736 /* > and if M-K-L >= 0, */
737 /* > ALPHA(K+1:K+L) = C, */
738 /* > BETA(K+1:K+L) = S, */
739 /* > or if M-K-L < 0, */
740 /* > ALPHA(K+1:M)=C, ALPHA(M+1:K+L)=0 */
741 /* > BETA(K+1:M) =S, BETA(M+1:K+L) =1 */
743 /* > ALPHA(K+L+1:N) = 0 */
744 /* > BETA(K+L+1:N) = 0 */
747 /* > \param[out] U */
749 /* > U is REAL array, dimension (LDU,M) */
750 /* > If JOBU = 'U', U contains the M-by-M orthogonal matrix U. */
751 /* > If JOBU = 'N', U is not referenced. */
754 /* > \param[in] LDU */
756 /* > LDU is INTEGER */
757 /* > The leading dimension of the array U. LDU >= f2cmax(1,M) if */
758 /* > JOBU = 'U'; LDU >= 1 otherwise. */
761 /* > \param[out] V */
763 /* > V is REAL array, dimension (LDV,P) */
764 /* > If JOBV = 'V', V contains the P-by-P orthogonal matrix V. */
765 /* > If JOBV = 'N', V is not referenced. */
768 /* > \param[in] LDV */
770 /* > LDV is INTEGER */
771 /* > The leading dimension of the array V. LDV >= f2cmax(1,P) if */
772 /* > JOBV = 'V'; LDV >= 1 otherwise. */
775 /* > \param[out] Q */
777 /* > Q is REAL array, dimension (LDQ,N) */
778 /* > If JOBQ = 'Q', Q contains the N-by-N orthogonal matrix Q. */
779 /* > If JOBQ = 'N', Q is not referenced. */
782 /* > \param[in] LDQ */
784 /* > LDQ is INTEGER */
785 /* > The leading dimension of the array Q. LDQ >= f2cmax(1,N) if */
786 /* > JOBQ = 'Q'; LDQ >= 1 otherwise. */
789 /* > \param[out] WORK */
791 /* > WORK is REAL array, */
792 /* > dimension (f2cmax(3*N,M,P)+N) */
795 /* > \param[out] IWORK */
797 /* > IWORK is INTEGER array, dimension (N) */
798 /* > On exit, IWORK stores the sorting information. More */
799 /* > precisely, the following loop will sort ALPHA */
800 /* > for I = K+1, f2cmin(M,K+L) */
801 /* > swap ALPHA(I) and ALPHA(IWORK(I)) */
803 /* > such that ALPHA(1) >= ALPHA(2) >= ... >= ALPHA(N). */
806 /* > \param[out] INFO */
808 /* > INFO is INTEGER */
809 /* > = 0: successful exit */
810 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
811 /* > > 0: if INFO = 1, the Jacobi-type procedure failed to */
812 /* > converge. For further details, see subroutine STGSJA. */
815 /* > \par Internal Parameters: */
816 /* ========================= */
821 /* > TOLA and TOLB are the thresholds to determine the effective */
822 /* > rank of (A**T,B**T)**T. Generally, they are set to */
823 /* > TOLA = MAX(M,N)*norm(A)*MACHEPS, */
824 /* > TOLB = MAX(P,N)*norm(B)*MACHEPS. */
825 /* > The size of TOLA and TOLB may affect the size of backward */
826 /* > errors of the decomposition. */
832 /* > \author Univ. of Tennessee */
833 /* > \author Univ. of California Berkeley */
834 /* > \author Univ. of Colorado Denver */
835 /* > \author NAG Ltd. */
837 /* > \date December 2016 */
839 /* > \ingroup realOTHERsing */
841 /* > \par Contributors: */
842 /* ================== */
844 /* > Ming Gu and Huan Ren, Computer Science Division, University of */
845 /* > California at Berkeley, USA */
847 /* ===================================================================== */
848 /* Subroutine */ int sggsvd_(char *jobu, char *jobv, char *jobq, integer *m,
849 integer *n, integer *p, integer *k, integer *l, real *a, integer *lda,
850 real *b, integer *ldb, real *alpha, real *beta, real *u, integer *
851 ldu, real *v, integer *ldv, real *q, integer *ldq, real *work,
852 integer *iwork, integer *info)
854 /* System generated locals */
855 integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, u_dim1,
856 u_offset, v_dim1, v_offset, i__1, i__2;
858 /* Local variables */
862 real tolb, unfl, temp, smax;
863 integer ncallmycycle, i__, j;
864 extern logical lsame_(char *, char *);
867 extern /* Subroutine */ int scopy_(integer *, real *, integer *, real *,
869 logical wantu, wantv;
870 extern real slamch_(char *), slange_(char *, integer *, integer *,
871 real *, integer *, real *);
872 extern /* Subroutine */ int xerbla_(char *, integer *), stgsja_(
873 char *, char *, char *, integer *, integer *, integer *, integer *
874 , integer *, real *, integer *, real *, integer *, real *, real *,
875 real *, real *, real *, integer *, real *, integer *, real *,
876 integer *, real *, integer *, integer *),
877 sggsvp_(char *, char *, char *, integer *, integer *, integer *,
878 real *, integer *, real *, integer *, real *, real *, integer *,
879 integer *, real *, integer *, real *, integer *, real *, integer *
880 , integer *, real *, real *, integer *);
884 /* -- LAPACK driver routine (version 3.7.0) -- */
885 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
886 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
890 /* ===================================================================== */
893 /* Test the input parameters */
895 /* Parameter adjustments */
897 a_offset = 1 + a_dim1 * 1;
900 b_offset = 1 + b_dim1 * 1;
905 u_offset = 1 + u_dim1 * 1;
908 v_offset = 1 + v_dim1 * 1;
911 q_offset = 1 + q_dim1 * 1;
917 wantu = lsame_(jobu, "U");
918 wantv = lsame_(jobv, "V");
919 wantq = lsame_(jobq, "Q");
922 if (! (wantu || lsame_(jobu, "N"))) {
924 } else if (! (wantv || lsame_(jobv, "N"))) {
926 } else if (! (wantq || lsame_(jobq, "N"))) {
934 } else if (*lda < f2cmax(1,*m)) {
936 } else if (*ldb < f2cmax(1,*p)) {
938 } else if (*ldu < 1 || wantu && *ldu < *m) {
940 } else if (*ldv < 1 || wantv && *ldv < *p) {
942 } else if (*ldq < 1 || wantq && *ldq < *n) {
947 xerbla_("SGGSVD", &i__1);
951 /* Compute the Frobenius norm of matrices A and B */
953 anorm = slange_("1", m, n, &a[a_offset], lda, &work[1]);
954 bnorm = slange_("1", p, n, &b[b_offset], ldb, &work[1]);
956 /* Get machine precision and set up threshold for determining */
957 /* the effective numerical rank of the matrices A and B. */
959 ulp = slamch_("Precision");
960 unfl = slamch_("Safe Minimum");
961 tola = f2cmax(*m,*n) * f2cmax(anorm,unfl) * ulp;
962 tolb = f2cmax(*p,*n) * f2cmax(bnorm,unfl) * ulp;
966 sggsvp_(jobu, jobv, jobq, m, p, n, &a[a_offset], lda, &b[b_offset], ldb, &
967 tola, &tolb, k, l, &u[u_offset], ldu, &v[v_offset], ldv, &q[
968 q_offset], ldq, &iwork[1], &work[1], &work[*n + 1], info);
970 /* Compute the GSVD of two upper "triangular" matrices */
972 stgsja_(jobu, jobv, jobq, m, p, n, k, l, &a[a_offset], lda, &b[b_offset],
973 ldb, &tola, &tolb, &alpha[1], &beta[1], &u[u_offset], ldu, &v[
974 v_offset], ldv, &q[q_offset], ldq, &work[1], &ncallmycycle, info);
976 /* Sort the singular values and store the pivot indices in IWORK */
977 /* Copy ALPHA to WORK, then sort ALPHA in WORK */
979 scopy_(n, &alpha[1], &c__1, &work[1], &c__1);
981 i__1 = *l, i__2 = *m - *k;
982 ibnd = f2cmin(i__1,i__2);
984 for (i__ = 1; i__ <= i__1; ++i__) {
986 /* Scan for largest ALPHA(K+I) */
989 smax = work[*k + i__];
991 for (j = i__ + 1; j <= i__2; ++j) {
1000 work[*k + isub] = work[*k + i__];
1001 work[*k + i__] = smax;
1002 iwork[*k + i__] = *k + isub;
1004 iwork[*k + i__] = *k + i__;