Slide 1

https://github.com/gapatino/Making-Your-Code-Faster-Cython-and-parallel-processing-in-the-Jupyter-Notebook

Making Your Code Faster: Cython and parallel processing in the Jupyter Notebook

PyData DC 2016Gustavo A. PatinoDepartment of Biomedical SciencesDepartment of NeurologyOakland University William Beaumont School of MedicineRochester, MIhttps://github.com/gapatino/Making-Your-Code-Faster-Cython-and-parallel-processing-in-the-Jupyter-Notebook

DisclaimerNo financial interests on any company or package that will be mentioned

Not a computer scientisthttps://github.com/gapatino/Making-Your-Code-Faster-Cython-and-parallel-processing-in-the-Jupyter-Notebook

Problem descriptionUsing Eulers method: y(n+1)=yn+(step_size*y)approximate the function y=x2 for a million pointsDetermine the minimum step size for the result to be within 1e-5 of the correct answer at the last point evaluatedNote how a step size of 1 means we will evaluate values of x between 0 and 1000000, while a step sizeof 0.001 means that x ranges from 0 to 1000https://github.com/gapatino/Making-Your-Code-Faster-Cython-and-parallel-processing-in-the-Jupyter-Notebook

https://github.com/gapatino/Making-Your-Code-Faster-Cython-and-parallel-processing-in-the-Jupyter-Notebook