dsygst.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348
  1. /* dsygst.f -- translated by f2c (version 20061008).
  2. You must link the resulting object file with libf2c:
  3. on Microsoft Windows system, link with libf2c.lib;
  4. on Linux or Unix systems, link with .../path/to/libf2c.a -lm
  5. or, if you install libf2c.a in a standard place, with -lf2c -lm
  6. -- in that order, at the end of the command line, as in
  7. cc *.o -lf2c -lm
  8. Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
  9. http://www.netlib.org/f2c/libf2c.zip
  10. */
  11. #include "f2c.h"
  12. #include "blaswrap.h"
  13. /* Table of constant values */
  14. static integer c__1 = 1;
  15. static integer c_n1 = -1;
  16. static doublereal c_b14 = 1.;
  17. static doublereal c_b16 = -.5;
  18. static doublereal c_b19 = -1.;
  19. static doublereal c_b52 = .5;
  20. /* Subroutine */ int _starpu_dsygst_(integer *itype, char *uplo, integer *n,
  21. doublereal *a, integer *lda, doublereal *b, integer *ldb, integer *
  22. info)
  23. {
  24. /* System generated locals */
  25. integer a_dim1, a_offset, b_dim1, b_offset, i__1, i__2, i__3;
  26. /* Local variables */
  27. integer k, kb, nb;
  28. extern logical _starpu_lsame_(char *, char *);
  29. extern /* Subroutine */ int _starpu_dtrmm_(char *, char *, char *, char *,
  30. integer *, integer *, doublereal *, doublereal *, integer *,
  31. doublereal *, integer *), _starpu_dsymm_(
  32. char *, char *, integer *, integer *, doublereal *, doublereal *,
  33. integer *, doublereal *, integer *, doublereal *, doublereal *,
  34. integer *);
  35. logical upper;
  36. extern /* Subroutine */ int _starpu_dtrsm_(char *, char *, char *, char *,
  37. integer *, integer *, doublereal *, doublereal *, integer *,
  38. doublereal *, integer *), _starpu_dsygs2_(
  39. integer *, char *, integer *, doublereal *, integer *, doublereal
  40. *, integer *, integer *), _starpu_dsyr2k_(char *, char *, integer
  41. *, integer *, doublereal *, doublereal *, integer *, doublereal *,
  42. integer *, doublereal *, doublereal *, integer *)
  43. , _starpu_xerbla_(char *, integer *);
  44. extern integer _starpu_ilaenv_(integer *, char *, char *, integer *, integer *,
  45. integer *, integer *);
  46. /* -- LAPACK routine (version 3.2) -- */
  47. /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
  48. /* November 2006 */
  49. /* .. Scalar Arguments .. */
  50. /* .. */
  51. /* .. Array Arguments .. */
  52. /* .. */
  53. /* Purpose */
  54. /* ======= */
  55. /* DSYGST reduces a real symmetric-definite generalized eigenproblem */
  56. /* to standard form. */
  57. /* If ITYPE = 1, the problem is A*x = lambda*B*x, */
  58. /* and A is overwritten by inv(U**T)*A*inv(U) or inv(L)*A*inv(L**T) */
  59. /* If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or */
  60. /* B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L. */
  61. /* B must have been previously factorized as U**T*U or L*L**T by DPOTRF. */
  62. /* Arguments */
  63. /* ========= */
  64. /* ITYPE (input) INTEGER */
  65. /* = 1: compute inv(U**T)*A*inv(U) or inv(L)*A*inv(L**T); */
  66. /* = 2 or 3: compute U*A*U**T or L**T*A*L. */
  67. /* UPLO (input) CHARACTER*1 */
  68. /* = 'U': Upper triangle of A is stored and B is factored as */
  69. /* U**T*U; */
  70. /* = 'L': Lower triangle of A is stored and B is factored as */
  71. /* L*L**T. */
  72. /* N (input) INTEGER */
  73. /* The order of the matrices A and B. N >= 0. */
  74. /* A (input/output) DOUBLE PRECISION array, dimension (LDA,N) */
  75. /* On entry, the symmetric matrix A. If UPLO = 'U', the leading */
  76. /* N-by-N upper triangular part of A contains the upper */
  77. /* triangular part of the matrix A, and the strictly lower */
  78. /* triangular part of A is not referenced. If UPLO = 'L', the */
  79. /* leading N-by-N lower triangular part of A contains the lower */
  80. /* triangular part of the matrix A, and the strictly upper */
  81. /* triangular part of A is not referenced. */
  82. /* On exit, if INFO = 0, the transformed matrix, stored in the */
  83. /* same format as A. */
  84. /* LDA (input) INTEGER */
  85. /* The leading dimension of the array A. LDA >= max(1,N). */
  86. /* B (input) DOUBLE PRECISION array, dimension (LDB,N) */
  87. /* The triangular factor from the Cholesky factorization of B, */
  88. /* as returned by DPOTRF. */
  89. /* LDB (input) INTEGER */
  90. /* The leading dimension of the array B. LDB >= max(1,N). */
  91. /* INFO (output) INTEGER */
  92. /* = 0: successful exit */
  93. /* < 0: if INFO = -i, the i-th argument had an illegal value */
  94. /* ===================================================================== */
  95. /* .. Parameters .. */
  96. /* .. */
  97. /* .. Local Scalars .. */
  98. /* .. */
  99. /* .. External Subroutines .. */
  100. /* .. */
  101. /* .. Intrinsic Functions .. */
  102. /* .. */
  103. /* .. External Functions .. */
  104. /* .. */
  105. /* .. Executable Statements .. */
  106. /* Test the input parameters. */
  107. /* Parameter adjustments */
  108. a_dim1 = *lda;
  109. a_offset = 1 + a_dim1;
  110. a -= a_offset;
  111. b_dim1 = *ldb;
  112. b_offset = 1 + b_dim1;
  113. b -= b_offset;
  114. /* Function Body */
  115. *info = 0;
  116. upper = _starpu_lsame_(uplo, "U");
  117. if (*itype < 1 || *itype > 3) {
  118. *info = -1;
  119. } else if (! upper && ! _starpu_lsame_(uplo, "L")) {
  120. *info = -2;
  121. } else if (*n < 0) {
  122. *info = -3;
  123. } else if (*lda < max(1,*n)) {
  124. *info = -5;
  125. } else if (*ldb < max(1,*n)) {
  126. *info = -7;
  127. }
  128. if (*info != 0) {
  129. i__1 = -(*info);
  130. _starpu_xerbla_("DSYGST", &i__1);
  131. return 0;
  132. }
  133. /* Quick return if possible */
  134. if (*n == 0) {
  135. return 0;
  136. }
  137. /* Determine the block size for this environment. */
  138. nb = _starpu_ilaenv_(&c__1, "DSYGST", uplo, n, &c_n1, &c_n1, &c_n1);
  139. if (nb <= 1 || nb >= *n) {
  140. /* Use unblocked code */
  141. _starpu_dsygs2_(itype, uplo, n, &a[a_offset], lda, &b[b_offset], ldb, info);
  142. } else {
  143. /* Use blocked code */
  144. if (*itype == 1) {
  145. if (upper) {
  146. /* Compute inv(U')*A*inv(U) */
  147. i__1 = *n;
  148. i__2 = nb;
  149. for (k = 1; i__2 < 0 ? k >= i__1 : k <= i__1; k += i__2) {
  150. /* Computing MIN */
  151. i__3 = *n - k + 1;
  152. kb = min(i__3,nb);
  153. /* Update the upper triangle of A(k:n,k:n) */
  154. _starpu_dsygs2_(itype, uplo, &kb, &a[k + k * a_dim1], lda, &b[k +
  155. k * b_dim1], ldb, info);
  156. if (k + kb <= *n) {
  157. i__3 = *n - k - kb + 1;
  158. _starpu_dtrsm_("Left", uplo, "Transpose", "Non-unit", &kb, &
  159. i__3, &c_b14, &b[k + k * b_dim1], ldb, &a[k +
  160. (k + kb) * a_dim1], lda);
  161. i__3 = *n - k - kb + 1;
  162. _starpu_dsymm_("Left", uplo, &kb, &i__3, &c_b16, &a[k + k *
  163. a_dim1], lda, &b[k + (k + kb) * b_dim1], ldb,
  164. &c_b14, &a[k + (k + kb) * a_dim1], lda);
  165. i__3 = *n - k - kb + 1;
  166. _starpu_dsyr2k_(uplo, "Transpose", &i__3, &kb, &c_b19, &a[k +
  167. (k + kb) * a_dim1], lda, &b[k + (k + kb) *
  168. b_dim1], ldb, &c_b14, &a[k + kb + (k + kb) *
  169. a_dim1], lda);
  170. i__3 = *n - k - kb + 1;
  171. _starpu_dsymm_("Left", uplo, &kb, &i__3, &c_b16, &a[k + k *
  172. a_dim1], lda, &b[k + (k + kb) * b_dim1], ldb,
  173. &c_b14, &a[k + (k + kb) * a_dim1], lda);
  174. i__3 = *n - k - kb + 1;
  175. _starpu_dtrsm_("Right", uplo, "No transpose", "Non-unit", &kb,
  176. &i__3, &c_b14, &b[k + kb + (k + kb) * b_dim1]
  177. , ldb, &a[k + (k + kb) * a_dim1], lda);
  178. }
  179. /* L10: */
  180. }
  181. } else {
  182. /* Compute inv(L)*A*inv(L') */
  183. i__2 = *n;
  184. i__1 = nb;
  185. for (k = 1; i__1 < 0 ? k >= i__2 : k <= i__2; k += i__1) {
  186. /* Computing MIN */
  187. i__3 = *n - k + 1;
  188. kb = min(i__3,nb);
  189. /* Update the lower triangle of A(k:n,k:n) */
  190. _starpu_dsygs2_(itype, uplo, &kb, &a[k + k * a_dim1], lda, &b[k +
  191. k * b_dim1], ldb, info);
  192. if (k + kb <= *n) {
  193. i__3 = *n - k - kb + 1;
  194. _starpu_dtrsm_("Right", uplo, "Transpose", "Non-unit", &i__3,
  195. &kb, &c_b14, &b[k + k * b_dim1], ldb, &a[k +
  196. kb + k * a_dim1], lda);
  197. i__3 = *n - k - kb + 1;
  198. _starpu_dsymm_("Right", uplo, &i__3, &kb, &c_b16, &a[k + k *
  199. a_dim1], lda, &b[k + kb + k * b_dim1], ldb, &
  200. c_b14, &a[k + kb + k * a_dim1], lda);
  201. i__3 = *n - k - kb + 1;
  202. _starpu_dsyr2k_(uplo, "No transpose", &i__3, &kb, &c_b19, &a[
  203. k + kb + k * a_dim1], lda, &b[k + kb + k *
  204. b_dim1], ldb, &c_b14, &a[k + kb + (k + kb) *
  205. a_dim1], lda);
  206. i__3 = *n - k - kb + 1;
  207. _starpu_dsymm_("Right", uplo, &i__3, &kb, &c_b16, &a[k + k *
  208. a_dim1], lda, &b[k + kb + k * b_dim1], ldb, &
  209. c_b14, &a[k + kb + k * a_dim1], lda);
  210. i__3 = *n - k - kb + 1;
  211. _starpu_dtrsm_("Left", uplo, "No transpose", "Non-unit", &
  212. i__3, &kb, &c_b14, &b[k + kb + (k + kb) *
  213. b_dim1], ldb, &a[k + kb + k * a_dim1], lda);
  214. }
  215. /* L20: */
  216. }
  217. }
  218. } else {
  219. if (upper) {
  220. /* Compute U*A*U' */
  221. i__1 = *n;
  222. i__2 = nb;
  223. for (k = 1; i__2 < 0 ? k >= i__1 : k <= i__1; k += i__2) {
  224. /* Computing MIN */
  225. i__3 = *n - k + 1;
  226. kb = min(i__3,nb);
  227. /* Update the upper triangle of A(1:k+kb-1,1:k+kb-1) */
  228. i__3 = k - 1;
  229. _starpu_dtrmm_("Left", uplo, "No transpose", "Non-unit", &i__3, &
  230. kb, &c_b14, &b[b_offset], ldb, &a[k * a_dim1 + 1],
  231. lda)
  232. ;
  233. i__3 = k - 1;
  234. _starpu_dsymm_("Right", uplo, &i__3, &kb, &c_b52, &a[k + k *
  235. a_dim1], lda, &b[k * b_dim1 + 1], ldb, &c_b14, &a[
  236. k * a_dim1 + 1], lda);
  237. i__3 = k - 1;
  238. _starpu_dsyr2k_(uplo, "No transpose", &i__3, &kb, &c_b14, &a[k *
  239. a_dim1 + 1], lda, &b[k * b_dim1 + 1], ldb, &c_b14,
  240. &a[a_offset], lda);
  241. i__3 = k - 1;
  242. _starpu_dsymm_("Right", uplo, &i__3, &kb, &c_b52, &a[k + k *
  243. a_dim1], lda, &b[k * b_dim1 + 1], ldb, &c_b14, &a[
  244. k * a_dim1 + 1], lda);
  245. i__3 = k - 1;
  246. _starpu_dtrmm_("Right", uplo, "Transpose", "Non-unit", &i__3, &kb,
  247. &c_b14, &b[k + k * b_dim1], ldb, &a[k * a_dim1 +
  248. 1], lda);
  249. _starpu_dsygs2_(itype, uplo, &kb, &a[k + k * a_dim1], lda, &b[k +
  250. k * b_dim1], ldb, info);
  251. /* L30: */
  252. }
  253. } else {
  254. /* Compute L'*A*L */
  255. i__2 = *n;
  256. i__1 = nb;
  257. for (k = 1; i__1 < 0 ? k >= i__2 : k <= i__2; k += i__1) {
  258. /* Computing MIN */
  259. i__3 = *n - k + 1;
  260. kb = min(i__3,nb);
  261. /* Update the lower triangle of A(1:k+kb-1,1:k+kb-1) */
  262. i__3 = k - 1;
  263. _starpu_dtrmm_("Right", uplo, "No transpose", "Non-unit", &kb, &
  264. i__3, &c_b14, &b[b_offset], ldb, &a[k + a_dim1],
  265. lda);
  266. i__3 = k - 1;
  267. _starpu_dsymm_("Left", uplo, &kb, &i__3, &c_b52, &a[k + k *
  268. a_dim1], lda, &b[k + b_dim1], ldb, &c_b14, &a[k +
  269. a_dim1], lda);
  270. i__3 = k - 1;
  271. _starpu_dsyr2k_(uplo, "Transpose", &i__3, &kb, &c_b14, &a[k +
  272. a_dim1], lda, &b[k + b_dim1], ldb, &c_b14, &a[
  273. a_offset], lda);
  274. i__3 = k - 1;
  275. _starpu_dsymm_("Left", uplo, &kb, &i__3, &c_b52, &a[k + k *
  276. a_dim1], lda, &b[k + b_dim1], ldb, &c_b14, &a[k +
  277. a_dim1], lda);
  278. i__3 = k - 1;
  279. _starpu_dtrmm_("Left", uplo, "Transpose", "Non-unit", &kb, &i__3,
  280. &c_b14, &b[k + k * b_dim1], ldb, &a[k + a_dim1],
  281. lda);
  282. _starpu_dsygs2_(itype, uplo, &kb, &a[k + k * a_dim1], lda, &b[k +
  283. k * b_dim1], ldb, info);
  284. /* L40: */
  285. }
  286. }
  287. }
  288. }
  289. return 0;
  290. /* End of DSYGST */
  291. } /* _starpu_dsygst_ */