You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

96 lines
4.5 KiB

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