cgelst.c

#include<math.h>
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<complex.h>
#ifdefcomplex
#undef complex
#endif
#ifdefI
#undef I
#endif

#if defined(_WIN64)
typedeflong longBLASLONG;
typedefunsigned long longBLASULONG;
#else
typedeflongBLASLONG;
typedefunsigned longBLASULONG;
#endif

#ifdefLAPACK_ILP64
typedefBLASLONGblasint;
#if defined(_WIN64)
#defineblasabs(x) llabs(x)
#else
#defineblasabs(x) labs(x)
#endif
#else
typedefintblasint;
#defineblasabs(x) abs(x)
#endif

typedefblasintinteger;

typedefunsigned intuinteger;
typedefchar*address;
typedefshort intshortint;
typedeffloatreal;
typedefdoubledoublereal;
typedefstruct { realr, i; } complex;
typedefstruct { doublerealr, i; } doublecomplex;
#ifdef_MSC_VER
staticinline_FcomplexCf(complex*z) {_Fcomplexzz={z->r , z->i}; returnzz;}
staticinline_DcomplexCd(doublecomplex*z) {_Dcomplexzz={z->r , z->i};returnzz;}
staticinline_Fcomplex*_pCf(complex*z) {return (_Fcomplex*)z;}
staticinline_Dcomplex*_pCd(doublecomplex*z) {return (_Dcomplex*)z;}
#else
staticinline_ComplexfloatCf(complex*z) {returnz->r+z->i*_Complex_I;}
staticinline_ComplexdoubleCd(doublecomplex*z) {returnz->r+z->i*_Complex_I;}
staticinline_Complexfloat*_pCf(complex*z) {return (_Complexfloat*)z;}
staticinline_Complexdouble*_pCd(doublecomplex*z) {return (_Complexdouble*)z;}
#endif
#definepCf(z) (*_pCf(z))
#definepCd(z) (*_pCd(z))
typedefintlogical;
typedefshort intshortlogical;
typedefcharlogical1;
typedefcharinteger1;

#defineTRUE_ (1)
#defineFALSE_ (0)

/* Extern is for use with -E */
#ifndefExtern
#defineExtern extern
#endif

/* I/O stuff */

typedefintflag;
typedefintftnlen;
typedefintftnint;

/*external read, write*/
typedefstruct
{ flagcierr;
ftnintciunit;
flagciend;
char*cifmt;
ftnintcirec;
} cilist;

/*internal read, write*/
typedefstruct
{ flagicierr;
char*iciunit;
flagiciend;
char*icifmt;
ftninticirlen;
ftninticirnum;
} icilist;

/*open*/
typedefstruct
{ flagoerr;
ftnintounit;
char*ofnm;
ftnlenofnmlen;
char*osta;
char*oacc;
char*ofm;
ftnintorl;
char*oblnk;
} olist;

/*close*/
typedefstruct
{ flagcerr;
ftnintcunit;
char*csta;
} cllist;

/*rewind, backspace, endfile*/
typedefstruct
{ flagaerr;
ftnintaunit;
} alist;

/* inquire */
typedefstruct
{ flaginerr;
ftnintinunit;
char*infile;
ftnleninfilen;
ftnint*inex; /*parameters in standard's order*/
ftnint*inopen;
ftnint*innum;
ftnint*innamed;
char*inname;
ftnleninnamlen;
char*inacc;
ftnleninacclen;
char*inseq;
ftnleninseqlen;
char*indir;
ftnlenindirlen;
char*infmt;
ftnleninfmtlen;
char*inform;
ftnintinformlen;
char*inunf;
ftnleninunflen;
ftnint*inrecl;
ftnint*innrec;
char*inblank;
ftnleninblanklen;
} inlist;

#defineVOID void

unionMultitype { /* for multiple entry points */
integer1g;
shortinth;
integeri;
/* longint j; */
realr;
doublereald;
complexc;
doublecomplexz;
 };

typedefunionMultitypeMultitype;

structVardesc { /* for Namelist */
char*name;
char*addr;
ftnlen*dims;
inttype;
 };
typedefstructVardescVardesc;

structNamelist {
char*name;
Vardesc**vars;
intnvars;
 };
typedefstructNamelistNamelist;

#defineabs(x) ((x) >= 0 ? (x) : -(x))
#definedabs(x) (fabs(x))
#definef2cmin(a,b) ((a) <= (b) ? (a) : (b))
#definef2cmax(a,b) ((a) >= (b) ? (a) : (b))
#definedmin(a,b) (f2cmin(a,b))
#definedmax(a,b) (f2cmax(a,b))
#definebit_test(a,b) ((a) >> (b) & 1)
#definebit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#definebit_set(a,b) ((a) | ((uinteger)1 << (b)))

#defineabort_() { sig_die("Fortran abort routine called", 1); }
#definec_abs(z) (cabsf(Cf(z)))
#definec_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef_MSC_VER
#definec_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]);}
#definez_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/Cd(b)._Val[1]);}
#else
#definec_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#definez_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#definec_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#definec_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#definec_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#definec_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#defined_abs(x) (fabs(*(x)))
#defined_acos(x) (acos(*(x)))
#defined_asin(x) (asin(*(x)))
#defined_atan(x) (atan(*(x)))
#defined_atn2(x, y) (atan2(*(x),*(y)))
#defined_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#definer_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#defined_cos(x) (cos(*(x)))
#defined_cosh(x) (cosh(*(x)))
#defined_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#defined_exp(x) (exp(*(x)))
#defined_imag(z) (cimag(Cd(z)))
#definer_imag(z) (cimagf(Cf(z)))
#defined_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#definer_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#defined_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#definer_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#defined_log(x) (log(*(x)))
#defined_mod(x, y) (fmod(*(x), *(y)))
#defineu_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#defined_nint(x) u_nint(*(x))
#defineu_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#defined_sign(a,b) u_sign(*(a),*(b))
#definer_sign(a,b) u_sign(*(a),*(b))
#defined_sin(x) (sin(*(x)))
#defined_sinh(x) (sinh(*(x)))
#defined_sqrt(x) (sqrt(*(x)))
#defined_tan(x) (tan(*(x)))
#defined_tanh(x) (tanh(*(x)))
#definei_abs(x) abs(*(x))
#definei_dnnt(x) ((integer)u_nint(*(x)))
#definei_len(s, n) (n)
#definei_nint(x) ((integer)u_nint(*(x)))
#definei_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#definepow_dd(ap, bp) ( pow(*(ap), *(bp)))
#definepow_si(B,E) spow_ui(*(B),*(E))
#definepow_ri(B,E) spow_ui(*(B),*(E))
#definepow_di(B,E) dpow_ui(*(B),*(E))
#definepow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#definepow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#definepow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#defines_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++ = ' '; }
#defines_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#defines_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]; }
#definesig_die(s, kill) { exit(1); }
#defines_stop(s, n) {exit(0);}
staticcharjunk[] ="\n@(#)LIBF77 VERSION 19990503\n";
#definez_abs(z) (cabs(Cd(z)))
#definez_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#definez_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#definemyexit_() break;
#definemycycle_() continue;
#definemyceiling_(w) {ceil(w)}
#definemyhuge_(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#definemymaxloc_(w,s,e,n) dmaxloc_(w,*(s),*(e),n)

/* procedure parameter types for -A and -C++ */

#defineF2C_proc_par_types 1
#ifdef__cplusplus
typedeflogical (*L_fp)(...);
#else
typedeflogical (*L_fp)();
#endif

staticfloatspow_ui(floatx, integern) {
floatpow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
staticdoubledpow_ui(doublex, integern) {
doublepow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
#ifdef_MSC_VER
static_Fcomplexcpow_ui(complexx, integern) {
complexpow={1.0,0.0}; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x.r=1/x.r, x.i=1/x.i;
for(u=n; ; ) {
if(u&01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
elsebreak;
 }
 }
_Fcomplexp={pow.r, pow.i};
returnp;
}
#else
static_Complexfloatcpow_ui(_Complexfloatx, integern) {
_Complexfloatpow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
#endif
#ifdef_MSC_VER
static_Dcomplexzpow_ui(_Dcomplexx, integern) {
_Dcomplexpow={1.0,0.0}; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x._Val[0] =1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u=n; ; ) {
if(u&01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
elsebreak;
 }
 }
_Dcomplexp= {pow._Val[0], pow._Val[1]};
returnp;
}
#else
static_Complexdoublezpow_ui(_Complexdoublex, integern) {
_Complexdoublepow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
#endif
staticintegerpow_ii(integerx, integern) {
integerpow; unsigned long intu;
if (n <= 0) {
if (n==0||x==1) pow=1;
elseif (x!=-1) pow=x==0 ? 1/x : 0;
elsen=-n;
 }
if ((n>0) || !(n==0||x==1||x!=-1)) {
u=n;
for(pow=1; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
staticintegerdmaxloc_(double*w, integers, integere, integer*n)
{
doublem; integeri, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
returnmi-s+1;
}
staticintegersmaxloc_(float*w, integers, integere, integer*n)
{
floatm; integeri, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
returnmi-s+1;
}
staticinlinevoidcdotc_(complex*z, integer*n_, complex*x, integer*incx_, complex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Fcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conjf(Cf(&x[i]))._Val[0] *Cf(&y[i])._Val[0];
zdotc._Val[1] +=conjf(Cf(&x[i]))._Val[1] *Cf(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conjf(Cf(&x[i*incx]))._Val[0] *Cf(&y[i*incy])._Val[0];
zdotc._Val[1] +=conjf(Cf(&x[i*incx]))._Val[1] *Cf(&y[i*incy])._Val[1];
 }
 }
pCf(z) =zdotc;
}
#else
_Complexfloatzdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conjf(Cf(&x[i])) *Cf(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conjf(Cf(&x[i*incx])) *Cf(&y[i*incy]);
 }
 }
pCf(z) =zdotc;
}
#endif
staticinlinevoidzdotc_(doublecomplex*z, integer*n_, doublecomplex*x, integer*incx_, doublecomplex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Dcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conj(Cd(&x[i]))._Val[0] *Cd(&y[i])._Val[0];
zdotc._Val[1] +=conj(Cd(&x[i]))._Val[1] *Cd(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conj(Cd(&x[i*incx]))._Val[0] *Cd(&y[i*incy])._Val[0];
zdotc._Val[1] +=conj(Cd(&x[i*incx]))._Val[1] *Cd(&y[i*incy])._Val[1];
 }
 }
pCd(z) =zdotc;
}
#else
_Complexdoublezdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conj(Cd(&x[i])) *Cd(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conj(Cd(&x[i*incx])) *Cd(&y[i*incy]);
 }
 }
pCd(z) =zdotc;
}
#endif
staticinlinevoidcdotu_(complex*z, integer*n_, complex*x, integer*incx_, complex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Fcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cf(&x[i])._Val[0] *Cf(&y[i])._Val[0];
zdotc._Val[1] +=Cf(&x[i])._Val[1] *Cf(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cf(&x[i*incx])._Val[0] *Cf(&y[i*incy])._Val[0];
zdotc._Val[1] +=Cf(&x[i*incx])._Val[1] *Cf(&y[i*incy])._Val[1];
 }
 }
pCf(z) =zdotc;
}
#else
_Complexfloatzdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cf(&x[i]) *Cf(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cf(&x[i*incx]) *Cf(&y[i*incy]);
 }
 }
pCf(z) =zdotc;
}
#endif
staticinlinevoidzdotu_(doublecomplex*z, integer*n_, doublecomplex*x, integer*incx_, doublecomplex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Dcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cd(&x[i])._Val[0] *Cd(&y[i])._Val[0];
zdotc._Val[1] +=Cd(&x[i])._Val[1] *Cd(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cd(&x[i*incx])._Val[0] *Cd(&y[i*incy])._Val[0];
zdotc._Val[1] +=Cd(&x[i*incx])._Val[1] *Cd(&y[i*incy])._Val[1];
 }
 }
pCd(z) =zdotc;
}
#else
_Complexdoublezdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cd(&x[i]) *Cd(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cd(&x[i*incx]) *Cd(&y[i*incy]);
 }
 }
pCd(z) =zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
 You must link the resulting object file with the libraries:
 -lf2c -lm (in that order)
*/





/* Table of constant values */

staticcomplexc_b1= {0.f,0.f};
staticintegerc__1=1;
staticintegerc_n1=-1;
staticintegerc__2=2;
staticintegerc__0=0;

/* > \brief <b> CGELST solves overdetermined or underdetermined systems for GE matrices using QR or LQ factori
zation with compact WY representation of Q.</b> */

/* =========== DOCUMENTATION =========== */

/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */

/* > \htmlonly */
/* > Download CGELST + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgelst.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgelst.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgelst.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */

/* Definition: */
/* =========== */

/* SUBROUTINE CGELST( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, */
/* INFO ) */

/* CHARACTER TRANS */
/* INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS */
/* COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) */


/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > CGELST solves overdetermined or underdetermined real linear systems */
/* > involving an M-by-N matrix A, or its conjugate-transpose, using a QR */
/* > or LQ factorization of A with compact WY representation of Q. */
/* > It is assumed that A has full rank. */
/* > */
/* > The following options are provided: */
/* > */
/* > 1. If TRANS = 'N' and m >= n: find the least squares solution of */
/* > an overdetermined system, i.e., solve the least squares problem */
/* > minimize || B - A*X ||. */
/* > */
/* > 2. If TRANS = 'N' and m < n: find the minimum norm solution of */
/* > an underdetermined system A * X = B. */
/* > */
/* > 3. If TRANS = 'C' and m >= n: find the minimum norm solution of */
/* > an underdetermined system A**T * X = B. */
/* > */
/* > 4. If TRANS = 'C' and m < n: find the least squares solution of */
/* > an overdetermined system, i.e., solve the least squares problem */
/* > minimize || B - A**T * X ||. */
/* > */
/* > Several right hand side vectors b and solution vectors x can be */
/* > handled in a single call; they are stored as the columns of the */
/* > M-by-NRHS right hand side matrix B and the N-by-NRHS solution */
/* > matrix X. */
/* > \endverbatim */

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

/* > \param[in] TRANS */
/* > \verbatim */
/* > TRANS is CHARACTER*1 */
/* > = 'N': the linear system involves A; */
/* > = 'C': the linear system involves A**H. */
/* > \endverbatim */
/* > */
/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > The number of rows of the matrix A. M >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The number of columns of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] NRHS */
/* > \verbatim */
/* > NRHS is INTEGER */
/* > The number of right hand sides, i.e., the number of */
/* > columns of the matrices B and X. NRHS >=0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is COMPLEX array, dimension (LDA,N) */
/* > On entry, the M-by-N matrix A. */
/* > On exit, */
/* > if M >= N, A is overwritten by details of its QR */
/* > factorization as returned by CGEQRT; */
/* > if M < N, A is overwritten by details of its LQ */
/* > factorization as returned by CGELQT. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
/* > \endverbatim */
/* > */
/* > \param[in,out] B */
/* > \verbatim */
/* > B is COMPLEX array, dimension (LDB,NRHS) */
/* > On entry, the matrix B of right hand side vectors, stored */
/* > columnwise; B is M-by-NRHS if TRANS = 'N', or N-by-NRHS */
/* > if TRANS = 'C'. */
/* > On exit, if INFO = 0, B is overwritten by the solution */
/* > vectors, stored columnwise: */
/* > if TRANS = 'N' and m >= n, rows 1 to n of B contain the least */
/* > squares solution vectors; the residual sum of squares for the */
/* > solution in each column is given by the sum of squares of */
/* > modulus of elements N+1 to M in that column; */
/* > if TRANS = 'N' and m < n, rows 1 to N of B contain the */
/* > minimum norm solution vectors; */
/* > if TRANS = 'C' and m >= n, rows 1 to M of B contain the */
/* > minimum norm solution vectors; */
/* > if TRANS = 'C' and m < n, rows 1 to M of B contain the */
/* > least squares solution vectors; the residual sum of squares */
/* > for the solution in each column is given by the sum of */
/* > squares of the modulus of elements M+1 to N in that column. */
/* > \endverbatim */
/* > */
/* > \param[in] LDB */
/* > \verbatim */
/* > LDB is INTEGER */
/* > The leading dimension of the array B. LDB >= MAX(1,M,N). */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
/* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* > \endverbatim */
/* > */
/* > \param[in] LWORK */
/* > \verbatim */
/* > LWORK is INTEGER */
/* > The dimension of the array WORK. */
/* > LWORK >= f2cmax( 1, MN + f2cmax( MN, NRHS ) ). */
/* > For optimal performance, */
/* > LWORK >= f2cmax( 1, (MN + f2cmax( MN, NRHS ))*NB ). */
/* > where MN = f2cmin(M,N) and NB is the optimum block size. */
/* > */
/* > If LWORK = -1, then a workspace query is assumed; the routine */
/* > only calculates the optimal size of the WORK array, returns */
/* > this value as the first entry of the WORK array, and no error */
/* > message related to LWORK is issued by XERBLA. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > > 0: if INFO = i, the i-th diagonal element of the */
/* > triangular factor of A is zero, so that A does not have */
/* > full rank; the least squares solution could not be */
/* > computed. */
/* > \endverbatim */

/* Authors: */
/* ======== */

/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */

/* > \ingroup complexGEsolve */

/* > \par Contributors: */
/* ================== */
/* > */
/* > \verbatim */
/* > */
/* > November 2022, Igor Kozachenko, */
/* > Computer Science Division, */
/* > University of California, Berkeley */
/* > \endverbatim */

/* ===================================================================== */
/* Subroutine */voidcgelst_(char*trans, integer*m, integer*n, integer*
nrhs, complex*a, integer*lda, complex*b, integer*ldb, complex*
work, integer*lwork, integer*info)
{
/* System generated locals */
integera_dim1, a_offset, b_dim1, b_offset, i__1, i__2, i__3;
realr__1;

/* Local variables */
realanrm, bnrm;
integerbrow;
logicaltpsd;
integeri__, j, iascl, ibscl;
externlogicallsame_(char*, char*);
integernbmin;
realrwork[1];
integerlwopt, nb;
extern/* Subroutine */voidslabad_(real*, real*);
externrealclange_(char*, integer*, integer*, complex*, integer*, 
real*);
integermn;
extern/* Subroutine */voidclascl_(char*, integer*, integer*, real*, 
real*, integer*, integer*, complex*, integer*, integer*);
externrealslamch_(char*);
extern/* Subroutine */voidclaset_(char*, integer*, integer*, complex
*, complex*, complex*, integer*);
externintxerbla_(char*, integer*, ftnlen);
externintegerilaenv_(integer*, char*, char*, integer*, integer*, 
integer*, integer*, ftnlen, ftnlen);
extern/* Subroutine */voidcgelqt_(integer*, integer*, integer*, 
complex*, integer*, complex*, integer*, complex*, integer*);
integerscllen;
realbignum;
extern/* Subroutine */voidcgeqrt_(integer*, integer*, integer*, 
complex*, integer*, complex*, integer*, complex*, integer*);
integermnnrhs;
realsmlnum;
logicallquery;
extern/* Subroutine */intctrtrs_(char*, char*, char*, integer*, 
integer*, complex*, integer*, complex*, integer*, integer*);
externvoidcgemlqt_(char*, char*, integer*, 
integer*, integer*, integer*, complex*, integer*, complex*, 
integer*, complex*, integer*, complex*, integer*), cgemqrt_(char*, char*, integer*, integer*, integer*,
integer*, complex*, integer*, complex*, integer*, complex*,
integer*, complex*, integer*);


/* -- LAPACK driver routine -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */


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


/* Test the input arguments. */

/* Parameter adjustments */
a_dim1=*lda;
a_offset=1+a_dim1*1;
a-=a_offset;
b_dim1=*ldb;
b_offset=1+b_dim1*1;
b-=b_offset;
--work;

/* Function Body */
*info=0;
mn=f2cmin(*m,*n);
lquery=*lwork==-1;
if (! (lsame_(trans, "N") ||lsame_(trans, "C"))) {
*info=-1;
 } elseif (*m<0) {
*info=-2;
 } elseif (*n<0) {
*info=-3;
 } elseif (*nrhs<0) {
*info=-4;
 } elseif (*lda<f2cmax(1,*m)) {
*info=-6;
 } else/* if(complicated condition) */ {
/* Computing MAX */
i__1=f2cmax(1,*m);
if (*ldb<f2cmax(i__1,*n)) {
*info=-8;
 } else/* if(complicated condition) */ {
/* Computing MAX */
i__1=1, i__2=mn+f2cmax(mn,*nrhs);
if (*lwork<f2cmax(i__1,i__2) && ! lquery) {
*info=-10;
 }
 }
 }

/* Figure out optimal block size and optimal workspace size */

if (*info==0||*info==-10) {

tpsd=TRUE_;
if (lsame_(trans, "N")) {
tpsd=FALSE_;
 }

nb=ilaenv_(&c__1, "CGELST", " ", m, n, &c_n1, &c_n1, (ftnlen)6, (
ftnlen)1);

mnnrhs=f2cmax(mn,*nrhs);
/* Computing MAX */
i__1=1, i__2= (mn+mnnrhs) *nb;
lwopt=f2cmax(i__1,i__2);
r__1= (real) lwopt;
work[1].r=r__1, work[1].i=0.f;

 }

if (*info!=0) {
i__1=-(*info);
xerbla_("CGELST ", &i__1, 6);
return;
 } elseif (lquery) {
return;
 }

/* Quick return if possible */

/* Computing MIN */
i__1=f2cmin(*m,*n);
if (f2cmin(i__1,*nrhs) ==0) {
i__1=f2cmax(*m,*n);
claset_("Full", &i__1, nrhs, &c_b1, &c_b1, &b[b_offset], ldb);
r__1= (real) lwopt;
work[1].r=r__1, work[1].i=0.f;
return;
 }

/* *GEQRT and *GELQT routines cannot accept NB larger than f2cmin(M,N) */

if (nb>mn) {
nb=mn;
 }

/* Determine the block size from the supplied LWORK */
/* ( at this stage we know that LWORK >= (minimum required workspace, */
/* but it may be less than optimal) */

/* Computing MIN */
i__1=nb, i__2=*lwork / (mn+mnnrhs);
nb=f2cmin(i__1,i__2);

/* The minimum value of NB, when blocked code is used */

/* Computing MAX */
i__1=2, i__2=ilaenv_(&c__2, "CGELST", " ", m, n, &c_n1, &c_n1, (
ftnlen)6, (ftnlen)1);
nbmin=f2cmax(i__1,i__2);

if (nb<nbmin) {
nb=1;
 }

/* Get machine parameters */

smlnum=slamch_("S") / slamch_("P");
bignum=1.f / smlnum;
slabad_(&smlnum, &bignum);

/* Scale A, B if f2cmax element outside range [SMLNUM,BIGNUM] */

anrm=clange_("M", m, n, &a[a_offset], lda, rwork);
iascl=0;
if (anrm>0.f&&anrm<smlnum) {

/* Scale matrix norm up to SMLNUM */

clascl_("G", &c__0, &c__0, &anrm, &smlnum, m, n, &a[a_offset], lda, 
info);
iascl=1;
 } elseif (anrm>bignum) {

/* Scale matrix norm down to BIGNUM */

clascl_("G", &c__0, &c__0, &anrm, &bignum, m, n, &a[a_offset], lda, 
info);
iascl=2;
 } elseif (anrm==0.f) {

/* Matrix all zero. Return zero solution. */

i__1=f2cmax(*m,*n);
claset_("Full", &i__1, nrhs, &c_b1, &c_b1, &b[b_offset], ldb);
r__1= (real) lwopt;
work[1].r=r__1, work[1].i=0.f;
return;
 }

brow=*m;
if (tpsd) {
brow=*n;
 }
bnrm=clange_("M", &brow, nrhs, &b[b_offset], ldb, rwork);
ibscl=0;
if (bnrm>0.f&&bnrm<smlnum) {

/* Scale matrix norm up to SMLNUM */

clascl_("G", &c__0, &c__0, &bnrm, &smlnum, &brow, nrhs, &b[b_offset], 
ldb, info);
ibscl=1;
 } elseif (bnrm>bignum) {

/* Scale matrix norm down to BIGNUM */

clascl_("G", &c__0, &c__0, &bnrm, &bignum, &brow, nrhs, &b[b_offset], 
ldb, info);
ibscl=2;
 }

if (*m >= *n) {

/* M > N: */
/* Compute the blocked QR factorization of A, */
/* using the compact WY representation of Q, */
/* workspace at least N, optimally N*NB. */

cgeqrt_(m, n, &nb, &a[a_offset], lda, &work[1], &nb, &work[mn*nb+
1], info);

if (! tpsd) {

/* M > N, A is not transposed: */
/* Overdetermined system of equations, */
/* least-squares problem, f2cmin || A * X - B ||. */

/* Compute B(1:M,1:NRHS) := Q**T * B(1:M,1:NRHS), */
/* using the compact WY representation of Q, */
/* workspace at least NRHS, optimally NRHS*NB. */

cgemqrt_("Left", "Conjugate transpose", m, nrhs, n, &nb, &a[
a_offset], lda, &work[1], &nb, &b[b_offset], ldb, &work[
mn*nb+1], info);

/* Compute B(1:N,1:NRHS) := inv(R) * B(1:N,1:NRHS) */

ctrtrs_("Upper", "No transpose", "Non-unit", n, nrhs, &a[a_offset]
 , lda, &b[b_offset], ldb, info);

if (*info>0) {
return;
 }

scllen=*n;

 } else {

/* M > N, A is transposed: */
/* Underdetermined system of equations, */
/* minimum norm solution of A**T * X = B. */

/* Compute B := inv(R**T) * B in two row blocks of B. */

/* Block 1: B(1:N,1:NRHS) := inv(R**T) * B(1:N,1:NRHS) */

ctrtrs_("Upper", "Conjugate transpose", "Non-unit", n, nrhs, &a[
a_offset], lda, &b[b_offset], ldb, info);

if (*info>0) {
return;
 }

/* Block 2: Zero out all rows below the N-th row in B: */
/* B(N+1:M,1:NRHS) = ZERO */

i__1=*nrhs;
for (j=1; j <= i__1; ++j) {
i__2=*m;
for (i__=*n+1; i__ <= i__2; ++i__) {
i__3=i__+j*b_dim1;
b[i__3].r=0.f, b[i__3].i=0.f;
 }
 }

/* Compute B(1:M,1:NRHS) := Q(1:N,:) * B(1:N,1:NRHS), */
/* using the compact WY representation of Q, */
/* workspace at least NRHS, optimally NRHS*NB. */

cgemqrt_("Left", "No transpose", m, nrhs, n, &nb, &a[a_offset], 
lda, &work[1], &nb, &b[b_offset], ldb, &work[mn*nb+1],
info);