aboutsummaryrefslogtreecommitdiffhomepage
path: root/test/jacobisvd.cpp
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2013-11-03 13:19:55 +0100
committerGravatar Gael Guennebaud <g.gael@free.fr>2013-11-03 13:19:55 +0100
commitad1dc50b5779f4e6f87eb9e5865ce6fcfcc5a828 (patch)
treebaedad2ca17396e7e8dba9234ba03c7a2768a54d /test/jacobisvd.cpp
parent019dcfc21dc74f0c735d72918731b5349a62a26a (diff)
Check for minimal norm solutions
Diffstat (limited to 'test/jacobisvd.cpp')
-rw-r--r--test/jacobisvd.cpp8
1 files changed, 1 insertions, 7 deletions
diff --git a/test/jacobisvd.cpp b/test/jacobisvd.cpp
index e378de477..a0d8562c1 100644
--- a/test/jacobisvd.cpp
+++ b/test/jacobisvd.cpp
@@ -125,13 +125,7 @@ void jacobisvd_solve(const MatrixType& m, unsigned int computationOptions)
RhsType3 rhs3 = C * rhs2;
JacobiSVD<MatrixType3, ColPivHouseholderQRPreconditioner> svd3(m3, computationOptions);
SolutionType x3 = svd3.solve(rhs3);
- if(svd3.rank()!=rank) {
- std::cout << m3 << "\n\n";
- std::cout << svd3.singularValues().transpose() << "\n";
- std::cout << svd3.rank() << " == " << rank << "\n";
- std::cout << x21.norm() << " == " << x3.norm() << "\n";
- }
-// VERIFY_IS_APPROX(m3*x3, rhs3);
+ VERIFY_IS_APPROX(m3*x3, rhs3);
VERIFY_IS_APPROX(m3*x21, rhs3);
VERIFY_IS_APPROX(m2*x3, rhs2);