Tae-Geun Kim

Hello. Thank you for your interest. The bottom line is, yes, I want to implement adaptive differential equation solver algorithms such as Runge-Kutta-Fehlberg, Dormand-Prince and etc. And it does not...

Sure. Any questions are always welcome!

@jonasvanderschaaf Thanks for great suggestion! I did not consider an effective algorithm for polynomial multiplication. Thank you again for your good point. I think the second idea is really attractive...

Oh, sorry for my mistake. I fixed it.

Hello! Thanks for your interest. Yes, but there is no specific due date. As you said, Cholesky decomposition is cool for speed so, it is worth implementing in peroxide. Unfortunately,...

I implemented *Cholesky Decomposition* in `Ver 0.30.11` :sunglasses: If you want to use it, refer to [Doc](https://peroxide.surge.sh/structure/matrix/index.html#cholesky-decomposition). **Caution**: Should use `O3` feature.

@pavhofman Thanks for the good point! It is caused from operation rule of `AD`. In example, `quad` function is given as follows: ```rust fn quad(x: &Vec, n: Vec) -> Option...

Thanks for great suggestion. I also felt inconvenience of optimization in peroxide. In fact, **the optimized function in one place** can be achieved by generic function. ```rust #[macro_use] extern crate...

Maybe there are four ways to achieve high performance. 1. **Reduce the number of iterations** : In this case, 50 max iters are enough. 2. **Reduce the number of wrappings**...

> Thanks! Regarding the jacobian - would that be possible to enter the jacobian matrix externally just like the optimized function, i.e. a closure? From what I have seen most...