sorm2r.c

InsightToolkit-1.4.0(有大量的优化算法程序)

#include "f2c.h"
#include "netlib.h"

/* Table of constant values */
static integer c__1 = 1;

/* Subroutine */ void sorm2r_(const char *side, const char *trans, const integer *m, const integer *n,
        const integer *k, real *a, const integer *lda, const real *tau, real *c,
        const integer *ldc, real *work, integer *info)
{
    /* System generated locals */
    integer i__1;

    /* Local variables */
    static logical left;
    static integer i;
    static integer i1, i2, i3, ic, jc, mi, ni, nq;
    static logical notran;
    static real aii;

/*  -- LAPACK routine (version 2.0) -- */
/*     Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., */
/*     Courant Institute, Argonne National Lab, and Rice University */
/*     February 29, 1992 */

/*  Purpose                                                               */
/*  =======                                                               */
/*                                                                        */
/*  SORM2R overwrites the general real m by n matrix C with               */
/*                                                                        */
/*        Q * C  if SIDE = 'L' and TRANS = 'N', or                        */
/*                                                                        */
/*        Q'* C  if SIDE = 'L' and TRANS = 'T', or                        */
/*                                                                        */
/*        C * Q  if SIDE = 'R' and TRANS = 'N', or                        */
/*                                                                        */
/*        C * Q' if SIDE = 'R' and TRANS = 'T',                           */
/*                                                                        */
/*  where Q is a real orthogonal matrix defined as the product of k       */
/*  elementary reflectors                                                 */
/*                                                                        */
/*        Q = H(1) H(2) . . . H(k)                                        */
/*                                                                        */
/*  as returned by SGEQRF. Q is of order m if SIDE = 'L' and of order n   */
/*  if SIDE = 'R'.                                                        */
/*                                                                        */
/*  Arguments                                                             */
/*  =========                                                             */
/*                                                                        */
/*  SIDE    (input) CHARACTER*1                                           */
/*          = 'L': apply Q or Q' from the Left                            */
/*          = 'R': apply Q or Q' from the Right                           */
/*                                                                        */
/*  TRANS   (input) CHARACTER*1                                           */
/*          = 'N': apply Q  (No transpose)                                */
/*          = 'T': apply Q' (Transpose)                                   */
/*                                                                        */
/*  M       (input) INTEGER                                               */
/*          The number of rows of the matrix C. M >= 0.                   */
/*                                                                        */
/*  N       (input) INTEGER                                               */
/*          The number of columns of the matrix C. N >= 0.                */
/*                                                                        */
/*  K       (input) INTEGER                                               */
/*          The number of elementary reflectors whose product defines     */
/*          the matrix Q.                                                 */
/*          If SIDE = 'L', M >= K >= 0;                                   */
/*          if SIDE = 'R', N >= K >= 0.                                   */
/*                                                                        */
/*  A       (input) REAL array, dimension (LDA,K)                         */
/*          The i-th column must contain the vector which defines the     */
/*          elementary reflector H(i), for i = 1,2,...,k, as returned by  */
/*          SGEQRF in the first k columns of its array argument A.        */
/*          A is modified by the routine but restored on exit.            */
/*                                                                        */
/*  LDA     (input) INTEGER                                               */
/*          The leading dimension of the array A.                         */
/*          If SIDE = 'L', LDA >= max(1,M);                               */
/*          if SIDE = 'R', LDA >= max(1,N).                               */
/*                                                                        */
/*  TAU     (input) REAL array, dimension (K)                             */
/*          TAU(i) must contain the scalar factor of the elementary       */
/*          reflector H(i), as returned by SGEQRF.                        */
/*                                                                        */
/*  C       (input/output) REAL array, dimension (LDC,N)                  */
/*          On entry, the m by n matrix C.                                */
/*          On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q.      */
/*                                                                        */
/*  LDC     (input) INTEGER                                               */
/*          The leading dimension of the array C. LDC >= max(1,M).        */
/*                                                                        */
/*  WORK    (workspace) REAL array, dimension                             */
/*                                   (N) if SIDE = 'L',                   */
/*                                   (M) if SIDE = 'R'                    */
/*                                                                        */
/*  INFO    (output) INTEGER                                              */
/*          = 0: successful exit                                          */
/*          < 0: if INFO = -i, the i-th argument had an illegal value     */
/*                                                                        */
/*  ===================================================================== */

/*     Test the input arguments */

    *info = 0;
    left = lsame_(side, "L");
    notran = lsame_(trans, "N");

/*     NQ is the order of Q */

    if (left) {
        nq = *m;
    } else {
        nq = *n;
    }
    if (! left && ! lsame_(side, "R")) {
        *info = -1;
    } else if (! notran && ! lsame_(trans, "T")) {
        *info = -2;
    } else if (*m < 0) {
        *info = -3;
    } else if (*n < 0) {
        *info = -4;
    } else if (*k < 0 || *k > nq) {
        *info = -5;
    } else if (*lda < max(1,nq)) {
        *info = -7;
    } else if (*ldc < max(1,*m)) {
        *info = -10;
    }
    if (*info != 0) {
        i__1 = -(*info);
        xerbla_("SORM2R", &i__1);
        return;
    }

/*     Quick return if possible */

    if (*m == 0 || *n == 0 || *k == 0) {
        return;
    }

    if ( (left && ! notran) || ( ! left && notran) ) {
        i1 = 0;
        i2 = *k - 1;
        i3 = 1;
    } else {
        i1 = *k - 1;
        i2 = 0;
        i3 = -1;
    }

    if (left) {
        ni = *n;
        jc = 0;
    } else {
        mi = *m;
        ic = 0;
    }

    for (i = i1; i3 < 0 ? i >= i2 : i <= i2; i += i3) {
        if (left) {

/*           H(i) is applied to C(i:m,1:n) */

            mi = *m - i;
            ic = i;
        } else {

/*           H(i) is applied to C(1:m,i:n) */

            ni = *n - i;
            jc = i;
        }

/*        Apply H(i) */

        aii = a[i + i * *lda];
        a[i + i * *lda] = 1.f;
        slarf_(side, &mi, &ni, &a[i + i * *lda], &c__1, &tau[i], &c[ic + jc * *ldc], ldc, work);
        a[i + i * *lda] = aii;
    }
} /* sorm2r_ */