READ ME
This version contains the code for a minor arcs optimisation algorithm applied to a non-singular system of two cubic forms. It is used to verify the Hasse Principle for such a system in n variables, 39<=n<=48 (Birch's theorem can be used for n>48). Whilst there is some descriptive commentary in the code, there is a significantly more detailed description of what each function does (and how each function works) in the Appendix of my thesis. The theoretical derivation for the algorithim is also covered in Chapter 11 of the thesis.
This also contains a version of the algorithm using Mathematica's inbuilt functions. This is much faster and more space efficient than the Python algorithm, but is not open access. Both algorithms return the same values. It will only take up to a minute to run each n, and requires less than 1GB of RAM.
The Python version of the algorithm is quite space and time inefficient. It will likely take up to a day to run in total (around 2 hours for each n), and will require around 10-12GB of RAM. Future versions of the algorithm will aim to bring about significant space and time efficiency improvements. Only use the algorithm on a computer with at least this much RAM (otherwise it will crash).
A version of the code to just test n=39 is also included.