17 return internal::random<int>(1,max_test_size);
20 template<
typename Scalar,
int Mode,
int TriOrder,
int OtherOrder,
int ResOrder,
int OtherCols>
22 int cols=get_random_size<Scalar>(),
23 int otherCols = OtherCols==
Dynamic?get_random_size<Scalar>():OtherCols)
34 OnTheRight ge_right(
cols,otherCols);
35 OnTheLeft ge_left(otherCols,
rows);
36 ResSX ge_sx, ge_sx_save;
37 ResXS ge_xs, ge_xs_save;
39 Scalar s1 = internal::random<Scalar>(),
40 s2 = internal::random<Scalar>();
43 tri =
mat.template triangularView<Mode>();
44 triTr =
mat.transpose().template triangularView<Mode>();
45 s1tri = (s1*
mat).
template triangularView<Mode>();
46 s1triTr = (s1*
mat).transpose().template triangularView<Mode>();
53 VERIFY_IS_APPROX( ge_xs.noalias() =
mat.template triangularView<Mode>() * ge_right, tri * ge_right);
54 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left *
mat.template triangularView<Mode>(), ge_left * tri);
57 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*
mat.adjoint()).
template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose()));
59 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*
mat.transpose()).
template triangularView<Mode>() * (s2*ge_left.transpose()), s1triTr * (s2*ge_left.transpose()));
60 VERIFY_IS_APPROX( ge_sx.noalias() = (s2*ge_left) * (s1*
mat).template triangularView<Mode>(), (s2*ge_left)*s1tri);
62 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate());
63 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate());
66 if((Mode&UnitDiag)==0)
67 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()) );
69 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()) );
72 if((Mode&UnitDiag)==0)
73 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());
75 if((Mode&UnitDiag)==0)
76 VERIFY_IS_APPROX( ge_xs = (s1*mat).adjoint().template triangularView<Mode>() * ge_left.adjoint(),
numext::conj(s1) * triTr.conjugate() * ge_left.adjoint());
77 VERIFY_IS_APPROX( ge_xs = (s1*mat).transpose().
template triangularView<Mode>() * ge_left.adjoint(), s1triTr * ge_left.adjoint());
83 template<
typename Scalar,
int Mode,
int TriOrder>
84 void trmv(
int rows=get_random_size<Scalar>(),
int cols=get_random_size<Scalar>())
86 trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(
rows,
cols,1);
89 template<
typename Scalar,
int Mode,
int TriOrder,
int OtherOrder,
int ResOrder>
90 void trmm(
int rows=get_random_size<Scalar>(),
int cols=get_random_size<Scalar>(),
int otherCols = get_random_size<Scalar>())
92 trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(
rows,
cols,otherCols);
95 #define CALL_ALL_ORDERS(NB,SCALAR,MODE) \ 96 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,ColMajor,ColMajor>())); \ 97 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,ColMajor,RowMajor>())); \ 98 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,RowMajor,ColMajor>())); \ 99 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, ColMajor,RowMajor,RowMajor>())); \ 100 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,ColMajor,ColMajor>())); \ 101 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,ColMajor,RowMajor>())); \ 102 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,RowMajor,ColMajor>())); \ 103 EIGEN_CAT(CALL_SUBTEST_,NB)((trmm<SCALAR, MODE, RowMajor,RowMajor,RowMajor>())); \ 105 EIGEN_CAT(CALL_SUBTEST_1,NB)((trmv<SCALAR, MODE, ColMajor>())); \ 106 EIGEN_CAT(CALL_SUBTEST_1,NB)((trmv<SCALAR, MODE, RowMajor>())); 109 #define CALL_ALL(NB,SCALAR) \ 110 CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Upper) \ 111 CALL_ALL_ORDERS(EIGEN_CAT(2,NB),SCALAR,UnitUpper) \ 112 CALL_ALL_ORDERS(EIGEN_CAT(3,NB),SCALAR,StrictlyUpper) \ 113 CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Lower) \ 114 CALL_ALL_ORDERS(EIGEN_CAT(2,NB),SCALAR,UnitLower) \ 115 CALL_ALL_ORDERS(EIGEN_CAT(3,NB),SCALAR,StrictlyLower)
void adjoint(const MatrixType &m)
Holds information about the various numeric (i.e. scalar) types allowed by Eigen. ...
#define VERIFY_IS_APPROX(a, b)
void trmm(int rows=get_random_size< Scalar >(), int cols=get_random_size< Scalar >(), int otherCols=OtherCols==Dynamic?get_random_size< Scalar >():OtherCols)
EIGEN_DEVICE_FUNC ConjugateReturnType conjugate() const
void trmv(int rows=get_random_size< Scalar >(), int cols=get_random_size< Scalar >())
#define CALL_ALL(NB, SCALAR)
Tridiagonalization< MatrixXf > tri
#define EIGEN_TEST_MAX_SIZE
internal::nested_eval< T, 1 >::type eval(const T &xpr)
The matrix class, also used for vectors and row-vectors.
ScalarWithExceptions conj(const ScalarWithExceptions &x)