You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

zlagtm.c 36 kB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169
  1. #include <math.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #include <stdio.h>
  5. #include <complex.h>
  6. #ifdef complex
  7. #undef complex
  8. #endif
  9. #ifdef I
  10. #undef I
  11. #endif
  12. #if defined(_WIN64)
  13. typedef long long BLASLONG;
  14. typedef unsigned long long BLASULONG;
  15. #else
  16. typedef long BLASLONG;
  17. typedef unsigned long BLASULONG;
  18. #endif
  19. #ifdef LAPACK_ILP64
  20. typedef BLASLONG blasint;
  21. #if defined(_WIN64)
  22. #define blasabs(x) llabs(x)
  23. #else
  24. #define blasabs(x) labs(x)
  25. #endif
  26. #else
  27. typedef int blasint;
  28. #define blasabs(x) abs(x)
  29. #endif
  30. typedef blasint integer;
  31. typedef unsigned int uinteger;
  32. typedef char *address;
  33. typedef short int shortint;
  34. typedef float real;
  35. typedef double doublereal;
  36. typedef struct { real r, i; } complex;
  37. typedef struct { doublereal r, i; } doublecomplex;
  38. #ifdef _MSC_VER
  39. static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
  40. static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
  41. static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
  42. static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
  43. #else
  44. static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
  45. static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
  46. static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
  47. static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
  48. #endif
  49. #define pCf(z) (*_pCf(z))
  50. #define pCd(z) (*_pCd(z))
  51. typedef int logical;
  52. typedef short int shortlogical;
  53. typedef char logical1;
  54. typedef char integer1;
  55. #define TRUE_ (1)
  56. #define FALSE_ (0)
  57. /* Extern is for use with -E */
  58. #ifndef Extern
  59. #define Extern extern
  60. #endif
  61. /* I/O stuff */
  62. typedef int flag;
  63. typedef int ftnlen;
  64. typedef int ftnint;
  65. /*external read, write*/
  66. typedef struct
  67. { flag cierr;
  68. ftnint ciunit;
  69. flag ciend;
  70. char *cifmt;
  71. ftnint cirec;
  72. } cilist;
  73. /*internal read, write*/
  74. typedef struct
  75. { flag icierr;
  76. char *iciunit;
  77. flag iciend;
  78. char *icifmt;
  79. ftnint icirlen;
  80. ftnint icirnum;
  81. } icilist;
  82. /*open*/
  83. typedef struct
  84. { flag oerr;
  85. ftnint ounit;
  86. char *ofnm;
  87. ftnlen ofnmlen;
  88. char *osta;
  89. char *oacc;
  90. char *ofm;
  91. ftnint orl;
  92. char *oblnk;
  93. } olist;
  94. /*close*/
  95. typedef struct
  96. { flag cerr;
  97. ftnint cunit;
  98. char *csta;
  99. } cllist;
  100. /*rewind, backspace, endfile*/
  101. typedef struct
  102. { flag aerr;
  103. ftnint aunit;
  104. } alist;
  105. /* inquire */
  106. typedef struct
  107. { flag inerr;
  108. ftnint inunit;
  109. char *infile;
  110. ftnlen infilen;
  111. ftnint *inex; /*parameters in standard's order*/
  112. ftnint *inopen;
  113. ftnint *innum;
  114. ftnint *innamed;
  115. char *inname;
  116. ftnlen innamlen;
  117. char *inacc;
  118. ftnlen inacclen;
  119. char *inseq;
  120. ftnlen inseqlen;
  121. char *indir;
  122. ftnlen indirlen;
  123. char *infmt;
  124. ftnlen infmtlen;
  125. char *inform;
  126. ftnint informlen;
  127. char *inunf;
  128. ftnlen inunflen;
  129. ftnint *inrecl;
  130. ftnint *innrec;
  131. char *inblank;
  132. ftnlen inblanklen;
  133. } inlist;
  134. #define VOID void
  135. union Multitype { /* for multiple entry points */
  136. integer1 g;
  137. shortint h;
  138. integer i;
  139. /* longint j; */
  140. real r;
  141. doublereal d;
  142. complex c;
  143. doublecomplex z;
  144. };
  145. typedef union Multitype Multitype;
  146. struct Vardesc { /* for Namelist */
  147. char *name;
  148. char *addr;
  149. ftnlen *dims;
  150. int type;
  151. };
  152. typedef struct Vardesc Vardesc;
  153. struct Namelist {
  154. char *name;
  155. Vardesc **vars;
  156. int nvars;
  157. };
  158. typedef struct Namelist Namelist;
  159. #define abs(x) ((x) >= 0 ? (x) : -(x))
  160. #define dabs(x) (fabs(x))
  161. #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
  162. #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
  163. #define dmin(a,b) (f2cmin(a,b))
  164. #define dmax(a,b) (f2cmax(a,b))
  165. #define bit_test(a,b) ((a) >> (b) & 1)
  166. #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
  167. #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
  168. #define abort_() { sig_die("Fortran abort routine called", 1); }
  169. #define c_abs(z) (cabsf(Cf(z)))
  170. #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
  171. #ifdef _MSC_VER
  172. #define c_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]);}
  173. #define z_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]);}
  174. #else
  175. #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
  176. #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
  177. #endif
  178. #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
  179. #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
  180. #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
  181. //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
  182. #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
  183. #define d_abs(x) (fabs(*(x)))
  184. #define d_acos(x) (acos(*(x)))
  185. #define d_asin(x) (asin(*(x)))
  186. #define d_atan(x) (atan(*(x)))
  187. #define d_atn2(x, y) (atan2(*(x),*(y)))
  188. #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
  189. #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
  190. #define d_cos(x) (cos(*(x)))
  191. #define d_cosh(x) (cosh(*(x)))
  192. #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
  193. #define d_exp(x) (exp(*(x)))
  194. #define d_imag(z) (cimag(Cd(z)))
  195. #define r_imag(z) (cimagf(Cf(z)))
  196. #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  197. #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  198. #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  199. #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  200. #define d_log(x) (log(*(x)))
  201. #define d_mod(x, y) (fmod(*(x), *(y)))
  202. #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
  203. #define d_nint(x) u_nint(*(x))
  204. #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
  205. #define d_sign(a,b) u_sign(*(a),*(b))
  206. #define r_sign(a,b) u_sign(*(a),*(b))
  207. #define d_sin(x) (sin(*(x)))
  208. #define d_sinh(x) (sinh(*(x)))
  209. #define d_sqrt(x) (sqrt(*(x)))
  210. #define d_tan(x) (tan(*(x)))
  211. #define d_tanh(x) (tanh(*(x)))
  212. #define i_abs(x) abs(*(x))
  213. #define i_dnnt(x) ((integer)u_nint(*(x)))
  214. #define i_len(s, n) (n)
  215. #define i_nint(x) ((integer)u_nint(*(x)))
  216. #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
  217. #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
  218. #define pow_si(B,E) spow_ui(*(B),*(E))
  219. #define pow_ri(B,E) spow_ui(*(B),*(E))
  220. #define pow_di(B,E) dpow_ui(*(B),*(E))
  221. #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
  222. #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
  223. #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
  224. #define s_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++ = ' '; }
  225. #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
  226. #define s_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]; }
  227. #define sig_die(s, kill) { exit(1); }
  228. #define s_stop(s, n) {exit(0);}
  229. static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
  230. #define z_abs(z) (cabs(Cd(z)))
  231. #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
  232. #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
  233. #define myexit_() break;
  234. #define mycycle() continue;
  235. #define myceiling(w) {ceil(w)}
  236. #define myhuge(w) {HUGE_VAL}
  237. //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
  238. #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
  239. /* procedure parameter types for -A and -C++ */
  240. #define F2C_proc_par_types 1
  241. #ifdef __cplusplus
  242. typedef logical (*L_fp)(...);
  243. #else
  244. typedef logical (*L_fp)();
  245. #endif
  246. static float spow_ui(float x, integer n) {
  247. float pow=1.0; unsigned long int u;
  248. if(n != 0) {
  249. if(n < 0) n = -n, x = 1/x;
  250. for(u = n; ; ) {
  251. if(u & 01) pow *= x;
  252. if(u >>= 1) x *= x;
  253. else break;
  254. }
  255. }
  256. return pow;
  257. }
  258. static double dpow_ui(double x, integer n) {
  259. double pow=1.0; unsigned long int u;
  260. if(n != 0) {
  261. if(n < 0) n = -n, x = 1/x;
  262. for(u = n; ; ) {
  263. if(u & 01) pow *= x;
  264. if(u >>= 1) x *= x;
  265. else break;
  266. }
  267. }
  268. return pow;
  269. }
  270. #ifdef _MSC_VER
  271. static _Fcomplex cpow_ui(complex x, integer n) {
  272. complex pow={1.0,0.0}; unsigned long int u;
  273. if(n != 0) {
  274. if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
  275. for(u = n; ; ) {
  276. if(u & 01) pow.r *= x.r, pow.i *= x.i;
  277. if(u >>= 1) x.r *= x.r, x.i *= x.i;
  278. else break;
  279. }
  280. }
  281. _Fcomplex p={pow.r, pow.i};
  282. return p;
  283. }
  284. #else
  285. static _Complex float cpow_ui(_Complex float x, integer n) {
  286. _Complex float pow=1.0; unsigned long int u;
  287. if(n != 0) {
  288. if(n < 0) n = -n, x = 1/x;
  289. for(u = n; ; ) {
  290. if(u & 01) pow *= x;
  291. if(u >>= 1) x *= x;
  292. else break;
  293. }
  294. }
  295. return pow;
  296. }
  297. #endif
  298. #ifdef _MSC_VER
  299. static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
  300. _Dcomplex pow={1.0,0.0}; unsigned long int u;
  301. if(n != 0) {
  302. if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
  303. for(u = n; ; ) {
  304. if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
  305. if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
  306. else break;
  307. }
  308. }
  309. _Dcomplex p = {pow._Val[0], pow._Val[1]};
  310. return p;
  311. }
  312. #else
  313. static _Complex double zpow_ui(_Complex double x, integer n) {
  314. _Complex double pow=1.0; unsigned long int u;
  315. if(n != 0) {
  316. if(n < 0) n = -n, x = 1/x;
  317. for(u = n; ; ) {
  318. if(u & 01) pow *= x;
  319. if(u >>= 1) x *= x;
  320. else break;
  321. }
  322. }
  323. return pow;
  324. }
  325. #endif
  326. static integer pow_ii(integer x, integer n) {
  327. integer pow; unsigned long int u;
  328. if (n <= 0) {
  329. if (n == 0 || x == 1) pow = 1;
  330. else if (x != -1) pow = x == 0 ? 1/x : 0;
  331. else n = -n;
  332. }
  333. if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
  334. u = n;
  335. for(pow = 1; ; ) {
  336. if(u & 01) pow *= x;
  337. if(u >>= 1) x *= x;
  338. else break;
  339. }
  340. }
  341. return pow;
  342. }
  343. static integer dmaxloc_(double *w, integer s, integer e, integer *n)
  344. {
  345. double m; integer i, mi;
  346. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  347. if (w[i-1]>m) mi=i ,m=w[i-1];
  348. return mi-s+1;
  349. }
  350. static integer smaxloc_(float *w, integer s, integer e, integer *n)
  351. {
  352. float m; integer i, mi;
  353. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  354. if (w[i-1]>m) mi=i ,m=w[i-1];
  355. return mi-s+1;
  356. }
  357. static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  358. integer n = *n_, incx = *incx_, incy = *incy_, i;
  359. #ifdef _MSC_VER
  360. _Fcomplex zdotc = {0.0, 0.0};
  361. if (incx == 1 && incy == 1) {
  362. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  363. zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
  364. zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
  365. }
  366. } else {
  367. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  368. zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
  369. zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
  370. }
  371. }
  372. pCf(z) = zdotc;
  373. }
  374. #else
  375. _Complex float zdotc = 0.0;
  376. if (incx == 1 && incy == 1) {
  377. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  378. zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
  379. }
  380. } else {
  381. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  382. zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
  383. }
  384. }
  385. pCf(z) = zdotc;
  386. }
  387. #endif
  388. static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  389. integer n = *n_, incx = *incx_, incy = *incy_, i;
  390. #ifdef _MSC_VER
  391. _Dcomplex zdotc = {0.0, 0.0};
  392. if (incx == 1 && incy == 1) {
  393. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  394. zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
  395. zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
  396. }
  397. } else {
  398. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  399. zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
  400. zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
  401. }
  402. }
  403. pCd(z) = zdotc;
  404. }
  405. #else
  406. _Complex double zdotc = 0.0;
  407. if (incx == 1 && incy == 1) {
  408. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  409. zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
  410. }
  411. } else {
  412. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  413. zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
  414. }
  415. }
  416. pCd(z) = zdotc;
  417. }
  418. #endif
  419. static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  420. integer n = *n_, incx = *incx_, incy = *incy_, i;
  421. #ifdef _MSC_VER
  422. _Fcomplex zdotc = {0.0, 0.0};
  423. if (incx == 1 && incy == 1) {
  424. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  425. zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
  426. zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
  427. }
  428. } else {
  429. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  430. zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
  431. zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
  432. }
  433. }
  434. pCf(z) = zdotc;
  435. }
  436. #else
  437. _Complex float zdotc = 0.0;
  438. if (incx == 1 && incy == 1) {
  439. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  440. zdotc += Cf(&x[i]) * Cf(&y[i]);
  441. }
  442. } else {
  443. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  444. zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
  445. }
  446. }
  447. pCf(z) = zdotc;
  448. }
  449. #endif
  450. static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  451. integer n = *n_, incx = *incx_, incy = *incy_, i;
  452. #ifdef _MSC_VER
  453. _Dcomplex zdotc = {0.0, 0.0};
  454. if (incx == 1 && incy == 1) {
  455. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  456. zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
  457. zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
  458. }
  459. } else {
  460. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  461. zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
  462. zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
  463. }
  464. }
  465. pCd(z) = zdotc;
  466. }
  467. #else
  468. _Complex double zdotc = 0.0;
  469. if (incx == 1 && incy == 1) {
  470. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  471. zdotc += Cd(&x[i]) * Cd(&y[i]);
  472. }
  473. } else {
  474. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  475. zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
  476. }
  477. }
  478. pCd(z) = zdotc;
  479. }
  480. #endif
  481. /* -- translated by f2c (version 20000121).
  482. You must link the resulting object file with the libraries:
  483. -lf2c -lm (in that order)
  484. */
  485. /* > \brief \b ZLAGTM performs a matrix-matrix product of the form C = αAB+βC, where A is a tridiagonal matr
  486. ix, B and C are rectangular matrices, and α and β are scalars, which may be 0, 1, or -1. */
  487. /* =========== DOCUMENTATION =========== */
  488. /* Online html documentation available at */
  489. /* http://www.netlib.org/lapack/explore-html/ */
  490. /* > \htmlonly */
  491. /* > Download ZLAGTM + dependencies */
  492. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlagtm.
  493. f"> */
  494. /* > [TGZ]</a> */
  495. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlagtm.
  496. f"> */
  497. /* > [ZIP]</a> */
  498. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlagtm.
  499. f"> */
  500. /* > [TXT]</a> */
  501. /* > \endhtmlonly */
  502. /* Definition: */
  503. /* =========== */
  504. /* SUBROUTINE ZLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA, */
  505. /* B, LDB ) */
  506. /* CHARACTER TRANS */
  507. /* INTEGER LDB, LDX, N, NRHS */
  508. /* DOUBLE PRECISION ALPHA, BETA */
  509. /* COMPLEX*16 B( LDB, * ), D( * ), DL( * ), DU( * ), */
  510. /* $ X( LDX, * ) */
  511. /* > \par Purpose: */
  512. /* ============= */
  513. /* > */
  514. /* > \verbatim */
  515. /* > */
  516. /* > ZLAGTM performs a matrix-vector product of the form */
  517. /* > */
  518. /* > B := alpha * A * X + beta * B */
  519. /* > */
  520. /* > where A is a tridiagonal matrix of order N, B and X are N by NRHS */
  521. /* > matrices, and alpha and beta are real scalars, each of which may be */
  522. /* > 0., 1., or -1. */
  523. /* > \endverbatim */
  524. /* Arguments: */
  525. /* ========== */
  526. /* > \param[in] TRANS */
  527. /* > \verbatim */
  528. /* > TRANS is CHARACTER*1 */
  529. /* > Specifies the operation applied to A. */
  530. /* > = 'N': No transpose, B := alpha * A * X + beta * B */
  531. /* > = 'T': Transpose, B := alpha * A**T * X + beta * B */
  532. /* > = 'C': Conjugate transpose, B := alpha * A**H * X + beta * B */
  533. /* > \endverbatim */
  534. /* > */
  535. /* > \param[in] N */
  536. /* > \verbatim */
  537. /* > N is INTEGER */
  538. /* > The order of the matrix A. N >= 0. */
  539. /* > \endverbatim */
  540. /* > */
  541. /* > \param[in] NRHS */
  542. /* > \verbatim */
  543. /* > NRHS is INTEGER */
  544. /* > The number of right hand sides, i.e., the number of columns */
  545. /* > of the matrices X and B. */
  546. /* > \endverbatim */
  547. /* > */
  548. /* > \param[in] ALPHA */
  549. /* > \verbatim */
  550. /* > ALPHA is DOUBLE PRECISION */
  551. /* > The scalar alpha. ALPHA must be 0., 1., or -1.; otherwise, */
  552. /* > it is assumed to be 0. */
  553. /* > \endverbatim */
  554. /* > */
  555. /* > \param[in] DL */
  556. /* > \verbatim */
  557. /* > DL is COMPLEX*16 array, dimension (N-1) */
  558. /* > The (n-1) sub-diagonal elements of T. */
  559. /* > \endverbatim */
  560. /* > */
  561. /* > \param[in] D */
  562. /* > \verbatim */
  563. /* > D is COMPLEX*16 array, dimension (N) */
  564. /* > The diagonal elements of T. */
  565. /* > \endverbatim */
  566. /* > */
  567. /* > \param[in] DU */
  568. /* > \verbatim */
  569. /* > DU is COMPLEX*16 array, dimension (N-1) */
  570. /* > The (n-1) super-diagonal elements of T. */
  571. /* > \endverbatim */
  572. /* > */
  573. /* > \param[in] X */
  574. /* > \verbatim */
  575. /* > X is COMPLEX*16 array, dimension (LDX,NRHS) */
  576. /* > The N by NRHS matrix X. */
  577. /* > \endverbatim */
  578. /* > */
  579. /* > \param[in] LDX */
  580. /* > \verbatim */
  581. /* > LDX is INTEGER */
  582. /* > The leading dimension of the array X. LDX >= f2cmax(N,1). */
  583. /* > \endverbatim */
  584. /* > */
  585. /* > \param[in] BETA */
  586. /* > \verbatim */
  587. /* > BETA is DOUBLE PRECISION */
  588. /* > The scalar beta. BETA must be 0., 1., or -1.; otherwise, */
  589. /* > it is assumed to be 1. */
  590. /* > \endverbatim */
  591. /* > */
  592. /* > \param[in,out] B */
  593. /* > \verbatim */
  594. /* > B is COMPLEX*16 array, dimension (LDB,NRHS) */
  595. /* > On entry, the N by NRHS matrix B. */
  596. /* > On exit, B is overwritten by the matrix expression */
  597. /* > B := alpha * A * X + beta * B. */
  598. /* > \endverbatim */
  599. /* > */
  600. /* > \param[in] LDB */
  601. /* > \verbatim */
  602. /* > LDB is INTEGER */
  603. /* > The leading dimension of the array B. LDB >= f2cmax(N,1). */
  604. /* > \endverbatim */
  605. /* Authors: */
  606. /* ======== */
  607. /* > \author Univ. of Tennessee */
  608. /* > \author Univ. of California Berkeley */
  609. /* > \author Univ. of Colorado Denver */
  610. /* > \author NAG Ltd. */
  611. /* > \date December 2016 */
  612. /* > \ingroup complex16OTHERauxiliary */
  613. /* ===================================================================== */
  614. /* Subroutine */ void zlagtm_(char *trans, integer *n, integer *nrhs,
  615. doublereal *alpha, doublecomplex *dl, doublecomplex *d__,
  616. doublecomplex *du, doublecomplex *x, integer *ldx, doublereal *beta,
  617. doublecomplex *b, integer *ldb)
  618. {
  619. /* System generated locals */
  620. integer b_dim1, b_offset, x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5,
  621. i__6, i__7, i__8, i__9, i__10;
  622. doublecomplex z__1, z__2, z__3, z__4, z__5, z__6, z__7, z__8, z__9;
  623. /* Local variables */
  624. integer i__, j;
  625. extern logical lsame_(char *, char *);
  626. /* -- LAPACK auxiliary routine (version 3.7.0) -- */
  627. /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
  628. /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  629. /* December 2016 */
  630. /* ===================================================================== */
  631. /* Parameter adjustments */
  632. --dl;
  633. --d__;
  634. --du;
  635. x_dim1 = *ldx;
  636. x_offset = 1 + x_dim1 * 1;
  637. x -= x_offset;
  638. b_dim1 = *ldb;
  639. b_offset = 1 + b_dim1 * 1;
  640. b -= b_offset;
  641. /* Function Body */
  642. if (*n == 0) {
  643. return;
  644. }
  645. /* Multiply B by BETA if BETA.NE.1. */
  646. if (*beta == 0.) {
  647. i__1 = *nrhs;
  648. for (j = 1; j <= i__1; ++j) {
  649. i__2 = *n;
  650. for (i__ = 1; i__ <= i__2; ++i__) {
  651. i__3 = i__ + j * b_dim1;
  652. b[i__3].r = 0., b[i__3].i = 0.;
  653. /* L10: */
  654. }
  655. /* L20: */
  656. }
  657. } else if (*beta == -1.) {
  658. i__1 = *nrhs;
  659. for (j = 1; j <= i__1; ++j) {
  660. i__2 = *n;
  661. for (i__ = 1; i__ <= i__2; ++i__) {
  662. i__3 = i__ + j * b_dim1;
  663. i__4 = i__ + j * b_dim1;
  664. z__1.r = -b[i__4].r, z__1.i = -b[i__4].i;
  665. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  666. /* L30: */
  667. }
  668. /* L40: */
  669. }
  670. }
  671. if (*alpha == 1.) {
  672. if (lsame_(trans, "N")) {
  673. /* Compute B := B + A*X */
  674. i__1 = *nrhs;
  675. for (j = 1; j <= i__1; ++j) {
  676. if (*n == 1) {
  677. i__2 = j * b_dim1 + 1;
  678. i__3 = j * b_dim1 + 1;
  679. i__4 = j * x_dim1 + 1;
  680. z__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  681. z__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  682. .r;
  683. z__1.r = b[i__3].r + z__2.r, z__1.i = b[i__3].i + z__2.i;
  684. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  685. } else {
  686. i__2 = j * b_dim1 + 1;
  687. i__3 = j * b_dim1 + 1;
  688. i__4 = j * x_dim1 + 1;
  689. z__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  690. z__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  691. .r;
  692. z__2.r = b[i__3].r + z__3.r, z__2.i = b[i__3].i + z__3.i;
  693. i__5 = j * x_dim1 + 2;
  694. z__4.r = du[1].r * x[i__5].r - du[1].i * x[i__5].i,
  695. z__4.i = du[1].r * x[i__5].i + du[1].i * x[i__5]
  696. .r;
  697. z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i;
  698. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  699. i__2 = *n + j * b_dim1;
  700. i__3 = *n + j * b_dim1;
  701. i__4 = *n - 1;
  702. i__5 = *n - 1 + j * x_dim1;
  703. z__3.r = dl[i__4].r * x[i__5].r - dl[i__4].i * x[i__5].i,
  704. z__3.i = dl[i__4].r * x[i__5].i + dl[i__4].i * x[
  705. i__5].r;
  706. z__2.r = b[i__3].r + z__3.r, z__2.i = b[i__3].i + z__3.i;
  707. i__6 = *n;
  708. i__7 = *n + j * x_dim1;
  709. z__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
  710. .i, z__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
  711. .i * x[i__7].r;
  712. z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i;
  713. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  714. i__2 = *n - 1;
  715. for (i__ = 2; i__ <= i__2; ++i__) {
  716. i__3 = i__ + j * b_dim1;
  717. i__4 = i__ + j * b_dim1;
  718. i__5 = i__ - 1;
  719. i__6 = i__ - 1 + j * x_dim1;
  720. z__4.r = dl[i__5].r * x[i__6].r - dl[i__5].i * x[i__6]
  721. .i, z__4.i = dl[i__5].r * x[i__6].i + dl[i__5]
  722. .i * x[i__6].r;
  723. z__3.r = b[i__4].r + z__4.r, z__3.i = b[i__4].i +
  724. z__4.i;
  725. i__7 = i__;
  726. i__8 = i__ + j * x_dim1;
  727. z__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
  728. i__8].i, z__5.i = d__[i__7].r * x[i__8].i +
  729. d__[i__7].i * x[i__8].r;
  730. z__2.r = z__3.r + z__5.r, z__2.i = z__3.i + z__5.i;
  731. i__9 = i__;
  732. i__10 = i__ + 1 + j * x_dim1;
  733. z__6.r = du[i__9].r * x[i__10].r - du[i__9].i * x[
  734. i__10].i, z__6.i = du[i__9].r * x[i__10].i +
  735. du[i__9].i * x[i__10].r;
  736. z__1.r = z__2.r + z__6.r, z__1.i = z__2.i + z__6.i;
  737. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  738. /* L50: */
  739. }
  740. }
  741. /* L60: */
  742. }
  743. } else if (lsame_(trans, "T")) {
  744. /* Compute B := B + A**T * X */
  745. i__1 = *nrhs;
  746. for (j = 1; j <= i__1; ++j) {
  747. if (*n == 1) {
  748. i__2 = j * b_dim1 + 1;
  749. i__3 = j * b_dim1 + 1;
  750. i__4 = j * x_dim1 + 1;
  751. z__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  752. z__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  753. .r;
  754. z__1.r = b[i__3].r + z__2.r, z__1.i = b[i__3].i + z__2.i;
  755. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  756. } else {
  757. i__2 = j * b_dim1 + 1;
  758. i__3 = j * b_dim1 + 1;
  759. i__4 = j * x_dim1 + 1;
  760. z__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  761. z__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  762. .r;
  763. z__2.r = b[i__3].r + z__3.r, z__2.i = b[i__3].i + z__3.i;
  764. i__5 = j * x_dim1 + 2;
  765. z__4.r = dl[1].r * x[i__5].r - dl[1].i * x[i__5].i,
  766. z__4.i = dl[1].r * x[i__5].i + dl[1].i * x[i__5]
  767. .r;
  768. z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i;
  769. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  770. i__2 = *n + j * b_dim1;
  771. i__3 = *n + j * b_dim1;
  772. i__4 = *n - 1;
  773. i__5 = *n - 1 + j * x_dim1;
  774. z__3.r = du[i__4].r * x[i__5].r - du[i__4].i * x[i__5].i,
  775. z__3.i = du[i__4].r * x[i__5].i + du[i__4].i * x[
  776. i__5].r;
  777. z__2.r = b[i__3].r + z__3.r, z__2.i = b[i__3].i + z__3.i;
  778. i__6 = *n;
  779. i__7 = *n + j * x_dim1;
  780. z__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
  781. .i, z__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
  782. .i * x[i__7].r;
  783. z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i;
  784. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  785. i__2 = *n - 1;
  786. for (i__ = 2; i__ <= i__2; ++i__) {
  787. i__3 = i__ + j * b_dim1;
  788. i__4 = i__ + j * b_dim1;
  789. i__5 = i__ - 1;
  790. i__6 = i__ - 1 + j * x_dim1;
  791. z__4.r = du[i__5].r * x[i__6].r - du[i__5].i * x[i__6]
  792. .i, z__4.i = du[i__5].r * x[i__6].i + du[i__5]
  793. .i * x[i__6].r;
  794. z__3.r = b[i__4].r + z__4.r, z__3.i = b[i__4].i +
  795. z__4.i;
  796. i__7 = i__;
  797. i__8 = i__ + j * x_dim1;
  798. z__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
  799. i__8].i, z__5.i = d__[i__7].r * x[i__8].i +
  800. d__[i__7].i * x[i__8].r;
  801. z__2.r = z__3.r + z__5.r, z__2.i = z__3.i + z__5.i;
  802. i__9 = i__;
  803. i__10 = i__ + 1 + j * x_dim1;
  804. z__6.r = dl[i__9].r * x[i__10].r - dl[i__9].i * x[
  805. i__10].i, z__6.i = dl[i__9].r * x[i__10].i +
  806. dl[i__9].i * x[i__10].r;
  807. z__1.r = z__2.r + z__6.r, z__1.i = z__2.i + z__6.i;
  808. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  809. /* L70: */
  810. }
  811. }
  812. /* L80: */
  813. }
  814. } else if (lsame_(trans, "C")) {
  815. /* Compute B := B + A**H * X */
  816. i__1 = *nrhs;
  817. for (j = 1; j <= i__1; ++j) {
  818. if (*n == 1) {
  819. i__2 = j * b_dim1 + 1;
  820. i__3 = j * b_dim1 + 1;
  821. d_cnjg(&z__3, &d__[1]);
  822. i__4 = j * x_dim1 + 1;
  823. z__2.r = z__3.r * x[i__4].r - z__3.i * x[i__4].i, z__2.i =
  824. z__3.r * x[i__4].i + z__3.i * x[i__4].r;
  825. z__1.r = b[i__3].r + z__2.r, z__1.i = b[i__3].i + z__2.i;
  826. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  827. } else {
  828. i__2 = j * b_dim1 + 1;
  829. i__3 = j * b_dim1 + 1;
  830. d_cnjg(&z__4, &d__[1]);
  831. i__4 = j * x_dim1 + 1;
  832. z__3.r = z__4.r * x[i__4].r - z__4.i * x[i__4].i, z__3.i =
  833. z__4.r * x[i__4].i + z__4.i * x[i__4].r;
  834. z__2.r = b[i__3].r + z__3.r, z__2.i = b[i__3].i + z__3.i;
  835. d_cnjg(&z__6, &dl[1]);
  836. i__5 = j * x_dim1 + 2;
  837. z__5.r = z__6.r * x[i__5].r - z__6.i * x[i__5].i, z__5.i =
  838. z__6.r * x[i__5].i + z__6.i * x[i__5].r;
  839. z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
  840. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  841. i__2 = *n + j * b_dim1;
  842. i__3 = *n + j * b_dim1;
  843. d_cnjg(&z__4, &du[*n - 1]);
  844. i__4 = *n - 1 + j * x_dim1;
  845. z__3.r = z__4.r * x[i__4].r - z__4.i * x[i__4].i, z__3.i =
  846. z__4.r * x[i__4].i + z__4.i * x[i__4].r;
  847. z__2.r = b[i__3].r + z__3.r, z__2.i = b[i__3].i + z__3.i;
  848. d_cnjg(&z__6, &d__[*n]);
  849. i__5 = *n + j * x_dim1;
  850. z__5.r = z__6.r * x[i__5].r - z__6.i * x[i__5].i, z__5.i =
  851. z__6.r * x[i__5].i + z__6.i * x[i__5].r;
  852. z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
  853. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  854. i__2 = *n - 1;
  855. for (i__ = 2; i__ <= i__2; ++i__) {
  856. i__3 = i__ + j * b_dim1;
  857. i__4 = i__ + j * b_dim1;
  858. d_cnjg(&z__5, &du[i__ - 1]);
  859. i__5 = i__ - 1 + j * x_dim1;
  860. z__4.r = z__5.r * x[i__5].r - z__5.i * x[i__5].i,
  861. z__4.i = z__5.r * x[i__5].i + z__5.i * x[i__5]
  862. .r;
  863. z__3.r = b[i__4].r + z__4.r, z__3.i = b[i__4].i +
  864. z__4.i;
  865. d_cnjg(&z__7, &d__[i__]);
  866. i__6 = i__ + j * x_dim1;
  867. z__6.r = z__7.r * x[i__6].r - z__7.i * x[i__6].i,
  868. z__6.i = z__7.r * x[i__6].i + z__7.i * x[i__6]
  869. .r;
  870. z__2.r = z__3.r + z__6.r, z__2.i = z__3.i + z__6.i;
  871. d_cnjg(&z__9, &dl[i__]);
  872. i__7 = i__ + 1 + j * x_dim1;
  873. z__8.r = z__9.r * x[i__7].r - z__9.i * x[i__7].i,
  874. z__8.i = z__9.r * x[i__7].i + z__9.i * x[i__7]
  875. .r;
  876. z__1.r = z__2.r + z__8.r, z__1.i = z__2.i + z__8.i;
  877. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  878. /* L90: */
  879. }
  880. }
  881. /* L100: */
  882. }
  883. }
  884. } else if (*alpha == -1.) {
  885. if (lsame_(trans, "N")) {
  886. /* Compute B := B - A*X */
  887. i__1 = *nrhs;
  888. for (j = 1; j <= i__1; ++j) {
  889. if (*n == 1) {
  890. i__2 = j * b_dim1 + 1;
  891. i__3 = j * b_dim1 + 1;
  892. i__4 = j * x_dim1 + 1;
  893. z__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  894. z__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  895. .r;
  896. z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i - z__2.i;
  897. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  898. } else {
  899. i__2 = j * b_dim1 + 1;
  900. i__3 = j * b_dim1 + 1;
  901. i__4 = j * x_dim1 + 1;
  902. z__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  903. z__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  904. .r;
  905. z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
  906. i__5 = j * x_dim1 + 2;
  907. z__4.r = du[1].r * x[i__5].r - du[1].i * x[i__5].i,
  908. z__4.i = du[1].r * x[i__5].i + du[1].i * x[i__5]
  909. .r;
  910. z__1.r = z__2.r - z__4.r, z__1.i = z__2.i - z__4.i;
  911. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  912. i__2 = *n + j * b_dim1;
  913. i__3 = *n + j * b_dim1;
  914. i__4 = *n - 1;
  915. i__5 = *n - 1 + j * x_dim1;
  916. z__3.r = dl[i__4].r * x[i__5].r - dl[i__4].i * x[i__5].i,
  917. z__3.i = dl[i__4].r * x[i__5].i + dl[i__4].i * x[
  918. i__5].r;
  919. z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
  920. i__6 = *n;
  921. i__7 = *n + j * x_dim1;
  922. z__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
  923. .i, z__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
  924. .i * x[i__7].r;
  925. z__1.r = z__2.r - z__4.r, z__1.i = z__2.i - z__4.i;
  926. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  927. i__2 = *n - 1;
  928. for (i__ = 2; i__ <= i__2; ++i__) {
  929. i__3 = i__ + j * b_dim1;
  930. i__4 = i__ + j * b_dim1;
  931. i__5 = i__ - 1;
  932. i__6 = i__ - 1 + j * x_dim1;
  933. z__4.r = dl[i__5].r * x[i__6].r - dl[i__5].i * x[i__6]
  934. .i, z__4.i = dl[i__5].r * x[i__6].i + dl[i__5]
  935. .i * x[i__6].r;
  936. z__3.r = b[i__4].r - z__4.r, z__3.i = b[i__4].i -
  937. z__4.i;
  938. i__7 = i__;
  939. i__8 = i__ + j * x_dim1;
  940. z__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
  941. i__8].i, z__5.i = d__[i__7].r * x[i__8].i +
  942. d__[i__7].i * x[i__8].r;
  943. z__2.r = z__3.r - z__5.r, z__2.i = z__3.i - z__5.i;
  944. i__9 = i__;
  945. i__10 = i__ + 1 + j * x_dim1;
  946. z__6.r = du[i__9].r * x[i__10].r - du[i__9].i * x[
  947. i__10].i, z__6.i = du[i__9].r * x[i__10].i +
  948. du[i__9].i * x[i__10].r;
  949. z__1.r = z__2.r - z__6.r, z__1.i = z__2.i - z__6.i;
  950. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  951. /* L110: */
  952. }
  953. }
  954. /* L120: */
  955. }
  956. } else if (lsame_(trans, "T")) {
  957. /* Compute B := B - A**T *X */
  958. i__1 = *nrhs;
  959. for (j = 1; j <= i__1; ++j) {
  960. if (*n == 1) {
  961. i__2 = j * b_dim1 + 1;
  962. i__3 = j * b_dim1 + 1;
  963. i__4 = j * x_dim1 + 1;
  964. z__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  965. z__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  966. .r;
  967. z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i - z__2.i;
  968. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  969. } else {
  970. i__2 = j * b_dim1 + 1;
  971. i__3 = j * b_dim1 + 1;
  972. i__4 = j * x_dim1 + 1;
  973. z__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
  974. z__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
  975. .r;
  976. z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
  977. i__5 = j * x_dim1 + 2;
  978. z__4.r = dl[1].r * x[i__5].r - dl[1].i * x[i__5].i,
  979. z__4.i = dl[1].r * x[i__5].i + dl[1].i * x[i__5]
  980. .r;
  981. z__1.r = z__2.r - z__4.r, z__1.i = z__2.i - z__4.i;
  982. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  983. i__2 = *n + j * b_dim1;
  984. i__3 = *n + j * b_dim1;
  985. i__4 = *n - 1;
  986. i__5 = *n - 1 + j * x_dim1;
  987. z__3.r = du[i__4].r * x[i__5].r - du[i__4].i * x[i__5].i,
  988. z__3.i = du[i__4].r * x[i__5].i + du[i__4].i * x[
  989. i__5].r;
  990. z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
  991. i__6 = *n;
  992. i__7 = *n + j * x_dim1;
  993. z__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
  994. .i, z__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
  995. .i * x[i__7].r;
  996. z__1.r = z__2.r - z__4.r, z__1.i = z__2.i - z__4.i;
  997. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  998. i__2 = *n - 1;
  999. for (i__ = 2; i__ <= i__2; ++i__) {
  1000. i__3 = i__ + j * b_dim1;
  1001. i__4 = i__ + j * b_dim1;
  1002. i__5 = i__ - 1;
  1003. i__6 = i__ - 1 + j * x_dim1;
  1004. z__4.r = du[i__5].r * x[i__6].r - du[i__5].i * x[i__6]
  1005. .i, z__4.i = du[i__5].r * x[i__6].i + du[i__5]
  1006. .i * x[i__6].r;
  1007. z__3.r = b[i__4].r - z__4.r, z__3.i = b[i__4].i -
  1008. z__4.i;
  1009. i__7 = i__;
  1010. i__8 = i__ + j * x_dim1;
  1011. z__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
  1012. i__8].i, z__5.i = d__[i__7].r * x[i__8].i +
  1013. d__[i__7].i * x[i__8].r;
  1014. z__2.r = z__3.r - z__5.r, z__2.i = z__3.i - z__5.i;
  1015. i__9 = i__;
  1016. i__10 = i__ + 1 + j * x_dim1;
  1017. z__6.r = dl[i__9].r * x[i__10].r - dl[i__9].i * x[
  1018. i__10].i, z__6.i = dl[i__9].r * x[i__10].i +
  1019. dl[i__9].i * x[i__10].r;
  1020. z__1.r = z__2.r - z__6.r, z__1.i = z__2.i - z__6.i;
  1021. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  1022. /* L130: */
  1023. }
  1024. }
  1025. /* L140: */
  1026. }
  1027. } else if (lsame_(trans, "C")) {
  1028. /* Compute B := B - A**H *X */
  1029. i__1 = *nrhs;
  1030. for (j = 1; j <= i__1; ++j) {
  1031. if (*n == 1) {
  1032. i__2 = j * b_dim1 + 1;
  1033. i__3 = j * b_dim1 + 1;
  1034. d_cnjg(&z__3, &d__[1]);
  1035. i__4 = j * x_dim1 + 1;
  1036. z__2.r = z__3.r * x[i__4].r - z__3.i * x[i__4].i, z__2.i =
  1037. z__3.r * x[i__4].i + z__3.i * x[i__4].r;
  1038. z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i - z__2.i;
  1039. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  1040. } else {
  1041. i__2 = j * b_dim1 + 1;
  1042. i__3 = j * b_dim1 + 1;
  1043. d_cnjg(&z__4, &d__[1]);
  1044. i__4 = j * x_dim1 + 1;
  1045. z__3.r = z__4.r * x[i__4].r - z__4.i * x[i__4].i, z__3.i =
  1046. z__4.r * x[i__4].i + z__4.i * x[i__4].r;
  1047. z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
  1048. d_cnjg(&z__6, &dl[1]);
  1049. i__5 = j * x_dim1 + 2;
  1050. z__5.r = z__6.r * x[i__5].r - z__6.i * x[i__5].i, z__5.i =
  1051. z__6.r * x[i__5].i + z__6.i * x[i__5].r;
  1052. z__1.r = z__2.r - z__5.r, z__1.i = z__2.i - z__5.i;
  1053. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  1054. i__2 = *n + j * b_dim1;
  1055. i__3 = *n + j * b_dim1;
  1056. d_cnjg(&z__4, &du[*n - 1]);
  1057. i__4 = *n - 1 + j * x_dim1;
  1058. z__3.r = z__4.r * x[i__4].r - z__4.i * x[i__4].i, z__3.i =
  1059. z__4.r * x[i__4].i + z__4.i * x[i__4].r;
  1060. z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
  1061. d_cnjg(&z__6, &d__[*n]);
  1062. i__5 = *n + j * x_dim1;
  1063. z__5.r = z__6.r * x[i__5].r - z__6.i * x[i__5].i, z__5.i =
  1064. z__6.r * x[i__5].i + z__6.i * x[i__5].r;
  1065. z__1.r = z__2.r - z__5.r, z__1.i = z__2.i - z__5.i;
  1066. b[i__2].r = z__1.r, b[i__2].i = z__1.i;
  1067. i__2 = *n - 1;
  1068. for (i__ = 2; i__ <= i__2; ++i__) {
  1069. i__3 = i__ + j * b_dim1;
  1070. i__4 = i__ + j * b_dim1;
  1071. d_cnjg(&z__5, &du[i__ - 1]);
  1072. i__5 = i__ - 1 + j * x_dim1;
  1073. z__4.r = z__5.r * x[i__5].r - z__5.i * x[i__5].i,
  1074. z__4.i = z__5.r * x[i__5].i + z__5.i * x[i__5]
  1075. .r;
  1076. z__3.r = b[i__4].r - z__4.r, z__3.i = b[i__4].i -
  1077. z__4.i;
  1078. d_cnjg(&z__7, &d__[i__]);
  1079. i__6 = i__ + j * x_dim1;
  1080. z__6.r = z__7.r * x[i__6].r - z__7.i * x[i__6].i,
  1081. z__6.i = z__7.r * x[i__6].i + z__7.i * x[i__6]
  1082. .r;
  1083. z__2.r = z__3.r - z__6.r, z__2.i = z__3.i - z__6.i;
  1084. d_cnjg(&z__9, &dl[i__]);
  1085. i__7 = i__ + 1 + j * x_dim1;
  1086. z__8.r = z__9.r * x[i__7].r - z__9.i * x[i__7].i,
  1087. z__8.i = z__9.r * x[i__7].i + z__9.i * x[i__7]
  1088. .r;
  1089. z__1.r = z__2.r - z__8.r, z__1.i = z__2.i - z__8.i;
  1090. b[i__3].r = z__1.r, b[i__3].i = z__1.i;
  1091. /* L150: */
  1092. }
  1093. }
  1094. /* L160: */
  1095. }
  1096. }
  1097. }
  1098. return;
  1099. /* End of ZLAGTM */
  1100. } /* zlagtm_ */