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 real c_b12 = 0.f;
516 static real c_b22 = 1.f;
518 /* > \brief \b SGGSVP */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download SGGSVP + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sggsvp.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sggsvp.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sggsvp.
541 /* SUBROUTINE SGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, */
542 /* TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, */
543 /* IWORK, TAU, WORK, INFO ) */
545 /* CHARACTER JOBQ, JOBU, JOBV */
546 /* INTEGER INFO, K, L, LDA, LDB, LDQ, LDU, LDV, M, N, P */
547 /* REAL TOLA, TOLB */
548 /* INTEGER IWORK( * ) */
549 /* REAL A( LDA, * ), B( LDB, * ), Q( LDQ, * ), */
550 /* $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) */
553 /* > \par Purpose: */
558 /* > This routine is deprecated and has been replaced by routine SGGSVP3. */
560 /* > SGGSVP computes orthogonal matrices U, V and Q such that */
563 /* > U**T*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0; */
564 /* > L ( 0 0 A23 ) */
565 /* > M-K-L ( 0 0 0 ) */
568 /* > = K ( 0 A12 A13 ) if M-K-L < 0; */
569 /* > M-K ( 0 0 A23 ) */
572 /* > V**T*B*Q = L ( 0 0 B13 ) */
573 /* > P-L ( 0 0 0 ) */
575 /* > where the K-by-K matrix A12 and L-by-L matrix B13 are nonsingular */
576 /* > upper triangular; A23 is L-by-L upper triangular if M-K-L >= 0, */
577 /* > otherwise A23 is (M-K)-by-L upper trapezoidal. K+L = the effective */
578 /* > numerical rank of the (M+P)-by-N matrix (A**T,B**T)**T. */
580 /* > This decomposition is the preprocessing step for computing the */
581 /* > Generalized Singular Value Decomposition (GSVD), see subroutine */
588 /* > \param[in] JOBU */
590 /* > JOBU is CHARACTER*1 */
591 /* > = 'U': Orthogonal matrix U is computed; */
592 /* > = 'N': U is not computed. */
595 /* > \param[in] JOBV */
597 /* > JOBV is CHARACTER*1 */
598 /* > = 'V': Orthogonal matrix V is computed; */
599 /* > = 'N': V is not computed. */
602 /* > \param[in] JOBQ */
604 /* > JOBQ is CHARACTER*1 */
605 /* > = 'Q': Orthogonal matrix Q is computed; */
606 /* > = 'N': Q is not computed. */
612 /* > The number of rows of the matrix A. M >= 0. */
618 /* > The number of rows of the matrix B. P >= 0. */
624 /* > The number of columns of the matrices A and B. N >= 0. */
627 /* > \param[in,out] A */
629 /* > A is REAL array, dimension (LDA,N) */
630 /* > On entry, the M-by-N matrix A. */
631 /* > On exit, A contains the triangular (or trapezoidal) matrix */
632 /* > described in the Purpose section. */
635 /* > \param[in] LDA */
637 /* > LDA is INTEGER */
638 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
641 /* > \param[in,out] B */
643 /* > B is REAL array, dimension (LDB,N) */
644 /* > On entry, the P-by-N matrix B. */
645 /* > On exit, B contains the triangular matrix described in */
646 /* > the Purpose section. */
649 /* > \param[in] LDB */
651 /* > LDB is INTEGER */
652 /* > The leading dimension of the array B. LDB >= f2cmax(1,P). */
655 /* > \param[in] TOLA */
660 /* > \param[in] TOLB */
664 /* > TOLA and TOLB are the thresholds to determine the effective */
665 /* > numerical rank of matrix B and a subblock of A. Generally, */
666 /* > they are set to */
667 /* > TOLA = MAX(M,N)*norm(A)*MACHEPS, */
668 /* > TOLB = MAX(P,N)*norm(B)*MACHEPS. */
669 /* > The size of TOLA and TOLB may affect the size of backward */
670 /* > errors of the decomposition. */
673 /* > \param[out] K */
678 /* > \param[out] L */
682 /* > On exit, K and L specify the dimension of the subblocks */
683 /* > described in Purpose section. */
684 /* > K + L = effective numerical rank of (A**T,B**T)**T. */
687 /* > \param[out] U */
689 /* > U is REAL array, dimension (LDU,M) */
690 /* > If JOBU = 'U', U contains the orthogonal matrix U. */
691 /* > If JOBU = 'N', U is not referenced. */
694 /* > \param[in] LDU */
696 /* > LDU is INTEGER */
697 /* > The leading dimension of the array U. LDU >= f2cmax(1,M) if */
698 /* > JOBU = 'U'; LDU >= 1 otherwise. */
701 /* > \param[out] V */
703 /* > V is REAL array, dimension (LDV,P) */
704 /* > If JOBV = 'V', V contains the orthogonal matrix V. */
705 /* > If JOBV = 'N', V is not referenced. */
708 /* > \param[in] LDV */
710 /* > LDV is INTEGER */
711 /* > The leading dimension of the array V. LDV >= f2cmax(1,P) if */
712 /* > JOBV = 'V'; LDV >= 1 otherwise. */
715 /* > \param[out] Q */
717 /* > Q is REAL array, dimension (LDQ,N) */
718 /* > If JOBQ = 'Q', Q contains the orthogonal matrix Q. */
719 /* > If JOBQ = 'N', Q is not referenced. */
722 /* > \param[in] LDQ */
724 /* > LDQ is INTEGER */
725 /* > The leading dimension of the array Q. LDQ >= f2cmax(1,N) if */
726 /* > JOBQ = 'Q'; LDQ >= 1 otherwise. */
729 /* > \param[out] IWORK */
731 /* > IWORK is INTEGER array, dimension (N) */
734 /* > \param[out] TAU */
736 /* > TAU is REAL array, dimension (N) */
739 /* > \param[out] WORK */
741 /* > WORK is REAL array, dimension (f2cmax(3*N,M,P)) */
744 /* > \param[out] INFO */
746 /* > INFO is INTEGER */
747 /* > = 0: successful exit */
748 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
754 /* > \author Univ. of Tennessee */
755 /* > \author Univ. of California Berkeley */
756 /* > \author Univ. of Colorado Denver */
757 /* > \author NAG Ltd. */
759 /* > \date December 2016 */
761 /* > \ingroup realOTHERcomputational */
763 /* > \par Further Details: */
764 /* ===================== */
766 /* > The subroutine uses LAPACK subroutine SGEQPF for the QR factorization */
767 /* > with column pivoting to detect the effective numerical rank of the */
768 /* > a matrix. It may be replaced by a better rank determination strategy. */
770 /* ===================================================================== */
771 /* Subroutine */ int sggsvp_(char *jobu, char *jobv, char *jobq, integer *m,
772 integer *p, integer *n, real *a, integer *lda, real *b, integer *ldb,
773 real *tola, real *tolb, integer *k, integer *l, real *u, integer *ldu,
774 real *v, integer *ldv, real *q, integer *ldq, integer *iwork, real *
775 tau, real *work, integer *info)
777 /* System generated locals */
778 integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, u_dim1,
779 u_offset, v_dim1, v_offset, i__1, i__2, i__3;
782 /* Local variables */
784 extern logical lsame_(char *, char *);
785 logical wantq, wantu, wantv;
786 extern /* Subroutine */ int sgeqr2_(integer *, integer *, real *, integer
787 *, real *, real *, integer *), sgerq2_(integer *, integer *, real
788 *, integer *, real *, real *, integer *), sorg2r_(integer *,
789 integer *, integer *, real *, integer *, real *, real *, integer *
790 ), sorm2r_(char *, char *, integer *, integer *, integer *, real *
791 , integer *, real *, real *, integer *, real *, integer *), sormr2_(char *, char *, integer *, integer *, integer *,
792 real *, integer *, real *, real *, integer *, real *, integer *), xerbla_(char *, integer *), sgeqpf_(
793 integer *, integer *, real *, integer *, integer *, real *, real *
794 , integer *), slacpy_(char *, integer *, integer *, real *,
795 integer *, real *, integer *), slaset_(char *, integer *,
796 integer *, real *, real *, real *, integer *), slapmt_(
797 logical *, integer *, integer *, real *, integer *, integer *);
801 /* -- LAPACK computational routine (version 3.7.0) -- */
802 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
803 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
807 /* ===================================================================== */
810 /* Test the input parameters */
812 /* Parameter adjustments */
814 a_offset = 1 + a_dim1 * 1;
817 b_offset = 1 + b_dim1 * 1;
820 u_offset = 1 + u_dim1 * 1;
823 v_offset = 1 + v_dim1 * 1;
826 q_offset = 1 + q_dim1 * 1;
833 wantu = lsame_(jobu, "U");
834 wantv = lsame_(jobv, "V");
835 wantq = lsame_(jobq, "Q");
839 if (! (wantu || lsame_(jobu, "N"))) {
841 } else if (! (wantv || lsame_(jobv, "N"))) {
843 } else if (! (wantq || lsame_(jobq, "N"))) {
851 } else if (*lda < f2cmax(1,*m)) {
853 } else if (*ldb < f2cmax(1,*p)) {
855 } else if (*ldu < 1 || wantu && *ldu < *m) {
857 } else if (*ldv < 1 || wantv && *ldv < *p) {
859 } else if (*ldq < 1 || wantq && *ldq < *n) {
864 xerbla_("SGGSVP", &i__1);
868 /* QR with column pivoting of B: B*P = V*( S11 S12 ) */
872 for (i__ = 1; i__ <= i__1; ++i__) {
876 sgeqpf_(p, n, &b[b_offset], ldb, &iwork[1], &tau[1], &work[1], info);
878 /* Update A := A*P */
880 slapmt_(&forwrd, m, n, &a[a_offset], lda, &iwork[1]);
882 /* Determine the effective rank of matrix B. */
885 i__1 = f2cmin(*p,*n);
886 for (i__ = 1; i__ <= i__1; ++i__) {
887 if ((r__1 = b[i__ + i__ * b_dim1], abs(r__1)) > *tolb) {
895 /* Copy the details of V, and form V. */
897 slaset_("Full", p, p, &c_b12, &c_b12, &v[v_offset], ldv);
900 slacpy_("Lower", &i__1, n, &b[b_dim1 + 2], ldb, &v[v_dim1 + 2],
903 i__1 = f2cmin(*p,*n);
904 sorg2r_(p, p, &i__1, &v[v_offset], ldv, &tau[1], &work[1], info);
910 for (j = 1; j <= i__1; ++j) {
912 for (i__ = j + 1; i__ <= i__2; ++i__) {
913 b[i__ + j * b_dim1] = 0.f;
920 slaset_("Full", &i__1, n, &c_b12, &c_b12, &b[*l + 1 + b_dim1], ldb);
925 /* Set Q = I and Update Q := Q*P */
927 slaset_("Full", n, n, &c_b12, &c_b22, &q[q_offset], ldq);
928 slapmt_(&forwrd, n, n, &q[q_offset], ldq, &iwork[1]);
931 if (*p >= *l && *n != *l) {
933 /* RQ factorization of (S11 S12): ( S11 S12 ) = ( 0 S12 )*Z */
935 sgerq2_(l, n, &b[b_offset], ldb, &tau[1], &work[1], info);
937 /* Update A := A*Z**T */
939 sormr2_("Right", "Transpose", m, n, l, &b[b_offset], ldb, &tau[1], &a[
940 a_offset], lda, &work[1], info);
944 /* Update Q := Q*Z**T */
946 sormr2_("Right", "Transpose", n, n, l, &b[b_offset], ldb, &tau[1],
947 &q[q_offset], ldq, &work[1], info);
953 slaset_("Full", l, &i__1, &c_b12, &c_b12, &b[b_offset], ldb);
955 for (j = *n - *l + 1; j <= i__1; ++j) {
957 for (i__ = j - *n + *l + 1; i__ <= i__2; ++i__) {
958 b[i__ + j * b_dim1] = 0.f;
967 /* A = ( A11 A12 ) M, */
969 /* then the following does the complete QR decomposition of A11: */
971 /* A11 = U*( 0 T12 )*P1**T */
975 for (i__ = 1; i__ <= i__1; ++i__) {
980 sgeqpf_(m, &i__1, &a[a_offset], lda, &iwork[1], &tau[1], &work[1], info);
982 /* Determine the effective rank of A11 */
986 i__2 = *m, i__3 = *n - *l;
987 i__1 = f2cmin(i__2,i__3);
988 for (i__ = 1; i__ <= i__1; ++i__) {
989 if ((r__1 = a[i__ + i__ * a_dim1], abs(r__1)) > *tola) {
995 /* Update A12 := U**T*A12, where A12 = A( 1:M, N-L+1:N ) */
998 i__2 = *m, i__3 = *n - *l;
999 i__1 = f2cmin(i__2,i__3);
1000 sorm2r_("Left", "Transpose", m, l, &i__1, &a[a_offset], lda, &tau[1], &a[(
1001 *n - *l + 1) * a_dim1 + 1], lda, &work[1], info);
1005 /* Copy the details of U, and form U */
1007 slaset_("Full", m, m, &c_b12, &c_b12, &u[u_offset], ldu);
1011 slacpy_("Lower", &i__1, &i__2, &a[a_dim1 + 2], lda, &u[u_dim1 + 2]
1015 i__2 = *m, i__3 = *n - *l;
1016 i__1 = f2cmin(i__2,i__3);
1017 sorg2r_(m, m, &i__1, &u[u_offset], ldu, &tau[1], &work[1], info);
1022 /* Update Q( 1:N, 1:N-L ) = Q( 1:N, 1:N-L )*P1 */
1025 slapmt_(&forwrd, n, &i__1, &q[q_offset], ldq, &iwork[1]);
1028 /* Clean up A: set the strictly lower triangular part of */
1029 /* A(1:K, 1:K) = 0, and A( K+1:M, 1:N-L ) = 0. */
1032 for (j = 1; j <= i__1; ++j) {
1034 for (i__ = j + 1; i__ <= i__2; ++i__) {
1035 a[i__ + j * a_dim1] = 0.f;
1043 slaset_("Full", &i__1, &i__2, &c_b12, &c_b12, &a[*k + 1 + a_dim1],
1049 /* RQ factorization of ( T11 T12 ) = ( 0 T12 )*Z1 */
1052 sgerq2_(k, &i__1, &a[a_offset], lda, &tau[1], &work[1], info);
1056 /* Update Q( 1:N,1:N-L ) = Q( 1:N,1:N-L )*Z1**T */
1059 sormr2_("Right", "Transpose", n, &i__1, k, &a[a_offset], lda, &
1060 tau[1], &q[q_offset], ldq, &work[1], info);
1065 i__1 = *n - *l - *k;
1066 slaset_("Full", k, &i__1, &c_b12, &c_b12, &a[a_offset], lda);
1068 for (j = *n - *l - *k + 1; j <= i__1; ++j) {
1070 for (i__ = j - *n + *l + *k + 1; i__ <= i__2; ++i__) {
1071 a[i__ + j * a_dim1] = 0.f;
1081 /* QR factorization of A( K+1:M,N-L+1:N ) */
1084 sgeqr2_(&i__1, l, &a[*k + 1 + (*n - *l + 1) * a_dim1], lda, &tau[1], &
1089 /* Update U(:,K+1:M) := U(:,K+1:M)*U1 */
1094 i__2 = f2cmin(i__3,*l);
1095 sorm2r_("Right", "No transpose", m, &i__1, &i__2, &a[*k + 1 + (*n
1096 - *l + 1) * a_dim1], lda, &tau[1], &u[(*k + 1) * u_dim1 +
1097 1], ldu, &work[1], info);
1103 for (j = *n - *l + 1; j <= i__1; ++j) {
1105 for (i__ = j - *n + *k + *l + 1; i__ <= i__2; ++i__) {
1106 a[i__ + j * a_dim1] = 0.f;