dggbak.c

来自「InsightToolkit-1.4.0(有大量的优化算法程序)」· C语言 代码 · 共 203 行

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

/* Subroutine */ void dggbak_(job, side, n, ilo, ihi, lscale, rscale, m, v, ldv, info)
const char *job, *side;
const integer *n;
integer *ilo, *ihi;
doublereal *lscale, *rscale;
const integer *m;
doublereal *v;
const integer *ldv;
integer *info;
{
    /* System generated locals */
    integer v_dim1, v_offset, i__1;

    /* Local variables */
    static integer i, k;
    static logical leftv;
    static logical rightv;


/*  -- LAPACK routine (version 3.0) -- */
/*     Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., */
/*     Courant Institute, Argonne National Lab, and Rice University */
/*     September 30, 1994 */

/*  Purpose */
/*  ======= */

/*  DGGBAK forms the right or left eigenvectors of a real generalized */
/*  eigenvalue problem A*x = lambda*B*x, by backward transformation on */
/*  the computed eigenvectors of the balanced pair of matrices output by */
/*  DGGBAL. */

/*  Arguments */
/*  ========= */

/*  JOB     (input) CHARACTER*1 */
/*          Specifies the type of backward transformation required: */
/*          = 'N':  do nothing, return immediately; */
/*          = 'P':  do backward transformation for permutation only; */
/*          = 'S':  do backward transformation for scaling only; */
/*          = 'B':  do backward transformations for both permutation and */
/*                  scaling. */
/*          JOB must be the same as the argument JOB supplied to DGGBAL. */

/*  SIDE    (input) CHARACTER*1 */
/*          = 'R':  V contains right eigenvectors; */
/*          = 'L':  V contains left eigenvectors. */

/*  N       (input) INTEGER */
/*          The number of rows of the matrix V.  N >= 0. */

/*  ILO     (input) INTEGER */
/*  IHI     (input) INTEGER */
/*          The integers ILO and IHI determined by DGGBAL. */
/*          1 <= ILO <= IHI <= N, if N > 0; ILO=1 and IHI=0, if N=0. */

/*  LSCALE  (input) DOUBLE PRECISION array, dimension (N) */
/*          Details of the permutations and/or scaling factors applied */
/*          to the left side of A and B, as returned by DGGBAL. */

/*  RSCALE  (input) DOUBLE PRECISION array, dimension (N) */
/*          Details of the permutations and/or scaling factors applied */
/*          to the right side of A and B, as returned by DGGBAL. */

/*  M       (input) INTEGER */
/*          The number of columns of the matrix V.  M >= 0. */

/*  V       (input/output) DOUBLE PRECISION array, dimension (LDV,M) */
/*          On entry, the matrix of right or left eigenvectors to be */
/*          transformed, as returned by DTGEVC. */
/*          On exit, V is overwritten by the transformed eigenvectors. */

/*  LDV     (input) INTEGER */
/*          The leading dimension of the matrix V. LDV >= max(1,N). */

/*  INFO    (output) INTEGER */
/*          = 0:  successful exit. */
/*          < 0:  if INFO = -i, the i-th argument had an illegal value. */

/*  Further Details */
/*  =============== */

/*  See R.C. Ward, Balancing the generalized eigenvalue problem, */
/*                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. */

/*  ===================================================================== */

    /* Parameter adjustments */
    --lscale;
    --rscale;
    v_dim1 = *ldv;
    v_offset = 1 + v_dim1 * 1;
    v -= v_offset;

/*     Test the input parameters */

    rightv = lsame_(side, "R");
    leftv = lsame_(side, "L");

    *info = 0;
    if (! lsame_(job, "N") && ! lsame_(job, "P") && ! lsame_(job, "S") && ! lsame_(job, "B")) {
        *info = -1;
    } else if (! rightv && ! leftv) {
        *info = -2;
    } else if (*n < 0) {
        *info = -3;
    } else if (*ilo < 1) {
        *info = -4;
    } else if (*ihi < *ilo || *ihi > max(1,*n)) {
        *info = -5;
    } else if (*m < 0) {
        *info = -6;
    } else if (*ldv < max(1,*n)) {
        *info = -10;
    }
    if (*info != 0) {
        i__1 = -(*info);
        xerbla_("DGGBAK", &i__1);
        return;
    }

/*     Quick return if possible */

    if (*n == 0) {
        return;
    }
    if (*m == 0) {
        return;
    }
    if (lsame_(job, "N")) {
        return;
    }

    if (*ilo == *ihi) {
        goto L30;
    }

/*     Backward balance */

    if (lsame_(job, "S") || lsame_(job, "B")) {

/*        Backward transformation on right eigenvectors */

        if (rightv) {
            for (i = *ilo; i <= *ihi; ++i) {
                dscal_(m, &rscale[i], &v[i + v_dim1], ldv);
            }
        }

/*        Backward transformation on left eigenvectors */

        if (leftv) {
            for (i = *ilo; i <= *ihi; ++i) {
                dscal_(m, &lscale[i], &v[i + v_dim1], ldv);
            }
        }
    }

/*     Backward permutation */

L30:
    if (lsame_(job, "P") || lsame_(job, "B")) {

/*        Backward permutation on right eigenvectors */

        if (rightv) {
            for (i = *ilo - 1; i >= 1; --i) {
                k = (integer) rscale[i];
                if (k != i) {
                    dswap_(m, &v[i + v_dim1], ldv, &v[k + v_dim1], ldv);
                }
            }
            for (i = *ihi + 1; i <= *n; ++i) {
                k = (integer) rscale[i];
                if (k != i) {
                dswap_(m, &v[i + v_dim1], ldv, &v[k + v_dim1], ldv);
                }
            }
        }

/*        Backward permutation on left eigenvectors */

        if (leftv) {
            for (i = *ilo - 1; i >= 1; --i) {
                k = (integer) lscale[i];
                if (k != i) {
                    dswap_(m, &v[i + v_dim1], ldv, &v[k + v_dim1], ldv);
                }
            }

            for (i = *ihi + 1; i <= *n; ++i) {
                k = (integer) lscale[i];
                if (k != i) {
                    dswap_(m, &v[i + v_dim1], ldv, &v[k + v_dim1], ldv);
                }
            }
        }
    }
} /* dggbak_ */