summaryrefslogtreecommitdiff
path: root/test_bad_convergence.py
diff options
context:
space:
mode:
authorPaweł Redman <pawel.redman@gmail.com>2020-06-21 18:41:07 +0200
committerPaweł Redman <pawel.redman@gmail.com>2020-06-21 18:41:07 +0200
commit33278ad88f8290054aa2b421182019b9167f50ff (patch)
treed0fcab7a586f12722df829ae23e3489486715025 /test_bad_convergence.py
parentad2215aec514e3e7499b796945d554c51b55a019 (diff)
Move the solver to Colour and update all tests
Diffstat (limited to 'test_bad_convergence.py')
-rw-r--r--test_bad_convergence.py14
1 files changed, 0 insertions, 14 deletions
diff --git a/test_bad_convergence.py b/test_bad_convergence.py
deleted file mode 100644
index a47af5a..0000000
--- a/test_bad_convergence.py
+++ /dev/null
@@ -1,14 +0,0 @@
-import numpy as np
-from colour import *
-from gsoc_common import D65, D65_xy, jakob_hanika, model_sd, plot_comparison
-
-# A set of inputs that make the Nelder-Mead solver work really hard.
-# This might not be interesting in future versions of jakob_hanika.py, once
-# the solver is more reliable. Make sure you've checked out the latest commit
-# that updates *this* file.
-if __name__ == "__main__":
- XYZ = np.array([0.00263241, 0.00174905, 0.00092602])
- ccp0 = np.array([5.11263599, -2.65344447, -2.37301856])
-
- ccp, error = jakob_hanika(XYZ, D65, D65_xy, ccp0)
- plot_comparison(XYZ, model_sd(ccp), "Target", error, D65)