#include "f2c.h" #include "blaswrap.h" /* Common Block Declarations */ struct { integer infot, iounit; logical ok, lerr; } infoc_; #define infoc_1 infoc_ struct { char srnamt[6]; } srnamc_; #define srnamc_1 srnamc_ /* Table of constant values */ static real c_b11 = 0.f; static real c_b16 = 1.f; static integer c__1 = 1; static integer c__3 = 3; /* Subroutine */ int schkq3_(logical *dotype, integer *nm, integer *mval, integer *nn, integer *nval, integer *nnb, integer *nbval, integer * nxval, real *thresh, real *a, real *copya, real *s, real *copys, real *tau, real *work, integer *iwork, integer *nout) { /* Initialized data */ static integer iseedy[4] = { 1988,1989,1990,1991 }; /* Format strings */ static char fmt_9999[] = "(1x,a6,\002 M =\002,i5,\002, N =\002,i5,\002, " "NB =\002,i4,\002, type \002,i2,\002, test \002,i2,\002, ratio " "=\002,g12.5)"; /* System generated locals */ integer i__1, i__2, i__3, i__4, i__5; real r__1; /* Builtin functions */ /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen); integer s_wsfe(cilist *), do_fio(integer *, char *, ftnlen), e_wsfe(void); /* Local variables */ integer i__, k, m, n, nb, im, in, lw, nx, lda, inb; real eps; integer mode, info; char path[3]; integer ilow, nrun; extern /* Subroutine */ int alahd_(integer *, char *); integer ihigh, nfail, iseed[4], imode, mnmin; extern /* Subroutine */ int icopy_(integer *, integer *, integer *, integer *, integer *); integer istep, nerrs; extern doublereal sqpt01_(integer *, integer *, integer *, real *, real *, integer *, real *, integer *, real *, integer *), sqrt11_( integer *, integer *, real *, integer *, real *, real *, integer * ); integer lwork; extern doublereal sqrt12_(integer *, integer *, real *, integer *, real *, real *, integer *); extern /* Subroutine */ int sgeqp3_(integer *, integer *, real *, integer *, integer *, real *, real *, integer *, integer *); extern doublereal slamch_(char *); extern /* Subroutine */ int alasum_(char *, integer *, integer *, integer *, integer *), slaord_(char *, integer *, real *, integer *), slacpy_(char *, integer *, integer *, real *, integer *, real *, integer *), slaset_(char *, integer *, integer *, real *, real *, real *, integer *), xlaenv_(integer *, integer *), slatms_(integer *, integer *, char *, integer *, char *, real *, integer *, real *, real *, integer *, integer *, char * , real *, integer *, real *, integer *); real result[3]; /* Fortran I/O blocks */ static cilist io___28 = { 0, 0, 0, fmt_9999, 0 }; /* -- LAPACK test routine (version 3.1.1) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* January 2007 */ /* .. Scalar Arguments .. */ /* .. */ /* .. Array Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* SCHKQ3 tests SGEQP3. */ /* Arguments */ /* ========= */ /* DOTYPE (input) LOGICAL array, dimension (NTYPES) */ /* The matrix types to be used for testing. Matrices of type j */ /* (for 1 <= j <= NTYPES) are used for testing if DOTYPE(j) = */ /* .TRUE.; if DOTYPE(j) = .FALSE., then type j is not used. */ /* NM (input) INTEGER */ /* The number of values of M contained in the vector MVAL. */ /* MVAL (input) INTEGER array, dimension (NM) */ /* The values of the matrix row dimension M. */ /* NN (input) INTEGER */ /* The number of values of N contained in the vector NVAL. */ /* NVAL (input) INTEGER array, dimension (NN) */ /* The values of the matrix column dimension N. */ /* NNB (input) INTEGER */ /* The number of values of NB and NX contained in the */ /* vectors NBVAL and NXVAL. The blocking parameters are used */ /* in pairs (NB,NX). */ /* NBVAL (input) INTEGER array, dimension (NNB) */ /* The values of the blocksize NB. */ /* NXVAL (input) INTEGER array, dimension (NNB) */ /* The values of the crossover point NX. */ /* THRESH (input) REAL */ /* The threshold value for the test ratios. A result is */ /* included in the output file if RESULT >= THRESH. To have */ /* every test ratio printed, use THRESH = 0. */ /* A (workspace) REAL array, dimension (MMAX*NMAX) */ /* where MMAX is the maximum value of M in MVAL and NMAX is the */ /* maximum value of N in NVAL. */ /* COPYA (workspace) REAL array, dimension (MMAX*NMAX) */ /* S (workspace) REAL array, dimension */ /* (min(MMAX,NMAX)) */ /* COPYS (workspace) REAL array, dimension */ /* (min(MMAX,NMAX)) */ /* TAU (workspace) REAL array, dimension (MMAX) */ /* WORK (workspace) REAL array, dimension */ /* (MMAX*NMAX + 4*NMAX + MMAX) */ /* IWORK (workspace) INTEGER array, dimension (2*NMAX) */ /* NOUT (input) INTEGER */ /* The unit number for output. */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. Local Arrays .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Scalars in Common .. */ /* .. */ /* .. Common blocks .. */ /* .. */ /* .. Data statements .. */ /* Parameter adjustments */ --iwork; --work; --tau; --copys; --s; --copya; --a; --nxval; --nbval; --nval; --mval; --dotype; /* Function Body */ /* .. */ /* .. Executable Statements .. */ /* Initialize constants and the random number seed. */ s_copy(path, "Single precision", (ftnlen)1, (ftnlen)16); s_copy(path + 1, "Q3", (ftnlen)2, (ftnlen)2); nrun = 0; nfail = 0; nerrs = 0; for (i__ = 1; i__ <= 4; ++i__) { iseed[i__ - 1] = iseedy[i__ - 1]; /* L10: */ } eps = slamch_("Epsilon"); infoc_1.infot = 0; i__1 = *nm; for (im = 1; im <= i__1; ++im) { /* Do for each value of M in MVAL. */ m = mval[im]; lda = max(1,m); i__2 = *nn; for (in = 1; in <= i__2; ++in) { /* Do for each value of N in NVAL. */ n = nval[in]; mnmin = min(m,n); /* Computing MAX */ i__3 = 1, i__4 = m * max(m,n) + (mnmin << 2) + max(m,n), i__3 = max(i__3,i__4), i__4 = m * n + (mnmin << 1) + (n << 2); lwork = max(i__3,i__4); for (imode = 1; imode <= 6; ++imode) { if (! dotype[imode]) { goto L70; } /* Do for each type of matrix */ /* 1: zero matrix */ /* 2: one small singular value */ /* 3: geometric distribution of singular values */ /* 4: first n/2 columns fixed */ /* 5: last n/2 columns fixed */ /* 6: every second column fixed */ mode = imode; if (imode > 3) { mode = 1; } /* Generate test matrix of size m by n using */ /* singular value distribution indicated by `mode'. */ i__3 = n; for (i__ = 1; i__ <= i__3; ++i__) { iwork[i__] = 0; /* L20: */ } if (imode == 1) { slaset_("Full", &m, &n, &c_b11, &c_b11, ©a[1], &lda); i__3 = mnmin; for (i__ = 1; i__ <= i__3; ++i__) { copys[i__] = 0.f; /* L30: */ } } else { r__1 = 1.f / eps; slatms_(&m, &n, "Uniform", iseed, "Nonsymm", ©s[1], & mode, &r__1, &c_b16, &m, &n, "No packing", ©a[ 1], &lda, &work[1], &info); if (imode >= 4) { if (imode == 4) { ilow = 1; istep = 1; /* Computing MAX */ i__3 = 1, i__4 = n / 2; ihigh = max(i__3,i__4); } else if (imode == 5) { /* Computing MAX */ i__3 = 1, i__4 = n / 2; ilow = max(i__3,i__4); istep = 1; ihigh = n; } else if (imode == 6) { ilow = 1; istep = 2; ihigh = n; } i__3 = ihigh; i__4 = istep; for (i__ = ilow; i__4 < 0 ? i__ >= i__3 : i__ <= i__3; i__ += i__4) { iwork[i__] = 1; /* L40: */ } } slaord_("Decreasing", &mnmin, ©s[1], &c__1); } i__4 = *nnb; for (inb = 1; inb <= i__4; ++inb) { /* Do for each pair of values (NB,NX) in NBVAL and NXVAL. */ nb = nbval[inb]; xlaenv_(&c__1, &nb); nx = nxval[inb]; xlaenv_(&c__3, &nx); /* Get a working copy of COPYA into A and a copy of */ /* vector IWORK. */ slacpy_("All", &m, &n, ©a[1], &lda, &a[1], &lda); icopy_(&n, &iwork[1], &c__1, &iwork[n + 1], &c__1); /* Compute the QR factorization with pivoting of A */ /* Computing MAX */ i__3 = 1, i__5 = (n << 1) + nb * (n + 1); lw = max(i__3,i__5); /* Compute the QP3 factorization of A */ s_copy(srnamc_1.srnamt, "SGEQP3", (ftnlen)6, (ftnlen)6); sgeqp3_(&m, &n, &a[1], &lda, &iwork[n + 1], &tau[1], & work[1], &lw, &info); /* Compute norm(svd(a) - svd(r)) */ result[0] = sqrt12_(&m, &n, &a[1], &lda, ©s[1], &work[ 1], &lwork); /* Compute norm( A*P - Q*R ) */ result[1] = sqpt01_(&m, &n, &mnmin, ©a[1], &a[1], & lda, &tau[1], &iwork[n + 1], &work[1], &lwork); /* Compute Q'*Q */ result[2] = sqrt11_(&m, &mnmin, &a[1], &lda, &tau[1], & work[1], &lwork); /* Print information about the tests that did not pass */ /* the threshold. */ for (k = 1; k <= 3; ++k) { if (result[k - 1] >= *thresh) { if (nfail == 0 && nerrs == 0) { alahd_(nout, path); } io___28.ciunit = *nout; s_wsfe(&io___28); do_fio(&c__1, "SGEQP3", (ftnlen)6); do_fio(&c__1, (char *)&m, (ftnlen)sizeof(integer)) ; do_fio(&c__1, (char *)&n, (ftnlen)sizeof(integer)) ; do_fio(&c__1, (char *)&nb, (ftnlen)sizeof(integer) ); do_fio(&c__1, (char *)&imode, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&k, (ftnlen)sizeof(integer)) ; do_fio(&c__1, (char *)&result[k - 1], (ftnlen) sizeof(real)); e_wsfe(); ++nfail; } /* L50: */ } nrun += 3; /* L60: */ } L70: ; } /* L80: */ } /* L90: */ } /* Print a summary of the results. */ alasum_(path, nout, &nfail, &nrun, &nerrs); /* End of SCHKQ3 */ return 0; } /* schkq3_ */