diff options
author | Gael Guennebaud <g.gael@free.fr> | 2010-05-19 16:35:34 +0200 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2010-05-19 16:35:34 +0200 |
commit | bf09fe55edd7114dfb150a8a9dbb62965e3e3201 (patch) | |
tree | 6db6c2a95f921f5ddd3a40c8e16a5990481bf627 /test/selfadjoint.cpp | |
parent | 08fbfa93e0ebfec9e0402ac12f007bb7955fbf5f (diff) |
fix selfadjoint to dense
Diffstat (limited to 'test/selfadjoint.cpp')
-rw-r--r-- | test/selfadjoint.cpp | 66 |
1 files changed, 66 insertions, 0 deletions
diff --git a/test/selfadjoint.cpp b/test/selfadjoint.cpp new file mode 100644 index 000000000..2eaf6d459 --- /dev/null +++ b/test/selfadjoint.cpp @@ -0,0 +1,66 @@ +// This file is triangularView of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@gmail.com> +// +// Eigen is free software; you can redistribute it and/or +// modify it under the terms of the GNU Lesser General Public +// License as published by the Free Software Foundation; either +// version 3 of the License, or (at your option) any later version. +// +// Alternatively, you can redistribute it and/or +// modify it under the terms of the GNU General Public License as +// published by the Free Software Foundation; either version 2 of +// the License, or (at your option) any later version. +// +// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY +// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS +// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the +// GNU General Public License for more details. +// +// You should have received a copy of the GNU Lesser General Public +// License and a copy of the GNU General Public License along with +// Eigen. If not, see <http://www.gnu.org/licenses/>. + +#include "main.h" + +// This file tests the basic selfadjointView API, +// the related products and decompositions are tested in specific files. + +template<typename MatrixType> void selfadjoint(const MatrixType& m) +{ + typedef typename MatrixType::Scalar Scalar; + typedef typename NumTraits<Scalar>::Real RealScalar; + + int rows = m.rows(); + int cols = m.cols(); + + MatrixType m1 = MatrixType::Random(rows, cols), + m3(rows, cols); + + m1.diagonal() = m1.diagonal().real().template cast<Scalar>(); + + // check selfadjoint to dense + m3 = m1.template selfadjointView<Upper>(); + VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>())); + VERIFY_IS_APPROX(m3, m3.adjoint()); + + + m3 = m1.template selfadjointView<Lower>(); + VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>())); + VERIFY_IS_APPROX(m3, m3.adjoint()); +} + +void test_selfadjoint() +{ + for(int i = 0; i < g_repeat ; i++) + { + EIGEN_UNUSED int s = ei_random<int>(1,20); + + CALL_SUBTEST_1( selfadjoint(Matrix<float, 1, 1>()) ); + CALL_SUBTEST_2( selfadjoint(Matrix<float, 2, 2>()) ); + CALL_SUBTEST_3( selfadjoint(Matrix3cf()) ); + CALL_SUBTEST_4( selfadjoint(MatrixXcd(s,s)) ); + CALL_SUBTEST_5( selfadjoint(Matrix<float,Dynamic,Dynamic,RowMajor>(s, s)) ); + } +} |