product_mmtr.cpp File Reference
#include "main.h"

Macros

#define CHECK_MMTR(DEST, TRI, OP)
 

Functions

template<typename Scalar >
void mmtr (int size)
 
 EIGEN_DECLARE_TEST (product_mmtr)
 

Macro Definition Documentation

◆ CHECK_MMTR

#define CHECK_MMTR (   DEST,
  TRI,
  OP 
)
Value:
{ \
ref3 = DEST; \
ref2 = ref1 = DEST; \
DEST.template triangularView<TRI>() OP; \
ref1 OP; \
ref2.template triangularView<TRI>() = ref1.template triangularView<TRI>(); \
VERIFY_IS_APPROX(DEST, ref2); \
\
DEST = ref3; \
ref3 = ref2; \
ref3.diagonal() = DEST.diagonal(); \
DEST.template triangularView<TRI | ZeroDiag>() OP; \
VERIFY_IS_APPROX(DEST, ref3); \
}
#define OP(X)
Definition: common.h:54
void diagonal(const MatrixType &m)
Definition: diagonal.cpp:13
@ ZeroDiag
Definition: Constants.h:217
#define VERIFY_IS_APPROX(a, b)
Definition: integer_types.cpp:13

Function Documentation

◆ EIGEN_DECLARE_TEST()

EIGEN_DECLARE_TEST ( product_mmtr  )
104  {
105  for (int i = 0; i < g_repeat; i++) {
106  CALL_SUBTEST_1((mmtr<float>(internal::random<int>(1, EIGEN_TEST_MAX_SIZE))));
107  CALL_SUBTEST_2((mmtr<double>(internal::random<int>(1, EIGEN_TEST_MAX_SIZE))));
108  CALL_SUBTEST_3((mmtr<std::complex<float> >(internal::random<int>(1, EIGEN_TEST_MAX_SIZE / 2))));
109  CALL_SUBTEST_4((mmtr<std::complex<double> >(internal::random<int>(1, EIGEN_TEST_MAX_SIZE / 2))));
110  }
111 }
int i
Definition: BiCGSTAB_step_by_step.cpp:9
#define EIGEN_TEST_MAX_SIZE
Definition: boostmultiprec.cpp:16
static int g_repeat
Definition: main.h:191
void mmtr(int size)
Definition: product_mmtr.cpp:29
#define CALL_SUBTEST_3(FUNC)
Definition: split_test_helper.h:16
#define CALL_SUBTEST_1(FUNC)
Definition: split_test_helper.h:4
#define CALL_SUBTEST_2(FUNC)
Definition: split_test_helper.h:10
#define CALL_SUBTEST_4(FUNC)
Definition: split_test_helper.h:22

References CALL_SUBTEST_1, CALL_SUBTEST_2, CALL_SUBTEST_3, CALL_SUBTEST_4, EIGEN_TEST_MAX_SIZE, Eigen::g_repeat, i, and mmtr().

◆ mmtr()

template<typename Scalar >
void mmtr ( int  size)
29  {
30  typedef Matrix<Scalar, Dynamic, Dynamic, ColMajor> MatrixColMaj;
31  typedef Matrix<Scalar, Dynamic, Dynamic, RowMajor> MatrixRowMaj;
32 
33  DenseIndex othersize = internal::random<DenseIndex>(1, 200);
34 
35  MatrixColMaj matc = MatrixColMaj::Zero(size, size);
36  MatrixRowMaj matr = MatrixRowMaj::Zero(size, size);
37  MatrixColMaj ref1(size, size), ref2(size, size), ref3(size, size);
38 
39  MatrixColMaj soc(size, othersize);
40  soc.setRandom();
41  MatrixColMaj osc(othersize, size);
42  osc.setRandom();
43  MatrixRowMaj sor(size, othersize);
44  sor.setRandom();
45  MatrixRowMaj osr(othersize, size);
46  osr.setRandom();
47  MatrixColMaj sqc(size, size);
48  sqc.setRandom();
49  MatrixRowMaj sqr(size, size);
50  sqr.setRandom();
51 
52  Scalar s = internal::random<Scalar>();
53 
54  CHECK_MMTR(matc, Lower, = s * soc * sor.adjoint());
55  CHECK_MMTR(matc, Upper, = s * (soc * soc.adjoint()));
56  CHECK_MMTR(matr, Lower, = s * soc * soc.adjoint());
57  CHECK_MMTR(matr, Upper, = soc * (s * sor.adjoint()));
58 
59  CHECK_MMTR(matc, Lower, += s * soc * soc.adjoint());
60  CHECK_MMTR(matc, Upper, += s * (soc * sor.transpose()));
61  CHECK_MMTR(matr, Lower, += s * sor * soc.adjoint());
62  CHECK_MMTR(matr, Upper, += soc * (s * soc.adjoint()));
63 
64  CHECK_MMTR(matc, Lower, -= s * soc * soc.adjoint());
65  CHECK_MMTR(matc, Upper, -= s * (osc.transpose() * osc.conjugate()));
66  CHECK_MMTR(matr, Lower, -= s * soc * soc.adjoint());
67  CHECK_MMTR(matr, Upper, -= soc * (s * soc.adjoint()));
68 
69  CHECK_MMTR(matc, Lower, -= s * sqr * sqc.template triangularView<Upper>());
70  CHECK_MMTR(matc, Upper, = s * sqc * sqr.template triangularView<Upper>());
71  CHECK_MMTR(matc, Lower, += s * sqr * sqc.template triangularView<Lower>());
72  CHECK_MMTR(matc, Upper, = s * sqc * sqc.template triangularView<Lower>());
73 
74  CHECK_MMTR(matc, Lower, = (s * sqr).template triangularView<Upper>() * sqc);
75  CHECK_MMTR(matc, Upper, -= (s * sqc).template triangularView<Upper>() * sqc);
76  CHECK_MMTR(matc, Lower, = (s * sqr).template triangularView<Lower>() * sqc);
77  CHECK_MMTR(matc, Upper, += (s * sqc).template triangularView<Lower>() * sqc);
78 
79  // check aliasing
80  ref2 = ref1 = matc;
81  ref1 = sqc.adjoint() * matc * sqc;
82  ref2.template triangularView<Upper>() = ref1.template triangularView<Upper>();
83  matc.template triangularView<Upper>() = sqc.adjoint() * matc * sqc;
84  VERIFY_IS_APPROX(matc, ref2);
85 
86  ref2 = ref1 = matc;
87  ref1 = sqc * matc * sqc.adjoint();
88  ref2.template triangularView<Lower>() = ref1.template triangularView<Lower>();
89  matc.template triangularView<Lower>() = sqc * matc * sqc.adjoint();
90  VERIFY_IS_APPROX(matc, ref2);
91 
92  // destination with a non-default inner-stride
93  // see bug 1741
94  {
95  typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
96  MatrixX buffer(2 * size, 2 * size);
99  buffer.setZero();
100  CHECK_MMTR(map1, Lower, = s * soc * sor.adjoint());
101  }
102 }
Scalar Scalar int size
Definition: benchVecAdd.cpp:17
SCALAR Scalar
Definition: bench_gemm.cpp:45
A matrix or vector expression mapping an existing array of data.
Definition: Map.h:96
Holds strides information for Map.
Definition: Stride.h:55
@ Lower
Definition: Constants.h:211
@ Upper
Definition: Constants.h:213
RealScalar s
Definition: level1_cplx_impl.h:130
EIGEN_DEFAULT_DENSE_INDEX_TYPE DenseIndex
Definition: Meta.h:75
double Zero
Definition: pseudosolid_node_update_elements.cc:35
#define CHECK_MMTR(DEST, TRI, OP)
Definition: product_mmtr.cpp:12

References CHECK_MMTR, Eigen::Lower, s, size, Eigen::Upper, VERIFY_IS_APPROX, and oomph::PseudoSolidHelper::Zero.

Referenced by EIGEN_DECLARE_TEST().