gsl_cblas__source_symm_r.h 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  1. /* blas/source_symm_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. INDEX n1, n2;
  22. int uplo, side;
  23. if (alpha == 0.0 && beta == 1.0)
  24. return;
  25. if (Order == CblasRowMajor) {
  26. n1 = M;
  27. n2 = N;
  28. uplo = Uplo;
  29. side = Side;
  30. } else {
  31. n1 = N;
  32. n2 = M;
  33. uplo = (Uplo == CblasUpper) ? CblasLower : CblasUpper;
  34. side = (Side == CblasLeft) ? CblasRight : CblasLeft;
  35. }
  36. /* form y := beta*y */
  37. if (beta == 0.0) {
  38. for (i = 0; i < n1; i++) {
  39. for (j = 0; j < n2; j++) {
  40. C[ldc * i + j] = 0.0;
  41. }
  42. }
  43. } else if (beta != 1.0) {
  44. for (i = 0; i < n1; i++) {
  45. for (j = 0; j < n2; j++) {
  46. C[ldc * i + j] *= beta;
  47. }
  48. }
  49. }
  50. if (alpha == 0.0)
  51. return;
  52. if (side == CblasLeft && uplo == CblasUpper) {
  53. /* form C := alpha*A*B + C */
  54. for (i = 0; i < n1; i++) {
  55. for (j = 0; j < n2; j++) {
  56. const BASE temp1 = alpha * B[ldb * i + j];
  57. BASE temp2 = 0.0;
  58. C[i * ldc + j] += temp1 * A[i * lda + i];
  59. for (k = i + 1; k < n1; k++) {
  60. const BASE Aik = A[i * lda + k];
  61. C[k * ldc + j] += Aik * temp1;
  62. temp2 += Aik * B[ldb * k + j];
  63. }
  64. C[i * ldc + j] += alpha * temp2;
  65. }
  66. }
  67. } else if (side == CblasLeft && uplo == CblasLower) {
  68. /* form C := alpha*A*B + C */
  69. for (i = 0; i < n1; i++) {
  70. for (j = 0; j < n2; j++) {
  71. const BASE temp1 = alpha * B[ldb * i + j];
  72. BASE temp2 = 0.0;
  73. for (k = 0; k < i; k++) {
  74. const BASE Aik = A[i * lda + k];
  75. C[k * ldc + j] += Aik * temp1;
  76. temp2 += Aik * B[ldb * k + j];
  77. }
  78. C[i * ldc + j] += temp1 * A[i * lda + i] + alpha * temp2;
  79. }
  80. }
  81. } else if (side == CblasRight && uplo == CblasUpper) {
  82. /* form C := alpha*B*A + C */
  83. for (i = 0; i < n1; i++) {
  84. for (j = 0; j < n2; j++) {
  85. const BASE temp1 = alpha * B[ldb * i + j];
  86. BASE temp2 = 0.0;
  87. C[i * ldc + j] += temp1 * A[j * lda + j];
  88. for (k = j + 1; k < n2; k++) {
  89. const BASE Ajk = A[j * lda + k];
  90. C[i * ldc + k] += temp1 * Ajk;
  91. temp2 += B[ldb * i + k] * Ajk;
  92. }
  93. C[i * ldc + j] += alpha * temp2;
  94. }
  95. }
  96. } else if (side == CblasRight && uplo == CblasLower) {
  97. /* form C := alpha*B*A + C */
  98. for (i = 0; i < n1; i++) {
  99. for (j = 0; j < n2; j++) {
  100. const BASE temp1 = alpha * B[ldb * i + j];
  101. BASE temp2 = 0.0;
  102. for (k = 0; k < j; k++) {
  103. const BASE Ajk = A[j * lda + k];
  104. C[i * ldc + k] += temp1 * Ajk;
  105. temp2 += B[ldb * i + k] * Ajk;
  106. }
  107. C[i * ldc + j] += temp1 * A[j * lda + j] + alpha * temp2;
  108. }
  109. }
  110. } else {
  111. BLAS_ERROR("unrecognized operation");
  112. }
  113. }