product_trmm.cpp 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137
  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 T>
  11. int get_random_size()
  12. {
  13. const int factor = NumTraits<T>::ReadCost;
  14. const int max_test_size = EIGEN_TEST_MAX_SIZE>2*factor ? EIGEN_TEST_MAX_SIZE/factor : EIGEN_TEST_MAX_SIZE;
  15. return internal::random<int>(1,max_test_size);
  16. }
  17. template<typename Scalar, int Mode, int TriOrder, int OtherOrder, int ResOrder, int OtherCols>
  18. void trmm(int rows=get_random_size<Scalar>(),
  19. int cols=get_random_size<Scalar>(),
  20. int otherCols = OtherCols==Dynamic?get_random_size<Scalar>():OtherCols)
  21. {
  22. typedef Matrix<Scalar,Dynamic,Dynamic,TriOrder> TriMatrix;
  23. typedef Matrix<Scalar,Dynamic,OtherCols,OtherCols==1?ColMajor:OtherOrder> OnTheRight;
  24. typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:OtherOrder> OnTheLeft;
  25. typedef Matrix<Scalar,Dynamic,OtherCols,OtherCols==1?ColMajor:ResOrder> ResXS;
  26. typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:ResOrder> ResSX;
  27. TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows), s1tri(rows,cols), s1triTr(cols,rows);
  28. OnTheRight ge_right(cols,otherCols);
  29. OnTheLeft ge_left(otherCols,rows);
  30. ResSX ge_sx, ge_sx_save;
  31. ResXS ge_xs, ge_xs_save;
  32. Scalar s1 = internal::random<Scalar>(),
  33. s2 = internal::random<Scalar>();
  34. mat.setRandom();
  35. tri = mat.template triangularView<Mode>();
  36. triTr = mat.transpose().template triangularView<Mode>();
  37. s1tri = (s1*mat).template triangularView<Mode>();
  38. s1triTr = (s1*mat).transpose().template triangularView<Mode>();
  39. ge_right.setRandom();
  40. ge_left.setRandom();
  41. VERIFY_IS_APPROX( ge_xs = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
  42. VERIFY_IS_APPROX( ge_sx = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
  43. VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
  44. VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
  45. if((Mode&UnitDiag)==0)
  46. VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose()));
  47. VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.transpose()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1triTr * (s2*ge_left.transpose()));
  48. VERIFY_IS_APPROX( ge_sx.noalias() = (s2*ge_left) * (s1*mat).template triangularView<Mode>(), (s2*ge_left)*s1tri);
  49. VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate());
  50. VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate());
  51. ge_xs_save = ge_xs;
  52. if((Mode&UnitDiag)==0)
  53. VERIFY_IS_APPROX( (ge_xs_save + s1*triTr.conjugate() * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()) );
  54. ge_xs_save = ge_xs;
  55. VERIFY_IS_APPROX( (ge_xs_save + s1triTr * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.transpose()).template triangularView<Mode>() * (s2*ge_left.adjoint()) );
  56. ge_sx.setRandom();
  57. ge_sx_save = ge_sx;
  58. if((Mode&UnitDiag)==0)
  59. VERIFY_IS_APPROX( ge_sx_save - (ge_right.adjoint() * (-s1 * triTr).conjugate()).eval(), ge_sx.noalias() -= (ge_right.adjoint() * (-s1 * mat).adjoint().template triangularView<Mode>()).eval());
  60. if((Mode&UnitDiag)==0)
  61. VERIFY_IS_APPROX( ge_xs = (s1*mat).adjoint().template triangularView<Mode>() * ge_left.adjoint(), numext::conj(s1) * triTr.conjugate() * ge_left.adjoint());
  62. VERIFY_IS_APPROX( ge_xs = (s1*mat).transpose().template triangularView<Mode>() * ge_left.adjoint(), s1triTr * ge_left.adjoint());
  63. // TODO check with sub-matrix expressions ?
  64. // destination with a non-default inner-stride
  65. // see bug 1741
  66. {
  67. VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
  68. typedef Matrix<Scalar,Dynamic,Dynamic> MatrixX;
  69. MatrixX buffer(2*ge_xs.rows(),2*ge_xs.cols());
  70. Map<ResXS,0,Stride<Dynamic,2> > map1(buffer.data(),ge_xs.rows(),ge_xs.cols(),Stride<Dynamic,2>(2*ge_xs.outerStride(),2));
  71. buffer.setZero();
  72. VERIFY_IS_APPROX( map1.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
  73. }
  74. }
  75. template<typename Scalar, int Mode, int TriOrder>
  76. void trmv(int rows=get_random_size<Scalar>(), int cols=get_random_size<Scalar>())
  77. {
  78. trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(rows,cols,1);
  79. }
  80. template<typename Scalar, int Mode, int TriOrder, int OtherOrder, int ResOrder>
  81. void trmm(int rows=get_random_size<Scalar>(), int cols=get_random_size<Scalar>(), int otherCols = get_random_size<Scalar>())
  82. {
  83. trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols);
  84. }
  85. #define CALL_ALL_ORDERS(NB,SCALAR,MODE) \
  86. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,ColMajor,ColMajor>())); \
  87. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,ColMajor,RowMajor>())); \
  88. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,RowMajor,ColMajor>())); \
  89. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,RowMajor,RowMajor>())); \
  90. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,ColMajor,ColMajor>())); \
  91. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,ColMajor,RowMajor>())); \
  92. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,RowMajor,ColMajor>())); \
  93. EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,RowMajor,RowMajor>())); \
  94. \
  95. EIGEN_CAT(CALL_SUBTEST_1,NB)((trmv<SCALAR, MODE, ColMajor>())); \
  96. EIGEN_CAT(CALL_SUBTEST_1,NB)((trmv<SCALAR, MODE, RowMajor>()));
  97. #define CALL_ALL(NB,SCALAR) \
  98. CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Upper) \
  99. CALL_ALL_ORDERS(EIGEN_CAT(2,NB),SCALAR,UnitUpper) \
  100. CALL_ALL_ORDERS(EIGEN_CAT(3,NB),SCALAR,StrictlyUpper) \
  101. CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Lower) \
  102. CALL_ALL_ORDERS(EIGEN_CAT(2,NB),SCALAR,UnitLower) \
  103. CALL_ALL_ORDERS(EIGEN_CAT(3,NB),SCALAR,StrictlyLower)
  104. EIGEN_DECLARE_TEST(product_trmm)
  105. {
  106. for(int i = 0; i < g_repeat ; i++)
  107. {
  108. CALL_ALL(1,float); // EIGEN_SUFFIXES;11;111;21;121;31;131
  109. CALL_ALL(2,double); // EIGEN_SUFFIXES;12;112;22;122;32;132
  110. CALL_ALL(3,std::complex<float>); // EIGEN_SUFFIXES;13;113;23;123;33;133
  111. CALL_ALL(4,std::complex<double>); // EIGEN_SUFFIXES;14;114;24;124;34;134
  112. }
  113. }