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.

zsytri2x.c 40 kB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382
  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 blasint logical;
  52. typedef char logical1;
  53. typedef char integer1;
  54. #define TRUE_ (1)
  55. #define FALSE_ (0)
  56. /* Extern is for use with -E */
  57. #ifndef Extern
  58. #define Extern extern
  59. #endif
  60. /* I/O stuff */
  61. typedef int flag;
  62. typedef int ftnlen;
  63. typedef int ftnint;
  64. /*external read, write*/
  65. typedef struct
  66. { flag cierr;
  67. ftnint ciunit;
  68. flag ciend;
  69. char *cifmt;
  70. ftnint cirec;
  71. } cilist;
  72. /*internal read, write*/
  73. typedef struct
  74. { flag icierr;
  75. char *iciunit;
  76. flag iciend;
  77. char *icifmt;
  78. ftnint icirlen;
  79. ftnint icirnum;
  80. } icilist;
  81. /*open*/
  82. typedef struct
  83. { flag oerr;
  84. ftnint ounit;
  85. char *ofnm;
  86. ftnlen ofnmlen;
  87. char *osta;
  88. char *oacc;
  89. char *ofm;
  90. ftnint orl;
  91. char *oblnk;
  92. } olist;
  93. /*close*/
  94. typedef struct
  95. { flag cerr;
  96. ftnint cunit;
  97. char *csta;
  98. } cllist;
  99. /*rewind, backspace, endfile*/
  100. typedef struct
  101. { flag aerr;
  102. ftnint aunit;
  103. } alist;
  104. /* inquire */
  105. typedef struct
  106. { flag inerr;
  107. ftnint inunit;
  108. char *infile;
  109. ftnlen infilen;
  110. ftnint *inex; /*parameters in standard's order*/
  111. ftnint *inopen;
  112. ftnint *innum;
  113. ftnint *innamed;
  114. char *inname;
  115. ftnlen innamlen;
  116. char *inacc;
  117. ftnlen inacclen;
  118. char *inseq;
  119. ftnlen inseqlen;
  120. char *indir;
  121. ftnlen indirlen;
  122. char *infmt;
  123. ftnlen infmtlen;
  124. char *inform;
  125. ftnint informlen;
  126. char *inunf;
  127. ftnlen inunflen;
  128. ftnint *inrecl;
  129. ftnint *innrec;
  130. char *inblank;
  131. ftnlen inblanklen;
  132. } inlist;
  133. #define VOID void
  134. union Multitype { /* for multiple entry points */
  135. integer1 g;
  136. shortint h;
  137. integer i;
  138. /* longint j; */
  139. real r;
  140. doublereal d;
  141. complex c;
  142. doublecomplex z;
  143. };
  144. typedef union Multitype Multitype;
  145. struct Vardesc { /* for Namelist */
  146. char *name;
  147. char *addr;
  148. ftnlen *dims;
  149. int type;
  150. };
  151. typedef struct Vardesc Vardesc;
  152. struct Namelist {
  153. char *name;
  154. Vardesc **vars;
  155. int nvars;
  156. };
  157. typedef struct Namelist Namelist;
  158. #define abs(x) ((x) >= 0 ? (x) : -(x))
  159. #define dabs(x) (fabs(x))
  160. #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
  161. #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
  162. #define dmin(a,b) (f2cmin(a,b))
  163. #define dmax(a,b) (f2cmax(a,b))
  164. #define bit_test(a,b) ((a) >> (b) & 1)
  165. #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
  166. #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
  167. #define abort_() { sig_die("Fortran abort routine called", 1); }
  168. #define c_abs(z) (cabsf(Cf(z)))
  169. #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
  170. #ifdef _MSC_VER
  171. #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]);}
  172. #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]);}
  173. #else
  174. #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
  175. #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
  176. #endif
  177. #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
  178. #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
  179. #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
  180. //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
  181. #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
  182. #define d_abs(x) (fabs(*(x)))
  183. #define d_acos(x) (acos(*(x)))
  184. #define d_asin(x) (asin(*(x)))
  185. #define d_atan(x) (atan(*(x)))
  186. #define d_atn2(x, y) (atan2(*(x),*(y)))
  187. #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
  188. #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
  189. #define d_cos(x) (cos(*(x)))
  190. #define d_cosh(x) (cosh(*(x)))
  191. #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
  192. #define d_exp(x) (exp(*(x)))
  193. #define d_imag(z) (cimag(Cd(z)))
  194. #define r_imag(z) (cimagf(Cf(z)))
  195. #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  196. #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  197. #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  198. #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  199. #define d_log(x) (log(*(x)))
  200. #define d_mod(x, y) (fmod(*(x), *(y)))
  201. #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
  202. #define d_nint(x) u_nint(*(x))
  203. #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
  204. #define d_sign(a,b) u_sign(*(a),*(b))
  205. #define r_sign(a,b) u_sign(*(a),*(b))
  206. #define d_sin(x) (sin(*(x)))
  207. #define d_sinh(x) (sinh(*(x)))
  208. #define d_sqrt(x) (sqrt(*(x)))
  209. #define d_tan(x) (tan(*(x)))
  210. #define d_tanh(x) (tanh(*(x)))
  211. #define i_abs(x) abs(*(x))
  212. #define i_dnnt(x) ((integer)u_nint(*(x)))
  213. #define i_len(s, n) (n)
  214. #define i_nint(x) ((integer)u_nint(*(x)))
  215. #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
  216. #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
  217. #define pow_si(B,E) spow_ui(*(B),*(E))
  218. #define pow_ri(B,E) spow_ui(*(B),*(E))
  219. #define pow_di(B,E) dpow_ui(*(B),*(E))
  220. #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
  221. #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
  222. #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
  223. #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++ = ' '; }
  224. #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
  225. #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]; }
  226. #define sig_die(s, kill) { exit(1); }
  227. #define s_stop(s, n) {exit(0);}
  228. static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
  229. #define z_abs(z) (cabs(Cd(z)))
  230. #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
  231. #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
  232. #define myexit_() break;
  233. #define mycycle_() continue;
  234. #define myceiling_(w) {ceil(w)}
  235. #define myhuge_(w) {HUGE_VAL}
  236. //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
  237. #define mymaxloc_(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
  238. /* procedure parameter types for -A and -C++ */
  239. #ifdef __cplusplus
  240. typedef logical (*L_fp)(...);
  241. #else
  242. typedef logical (*L_fp)();
  243. #endif
  244. static float spow_ui(float x, integer n) {
  245. float pow=1.0; unsigned long int u;
  246. if(n != 0) {
  247. if(n < 0) n = -n, x = 1/x;
  248. for(u = n; ; ) {
  249. if(u & 01) pow *= x;
  250. if(u >>= 1) x *= x;
  251. else break;
  252. }
  253. }
  254. return pow;
  255. }
  256. static double dpow_ui(double x, integer n) {
  257. double pow=1.0; unsigned long int u;
  258. if(n != 0) {
  259. if(n < 0) n = -n, x = 1/x;
  260. for(u = n; ; ) {
  261. if(u & 01) pow *= x;
  262. if(u >>= 1) x *= x;
  263. else break;
  264. }
  265. }
  266. return pow;
  267. }
  268. #ifdef _MSC_VER
  269. static _Fcomplex cpow_ui(complex x, integer n) {
  270. complex pow={1.0,0.0}; unsigned long int u;
  271. if(n != 0) {
  272. if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
  273. for(u = n; ; ) {
  274. if(u & 01) pow.r *= x.r, pow.i *= x.i;
  275. if(u >>= 1) x.r *= x.r, x.i *= x.i;
  276. else break;
  277. }
  278. }
  279. _Fcomplex p={pow.r, pow.i};
  280. return p;
  281. }
  282. #else
  283. static _Complex float cpow_ui(_Complex float x, integer n) {
  284. _Complex float pow=1.0; unsigned long int u;
  285. if(n != 0) {
  286. if(n < 0) n = -n, x = 1/x;
  287. for(u = n; ; ) {
  288. if(u & 01) pow *= x;
  289. if(u >>= 1) x *= x;
  290. else break;
  291. }
  292. }
  293. return pow;
  294. }
  295. #endif
  296. #ifdef _MSC_VER
  297. static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
  298. _Dcomplex pow={1.0,0.0}; unsigned long int u;
  299. if(n != 0) {
  300. if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
  301. for(u = n; ; ) {
  302. if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
  303. if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
  304. else break;
  305. }
  306. }
  307. _Dcomplex p = {pow._Val[0], pow._Val[1]};
  308. return p;
  309. }
  310. #else
  311. static _Complex double zpow_ui(_Complex double x, integer n) {
  312. _Complex double pow=1.0; unsigned long int u;
  313. if(n != 0) {
  314. if(n < 0) n = -n, x = 1/x;
  315. for(u = n; ; ) {
  316. if(u & 01) pow *= x;
  317. if(u >>= 1) x *= x;
  318. else break;
  319. }
  320. }
  321. return pow;
  322. }
  323. #endif
  324. static integer pow_ii(integer x, integer n) {
  325. integer pow; unsigned long int u;
  326. if (n <= 0) {
  327. if (n == 0 || x == 1) pow = 1;
  328. else if (x != -1) pow = x == 0 ? 1/x : 0;
  329. else n = -n;
  330. }
  331. if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
  332. u = n;
  333. for(pow = 1; ; ) {
  334. if(u & 01) pow *= x;
  335. if(u >>= 1) x *= x;
  336. else break;
  337. }
  338. }
  339. return pow;
  340. }
  341. static integer dmaxloc_(double *w, integer s, integer e, integer *n)
  342. {
  343. double m; integer i, mi;
  344. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  345. if (w[i-1]>m) mi=i ,m=w[i-1];
  346. return mi-s+1;
  347. }
  348. static integer smaxloc_(float *w, integer s, integer e, integer *n)
  349. {
  350. float m; integer i, mi;
  351. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  352. if (w[i-1]>m) mi=i ,m=w[i-1];
  353. return mi-s+1;
  354. }
  355. static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  356. integer n = *n_, incx = *incx_, incy = *incy_, i;
  357. #ifdef _MSC_VER
  358. _Fcomplex zdotc = {0.0, 0.0};
  359. if (incx == 1 && incy == 1) {
  360. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  361. zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
  362. zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
  363. }
  364. } else {
  365. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  366. zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
  367. zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
  368. }
  369. }
  370. pCf(z) = zdotc;
  371. }
  372. #else
  373. _Complex float zdotc = 0.0;
  374. if (incx == 1 && incy == 1) {
  375. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  376. zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
  377. }
  378. } else {
  379. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  380. zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
  381. }
  382. }
  383. pCf(z) = zdotc;
  384. }
  385. #endif
  386. static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  387. integer n = *n_, incx = *incx_, incy = *incy_, i;
  388. #ifdef _MSC_VER
  389. _Dcomplex zdotc = {0.0, 0.0};
  390. if (incx == 1 && incy == 1) {
  391. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  392. zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
  393. zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
  394. }
  395. } else {
  396. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  397. zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
  398. zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
  399. }
  400. }
  401. pCd(z) = zdotc;
  402. }
  403. #else
  404. _Complex double zdotc = 0.0;
  405. if (incx == 1 && incy == 1) {
  406. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  407. zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
  408. }
  409. } else {
  410. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  411. zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
  412. }
  413. }
  414. pCd(z) = zdotc;
  415. }
  416. #endif
  417. static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  418. integer n = *n_, incx = *incx_, incy = *incy_, i;
  419. #ifdef _MSC_VER
  420. _Fcomplex zdotc = {0.0, 0.0};
  421. if (incx == 1 && incy == 1) {
  422. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  423. zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
  424. zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
  425. }
  426. } else {
  427. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  428. zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
  429. zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
  430. }
  431. }
  432. pCf(z) = zdotc;
  433. }
  434. #else
  435. _Complex float zdotc = 0.0;
  436. if (incx == 1 && incy == 1) {
  437. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  438. zdotc += Cf(&x[i]) * Cf(&y[i]);
  439. }
  440. } else {
  441. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  442. zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
  443. }
  444. }
  445. pCf(z) = zdotc;
  446. }
  447. #endif
  448. static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  449. integer n = *n_, incx = *incx_, incy = *incy_, i;
  450. #ifdef _MSC_VER
  451. _Dcomplex zdotc = {0.0, 0.0};
  452. if (incx == 1 && incy == 1) {
  453. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  454. zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
  455. zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
  456. }
  457. } else {
  458. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  459. zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
  460. zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
  461. }
  462. }
  463. pCd(z) = zdotc;
  464. }
  465. #else
  466. _Complex double zdotc = 0.0;
  467. if (incx == 1 && incy == 1) {
  468. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  469. zdotc += Cd(&x[i]) * Cd(&y[i]);
  470. }
  471. } else {
  472. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  473. zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
  474. }
  475. }
  476. pCd(z) = zdotc;
  477. }
  478. #endif
  479. /* -- translated by f2c (version 20000121).
  480. You must link the resulting object file with the libraries:
  481. -lf2c -lm (in that order)
  482. */
  483. /* Table of constant values */
  484. static doublecomplex c_b1 = {1.,0.};
  485. static doublecomplex c_b2 = {0.,0.};
  486. /* > \brief \b ZSYTRI2X */
  487. /* =========== DOCUMENTATION =========== */
  488. /* Online html documentation available at */
  489. /* http://www.netlib.org/lapack/explore-html/ */
  490. /* > \htmlonly */
  491. /* > Download ZSYTRI2X + dependencies */
  492. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zsytri2
  493. x.f"> */
  494. /* > [TGZ]</a> */
  495. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zsytri2
  496. x.f"> */
  497. /* > [ZIP]</a> */
  498. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zsytri2
  499. x.f"> */
  500. /* > [TXT]</a> */
  501. /* > \endhtmlonly */
  502. /* Definition: */
  503. /* =========== */
  504. /* SUBROUTINE ZSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) */
  505. /* CHARACTER UPLO */
  506. /* INTEGER INFO, LDA, N, NB */
  507. /* INTEGER IPIV( * ) */
  508. /* COMPLEX*16 A( LDA, * ), WORK( N+NB+1,* ) */
  509. /* > \par Purpose: */
  510. /* ============= */
  511. /* > */
  512. /* > \verbatim */
  513. /* > */
  514. /* > ZSYTRI2X computes the inverse of a complex symmetric indefinite matrix */
  515. /* > A using the factorization A = U*D*U**T or A = L*D*L**T computed by */
  516. /* > ZSYTRF. */
  517. /* > \endverbatim */
  518. /* Arguments: */
  519. /* ========== */
  520. /* > \param[in] UPLO */
  521. /* > \verbatim */
  522. /* > UPLO is CHARACTER*1 */
  523. /* > Specifies whether the details of the factorization are stored */
  524. /* > as an upper or lower triangular matrix. */
  525. /* > = 'U': Upper triangular, form is A = U*D*U**T; */
  526. /* > = 'L': Lower triangular, form is A = L*D*L**T. */
  527. /* > \endverbatim */
  528. /* > */
  529. /* > \param[in] N */
  530. /* > \verbatim */
  531. /* > N is INTEGER */
  532. /* > The order of the matrix A. N >= 0. */
  533. /* > \endverbatim */
  534. /* > */
  535. /* > \param[in,out] A */
  536. /* > \verbatim */
  537. /* > A is COMPLEX*16 array, dimension (LDA,N) */
  538. /* > On entry, the NNB diagonal matrix D and the multipliers */
  539. /* > used to obtain the factor U or L as computed by ZSYTRF. */
  540. /* > */
  541. /* > On exit, if INFO = 0, the (symmetric) inverse of the original */
  542. /* > matrix. If UPLO = 'U', the upper triangular part of the */
  543. /* > inverse is formed and the part of A below the diagonal is not */
  544. /* > referenced; if UPLO = 'L' the lower triangular part of the */
  545. /* > inverse is formed and the part of A above the diagonal is */
  546. /* > not referenced. */
  547. /* > \endverbatim */
  548. /* > */
  549. /* > \param[in] LDA */
  550. /* > \verbatim */
  551. /* > LDA is INTEGER */
  552. /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
  553. /* > \endverbatim */
  554. /* > */
  555. /* > \param[in] IPIV */
  556. /* > \verbatim */
  557. /* > IPIV is INTEGER array, dimension (N) */
  558. /* > Details of the interchanges and the NNB structure of D */
  559. /* > as determined by ZSYTRF. */
  560. /* > \endverbatim */
  561. /* > */
  562. /* > \param[out] WORK */
  563. /* > \verbatim */
  564. /* > WORK is COMPLEX*16 array, dimension (N+NB+1,NB+3) */
  565. /* > \endverbatim */
  566. /* > */
  567. /* > \param[in] NB */
  568. /* > \verbatim */
  569. /* > NB is INTEGER */
  570. /* > Block size */
  571. /* > \endverbatim */
  572. /* > */
  573. /* > \param[out] INFO */
  574. /* > \verbatim */
  575. /* > INFO is INTEGER */
  576. /* > = 0: successful exit */
  577. /* > < 0: if INFO = -i, the i-th argument had an illegal value */
  578. /* > > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its */
  579. /* > inverse could not be computed. */
  580. /* > \endverbatim */
  581. /* Authors: */
  582. /* ======== */
  583. /* > \author Univ. of Tennessee */
  584. /* > \author Univ. of California Berkeley */
  585. /* > \author Univ. of Colorado Denver */
  586. /* > \author NAG Ltd. */
  587. /* > \date June 2017 */
  588. /* > \ingroup complex16SYcomputational */
  589. /* ===================================================================== */
  590. /* Subroutine */ void zsytri2x_(char *uplo, integer *n, doublecomplex *a,
  591. integer *lda, integer *ipiv, doublecomplex *work, integer *nb,
  592. integer *info)
  593. {
  594. /* System generated locals */
  595. integer a_dim1, a_offset, work_dim1, work_offset, i__1, i__2, i__3, i__4,
  596. i__5, i__6;
  597. doublecomplex z__1, z__2, z__3;
  598. /* Local variables */
  599. integer invd;
  600. doublecomplex akkp1, d__;
  601. integer i__, j, k;
  602. extern /* Subroutine */ void zsyswapr_(char *, integer *, doublecomplex *,
  603. integer *, integer *, integer *);
  604. doublecomplex t;
  605. extern logical lsame_(char *, char *);
  606. integer iinfo;
  607. extern /* Subroutine */ void zgemm_(char *, char *, integer *, integer *,
  608. integer *, doublecomplex *, doublecomplex *, integer *,
  609. doublecomplex *, integer *, doublecomplex *, doublecomplex *,
  610. integer *);
  611. integer count;
  612. logical upper;
  613. extern /* Subroutine */ void ztrmm_(char *, char *, char *, char *,
  614. integer *, integer *, doublecomplex *, doublecomplex *, integer *,
  615. doublecomplex *, integer *);
  616. doublecomplex ak, u01_i_j__;
  617. integer u11;
  618. doublecomplex u11_i_j__;
  619. integer ip;
  620. extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
  621. extern int ztrtri_(
  622. char *, char *, integer *, doublecomplex *, integer *, integer *);
  623. integer nnb, cut;
  624. doublecomplex akp1, u01_ip1_j__, u11_ip1_j__;
  625. extern /* Subroutine */ void zsyconv_(char *, char *, integer *,
  626. doublecomplex *, integer *, integer *, doublecomplex *, integer *);
  627. /* -- LAPACK computational routine (version 3.7.1) -- */
  628. /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
  629. /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  630. /* June 2017 */
  631. /* ===================================================================== */
  632. /* Test the input parameters. */
  633. /* Parameter adjustments */
  634. a_dim1 = *lda;
  635. a_offset = 1 + a_dim1 * 1;
  636. a -= a_offset;
  637. --ipiv;
  638. work_dim1 = *n + *nb + 1;
  639. work_offset = 1 + work_dim1 * 1;
  640. work -= work_offset;
  641. /* Function Body */
  642. *info = 0;
  643. upper = lsame_(uplo, "U");
  644. if (! upper && ! lsame_(uplo, "L")) {
  645. *info = -1;
  646. } else if (*n < 0) {
  647. *info = -2;
  648. } else if (*lda < f2cmax(1,*n)) {
  649. *info = -4;
  650. }
  651. /* Quick return if possible */
  652. if (*info != 0) {
  653. i__1 = -(*info);
  654. xerbla_("ZSYTRI2X", &i__1, (ftnlen)8);
  655. return;
  656. }
  657. if (*n == 0) {
  658. return;
  659. }
  660. /* Convert A */
  661. /* Workspace got Non-diag elements of D */
  662. zsyconv_(uplo, "C", n, &a[a_offset], lda, &ipiv[1], &work[work_offset], &
  663. iinfo);
  664. /* Check that the diagonal matrix D is nonsingular. */
  665. if (upper) {
  666. /* Upper triangular storage: examine D from bottom to top */
  667. for (*info = *n; *info >= 1; --(*info)) {
  668. i__1 = *info + *info * a_dim1;
  669. if (ipiv[*info] > 0 && (a[i__1].r == 0. && a[i__1].i == 0.)) {
  670. return;
  671. }
  672. }
  673. } else {
  674. /* Lower triangular storage: examine D from top to bottom. */
  675. i__1 = *n;
  676. for (*info = 1; *info <= i__1; ++(*info)) {
  677. i__2 = *info + *info * a_dim1;
  678. if (ipiv[*info] > 0 && (a[i__2].r == 0. && a[i__2].i == 0.)) {
  679. return;
  680. }
  681. }
  682. }
  683. *info = 0;
  684. /* Splitting Workspace */
  685. /* U01 is a block (N,NB+1) */
  686. /* The first element of U01 is in WORK(1,1) */
  687. /* U11 is a block (NB+1,NB+1) */
  688. /* The first element of U11 is in WORK(N+1,1) */
  689. u11 = *n;
  690. /* INVD is a block (N,2) */
  691. /* The first element of INVD is in WORK(1,INVD) */
  692. invd = *nb + 2;
  693. if (upper) {
  694. /* invA = P * inv(U**T)*inv(D)*inv(U)*P**T. */
  695. ztrtri_(uplo, "U", n, &a[a_offset], lda, info);
  696. /* inv(D) and inv(D)*inv(U) */
  697. k = 1;
  698. while(k <= *n) {
  699. if (ipiv[k] > 0) {
  700. /* 1 x 1 diagonal NNB */
  701. i__1 = k + invd * work_dim1;
  702. z_div(&z__1, &c_b1, &a[k + k * a_dim1]);
  703. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  704. i__1 = k + (invd + 1) * work_dim1;
  705. work[i__1].r = 0., work[i__1].i = 0.;
  706. ++k;
  707. } else {
  708. /* 2 x 2 diagonal NNB */
  709. i__1 = k + 1 + work_dim1;
  710. t.r = work[i__1].r, t.i = work[i__1].i;
  711. z_div(&z__1, &a[k + k * a_dim1], &t);
  712. ak.r = z__1.r, ak.i = z__1.i;
  713. z_div(&z__1, &a[k + 1 + (k + 1) * a_dim1], &t);
  714. akp1.r = z__1.r, akp1.i = z__1.i;
  715. z_div(&z__1, &work[k + 1 + work_dim1], &t);
  716. akkp1.r = z__1.r, akkp1.i = z__1.i;
  717. z__3.r = ak.r * akp1.r - ak.i * akp1.i, z__3.i = ak.r *
  718. akp1.i + ak.i * akp1.r;
  719. z__2.r = z__3.r - 1., z__2.i = z__3.i + 0.;
  720. z__1.r = t.r * z__2.r - t.i * z__2.i, z__1.i = t.r * z__2.i +
  721. t.i * z__2.r;
  722. d__.r = z__1.r, d__.i = z__1.i;
  723. i__1 = k + invd * work_dim1;
  724. z_div(&z__1, &akp1, &d__);
  725. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  726. i__1 = k + 1 + (invd + 1) * work_dim1;
  727. z_div(&z__1, &ak, &d__);
  728. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  729. i__1 = k + (invd + 1) * work_dim1;
  730. z__2.r = -akkp1.r, z__2.i = -akkp1.i;
  731. z_div(&z__1, &z__2, &d__);
  732. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  733. i__1 = k + 1 + invd * work_dim1;
  734. z__2.r = -akkp1.r, z__2.i = -akkp1.i;
  735. z_div(&z__1, &z__2, &d__);
  736. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  737. k += 2;
  738. }
  739. }
  740. /* inv(U**T) = (inv(U))**T */
  741. /* inv(U**T)*inv(D)*inv(U) */
  742. cut = *n;
  743. while(cut > 0) {
  744. nnb = *nb;
  745. if (cut <= nnb) {
  746. nnb = cut;
  747. } else {
  748. count = 0;
  749. /* count negative elements, */
  750. i__1 = cut;
  751. for (i__ = cut + 1 - nnb; i__ <= i__1; ++i__) {
  752. if (ipiv[i__] < 0) {
  753. ++count;
  754. }
  755. }
  756. /* need a even number for a clear cut */
  757. if (count % 2 == 1) {
  758. ++nnb;
  759. }
  760. }
  761. cut -= nnb;
  762. /* U01 Block */
  763. i__1 = cut;
  764. for (i__ = 1; i__ <= i__1; ++i__) {
  765. i__2 = nnb;
  766. for (j = 1; j <= i__2; ++j) {
  767. i__3 = i__ + j * work_dim1;
  768. i__4 = i__ + (cut + j) * a_dim1;
  769. work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
  770. }
  771. }
  772. /* U11 Block */
  773. i__1 = nnb;
  774. for (i__ = 1; i__ <= i__1; ++i__) {
  775. i__2 = u11 + i__ + i__ * work_dim1;
  776. work[i__2].r = 1., work[i__2].i = 0.;
  777. i__2 = i__ - 1;
  778. for (j = 1; j <= i__2; ++j) {
  779. i__3 = u11 + i__ + j * work_dim1;
  780. work[i__3].r = 0., work[i__3].i = 0.;
  781. }
  782. i__2 = nnb;
  783. for (j = i__ + 1; j <= i__2; ++j) {
  784. i__3 = u11 + i__ + j * work_dim1;
  785. i__4 = cut + i__ + (cut + j) * a_dim1;
  786. work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
  787. }
  788. }
  789. /* invD*U01 */
  790. i__ = 1;
  791. while(i__ <= cut) {
  792. if (ipiv[i__] > 0) {
  793. i__1 = nnb;
  794. for (j = 1; j <= i__1; ++j) {
  795. i__2 = i__ + j * work_dim1;
  796. i__3 = i__ + invd * work_dim1;
  797. i__4 = i__ + j * work_dim1;
  798. z__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
  799. work[i__4].i, z__1.i = work[i__3].r * work[
  800. i__4].i + work[i__3].i * work[i__4].r;
  801. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  802. }
  803. ++i__;
  804. } else {
  805. i__1 = nnb;
  806. for (j = 1; j <= i__1; ++j) {
  807. i__2 = i__ + j * work_dim1;
  808. u01_i_j__.r = work[i__2].r, u01_i_j__.i = work[i__2]
  809. .i;
  810. i__2 = i__ + 1 + j * work_dim1;
  811. u01_ip1_j__.r = work[i__2].r, u01_ip1_j__.i = work[
  812. i__2].i;
  813. i__2 = i__ + j * work_dim1;
  814. i__3 = i__ + invd * work_dim1;
  815. z__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
  816. u01_i_j__.i, z__2.i = work[i__3].r *
  817. u01_i_j__.i + work[i__3].i * u01_i_j__.r;
  818. i__4 = i__ + (invd + 1) * work_dim1;
  819. z__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
  820. u01_ip1_j__.i, z__3.i = work[i__4].r *
  821. u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
  822. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  823. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  824. i__2 = i__ + 1 + j * work_dim1;
  825. i__3 = i__ + 1 + invd * work_dim1;
  826. z__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
  827. u01_i_j__.i, z__2.i = work[i__3].r *
  828. u01_i_j__.i + work[i__3].i * u01_i_j__.r;
  829. i__4 = i__ + 1 + (invd + 1) * work_dim1;
  830. z__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
  831. u01_ip1_j__.i, z__3.i = work[i__4].r *
  832. u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
  833. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  834. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  835. }
  836. i__ += 2;
  837. }
  838. }
  839. /* invD1*U11 */
  840. i__ = 1;
  841. while(i__ <= nnb) {
  842. if (ipiv[cut + i__] > 0) {
  843. i__1 = nnb;
  844. for (j = i__; j <= i__1; ++j) {
  845. i__2 = u11 + i__ + j * work_dim1;
  846. i__3 = cut + i__ + invd * work_dim1;
  847. i__4 = u11 + i__ + j * work_dim1;
  848. z__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
  849. work[i__4].i, z__1.i = work[i__3].r * work[
  850. i__4].i + work[i__3].i * work[i__4].r;
  851. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  852. }
  853. ++i__;
  854. } else {
  855. i__1 = nnb;
  856. for (j = i__; j <= i__1; ++j) {
  857. i__2 = u11 + i__ + j * work_dim1;
  858. u11_i_j__.r = work[i__2].r, u11_i_j__.i = work[i__2]
  859. .i;
  860. i__2 = u11 + i__ + 1 + j * work_dim1;
  861. u11_ip1_j__.r = work[i__2].r, u11_ip1_j__.i = work[
  862. i__2].i;
  863. i__2 = u11 + i__ + j * work_dim1;
  864. i__3 = cut + i__ + invd * work_dim1;
  865. i__4 = u11 + i__ + j * work_dim1;
  866. z__2.r = work[i__3].r * work[i__4].r - work[i__3].i *
  867. work[i__4].i, z__2.i = work[i__3].r * work[
  868. i__4].i + work[i__3].i * work[i__4].r;
  869. i__5 = cut + i__ + (invd + 1) * work_dim1;
  870. i__6 = u11 + i__ + 1 + j * work_dim1;
  871. z__3.r = work[i__5].r * work[i__6].r - work[i__5].i *
  872. work[i__6].i, z__3.i = work[i__5].r * work[
  873. i__6].i + work[i__5].i * work[i__6].r;
  874. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  875. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  876. i__2 = u11 + i__ + 1 + j * work_dim1;
  877. i__3 = cut + i__ + 1 + invd * work_dim1;
  878. z__2.r = work[i__3].r * u11_i_j__.r - work[i__3].i *
  879. u11_i_j__.i, z__2.i = work[i__3].r *
  880. u11_i_j__.i + work[i__3].i * u11_i_j__.r;
  881. i__4 = cut + i__ + 1 + (invd + 1) * work_dim1;
  882. z__3.r = work[i__4].r * u11_ip1_j__.r - work[i__4].i *
  883. u11_ip1_j__.i, z__3.i = work[i__4].r *
  884. u11_ip1_j__.i + work[i__4].i * u11_ip1_j__.r;
  885. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  886. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  887. }
  888. i__ += 2;
  889. }
  890. }
  891. /* U11**T*invD1*U11->U11 */
  892. i__1 = *n + *nb + 1;
  893. ztrmm_("L", "U", "T", "U", &nnb, &nnb, &c_b1, &a[cut + 1 + (cut +
  894. 1) * a_dim1], lda, &work[u11 + 1 + work_dim1], &i__1);
  895. i__1 = nnb;
  896. for (i__ = 1; i__ <= i__1; ++i__) {
  897. i__2 = nnb;
  898. for (j = i__; j <= i__2; ++j) {
  899. i__3 = cut + i__ + (cut + j) * a_dim1;
  900. i__4 = u11 + i__ + j * work_dim1;
  901. a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
  902. }
  903. }
  904. /* U01**T*invD*U01->A(CUT+I,CUT+J) */
  905. i__1 = *n + *nb + 1;
  906. i__2 = *n + *nb + 1;
  907. zgemm_("T", "N", &nnb, &nnb, &cut, &c_b1, &a[(cut + 1) * a_dim1 +
  908. 1], lda, &work[work_offset], &i__1, &c_b2, &work[u11 + 1
  909. + work_dim1], &i__2);
  910. /* U11 = U11**T*invD1*U11 + U01**T*invD*U01 */
  911. i__1 = nnb;
  912. for (i__ = 1; i__ <= i__1; ++i__) {
  913. i__2 = nnb;
  914. for (j = i__; j <= i__2; ++j) {
  915. i__3 = cut + i__ + (cut + j) * a_dim1;
  916. i__4 = cut + i__ + (cut + j) * a_dim1;
  917. i__5 = u11 + i__ + j * work_dim1;
  918. z__1.r = a[i__4].r + work[i__5].r, z__1.i = a[i__4].i +
  919. work[i__5].i;
  920. a[i__3].r = z__1.r, a[i__3].i = z__1.i;
  921. }
  922. }
  923. /* U01 = U00**T*invD0*U01 */
  924. i__1 = *n + *nb + 1;
  925. ztrmm_("L", uplo, "T", "U", &cut, &nnb, &c_b1, &a[a_offset], lda,
  926. &work[work_offset], &i__1);
  927. /* Update U01 */
  928. i__1 = cut;
  929. for (i__ = 1; i__ <= i__1; ++i__) {
  930. i__2 = nnb;
  931. for (j = 1; j <= i__2; ++j) {
  932. i__3 = i__ + (cut + j) * a_dim1;
  933. i__4 = i__ + j * work_dim1;
  934. a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
  935. }
  936. }
  937. /* Next Block */
  938. }
  939. /* Apply PERMUTATIONS P and P**T: P * inv(U**T)*inv(D)*inv(U) *P**T */
  940. i__ = 1;
  941. while(i__ <= *n) {
  942. if (ipiv[i__] > 0) {
  943. ip = ipiv[i__];
  944. if (i__ < ip) {
  945. zsyswapr_(uplo, n, &a[a_offset], lda, &i__, &ip);
  946. }
  947. if (i__ > ip) {
  948. zsyswapr_(uplo, n, &a[a_offset], lda, &ip, &i__);
  949. }
  950. } else {
  951. ip = -ipiv[i__];
  952. ++i__;
  953. if (i__ - 1 < ip) {
  954. i__1 = i__ - 1;
  955. zsyswapr_(uplo, n, &a[a_offset], lda, &i__1, &ip);
  956. }
  957. if (i__ - 1 > ip) {
  958. i__1 = i__ - 1;
  959. zsyswapr_(uplo, n, &a[a_offset], lda, &ip, &i__1);
  960. }
  961. }
  962. ++i__;
  963. }
  964. } else {
  965. /* LOWER... */
  966. /* invA = P * inv(U**T)*inv(D)*inv(U)*P**T. */
  967. ztrtri_(uplo, "U", n, &a[a_offset], lda, info);
  968. /* inv(D) and inv(D)*inv(U) */
  969. k = *n;
  970. while(k >= 1) {
  971. if (ipiv[k] > 0) {
  972. /* 1 x 1 diagonal NNB */
  973. i__1 = k + invd * work_dim1;
  974. z_div(&z__1, &c_b1, &a[k + k * a_dim1]);
  975. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  976. i__1 = k + (invd + 1) * work_dim1;
  977. work[i__1].r = 0., work[i__1].i = 0.;
  978. --k;
  979. } else {
  980. /* 2 x 2 diagonal NNB */
  981. i__1 = k - 1 + work_dim1;
  982. t.r = work[i__1].r, t.i = work[i__1].i;
  983. z_div(&z__1, &a[k - 1 + (k - 1) * a_dim1], &t);
  984. ak.r = z__1.r, ak.i = z__1.i;
  985. z_div(&z__1, &a[k + k * a_dim1], &t);
  986. akp1.r = z__1.r, akp1.i = z__1.i;
  987. z_div(&z__1, &work[k - 1 + work_dim1], &t);
  988. akkp1.r = z__1.r, akkp1.i = z__1.i;
  989. z__3.r = ak.r * akp1.r - ak.i * akp1.i, z__3.i = ak.r *
  990. akp1.i + ak.i * akp1.r;
  991. z__2.r = z__3.r - 1., z__2.i = z__3.i + 0.;
  992. z__1.r = t.r * z__2.r - t.i * z__2.i, z__1.i = t.r * z__2.i +
  993. t.i * z__2.r;
  994. d__.r = z__1.r, d__.i = z__1.i;
  995. i__1 = k - 1 + invd * work_dim1;
  996. z_div(&z__1, &akp1, &d__);
  997. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  998. i__1 = k + invd * work_dim1;
  999. z_div(&z__1, &ak, &d__);
  1000. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  1001. i__1 = k + (invd + 1) * work_dim1;
  1002. z__2.r = -akkp1.r, z__2.i = -akkp1.i;
  1003. z_div(&z__1, &z__2, &d__);
  1004. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  1005. i__1 = k - 1 + (invd + 1) * work_dim1;
  1006. z__2.r = -akkp1.r, z__2.i = -akkp1.i;
  1007. z_div(&z__1, &z__2, &d__);
  1008. work[i__1].r = z__1.r, work[i__1].i = z__1.i;
  1009. k += -2;
  1010. }
  1011. }
  1012. /* inv(U**T) = (inv(U))**T */
  1013. /* inv(U**T)*inv(D)*inv(U) */
  1014. cut = 0;
  1015. while(cut < *n) {
  1016. nnb = *nb;
  1017. if (cut + nnb >= *n) {
  1018. nnb = *n - cut;
  1019. } else {
  1020. count = 0;
  1021. /* count negative elements, */
  1022. i__1 = cut + nnb;
  1023. for (i__ = cut + 1; i__ <= i__1; ++i__) {
  1024. if (ipiv[i__] < 0) {
  1025. ++count;
  1026. }
  1027. }
  1028. /* need a even number for a clear cut */
  1029. if (count % 2 == 1) {
  1030. ++nnb;
  1031. }
  1032. }
  1033. /* L21 Block */
  1034. i__1 = *n - cut - nnb;
  1035. for (i__ = 1; i__ <= i__1; ++i__) {
  1036. i__2 = nnb;
  1037. for (j = 1; j <= i__2; ++j) {
  1038. i__3 = i__ + j * work_dim1;
  1039. i__4 = cut + nnb + i__ + (cut + j) * a_dim1;
  1040. work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
  1041. }
  1042. }
  1043. /* L11 Block */
  1044. i__1 = nnb;
  1045. for (i__ = 1; i__ <= i__1; ++i__) {
  1046. i__2 = u11 + i__ + i__ * work_dim1;
  1047. work[i__2].r = 1., work[i__2].i = 0.;
  1048. i__2 = nnb;
  1049. for (j = i__ + 1; j <= i__2; ++j) {
  1050. i__3 = u11 + i__ + j * work_dim1;
  1051. work[i__3].r = 0., work[i__3].i = 0.;
  1052. }
  1053. i__2 = i__ - 1;
  1054. for (j = 1; j <= i__2; ++j) {
  1055. i__3 = u11 + i__ + j * work_dim1;
  1056. i__4 = cut + i__ + (cut + j) * a_dim1;
  1057. work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
  1058. }
  1059. }
  1060. /* invD*L21 */
  1061. i__ = *n - cut - nnb;
  1062. while(i__ >= 1) {
  1063. if (ipiv[cut + nnb + i__] > 0) {
  1064. i__1 = nnb;
  1065. for (j = 1; j <= i__1; ++j) {
  1066. i__2 = i__ + j * work_dim1;
  1067. i__3 = cut + nnb + i__ + invd * work_dim1;
  1068. i__4 = i__ + j * work_dim1;
  1069. z__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
  1070. work[i__4].i, z__1.i = work[i__3].r * work[
  1071. i__4].i + work[i__3].i * work[i__4].r;
  1072. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  1073. }
  1074. --i__;
  1075. } else {
  1076. i__1 = nnb;
  1077. for (j = 1; j <= i__1; ++j) {
  1078. i__2 = i__ + j * work_dim1;
  1079. u01_i_j__.r = work[i__2].r, u01_i_j__.i = work[i__2]
  1080. .i;
  1081. i__2 = i__ - 1 + j * work_dim1;
  1082. u01_ip1_j__.r = work[i__2].r, u01_ip1_j__.i = work[
  1083. i__2].i;
  1084. i__2 = i__ + j * work_dim1;
  1085. i__3 = cut + nnb + i__ + invd * work_dim1;
  1086. z__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
  1087. u01_i_j__.i, z__2.i = work[i__3].r *
  1088. u01_i_j__.i + work[i__3].i * u01_i_j__.r;
  1089. i__4 = cut + nnb + i__ + (invd + 1) * work_dim1;
  1090. z__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
  1091. u01_ip1_j__.i, z__3.i = work[i__4].r *
  1092. u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
  1093. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  1094. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  1095. i__2 = i__ - 1 + j * work_dim1;
  1096. i__3 = cut + nnb + i__ - 1 + (invd + 1) * work_dim1;
  1097. z__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
  1098. u01_i_j__.i, z__2.i = work[i__3].r *
  1099. u01_i_j__.i + work[i__3].i * u01_i_j__.r;
  1100. i__4 = cut + nnb + i__ - 1 + invd * work_dim1;
  1101. z__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
  1102. u01_ip1_j__.i, z__3.i = work[i__4].r *
  1103. u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
  1104. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  1105. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  1106. }
  1107. i__ += -2;
  1108. }
  1109. }
  1110. /* invD1*L11 */
  1111. i__ = nnb;
  1112. while(i__ >= 1) {
  1113. if (ipiv[cut + i__] > 0) {
  1114. i__1 = nnb;
  1115. for (j = 1; j <= i__1; ++j) {
  1116. i__2 = u11 + i__ + j * work_dim1;
  1117. i__3 = cut + i__ + invd * work_dim1;
  1118. i__4 = u11 + i__ + j * work_dim1;
  1119. z__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
  1120. work[i__4].i, z__1.i = work[i__3].r * work[
  1121. i__4].i + work[i__3].i * work[i__4].r;
  1122. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  1123. }
  1124. --i__;
  1125. } else {
  1126. i__1 = nnb;
  1127. for (j = 1; j <= i__1; ++j) {
  1128. i__2 = u11 + i__ + j * work_dim1;
  1129. u11_i_j__.r = work[i__2].r, u11_i_j__.i = work[i__2]
  1130. .i;
  1131. i__2 = u11 + i__ - 1 + j * work_dim1;
  1132. u11_ip1_j__.r = work[i__2].r, u11_ip1_j__.i = work[
  1133. i__2].i;
  1134. i__2 = u11 + i__ + j * work_dim1;
  1135. i__3 = cut + i__ + invd * work_dim1;
  1136. i__4 = u11 + i__ + j * work_dim1;
  1137. z__2.r = work[i__3].r * work[i__4].r - work[i__3].i *
  1138. work[i__4].i, z__2.i = work[i__3].r * work[
  1139. i__4].i + work[i__3].i * work[i__4].r;
  1140. i__5 = cut + i__ + (invd + 1) * work_dim1;
  1141. z__3.r = work[i__5].r * u11_ip1_j__.r - work[i__5].i *
  1142. u11_ip1_j__.i, z__3.i = work[i__5].r *
  1143. u11_ip1_j__.i + work[i__5].i * u11_ip1_j__.r;
  1144. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  1145. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  1146. i__2 = u11 + i__ - 1 + j * work_dim1;
  1147. i__3 = cut + i__ - 1 + (invd + 1) * work_dim1;
  1148. z__2.r = work[i__3].r * u11_i_j__.r - work[i__3].i *
  1149. u11_i_j__.i, z__2.i = work[i__3].r *
  1150. u11_i_j__.i + work[i__3].i * u11_i_j__.r;
  1151. i__4 = cut + i__ - 1 + invd * work_dim1;
  1152. z__3.r = work[i__4].r * u11_ip1_j__.r - work[i__4].i *
  1153. u11_ip1_j__.i, z__3.i = work[i__4].r *
  1154. u11_ip1_j__.i + work[i__4].i * u11_ip1_j__.r;
  1155. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  1156. work[i__2].r = z__1.r, work[i__2].i = z__1.i;
  1157. }
  1158. i__ += -2;
  1159. }
  1160. }
  1161. /* L11**T*invD1*L11->L11 */
  1162. i__1 = *n + *nb + 1;
  1163. ztrmm_("L", uplo, "T", "U", &nnb, &nnb, &c_b1, &a[cut + 1 + (cut
  1164. + 1) * a_dim1], lda, &work[u11 + 1 + work_dim1], &i__1);
  1165. i__1 = nnb;
  1166. for (i__ = 1; i__ <= i__1; ++i__) {
  1167. i__2 = i__;
  1168. for (j = 1; j <= i__2; ++j) {
  1169. i__3 = cut + i__ + (cut + j) * a_dim1;
  1170. i__4 = u11 + i__ + j * work_dim1;
  1171. a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
  1172. }
  1173. }
  1174. if (cut + nnb < *n) {
  1175. /* L21**T*invD2*L21->A(CUT+I,CUT+J) */
  1176. i__1 = *n - nnb - cut;
  1177. i__2 = *n + *nb + 1;
  1178. i__3 = *n + *nb + 1;
  1179. zgemm_("T", "N", &nnb, &nnb, &i__1, &c_b1, &a[cut + nnb + 1 +
  1180. (cut + 1) * a_dim1], lda, &work[work_offset], &i__2, &
  1181. c_b2, &work[u11 + 1 + work_dim1], &i__3);
  1182. /* L11 = L11**T*invD1*L11 + U01**T*invD*U01 */
  1183. i__1 = nnb;
  1184. for (i__ = 1; i__ <= i__1; ++i__) {
  1185. i__2 = i__;
  1186. for (j = 1; j <= i__2; ++j) {
  1187. i__3 = cut + i__ + (cut + j) * a_dim1;
  1188. i__4 = cut + i__ + (cut + j) * a_dim1;
  1189. i__5 = u11 + i__ + j * work_dim1;
  1190. z__1.r = a[i__4].r + work[i__5].r, z__1.i = a[i__4].i
  1191. + work[i__5].i;
  1192. a[i__3].r = z__1.r, a[i__3].i = z__1.i;
  1193. }
  1194. }
  1195. /* U01 = L22**T*invD2*L21 */
  1196. i__1 = *n - nnb - cut;
  1197. i__2 = *n + *nb + 1;
  1198. ztrmm_("L", uplo, "T", "U", &i__1, &nnb, &c_b1, &a[cut + nnb
  1199. + 1 + (cut + nnb + 1) * a_dim1], lda, &work[
  1200. work_offset], &i__2);
  1201. /* Update L21 */
  1202. i__1 = *n - cut - nnb;
  1203. for (i__ = 1; i__ <= i__1; ++i__) {
  1204. i__2 = nnb;
  1205. for (j = 1; j <= i__2; ++j) {
  1206. i__3 = cut + nnb + i__ + (cut + j) * a_dim1;
  1207. i__4 = i__ + j * work_dim1;
  1208. a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
  1209. }
  1210. }
  1211. } else {
  1212. /* L11 = L11**T*invD1*L11 */
  1213. i__1 = nnb;
  1214. for (i__ = 1; i__ <= i__1; ++i__) {
  1215. i__2 = i__;
  1216. for (j = 1; j <= i__2; ++j) {
  1217. i__3 = cut + i__ + (cut + j) * a_dim1;
  1218. i__4 = u11 + i__ + j * work_dim1;
  1219. a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
  1220. }
  1221. }
  1222. }
  1223. /* Next Block */
  1224. cut += nnb;
  1225. }
  1226. /* Apply PERMUTATIONS P and P**T: P * inv(U**T)*inv(D)*inv(U) *P**T */
  1227. i__ = *n;
  1228. while(i__ >= 1) {
  1229. if (ipiv[i__] > 0) {
  1230. ip = ipiv[i__];
  1231. if (i__ < ip) {
  1232. zsyswapr_(uplo, n, &a[a_offset], lda, &i__, &ip);
  1233. }
  1234. if (i__ > ip) {
  1235. zsyswapr_(uplo, n, &a[a_offset], lda, &ip, &i__);
  1236. }
  1237. } else {
  1238. ip = -ipiv[i__];
  1239. if (i__ < ip) {
  1240. zsyswapr_(uplo, n, &a[a_offset], lda, &i__, &ip);
  1241. }
  1242. if (i__ > ip) {
  1243. zsyswapr_(uplo, n, &a[a_offset], lda, &ip, &i__);
  1244. }
  1245. --i__;
  1246. }
  1247. --i__;
  1248. }
  1249. }
  1250. return;
  1251. /* End of ZSYTRI2X */
  1252. } /* zsytri2x_ */