xref: /aosp_15_r20/external/eigen/test/product_trmm.cpp (revision bf2c37156dfe67e5dfebd6d394bad8b2ab5804d4)
1*bf2c3715SXin Li // This file is part of Eigen, a lightweight C++ template library
2*bf2c3715SXin Li // for linear algebra.
3*bf2c3715SXin Li //
4*bf2c3715SXin Li // Copyright (C) 2008-2009 Gael Guennebaud <[email protected]>
5*bf2c3715SXin Li //
6*bf2c3715SXin Li // This Source Code Form is subject to the terms of the Mozilla
7*bf2c3715SXin Li // Public License v. 2.0. If a copy of the MPL was not distributed
8*bf2c3715SXin Li // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
9*bf2c3715SXin Li 
10*bf2c3715SXin Li #include "main.h"
11*bf2c3715SXin Li 
12*bf2c3715SXin Li template<typename T>
get_random_size()13*bf2c3715SXin Li int get_random_size()
14*bf2c3715SXin Li {
15*bf2c3715SXin Li   const int factor = NumTraits<T>::ReadCost;
16*bf2c3715SXin Li   const int max_test_size = EIGEN_TEST_MAX_SIZE>2*factor ? EIGEN_TEST_MAX_SIZE/factor : EIGEN_TEST_MAX_SIZE;
17*bf2c3715SXin Li   return internal::random<int>(1,max_test_size);
18*bf2c3715SXin Li }
19*bf2c3715SXin Li 
20*bf2c3715SXin Li template<typename Scalar, int Mode, int TriOrder, int OtherOrder, int ResOrder, int OtherCols>
trmm(int rows=get_random_size<Scalar> (),int cols=get_random_size<Scalar> (),int otherCols=OtherCols==Dynamic?get_random_size<Scalar> ():OtherCols)21*bf2c3715SXin Li void trmm(int rows=get_random_size<Scalar>(),
22*bf2c3715SXin Li           int cols=get_random_size<Scalar>(),
23*bf2c3715SXin Li           int otherCols = OtherCols==Dynamic?get_random_size<Scalar>():OtherCols)
24*bf2c3715SXin Li {
25*bf2c3715SXin Li   typedef Matrix<Scalar,Dynamic,Dynamic,TriOrder> TriMatrix;
26*bf2c3715SXin Li   typedef Matrix<Scalar,Dynamic,OtherCols,OtherCols==1?ColMajor:OtherOrder> OnTheRight;
27*bf2c3715SXin Li   typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:OtherOrder> OnTheLeft;
28*bf2c3715SXin Li 
29*bf2c3715SXin Li   typedef Matrix<Scalar,Dynamic,OtherCols,OtherCols==1?ColMajor:ResOrder> ResXS;
30*bf2c3715SXin Li   typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:ResOrder> ResSX;
31*bf2c3715SXin Li 
32*bf2c3715SXin Li   TriMatrix  mat(rows,cols), tri(rows,cols), triTr(cols,rows), s1tri(rows,cols), s1triTr(cols,rows);
33*bf2c3715SXin Li 
34*bf2c3715SXin Li   OnTheRight  ge_right(cols,otherCols);
35*bf2c3715SXin Li   OnTheLeft   ge_left(otherCols,rows);
36*bf2c3715SXin Li   ResSX       ge_sx, ge_sx_save;
37*bf2c3715SXin Li   ResXS       ge_xs, ge_xs_save;
38*bf2c3715SXin Li 
39*bf2c3715SXin Li   Scalar s1 = internal::random<Scalar>(),
40*bf2c3715SXin Li          s2 = internal::random<Scalar>();
41*bf2c3715SXin Li 
42*bf2c3715SXin Li   mat.setRandom();
43*bf2c3715SXin Li   tri = mat.template triangularView<Mode>();
44*bf2c3715SXin Li   triTr = mat.transpose().template triangularView<Mode>();
45*bf2c3715SXin Li   s1tri = (s1*mat).template triangularView<Mode>();
46*bf2c3715SXin Li   s1triTr = (s1*mat).transpose().template triangularView<Mode>();
47*bf2c3715SXin Li   ge_right.setRandom();
48*bf2c3715SXin Li   ge_left.setRandom();
49*bf2c3715SXin Li 
50*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_xs = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
51*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_sx = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
52*bf2c3715SXin Li 
53*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
54*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
55*bf2c3715SXin Li 
56*bf2c3715SXin Li   if((Mode&UnitDiag)==0)
57*bf2c3715SXin Li     VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose()));
58*bf2c3715SXin Li 
59*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.transpose()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1triTr * (s2*ge_left.transpose()));
60*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_sx.noalias() = (s2*ge_left) * (s1*mat).template triangularView<Mode>(), (s2*ge_left)*s1tri);
61*bf2c3715SXin Li 
62*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate());
63*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate());
64*bf2c3715SXin Li 
65*bf2c3715SXin Li   ge_xs_save = ge_xs;
66*bf2c3715SXin Li   if((Mode&UnitDiag)==0)
67*bf2c3715SXin Li     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()) );
68*bf2c3715SXin Li   ge_xs_save = ge_xs;
69*bf2c3715SXin Li   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()) );
70*bf2c3715SXin Li   ge_sx.setRandom();
71*bf2c3715SXin Li   ge_sx_save = ge_sx;
72*bf2c3715SXin Li   if((Mode&UnitDiag)==0)
73*bf2c3715SXin Li     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());
74*bf2c3715SXin Li 
75*bf2c3715SXin Li   if((Mode&UnitDiag)==0)
76*bf2c3715SXin Li     VERIFY_IS_APPROX( ge_xs = (s1*mat).adjoint().template triangularView<Mode>() * ge_left.adjoint(), numext::conj(s1) * triTr.conjugate() * ge_left.adjoint());
77*bf2c3715SXin Li   VERIFY_IS_APPROX( ge_xs = (s1*mat).transpose().template triangularView<Mode>() * ge_left.adjoint(), s1triTr * ge_left.adjoint());
78*bf2c3715SXin Li 
79*bf2c3715SXin Li   // TODO check with sub-matrix expressions ?
80*bf2c3715SXin Li 
81*bf2c3715SXin Li   // destination with a non-default inner-stride
82*bf2c3715SXin Li   // see bug 1741
83*bf2c3715SXin Li   {
84*bf2c3715SXin Li     VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
85*bf2c3715SXin Li     typedef Matrix<Scalar,Dynamic,Dynamic> MatrixX;
86*bf2c3715SXin Li     MatrixX buffer(2*ge_xs.rows(),2*ge_xs.cols());
87*bf2c3715SXin Li     Map<ResXS,0,Stride<Dynamic,2> > map1(buffer.data(),ge_xs.rows(),ge_xs.cols(),Stride<Dynamic,2>(2*ge_xs.outerStride(),2));
88*bf2c3715SXin Li     buffer.setZero();
89*bf2c3715SXin Li     VERIFY_IS_APPROX( map1.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
90*bf2c3715SXin Li   }
91*bf2c3715SXin Li }
92*bf2c3715SXin Li 
93*bf2c3715SXin Li template<typename Scalar, int Mode, int TriOrder>
trmv(int rows=get_random_size<Scalar> (),int cols=get_random_size<Scalar> ())94*bf2c3715SXin Li void trmv(int rows=get_random_size<Scalar>(), int cols=get_random_size<Scalar>())
95*bf2c3715SXin Li {
96*bf2c3715SXin Li   trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(rows,cols,1);
97*bf2c3715SXin Li }
98*bf2c3715SXin Li 
99*bf2c3715SXin Li template<typename Scalar, int Mode, int TriOrder, int OtherOrder, int ResOrder>
trmm(int rows=get_random_size<Scalar> (),int cols=get_random_size<Scalar> (),int otherCols=get_random_size<Scalar> ())100*bf2c3715SXin Li void trmm(int rows=get_random_size<Scalar>(), int cols=get_random_size<Scalar>(), int otherCols = get_random_size<Scalar>())
101*bf2c3715SXin Li {
102*bf2c3715SXin Li   trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols);
103*bf2c3715SXin Li }
104*bf2c3715SXin Li 
105*bf2c3715SXin Li #define CALL_ALL_ORDERS(NB,SCALAR,MODE)                                             \
106*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,ColMajor,ColMajor>()));  \
107*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,ColMajor,RowMajor>()));  \
108*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,RowMajor,ColMajor>()));  \
109*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,RowMajor,RowMajor>()));  \
110*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,ColMajor,ColMajor>()));  \
111*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,ColMajor,RowMajor>()));  \
112*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,RowMajor,ColMajor>()));  \
113*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,RowMajor,RowMajor>()));  \
114*bf2c3715SXin Li   \
115*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_1,NB)((trmv<SCALAR, MODE, ColMajor>()));                   \
116*bf2c3715SXin Li   EIGEN_CAT(CALL_SUBTEST_1,NB)((trmv<SCALAR, MODE, RowMajor>()));
117*bf2c3715SXin Li 
118*bf2c3715SXin Li 
119*bf2c3715SXin Li #define CALL_ALL(NB,SCALAR)                 \
120*bf2c3715SXin Li   CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Upper)          \
121*bf2c3715SXin Li   CALL_ALL_ORDERS(EIGEN_CAT(2,NB),SCALAR,UnitUpper)      \
122*bf2c3715SXin Li   CALL_ALL_ORDERS(EIGEN_CAT(3,NB),SCALAR,StrictlyUpper)  \
123*bf2c3715SXin Li   CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Lower)          \
124*bf2c3715SXin Li   CALL_ALL_ORDERS(EIGEN_CAT(2,NB),SCALAR,UnitLower)      \
125*bf2c3715SXin Li   CALL_ALL_ORDERS(EIGEN_CAT(3,NB),SCALAR,StrictlyLower)
126*bf2c3715SXin Li 
127*bf2c3715SXin Li 
EIGEN_DECLARE_TEST(product_trmm)128*bf2c3715SXin Li EIGEN_DECLARE_TEST(product_trmm)
129*bf2c3715SXin Li {
130*bf2c3715SXin Li   for(int i = 0; i < g_repeat ; i++)
131*bf2c3715SXin Li   {
132*bf2c3715SXin Li     CALL_ALL(1,float);                //  EIGEN_SUFFIXES;11;111;21;121;31;131
133*bf2c3715SXin Li     CALL_ALL(2,double);               //  EIGEN_SUFFIXES;12;112;22;122;32;132
134*bf2c3715SXin Li     CALL_ALL(3,std::complex<float>);  //  EIGEN_SUFFIXES;13;113;23;123;33;133
135*bf2c3715SXin Li     CALL_ALL(4,std::complex<double>); //  EIGEN_SUFFIXES;14;114;24;124;34;134
136*bf2c3715SXin Li   }
137*bf2c3715SXin Li }
138