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 (at) 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 typename NumTraits<Scalar>::Real RealScalar; 15 16 typedef Matrix<Scalar, Size, Size> MatrixType; 17 typedef Matrix<Scalar, Size, OtherSize> Rhs1; 18 typedef Matrix<Scalar, OtherSize, Size> Rhs2; 19 enum { order = OtherSize==1 ? 0 : RowMajor }; 20 typedef Matrix<Scalar, Size, OtherSize,order> Rhs3; 21 typedef typename MatrixType::Index Index; 22 23 Index rows = size; 24 Index cols = size; 25 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2 = MatrixType::Random(rows, cols), m3; 28 29 m1 = (m1+m1.adjoint()).eval(); 30 31 Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize); 32 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); 33 Rhs3 rhs3 = Rhs3::Random(cols, othersize), rhs32(cols, othersize), rhs33(cols, othersize); 34 35 Scalar s1 = internal::random<Scalar>(), 36 s2 = internal::random<Scalar>(); 37 38 m2 = m1.template triangularView<Lower>(); 39 m3 = m2.template selfadjointView<Lower>(); 40 VERIFY_IS_EQUAL(m1, m3); 41 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), 42 rhs13 = (s1*m1) * (s2*rhs1)); 43 44 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12; 45 m3 = m2.template selfadjointView<Upper>(); 46 VERIFY_IS_EQUAL(m1, m3); 47 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), 48 rhs13 += (s1*m1) * (s2*rhs1)); 49 50 m2 = m1.template triangularView<Lower>(); 51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), 52 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); 53 54 m2 = m1.template triangularView<Upper>(); 55 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), 56 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); 57 58 m2 = m1.template triangularView<Upper>(); 59 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), 60 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); 61 62 // test row major = <...> 63 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12; 64 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3), 65 rhs13 -= (s1*m1) * (s2 * rhs3)); 66 67 m2 = m1.template triangularView<Upper>(); 68 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(), 69 rhs13 = (s1*m1.adjoint()) * (s2*rhs3).conjugate()); 70 71 72 m2 = m1.template triangularView<Upper>(); rhs13 = rhs12; 73 VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate()), 74 rhs13 += (s1*m1.adjoint()) * (s2*rhs3).conjugate()); 75 76 m2 = m1.template triangularView<Lower>(); 77 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); 78 VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) * (s1*m1)); 79 80 } 81 82 void test_product_symm() 83 { 84 for(int i = 0; i < g_repeat ; i++) 85 { 86 CALL_SUBTEST_1(( symm<float,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 87 CALL_SUBTEST_2(( symm<double,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 88 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)) )); 89 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)) )); 90 91 CALL_SUBTEST_5(( symm<float,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 92 CALL_SUBTEST_6(( symm<double,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 93 CALL_SUBTEST_7(( symm<std::complex<float>,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 94 CALL_SUBTEST_8(( symm<std::complex<double>,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 95 } 96 } 97
