From ba5eecae53aa038374d1708573cf03a2df3f76f3 Mon Sep 17 00:00:00 2001 From: Jitse Niesen Date: Tue, 24 Jul 2012 15:17:59 +0100 Subject: Allow user to specify max number of iterations (bug #479). --- test/schur_complex.cpp | 18 +++++++++++++++++- 1 file changed, 17 insertions(+), 1 deletion(-) (limited to 'test/schur_complex.cpp') diff --git a/test/schur_complex.cpp b/test/schur_complex.cpp index a6f66ab02..4d5cbbfdf 100644 --- a/test/schur_complex.cpp +++ b/test/schur_complex.cpp @@ -1,7 +1,7 @@ // This file is part of Eigen, a lightweight C++ template library // for linear algebra. // -// Copyright (C) 2010 Jitse Niesen +// Copyright (C) 2010,2012 Jitse Niesen // // This Source Code Form is subject to the terms of the Mozilla // Public License v. 2.0. If a copy of the MPL was not distributed @@ -47,6 +47,22 @@ template void schur(int size = MatrixType::ColsAtCompileTim VERIFY_IS_EQUAL(cs1.matrixT(), cs2.matrixT()); VERIFY_IS_EQUAL(cs1.matrixU(), cs2.matrixU()); + // Test maximum number of iterations + ComplexSchur cs3; + cs3.compute(A, true, ComplexSchur::m_maxIterations * size); + VERIFY_IS_EQUAL(cs3.info(), Success); + VERIFY_IS_EQUAL(cs3.matrixT(), cs1.matrixT()); + VERIFY_IS_EQUAL(cs3.matrixU(), cs1.matrixU()); + cs3.compute(A, true, 1); + VERIFY_IS_EQUAL(cs3.info(), size > 1 ? NoConvergence : Success); + + MatrixType Atriangular = A; + Atriangular.template triangularView().setZero(); + cs3.compute(Atriangular, true, 1); // triangular matrices do not need any iterations + VERIFY_IS_EQUAL(cs3.info(), Success); + VERIFY_IS_EQUAL(cs3.matrixT(), Atriangular.template cast()); + VERIFY_IS_EQUAL(cs3.matrixU(), ComplexMatrixType::Identity(size, size)); + // Test computation of only T, not U ComplexSchur csOnlyT(A, false); VERIFY_IS_EQUAL(csOnlyT.info(), Success); -- cgit v1.2.3