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.

zlakf2.c 13 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495
  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 char integer1;
  52. #define TRUE_ (1)
  53. #define FALSE_ (0)
  54. /* Extern is for use with -E */
  55. #ifndef Extern
  56. #define Extern extern
  57. #endif
  58. /* I/O stuff */
  59. typedef int flag;
  60. typedef int ftnlen;
  61. typedef int ftnint;
  62. /*external read, write*/
  63. typedef struct
  64. { flag cierr;
  65. ftnint ciunit;
  66. flag ciend;
  67. char *cifmt;
  68. ftnint cirec;
  69. } cilist;
  70. /*internal read, write*/
  71. typedef struct
  72. { flag icierr;
  73. char *iciunit;
  74. flag iciend;
  75. char *icifmt;
  76. ftnint icirlen;
  77. ftnint icirnum;
  78. } icilist;
  79. /*open*/
  80. typedef struct
  81. { flag oerr;
  82. ftnint ounit;
  83. char *ofnm;
  84. ftnlen ofnmlen;
  85. char *osta;
  86. char *oacc;
  87. char *ofm;
  88. ftnint orl;
  89. char *oblnk;
  90. } olist;
  91. /*close*/
  92. typedef struct
  93. { flag cerr;
  94. ftnint cunit;
  95. char *csta;
  96. } cllist;
  97. /*rewind, backspace, endfile*/
  98. typedef struct
  99. { flag aerr;
  100. ftnint aunit;
  101. } alist;
  102. /* inquire */
  103. typedef struct
  104. { flag inerr;
  105. ftnint inunit;
  106. char *infile;
  107. ftnlen infilen;
  108. ftnint *inex; /*parameters in standard's order*/
  109. ftnint *inopen;
  110. ftnint *innum;
  111. ftnint *innamed;
  112. char *inname;
  113. ftnlen innamlen;
  114. char *inacc;
  115. ftnlen inacclen;
  116. char *inseq;
  117. ftnlen inseqlen;
  118. char *indir;
  119. ftnlen indirlen;
  120. char *infmt;
  121. ftnlen infmtlen;
  122. char *inform;
  123. ftnint informlen;
  124. char *inunf;
  125. ftnlen inunflen;
  126. ftnint *inrecl;
  127. ftnint *innrec;
  128. char *inblank;
  129. ftnlen inblanklen;
  130. } inlist;
  131. #define VOID void
  132. union Multitype { /* for multiple entry points */
  133. integer1 g;
  134. shortint h;
  135. integer i;
  136. /* longint j; */
  137. real r;
  138. doublereal d;
  139. complex c;
  140. doublecomplex z;
  141. };
  142. typedef union Multitype Multitype;
  143. struct Vardesc { /* for Namelist */
  144. char *name;
  145. char *addr;
  146. ftnlen *dims;
  147. int type;
  148. };
  149. typedef struct Vardesc Vardesc;
  150. struct Namelist {
  151. char *name;
  152. Vardesc **vars;
  153. int nvars;
  154. };
  155. typedef struct Namelist Namelist;
  156. #define abs(x) ((x) >= 0 ? (x) : -(x))
  157. #define dabs(x) (fabs(x))
  158. #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
  159. #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
  160. #define dmin(a,b) (f2cmin(a,b))
  161. #define dmax(a,b) (f2cmax(a,b))
  162. #define bit_test(a,b) ((a) >> (b) & 1)
  163. #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
  164. #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
  165. #define abort_() { sig_die("Fortran abort routine called", 1); }
  166. #define c_abs(z) (cabsf(Cf(z)))
  167. #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
  168. #ifdef _MSC_VER
  169. #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]);}
  170. #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]);}
  171. #else
  172. #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
  173. #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
  174. #endif
  175. #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
  176. #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
  177. #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
  178. //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
  179. #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
  180. #define d_abs(x) (fabs(*(x)))
  181. #define d_acos(x) (acos(*(x)))
  182. #define d_asin(x) (asin(*(x)))
  183. #define d_atan(x) (atan(*(x)))
  184. #define d_atn2(x, y) (atan2(*(x),*(y)))
  185. #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
  186. #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
  187. #define d_cos(x) (cos(*(x)))
  188. #define d_cosh(x) (cosh(*(x)))
  189. #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
  190. #define d_exp(x) (exp(*(x)))
  191. #define d_imag(z) (cimag(Cd(z)))
  192. #define r_imag(z) (cimagf(Cf(z)))
  193. #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  194. #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  195. #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  196. #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  197. #define d_log(x) (log(*(x)))
  198. #define d_mod(x, y) (fmod(*(x), *(y)))
  199. #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
  200. #define d_nint(x) u_nint(*(x))
  201. #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
  202. #define d_sign(a,b) u_sign(*(a),*(b))
  203. #define r_sign(a,b) u_sign(*(a),*(b))
  204. #define d_sin(x) (sin(*(x)))
  205. #define d_sinh(x) (sinh(*(x)))
  206. #define d_sqrt(x) (sqrt(*(x)))
  207. #define d_tan(x) (tan(*(x)))
  208. #define d_tanh(x) (tanh(*(x)))
  209. #define i_abs(x) abs(*(x))
  210. #define i_dnnt(x) ((integer)u_nint(*(x)))
  211. #define i_len(s, n) (n)
  212. #define i_nint(x) ((integer)u_nint(*(x)))
  213. #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
  214. #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
  215. #define pow_si(B,E) spow_ui(*(B),*(E))
  216. #define pow_ri(B,E) spow_ui(*(B),*(E))
  217. #define pow_di(B,E) dpow_ui(*(B),*(E))
  218. #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
  219. #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
  220. #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
  221. #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++ = ' '; }
  222. #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
  223. #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]; }
  224. #define sig_die(s, kill) { exit(1); }
  225. #define s_stop(s, n) {exit(0);}
  226. #define z_abs(z) (cabs(Cd(z)))
  227. #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
  228. #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
  229. #define myexit_() break;
  230. #define mycycle_() continue;
  231. #define myceiling_(w) {ceil(w)}
  232. #define myhuge_(w) {HUGE_VAL}
  233. //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
  234. #define mymaxloc_(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
  235. /* procedure parameter types for -A and -C++ */
  236. /* Table of constant values */
  237. static doublecomplex c_b1 = {0.,0.};
  238. /* > \brief \b ZLAKF2 */
  239. /* =========== DOCUMENTATION =========== */
  240. /* Online html documentation available at */
  241. /* http://www.netlib.org/lapack/explore-html/ */
  242. /* Definition: */
  243. /* =========== */
  244. /* SUBROUTINE ZLAKF2( M, N, A, LDA, B, D, E, Z, LDZ ) */
  245. /* INTEGER LDA, LDZ, M, N */
  246. /* COMPLEX*16 A( LDA, * ), B( LDA, * ), D( LDA, * ), */
  247. /* $ E( LDA, * ), Z( LDZ, * ) */
  248. /* > \par Purpose: */
  249. /* ============= */
  250. /* > */
  251. /* > \verbatim */
  252. /* > */
  253. /* > Form the 2*M*N by 2*M*N matrix */
  254. /* > */
  255. /* > Z = [ kron(In, A) -kron(B', Im) ] */
  256. /* > [ kron(In, D) -kron(E', Im) ], */
  257. /* > */
  258. /* > where In is the identity matrix of size n and X' is the transpose */
  259. /* > of X. kron(X, Y) is the Kronecker product between the matrices X */
  260. /* > and Y. */
  261. /* > \endverbatim */
  262. /* Arguments: */
  263. /* ========== */
  264. /* > \param[in] M */
  265. /* > \verbatim */
  266. /* > M is INTEGER */
  267. /* > Size of matrix, must be >= 1. */
  268. /* > \endverbatim */
  269. /* > */
  270. /* > \param[in] N */
  271. /* > \verbatim */
  272. /* > N is INTEGER */
  273. /* > Size of matrix, must be >= 1. */
  274. /* > \endverbatim */
  275. /* > */
  276. /* > \param[in] A */
  277. /* > \verbatim */
  278. /* > A is COMPLEX*16, dimension ( LDA, M ) */
  279. /* > The matrix A in the output matrix Z. */
  280. /* > \endverbatim */
  281. /* > */
  282. /* > \param[in] LDA */
  283. /* > \verbatim */
  284. /* > LDA is INTEGER */
  285. /* > The leading dimension of A, B, D, and E. ( LDA >= M+N ) */
  286. /* > \endverbatim */
  287. /* > */
  288. /* > \param[in] B */
  289. /* > \verbatim */
  290. /* > B is COMPLEX*16, dimension ( LDA, N ) */
  291. /* > \endverbatim */
  292. /* > */
  293. /* > \param[in] D */
  294. /* > \verbatim */
  295. /* > D is COMPLEX*16, dimension ( LDA, M ) */
  296. /* > \endverbatim */
  297. /* > */
  298. /* > \param[in] E */
  299. /* > \verbatim */
  300. /* > E is COMPLEX*16, dimension ( LDA, N ) */
  301. /* > */
  302. /* > The matrices used in forming the output matrix Z. */
  303. /* > \endverbatim */
  304. /* > */
  305. /* > \param[out] Z */
  306. /* > \verbatim */
  307. /* > Z is COMPLEX*16, dimension ( LDZ, 2*M*N ) */
  308. /* > The resultant Kronecker M*N*2 by M*N*2 matrix (see above.) */
  309. /* > \endverbatim */
  310. /* > */
  311. /* > \param[in] LDZ */
  312. /* > \verbatim */
  313. /* > LDZ is INTEGER */
  314. /* > The leading dimension of Z. ( LDZ >= 2*M*N ) */
  315. /* > \endverbatim */
  316. /* Authors: */
  317. /* ======== */
  318. /* > \author Univ. of Tennessee */
  319. /* > \author Univ. of California Berkeley */
  320. /* > \author Univ. of Colorado Denver */
  321. /* > \author NAG Ltd. */
  322. /* > \date December 2016 */
  323. /* > \ingroup complex16_matgen */
  324. /* ===================================================================== */
  325. /* Subroutine */ void zlakf2_(integer *m, integer *n, doublecomplex *a,
  326. integer *lda, doublecomplex *b, doublecomplex *d__, doublecomplex *e,
  327. doublecomplex *z__, integer *ldz)
  328. {
  329. /* System generated locals */
  330. integer a_dim1, a_offset, b_dim1, b_offset, d_dim1, d_offset, e_dim1,
  331. e_offset, z_dim1, z_offset, i__1, i__2, i__3, i__4, i__5;
  332. doublecomplex z__1;
  333. /* Local variables */
  334. integer i__, j, l, ik, jk, mn;
  335. extern /* Subroutine */ void zlaset_(char *, integer *, integer *,
  336. doublecomplex *, doublecomplex *, doublecomplex *, integer *);
  337. integer mn2;
  338. /* -- LAPACK computational routine (version 3.7.0) -- */
  339. /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
  340. /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  341. /* December 2016 */
  342. /* ==================================================================== */
  343. /* Initialize Z */
  344. /* Parameter adjustments */
  345. e_dim1 = *lda;
  346. e_offset = 1 + e_dim1 * 1;
  347. e -= e_offset;
  348. d_dim1 = *lda;
  349. d_offset = 1 + d_dim1 * 1;
  350. d__ -= d_offset;
  351. b_dim1 = *lda;
  352. b_offset = 1 + b_dim1 * 1;
  353. b -= b_offset;
  354. a_dim1 = *lda;
  355. a_offset = 1 + a_dim1 * 1;
  356. a -= a_offset;
  357. z_dim1 = *ldz;
  358. z_offset = 1 + z_dim1 * 1;
  359. z__ -= z_offset;
  360. /* Function Body */
  361. mn = *m * *n;
  362. mn2 = mn << 1;
  363. zlaset_("Full", &mn2, &mn2, &c_b1, &c_b1, &z__[z_offset], ldz);
  364. ik = 1;
  365. i__1 = *n;
  366. for (l = 1; l <= i__1; ++l) {
  367. /* form kron(In, A) */
  368. i__2 = *m;
  369. for (i__ = 1; i__ <= i__2; ++i__) {
  370. i__3 = *m;
  371. for (j = 1; j <= i__3; ++j) {
  372. i__4 = ik + i__ - 1 + (ik + j - 1) * z_dim1;
  373. i__5 = i__ + j * a_dim1;
  374. z__[i__4].r = a[i__5].r, z__[i__4].i = a[i__5].i;
  375. /* L10: */
  376. }
  377. /* L20: */
  378. }
  379. /* form kron(In, D) */
  380. i__2 = *m;
  381. for (i__ = 1; i__ <= i__2; ++i__) {
  382. i__3 = *m;
  383. for (j = 1; j <= i__3; ++j) {
  384. i__4 = ik + mn + i__ - 1 + (ik + j - 1) * z_dim1;
  385. i__5 = i__ + j * d_dim1;
  386. z__[i__4].r = d__[i__5].r, z__[i__4].i = d__[i__5].i;
  387. /* L30: */
  388. }
  389. /* L40: */
  390. }
  391. ik += *m;
  392. /* L50: */
  393. }
  394. ik = 1;
  395. i__1 = *n;
  396. for (l = 1; l <= i__1; ++l) {
  397. jk = mn + 1;
  398. i__2 = *n;
  399. for (j = 1; j <= i__2; ++j) {
  400. /* form -kron(B', Im) */
  401. i__3 = *m;
  402. for (i__ = 1; i__ <= i__3; ++i__) {
  403. i__4 = ik + i__ - 1 + (jk + i__ - 1) * z_dim1;
  404. i__5 = j + l * b_dim1;
  405. z__1.r = -b[i__5].r, z__1.i = -b[i__5].i;
  406. z__[i__4].r = z__1.r, z__[i__4].i = z__1.i;
  407. /* L60: */
  408. }
  409. /* form -kron(E', Im) */
  410. i__3 = *m;
  411. for (i__ = 1; i__ <= i__3; ++i__) {
  412. i__4 = ik + mn + i__ - 1 + (jk + i__ - 1) * z_dim1;
  413. i__5 = j + l * e_dim1;
  414. z__1.r = -e[i__5].r, z__1.i = -e[i__5].i;
  415. z__[i__4].r = z__1.r, z__[i__4].i = z__1.i;
  416. /* L70: */
  417. }
  418. jk += *m;
  419. /* L80: */
  420. }
  421. ik += *m;
  422. /* L90: */
  423. }
  424. return;
  425. /* End of ZLAKF2 */
  426. } /* zlakf2_ */