Ahmed wrote:
By "Symbolic Differentiation", do you mean "Automatic Differentiation"?
If so you can see the Julia language packages for AD "Automatic Differentiation" based on:
- dual numbers
- complex numbers (for precision)
Whoa, thanks a lot for this pointer!
Actually, I was looking for Symbolic differentiation
(
https://www.cs.utexas.edu/users/novak/asg-symdif.html ).
I didn't know there is a well-established difference between
'Symbolic' and 'Automatic' differentiation. A quite lucid
introduction to AS can be found on Wikipedia (
https://en.wikipedia.org/wiki/Automatic_differentiation).
Instrumenting a compiler to find first order backward differences
alongside the 'normal' result, using dual numbers, is natural to
the Forth way of thinking and (appears) trivial to implement.
It might be much more fundamental to circuit simulation and discrete
control than I originally thought, and maybe even a breakthrough.
There might be a relation with past Forth experiments to implement
'reverse computation' or running programs backwards in time (website
of Forth UK?). I'll have to review that work.
Admittedly, I knew about Julia's secret AD weapon, but as it was never
properly explained what people meant with it, I had come to suspect that
it was just another hype. There's a JuliaCon in Eindhoven soon that
I probably should attend.
-marcel
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)