|
Thanks for the help, folks. Now that we've pretty comprehensively decided it can't be solved analytically, has anybody got any ideas on the best kind of numerical method for this kind of search-space?
At the moment we're using the bipolar method, simply because it was the easiest thing to code, but this is fairly slow as we need a high degree of accuracy. B and D are fixed for any given search and we are varying values of C to find a set A.
We have tried using linear interpolation, but that seemed to take even longer. Not sure if it might be best to use a combination of two different methods or something.
__________________
"No one was behaving from very Buddhist motives. Then, thought Pigsy, he was hardly a Buddha, nor was he a monkey. Presently, he was a pig spirit changed into a little girl pretending to be a little boy to be offered to a water monster. It was all very simple to a pig spirit."
|