UnaryTestsF64.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814
  1. #include "UnaryTestsF64.h"
  2. #include "Error.h"
  3. #define SNR_THRESHOLD 250
  4. /*
  5. Reference patterns are generated with
  6. a double precision computation.
  7. */
  8. #define REL_ERROR (1.0e-12)
  9. #define ABS_ERROR (1.0e-12)
  10. /*
  11. Comparisons for householder
  12. */
  13. #define SNR_HOUSEHOLDER_THRESHOLD 270
  14. #define REL_HOUSEHOLDER_ERROR (1.0e-13)
  15. #define ABS_HOUSEHOLDER_ERROR (1.0e-13)
  16. /*
  17. Comparison for QR decomposition
  18. */
  19. #define SNR_QR_THRESHOLD 270
  20. #define REL_QR_ERROR (1.0e-13)
  21. #define ABS_QR_ERROR (1.0e-13)
  22. /*
  23. Comparison for Cholesky
  24. */
  25. #define SNR_THRESHOLD_CHOL 269
  26. #define REL_ERROR_CHOL (1.0e-9)
  27. #define ABS_ERROR_CHOL (1.0e-9)
  28. /* LDLT comparison */
  29. #define REL_ERROR_LDLT (1e-5)
  30. #define ABS_ERROR_LDLT (1e-5)
  31. /* Upper bound of maximum matrix dimension used by Python */
  32. #define MAXMATRIXDIM 40
  33. #define LOADDATA2() \
  34. const float64_t *inp1=input1.ptr(); \
  35. const float64_t *inp2=input2.ptr(); \
  36. \
  37. float64_t *ap=a.ptr(); \
  38. float64_t *bp=b.ptr(); \
  39. \
  40. float64_t *outp=output.ptr(); \
  41. int16_t *dimsp = dims.ptr(); \
  42. int nbMatrixes = dims.nbSamples() >> 1;\
  43. int rows,columns; \
  44. int i;
  45. #define LOADDATA1() \
  46. const float64_t *inp1=input1.ptr(); \
  47. \
  48. float64_t *ap=a.ptr(); \
  49. \
  50. float64_t *outp=output.ptr(); \
  51. int16_t *dimsp = dims.ptr(); \
  52. int nbMatrixes = dims.nbSamples() >> 1;\
  53. int rows,columns; \
  54. int i;
  55. #define PREPAREDATA2() \
  56. in1.numRows=rows; \
  57. in1.numCols=columns; \
  58. memcpy((void*)ap,(const void*)inp1,sizeof(float64_t)*rows*columns);\
  59. in1.pData = ap; \
  60. \
  61. in2.numRows=rows; \
  62. in2.numCols=columns; \
  63. memcpy((void*)bp,(const void*)inp2,sizeof(float64_t)*rows*columns);\
  64. in2.pData = bp; \
  65. \
  66. out.numRows=rows; \
  67. out.numCols=columns; \
  68. out.pData = outp;
  69. #define PREPAREDATALT() \
  70. in1.numRows=rows; \
  71. in1.numCols=rows; \
  72. memcpy((void*)ap,(const void*)inp1,sizeof(float64_t)*rows*rows); \
  73. in1.pData = ap; \
  74. \
  75. in2.numRows=rows; \
  76. in2.numCols=columns; \
  77. memcpy((void*)bp,(const void*)inp2,sizeof(float64_t)*rows*columns);\
  78. in2.pData = bp; \
  79. \
  80. out.numRows=rows; \
  81. out.numCols=columns; \
  82. out.pData = outp;
  83. #define PREPAREDATA1(TRANSPOSED) \
  84. in1.numRows=rows; \
  85. in1.numCols=columns; \
  86. memcpy((void*)ap,(const void*)inp1,sizeof(float64_t)*rows*columns);\
  87. in1.pData = ap; \
  88. \
  89. if (TRANSPOSED) \
  90. { \
  91. out.numRows=columns; \
  92. out.numCols=rows; \
  93. } \
  94. else \
  95. { \
  96. out.numRows=rows; \
  97. out.numCols=columns; \
  98. } \
  99. out.pData = outp;
  100. #define PREPAREDATALL1() \
  101. in1.numRows=rows; \
  102. in1.numCols=columns; \
  103. memcpy((void*)ap,(const void*)inp1,sizeof(float64_t)*rows*columns);\
  104. in1.pData = ap; \
  105. \
  106. outll.numRows=rows; \
  107. outll.numCols=columns; \
  108. \
  109. outll.pData = outllp;
  110. #define SWAP_ROWS(A,i,j) \
  111. for(int w=0;w < n; w++) \
  112. { \
  113. float64_t tmp; \
  114. tmp = A[i*n + w]; \
  115. A[i*n + w] = A[j*n + w];\
  116. A[j*n + w] = tmp; \
  117. }
  118. static void checkInnerTailOverflow(float64_t *b)
  119. {
  120. ASSERT_TRUE(b[0] == 0);
  121. ASSERT_TRUE(b[1] == 0);
  122. }
  123. void UnaryTestsF64::test_mat_add_f64()
  124. {
  125. }
  126. void UnaryTestsF64::test_householder_f64()
  127. {
  128. int64_t vecDim;
  129. const int16_t *dimsp = dims.ptr();
  130. const int nbVectors = dims.nbSamples();
  131. const float64_t *inp1=input1.ptr();
  132. float64_t *outp=output.ptr();
  133. float64_t *outBetap=outputBeta.ptr();
  134. for(int i=0; i < nbVectors ; i++)
  135. {
  136. vecDim = *dimsp++;
  137. float64_t beta = arm_householder_f64(inp1,DEFAULT_HOUSEHOLDER_THRESHOLD_F64,vecDim,outp);
  138. *outBetap = beta;
  139. outp += vecDim;
  140. inp1 += vecDim;
  141. outBetap++;
  142. checkInnerTailOverflow(outp);
  143. checkInnerTailOverflow(outBetap);
  144. }
  145. ASSERT_EMPTY_TAIL(output);
  146. ASSERT_EMPTY_TAIL(outputBeta);
  147. ASSERT_SNR(output,ref,(float64_t)SNR_HOUSEHOLDER_THRESHOLD);
  148. ASSERT_SNR(outputBeta,refBeta,(float64_t)SNR_HOUSEHOLDER_THRESHOLD);
  149. ASSERT_CLOSE_ERROR(output,ref,ABS_HOUSEHOLDER_ERROR,REL_HOUSEHOLDER_ERROR);
  150. ASSERT_CLOSE_ERROR(outputBeta,refBeta,ABS_HOUSEHOLDER_ERROR,REL_HOUSEHOLDER_ERROR);
  151. }
  152. #include "dsp/debug.h"
  153. void UnaryTestsF64::test_mat_qr_f64()
  154. {
  155. int64_t rows, columns, rank;
  156. int nb;
  157. const int16_t *dimsp = dims.ptr();
  158. const int nbMatrixes = dims.nbSamples() / 3;
  159. const float64_t *inp1=input1.ptr();
  160. float64_t *outTaup=outputTau.ptr();
  161. float64_t *outRp=outputR.ptr();
  162. float64_t *outQp=outputQ.ptr();
  163. float64_t *pTmpA=a.ptr();
  164. float64_t *pTmpB=b.ptr();
  165. (void) outTaup;
  166. (void) outRp;
  167. (void) outQp;
  168. (void)nbMatrixes;
  169. (void)nb;
  170. (void)dimsp;
  171. (void)inp1;
  172. nb=0;
  173. for(int i=0; i < nbMatrixes ; i++)
  174. //for(int i=0; i < 1 ; i++)
  175. {
  176. rows = *dimsp++;
  177. columns = *dimsp++;
  178. rank = *dimsp++;
  179. (void)rank;
  180. //printf("--> %d %d : %lld %lld\n",nb,i,rows,columns);
  181. nb += rows * columns;
  182. in1.numRows=rows;
  183. in1.numCols=columns;
  184. in1.pData = (float64_t*)inp1;
  185. outR.numRows = rows;
  186. outR.numCols = columns;
  187. outR.pData = (float64_t*)outRp;
  188. outQ.numRows = rows;
  189. outQ.numCols = rows;
  190. outQ.pData = (float64_t*)outQp;
  191. arm_status status=arm_mat_qr_f64(&in1,DEFAULT_HOUSEHOLDER_THRESHOLD_F64,&outR,&outQ,outTaup,pTmpA,pTmpB);
  192. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  193. // Set Householder reflectors into R matrix to 0
  194. //float64_t *p = outRp ;
  195. //printf("%d %d %d\n",in1.numCols, outR.numRows,outR.numCols);
  196. #if 0
  197. for(int col=0 ; col < in1.numCols; col++)
  198. {
  199. float64_t *pa = p + outR.numCols;
  200. for(int k=0;k<outR.numRows-col-1; k++)
  201. {
  202. *pa = 0;
  203. pa += outR.numCols;
  204. }
  205. p += 1 + outR.numCols;
  206. }
  207. #endif
  208. //PM_f64("Corrected R",&outR);
  209. inp1 += rows * columns;
  210. outRp += rows * columns;
  211. outQp += rows * rows;
  212. outTaup += columns;
  213. checkInnerTailOverflow(outRp);
  214. checkInnerTailOverflow(outQp);
  215. checkInnerTailOverflow(outTaup);
  216. }
  217. ASSERT_EMPTY_TAIL(outputR);
  218. ASSERT_EMPTY_TAIL(outputQ);
  219. ASSERT_EMPTY_TAIL(outputTau);
  220. ASSERT_SNR(refQ,outputQ,(float64_t)SNR_QR_THRESHOLD);
  221. ASSERT_SNR(refR,outputR,(float64_t)SNR_QR_THRESHOLD);
  222. ASSERT_SNR(refTau,outputTau,(float64_t)SNR_QR_THRESHOLD);
  223. ASSERT_CLOSE_ERROR(refQ,outputQ,ABS_QR_ERROR,REL_QR_ERROR);
  224. ASSERT_CLOSE_ERROR(refR,outputR,ABS_QR_ERROR,REL_QR_ERROR);
  225. ASSERT_CLOSE_ERROR(refTau,outputTau,ABS_QR_ERROR,REL_QR_ERROR);
  226. }
  227. void UnaryTestsF64::test_mat_sub_f64()
  228. {
  229. LOADDATA2();
  230. arm_status status;
  231. for(i=0;i < nbMatrixes ; i ++)
  232. {
  233. rows = *dimsp++;
  234. columns = *dimsp++;
  235. PREPAREDATA2();
  236. status=arm_mat_sub_f64(&this->in1,&this->in2,&this->out);
  237. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  238. outp += (rows * columns);
  239. }
  240. ASSERT_EMPTY_TAIL(output);
  241. ASSERT_SNR(output,ref,(float64_t)SNR_THRESHOLD);
  242. ASSERT_CLOSE_ERROR(output,ref,ABS_ERROR,REL_ERROR);
  243. }
  244. void UnaryTestsF64::test_mat_scale_f64()
  245. {
  246. }
  247. void UnaryTestsF64::test_mat_trans_f64()
  248. {
  249. LOADDATA1();
  250. arm_status status;
  251. for(i=0;i < nbMatrixes ; i ++)
  252. {
  253. rows = *dimsp++;
  254. columns = *dimsp++;
  255. PREPAREDATA1(true);
  256. status=arm_mat_trans_f64(&this->in1,&this->out);
  257. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  258. outp += (rows * columns);
  259. }
  260. ASSERT_EMPTY_TAIL(output);
  261. ASSERT_SNR(output,ref,(float32_t)SNR_THRESHOLD);
  262. ASSERT_CLOSE_ERROR(output,ref,ABS_ERROR,REL_ERROR);
  263. }
  264. /*
  265. Test framework is only adding 16 bytes of free memory after the end of a buffer.
  266. So, we limit to 2 float64 for checking out of buffer write.
  267. */
  268. static void refInnerTail(float64_t *b)
  269. {
  270. b[0] = 1.0;
  271. b[1] = -2.0;
  272. }
  273. static void checkInnerTail(float64_t *b)
  274. {
  275. ASSERT_TRUE(b[0] == 1.0);
  276. ASSERT_TRUE(b[1] == -2.0);
  277. }
  278. void UnaryTestsF64::test_mat_inverse_f64()
  279. {
  280. const float64_t *inp1=input1.ptr();
  281. float64_t *ap=a.ptr();
  282. float64_t *outp=output.ptr();
  283. int16_t *dimsp = dims.ptr();
  284. int nbMatrixes = dims.nbSamples();
  285. int rows,columns;
  286. int i;
  287. arm_status status;
  288. for(i=0;i < nbMatrixes ; i ++)
  289. {
  290. rows = *dimsp++;
  291. columns = rows;
  292. PREPAREDATA1(false);
  293. refInnerTail(outp+(rows * columns));
  294. status=arm_mat_inverse_f64(&this->in1,&this->out);
  295. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  296. outp += (rows * columns);
  297. inp1 += (rows * columns);
  298. checkInnerTail(outp);
  299. }
  300. ASSERT_SNR(output,ref,(float64_t)SNR_THRESHOLD);
  301. ASSERT_CLOSE_ERROR(output,ref,ABS_ERROR,REL_ERROR);
  302. }
  303. void UnaryTestsF64::test_mat_cholesky_dpo_f64()
  304. {
  305. float64_t *ap=a.ptr();
  306. const float64_t *inp1=input1.ptr();
  307. float64_t *outp=output.ptr();
  308. int16_t *dimsp = dims.ptr();
  309. int nbMatrixes = dims.nbSamples();
  310. int rows,columns;
  311. int i;
  312. arm_status status;
  313. for(i=0;i < nbMatrixes ; i ++)
  314. {
  315. rows = *dimsp++;
  316. columns = rows;
  317. PREPAREDATA1(false);
  318. status=arm_mat_cholesky_f64(&this->in1,&this->out);
  319. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  320. outp += (rows * columns);
  321. inp1 += (rows * columns);
  322. }
  323. ASSERT_EMPTY_TAIL(output);
  324. ASSERT_SNR(output,ref,(float64_t)SNR_THRESHOLD_CHOL);
  325. ASSERT_CLOSE_ERROR(ref,output,ABS_ERROR_CHOL,REL_ERROR_CHOL);
  326. }
  327. void UnaryTestsF64::test_solve_upper_triangular_f64()
  328. {
  329. float64_t *ap=a.ptr();
  330. const float64_t *inp1=input1.ptr();
  331. float64_t *bp=b.ptr();
  332. const float64_t *inp2=input2.ptr();
  333. float64_t *outp=output.ptr();
  334. int16_t *dimsp = dims.ptr();
  335. int nbMatrixes = dims.nbSamples()>>1;
  336. int rows,columns;
  337. int i;
  338. arm_status status;
  339. for(i=0;i < nbMatrixes ; i ++)
  340. {
  341. rows = *dimsp++;
  342. columns = *dimsp++;
  343. PREPAREDATALT();
  344. status=arm_mat_solve_upper_triangular_f64(&this->in1,&this->in2,&this->out);
  345. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  346. outp += (rows * columns);
  347. inp1 += (rows * rows);
  348. inp2 += (rows * columns);
  349. }
  350. ASSERT_EMPTY_TAIL(output);
  351. ASSERT_SNR(output,ref,(float64_t)SNR_THRESHOLD);
  352. ASSERT_CLOSE_ERROR(ref,output,ABS_ERROR,REL_ERROR);
  353. }
  354. void UnaryTestsF64::test_solve_lower_triangular_f64()
  355. {
  356. float64_t *ap=a.ptr();
  357. const float64_t *inp1=input1.ptr();
  358. float64_t *bp=b.ptr();
  359. const float64_t *inp2=input2.ptr();
  360. float64_t *outp=output.ptr();
  361. int16_t *dimsp = dims.ptr();
  362. int nbMatrixes = dims.nbSamples()>>1;
  363. int rows,columns;
  364. int i;
  365. arm_status status;
  366. for(i=0;i < nbMatrixes ; i ++)
  367. {
  368. rows = *dimsp++;
  369. columns = *dimsp++;
  370. PREPAREDATALT();
  371. status=arm_mat_solve_lower_triangular_f64(&this->in1,&this->in2,&this->out);
  372. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  373. outp += (rows * columns);
  374. inp1 += (rows * rows);
  375. inp2 += (rows * columns);
  376. }
  377. ASSERT_EMPTY_TAIL(output);
  378. ASSERT_SNR(output,ref,(float64_t)SNR_THRESHOLD);
  379. ASSERT_CLOSE_ERROR(ref,output,ABS_ERROR,REL_ERROR);
  380. }
  381. static void trans_f64(const float64_t *src, float64_t *dst, int n)
  382. {
  383. for(int r=0; r<n ; r++)
  384. {
  385. for(int c=0; c<n ; c++)
  386. {
  387. dst[c*n+r] = src[r*n+c];
  388. }
  389. }
  390. }
  391. static void mult_f64_f64(const float64_t *srcA, const float64_t *srcB, float64_t *dst,int n)
  392. {
  393. for(int r=0; r<n ; r++)
  394. {
  395. for(int c=0; c<n ; c++)
  396. {
  397. float64_t sum=0.0;
  398. for(int k=0; k < n ; k++)
  399. {
  400. sum += srcA[r*n+k] * srcB[k*n+c];
  401. }
  402. dst[r*n+c] = sum;
  403. }
  404. }
  405. }
  406. void UnaryTestsF64::compute_ldlt_error(const int n,const int16_t *outpp)
  407. {
  408. float64_t *tmpa = tmpapat.ptr() ;
  409. float64_t *tmpb = tmpbpat.ptr() ;
  410. float64_t *tmpc = tmpcpat.ptr() ;
  411. /* Compute P A P^t */
  412. // Create identiy matrix
  413. for(int r=0; r < n; r++)
  414. {
  415. for(int c=0; c < n; c++)
  416. {
  417. if (r == c)
  418. {
  419. tmpa[r*n+c] = 1.0;
  420. }
  421. else
  422. {
  423. tmpa[r*n+c] = 0.0;
  424. }
  425. }
  426. }
  427. // Create permutation matrix
  428. for(int r=0;r < n; r++)
  429. {
  430. SWAP_ROWS(tmpa,r,outpp[r]);
  431. }
  432. trans_f64((const float64_t*)tmpa,tmpb,n);
  433. mult_f64_f64((const float64_t*)this->in1.pData,(const float64_t*)tmpb,tmpc,n);
  434. mult_f64_f64((const float64_t*)tmpa,(const float64_t*)tmpc,outa,n);
  435. /* Compute L D L^t */
  436. trans_f64((const float64_t*)this->outll.pData,tmpc,n);
  437. mult_f64_f64((const float64_t*)this->outd.pData,(const float64_t*)tmpc,tmpa,n);
  438. mult_f64_f64((const float64_t*)this->outll.pData,(const float64_t*)tmpa,outb,n);
  439. }
  440. void UnaryTestsF64::test_mat_ldl_f64()
  441. {
  442. float64_t *ap=a.ptr();
  443. const float64_t *inp1=input1.ptr();
  444. float64_t *outllp=outputll.ptr();
  445. float64_t *outdp=outputd.ptr();
  446. int16_t *outpp=outputp.ptr();
  447. outa=outputa.ptr();
  448. outb=outputb.ptr();
  449. int16_t *dimsp = dims.ptr();
  450. int nbMatrixes = dims.nbSamples();
  451. int rows,columns;
  452. int i;
  453. arm_status status;
  454. for(i=0;i < nbMatrixes ; i ++)
  455. {
  456. rows = *dimsp++;
  457. columns = rows;
  458. PREPAREDATALL1();
  459. outd.numRows=rows;
  460. outd.numCols=columns;
  461. outd.pData=outdp;
  462. memset(outpp,0,rows*sizeof(uint16_t));
  463. memset(outdp,0,columns*rows*sizeof(float64_t));
  464. status=arm_mat_ldlt_f64(&this->in1,&this->outll,&this->outd,(uint16_t*)outpp);
  465. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  466. compute_ldlt_error(rows,outpp);
  467. outllp += (rows * columns);
  468. outdp += (rows * columns);
  469. outpp += rows;
  470. outa += (rows * columns);
  471. outb +=(rows * columns);
  472. inp1 += (rows * columns);
  473. }
  474. ASSERT_EMPTY_TAIL(outputll);
  475. ASSERT_EMPTY_TAIL(outputd);
  476. ASSERT_EMPTY_TAIL(outputp);
  477. ASSERT_EMPTY_TAIL(outputa);
  478. ASSERT_EMPTY_TAIL(outputb);
  479. ASSERT_CLOSE_ERROR(outputa,outputb,ABS_ERROR_LDLT,REL_ERROR_LDLT);
  480. }
  481. void UnaryTestsF64::setUp(Testing::testID_t id,std::vector<Testing::param_t>& params,Client::PatternMgr *mgr)
  482. {
  483. (void)params;
  484. switch(id)
  485. {
  486. case TEST_MAT_SUB_F64_2:
  487. input1.reload(UnaryTestsF64::INPUTS1_F64_ID,mgr);
  488. input2.reload(UnaryTestsF64::INPUTS2_F64_ID,mgr);
  489. dims.reload(UnaryTestsF64::DIMSUNARY1_S16_ID,mgr);
  490. ref.reload(UnaryTestsF64::REFSUB1_F64_ID,mgr);
  491. output.create(ref.nbSamples(),UnaryTestsF64::OUT_F64_ID,mgr);
  492. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  493. b.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPB_F64_ID,mgr);
  494. break;
  495. case TEST_MAT_TRANS_F64_4:
  496. input1.reload(UnaryTestsF64::INPUTS1_F64_ID,mgr);
  497. dims.reload(UnaryTestsF64::DIMSUNARY1_S16_ID,mgr);
  498. ref.reload(UnaryTestsF64::REFTRANS1_F64_ID,mgr);
  499. output.create(ref.nbSamples(),UnaryTestsF64::OUT_F64_ID,mgr);
  500. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  501. break;
  502. case TEST_MAT_INVERSE_F64_5:
  503. input1.reload(UnaryTestsF64::INPUTSINV_F64_ID,mgr);
  504. dims.reload(UnaryTestsF64::DIMSINVERT1_S16_ID,mgr);
  505. ref.reload(UnaryTestsF64::REFINV1_F64_ID,mgr);
  506. output.create(ref.nbSamples(),UnaryTestsF64::OUT_F64_ID,mgr);
  507. a.create(ref.nbSamples(),UnaryTestsF64::TMPA_F64_ID,mgr);
  508. break;
  509. case TEST_MAT_CHOLESKY_DPO_F64_6:
  510. input1.reload(UnaryTestsF64::INPUTSCHOLESKY1_DPO_F64_ID,mgr);
  511. dims.reload(UnaryTestsF64::DIMSCHOLESKY1_DPO_S16_ID,mgr);
  512. ref.reload(UnaryTestsF64::REFCHOLESKY1_DPO_F64_ID,mgr);
  513. output.create(ref.nbSamples(),UnaryTestsF64::OUT_F64_ID,mgr);
  514. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  515. break;
  516. case TEST_SOLVE_UPPER_TRIANGULAR_F64_7:
  517. input1.reload(UnaryTestsF64::INPUT_MAT_UTSOLVE_F64_ID,mgr);
  518. input2.reload(UnaryTestsF64::INPUT_VEC_LTSOLVE_F64_ID,mgr);
  519. dims.reload(UnaryTestsF64::DIM_LTSOLVE_F64_ID,mgr);
  520. ref.reload(UnaryTestsF64::REF_UT_SOLVE_F64_ID,mgr);
  521. output.create(ref.nbSamples(),UnaryTestsF64::OUT_F64_ID,mgr);
  522. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  523. b.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPB_F64_ID,mgr);
  524. break;
  525. case TEST_SOLVE_LOWER_TRIANGULAR_F64_8:
  526. input1.reload(UnaryTestsF64::INPUT_MAT_LTSOLVE_F64_ID,mgr);
  527. input2.reload(UnaryTestsF64::INPUT_VEC_LTSOLVE_F64_ID,mgr);
  528. dims.reload(UnaryTestsF64::DIM_LTSOLVE_F64_ID,mgr);
  529. ref.reload(UnaryTestsF64::REF_LT_SOLVE_F64_ID,mgr);
  530. output.create(ref.nbSamples(),UnaryTestsF64::OUT_F64_ID,mgr);
  531. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  532. b.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPB_F64_ID,mgr);
  533. break;
  534. case TEST_MAT_LDL_F64_9:
  535. // Definite positive test
  536. input1.reload(UnaryTestsF64::INPUTSCHOLESKY1_DPO_F64_ID,mgr);
  537. dims.reload(UnaryTestsF64::DIMSCHOLESKY1_DPO_S16_ID,mgr);
  538. outputll.create(input1.nbSamples(),UnaryTestsF64::LL_F64_ID,mgr);
  539. outputd.create(input1.nbSamples(),UnaryTestsF64::D_F64_ID,mgr);
  540. outputp.create(input1.nbSamples(),UnaryTestsF64::PERM_S16_ID,mgr);
  541. outputa.create(input1.nbSamples(),UnaryTestsF64::OUTA_F64_ID,mgr);
  542. outputb.create(input1.nbSamples(),UnaryTestsF64::OUTA_F64_ID,mgr);
  543. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  544. tmpapat.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPDB_F64_ID,mgr);
  545. tmpbpat.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPDC_F64_ID,mgr);
  546. tmpcpat.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPDD_F64_ID,mgr);
  547. break;
  548. case TEST_MAT_LDL_F64_10:
  549. // Semi definite positive test
  550. input1.reload(UnaryTestsF64::INPUTSCHOLESKY1_SDPO_F64_ID,mgr);
  551. dims.reload(UnaryTestsF64::DIMSCHOLESKY1_SDPO_S16_ID,mgr);
  552. outputll.create(input1.nbSamples(),UnaryTestsF64::LL_F64_ID,mgr);
  553. outputd.create(input1.nbSamples(),UnaryTestsF64::D_F64_ID,mgr);
  554. outputp.create(input1.nbSamples(),UnaryTestsF64::PERM_S16_ID,mgr);
  555. outputa.create(input1.nbSamples(),UnaryTestsF64::OUTA_F64_ID,mgr);
  556. outputb.create(input1.nbSamples(),UnaryTestsF64::OUTA_F64_ID,mgr);
  557. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPA_F64_ID,mgr);
  558. tmpapat.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPDB_F64_ID,mgr);
  559. tmpbpat.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPDC_F64_ID,mgr);
  560. tmpcpat.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsF64::TMPDD_F64_ID,mgr);
  561. break;
  562. case TEST_HOUSEHOLDER_F64_11:
  563. input1.reload(UnaryTestsF64::INPUTS_HOUSEHOLDER_F64_ID,mgr);
  564. dims.reload(UnaryTestsF64::DIMS_HOUSEHOLDER_S16_ID,mgr);
  565. ref.reload(UnaryTestsF64::REF_HOUSEHOLDER_V_F64_ID,mgr);
  566. refBeta.reload(UnaryTestsF64::REF_HOUSEHOLDER_BETA_F64_ID,mgr);
  567. output.create(ref.nbSamples(),UnaryTestsF64::TMPA_F64_ID,mgr);
  568. outputBeta.create(refBeta.nbSamples(),UnaryTestsF64::TMPB_F64_ID,mgr);
  569. break;
  570. case TEST_MAT_QR_F64_12:
  571. input1.reload(UnaryTestsF64::INPUTS_QR_F64_ID,mgr);
  572. dims.reload(UnaryTestsF64::DIMS_QR_S16_ID,mgr);
  573. refTau.reload(UnaryTestsF64::REF_QR_TAU_F64_ID,mgr);
  574. refR.reload(UnaryTestsF64::REF_QR_R_F64_ID,mgr);
  575. refQ.reload(UnaryTestsF64::REF_QR_Q_F64_ID,mgr);
  576. outputTau.create(refTau.nbSamples(),UnaryTestsF64::TMPA_F64_ID,mgr);
  577. outputR.create(refR.nbSamples(),UnaryTestsF64::TMPB_F64_ID,mgr);
  578. outputQ.create(refQ.nbSamples(),UnaryTestsF64::TMPC_F64_ID,mgr);
  579. a.create(47,UnaryTestsF64::TMPC_F64_ID,mgr);
  580. b.create(47,UnaryTestsF64::TMPD_F64_ID,mgr);
  581. break;
  582. }
  583. }
  584. void UnaryTestsF64::tearDown(Testing::testID_t id,Client::PatternMgr *mgr)
  585. {
  586. (void)id;
  587. //output.dump(mgr);
  588. (void)mgr;
  589. }