Roadmap

Missing bits:

• BMW-Vallado algotihm Python vs. Fortran: cases / sec
  • Almost done from https://github.com/poliastro/poliastro/blob/master/examples/Quickly%20solving%20Kepler's%20Problem%20in%20Python%20using%20numba.ipynb but need to redo the plots and the data. If the results between the wrapped Fortran version and a standalone program are very different, include them too.
• Izzo algorithm Python vs. Fortran: cases / sec
• f2py example
  • Get inspiration from these course notes http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/archived/archived-python-courses/pythonfortran and from poliastro 0.2 https://github.com/poliastro/poliastro/tree/0.2.x/poliastro/src
• Complete C/C++ extension examples
• Conclusions
• Finish slides