Bart de Koning

So I went down quite the rabbit hole to implement an algorithm for computing Gauss-Turán quadratures 😄 Find my code [here](https://gist.github.com/SouthEndMusic/06f9642095546d5e9c117667957ff47a). Here is the example from [1]: ```julia using DoubleFloats...

> automating the calculation of higher-order derivatives of integrands I struggled with that, I currently hardcode the derivatives of the integrands. I tried something like [this](https://discourse.julialang.org/t/automatic-differentiation-for-higher-order-derivatives/62337/9), but that is a...

Regarding cost: I updated my code and the example to work with any `AbstractFloat` type. I learned that `BigFloat` makes for very slow code because it leads to a lot...

I updated the code and the example above again. I added a macro for computing the first $n$ derivatives of a scalar function at once, maybe a nice feature for...

@DaniGlez I like the concept, although I cannot make any assumptions about the distribution of `t` in my application as it is user input without restrictions on this distribution (apart...

Maybe move the functionality to `FindFirstFunctions`?

A drawback of the current way flows and basin forcings are computed is that a vector for all these values is allocated at each timestep, while they are averaged over...

I just realized I made a wrong assumption about how `IntegratingCallback` and `IntegratingSumCallback` work. I thought that the integrand function was only evaluated at time points of the integrator, but...

Although this was a fun dive into creating a custom callback, it didn't reach its goal, namely reducing the complexity of the integration code.

After discussion with the RTC tools team we concluded the following: - [ ] It's fine for performance to have capacity constraints on all edges, not only the ones that...