clatmr.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]/df(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 */

staticintegerc__0=0;
staticintegerc__1=1;

/* > \brief \b CLATMR */

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

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

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

/* SUBROUTINE CLATMR( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, */
/* RSIGN, GRADE, DL, MODEL, CONDL, DR, MODER, */
/* CONDR, PIVTNG, IPIVOT, KL, KU, SPARSE, ANORM, */
/* PACK, A, LDA, IWORK, INFO ) */

/* CHARACTER DIST, GRADE, PACK, PIVTNG, RSIGN, SYM */
/* INTEGER INFO, KL, KU, LDA, M, MODE, MODEL, MODER, N */
/* REAL ANORM, COND, CONDL, CONDR, SPARSE */
/* COMPLEX DMAX */
/* INTEGER IPIVOT( * ), ISEED( 4 ), IWORK( * ) */
/* COMPLEX A( LDA, * ), D( * ), DL( * ), DR( * ) */


/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > CLATMR generates random matrices of various types for testing */
/* > LAPACK programs. */
/* > */
/* > CLATMR operates by applying the following sequence of */
/* > operations: */
/* > */
/* > Generate a matrix A with random entries of distribution DIST */
/* > which is symmetric if SYM='S', Hermitian if SYM='H', and */
/* > nonsymmetric if SYM='N'. */
/* > */
/* > Set the diagonal to D, where D may be input or */
/* > computed according to MODE, COND, DMAX and RSIGN */
/* > as described below. */
/* > */
/* > Grade the matrix, if desired, from the left and/or right */
/* > as specified by GRADE. The inputs DL, MODEL, CONDL, DR, */
/* > MODER and CONDR also determine the grading as described */
/* > below. */
/* > */
/* > Permute, if desired, the rows and/or columns as specified by */
/* > PIVTNG and IPIVOT. */
/* > */
/* > Set random entries to zero, if desired, to get a random sparse */
/* > matrix as specified by SPARSE. */
/* > */
/* > Make A a band matrix, if desired, by zeroing out the matrix */
/* > outside a band of lower bandwidth KL and upper bandwidth KU. */
/* > */
/* > Scale A, if desired, to have maximum entry ANORM. */
/* > */
/* > Pack the matrix if desired. Options specified by PACK are: */
/* > no packing */
/* > zero out upper half (if symmetric or Hermitian) */
/* > zero out lower half (if symmetric or Hermitian) */
/* > store the upper half columnwise (if symmetric or Hermitian */
/* > or square upper triangular) */
/* > store the lower half columnwise (if symmetric or Hermitian */
/* > or square lower triangular) */
/* > same as upper half rowwise if symmetric */
/* > same as conjugate upper half rowwise if Hermitian */
/* > store the lower triangle in banded format */
/* > (if symmetric or Hermitian) */
/* > store the upper triangle in banded format */
/* > (if symmetric or Hermitian) */
/* > store the entire matrix in banded format */
/* > */
/* > Note: If two calls to CLATMR differ only in the PACK parameter, */
/* > they will generate mathematically equivalent matrices. */
/* > */
/* > If two calls to CLATMR both have full bandwidth (KL = M-1 */
/* > and KU = N-1), and differ only in the PIVTNG and PACK */
/* > parameters, then the matrices generated will differ only */
/* > in the order of the rows and/or columns, and otherwise */
/* > contain the same data. This consistency cannot be and */
/* > is not maintained with less than full bandwidth. */
/* > \endverbatim */

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

/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > Number of rows of A. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > Number of columns of A. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] DIST */
/* > \verbatim */
/* > DIST is CHARACTER*1 */
/* > On entry, DIST specifies the type of distribution to be used */
/* > to generate a random matrix . */
/* > 'U' => real and imaginary parts are independent */
/* > UNIFORM( 0, 1 ) ( 'U' for uniform ) */
/* > 'S' => real and imaginary parts are independent */
/* > UNIFORM( -1, 1 ) ( 'S' for symmetric ) */
/* > 'N' => real and imaginary parts are independent */
/* > NORMAL( 0, 1 ) ( 'N' for normal ) */
/* > 'D' => uniform on interior of unit disk ( 'D' for disk ) */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] ISEED */
/* > \verbatim */
/* > ISEED is INTEGER array, dimension (4) */
/* > On entry ISEED specifies the seed of the random number */
/* > generator. They should lie between 0 and 4095 inclusive, */
/* > and ISEED(4) should be odd. The random number generator */
/* > uses a linear congruential sequence limited to small */
/* > integers, and so should produce machine independent */
/* > random numbers. The values of ISEED are changed on */
/* > exit, and can be used in the next call to CLATMR */
/* > to continue the same random number sequence. */
/* > Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[in] SYM */
/* > \verbatim */
/* > SYM is CHARACTER*1 */
/* > If SYM='S', generated matrix is symmetric. */
/* > If SYM='H', generated matrix is Hermitian. */
/* > If SYM='N', generated matrix is nonsymmetric. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] D */
/* > \verbatim */
/* > D is COMPLEX array, dimension (f2cmin(M,N)) */
/* > On entry this array specifies the diagonal entries */
/* > of the diagonal of A. D may either be specified */
/* > on entry, or set according to MODE and COND as described */
/* > below. If the matrix is Hermitian, the real part of D */
/* > will be taken. May be changed on exit if MODE is nonzero. */
/* > \endverbatim */
/* > */
/* > \param[in] MODE */
/* > \verbatim */
/* > MODE is INTEGER */
/* > On entry describes how D is to be used: */
/* > MODE = 0 means use D as input */
/* > MODE = 1 sets D(1)=1 and D(2:N)=1.0/COND */
/* > MODE = 2 sets D(1:N-1)=1 and D(N)=1.0/COND */
/* > MODE = 3 sets D(I)=COND**(-(I-1)/(N-1)) */
/* > MODE = 4 sets D(i)=1 - (i-1)/(N-1)*(1 - 1/COND) */
/* > MODE = 5 sets D to random numbers in the range */
/* > ( 1/COND , 1 ) such that their logarithms */
/* > are uniformly distributed. */
/* > MODE = 6 set D to random numbers from same distribution */
/* > as the rest of the matrix. */
/* > MODE < 0 has the same meaning as ABS(MODE), except that */
/* > the order of the elements of D is reversed. */
/* > Thus if MODE is positive, D has entries ranging from */
/* > 1 to 1/COND, if negative, from 1/COND to 1, */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] COND */
/* > \verbatim */
/* > COND is REAL */
/* > On entry, used as described under MODE above. */
/* > If used, it must be >= 1. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] DMAX */
/* > \verbatim */
/* > DMAX is COMPLEX */
/* > If MODE neither -6, 0 nor 6, the diagonal is scaled by */
/* > DMAX / f2cmax(abs(D(i))), so that maximum absolute entry */
/* > of diagonal is abs(DMAX). If DMAX is complex (or zero), */
/* > diagonal will be scaled by a complex number (or zero). */
/* > \endverbatim */
/* > */
/* > \param[in] RSIGN */
/* > \verbatim */
/* > RSIGN is CHARACTER*1 */
/* > If MODE neither -6, 0 nor 6, specifies sign of diagonal */
/* > as follows: */
/* > 'T' => diagonal entries are multiplied by a random complex */
/* > number uniformly distributed with absolute value 1 */
/* > 'F' => diagonal unchanged */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] GRADE */
/* > \verbatim */
/* > GRADE is CHARACTER*1 */
/* > Specifies grading of matrix as follows: */
/* > 'N' => no grading */
/* > 'L' => matrix premultiplied by diag( DL ) */
/* > (only if matrix nonsymmetric) */
/* > 'R' => matrix postmultiplied by diag( DR ) */
/* > (only if matrix nonsymmetric) */
/* > 'B' => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by diag( DR ) */
/* > (only if matrix nonsymmetric) */
/* > 'H' => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by diag( CONJG(DL) ) */
/* > (only if matrix Hermitian or nonsymmetric) */
/* > 'S' => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by diag( DL ) */
/* > (only if matrix symmetric or nonsymmetric) */
/* > 'E' => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by inv( diag( DL ) ) */
/* > ( 'S' for similarity ) */
/* > (only if matrix nonsymmetric) */
/* > Note: if GRADE='S', then M must equal N. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] DL */
/* > \verbatim */
/* > DL is COMPLEX array, dimension (M) */
/* > If MODEL=0, then on entry this array specifies the diagonal */
/* > entries of a diagonal matrix used as described under GRADE */
/* > above. If MODEL is not zero, then DL will be set according */
/* > to MODEL and CONDL, analogous to the way D is set according */
/* > to MODE and COND (except there is no DMAX parameter for DL). */
/* > If GRADE='E', then DL cannot have zero entries. */
/* > Not referenced if GRADE = 'N' or 'R'. Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[in] MODEL */
/* > \verbatim */
/* > MODEL is INTEGER */
/* > This specifies how the diagonal array DL is to be computed, */
/* > just as MODE specifies how D is to be computed. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] CONDL */
/* > \verbatim */
/* > CONDL is REAL */
/* > When MODEL is not zero, this specifies the condition number */
/* > of the computed DL. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] DR */
/* > \verbatim */
/* > DR is COMPLEX array, dimension (N) */
/* > If MODER=0, then on entry this array specifies the diagonal */
/* > entries of a diagonal matrix used as described under GRADE */
/* > above. If MODER is not zero, then DR will be set according */
/* > to MODER and CONDR, analogous to the way D is set according */
/* > to MODE and COND (except there is no DMAX parameter for DR). */
/* > Not referenced if GRADE = 'N', 'L', 'H' or 'S'. */
/* > Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[in] MODER */
/* > \verbatim */
/* > MODER is INTEGER */
/* > This specifies how the diagonal array DR is to be computed, */
/* > just as MODE specifies how D is to be computed. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] CONDR */
/* > \verbatim */
/* > CONDR is REAL */
/* > When MODER is not zero, this specifies the condition number */
/* > of the computed DR. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] PIVTNG */
/* > \verbatim */
/* > PIVTNG is CHARACTER*1 */
/* > On entry specifies pivoting permutations as follows: */
/* > 'N' or ' ' => none. */
/* > 'L' => left or row pivoting (matrix must be nonsymmetric). */
/* > 'R' => right or column pivoting (matrix must be */
/* > nonsymmetric). */
/* > 'B' or 'F' => both or full pivoting, i.e., on both sides. */
/* > In this case, M must equal N */
/* > */
/* > If two calls to CLATMR both have full bandwidth (KL = M-1 */
/* > and KU = N-1), and differ only in the PIVTNG and PACK */
/* > parameters, then the matrices generated will differ only */
/* > in the order of the rows and/or columns, and otherwise */
/* > contain the same data. This consistency cannot be */
/* > maintained with less than full bandwidth. */
/* > \endverbatim */
/* > */
/* > \param[in] IPIVOT */
/* > \verbatim */
/* > IPIVOT is INTEGER array, dimension (N or M) */
/* > This array specifies the permutation used. After the */
/* > basic matrix is generated, the rows, columns, or both */
/* > are permuted. If, say, row pivoting is selected, CLATMR */
/* > starts with the *last* row and interchanges the M-th and */
/* > IPIVOT(M)-th rows, then moves to the next-to-last row, */
/* > interchanging the (M-1)-th and the IPIVOT(M-1)-th rows, */
/* > and so on. In terms of "2-cycles", the permutation is */
/* > (1 IPIVOT(1)) (2 IPIVOT(2)) ... (M IPIVOT(M)) */
/* > where the rightmost cycle is applied first. This is the */
/* > *inverse* of the effect of pivoting in LINPACK. The idea */
/* > is that factoring (with pivoting) an identity matrix */
/* > which has been inverse-pivoted in this way should */
/* > result in a pivot vector identical to IPIVOT. */
/* > Not referenced if PIVTNG = 'N'. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] KL */
/* > \verbatim */
/* > KL is INTEGER */
/* > On entry specifies the lower bandwidth of the matrix. For */
/* > example, KL=0 implies upper triangular, KL=1 implies upper */
/* > Hessenberg, and KL at least M-1 implies the matrix is not */
/* > banded. Must equal KU if matrix is symmetric or Hermitian. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] KU */
/* > \verbatim */
/* > KU is INTEGER */
/* > On entry specifies the upper bandwidth of the matrix. For */
/* > example, KU=0 implies lower triangular, KU=1 implies lower */
/* > Hessenberg, and KU at least N-1 implies the matrix is not */
/* > banded. Must equal KL if matrix is symmetric or Hermitian. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] SPARSE */
/* > \verbatim */
/* > SPARSE is REAL */
/* > On entry specifies the sparsity of the matrix if a sparse */
/* > matrix is to be generated. SPARSE should lie between */
/* > 0 and 1. To generate a sparse matrix, for each matrix entry */
/* > a uniform ( 0, 1 ) random number x is generated and */
/* > compared to SPARSE; if x is larger the matrix entry */
/* > is unchanged and if x is smaller the entry is set */
/* > to zero. Thus on the average a fraction SPARSE of the */
/* > entries will be set to zero. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] ANORM */
/* > \verbatim */
/* > ANORM is REAL */
/* > On entry specifies maximum entry of output matrix */
/* > (output matrix will by multiplied by a constant so that */
/* > its largest absolute entry equal ANORM) */
/* > if ANORM is nonnegative. If ANORM is negative no scaling */
/* > is done. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] PACK */
/* > \verbatim */
/* > PACK is CHARACTER*1 */
/* > On entry specifies packing of matrix as follows: */
/* > 'N' => no packing */
/* > 'U' => zero out all subdiagonal entries */
/* > (if symmetric or Hermitian) */
/* > 'L' => zero out all superdiagonal entries */
/* > (if symmetric or Hermitian) */
/* > 'C' => store the upper triangle columnwise */
/* > (only if matrix symmetric or Hermitian or */
/* > square upper triangular) */
/* > 'R' => store the lower triangle columnwise */
/* > (only if matrix symmetric or Hermitian or */
/* > square lower triangular) */
/* > (same as upper half rowwise if symmetric) */
/* > (same as conjugate upper half rowwise if Hermitian) */
/* > 'B' => store the lower triangle in band storage scheme */
/* > (only if matrix symmetric or Hermitian) */
/* > 'Q' => store the upper triangle in band storage scheme */
/* > (only if matrix symmetric or Hermitian) */
/* > 'Z' => store the entire matrix in band storage scheme */
/* > (pivoting can be provided for by using this */
/* > option to store A in the trailing rows of */
/* > the allocated storage) */
/* > */
/* > Using these options, the various LAPACK packed and banded */
/* > storage schemes can be obtained: */
/* > GB - use 'Z' */
/* > PB, HB or TB - use 'B' or 'Q' */
/* > PP, HP or TP - use 'C' or 'R' */
/* > */
/* > If two calls to CLATMR differ only in the PACK parameter, */
/* > they will generate mathematically equivalent matrices. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is COMPLEX array, dimension (LDA,N) */
/* > On exit A is the desired test matrix. Only those */
/* > entries of A which are significant on output */
/* > will be referenced (even if A is in packed or band */
/* > storage format). The 'unoccupied corners' of A in */
/* > band format will be zeroed out. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > on entry LDA specifies the first dimension of A as */
/* > declared in the calling program. */
/* > If PACK='N', 'U' or 'L', LDA must be at least f2cmax ( 1, M ). */
/* > If PACK='C' or 'R', LDA must be at least 1. */
/* > If PACK='B', or 'Q', LDA must be MIN ( KU+1, N ) */
/* > If PACK='Z', LDA must be at least KUU+KLL+1, where */
/* > KUU = MIN ( KU, N-1 ) and KLL = MIN ( KL, M-1 ) */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[out] IWORK */
/* > \verbatim */
/* > IWORK is INTEGER array, dimension (N or M) */
/* > Workspace. Not referenced if PIVTNG = 'N'. Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > Error parameter on exit: */
/* > 0 => normal return */
/* > -1 => M negative or unequal to N and SYM='S' or 'H' */
/* > -2 => N negative */
/* > -3 => DIST illegal string */
/* > -5 => SYM illegal string */
/* > -7 => MODE not in range -6 to 6 */
/* > -8 => COND less than 1.0, and MODE neither -6, 0 nor 6 */
/* > -10 => MODE neither -6, 0 nor 6 and RSIGN illegal string */
/* > -11 => GRADE illegal string, or GRADE='E' and */
/* > M not equal to N, or GRADE='L', 'R', 'B', 'S' or 'E' */
/* > and SYM = 'H', or GRADE='L', 'R', 'B', 'H' or 'E' */
/* > and SYM = 'S' */
/* > -12 => GRADE = 'E' and DL contains zero */
/* > -13 => MODEL not in range -6 to 6 and GRADE= 'L', 'B', 'H', */
/* > 'S' or 'E' */
/* > -14 => CONDL less than 1.0, GRADE='L', 'B', 'H', 'S' or 'E', */
/* > and MODEL neither -6, 0 nor 6 */
/* > -16 => MODER not in range -6 to 6 and GRADE= 'R' or 'B' */
/* > -17 => CONDR less than 1.0, GRADE='R' or 'B', and */
/* > MODER neither -6, 0 nor 6 */
/* > -18 => PIVTNG illegal string, or PIVTNG='B' or 'F' and */
/* > M not equal to N, or PIVTNG='L' or 'R' and SYM='S' */
/* > or 'H' */
/* > -19 => IPIVOT contains out of range number and */
/* > PIVTNG not equal to 'N' */
/* > -20 => KL negative */
/* > -21 => KU negative, or SYM='S' or 'H' and KU not equal to KL */
/* > -22 => SPARSE not in range 0. to 1. */
/* > -24 => PACK illegal string, or PACK='U', 'L', 'B' or 'Q' */
/* > and SYM='N', or PACK='C' and SYM='N' and either KL */
/* > not equal to 0 or N not equal to M, or PACK='R' and */
/* > SYM='N', and either KU not equal to 0 or N not equal */
/* > to M */
/* > -26 => LDA too small */
/* > 1 => Error return from CLATM1 (computing D) */
/* > 2 => Cannot scale diagonal to DMAX (f2cmax. entry is 0) */
/* > 3 => Error return from CLATM1 (computing DL) */
/* > 4 => Error return from CLATM1 (computing DR) */
/* > 5 => ANORM is positive, but matrix constructed prior to */
/* > attempting to scale it to have norm ANORM, is zero */
/* > \endverbatim */

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

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

/* > \date December 2016 */

/* > \ingroup complex_matgen */

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