From 0e2ba2a13011c6c8d38e69b9698ef51d4c78ff1c Mon Sep 17 00:00:00 2001 From: Antoine ELIAS Date: Thu, 25 Apr 2013 15:42:27 +0200 Subject: [PATCH] add ";" in pcg_list test Change-Id: Id810c0e60b417ec2d515bb84df0548df2d96dac9 --- .../sparse/tests/unit_tests/pcg_list.dia.ref | 38 ++------------------ .../modules/sparse/tests/unit_tests/pcg_list.tst | 2 +- 2 files changed, 3 insertions(+), 37 deletions(-) diff --git a/scilab/modules/sparse/tests/unit_tests/pcg_list.dia.ref b/scilab/modules/sparse/tests/unit_tests/pcg_list.dia.ref index bb68026..72eba12 100644 --- a/scilab/modules/sparse/tests/unit_tests/pcg_list.dia.ref +++ b/scilab/modules/sparse/tests/unit_tests/pcg_list.dia.ref @@ -4,6 +4,7 @@ // // This file is distributed under the same license as the Scilab package. // ============================================================================= +// <-- CLI SHELL MODE --> // Numerical tests // Case where A is given as a function computing the right-hand side mymatrix=[ 94 0 0 0 0 28 0 0 32 0 @@ -30,42 +31,7 @@ function y=Atimesx(x,mymatrix) y=mymatrix*x endfunction // With the default 10 iterations, the algorithm performs well -Alist = list(Atimesx,mymatrix) - Alist = - - - Alist(1) - -[y]=function(x,mymatrix) - - Alist(2) - - - column 1 to 9 - - 94. 0. 0. 0. 0. 28. 0. 0. 32. - 0. 59. 13. 5. 0. 0. 0. 10. 0. - 0. 13. 72. 34. 2. 0. 0. 0. 0. - 0. 5. 34. 114. 0. 0. 0. 0. 0. - 0. 0. 2. 0. 70. 0. 28. 32. 12. - 28. 0. 0. 0. 0. 87. 20. 0. 33. - 0. 0. 0. 0. 28. 20. 71. 39. 0. - 0. 10. 0. 0. 32. 0. 39. 46. 8. - 32. 0. 0. 0. 12. 33. 0. 8. 82. - 0. 0. 65. 55. 0. 0. 0. 0. 11. - - column 10 - - 0. - 0. - 65. - 55. - 0. - 0. - 0. - 0. - 11. - 100. +Alist = list(Atimesx,mymatrix); [xcomputed, fail, err, iter, res]=pcg(Alist,b); xexpected=ones(10,1); if norm(xcomputed-xexpected)>10**3*%eps then bugmes();quit;end diff --git a/scilab/modules/sparse/tests/unit_tests/pcg_list.tst b/scilab/modules/sparse/tests/unit_tests/pcg_list.tst index 94bd11b..86a4517 100644 --- a/scilab/modules/sparse/tests/unit_tests/pcg_list.tst +++ b/scilab/modules/sparse/tests/unit_tests/pcg_list.tst @@ -33,7 +33,7 @@ function y=Atimesx(x,mymatrix) y=mymatrix*x endfunction // With the default 10 iterations, the algorithm performs well -Alist = list(Atimesx,mymatrix) +Alist = list(Atimesx,mymatrix); [xcomputed, fail, err, iter, res]=pcg(Alist,b); xexpected=ones(10,1); if norm(xcomputed-xexpected)>10**3*%eps then pause,end -- 1.7.9.5