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