1 // This file is part of Eigen, a lightweight C++ template library
2 // for linear algebra.
3 //
4 // Copyright (C) 2009 Benoit Jacob <[email protected]>
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 using namespace std;
diagonalmatrices(const MatrixType & m)12 template<typename MatrixType> void diagonalmatrices(const MatrixType& m)
13 {
14 typedef typename MatrixType::Scalar Scalar;
15 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
16 typedef Matrix<Scalar, Rows, 1> VectorType;
17 typedef Matrix<Scalar, 1, Cols> RowVectorType;
18 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType;
19 typedef Matrix<Scalar, Dynamic, Dynamic> DynMatrixType;
20 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix;
21 typedef DiagonalMatrix<Scalar, Cols> RightDiagonalMatrix;
22 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
23 Index rows = m.rows();
24 Index cols = m.cols();
25
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
28 VectorType v1 = VectorType::Random(rows),
29 v2 = VectorType::Random(rows);
30 RowVectorType rv1 = RowVectorType::Random(cols),
31 rv2 = RowVectorType::Random(cols);
32
33 LeftDiagonalMatrix ldm1(v1), ldm2(v2);
34 RightDiagonalMatrix rdm1(rv1), rdm2(rv2);
35
36 Scalar s1 = internal::random<Scalar>();
37
38 SquareMatrixType sq_m1 (v1.asDiagonal());
39 VERIFY_IS_APPROX(sq_m1, v1.asDiagonal().toDenseMatrix());
40 sq_m1 = v1.asDiagonal();
41 VERIFY_IS_APPROX(sq_m1, v1.asDiagonal().toDenseMatrix());
42 SquareMatrixType sq_m2 = v1.asDiagonal();
43 VERIFY_IS_APPROX(sq_m1, sq_m2);
44
45 ldm1 = v1.asDiagonal();
46 LeftDiagonalMatrix ldm3(v1);
47 VERIFY_IS_APPROX(ldm1.diagonal(), ldm3.diagonal());
48 LeftDiagonalMatrix ldm4 = v1.asDiagonal();
49 VERIFY_IS_APPROX(ldm1.diagonal(), ldm4.diagonal());
50
51 sq_m1.block(0,0,rows,rows) = ldm1;
52 VERIFY_IS_APPROX(sq_m1, ldm1.toDenseMatrix());
53 sq_m1.transpose() = ldm1;
54 VERIFY_IS_APPROX(sq_m1, ldm1.toDenseMatrix());
55
56 Index i = internal::random<Index>(0, rows-1);
57 Index j = internal::random<Index>(0, cols-1);
58
59 VERIFY_IS_APPROX( ((ldm1 * m1)(i,j)) , ldm1.diagonal()(i) * m1(i,j) );
60 VERIFY_IS_APPROX( ((ldm1 * (m1+m2))(i,j)) , ldm1.diagonal()(i) * (m1+m2)(i,j) );
61 VERIFY_IS_APPROX( ((m1 * rdm1)(i,j)) , rdm1.diagonal()(j) * m1(i,j) );
62 VERIFY_IS_APPROX( ((v1.asDiagonal() * m1)(i,j)) , v1(i) * m1(i,j) );
63 VERIFY_IS_APPROX( ((m1 * rv1.asDiagonal())(i,j)) , rv1(j) * m1(i,j) );
64 VERIFY_IS_APPROX( (((v1+v2).asDiagonal() * m1)(i,j)) , (v1+v2)(i) * m1(i,j) );
65 VERIFY_IS_APPROX( (((v1+v2).asDiagonal() * (m1+m2))(i,j)) , (v1+v2)(i) * (m1+m2)(i,j) );
66 VERIFY_IS_APPROX( ((m1 * (rv1+rv2).asDiagonal())(i,j)) , (rv1+rv2)(j) * m1(i,j) );
67 VERIFY_IS_APPROX( (((m1+m2) * (rv1+rv2).asDiagonal())(i,j)) , (rv1+rv2)(j) * (m1+m2)(i,j) );
68
69 if(rows>1)
70 {
71 DynMatrixType tmp = m1.topRows(rows/2), res;
72 VERIFY_IS_APPROX( (res = m1.topRows(rows/2) * rv1.asDiagonal()), tmp * rv1.asDiagonal() );
73 VERIFY_IS_APPROX( (res = v1.head(rows/2).asDiagonal()*m1.topRows(rows/2)), v1.head(rows/2).asDiagonal()*tmp );
74 }
75
76 BigMatrix big;
77 big.setZero(2*rows, 2*cols);
78
79 big.block(i,j,rows,cols) = m1;
80 big.block(i,j,rows,cols) = v1.asDiagonal() * big.block(i,j,rows,cols);
81
82 VERIFY_IS_APPROX((big.block(i,j,rows,cols)) , v1.asDiagonal() * m1 );
83
84 big.block(i,j,rows,cols) = m1;
85 big.block(i,j,rows,cols) = big.block(i,j,rows,cols) * rv1.asDiagonal();
86 VERIFY_IS_APPROX((big.block(i,j,rows,cols)) , m1 * rv1.asDiagonal() );
87
88
89 // scalar multiple
90 VERIFY_IS_APPROX(LeftDiagonalMatrix(ldm1*s1).diagonal(), ldm1.diagonal() * s1);
91 VERIFY_IS_APPROX(LeftDiagonalMatrix(s1*ldm1).diagonal(), s1 * ldm1.diagonal());
92
93 VERIFY_IS_APPROX(m1 * (rdm1 * s1), (m1 * rdm1) * s1);
94 VERIFY_IS_APPROX(m1 * (s1 * rdm1), (m1 * rdm1) * s1);
95
96 // Diagonal to dense
97 sq_m1.setRandom();
98 sq_m2 = sq_m1;
99 VERIFY_IS_APPROX( (sq_m1 += (s1*v1).asDiagonal()), sq_m2 += (s1*v1).asDiagonal().toDenseMatrix() );
100 VERIFY_IS_APPROX( (sq_m1 -= (s1*v1).asDiagonal()), sq_m2 -= (s1*v1).asDiagonal().toDenseMatrix() );
101 VERIFY_IS_APPROX( (sq_m1 = (s1*v1).asDiagonal()), (s1*v1).asDiagonal().toDenseMatrix() );
102
103 sq_m1.setRandom();
104 sq_m2 = v1.asDiagonal();
105 sq_m2 = sq_m1 * sq_m2;
106 VERIFY_IS_APPROX( (sq_m1*v1.asDiagonal()).col(i), sq_m2.col(i) );
107 VERIFY_IS_APPROX( (sq_m1*v1.asDiagonal()).row(i), sq_m2.row(i) );
108
109 sq_m1 = v1.asDiagonal();
110 sq_m2 = v2.asDiagonal();
111 SquareMatrixType sq_m3 = v1.asDiagonal();
112 VERIFY_IS_APPROX( sq_m3 = v1.asDiagonal() + v2.asDiagonal(), sq_m1 + sq_m2);
113 VERIFY_IS_APPROX( sq_m3 = v1.asDiagonal() - v2.asDiagonal(), sq_m1 - sq_m2);
114 VERIFY_IS_APPROX( sq_m3 = v1.asDiagonal() - 2*v2.asDiagonal() + v1.asDiagonal(), sq_m1 - 2*sq_m2 + sq_m1);
115 }
116
as_scalar_product(const MatrixType & m)117 template<typename MatrixType> void as_scalar_product(const MatrixType& m)
118 {
119 typedef typename MatrixType::Scalar Scalar;
120 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
121 typedef Matrix<Scalar, Dynamic, Dynamic> DynMatrixType;
122 typedef Matrix<Scalar, Dynamic, 1> DynVectorType;
123 typedef Matrix<Scalar, 1, Dynamic> DynRowVectorType;
124
125 Index rows = m.rows();
126 Index depth = internal::random<Index>(1,EIGEN_TEST_MAX_SIZE);
127
128 VectorType v1 = VectorType::Random(rows);
129 DynVectorType dv1 = DynVectorType::Random(depth);
130 DynRowVectorType drv1 = DynRowVectorType::Random(depth);
131 DynMatrixType dm1 = dv1;
132 DynMatrixType drm1 = drv1;
133
134 Scalar s = v1(0);
135
136 VERIFY_IS_APPROX( v1.asDiagonal() * drv1, s*drv1 );
137 VERIFY_IS_APPROX( dv1 * v1.asDiagonal(), dv1*s );
138
139 VERIFY_IS_APPROX( v1.asDiagonal() * drm1, s*drm1 );
140 VERIFY_IS_APPROX( dm1 * v1.asDiagonal(), dm1*s );
141 }
142
143 template<int>
bug987()144 void bug987()
145 {
146 Matrix3Xd points = Matrix3Xd::Random(3, 3);
147 Vector2d diag = Vector2d::Random();
148 Matrix2Xd tmp1 = points.topRows<2>(), res1, res2;
149 VERIFY_IS_APPROX( res1 = diag.asDiagonal() * points.topRows<2>(), res2 = diag.asDiagonal() * tmp1 );
150 Matrix2d tmp2 = points.topLeftCorner<2,2>();
151 VERIFY_IS_APPROX(( res1 = points.topLeftCorner<2,2>()*diag.asDiagonal()) , res2 = tmp2*diag.asDiagonal() );
152 }
153
EIGEN_DECLARE_TEST(diagonalmatrices)154 EIGEN_DECLARE_TEST(diagonalmatrices)
155 {
156 for(int i = 0; i < g_repeat; i++) {
157 CALL_SUBTEST_1( diagonalmatrices(Matrix<float, 1, 1>()) );
158 CALL_SUBTEST_1( as_scalar_product(Matrix<float, 1, 1>()) );
159
160 CALL_SUBTEST_2( diagonalmatrices(Matrix3f()) );
161 CALL_SUBTEST_3( diagonalmatrices(Matrix<double,3,3,RowMajor>()) );
162 CALL_SUBTEST_4( diagonalmatrices(Matrix4d()) );
163 CALL_SUBTEST_5( diagonalmatrices(Matrix<float,4,4,RowMajor>()) );
164 CALL_SUBTEST_6( diagonalmatrices(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );
165 CALL_SUBTEST_6( as_scalar_product(MatrixXcf(1,1)) );
166 CALL_SUBTEST_7( diagonalmatrices(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );
167 CALL_SUBTEST_8( diagonalmatrices(Matrix<double,Dynamic,Dynamic,RowMajor>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );
168 CALL_SUBTEST_9( diagonalmatrices(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );
169 CALL_SUBTEST_9( diagonalmatrices(MatrixXf(1,1)) );
170 CALL_SUBTEST_9( as_scalar_product(MatrixXf(1,1)) );
171 }
172 CALL_SUBTEST_10( bug987<0>() );
173 }
174