Function Timing and Optimization: Numba Implementations for the BLonD Code

This report delves into implementing Numba functions and examines their efficiency. The focus is on evaluating Numba implementations as potential replacements for C++ functions within the BLonD Code. By leveraging Numba's just-in-time compilation for Python, we analyze performance gains and consider the feasibility of transitioning from established C++ functions. Through meticulous function timing, profiling, and benchmarking, this project aims to inform decisions regarding performance optimization in scientific computing. The results offer insights into the interplay between ease of implementation and computational performance. Notably, the speedup factor of C++ varies from 0.9 (sometimes slower than Numba) to 1.6, demonstrating the versatility and competitive nature of Numba in optimizing code execution.