Dynamic Programming in Python: Bayesian Blocks
Explores dynamic programming in Python through Bayesian Blocks, a method for creating adaptive histograms with optimal bin sizes.
Jake VanderPlas is an astronomer and open-source leader, serving as Director of Open Software at the University of Washington’s eScience Institute. He writes and builds widely used Python tools for data science, machine learning, and scientific computing.
66 articles from this blog
Explores dynamic programming in Python through Bayesian Blocks, a method for creating adaptive histograms with optimal bin sizes.
A tutorial on simulating and animating quantum mechanics in Python using the Schrodinger equation and the split-step Fourier method.
A technical comparison of Numba and Cython for accelerating Python code, including benchmarks and analysis of JIT vs. compiled approaches.
A tutorial on creating basic animations using Matplotlib's FuncAnimation, demonstrated with a moving sine wave.
Benchmarking Cython typed memoryviews vs ndarray syntax for array operations, focusing on inlining effects on performance.
Benchmarking Cython memoryviews for optimizing distance metric calculations in Python, comparing performance with NumPy and older Cython methods.