1 | // This file is part of Eigen, a lightweight C++ template library
|
---|
2 | // for linear algebra. Eigen itself is part of the KDE project.
|
---|
3 | //
|
---|
4 | // Copyright (C) 2008 Daniel Gomez Ferro <dgomezferro@gmail.com>
|
---|
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 "sparse.h"
|
---|
11 |
|
---|
12 | template<typename Scalar> void sparse_vector(int rows, int cols)
|
---|
13 | {
|
---|
14 | double densityMat = std::max(8./(rows*cols), 0.01);
|
---|
15 | double densityVec = std::max(8./float(rows), 0.1);
|
---|
16 | typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
|
---|
17 | typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
---|
18 | typedef SparseVector<Scalar> SparseVectorType;
|
---|
19 | typedef SparseMatrix<Scalar> SparseMatrixType;
|
---|
20 | Scalar eps = 1e-6;
|
---|
21 |
|
---|
22 | SparseMatrixType m1(rows,cols);
|
---|
23 | SparseVectorType v1(rows), v2(rows), v3(rows);
|
---|
24 | DenseMatrix refM1 = DenseMatrix::Zero(rows, cols);
|
---|
25 | DenseVector refV1 = DenseVector::Random(rows),
|
---|
26 | refV2 = DenseVector::Random(rows),
|
---|
27 | refV3 = DenseVector::Random(rows);
|
---|
28 |
|
---|
29 | std::vector<int> zerocoords, nonzerocoords;
|
---|
30 | initSparse<Scalar>(densityVec, refV1, v1, &zerocoords, &nonzerocoords);
|
---|
31 | initSparse<Scalar>(densityMat, refM1, m1);
|
---|
32 |
|
---|
33 | initSparse<Scalar>(densityVec, refV2, v2);
|
---|
34 | initSparse<Scalar>(densityVec, refV3, v3);
|
---|
35 |
|
---|
36 | Scalar s1 = ei_random<Scalar>();
|
---|
37 |
|
---|
38 | // test coeff and coeffRef
|
---|
39 | for (unsigned int i=0; i<zerocoords.size(); ++i)
|
---|
40 | {
|
---|
41 | VERIFY_IS_MUCH_SMALLER_THAN( v1.coeff(zerocoords[i]), eps );
|
---|
42 | //VERIFY_RAISES_ASSERT( v1.coeffRef(zerocoords[i]) = 5 );
|
---|
43 | }
|
---|
44 | {
|
---|
45 | VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
|
---|
46 | int j=0;
|
---|
47 | for (typename SparseVectorType::InnerIterator it(v1); it; ++it,++j)
|
---|
48 | {
|
---|
49 | VERIFY(nonzerocoords[j]==it.index());
|
---|
50 | VERIFY(it.value()==v1.coeff(it.index()));
|
---|
51 | VERIFY(it.value()==refV1.coeff(it.index()));
|
---|
52 | }
|
---|
53 | }
|
---|
54 | VERIFY_IS_APPROX(v1, refV1);
|
---|
55 |
|
---|
56 | v1.coeffRef(nonzerocoords[0]) = Scalar(5);
|
---|
57 | refV1.coeffRef(nonzerocoords[0]) = Scalar(5);
|
---|
58 | VERIFY_IS_APPROX(v1, refV1);
|
---|
59 |
|
---|
60 | VERIFY_IS_APPROX(v1+v2, refV1+refV2);
|
---|
61 | VERIFY_IS_APPROX(v1+v2+v3, refV1+refV2+refV3);
|
---|
62 |
|
---|
63 | VERIFY_IS_APPROX(v1*s1-v2, refV1*s1-refV2);
|
---|
64 |
|
---|
65 | VERIFY_IS_APPROX(v1*=s1, refV1*=s1);
|
---|
66 | VERIFY_IS_APPROX(v1/=s1, refV1/=s1);
|
---|
67 |
|
---|
68 | VERIFY_IS_APPROX(v1+=v2, refV1+=refV2);
|
---|
69 | VERIFY_IS_APPROX(v1-=v2, refV1-=refV2);
|
---|
70 |
|
---|
71 | VERIFY_IS_APPROX(v1.eigen2_dot(v2), refV1.eigen2_dot(refV2));
|
---|
72 | VERIFY_IS_APPROX(v1.eigen2_dot(refV2), refV1.eigen2_dot(refV2));
|
---|
73 |
|
---|
74 | }
|
---|
75 |
|
---|
76 | void test_eigen2_sparse_vector()
|
---|
77 | {
|
---|
78 | for(int i = 0; i < g_repeat; i++) {
|
---|
79 | CALL_SUBTEST_1( sparse_vector<double>(8, 8) );
|
---|
80 | CALL_SUBTEST_2( sparse_vector<std::complex<double> >(16, 16) );
|
---|
81 | CALL_SUBTEST_1( sparse_vector<double>(299, 535) );
|
---|
82 | }
|
---|
83 | }
|
---|
84 |
|
---|