[136] | 1 | // This file is part of Eigen, a lightweight C++ template library
|
---|
| 2 | // for linear algebra.
|
---|
| 3 | //
|
---|
| 4 | // Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>
|
---|
| 5 | //
|
---|
| 6 | // This Source Code Form is subject to the terms of the Mozilla
|
---|
| 7 | // Public License v. 2.0. If a copy of the MPL was not distributed
|
---|
| 8 | // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
---|
| 9 |
|
---|
| 10 | #include "main.h"
|
---|
| 11 |
|
---|
| 12 | template<typename Scalar, int Size, int OtherSize> void symm(int size = Size, int othersize = OtherSize)
|
---|
| 13 | {
|
---|
| 14 | typedef Matrix<Scalar, Size, Size> MatrixType;
|
---|
| 15 | typedef Matrix<Scalar, Size, OtherSize> Rhs1;
|
---|
| 16 | typedef Matrix<Scalar, OtherSize, Size> Rhs2;
|
---|
| 17 | enum { order = OtherSize==1 ? 0 : RowMajor };
|
---|
| 18 | typedef Matrix<Scalar, Size, OtherSize,order> Rhs3;
|
---|
| 19 | typedef typename MatrixType::Index Index;
|
---|
| 20 |
|
---|
| 21 | Index rows = size;
|
---|
| 22 | Index cols = size;
|
---|
| 23 |
|
---|
| 24 | MatrixType m1 = MatrixType::Random(rows, cols),
|
---|
| 25 | m2 = MatrixType::Random(rows, cols), m3;
|
---|
| 26 |
|
---|
| 27 | m1 = (m1+m1.adjoint()).eval();
|
---|
| 28 |
|
---|
| 29 | Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize);
|
---|
| 30 | Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows);
|
---|
| 31 | Rhs3 rhs3 = Rhs3::Random(cols, othersize), rhs32(cols, othersize), rhs33(cols, othersize);
|
---|
| 32 |
|
---|
| 33 | Scalar s1 = internal::random<Scalar>(),
|
---|
| 34 | s2 = internal::random<Scalar>();
|
---|
| 35 |
|
---|
| 36 | m2 = m1.template triangularView<Lower>();
|
---|
| 37 | m3 = m2.template selfadjointView<Lower>();
|
---|
| 38 | VERIFY_IS_EQUAL(m1, m3);
|
---|
| 39 | VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
|
---|
| 40 | rhs13 = (s1*m1) * (s2*rhs1));
|
---|
| 41 |
|
---|
| 42 | m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12;
|
---|
| 43 | m3 = m2.template selfadjointView<Upper>();
|
---|
| 44 | VERIFY_IS_EQUAL(m1, m3);
|
---|
| 45 | VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1),
|
---|
| 46 | rhs13 += (s1*m1) * (s2*rhs1));
|
---|
| 47 |
|
---|
| 48 | m2 = m1.template triangularView<Lower>();
|
---|
| 49 | VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
|
---|
| 50 | rhs13 = (s1*m1) * (s2*rhs2.adjoint()));
|
---|
| 51 |
|
---|
| 52 | m2 = m1.template triangularView<Upper>();
|
---|
| 53 | VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()),
|
---|
| 54 | rhs13 = (s1*m1) * (s2*rhs2.adjoint()));
|
---|
| 55 |
|
---|
| 56 | m2 = m1.template triangularView<Upper>();
|
---|
| 57 | VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
|
---|
| 58 | rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint()));
|
---|
| 59 |
|
---|
| 60 | // test row major = <...>
|
---|
| 61 | m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12;
|
---|
| 62 | VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3),
|
---|
| 63 | rhs13 -= (s1*m1) * (s2 * rhs3));
|
---|
| 64 |
|
---|
| 65 | m2 = m1.template triangularView<Upper>();
|
---|
| 66 | VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(),
|
---|
| 67 | rhs13 = (s1*m1.adjoint()) * (s2*rhs3).conjugate());
|
---|
| 68 |
|
---|
| 69 |
|
---|
| 70 | m2 = m1.template triangularView<Upper>(); rhs13 = rhs12;
|
---|
| 71 | VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate()),
|
---|
| 72 | rhs13 += (s1*m1.adjoint()) * (s2*rhs3).conjugate());
|
---|
| 73 |
|
---|
| 74 | m2 = m1.template triangularView<Lower>();
|
---|
| 75 | VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1));
|
---|
| 76 | VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) * (s1*m1));
|
---|
| 77 |
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | void test_product_symm()
|
---|
| 81 | {
|
---|
| 82 | for(int i = 0; i < g_repeat ; i++)
|
---|
| 83 | {
|
---|
| 84 | CALL_SUBTEST_1(( symm<float,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
|
---|
| 85 | CALL_SUBTEST_2(( symm<double,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
|
---|
| 86 | CALL_SUBTEST_3(( symm<std::complex<float>,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2),internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2)) ));
|
---|
| 87 | CALL_SUBTEST_4(( symm<std::complex<double>,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2),internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2)) ));
|
---|
| 88 |
|
---|
| 89 | CALL_SUBTEST_5(( symm<float,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
|
---|
| 90 | CALL_SUBTEST_6(( symm<double,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
|
---|
| 91 | CALL_SUBTEST_7(( symm<std::complex<float>,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
|
---|
| 92 | CALL_SUBTEST_8(( symm<std::complex<double>,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
|
---|
| 93 | }
|
---|
| 94 | }
|
---|