product_symm.cpp 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  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. #include "main.h"
  10. template<typename Scalar, int Size, int OtherSize> void symm(int size = Size, int othersize = OtherSize)
  11. {
  12. typedef Matrix<Scalar, Size, Size> MatrixType;
  13. typedef Matrix<Scalar, Size, OtherSize> Rhs1;
  14. typedef Matrix<Scalar, OtherSize, Size> Rhs2;
  15. enum { order = OtherSize==1 ? 0 : RowMajor };
  16. typedef Matrix<Scalar, Size, OtherSize,order> Rhs3;
  17. Index rows = size;
  18. Index cols = size;
  19. MatrixType m1 = MatrixType::Random(rows, cols),
  20. m2 = MatrixType::Random(rows, cols), m3;
  21. m1 = (m1+m1.adjoint()).eval();
  22. Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize);
  23. Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows);
  24. Rhs3 rhs3 = Rhs3::Random(cols, othersize), rhs32(cols, othersize), rhs33(cols, othersize);
  25. Scalar s1 = internal::random<Scalar>(),
  26. s2 = internal::random<Scalar>();
  27. m2 = m1.template triangularView<Lower>();
  28. m3 = m2.template selfadjointView<Lower>();
  29. VERIFY_IS_EQUAL(m1, m3);
  30. VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
  31. rhs13 = (s1*m1) * (s2*rhs1));
  32. VERIFY_IS_APPROX(rhs12 = (s1*m2).transpose().template selfadjointView<Upper>() * (s2*rhs1),
  33. rhs13 = (s1*m1.transpose()) * (s2*rhs1));
  34. VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().transpose() * (s2*rhs1),
  35. rhs13 = (s1*m1.transpose()) * (s2*rhs1));
  36. VERIFY_IS_APPROX(rhs12 = (s1*m2).conjugate().template selfadjointView<Lower>() * (s2*rhs1),
  37. rhs13 = (s1*m1).conjugate() * (s2*rhs1));
  38. VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().conjugate() * (s2*rhs1),
  39. rhs13 = (s1*m1).conjugate() * (s2*rhs1));
  40. VERIFY_IS_APPROX(rhs12 = (s1*m2).adjoint().template selfadjointView<Upper>() * (s2*rhs1),
  41. rhs13 = (s1*m1).adjoint() * (s2*rhs1));
  42. VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().adjoint() * (s2*rhs1),
  43. rhs13 = (s1*m1).adjoint() * (s2*rhs1));
  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. m2 = m1.template triangularView<Lower>();
  50. VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
  51. rhs13 = (s1*m1) * (s2*rhs2.adjoint()));
  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. m2 = m1.template triangularView<Upper>();
  56. VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
  57. rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint()));
  58. // test row major = <...>
  59. m2 = m1.template triangularView<Lower>(); rhs32.setRandom(); rhs13 = rhs32;
  60. VERIFY_IS_APPROX(rhs32.noalias() -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3),
  61. rhs13 -= (s1*m1) * (s2 * rhs3));
  62. m2 = m1.template triangularView<Upper>();
  63. VERIFY_IS_APPROX(rhs32.noalias() = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(),
  64. rhs13 = (s1*m1.adjoint()) * (s2*rhs3).conjugate());
  65. m2 = m1.template triangularView<Upper>(); rhs13 = rhs12;
  66. VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate()),
  67. rhs13 += (s1*m1.adjoint()) * (s2*rhs3).conjugate());
  68. m2 = m1.template triangularView<Lower>();
  69. VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1));
  70. VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) * (s1*m1));
  71. // destination with a non-default inner-stride
  72. // see bug 1741
  73. {
  74. typedef Matrix<Scalar,Dynamic,Dynamic> MatrixX;
  75. MatrixX buffer(2*cols,2*othersize);
  76. Map<Rhs1,0,Stride<Dynamic,2> > map1(buffer.data(),cols,othersize,Stride<Dynamic,2>(2*rows,2));
  77. buffer.setZero();
  78. VERIFY_IS_APPROX( map1.noalias() = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
  79. rhs13 = (s1*m1) * (s2*rhs1));
  80. Map<Rhs2,0,Stride<Dynamic,2> > map2(buffer.data(),rhs22.rows(),rhs22.cols(),Stride<Dynamic,2>(2*rhs22.outerStride(),2));
  81. buffer.setZero();
  82. VERIFY_IS_APPROX(map2 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1));
  83. }
  84. }
  85. EIGEN_DECLARE_TEST(product_symm)
  86. {
  87. for(int i = 0; i < g_repeat ; i++)
  88. {
  89. CALL_SUBTEST_1(( symm<float,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
  90. CALL_SUBTEST_2(( symm<double,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
  91. 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)) ));
  92. 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)) ));
  93. CALL_SUBTEST_5(( symm<float,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
  94. CALL_SUBTEST_6(( symm<double,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
  95. CALL_SUBTEST_7(( symm<std::complex<float>,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
  96. CALL_SUBTEST_8(( symm<std::complex<double>,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) ));
  97. }
  98. }