diff options
| author |  Jitse Niesen <jitse@maths.leeds.ac.uk> | 2012-07-28 21:30:09 +0100 |
|---|---|---|
| committer | Jitse Niesen <jitse@maths.leeds.ac.uk> | 2012-07-28 21:30:09 +0100 |
| commit | 696b2f999f1fde11ad5dc49282e7450c693ba6db (patch) | |
| tree | 6f2532ac3cfbcbd2839ea3cbf964ec90af3e8ddd /test/schur_real.cpp | |
| parent | 6f54269829ce3bd13ea2f7a2e5d6d03b261c1cff (diff) | |
Eigenvalues module: Implement setMaxIterations() methods.
Diffstat (limited to 'test/schur_real.cpp')
| -rw-r--r-- | test/schur_real.cpp | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/test/schur_real.cpp b/test/schur_real.cpp index e81a28d7d..36b9c24d1 100644 --- a/test/schur_real.cpp +++ b/test/schur_real.cpp @@ -68,18 +68,19 @@ template<typename MatrixType> void schur(int size = MatrixType::ColsAtCompileTim // Test maximum number of iterations RealSchur<MatrixType> rs3; - rs3.compute(A, true, RealSchur<MatrixType>::m_maxIterations * size); + rs3.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A); VERIFY_IS_EQUAL(rs3.info(), Success); VERIFY_IS_EQUAL(rs3.matrixT(), rs1.matrixT()); VERIFY_IS_EQUAL(rs3.matrixU(), rs1.matrixU()); if (size > 2) { - rs3.compute(A, true, 1); + rs3.setMaxIterations(1).compute(A); VERIFY_IS_EQUAL(rs3.info(), NoConvergence); + VERIFY_IS_EQUAL(rs3.getMaxIterations(), 1); } MatrixType Atriangular = A; Atriangular.template triangularView<StrictlyLower>().setZero(); - rs3.compute(Atriangular, true, 1); // triangular matrices do not need any iterations + rs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations VERIFY_IS_EQUAL(rs3.info(), Success); VERIFY_IS_EQUAL(rs3.matrixT(), Atriangular); VERIFY_IS_EQUAL(rs3.matrixU(), MatrixType::Identity(size, size)); |