2009-09-01 22:20:56 +08:00
|
|
|
// This file is part of Eigen, a lightweight C++ template library
|
2012-07-15 22:33:40 +08:00
|
|
|
// for linear algebra.
|
2009-09-01 22:20:56 +08:00
|
|
|
//
|
2010-06-25 05:21:58 +08:00
|
|
|
// Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>
|
2010-06-01 01:17:47 +08:00
|
|
|
// Copyright (C) 2010 Jitse Niesen <jitse@maths.leeds.ac.uk>
|
2009-09-01 22:20:56 +08:00
|
|
|
//
|
2012-07-14 02:42:47 +08:00
|
|
|
// 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
|
|
|
|
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
2009-09-01 22:20:56 +08:00
|
|
|
|
|
|
|
#include "main.h"
|
2010-06-04 05:59:57 +08:00
|
|
|
#include <limits>
|
2009-09-04 15:23:38 +08:00
|
|
|
#include <Eigen/Eigenvalues>
|
2009-09-01 22:20:56 +08:00
|
|
|
#include <Eigen/LU>
|
|
|
|
|
2015-07-20 21:34:06 +08:00
|
|
|
template<typename MatrixType> bool find_pivot(typename MatrixType::Scalar tol, MatrixType &diffs, Index col=0)
|
|
|
|
{
|
|
|
|
bool match = diffs.diagonal().sum() <= tol;
|
|
|
|
if(match || col==diffs.cols())
|
|
|
|
{
|
|
|
|
return match;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
Index n = diffs.cols();
|
|
|
|
std::vector<std::pair<Index,Index> > transpositions;
|
|
|
|
for(Index i=col; i<n; ++i)
|
|
|
|
{
|
|
|
|
Index best_index(0);
|
|
|
|
if(diffs.col(col).segment(col,n-i).minCoeff(&best_index) > tol)
|
|
|
|
break;
|
|
|
|
|
|
|
|
best_index += col;
|
|
|
|
|
|
|
|
diffs.row(col).swap(diffs.row(best_index));
|
|
|
|
if(find_pivot(tol,diffs,col+1)) return true;
|
|
|
|
diffs.row(col).swap(diffs.row(best_index));
|
|
|
|
|
|
|
|
// move current pivot to the end
|
|
|
|
diffs.row(n-(i-col)-1).swap(diffs.row(best_index));
|
|
|
|
transpositions.push_back(std::pair<Index,Index>(n-(i-col)-1,best_index));
|
|
|
|
}
|
|
|
|
// restore
|
|
|
|
for(Index k=transpositions.size()-1; k>=0; --k)
|
|
|
|
diffs.row(transpositions[k].first).swap(diffs.row(transpositions[k].second));
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check that two column vectors are approximately equal upto permutations.
|
|
|
|
* Initially, this method checked that the k-th power sums are equal for all k = 1, ..., vec1.rows(),
|
|
|
|
* however this strategy is numerically inacurate because of numerical cancellation issues.
|
|
|
|
*/
|
2010-05-25 00:43:50 +08:00
|
|
|
template<typename VectorType>
|
|
|
|
void verify_is_approx_upto_permutation(const VectorType& vec1, const VectorType& vec2)
|
|
|
|
{
|
2015-07-20 21:34:06 +08:00
|
|
|
typedef typename VectorType::Scalar Scalar;
|
|
|
|
typedef typename NumTraits<Scalar>::Real RealScalar;
|
2010-06-08 06:05:20 +08:00
|
|
|
|
2010-05-25 00:43:50 +08:00
|
|
|
VERIFY(vec1.cols() == 1);
|
|
|
|
VERIFY(vec2.cols() == 1);
|
|
|
|
VERIFY(vec1.rows() == vec2.rows());
|
2015-07-20 21:34:06 +08:00
|
|
|
|
|
|
|
Index n = vec1.rows();
|
|
|
|
RealScalar tol = test_precision<RealScalar>()*test_precision<RealScalar>()*numext::maxi(vec1.squaredNorm(),vec2.squaredNorm());
|
|
|
|
Matrix<RealScalar,Dynamic,Dynamic> diffs = (vec1.rowwise().replicate(n) - vec2.rowwise().replicate(n).transpose()).cwiseAbs2();
|
|
|
|
|
|
|
|
VERIFY( find_pivot(tol, diffs) );
|
2010-05-25 00:43:50 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-09-01 22:20:56 +08:00
|
|
|
template<typename MatrixType> void eigensolver(const MatrixType& m)
|
|
|
|
{
|
2010-06-20 23:37:56 +08:00
|
|
|
typedef typename MatrixType::Index Index;
|
2009-09-01 22:20:56 +08:00
|
|
|
/* this test covers the following files:
|
2009-09-01 22:35:23 +08:00
|
|
|
ComplexEigenSolver.h, and indirectly ComplexSchur.h
|
2009-09-01 22:20:56 +08:00
|
|
|
*/
|
2010-06-20 23:37:56 +08:00
|
|
|
Index rows = m.rows();
|
|
|
|
Index cols = m.cols();
|
2009-09-01 22:20:56 +08:00
|
|
|
|
|
|
|
typedef typename MatrixType::Scalar Scalar;
|
|
|
|
typedef typename NumTraits<Scalar>::Real RealScalar;
|
|
|
|
|
|
|
|
MatrixType a = MatrixType::Random(rows,cols);
|
2009-09-01 22:35:23 +08:00
|
|
|
MatrixType symmA = a.adjoint() * a;
|
2009-09-01 22:20:56 +08:00
|
|
|
|
2009-09-01 22:35:23 +08:00
|
|
|
ComplexEigenSolver<MatrixType> ei0(symmA);
|
2010-06-04 05:59:57 +08:00
|
|
|
VERIFY_IS_EQUAL(ei0.info(), Success);
|
2009-09-01 22:35:23 +08:00
|
|
|
VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal());
|
2009-09-01 22:20:56 +08:00
|
|
|
|
|
|
|
ComplexEigenSolver<MatrixType> ei1(a);
|
2010-06-04 05:59:57 +08:00
|
|
|
VERIFY_IS_EQUAL(ei1.info(), Success);
|
2009-09-01 22:20:56 +08:00
|
|
|
VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal());
|
2010-05-25 00:43:50 +08:00
|
|
|
// Note: If MatrixType is real then a.eigenvalues() uses EigenSolver and thus
|
|
|
|
// another algorithm so results may differ slightly
|
|
|
|
verify_is_approx_upto_permutation(a.eigenvalues(), ei1.eigenvalues());
|
2010-06-01 01:17:47 +08:00
|
|
|
|
2012-07-24 22:17:59 +08:00
|
|
|
ComplexEigenSolver<MatrixType> ei2;
|
2012-07-29 04:30:09 +08:00
|
|
|
ei2.setMaxIterations(ComplexSchur<MatrixType>::m_maxIterationsPerRow * rows).compute(a);
|
2012-07-24 22:17:59 +08:00
|
|
|
VERIFY_IS_EQUAL(ei2.info(), Success);
|
|
|
|
VERIFY_IS_EQUAL(ei2.eigenvectors(), ei1.eigenvectors());
|
|
|
|
VERIFY_IS_EQUAL(ei2.eigenvalues(), ei1.eigenvalues());
|
|
|
|
if (rows > 2) {
|
2012-07-29 04:30:09 +08:00
|
|
|
ei2.setMaxIterations(1).compute(a);
|
2012-07-24 22:17:59 +08:00
|
|
|
VERIFY_IS_EQUAL(ei2.info(), NoConvergence);
|
2012-07-29 04:30:09 +08:00
|
|
|
VERIFY_IS_EQUAL(ei2.getMaxIterations(), 1);
|
2012-07-24 22:17:59 +08:00
|
|
|
}
|
|
|
|
|
2010-06-01 01:17:47 +08:00
|
|
|
ComplexEigenSolver<MatrixType> eiNoEivecs(a, false);
|
2010-06-04 05:59:57 +08:00
|
|
|
VERIFY_IS_EQUAL(eiNoEivecs.info(), Success);
|
2010-06-01 01:17:47 +08:00
|
|
|
VERIFY_IS_APPROX(ei1.eigenvalues(), eiNoEivecs.eigenvalues());
|
|
|
|
|
2009-11-05 11:46:18 +08:00
|
|
|
// Regression test for issue #66
|
|
|
|
MatrixType z = MatrixType::Zero(rows,cols);
|
|
|
|
ComplexEigenSolver<MatrixType> eiz(z);
|
2009-11-19 01:15:19 +08:00
|
|
|
VERIFY((eiz.eigenvalues().cwiseEqual(0)).all());
|
2010-05-25 00:43:50 +08:00
|
|
|
|
|
|
|
MatrixType id = MatrixType::Identity(rows, cols);
|
|
|
|
VERIFY_IS_APPROX(id.operatorNorm(), RealScalar(1));
|
2010-06-04 05:59:57 +08:00
|
|
|
|
|
|
|
if (rows > 1)
|
|
|
|
{
|
|
|
|
// Test matrix with NaN
|
|
|
|
a(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();
|
|
|
|
ComplexEigenSolver<MatrixType> eiNaN(a);
|
|
|
|
VERIFY_IS_EQUAL(eiNaN.info(), NoConvergence);
|
|
|
|
}
|
2015-10-26 23:00:25 +08:00
|
|
|
|
|
|
|
// regression test for bug 1098
|
|
|
|
{
|
|
|
|
ComplexEigenSolver<MatrixType> eig(a.adjoint() * a);
|
|
|
|
eig.compute(a.adjoint() * a);
|
|
|
|
}
|
2009-09-01 22:20:56 +08:00
|
|
|
}
|
|
|
|
|
2010-06-01 01:17:47 +08:00
|
|
|
template<typename MatrixType> void eigensolver_verify_assert(const MatrixType& m)
|
2010-05-31 04:49:35 +08:00
|
|
|
{
|
|
|
|
ComplexEigenSolver<MatrixType> eig;
|
2010-06-01 01:17:47 +08:00
|
|
|
VERIFY_RAISES_ASSERT(eig.eigenvectors());
|
|
|
|
VERIFY_RAISES_ASSERT(eig.eigenvalues());
|
|
|
|
|
|
|
|
MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
|
|
|
eig.compute(a, false);
|
|
|
|
VERIFY_RAISES_ASSERT(eig.eigenvectors());
|
2010-05-31 04:49:35 +08:00
|
|
|
}
|
|
|
|
|
2009-09-01 22:20:56 +08:00
|
|
|
void test_eigensolver_complex()
|
|
|
|
{
|
2013-06-24 01:11:32 +08:00
|
|
|
int s = 0;
|
2009-09-01 22:20:56 +08:00
|
|
|
for(int i = 0; i < g_repeat; i++) {
|
2009-10-29 06:19:29 +08:00
|
|
|
CALL_SUBTEST_1( eigensolver(Matrix4cf()) );
|
2011-07-12 20:41:00 +08:00
|
|
|
s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);
|
|
|
|
CALL_SUBTEST_2( eigensolver(MatrixXcd(s,s)) );
|
2009-12-17 06:24:24 +08:00
|
|
|
CALL_SUBTEST_3( eigensolver(Matrix<std::complex<float>, 1, 1>()) );
|
2010-03-21 01:04:40 +08:00
|
|
|
CALL_SUBTEST_4( eigensolver(Matrix3f()) );
|
2015-02-18 18:30:44 +08:00
|
|
|
TEST_SET_BUT_UNUSED_VARIABLE(s)
|
2009-09-01 22:20:56 +08:00
|
|
|
}
|
2010-06-01 01:17:47 +08:00
|
|
|
CALL_SUBTEST_1( eigensolver_verify_assert(Matrix4cf()) );
|
2011-07-12 20:41:00 +08:00
|
|
|
s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);
|
|
|
|
CALL_SUBTEST_2( eigensolver_verify_assert(MatrixXcd(s,s)) );
|
2010-06-01 01:17:47 +08:00
|
|
|
CALL_SUBTEST_3( eigensolver_verify_assert(Matrix<std::complex<float>, 1, 1>()) );
|
|
|
|
CALL_SUBTEST_4( eigensolver_verify_assert(Matrix3f()) );
|
2010-05-31 04:49:35 +08:00
|
|
|
|
2010-04-21 23:15:57 +08:00
|
|
|
// Test problem size constructors
|
2013-06-24 01:11:32 +08:00
|
|
|
CALL_SUBTEST_5(ComplexEigenSolver<MatrixXf> tmp(s));
|
2011-10-31 11:55:20 +08:00
|
|
|
|
2013-06-25 17:42:04 +08:00
|
|
|
TEST_SET_BUT_UNUSED_VARIABLE(s)
|
2009-09-01 22:20:56 +08:00
|
|
|
}
|