test_blas2.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  1. /*****************************************************************************
  2. *
  3. * MODULE: Grass PDE Numerical Library
  4. * AUTHOR(S): Soeren Gebbert, Berlin (GER) Dec 2006
  5. * soerengebbert <at> gmx <dot> de
  6. *
  7. * PURPOSE: Unit tests for les creation
  8. *
  9. * COPYRIGHT: (C) 2000 by the GRASS Development Team
  10. *
  11. * This program is free software under the GNU General Public
  12. * License (>=v2). Read the file COPYING that comes with GRASS
  13. * for details.
  14. *
  15. *****************************************************************************/
  16. #include <grass/gis.h>
  17. #include <grass/glocale.h>
  18. #include <grass/gmath.h>
  19. #include <math.h>
  20. #include "test_gmath_lib.h"
  21. #define EPSILON 0.00001
  22. /* prototypes */
  23. static int test_blas_level_2_double(void);
  24. static int test_blas_level_2_float(void);
  25. /* *************************************************************** */
  26. /* Perfrome the blas level 2 unit tests ************************** */
  27. /* *************************************************************** */
  28. int unit_test_blas_level_2(void)
  29. {
  30. int sum = 0;
  31. G_message(_("\n++ Running blas level 2 unit tests ++"));
  32. sum += test_blas_level_2_double();
  33. sum += test_blas_level_2_float();
  34. if (sum > 0)
  35. G_warning(_("\n-- blas level 2 unit tests failure --"));
  36. else
  37. G_message(_("\n-- blas level 2 unit tests finished successfully --"));
  38. return sum;
  39. }
  40. /* *************************************************************** */
  41. /* ************** D O U B L E ************************************ */
  42. /* *************************************************************** */
  43. int test_blas_level_2_double(void)
  44. {
  45. int sum = 0;
  46. int rows = TEST_NUM_ROWS;
  47. double **A, **B, **C, *x, *y, *z, a = 0.0, b = 0.0, c = 0.0, d = 0.0, e = 0.0, f = 0.0, g = 0.0, h = 0.0, i = 0.0, j =0.0;
  48. G_math_les *les;
  49. les = create_normal_unsymmetric_les(rows);
  50. G_math_les *sples;
  51. sples = create_sparse_symmetric_les(rows);
  52. G_math_les *bles;
  53. bles = create_symmetric_band_les(rows);
  54. x = G_alloc_vector(rows);
  55. y = G_alloc_vector(rows);
  56. z = G_alloc_vector(rows);
  57. A = G_alloc_matrix(rows, rows);
  58. B = G_alloc_matrix(rows, rows);
  59. C = G_alloc_matrix(rows, rows);
  60. fill_d_vector_scalar(x, 1, rows);
  61. fill_d_vector_scalar(y, 0, rows);
  62. #pragma omp parallel default(shared)
  63. {
  64. G_math_Ax_sparse(sples->Asp, x, sples->b, rows);
  65. }
  66. G_math_d_asum_norm(sples->b, &a, rows);
  67. #pragma omp parallel default(shared)
  68. {
  69. G_math_Ax_sband(bles->A, x, bles->b, rows, rows);
  70. }
  71. G_math_d_asum_norm(bles->b, &j, rows);
  72. #pragma omp parallel default(shared)
  73. {
  74. G_math_d_Ax(les->A, x, z, rows, rows);
  75. }
  76. G_math_d_asum_norm(z, &b, rows);
  77. #pragma omp parallel default(shared)
  78. {
  79. G_math_d_aAx_by(les->A, x, y, 1.0, 1.0, z, rows, rows);
  80. }
  81. G_math_d_asum_norm(z, &c, rows);
  82. #pragma omp parallel default(shared)
  83. {
  84. G_math_d_aAx_by(les->A, x, y, -1.0, 1.0, z, rows, rows);
  85. }
  86. G_math_d_asum_norm(z, &d, rows);
  87. #pragma omp parallel default(shared)
  88. {
  89. G_math_d_aAx_by(les->A, x, y, 1.0, 0.0, z, rows, rows);
  90. }
  91. G_math_d_asum_norm(z, &e, rows);
  92. #pragma omp parallel default(shared)
  93. {
  94. G_math_d_aAx_by(les->A, x, y, -1.0, -1.0, z, rows, rows);
  95. }
  96. G_math_d_asum_norm(z, &f, rows);
  97. #pragma omp parallel default(shared)
  98. {
  99. G_math_d_x_dyad_y(x, x, A, rows, rows);
  100. G_math_d_Ax(A, x, z, rows, rows);
  101. }
  102. G_math_d_asum_norm(z, &g, rows);
  103. #pragma omp parallel default(shared)
  104. {
  105. G_math_d_x_dyad_y(x, x, C, rows, rows);
  106. G_math_d_Ax(A, x, z, rows, rows);
  107. }
  108. G_math_d_asum_norm(z, &h, rows);
  109. G_math_d_asum_norm(les->b, &i, rows);
  110. if(a - i > EPSILON) {
  111. G_message("Error in G_math_Ax_sparse: %f != %f", i, a);
  112. sum++;
  113. }
  114. if(j - i > EPSILON) {
  115. G_message("Error in G_math_Ax_sband: %f != %f", i, j);
  116. sum++;
  117. }
  118. if(b - i > EPSILON) {
  119. G_message("Error in G_math_d_Ax: %f != %f", i, b);
  120. sum++;
  121. }
  122. if(c - i > EPSILON) {
  123. G_message("Error in G_math_aAx_by: %f != %f", i, c);
  124. sum++;
  125. }
  126. if(d - i > EPSILON) {
  127. G_message("Error in G_math_aAx_by: %f != %f", i, d);
  128. sum++;
  129. }
  130. if(e - i > EPSILON) {
  131. G_message("Error in G_math_aAx_by: %f != %f", i, e);
  132. sum++;
  133. }
  134. if(f - i > EPSILON) {
  135. G_message("Error in G_math_aAx_by: %f != %f", i, f);
  136. sum++;
  137. }
  138. if(g - (double)rows*rows > EPSILON) {
  139. G_message("Error in G_math_d_x_dyad_y: %f != %f", (double)rows*rows, g);
  140. sum++;
  141. }
  142. if(h - (double)rows*rows > EPSILON) {
  143. G_message("Error in G_math_d_x_dyad_y: %f != %f", (double)rows*rows, h);
  144. sum++;
  145. }
  146. if(x)
  147. G_free_vector(x);
  148. if(y)
  149. G_free_vector(y);
  150. if(z)
  151. G_free_vector(z);
  152. G_math_free_les(les);
  153. G_math_free_les(bles);
  154. G_math_free_les(sples);
  155. if(A)
  156. G_free_matrix(A);
  157. if(B)
  158. G_free_matrix(B);
  159. if(C)
  160. G_free_matrix(C);
  161. return sum;
  162. }
  163. /* *************************************************************** */
  164. /* ************** F L O A T ************************************** */
  165. /* *************************************************************** */
  166. int test_blas_level_2_float(void)
  167. {
  168. int sum = 0;
  169. int rows =TEST_NUM_ROWS;
  170. float **A, **B, **C, *x, *y, *z, b = 0.0, c = 0.0, d = 0.0, e = 0.0, f = 0.0, g = 0.0, h = 0.0, i = 0.0;
  171. G_math_f_les *les;
  172. les = create_normal_unsymmetric_f_les(rows);
  173. x = G_alloc_fvector(rows);
  174. y = G_alloc_fvector(rows);
  175. z = G_alloc_fvector(rows);
  176. A = G_alloc_fmatrix(rows, rows);
  177. B = G_alloc_fmatrix(rows, rows);
  178. C = G_alloc_fmatrix(rows, rows);
  179. fill_f_vector_scalar(x, 1, rows);
  180. fill_f_vector_scalar(y, 0, rows);
  181. #pragma omp parallel default(shared)
  182. {
  183. G_math_f_Ax(les->A, x, z, rows, rows);
  184. }
  185. G_math_f_asum_norm(z, &b, rows);
  186. #pragma omp parallel default(shared)
  187. {
  188. G_math_f_aAx_by(les->A, x, y, 1.0, 1.0, z, rows, rows);
  189. }
  190. G_math_f_asum_norm(z, &c, rows);
  191. #pragma omp parallel default(shared)
  192. {
  193. G_math_f_aAx_by(les->A, x, y, -1.0, 1.0, z, rows, rows);
  194. }
  195. G_math_f_asum_norm(z, &d, rows);
  196. #pragma omp parallel default(shared)
  197. {
  198. G_math_f_aAx_by(les->A, x, y, 1.0, 0.0, z, rows, rows);
  199. }
  200. G_math_f_asum_norm(z, &e, rows);
  201. #pragma omp parallel default(shared)
  202. {
  203. G_math_f_aAx_by(les->A, x, y, -1.0, -1.0, z, rows, rows);
  204. }
  205. G_math_f_asum_norm(z, &f, rows);
  206. #pragma omp parallel default(shared)
  207. {
  208. G_math_f_x_dyad_y(x, x, A, rows, rows);
  209. G_math_f_Ax(A, x, z, rows, rows);
  210. }
  211. G_math_f_asum_norm(z, &g, rows);
  212. #pragma omp parallel default(shared)
  213. {
  214. G_math_f_x_dyad_y(x, x, C, rows, rows);
  215. G_math_f_Ax(A, x, z, rows, rows);
  216. }
  217. G_math_f_asum_norm(z, &h, rows);
  218. G_math_f_asum_norm(les->b, &i, rows);
  219. if(b - i > EPSILON) {
  220. G_message("Error in G_math_f_Ax: %f != %f", i, b);
  221. sum++;
  222. }
  223. if(c - i > EPSILON) {
  224. G_message("Error in G_math_f_aAx_by: %f != %f", i, c);
  225. sum++;
  226. }
  227. if(d - i > EPSILON) {
  228. G_message("Error in G_math_f_aAx_by: %f != %f", i, d);
  229. sum++;
  230. }
  231. if(e - i > EPSILON) {
  232. G_message("Error in G_math_f_aAx_by: %f != %f", i, e);
  233. sum++;
  234. }
  235. if(f - i > EPSILON) {
  236. G_message("Error in G_math_f_aAx_by: %f != %f", i, f);
  237. sum++;
  238. }
  239. if(g - (float)rows*rows > EPSILON) {
  240. G_message("Error in G_math_f_x_dyad_y: %f != %f", (float)rows*rows, g);
  241. sum++;
  242. }
  243. if(h - (float)rows*rows > EPSILON) {
  244. G_message("Error in G_math_f_x_dyad_y: %f != %f", (float)rows*rows, h);
  245. sum++;
  246. }
  247. if(x)
  248. G_free_fvector(x);
  249. if(y)
  250. G_free_fvector(y);
  251. if(z)
  252. G_free_fvector(z);
  253. G_math_free_f_les(les);
  254. if(A)
  255. G_free_fmatrix(A);
  256. if(B)
  257. G_free_fmatrix(B);
  258. if(C)
  259. G_free_fmatrix(C);
  260. return sum;
  261. }