zgelqs.c
Go to the documentation of this file.
00001 /* zgelqs.f -- translated by f2c (version 20061008).
00002    You must link the resulting object file with libf2c:
00003         on Microsoft Windows system, link with libf2c.lib;
00004         on Linux or Unix systems, link with .../path/to/libf2c.a -lm
00005         or, if you install libf2c.a in a standard place, with -lf2c -lm
00006         -- in that order, at the end of the command line, as in
00007                 cc *.o -lf2c -lm
00008         Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
00009 
00010                 http://www.netlib.org/f2c/libf2c.zip
00011 */
00012 
00013 #include "f2c.h"
00014 #include "blaswrap.h"
00015 
00016 /* Table of constant values */
00017 
00018 static doublecomplex c_b1 = {0.,0.};
00019 static doublecomplex c_b2 = {1.,0.};
00020 
00021 /* Subroutine */ int zgelqs_(integer *m, integer *n, integer *nrhs, 
00022         doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *b, 
00023         integer *ldb, doublecomplex *work, integer *lwork, integer *info)
00024 {
00025     /* System generated locals */
00026     integer a_dim1, a_offset, b_dim1, b_offset, i__1;
00027 
00028     /* Local variables */
00029     extern /* Subroutine */ int ztrsm_(char *, char *, char *, char *, 
00030             integer *, integer *, doublecomplex *, doublecomplex *, integer *, 
00031              doublecomplex *, integer *), 
00032             xerbla_(char *, integer *), zlaset_(char *, integer *, 
00033             integer *, doublecomplex *, doublecomplex *, doublecomplex *, 
00034             integer *), zunmlq_(char *, char *, integer *, integer *, 
00035             integer *, doublecomplex *, integer *, doublecomplex *, 
00036             doublecomplex *, integer *, doublecomplex *, integer *, integer *);
00037 
00038 
00039 /*  -- LAPACK routine (version 3.1) -- */
00040 /*     Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
00041 /*     November 2006 */
00042 
00043 /*     .. Scalar Arguments .. */
00044 /*     .. */
00045 /*     .. Array Arguments .. */
00046 /*     .. */
00047 
00048 /*  Purpose */
00049 /*  ======= */
00050 
00051 /*  Compute a minimum-norm solution */
00052 /*      min || A*X - B || */
00053 /*  using the LQ factorization */
00054 /*      A = L*Q */
00055 /*  computed by ZGELQF. */
00056 
00057 /*  Arguments */
00058 /*  ========= */
00059 
00060 /*  M       (input) INTEGER */
00061 /*          The number of rows of the matrix A.  M >= 0. */
00062 
00063 /*  N       (input) INTEGER */
00064 /*          The number of columns of the matrix A.  N >= M >= 0. */
00065 
00066 /*  NRHS    (input) INTEGER */
00067 /*          The number of columns of B.  NRHS >= 0. */
00068 
00069 /*  A       (input) COMPLEX*16 array, dimension (LDA,N) */
00070 /*          Details of the LQ factorization of the original matrix A as */
00071 /*          returned by ZGELQF. */
00072 
00073 /*  LDA     (input) INTEGER */
00074 /*          The leading dimension of the array A.  LDA >= M. */
00075 
00076 /*  TAU     (input) COMPLEX*16 array, dimension (M) */
00077 /*          Details of the orthogonal matrix Q. */
00078 
00079 /*  B       (input/output) COMPLEX*16 array, dimension (LDB,NRHS) */
00080 /*          On entry, the m-by-nrhs right hand side matrix B. */
00081 /*          On exit, the n-by-nrhs solution matrix X. */
00082 
00083 /*  LDB     (input) INTEGER */
00084 /*          The leading dimension of the array B. LDB >= N. */
00085 
00086 /*  WORK    (workspace) COMPLEX*16 array, dimension (LWORK) */
00087 
00088 /*  LWORK   (input) INTEGER */
00089 /*          The length of the array WORK.  LWORK must be at least NRHS, */
00090 /*          and should be at least NRHS*NB, where NB is the block size */
00091 /*          for this environment. */
00092 
00093 /*  INFO    (output) INTEGER */
00094 /*          = 0: successful exit */
00095 /*          < 0: if INFO = -i, the i-th argument had an illegal value */
00096 
00097 /*  ===================================================================== */
00098 
00099 /*     .. Parameters .. */
00100 /*     .. */
00101 /*     .. External Subroutines .. */
00102 /*     .. */
00103 /*     .. Intrinsic Functions .. */
00104 /*     .. */
00105 /*     .. Executable Statements .. */
00106 
00107 /*     Test the input parameters. */
00108 
00109     /* Parameter adjustments */
00110     a_dim1 = *lda;
00111     a_offset = 1 + a_dim1;
00112     a -= a_offset;
00113     --tau;
00114     b_dim1 = *ldb;
00115     b_offset = 1 + b_dim1;
00116     b -= b_offset;
00117     --work;
00118 
00119     /* Function Body */
00120     *info = 0;
00121     if (*m < 0) {
00122         *info = -1;
00123     } else if (*n < 0 || *m > *n) {
00124         *info = -2;
00125     } else if (*nrhs < 0) {
00126         *info = -3;
00127     } else if (*lda < max(1,*m)) {
00128         *info = -5;
00129     } else if (*ldb < max(1,*n)) {
00130         *info = -8;
00131     } else if (*lwork < 1 || *lwork < *nrhs && *m > 0 && *n > 0) {
00132         *info = -10;
00133     }
00134     if (*info != 0) {
00135         i__1 = -(*info);
00136         xerbla_("ZGELQS", &i__1);
00137         return 0;
00138     }
00139 
00140 /*     Quick return if possible */
00141 
00142     if (*n == 0 || *nrhs == 0 || *m == 0) {
00143         return 0;
00144     }
00145 
00146 /*     Solve L*X = B(1:m,:) */
00147 
00148     ztrsm_("Left", "Lower", "No transpose", "Non-unit", m, nrhs, &c_b2, &a[
00149             a_offset], lda, &b[b_offset], ldb);
00150 
00151 /*     Set B(m+1:n,:) to zero */
00152 
00153     if (*m < *n) {
00154         i__1 = *n - *m;
00155         zlaset_("Full", &i__1, nrhs, &c_b1, &c_b1, &b[*m + 1 + b_dim1], ldb);
00156     }
00157 
00158 /*     B := Q' * B */
00159 
00160     zunmlq_("Left", "Conjugate transpose", n, nrhs, m, &a[a_offset], lda, &
00161             tau[1], &b[b_offset], ldb, &work[1], lwork, info);
00162 
00163     return 0;
00164 
00165 /*     End of ZGELQS */
00166 
00167 } /* zgelqs_ */


swiftnav
Author(s):
autogenerated on Sat Jun 8 2019 18:56:32