From 9178e2bd54f64febb43025b9710387d2e98fea34 Mon Sep 17 00:00:00 2001 From: Jitse Niesen Date: Thu, 3 Jun 2010 22:59:57 +0100 Subject: Add info() method which can be queried to check whether iteration converged. --- test/schur_real.cpp | 11 +++++++++++ 1 file changed, 11 insertions(+) (limited to 'test/schur_real.cpp') diff --git a/test/schur_real.cpp b/test/schur_real.cpp index 116c8dbce..1e8c4b0ba 100644 --- a/test/schur_real.cpp +++ b/test/schur_real.cpp @@ -23,6 +23,7 @@ // Eigen. If not, see . #include "main.h" +#include #include template void verifyIsQuasiTriangular(const MatrixType& T) @@ -55,6 +56,7 @@ template void schur(int size = MatrixType::ColsAtCompileTim for(int counter = 0; counter < g_repeat; ++counter) { MatrixType A = MatrixType::Random(size, size); RealSchur schurOfA(A); + VERIFY_IS_EQUAL(schurOfA.info(), Success); MatrixType U = schurOfA.matrixU(); MatrixType T = schurOfA.matrixT(); verifyIsQuasiTriangular(T); @@ -65,19 +67,28 @@ template void schur(int size = MatrixType::ColsAtCompileTim RealSchur rsUninitialized; VERIFY_RAISES_ASSERT(rsUninitialized.matrixT()); VERIFY_RAISES_ASSERT(rsUninitialized.matrixU()); + VERIFY_RAISES_ASSERT(rsUninitialized.info()); // Test whether compute() and constructor returns same result MatrixType A = MatrixType::Random(size, size); RealSchur rs1; rs1.compute(A); RealSchur rs2(A); + VERIFY_IS_EQUAL(rs1.info(), Success); + VERIFY_IS_EQUAL(rs2.info(), Success); VERIFY_IS_EQUAL(rs1.matrixT(), rs2.matrixT()); VERIFY_IS_EQUAL(rs1.matrixU(), rs2.matrixU()); // Test computation of only T, not U RealSchur rsOnlyT(A, false); + VERIFY_IS_EQUAL(rsOnlyT.info(), Success); VERIFY_IS_EQUAL(rs1.matrixT(), rsOnlyT.matrixT()); VERIFY_RAISES_ASSERT(rsOnlyT.matrixU()); + + // Test matrix with NaN + A(0,0) = std::numeric_limits::quiet_NaN(); + RealSchur rsNaN(A); + VERIFY_IS_EQUAL(rsNaN.info(), NoConvergence); } void test_schur_real() -- cgit v1.2.3