aboutsummaryrefslogtreecommitdiffhomepage
path: root/test/product_extra.cpp
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2009-09-01 16:35:23 +0200
committerGravatar Gael Guennebaud <g.gael@free.fr>2009-09-01 16:35:23 +0200
commit5b8ffa4d46958d691042f2537cba4dd52f795bdc (patch)
tree839e4821a8838361fa58e2f734b507580928bd62 /test/product_extra.cpp
parent4d91229bdce3ab91ef25d853126989e4cd235b9f (diff)
clean a bit the previous commit which came from a patch queue,
and since it was my first try of the patch queue feature I did not managed to apply it with a good commit message, so here you go: * Add a ComplexSchur decomposition class built on top of HessenbergDecomposition * Add a ComplexEigenSolver built on top of ComplexSchur There are still a couple of FIXME but at least they work for any reasonable matrices, still have to extend the unit tests to stress them with nasty matrices...
Diffstat (limited to 'test/product_extra.cpp')
-rw-r--r--test/product_extra.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/test/product_extra.cpp b/test/product_extra.cpp
index 526dd210e..fcec362a5 100644
--- a/test/product_extra.cpp
+++ b/test/product_extra.cpp
@@ -59,7 +59,7 @@ template<typename MatrixType> void product_extra(const MatrixType& m)
// r0 = ei_random<int>(0,rows/2-1),
// r1 = ei_random<int>(rows/2,rows);
- VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval());
+ VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval());
VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval());
VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2);
VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2);