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.

zlags2.c 32 kB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040
  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 ZLAGS2 */
  486. /* =========== DOCUMENTATION =========== */
  487. /* Online html documentation available at */
  488. /* http://www.netlib.org/lapack/explore-html/ */
  489. /* > \htmlonly */
  490. /* > Download ZLAGS2 + dependencies */
  491. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlags2.
  492. f"> */
  493. /* > [TGZ]</a> */
  494. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlags2.
  495. f"> */
  496. /* > [ZIP]</a> */
  497. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlags2.
  498. f"> */
  499. /* > [TXT]</a> */
  500. /* > \endhtmlonly */
  501. /* Definition: */
  502. /* =========== */
  503. /* SUBROUTINE ZLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV, */
  504. /* SNV, CSQ, SNQ ) */
  505. /* LOGICAL UPPER */
  506. /* DOUBLE PRECISION A1, A3, B1, B3, CSQ, CSU, CSV */
  507. /* COMPLEX*16 A2, B2, SNQ, SNU, SNV */
  508. /* > \par Purpose: */
  509. /* ============= */
  510. /* > */
  511. /* > \verbatim */
  512. /* > */
  513. /* > ZLAGS2 computes 2-by-2 unitary matrices U, V and Q, such */
  514. /* > that if ( UPPER ) then */
  515. /* > */
  516. /* > U**H *A*Q = U**H *( A1 A2 )*Q = ( x 0 ) */
  517. /* > ( 0 A3 ) ( x x ) */
  518. /* > and */
  519. /* > V**H*B*Q = V**H *( B1 B2 )*Q = ( x 0 ) */
  520. /* > ( 0 B3 ) ( x x ) */
  521. /* > */
  522. /* > or if ( .NOT.UPPER ) then */
  523. /* > */
  524. /* > U**H *A*Q = U**H *( A1 0 )*Q = ( x x ) */
  525. /* > ( A2 A3 ) ( 0 x ) */
  526. /* > and */
  527. /* > V**H *B*Q = V**H *( B1 0 )*Q = ( x x ) */
  528. /* > ( B2 B3 ) ( 0 x ) */
  529. /* > where */
  530. /* > */
  531. /* > U = ( CSU SNU ), V = ( CSV SNV ), */
  532. /* > ( -SNU**H CSU ) ( -SNV**H CSV ) */
  533. /* > */
  534. /* > Q = ( CSQ SNQ ) */
  535. /* > ( -SNQ**H CSQ ) */
  536. /* > */
  537. /* > The rows of the transformed A and B are parallel. Moreover, if the */
  538. /* > input 2-by-2 matrix A is not zero, then the transformed (1,1) entry */
  539. /* > of A is not zero. If the input matrices A and B are both not zero, */
  540. /* > then the transformed (2,2) element of B is not zero, except when the */
  541. /* > first rows of input A and B are parallel and the second rows are */
  542. /* > zero. */
  543. /* > \endverbatim */
  544. /* Arguments: */
  545. /* ========== */
  546. /* > \param[in] UPPER */
  547. /* > \verbatim */
  548. /* > UPPER is LOGICAL */
  549. /* > = .TRUE.: the input matrices A and B are upper triangular. */
  550. /* > = .FALSE.: the input matrices A and B are lower triangular. */
  551. /* > \endverbatim */
  552. /* > */
  553. /* > \param[in] A1 */
  554. /* > \verbatim */
  555. /* > A1 is DOUBLE PRECISION */
  556. /* > \endverbatim */
  557. /* > */
  558. /* > \param[in] A2 */
  559. /* > \verbatim */
  560. /* > A2 is COMPLEX*16 */
  561. /* > \endverbatim */
  562. /* > */
  563. /* > \param[in] A3 */
  564. /* > \verbatim */
  565. /* > A3 is DOUBLE PRECISION */
  566. /* > On entry, A1, A2 and A3 are elements of the input 2-by-2 */
  567. /* > upper (lower) triangular matrix A. */
  568. /* > \endverbatim */
  569. /* > */
  570. /* > \param[in] B1 */
  571. /* > \verbatim */
  572. /* > B1 is DOUBLE PRECISION */
  573. /* > \endverbatim */
  574. /* > */
  575. /* > \param[in] B2 */
  576. /* > \verbatim */
  577. /* > B2 is COMPLEX*16 */
  578. /* > \endverbatim */
  579. /* > */
  580. /* > \param[in] B3 */
  581. /* > \verbatim */
  582. /* > B3 is DOUBLE PRECISION */
  583. /* > On entry, B1, B2 and B3 are elements of the input 2-by-2 */
  584. /* > upper (lower) triangular matrix B. */
  585. /* > \endverbatim */
  586. /* > */
  587. /* > \param[out] CSU */
  588. /* > \verbatim */
  589. /* > CSU is DOUBLE PRECISION */
  590. /* > \endverbatim */
  591. /* > */
  592. /* > \param[out] SNU */
  593. /* > \verbatim */
  594. /* > SNU is COMPLEX*16 */
  595. /* > The desired unitary matrix U. */
  596. /* > \endverbatim */
  597. /* > */
  598. /* > \param[out] CSV */
  599. /* > \verbatim */
  600. /* > CSV is DOUBLE PRECISION */
  601. /* > \endverbatim */
  602. /* > */
  603. /* > \param[out] SNV */
  604. /* > \verbatim */
  605. /* > SNV is COMPLEX*16 */
  606. /* > The desired unitary matrix V. */
  607. /* > \endverbatim */
  608. /* > */
  609. /* > \param[out] CSQ */
  610. /* > \verbatim */
  611. /* > CSQ is DOUBLE PRECISION */
  612. /* > \endverbatim */
  613. /* > */
  614. /* > \param[out] SNQ */
  615. /* > \verbatim */
  616. /* > SNQ is COMPLEX*16 */
  617. /* > The desired unitary matrix Q. */
  618. /* > \endverbatim */
  619. /* Authors: */
  620. /* ======== */
  621. /* > \author Univ. of Tennessee */
  622. /* > \author Univ. of California Berkeley */
  623. /* > \author Univ. of Colorado Denver */
  624. /* > \author NAG Ltd. */
  625. /* > \date December 2016 */
  626. /* > \ingroup complex16OTHERauxiliary */
  627. /* ===================================================================== */
  628. /* Subroutine */ void zlags2_(logical *upper, doublereal *a1, doublecomplex *
  629. a2, doublereal *a3, doublereal *b1, doublecomplex *b2, doublereal *b3,
  630. doublereal *csu, doublecomplex *snu, doublereal *csv, doublecomplex *
  631. snv, doublereal *csq, doublecomplex *snq)
  632. {
  633. /* System generated locals */
  634. doublereal d__1, d__2, d__3, d__4, d__5, d__6, d__7, d__8;
  635. doublecomplex z__1, z__2, z__3, z__4, z__5;
  636. /* Local variables */
  637. doublereal aua11, aua12, aua21, aua22, avb12, avb11, avb21, avb22, ua11r,
  638. ua22r, vb11r, vb22r, a;
  639. doublecomplex b, c__;
  640. doublereal d__;
  641. doublecomplex r__, d1;
  642. doublereal s1, s2;
  643. extern /* Subroutine */ void dlasv2_(doublereal *, doublereal *,
  644. doublereal *, doublereal *, doublereal *, doublereal *,
  645. doublereal *, doublereal *, doublereal *);
  646. doublereal fb, fc;
  647. extern /* Subroutine */ void zlartg_(doublecomplex *, doublecomplex *,
  648. doublereal *, doublecomplex *, doublecomplex *);
  649. doublecomplex ua11, ua12, ua21, ua22, vb11, vb12, vb21, vb22;
  650. doublereal csl, csr, snl, snr;
  651. /* -- LAPACK auxiliary routine (version 3.7.0) -- */
  652. /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
  653. /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  654. /* December 2016 */
  655. /* ===================================================================== */
  656. if (*upper) {
  657. /* Input matrices A and B are upper triangular matrices */
  658. /* Form matrix C = A*adj(B) = ( a b ) */
  659. /* ( 0 d ) */
  660. a = *a1 * *b3;
  661. d__ = *a3 * *b1;
  662. z__2.r = *b1 * a2->r, z__2.i = *b1 * a2->i;
  663. z__3.r = *a1 * b2->r, z__3.i = *a1 * b2->i;
  664. z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
  665. b.r = z__1.r, b.i = z__1.i;
  666. fb = z_abs(&b);
  667. /* Transform complex 2-by-2 matrix C to real matrix by unitary */
  668. /* diagonal matrix diag(1,D1). */
  669. d1.r = 1., d1.i = 0.;
  670. if (fb != 0.) {
  671. z__1.r = b.r / fb, z__1.i = b.i / fb;
  672. d1.r = z__1.r, d1.i = z__1.i;
  673. }
  674. /* The SVD of real 2 by 2 triangular C */
  675. /* ( CSL -SNL )*( A B )*( CSR SNR ) = ( R 0 ) */
  676. /* ( SNL CSL ) ( 0 D ) ( -SNR CSR ) ( 0 T ) */
  677. dlasv2_(&a, &fb, &d__, &s1, &s2, &snr, &csr, &snl, &csl);
  678. if (abs(csl) >= abs(snl) || abs(csr) >= abs(snr)) {
  679. /* Compute the (1,1) and (1,2) elements of U**H *A and V**H *B, */
  680. /* and (1,2) element of |U|**H *|A| and |V|**H *|B|. */
  681. ua11r = csl * *a1;
  682. z__2.r = csl * a2->r, z__2.i = csl * a2->i;
  683. z__4.r = snl * d1.r, z__4.i = snl * d1.i;
  684. z__3.r = *a3 * z__4.r, z__3.i = *a3 * z__4.i;
  685. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  686. ua12.r = z__1.r, ua12.i = z__1.i;
  687. vb11r = csr * *b1;
  688. z__2.r = csr * b2->r, z__2.i = csr * b2->i;
  689. z__4.r = snr * d1.r, z__4.i = snr * d1.i;
  690. z__3.r = *b3 * z__4.r, z__3.i = *b3 * z__4.i;
  691. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  692. vb12.r = z__1.r, vb12.i = z__1.i;
  693. aua12 = abs(csl) * ((d__1 = a2->r, abs(d__1)) + (d__2 = d_imag(a2)
  694. , abs(d__2))) + abs(snl) * abs(*a3);
  695. avb12 = abs(csr) * ((d__1 = b2->r, abs(d__1)) + (d__2 = d_imag(b2)
  696. , abs(d__2))) + abs(snr) * abs(*b3);
  697. /* zero (1,2) elements of U**H *A and V**H *B */
  698. if (abs(ua11r) + ((d__1 = ua12.r, abs(d__1)) + (d__2 = d_imag(&
  699. ua12), abs(d__2))) == 0.) {
  700. z__2.r = vb11r, z__2.i = 0.;
  701. z__1.r = -z__2.r, z__1.i = -z__2.i;
  702. d_cnjg(&z__3, &vb12);
  703. zlartg_(&z__1, &z__3, csq, snq, &r__);
  704. } else if (abs(vb11r) + ((d__1 = vb12.r, abs(d__1)) + (d__2 =
  705. d_imag(&vb12), abs(d__2))) == 0.) {
  706. z__2.r = ua11r, z__2.i = 0.;
  707. z__1.r = -z__2.r, z__1.i = -z__2.i;
  708. d_cnjg(&z__3, &ua12);
  709. zlartg_(&z__1, &z__3, csq, snq, &r__);
  710. } else if (aua12 / (abs(ua11r) + ((d__1 = ua12.r, abs(d__1)) + (
  711. d__2 = d_imag(&ua12), abs(d__2)))) <= avb12 / (abs(vb11r)
  712. + ((d__3 = vb12.r, abs(d__3)) + (d__4 = d_imag(&vb12),
  713. abs(d__4))))) {
  714. z__2.r = ua11r, z__2.i = 0.;
  715. z__1.r = -z__2.r, z__1.i = -z__2.i;
  716. d_cnjg(&z__3, &ua12);
  717. zlartg_(&z__1, &z__3, csq, snq, &r__);
  718. } else {
  719. z__2.r = vb11r, z__2.i = 0.;
  720. z__1.r = -z__2.r, z__1.i = -z__2.i;
  721. d_cnjg(&z__3, &vb12);
  722. zlartg_(&z__1, &z__3, csq, snq, &r__);
  723. }
  724. *csu = csl;
  725. z__2.r = -d1.r, z__2.i = -d1.i;
  726. z__1.r = snl * z__2.r, z__1.i = snl * z__2.i;
  727. snu->r = z__1.r, snu->i = z__1.i;
  728. *csv = csr;
  729. z__2.r = -d1.r, z__2.i = -d1.i;
  730. z__1.r = snr * z__2.r, z__1.i = snr * z__2.i;
  731. snv->r = z__1.r, snv->i = z__1.i;
  732. } else {
  733. /* Compute the (2,1) and (2,2) elements of U**H *A and V**H *B, */
  734. /* and (2,2) element of |U|**H *|A| and |V|**H *|B|. */
  735. d_cnjg(&z__4, &d1);
  736. z__3.r = -z__4.r, z__3.i = -z__4.i;
  737. z__2.r = snl * z__3.r, z__2.i = snl * z__3.i;
  738. z__1.r = *a1 * z__2.r, z__1.i = *a1 * z__2.i;
  739. ua21.r = z__1.r, ua21.i = z__1.i;
  740. d_cnjg(&z__5, &d1);
  741. z__4.r = -z__5.r, z__4.i = -z__5.i;
  742. z__3.r = snl * z__4.r, z__3.i = snl * z__4.i;
  743. z__2.r = z__3.r * a2->r - z__3.i * a2->i, z__2.i = z__3.r * a2->i
  744. + z__3.i * a2->r;
  745. d__1 = csl * *a3;
  746. z__1.r = z__2.r + d__1, z__1.i = z__2.i;
  747. ua22.r = z__1.r, ua22.i = z__1.i;
  748. d_cnjg(&z__4, &d1);
  749. z__3.r = -z__4.r, z__3.i = -z__4.i;
  750. z__2.r = snr * z__3.r, z__2.i = snr * z__3.i;
  751. z__1.r = *b1 * z__2.r, z__1.i = *b1 * z__2.i;
  752. vb21.r = z__1.r, vb21.i = z__1.i;
  753. d_cnjg(&z__5, &d1);
  754. z__4.r = -z__5.r, z__4.i = -z__5.i;
  755. z__3.r = snr * z__4.r, z__3.i = snr * z__4.i;
  756. z__2.r = z__3.r * b2->r - z__3.i * b2->i, z__2.i = z__3.r * b2->i
  757. + z__3.i * b2->r;
  758. d__1 = csr * *b3;
  759. z__1.r = z__2.r + d__1, z__1.i = z__2.i;
  760. vb22.r = z__1.r, vb22.i = z__1.i;
  761. aua22 = abs(snl) * ((d__1 = a2->r, abs(d__1)) + (d__2 = d_imag(a2)
  762. , abs(d__2))) + abs(csl) * abs(*a3);
  763. avb22 = abs(snr) * ((d__1 = b2->r, abs(d__1)) + (d__2 = d_imag(b2)
  764. , abs(d__2))) + abs(csr) * abs(*b3);
  765. /* zero (2,2) elements of U**H *A and V**H *B, and then swap. */
  766. if ((d__1 = ua21.r, abs(d__1)) + (d__2 = d_imag(&ua21), abs(d__2))
  767. + ((d__3 = ua22.r, abs(d__3)) + (d__4 = d_imag(&ua22),
  768. abs(d__4))) == 0.) {
  769. d_cnjg(&z__2, &vb21);
  770. z__1.r = -z__2.r, z__1.i = -z__2.i;
  771. d_cnjg(&z__3, &vb22);
  772. zlartg_(&z__1, &z__3, csq, snq, &r__);
  773. } else if ((d__1 = vb21.r, abs(d__1)) + (d__2 = d_imag(&vb21),
  774. abs(d__2)) + z_abs(&vb22) == 0.) {
  775. d_cnjg(&z__2, &ua21);
  776. z__1.r = -z__2.r, z__1.i = -z__2.i;
  777. d_cnjg(&z__3, &ua22);
  778. zlartg_(&z__1, &z__3, csq, snq, &r__);
  779. } else if (aua22 / ((d__1 = ua21.r, abs(d__1)) + (d__2 = d_imag(&
  780. ua21), abs(d__2)) + ((d__3 = ua22.r, abs(d__3)) + (d__4 =
  781. d_imag(&ua22), abs(d__4)))) <= avb22 / ((d__5 = vb21.r,
  782. abs(d__5)) + (d__6 = d_imag(&vb21), abs(d__6)) + ((d__7 =
  783. vb22.r, abs(d__7)) + (d__8 = d_imag(&vb22), abs(d__8)))))
  784. {
  785. d_cnjg(&z__2, &ua21);
  786. z__1.r = -z__2.r, z__1.i = -z__2.i;
  787. d_cnjg(&z__3, &ua22);
  788. zlartg_(&z__1, &z__3, csq, snq, &r__);
  789. } else {
  790. d_cnjg(&z__2, &vb21);
  791. z__1.r = -z__2.r, z__1.i = -z__2.i;
  792. d_cnjg(&z__3, &vb22);
  793. zlartg_(&z__1, &z__3, csq, snq, &r__);
  794. }
  795. *csu = snl;
  796. z__1.r = csl * d1.r, z__1.i = csl * d1.i;
  797. snu->r = z__1.r, snu->i = z__1.i;
  798. *csv = snr;
  799. z__1.r = csr * d1.r, z__1.i = csr * d1.i;
  800. snv->r = z__1.r, snv->i = z__1.i;
  801. }
  802. } else {
  803. /* Input matrices A and B are lower triangular matrices */
  804. /* Form matrix C = A*adj(B) = ( a 0 ) */
  805. /* ( c d ) */
  806. a = *a1 * *b3;
  807. d__ = *a3 * *b1;
  808. z__2.r = *b3 * a2->r, z__2.i = *b3 * a2->i;
  809. z__3.r = *a3 * b2->r, z__3.i = *a3 * b2->i;
  810. z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
  811. c__.r = z__1.r, c__.i = z__1.i;
  812. fc = z_abs(&c__);
  813. /* Transform complex 2-by-2 matrix C to real matrix by unitary */
  814. /* diagonal matrix diag(d1,1). */
  815. d1.r = 1., d1.i = 0.;
  816. if (fc != 0.) {
  817. z__1.r = c__.r / fc, z__1.i = c__.i / fc;
  818. d1.r = z__1.r, d1.i = z__1.i;
  819. }
  820. /* The SVD of real 2 by 2 triangular C */
  821. /* ( CSL -SNL )*( A 0 )*( CSR SNR ) = ( R 0 ) */
  822. /* ( SNL CSL ) ( C D ) ( -SNR CSR ) ( 0 T ) */
  823. dlasv2_(&a, &fc, &d__, &s1, &s2, &snr, &csr, &snl, &csl);
  824. if (abs(csr) >= abs(snr) || abs(csl) >= abs(snl)) {
  825. /* Compute the (2,1) and (2,2) elements of U**H *A and V**H *B, */
  826. /* and (2,1) element of |U|**H *|A| and |V|**H *|B|. */
  827. z__4.r = -d1.r, z__4.i = -d1.i;
  828. z__3.r = snr * z__4.r, z__3.i = snr * z__4.i;
  829. z__2.r = *a1 * z__3.r, z__2.i = *a1 * z__3.i;
  830. z__5.r = csr * a2->r, z__5.i = csr * a2->i;
  831. z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
  832. ua21.r = z__1.r, ua21.i = z__1.i;
  833. ua22r = csr * *a3;
  834. z__4.r = -d1.r, z__4.i = -d1.i;
  835. z__3.r = snl * z__4.r, z__3.i = snl * z__4.i;
  836. z__2.r = *b1 * z__3.r, z__2.i = *b1 * z__3.i;
  837. z__5.r = csl * b2->r, z__5.i = csl * b2->i;
  838. z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
  839. vb21.r = z__1.r, vb21.i = z__1.i;
  840. vb22r = csl * *b3;
  841. aua21 = abs(snr) * abs(*a1) + abs(csr) * ((d__1 = a2->r, abs(d__1)
  842. ) + (d__2 = d_imag(a2), abs(d__2)));
  843. avb21 = abs(snl) * abs(*b1) + abs(csl) * ((d__1 = b2->r, abs(d__1)
  844. ) + (d__2 = d_imag(b2), abs(d__2)));
  845. /* zero (2,1) elements of U**H *A and V**H *B. */
  846. if ((d__1 = ua21.r, abs(d__1)) + (d__2 = d_imag(&ua21), abs(d__2))
  847. + abs(ua22r) == 0.) {
  848. z__1.r = vb22r, z__1.i = 0.;
  849. zlartg_(&z__1, &vb21, csq, snq, &r__);
  850. } else if ((d__1 = vb21.r, abs(d__1)) + (d__2 = d_imag(&vb21),
  851. abs(d__2)) + abs(vb22r) == 0.) {
  852. z__1.r = ua22r, z__1.i = 0.;
  853. zlartg_(&z__1, &ua21, csq, snq, &r__);
  854. } else if (aua21 / ((d__1 = ua21.r, abs(d__1)) + (d__2 = d_imag(&
  855. ua21), abs(d__2)) + abs(ua22r)) <= avb21 / ((d__3 =
  856. vb21.r, abs(d__3)) + (d__4 = d_imag(&vb21), abs(d__4)) +
  857. abs(vb22r))) {
  858. z__1.r = ua22r, z__1.i = 0.;
  859. zlartg_(&z__1, &ua21, csq, snq, &r__);
  860. } else {
  861. z__1.r = vb22r, z__1.i = 0.;
  862. zlartg_(&z__1, &vb21, csq, snq, &r__);
  863. }
  864. *csu = csr;
  865. d_cnjg(&z__3, &d1);
  866. z__2.r = -z__3.r, z__2.i = -z__3.i;
  867. z__1.r = snr * z__2.r, z__1.i = snr * z__2.i;
  868. snu->r = z__1.r, snu->i = z__1.i;
  869. *csv = csl;
  870. d_cnjg(&z__3, &d1);
  871. z__2.r = -z__3.r, z__2.i = -z__3.i;
  872. z__1.r = snl * z__2.r, z__1.i = snl * z__2.i;
  873. snv->r = z__1.r, snv->i = z__1.i;
  874. } else {
  875. /* Compute the (1,1) and (1,2) elements of U**H *A and V**H *B, */
  876. /* and (1,1) element of |U|**H *|A| and |V|**H *|B|. */
  877. d__1 = csr * *a1;
  878. d_cnjg(&z__4, &d1);
  879. z__3.r = snr * z__4.r, z__3.i = snr * z__4.i;
  880. z__2.r = z__3.r * a2->r - z__3.i * a2->i, z__2.i = z__3.r * a2->i
  881. + z__3.i * a2->r;
  882. z__1.r = d__1 + z__2.r, z__1.i = z__2.i;
  883. ua11.r = z__1.r, ua11.i = z__1.i;
  884. d_cnjg(&z__3, &d1);
  885. z__2.r = snr * z__3.r, z__2.i = snr * z__3.i;
  886. z__1.r = *a3 * z__2.r, z__1.i = *a3 * z__2.i;
  887. ua12.r = z__1.r, ua12.i = z__1.i;
  888. d__1 = csl * *b1;
  889. d_cnjg(&z__4, &d1);
  890. z__3.r = snl * z__4.r, z__3.i = snl * z__4.i;
  891. z__2.r = z__3.r * b2->r - z__3.i * b2->i, z__2.i = z__3.r * b2->i
  892. + z__3.i * b2->r;
  893. z__1.r = d__1 + z__2.r, z__1.i = z__2.i;
  894. vb11.r = z__1.r, vb11.i = z__1.i;
  895. d_cnjg(&z__3, &d1);
  896. z__2.r = snl * z__3.r, z__2.i = snl * z__3.i;
  897. z__1.r = *b3 * z__2.r, z__1.i = *b3 * z__2.i;
  898. vb12.r = z__1.r, vb12.i = z__1.i;
  899. aua11 = abs(csr) * abs(*a1) + abs(snr) * ((d__1 = a2->r, abs(d__1)
  900. ) + (d__2 = d_imag(a2), abs(d__2)));
  901. avb11 = abs(csl) * abs(*b1) + abs(snl) * ((d__1 = b2->r, abs(d__1)
  902. ) + (d__2 = d_imag(b2), abs(d__2)));
  903. /* zero (1,1) elements of U**H *A and V**H *B, and then swap. */
  904. if ((d__1 = ua11.r, abs(d__1)) + (d__2 = d_imag(&ua11), abs(d__2))
  905. + ((d__3 = ua12.r, abs(d__3)) + (d__4 = d_imag(&ua12),
  906. abs(d__4))) == 0.) {
  907. zlartg_(&vb12, &vb11, csq, snq, &r__);
  908. } else if ((d__1 = vb11.r, abs(d__1)) + (d__2 = d_imag(&vb11),
  909. abs(d__2)) + ((d__3 = vb12.r, abs(d__3)) + (d__4 = d_imag(
  910. &vb12), abs(d__4))) == 0.) {
  911. zlartg_(&ua12, &ua11, csq, snq, &r__);
  912. } else if (aua11 / ((d__1 = ua11.r, abs(d__1)) + (d__2 = d_imag(&
  913. ua11), abs(d__2)) + ((d__3 = ua12.r, abs(d__3)) + (d__4 =
  914. d_imag(&ua12), abs(d__4)))) <= avb11 / ((d__5 = vb11.r,
  915. abs(d__5)) + (d__6 = d_imag(&vb11), abs(d__6)) + ((d__7 =
  916. vb12.r, abs(d__7)) + (d__8 = d_imag(&vb12), abs(d__8)))))
  917. {
  918. zlartg_(&ua12, &ua11, csq, snq, &r__);
  919. } else {
  920. zlartg_(&vb12, &vb11, csq, snq, &r__);
  921. }
  922. *csu = snr;
  923. d_cnjg(&z__2, &d1);
  924. z__1.r = csr * z__2.r, z__1.i = csr * z__2.i;
  925. snu->r = z__1.r, snu->i = z__1.i;
  926. *csv = snl;
  927. d_cnjg(&z__2, &d1);
  928. z__1.r = csl * z__2.r, z__1.i = csl * z__2.i;
  929. snv->r = z__1.r, snv->i = z__1.i;
  930. }
  931. }
  932. return;
  933. /* End of ZLAGS2 */
  934. } /* zlags2_ */