From 1ff1bd69acc8f2d50348a57855c8ec35521590bd Mon Sep 17 00:00:00 2001
From: Jitse Niesen <jitse@maths.leeds.ac.uk>
Date: Fri, 4 Jun 2010 09:40:35 +0100
Subject: Schur decomposition of 1-by-1 always converges.

---
 test/schur_complex.cpp | 11 +++++++----
 1 file changed, 7 insertions(+), 4 deletions(-)

(limited to 'test/schur_complex.cpp')

diff --git a/test/schur_complex.cpp b/test/schur_complex.cpp
index 67c41d41f..7c4dcb21a 100644
--- a/test/schur_complex.cpp
+++ b/test/schur_complex.cpp
@@ -68,10 +68,13 @@ template<typename MatrixType> void schur(int size = MatrixType::ColsAtCompileTim
   VERIFY_IS_EQUAL(cs1.matrixT(), csOnlyT.matrixT());
   VERIFY_RAISES_ASSERT(csOnlyT.matrixU());
 
-  // Test matrix with NaN
-  A(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();
-  ComplexSchur<MatrixType> csNaN(A);
-  VERIFY_IS_EQUAL(csNaN.info(), NoConvergence);
+  if (size > 1)
+  {
+    // Test matrix with NaN
+    A(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();
+    ComplexSchur<MatrixType> csNaN(A);
+    VERIFY_IS_EQUAL(csNaN.info(), NoConvergence);
+  }
 }
 
 void test_schur_complex()
-- 
cgit v1.2.3