Changeset 90e540 for src/Dynamics/unittests

Timestamp:

Jul 20, 2017, 9:38:39 AM (8 years ago)

Author:

Frederik Heber <frederik.heber@…>

Branches:

ForceAnnealing_with_BondGraph_continued

Children:

ccbdf4

Parents:

6d7c73

git-author:

Frederik Heber <frederik.heber@…> (07/18/17 22:24:12)

git-committer:

Frederik Heber <frederik.heber@…> (07/20/17 09:38:39)

Message:

We now obtain weights via levmar minimization.

• this should yield the best possible weights within the interval of [1/n,1.].
• note that we cannot always get an exact solution because of this constraint.

File:

• src/Dynamics/unittests/BondVectorsUnitTest.cpp (modified) (2 diffs)

src/Dynamics/unittests/BondVectorsUnitTest.cpp

@@ -197 +197 @@
   CPPUNIT_ASSERT( fabs(weight_sum - 1.) < MYEPSILON );
   // check weight
-  CPPUNIT_ASSERT_EQUAL( weights[0], 1. );
+  CPPUNIT_ASSERT( fabs(weight_sum - 1.) < 1e-10 );
 }
 
@@ -289 +289 @@
   // check number of weights
   CPPUNIT_ASSERT_EQUAL( weights.size(), (size_t)5 );
-  // check sum of weights: one linear independent, two dependent vectors = 1 + 2*0.5
-  const double weight_sum = std::accumulate(weights.begin(), weights.end(), 0.);
-  CPPUNIT_ASSERT( fabs(weight_sum - 2.) < 1e-10 );
-}
+  // check sum of weights
+  const double weight_sum = std::accumulate(weights.begin(), weights.end(), 0.);
+  CPPUNIT_ASSERT( fabs(weights[0] - .372244) < 1e-6 );
+  CPPUNIT_ASSERT( fabs(weights[1] - .529694) < 1e-6 );
+  CPPUNIT_ASSERT( fabs(weights[2] - .2) < 1e-6 );
+  CPPUNIT_ASSERT( fabs(weights[3] - .248464) < 1e-6 );
+  CPPUNIT_ASSERT( fabs(weights[4] - .248464) < 1e-6 );
+}