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) 2010-2017 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 #define CHECK_MMTR(DEST, TRI, OP) { \
13*bf2c3715SXin Li ref3 = DEST; \
14*bf2c3715SXin Li ref2 = ref1 = DEST; \
15*bf2c3715SXin Li DEST.template triangularView<TRI>() OP; \
16*bf2c3715SXin Li ref1 OP; \
17*bf2c3715SXin Li ref2.template triangularView<TRI>() \
18*bf2c3715SXin Li = ref1.template triangularView<TRI>(); \
19*bf2c3715SXin Li VERIFY_IS_APPROX(DEST,ref2); \
20*bf2c3715SXin Li \
21*bf2c3715SXin Li DEST = ref3; \
22*bf2c3715SXin Li ref3 = ref2; \
23*bf2c3715SXin Li ref3.diagonal() = DEST.diagonal(); \
24*bf2c3715SXin Li DEST.template triangularView<TRI|ZeroDiag>() OP; \
25*bf2c3715SXin Li VERIFY_IS_APPROX(DEST,ref3); \
26*bf2c3715SXin Li }
27*bf2c3715SXin Li
mmtr(int size)28*bf2c3715SXin Li template<typename Scalar> void mmtr(int size)
29*bf2c3715SXin Li {
30*bf2c3715SXin Li typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> MatrixColMaj;
31*bf2c3715SXin Li typedef Matrix<Scalar,Dynamic,Dynamic,RowMajor> MatrixRowMaj;
32*bf2c3715SXin Li
33*bf2c3715SXin Li DenseIndex othersize = internal::random<DenseIndex>(1,200);
34*bf2c3715SXin Li
35*bf2c3715SXin Li MatrixColMaj matc = MatrixColMaj::Zero(size, size);
36*bf2c3715SXin Li MatrixRowMaj matr = MatrixRowMaj::Zero(size, size);
37*bf2c3715SXin Li MatrixColMaj ref1(size, size), ref2(size, size), ref3(size,size);
38*bf2c3715SXin Li
39*bf2c3715SXin Li MatrixColMaj soc(size,othersize); soc.setRandom();
40*bf2c3715SXin Li MatrixColMaj osc(othersize,size); osc.setRandom();
41*bf2c3715SXin Li MatrixRowMaj sor(size,othersize); sor.setRandom();
42*bf2c3715SXin Li MatrixRowMaj osr(othersize,size); osr.setRandom();
43*bf2c3715SXin Li MatrixColMaj sqc(size,size); sqc.setRandom();
44*bf2c3715SXin Li MatrixRowMaj sqr(size,size); sqr.setRandom();
45*bf2c3715SXin Li
46*bf2c3715SXin Li Scalar s = internal::random<Scalar>();
47*bf2c3715SXin Li
48*bf2c3715SXin Li CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint());
49*bf2c3715SXin Li CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint()));
50*bf2c3715SXin Li CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint());
51*bf2c3715SXin Li CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint()));
52*bf2c3715SXin Li
53*bf2c3715SXin Li CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint());
54*bf2c3715SXin Li CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose()));
55*bf2c3715SXin Li CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint());
56*bf2c3715SXin Li CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint()));
57*bf2c3715SXin Li
58*bf2c3715SXin Li CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint());
59*bf2c3715SXin Li CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate()));
60*bf2c3715SXin Li CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint());
61*bf2c3715SXin Li CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint()));
62*bf2c3715SXin Li
63*bf2c3715SXin Li CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>());
64*bf2c3715SXin Li CHECK_MMTR(matc, Upper, = s*sqc*sqr.template triangularView<Upper>());
65*bf2c3715SXin Li CHECK_MMTR(matc, Lower, += s*sqr*sqc.template triangularView<Lower>());
66*bf2c3715SXin Li CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>());
67*bf2c3715SXin Li
68*bf2c3715SXin Li CHECK_MMTR(matc, Lower, = (s*sqr).template triangularView<Upper>()*sqc);
69*bf2c3715SXin Li CHECK_MMTR(matc, Upper, -= (s*sqc).template triangularView<Upper>()*sqc);
70*bf2c3715SXin Li CHECK_MMTR(matc, Lower, = (s*sqr).template triangularView<Lower>()*sqc);
71*bf2c3715SXin Li CHECK_MMTR(matc, Upper, += (s*sqc).template triangularView<Lower>()*sqc);
72*bf2c3715SXin Li
73*bf2c3715SXin Li // check aliasing
74*bf2c3715SXin Li ref2 = ref1 = matc;
75*bf2c3715SXin Li ref1 = sqc.adjoint() * matc * sqc;
76*bf2c3715SXin Li ref2.template triangularView<Upper>() = ref1.template triangularView<Upper>();
77*bf2c3715SXin Li matc.template triangularView<Upper>() = sqc.adjoint() * matc * sqc;
78*bf2c3715SXin Li VERIFY_IS_APPROX(matc, ref2);
79*bf2c3715SXin Li
80*bf2c3715SXin Li ref2 = ref1 = matc;
81*bf2c3715SXin Li ref1 = sqc * matc * sqc.adjoint();
82*bf2c3715SXin Li ref2.template triangularView<Lower>() = ref1.template triangularView<Lower>();
83*bf2c3715SXin Li matc.template triangularView<Lower>() = sqc * matc * sqc.adjoint();
84*bf2c3715SXin Li VERIFY_IS_APPROX(matc, ref2);
85*bf2c3715SXin Li
86*bf2c3715SXin Li // destination with a non-default inner-stride
87*bf2c3715SXin Li // see bug 1741
88*bf2c3715SXin Li {
89*bf2c3715SXin Li typedef Matrix<Scalar,Dynamic,Dynamic> MatrixX;
90*bf2c3715SXin Li MatrixX buffer(2*size,2*size);
91*bf2c3715SXin Li Map<MatrixColMaj,0,Stride<Dynamic,Dynamic> > map1(buffer.data(),size,size,Stride<Dynamic,Dynamic>(2*size,2));
92*bf2c3715SXin Li buffer.setZero();
93*bf2c3715SXin Li CHECK_MMTR(map1, Lower, = s*soc*sor.adjoint());
94*bf2c3715SXin Li }
95*bf2c3715SXin Li }
96*bf2c3715SXin Li
EIGEN_DECLARE_TEST(product_mmtr)97*bf2c3715SXin Li EIGEN_DECLARE_TEST(product_mmtr)
98*bf2c3715SXin Li {
99*bf2c3715SXin Li for(int i = 0; i < g_repeat ; i++)
100*bf2c3715SXin Li {
101*bf2c3715SXin Li CALL_SUBTEST_1((mmtr<float>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))));
102*bf2c3715SXin Li CALL_SUBTEST_2((mmtr<double>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))));
103*bf2c3715SXin Li CALL_SUBTEST_3((mmtr<std::complex<float> >(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2))));
104*bf2c3715SXin Li CALL_SUBTEST_4((mmtr<std::complex<double> >(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2))));
105*bf2c3715SXin Li }
106*bf2c3715SXin Li }
107