Most of the especially fancy stuff is for large or stiff systems. When you have small nonstiff equations there’s not much you can do to speed up (even python’s Jax can compete for stuff like this). It’s also not really correct that FLINT is in general faster here. It is faster in the case with the specific type of callback used because DifferentialEquations.jl currently doesn’t yet have a way to specify a callback that you only want to hit once. For the one without callbacks, the algorithm Julia selects by default for this case (Vern8) is as fast any of the FLINT solvers.
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Interact with python -- f2py or ctypes? | 7 | 2676 | July 30, 2021 | |
|
Let's get fortran-lang/minpack into SciPy
|
11 | 2280 | July 1, 2022 | |
| Interfacing Fortran code from Python | 16 | 5503 | October 6, 2021 | |
|
Types from Fortran to Python via Opaque Pointers
|
29 | 1281 | November 20, 2023 | |
| Fortran package manager or python package manager? | 9 | 1124 | June 24, 2020 |