aboutsummaryrefslogtreecommitdiffhomepage
path: root/test/eigensolver_complex.cpp
diff options
context:
space:
mode:
authorGravatar Jitse Niesen <jitse@maths.leeds.ac.uk>2012-07-24 15:17:59 +0100
committerGravatar Jitse Niesen <jitse@maths.leeds.ac.uk>2012-07-24 15:17:59 +0100
commitba5eecae53aa038374d1708573cf03a2df3f76f3 (patch)
treeb1bb109190fc9b31cbbda8c227343170e2058307 /test/eigensolver_complex.cpp
parentb7ac053b9c1196bf775ca0ec45765f6262648c43 (diff)
Allow user to specify max number of iterations (bug #479).
Diffstat (limited to 'test/eigensolver_complex.cpp')
-rw-r--r--test/eigensolver_complex.cpp10
1 files changed, 10 insertions, 0 deletions
diff --git a/test/eigensolver_complex.cpp b/test/eigensolver_complex.cpp
index 0c2059512..a569d8507 100644
--- a/test/eigensolver_complex.cpp
+++ b/test/eigensolver_complex.cpp
@@ -59,6 +59,16 @@ template<typename MatrixType> void eigensolver(const MatrixType& m)
// another algorithm so results may differ slightly
verify_is_approx_upto_permutation(a.eigenvalues(), ei1.eigenvalues());
+ ComplexEigenSolver<MatrixType> ei2;
+ ei2.compute(a, true, ComplexSchur<MatrixType>::m_maxIterations * rows);
+ VERIFY_IS_EQUAL(ei2.info(), Success);
+ VERIFY_IS_EQUAL(ei2.eigenvectors(), ei1.eigenvectors());
+ VERIFY_IS_EQUAL(ei2.eigenvalues(), ei1.eigenvalues());
+ if (rows > 2) {
+ ei2.compute(a, true, 1);
+ VERIFY_IS_EQUAL(ei2.info(), NoConvergence);
+ }
+
ComplexEigenSolver<MatrixType> eiNoEivecs(a, false);
VERIFY_IS_EQUAL(eiNoEivecs.info(), Success);
VERIFY_IS_APPROX(ei1.eigenvalues(), eiNoEivecs.eigenvalues());