now checking in test if Lobatto nodes are used to skip those that need a fix before passing

Author: Daniel Ruprecht

tests/test_imexsweeper.py

@@ -60,7 +60,6 @@ def setUp(self):
   # **** TESTS ****
   # ***************
 
-
   #
   # Check that a level object can be instantiated
   #
@@ -120,9 +119,11 @@ def test_sweepequalmatrix(self):
   #
   # Make sure the implemented update formula matches the matrix update formula
   #
-  @unittest.skip("Needs fix of issue #52 before passing")
   def test_updateformula(self):
 
+    if (self.swparams['collocation_class']==collclass.CollGaussLobatto):
+      raise unittest.SkipTest("Needs fix of issue #52 before passing for Gauss Lobatto nodes")
+
     step, level, problem, nnodes = self.setupLevelStepProblem()
     level.sweep.predict()
     u0full = np.array([ level.u[l].values.flatten() for l in range(1,nnodes+1) ])
@@ -206,8 +207,11 @@ def test_manysweepsequalmatrix(self):
   #
   # Make sure that update function for K sweeps computed from K-sweep matrix gives same result as K sweeps in node-to-node form plus compute_end_point
   #
-  @unittest.skip("Needs fix of issue #52 before passing")
   def test_maysweepupdate(self):
+
+    if (self.swparams['collocation_class']==collclass.CollGaussLobatto):
+      raise unittest.SkipTest("Needs fix of issue #52 before passing for Gauss Lobatto nodes")
+
     step, level, problem, nnodes = self.setupLevelStepProblem()
     step.levels[0].sweep.predict()
     u0full = np.array([ level.u[l].values.flatten() for l in range(1,nnodes+1) ])