gsl_cblas__source_syr2k_r.h 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. /* blas/source_syr2k_r.h
  2. *
  3. * Copyright (C) 2001, 2007 Brian Gough
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 3 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  18. */
  19. {
  20. INDEX i, j, k;
  21. int uplo, trans;
  22. if (alpha == 0.0 && beta == 1.0)
  23. return;
  24. if (Order == CblasRowMajor) {
  25. uplo = Uplo;
  26. trans = (Trans == CblasConjTrans) ? CblasTrans : Trans;
  27. } else {
  28. uplo = (Uplo == CblasUpper) ? CblasLower : CblasUpper;
  29. if (Trans == CblasTrans || Trans == CblasConjTrans) {
  30. trans = CblasNoTrans;
  31. } else {
  32. trans = CblasTrans;
  33. }
  34. }
  35. /* form C := beta*C */
  36. if (beta == 0.0) {
  37. if (uplo == CblasUpper) {
  38. for (i = 0; i < N; i++) {
  39. for (j = i; j < N; j++) {
  40. C[ldc * i + j] = 0.0;
  41. }
  42. }
  43. } else {
  44. for (i = 0; i < N; i++) {
  45. for (j = 0; j <= i; j++) {
  46. C[ldc * i + j] = 0.0;
  47. }
  48. }
  49. }
  50. } else if (beta != 1.0) {
  51. if (uplo == CblasUpper) {
  52. for (i = 0; i < N; i++) {
  53. for (j = i; j < N; j++) {
  54. C[ldc * i + j] *= beta;
  55. }
  56. }
  57. } else {
  58. for (i = 0; i < N; i++) {
  59. for (j = 0; j <= i; j++) {
  60. C[ldc * i + j] *= beta;
  61. }
  62. }
  63. }
  64. }
  65. if (alpha == 0.0)
  66. return;
  67. if (uplo == CblasUpper && trans == CblasNoTrans) {
  68. for (i = 0; i < N; i++) {
  69. for (j = i; j < N; j++) {
  70. BASE temp = 0.0;
  71. for (k = 0; k < K; k++) {
  72. temp += (A[i * lda + k] * B[j * ldb + k]
  73. + B[i * ldb + k] * A[j * lda + k]);
  74. }
  75. C[i * ldc + j] += alpha * temp;
  76. }
  77. }
  78. } else if (uplo == CblasUpper && trans == CblasTrans) {
  79. for (k = 0; k < K; k++) {
  80. for (i = 0; i < N; i++) {
  81. BASE temp1 = alpha * A[k * lda + i];
  82. BASE temp2 = alpha * B[k * ldb + i];
  83. for (j = i; j < N; j++) {
  84. C[i * lda + j] += temp1 * B[k * ldb + j] + temp2 * A[k * lda + j];
  85. }
  86. }
  87. }
  88. } else if (uplo == CblasLower && trans == CblasNoTrans) {
  89. for (i = 0; i < N; i++) {
  90. for (j = 0; j <= i; j++) {
  91. BASE temp = 0.0;
  92. for (k = 0; k < K; k++) {
  93. temp += (A[i * lda + k] * B[j * ldb + k]
  94. + B[i * ldb + k] * A[j * lda + k]);
  95. }
  96. C[i * ldc + j] += alpha * temp;
  97. }
  98. }
  99. } else if (uplo == CblasLower && trans == CblasTrans) {
  100. for (k = 0; k < K; k++) {
  101. for (i = 0; i < N; i++) {
  102. BASE temp1 = alpha * A[k * lda + i];
  103. BASE temp2 = alpha * B[k * ldb + i];
  104. for (j = 0; j <= i; j++) {
  105. C[i * lda + j] += temp1 * B[k * ldb + j] + temp2 * A[k * lda + j];
  106. }
  107. }
  108. }
  109. } else {
  110. BLAS_ERROR("unrecognized operation");
  111. }
  112. }