// This file is part of Eigen, a lightweight C++ template library // for linear algebra. // // Copyright (C) 2011 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 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/. #include "main.h" #include template ::Scalar>::IsComplex> struct generateTestMatrix; // for real matrices, make sure none of the eigenvalues are negative template struct generateTestMatrix { static void run(MatrixType& result, typename MatrixType::Index size) { MatrixType mat = MatrixType::Random(size, size); EigenSolver es(mat); typename EigenSolver::EigenvalueType eivals = es.eigenvalues(); for (typename MatrixType::Index i = 0; i < size; ++i) { if (eivals(i).imag() == 0 && eivals(i).real() < 0) eivals(i) = -eivals(i); } result = (es.eigenvectors() * eivals.asDiagonal() * es.eigenvectors().inverse()).real(); } }; // for complex matrices, any matrix is fine template struct generateTestMatrix { static void run(MatrixType& result, typename MatrixType::Index size) { result = MatrixType::Random(size, size); } }; template void testMatrixSqrt(const MatrixType& m) { MatrixType A; generateTestMatrix::run(A, m.rows()); MatrixType sqrtA = A.sqrt(); VERIFY_IS_APPROX(sqrtA * sqrtA, A); } void test_matrix_square_root() { for (int i = 0; i < g_repeat; i++) { CALL_SUBTEST_1(testMatrixSqrt(Matrix3cf())); CALL_SUBTEST_2(testMatrixSqrt(MatrixXcd(12,12))); CALL_SUBTEST_3(testMatrixSqrt(Matrix4f())); CALL_SUBTEST_4(testMatrixSqrt(Matrix(9, 9))); CALL_SUBTEST_5(testMatrixSqrt(Matrix())); CALL_SUBTEST_5(testMatrixSqrt(Matrix,1,1>())); } }